ppxscal/embedding_network huggingface dataset:
On the complexity of the reflected logic of proofs
Authors: Nikolai V. Krupski
Venue: Theoretical Computer Science (2006)

Artemov's propositional logic of proofs LP captures all invariant properties of proof predicates "t is a proof of F" which are represented in LP as formulas t: F. Kuznets in [On the complexity of explicit modal logics, in: Computer Science Logic 2000, Lecture Notes in Computer Science, Vol. 1862, Springer, Berlin, 2000, pp. 371-383] showed that the satisfiability problem for LP belongs to the class Π2p of the polynomial hierarchy. In this paper we consider the reflected logic of proofs, rLP, consisting of formulas t: F derivable in LP. The system rLP is as expressible as LP itself, since every F derivable in LP is represented in rLP by t: F for an appropriate proof term t. We prove a better upper bound (NP) for the decision procedure in rLP. In addition we prove the disjunctive property for the original logic of proofs LP, thus answering a well-known question in this area.
Simulating growth dynamics in complex adaptive supply networks
Authors: Surya Dev Pathak, David M. Dilts, Gautam Biswas
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper discusses an extended adaptive supply network simulation model that explicitly captures growth (in terms of change in size over time, and birth and death) based on Utterback's (Utterback 1994) industrial growth model. The paper discusses the detailed behavioral modeling of the key components in the model with the help of statechart and decision tree representations. The design of a distributed, multi-paradigm, agent-based simulation that addresses the issue of scalability and computational efficiency is presented. The system is targeted to run on a supercomputing grid infrastructure at Vanderbilt University. We present a method for validating this model using an experimental design that models the growth dynamics of the US automobile industry supply network over the past 80 years. The experimental work is now in progress and the results and analysis of this work will be presented during the conference.
Example Based 3D Reconstruction from Single 2D Images
Authors: Tal Hassner, Ronen Basri
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present a novel solution to the problem of depth reconstruction from a single image. Single view 3D reconstruction is an ill-posed problem. We address this problem by using an example-based synthesis approach. Our method uses a database of objects from a single class (e.g. hands, human figures) containing example patches of feasible mappings from the appearance to the depth of each object. Given an image of a novel object, we combine the known depths of patches from similar objects to produce a plausible depth estimate. This is achieved by optimizing a global target function representing the likelihood of the candidate depth. We demonstrate how the variability of 3D shapes and their poses can be handled by updating the example database on-the-fly. In addition, we show how we can employ our method for the novel task of recovering an estimate for the occluded backside of the imaged objects. Finally, we present results on a variety of object classes and a range of imaging conditions.
Uncertainty relations for generalized quantum measurements and completely positive maps
Authors: M. Ozawa
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

The Heisenberg uncertainty relation for measurement noise and disturbance states that any position measurement with noise /spl epsiv/ brings the momentum disturbance not less than h/2/spl epsiv/. However, this relation holds only for restricted class of measurements. Here, a generalized uncertainty relation for measurement noise and disturbance is formalized and proven, which holds for all the possible quantum measurements. For this purpose, all the possible quantum measurements are characterized by naturally acceptable axioms. The measurement noise and disturbance are defined rigorously for any such general quantum measurements.
Linguistics and information theory: Analytic advantages
Authors: Julian Warner
Venue: Journal of the American Society for Information Science and Technology (2007)

The analytic advantages of central concepts from linguistics and information theory, and the analogies demonstrated between them, for understanding patterns of retrieval from full-text indexes to documents are developed. The interaction between the syntagm and the paradigm in computational operations on written language in indexing, searching, and retrieval is used to account for transformations of the signified or meaning between documents and their representation and between queries and documents retrieved. Characteristics of the message, and messages for selection for written language, are brought to explain the relative frequency of occurrence of words and multiple word sequences in documents. The examples given in the companion article are revisited and a fuller example introduced. The signified of the sequence stood for, the term classically used in the definitions of the sign, as something standing for something else, can itself change rapidly according to its syntagm. A greater than ordinary discourse understanding of patterns in retrieval is obtained. &copy; 2007 Wiley Periodicals, Inc.
Design and Realization of Embedded Image Transmission System Based on GPRS
Authors: Zhang Yong-qiang, Zhao Ji-chun, Wu ning
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The embedded image transmission system introduced in this paper is realized in Advanced RISC Machines (ARM9) platform and embedded Linux system which has excellent network function, and it is connected to net through the General Packet Radio Service (GPRS) module. Image is transmitted by Multimedia Messaging Service (MMS). MMS protocol stack, the design principle, the hardware structure and main software process to transmission image are introduced in detail, and put the system into wireless intellectual home safeguard control system, also it can be used in other watch field.
CoMiner: An Effective Algorithm for Mining Competitors from the Web
Authors: Rui Li, Shenghua Bao, Jin Wang, Yong Yu, Yunbo Cao
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

