ppxscal/embedding_network huggingface dataset:
A model for multimodal reference resolution
Authors: Luis. A. Pineda, E. Gabriela Garza
Venue: Referring Phenomena in a Multimedia Context and their Computational Treatment (1997)

In this paper a discussion on multimodal referent resolution is presented. The discussion is centered on the analysis of how the referent of an expression in one modality can be found whenever the contextual information required for carrying on such an inference is expressed in one or more different modalities. In particular, a model for identifying the referent of a graphical expression when the relevant contextual information is expressed through natural language is presented. The model is also applied to the reciprocal problem of identifying the referent of a linguistic expression whenever a graphical context is given. In Section 1 of this paper the notion of modality in terms of which the theory is developed is presented. The discussion is motivated with a case of study in multimodal reference resolution. In Section 2 a theory for multimodal representation along the lines of Montague's semiotic programme is presented. In Section 3, an incremental model for multimodal reference resolution is illustrated. In Section 4 a brief discussion of how the theory could be extended to handle multimodal discourse is advanced. Finally, in the conclusion of the paper, a reflexion on the relation between spacial deixis and anaphora is advanced.
On Refinement-Closed Security Properties and Nondeterministic Compositions
Authors: Toby Murray, Gavin Lowe
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Refinement-closed security properties allow the verification of systems for all possible implementations. Some systems, however, have refinements that do not represent possible implementations. In particular, real instantiations of abstract systems comprising security-critical components surrounded by maximally hostile unrefined components are often characterised only by compositions of refinements of the abstract system's components, rather than all refinements of the abstract system. In this case, refinement-closed security properties that examine multiple behaviours of a system at once can be falsely violated by the presence of inconsistent pairs of behaviour arising from different, incompatible refinements of the system's components. We show how to weaken a class of such properties, which includes both information flow and causation properties, to allow them to be applied to these sorts of abstract systems. The weakened properties ignore all pairs of inconsistent behaviour that would have violated the original property from which they are derived. We also show how to adapt existing automated tests for these properties to allow them to be used to test for their weakened counterparts instead. This enables greater flexibility in the application of these sorts of properties to compositions of nondeterministic components.
Termination Analysis by Program Inversion
Authors: Stefan Andrei
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Automatic methods for discovering program runtime and proving program termination have always been a challenging problem in computer science. We present here a novel and systematic approach for calculating an upper bound of the maximum runtime of functions for a non-trivial class of programs. The proof is based on an induction over a treeof execution traces - a new mathematical data structure. As a consequence, this can also show termination for these functions. The approach uses symbolic-numeric algorithms over a novel mathematical data structure, and can systematically find the maximum runtime for a wide class of functions.
Cognitive Architectures and Multi-agent Social Simulation
Authors: Ron Sun
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

As we know, a cognitive architecture is a domain-generic computational cognitive model that may be used for a broad analysis of cognition and behavior. Cognitive architectures embody theories of cognition in computer algorithms and programs. Social simulation with multi-agent systems can benefit from incorporating cognitive architectures, as they provide a realistic basis for modeling individual agents (as argued in Sun 2001). In this survey, an example cognitive architecture will be given, and its application to social simulation will be sketched.
A New Least Squares Subspace Projection Approach to Unmix Hyperspectral Data
Authors: Liaoying Zhao, Kai Zhang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Linearly constrained discriminant analysis (LCDA) and orthogonal subspace projection (OSP) are both explored in hyperspectral image classification and have shown promise in signature detection, discrimination and classification. However, the two subspace projection approaches cannot directly estimate the signature abundance. The OSP has been extended by a least squares orthogonal subspace projection (LSOSP) to estimate the signature abundance while LCDA has not. The solution of LCDA turns out to be a constrained version of OSP implemented with a data whitening process and the means of samples as signatures. Due to this fact, following the same idea for extending OSP to LSOSP, in this paper, a modified linearly constrained discriminant analysis (MLCDA) is proposed for unmixing hyperspectral data, which can directly estimate the signature abundance. Experiment results obtained from both artificial simulated and practical remote sensing data demonstrate that the MLCDA algorithm performs better than least squares method and the LSOSP.
A unified framework for representing logic program updates
Authors: Yan Zhang, Norman Foo
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