This paper attempts to accomplish a novel task of mining competitive information with respect to an entity (such as a company, product, person) from the web. An algorithm called "CoMiner" is proposed, which first extracts a set of comparative candidates of the input entity and then ranks them according to the comparability, and finally extracts the competitive fields. The experimental results show that the proposed algorithm drafts a complete picture of competitive relation of a given entity effectively.
DCT-Based Image Codec Embedded Cubic Spline Interpolation with Optimal Quantization
Authors: Tsung-Ching Lin, Trieu-Kien Truong, Shi-Huang Chen, Chien-Chang Lin, P. D. Chen
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This paper proposes an improved DCT-based image codec embedded cubic spline interpolation (CSI) with optimal quantization. It is shown in literature that CSI is superior in performance to the other interpolation functions. One of main applications of the CSI is to cooperate with standard DCT-based JPEG to obtain the modified JPEG codec and still obtain a better quality of the reconstructed image for higher compression ratios. This paper shows that the compression performance of such a modified JPEG codec can be further improved by the use of optimal quantization. The optimal quantization makes use of the rate distortion optimization algorithm to measure DCT coefficient statistic for an image generated from the CSI scheme and then construct a DCT quantization table for the given rate/distortion specification. Experimental results show that the proposed optimal quantization can achieve a better PSNR than that of the modified JPEG codec with a default quantization table.
MLBP: MAS for large-scale biometric pattern recognition
Authors: Ram Meshulam, Shulamit Reches, Aner Yarden, Sarit Kraus
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Security systems can observe and hear almost anyone every-where. However, it is impossible to employ an adequate number of human experts to analyze the information explosion. In this paper we present an autonomous multi-agent framework which, as an input, obtains biometric information acquired at a set of locations. The framework aims in real-time to point out individuals who act according to a suspicious pattern across these locations. The system works in large-scale scenarios. We present a scenario to demonstrate the usefulness of the framework. The goal is to point out individuals who visited a sequence of airports using face recognition algorithms. Simulation results show a high overall accuracy of our system in real-time.
Modular decomposition of complex interactions using games networks
Authors: Matthieu Manceny, Franck Delaplace
Venue: Proceeding from the 2006 workshop on Game theory for communications and networks (2006)

In this paper, we describe a modular game theoretical framework: the theory of games networks. Games networks extend non cooperative game theory by allowing agents to participate to several games simultaneously, what make possible the description of local interactions between agents. The theory enables us to formulate global interaction behaviors as composition of local interactions. This puts the emphasis on the way to decompose a game (viewed as a global structure of interactions) into a network of smaller games (viewed as local structures of interactions). The question of decomposition is significant for the understanding of complex systems whose dynamics is based on interactions between agents, such as biological networks. We describe an algorithm for this decomposition which modifies the network structure --- how agents are connected to games --- while preserving its dynamics --- identified by games network equilibria (Gne) which extend the notion of Nash equilibria to games networks. Games within the decomposed network represent basic building blocks whose interactions may explain how the system works.
What is the effect of position for VDT dynamic/static displays on users' reading comprehension?
Authors: An-Hsiang Wang, Kwo-Whei Lee, Yuan-Chang Hu
Venue: Proceedings of the conference on Information Visualization (2006)

The study investigated the effects of position (upper, below, right-hand, and left-hand side of the screen) for VDT dynamic display and other factors including speed (150, 200, 250, and 300 wpm), display type of dynamic information (leading, flash and RSVP), , and polarity combination of dynamic/static(black-on-white/black-onwhite, white-on-black/white-on-black, black-onwhite/ white-on-black, and white-on-black/black-on-white) on subjects' comprehension for reading static and dynamic display information. The result of this research showed that position and type of dynamic information had no significant effect on subjects' comprehension for dynamic and static information. Polarity combination and speed also had no significant effect on subjects' comprehension for static information; however, the two factors had significant effects on subjects' comprehension for dynamic information. When display speed was set at 200 wpm, subjects' comprehension was better than with at speed settings. When the dynamic/static display was set to be the same polarity combination (black-on-white/black-onwhite), subjects' performance was better than other polarity combinations.
Learning Feature Extraction and Classification for Tracking Multiple Objects: A Unified Framework
Authors: Xiaotong Yuan, Stan Z. Li
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