As a promising formulation to represent and reason about agents' dynamic behavious, logic program updates have been considerably studied recently. While similarities and differences between various approaches were discussed and evaluated by researchers, there is a lack of method to represent different logic program update approaches under a common framework. In this paper, we continue our study on a general framework for logic program conflict solving based on notions of strong and weak forgettings (Zhang, Foo, & Wang 2005). We show that all major logic program update approaches can be transformed into our framework, under which each update approach becomes a specific conflict solving case with certain constraints. We also investigate related computational properties for these transformations.
Kode ViciousBroken builds
Authors: George V. Neville-Neil
Venue: Communications of the ACM (2009)

Frequent broken builds could be symptomatic of deeper problems within a development project.
Human Perception of Near-Duplicate Videos
Authors: Rodrigo Oliveira, Mauro Cherubini, Nuria Oliver
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Popular content in video sharing websites (e.g., YouTube) contains many duplicates. Most scholars define near-duplicate video clips (NDVC) as identical videos with variations on non-semantic features (e.g., image/audio quality), while a few others also include semantic features (different videos of similar content). However, it is unclear what exact features contribute to human perception of similar videos. In this paper, we present the results of a user study conducted with 217 users of video sharing websites. Findings confirm the relevance of both classes of features, but the exact role played by semantics on each instance of NDVC is still an open question. In most cases, participants had a preference for one video when compared to its NDVC and they were more tolerant to changes in the audio than in the video channel.
Micro-payment Protocol Based on Multiple Hash Chains
Authors: Hong Wang, Jialin Ma, Jing Sun
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

With the development of Electronic commerce, more and more transactions on information goods or services have been or will be conducted through the Internet, which involve small value payment that called micro-payment. Therefore, micro-payment is one of the most popular research aspects with focus on the field of electronic payment. Many efficient micro-payment schemes were proposed based on PayWord which was designed by Ronald Rivest and Adi Shamir. The biggest virtue of PayWord is the adoption of hash operation instead of using public-key operations in per payment as much as possible. However, PayWord scheme has some drawbacks described as followed: firstly, generated e-coins only connecting with one particular vendor; secondly, only one unit value or one kind of currency is provided; and thirdly, PayWord scheme does not provide revocation mechanism. In this article, a new micro-payment protocol is introduced, which is also based on hash chain, but based on multiple hash chains to achieve the following goals: multiple unit value payment, multiple transactions and merchant and providing revocation sub-protocol.
The Biometric Passport: The Technical Requirements and Possibilities of Using
Authors: Piotr Porwik
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