A great challenge in tracking multiple objects is how to locate each object when they interact and form a group. We view it as a binary classification problem. It is important to base the classification on the currently most discriminative features. We derive a unified framework for learning feature extraction and classification in appearance-spatial space for multiple object tracking. In this framework, both classifier design and feature evaluation are accomplished by minimizing an criterion which corresponds to an upperbound of classification error. There, the most discriminative features, as variables, minimize the criterion function, whereas the classifier, as a function, minimizes the criterion functional. The resulting system offers high accuracy for real-time tracking of nearby multiple objects in complex and dynamic scenes.
Fetal ECG Extraction Using Wavelet Transform
Authors: Hamid Hassanpour, Amin Parsaei
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper presents a new algorithm to extract the fetal ECG from an ECG recorded on the mother's abdomen. The algorithm consists of two steps: first, ECG of fetus is extracted from the original signal using a two-level wavelet transform. We use Daubechie wavelet transform, which is similar in shape to heart beat wave. The resulted signal is then low-pass filtered using the Savitzky-Golay smoothing filter to attenuate the effect of noise. The filtered signal is considered as the fetal ECG. The algorithm was applied on both synthetic and real ECG signals. The results in this paper show that the proposed algorithm has promising performance.
Web-Based Support System for Flood Response Operation
Authors: N. Katuk, Ku Mahamud K. Ruhana, N. Norwawi, S. Deris
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In most countries in the world, flood had caused damages to properties and it involved a large amount of loss to individuals and governments. During the flood, it is important to have efficient flood response operation system to manage all activities among different related agencies. In Malaysia, flood response operations are divided according to the jurisdiction of flood area. If the flood covers only one district, then it will be under the supervision of the respective district office, otherwise, when it covers multiple districts, the State Government Secretary Department will be responsible to monitor the situation. The related agencies applied manual flood data compilation and report generation. During emergency circumstances, fast and accurate electronic information system is highly desired to ensure that the appropriate support and assistance have been provided. This article focuses on web-based support system for flood response operations which offers fast and accurate information during flood emergency situation.
Web Mining of Relations from XML and Construct Database Schema
Authors: Xu Zhou, Xuezeng Pan, Yu Ren
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Increasing amount of commercial data is presented in XML format for exchanging or publishing on the web. It is emerging as a new standard for information representation and exchanging over the Internet. How to retrieve valuable information from XML documents on the web is a new challenge to data mining research. Compared with relational database, XML data in documents is stored as file with tree logical structure inside, it results in lower efficiency and performance in directly querying data. So it is still necessary to transform data into database (warehouse) for data mining afterwards. In this paper, we present a scheme to analyze relation of elements in XML on the web, and construct relational database schema based on the analysis. During the process, there would be a worthy accessory product -- a glossary, which can facilitate the process of data mining warehouse designing and building.
Service level agreements: an ontological approach
Authors: Les Green
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

This paper describes an ontology based Service Level Agreement formalisation. OWL and SWRL are chosen to express the ontologies. Use of the ontologies, discussing Ontology Adoption, SLA Instance Creation and Validation is given, followed by a breakdown and discussion of the concepts. Ontologies are grouped by generality and diagrammatic representations are given. The SLA ontology is discussed in context of the telecommunications domain.
Revolutionary impact of XML on biomedical information interoperability
Authors: A. Shabo, S. Rabinovici-Cohen, P. Vortman
Venue: IBM Systems Journal (2006)

The use of Extensible Markup Language (XML) to implement data sharing and semantic interoperability in healthcare and life sciences has become ubiquitous in recent years. Because in many areas there was no preexisting data format, XML has been readily embraced and is having a great impact. Biomedical data is very heterogeneous, varying from administrative information to clinical data, and recently to genomic data, making information exchange a great challenge. In particular, it is hard to achieve semantic interoperability among disparate and dispersed systems-a common constellation in the fragmented world of healthcare. Moreover, the emerging patient-centric and information-based medicine approach is posing another challenge-the development and use of an integrated health record for each patient. This means that diverse data from many systems has to be generated, integrated, and become available at the point of care. This paper presents the case that XML is becoming the integration "glue" for biomedical information interoperability, which can lead to improvements in pharmaceuticals, genomic-based clinical research, and personalized medicine, which, for the first time, can be fine-tuned to serve individuals through their longitudinal electronic health records.
A Framework for Inheritance Testing from VDM++ Specifications
Authors: Aamer Nadeem, Michael R. Lyu
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