This paper discusses the requirements, national regulations, and application requirements to introduction of a new biometric passport in the European Union (EU), especially in the Republic of Poland. The biometric passport is sometimes called e-passport. The biometric systems depend highly on the existing hardware biometrical technologies and its software components. Some important national solutions will be also described in this article.
The Research on Coupler Knuckle of High Speed and Heavy Haul
Authors: Zhanxun Song, Jilong Xie, Zhihua Li, Ning Zhu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The coupler knuckle is analyzed for modularized stress using ANSYS software in this paper. The maximum stress appears on the corner of coupler knuckle through internal solving system. Then the domestic and USA coupler knuckle materials’ performance are compared by experiments with the system of GPL-200. The experiment results show that the domestic material has lower fatigue performance and lower degree of scatter than USA material. At last, load spectrum is produced by the method of Monte-Carlo. Furthermore, it is used in the fatigue life prediction for both domestic and USA coupler knuckle.
Using Causality Relationships for a Progressive Management of Hazardous Phenomena with Sensor Networks
Authors: Nafaa Jabeur, Hedi Haddad
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Sensor networks prove extremely valuable in providing geo-information for any decision support system particularly those aiming to manage hazardous events. A thorough understanding and use of the semantics of this information allows for the identification and handling of impending hazardous events. An appropriate representation of the geo-information should boost this process. In this paper, we propose to encode causality relationships about natural phenomena and their effects in time and space with the concept of conceptual graphs. Using this encoding, we define the concepts of event and spatial propagation paths that enable the system to delimit the scope of sensed areas and use of sensing resources. These concepts also enable the system to set up priorities between the sensor network activities. These priorities are used to implement a progressive approach for the management of hazardous events.
Network Intrusion Detection Method Based on Improved Simulated Annealing Neural Network
Authors: Meijuan Gao, Jingwen Tian
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Aimed at the intrusion behaviors are characterized with uncertainty, complexity, diversity and dynamic tendency and the advantages of neural network, an intrusion detection method based on improved simulated annealing neural network (ISANN) is presented in this paper. First the simulated annealing algorithm with the best reserve mechanism is introduced and it is organic combined with Powell algorithm to form improved simulated annealing mixed optimize algorithm, instead of gradient falling algorithm of BP network to train network weight. It can get higher accuracy and faster convergence speed. We construct the network structure, and give the algorithm flow. We discussed and analyzed the impact factor of intrusion behaviors. With the ability of strong self-learning and faster convergence of ISANN, the network intrusion detection method can detect various intrusion behaviors rapidly and effectively by learning the typical intrusion characteristic information. The experimental result shows that this intrusion detection method is feasible and effective.
LMF-QL: A Graphical Tool to Query LMF Databases for NLP and Editorial Use
Authors: Mehdi Ben Abderrahmen, Bilel Gargouri, Mohamed Jmaiel
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

LMF is an new standard (ISO 24613) whose objective is to unify the representation of lexical resources in an XML database. LMF databases have generally complex structures which make formulating queries for extracting lexical data a hard task. Indeed, formulating a query necessitates mastering both the document structure and a query language. So in order to assist the query formulation for unskilled users and speed up this task for professional ones, we present in this paper a powerful and user-friendly graphical tool enabling automatic generation of XQuery queries for extracting lexical data from LMF databases for NLP and editorial use. To this end, we abstract database structure for specification of a query for data extraction. So, this tool accepts the query specification in term of Input and Output, where user may select only some data categories.
A Value Supplementation Method for Case Bases with Incomplete Information
Authors: Kerstin Bach, Meike Reichle, Klaus-Dieter Althoff
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

In this paper we present a method for supplementing incomplete cases with information from other cases within a case base. The acquisition of complete and correct cases is a time-consuming task, but nevertheless crucial for the quality and acceptance of a case-based reasoning system. The method introduced in this paper uses association rules to identify relations between attributes and, based on the discovered relations we are able to supplement values in order to complete cases. We argue that using these related attributes when retrieving supplementation candidates will yield better results than simply picking the case with the highest global similarity. The evaluation of the method is carried out using four different publicly available case bases.
SAT-based versus CSP-based constraint weighting for satisfiability
Authors: Duc Nghia Pham, John Thornton, Abdul Sattar, Abdelraouf Ishtaiwi
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Recent research has focused on bridging the gap between the satisfiability (SAT) and constraint satisfaction problem (CSP) formalisms. One approach has been to develop a many-valued SAT formula (MV-SAT) as an intermediate paradigm between SAT and CSP, and then to translate existing highly efficient SAT solvers to the MV-SAT domain. Experimental results have shown this approach can achieve significant improvements in performance compared with the traditional SAT and CSP approaches. In this paper, we follow a different route, developing SAT solvers that can automatically recognise CSP structure hidden in SAT encodings. This allows us to look more closely at how constraint weighting can be implemented in the SAT and CSP domains. Our experimental results show that a SAT-based approach to handle weights, together with CSP-based approach to variable instantiation, is superior to other combinations of SAT and CSP-based approaches. A further experiment on the round robin scheduling problem indicates that this many-valued constraint weighting approach outperforms other state-of-the-art solvers.
Location Prediction for Tracking Moving Objects
Authors: Yan Shen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

With the advances in mobile communication and position-finding technology for tracking the positions of continuously moving objects, there comes a kind of novel applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.) in which the locations of moving objects need to be maintained and processed. Existing methods for predicting the locations of moving objects assume that objects move according to linear functions. This severely limits their applicability, since in practice movement is more complex, and may follow drastically different motion patterns. In order to overcome the deficiency of existing methods, a novel location prediction model based on grey theory is proposed. In the proposed location prediction model, the GM is applied to predict the future location of uncertain moving objects. Comparing with linear prediction model, the proposed location prediction model not only relaxes the limitation to motion pattern of moving objects and the requirement to accuracy of sampling data, but also improves the predictive accuracy.
Analyzing Reliability of Time Constrained Service Composition
Authors: Guisheng Fan, Huiqun Yu, Liqiong Chen, Dongmei Liu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

As a way to compose independent services together to fulfill a function, service composition is an important means for flexible and rapid information integration of complex distribution application in open and heterogeneous environment. Because the participating services may be failure or unavailable, how to guarantee the quality of service composition has become a challenging problem. A service composition model based on Timed Petri net (SCTPN) is proposed in this paper, which is capable of accurately capturing transaction behaviors and time constraints of services. The basic relationships and failure processing strategies between services are also characterized by SCTPN model. Based on states of the constructed SCTPN model, we propose the concepts of greatest concurrent set and transfer matrix to analyze reliability related properties of SCTPN model. Two simplification schemas are established to reduce the complexity of computation. Finally, three specific experiments are conducted to explain the effectiveness of proposed method.
Adaptive Clustering of Search Results
Authors: Xuehua Shen, Chengxiang Zhai, Nicholas J. Belkin
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Clustering of search results has been shown to be advantageous over the simple list presentation of search results. However, in most clustering interfaces, the clusters are not adaptive to a user's interaction with the clustering results, and the important question "how to optimize the benefit of a clustering interface for a user" has not been well addressed in the previous work. In this paper, we study how to exploit a user's clickthrough information to adaptively reorganize the clustering results and help a user find the relevant information more quickly. We propose four strategies for adapting clustering results based on user actions. We propose a general method to simulate different kinds of users and linearize the cluster results so that we can compute regular retrieval measures. The simulation experiments show that the adaptation strategies have different performance for different types of users; in particular, they are effective for "smart users" who can correctly recognize the best clusters, but not effective for "dummy users" who follow system's ranking of results. We further conduct a user study on one of the four adaptive clustering strategies to see if an adaptive clustering system using such a strategy can bring users better search experience than a static clustering system. The results show that there is generally no significant difference between the two systems from a user's perspective.
A First Order Forward Chaining Approach for Answer Set Computing
Authors: Claire Lefèvre, Pascal Nicolas
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a Constraint Satisfaction Problem is to elaborate a first order logic program with default negation. In a preliminary step this program, with variables, is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems apply this two steps computation.In this work, our major contribution is to introduce a new approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. Our methodology applies a forward chaining of first order rules that are grounded on the fly by means of previously produced constants. We have implemented this strategy in our new ASP solver ASPeRiX. The first benefit of our work is to avoid the bottleneck of instantiation phase arising for some problems because of the huge amount of memory needed to ground all rules of a program, even if these rules are not really useful in certain cases. The second benefit is to make the treatment of function symbols easier and without syntactic restriction provided that rules are safe.
Study on Computer-Aided Fault Tree Construction for Geological Disasters
Authors: Chen Weigong
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Using the object-oriented plat software OEC, an expert system for aiding construction of fault trees for geological disasters is developed. The friendly user interface is provided by the system. This system also affords user some other functions, such as knowledge base maintenance, following up the scent and help function. By means of the computer expert system for aiding fault tree construction, the common people can construct fault tree for geological disasters at the level of an expert, and analyzes the cause of the accidents subsequently. The principle, process of the construction and important functions of computer-aided fault tree construction were discussed in this paper.