The benefits offered by the use of formal methods are not limited to avoidance of specification errors and elimination of ambiguities onlya formal specification also provides a sound basis for generating test suites. Inheritance is a powerful mechanism in object-oriented paradigm by which a subclass inherits data and functionality of a super class. Testing of inheritance relationships is crucial in object-oriented testing, as an inheritance error may lead to subtle bugs such as due to overridden functionality. In this paper, we introduce a technique to generate test cases for inheritance testing, using a VDM++ formal specification. The proposed technique is based on the flattening of a VDM++ specification class, and then generating operation sequences from the trace structure specified in the VDM++ specification. The input space for each operation is partitioned, and a test model is constructed from the operation sequences and the input partitions. Test paths are generated from the test model, which cover the different operation sequences as well as the partitions. We also define various coverage criteria for test path generation.
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Authors: Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
Venue: Journal of Combinatorial Theory Series B (2006)

Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G - X has at least two non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjáček's line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is Hamiltonian.
Quantitative Analysis of Histopathological Features of Precancerous Lesion and Condition Using Image Processing Technique
Authors: A S. Jadhav, S Banerjee, P K. Dutta, R R. Paul, M Pal, P Banerjee, K Chaudhuri, J Chatterjee
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper aims at quantitative analysis of histopathological features of precancerous lesion and condition using image processing technique. The algorithm involves median and low pass filtering, segmentation by adaptive region growing, optimal and local thresholding, morphological operations such as opening and closing of gray scale and binary images and some numerical methods. Differentiation on the basis of type and level of precancerous type or condition is carried out based on image marker, defined as a vector of cancer related features viz. length and curvature of radius of rete-ridges and papillae, population density of cells within epithelium, etc. Implementation of presented algorithms is done in MATLAB. The results support quantitative analysis of pathological condition in respect with progression towards malignancy. This analysis may help in developing automated analysis tool.
Exact elliptic compactons in generalized Korteweg&ndash;De Vries equations: Research Articles
Authors: Fred Cooper, Avinash Khare, Avadh Saxena
Venue: Complexity (2006)

Using the action principle, and assuming a solitary wave of the generic form u(x,t) = AZ(&beta;(x + q(t)), we derive a general theorem relating the energy, momentum, and velocity of any solitary wave solution of the generalized Korteweg-De Vries equation K&ast;(l,p). Specifically we find that ${\dot q}=r(l,p)H/P$, where l,p are nonlinearity parameters. We also relate the amplitude, width, and momentum to the velocity of these solutions. We obtain the general condition for linear and Lyapunov stability. We then obtain a two-parameter family of exact solutions to these equations, which include elliptic and hyper-elliptic compacton solutions. For this general family we explicitly verify both the theorem and the stability criteria. &copy; 2006 Wiley Periodicals, Inc. Complexity 11: 30&ndash;34, 2006This paper was submitted as an invited paper resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois-Urbana Champaign, May 2005
Adaptive RLS filters with linear and quadratic constraints
Authors: J. Tuthill, Y. H. Leung, I. Thng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

In many adaptive signal processing applications, it is often desired to impose linear and quadratic constraints on the adaptive filter weights in order to meet certain performance criteria. The paper presents a modification of the well-known adaptive RLS or FLS algorithm to achieve this. By way of illustration, the paper considers an adaptive narrowband beamformer with first and second order spatial derivative constraints. The performance of the algorithm is studied via computer simulations.
Heuristics for the deterministic bidding problem
Authors: Amy Greenwald, Victor Naroditskiy
Venue: ACM SIGecom Exchanges (2006)

We study a suite of heuristics that were designed for bidding in the simultaneous auctions that characterize the Trading Agent Competition (TAC) Travel Game. At a high-level, the design of many successful TAC agents can be summarized as: (i) predict: build a model of the auctions' clearing prices, and (ii) optimize: solve for an (approximately) optimal set of bids, given this model. We focus on the optimization piece of this design.