ppxscal/embedding_network huggingface dataset:
An empirical comparison of ontology matching techniques
Authors: Ahmed Alasoud, Volker Haarslev, Nematollaah Shiri
Venue: Journal of Information Science (2009)

Ontology matching aims to find semantic correspondences between a pair of input ontologies. A number of matching techniques have been proposed recently. We may, however, benefit more from a combination of such techniques as opposed to just a single method. This is more appropriate, but very often the user has no prior knowledge about which technique is more suitable for the task at hand, and it remains a labour intensive and expensive task to perform. Further, the complexity of the matching process as well as the quality of the result is affected by the choice of the applied matching techniques. We study this problem and propose a framework for finding suitable matches. A main feature of this is that it improves the structure matching techniques and the end result accordingly. We have developed a running prototype of the proposed framework and conducted experiments to compare our results with existing techniques. While being comparable in efficiency, the experimental results indicate our proposed technique produces better quality matches.
Robust controller design for linear fractional-order systems with nonlinear time-varying model uncertainties
Authors: Ibrahima N'Doye, Michel Zasadzinski, Nour-Eddine Radhy, Abdelhaq Bouaziz
Venue: Proceedings of the 2009 17th Mediterranean Conference on Control and Automation (2009)

In this article, a robust linear controller design in time domain is presented for linear fractional-order systems with nonlinear model uncertainties. The Gronwall-Bellman lemma is employed to investigate the robust stability conditions which are based on the upper norm-bounds of the uncertainties. The parameters of a dynamic controller are selected to satisfy the requirements of robust stability under plant uncertainties.
A process-oriented approach to model agent personality
Authors: André Campos, Frank Dignum, Virginia Dignum, Alberto Signoretti, Anne Magály, Sérgio Fialho
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We present a process-oriented approach to specify personality-based behaviors in agents. The main aim is to make the agents able to reason about their choices following a preferred reasoning strategy according to a personality type. With this method, the decision-making of the agent becomes flexible enough to be reused in different scenarios while staying consistent with the used psychological theory.
Faster than C#: efficient implementation of dynamic languages on .NET
Authors: Antonio Cuni, Davide Ancona
Venue: Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems (2009)

The Common Language Infrastructure (CLI) is a virtual machine expressly designed for implementing statically typed languages such as C#, therefore programs written in dynamically typed languages are typically much slower than C# when executed on .NET. Recent developments show that Just In Time (JIT) compilers can exploit runtime type information to generate quite efficient code. Unfortunately, writing a JIT compiler is far from being simple. In this paper we report our positive experience with automatic generation of JIT compilers as supported by the PyPy infrastructure, by focusing on JIT compilation for .NET. Following this approach, we have in fact added a second layer of JIT compilation, by allowing dynamic generation of more efficient .NET bytecode, which in turn can be compiled to machine code by the .NET JIT compiler. The main and novel contribution of this paper is to show that this two-layers JIT technique is effective, since programs written in dynamic languages can run on .NET as fast as (and in some cases even faster than) the equivalent C# programs. The practicality of the approach is demonstrated by showing some promising experiments done with benchmarks written in a simple dynamic language.
A hierarchical coordination language for reliable real-time tasks
Authors: Alberto Sangiovanni-Vincentelli
Venue:  (2008)

Complex requirements, time-to-market pressure and regulatory constraints have made the designing of embedded systems extremely challenging. This is evident by the increase in effort and expenditure for design of safety-driven real-time control-dominated applications like automotive and avionic controllers. Design processes are often challenged by lack of proper programming tools for specifying and verifying critical requirements (e.g. timing and reliability) of such applications. Platform based design, an approach for designing embedded systems, addresses the above concerns by separating requirement from architecture. The requirement specifies the intended behavior of an application while the architecture specifies the guarantees (e.g. execution speed, failure rate etc). An implementation, a mapping of the requirement on the architecture, is then analyzed for correctness. The orthogonalization of concerns makes the specification and analyses simpler. An effective use of such design methodology has been proposed in Logical Execution Time (LET) model of real-time tasks. The model separates the timing requirements (specified by release and termination instances of a task) from the architecture guarantees (specified by worst-case execution time of the task). This dissertation proposes a coordination language, Hierarchical Timing Language (HTL), that captures the timing and reliability requirements of real-time applications. An implementation of the program on an architecture is then analyzed to check whether desired timing and reliability requirements are met or not. The core framework extends the LET model by accounting for reliability and refinement. The reliability model separates the reliability requirements of tasks from the reliability guarantees of the architecture. The requirement expresses the desired long-term reliability while the architecture provides a short-term reliability guarantee (e.g. failure rate for each iteration). The analysis checks if the short-term guarantee ensures the desired long-term reliability. The refinement model allows replacing a task by another task during program execution. Refinement preserves schedulability and reliability, i.e., if a refined task is schedulable and reliable for an implementation, then the refining task is also schedulable and reliable for the implementation. Refinement helps in concise specification without overloading analysis. The work presents the formal model, the analyses (both with and without refinement), and a compiler for HTL programs. The compiler checks composition and refinement constraints, performs schedulability and reliability analyses, and generates code for implementation of an HTL program on a virtual machine. Three real-time controllers, one each from automatic control, automotive control and avionic control, are used to illustrate the steps in modeling and analyzing HTL programs.
RTSG: ray tracing for X3D via a flexible rendering framework
Authors: Dmitri Rubinstein, Iliyan Georgiev, Benjamin Schug, Philipp Slusallek
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

VRML and X3D are the most widely adopted standards for interactive 3D content interchange. However, they are both designed around the common restricted functionality available in hardware graphics processors. Thus, most existing scene graph implementations are tightly integrated with rasterization APIs, which have difficulties simulating advanced global lighting effects. Conversely, complex photo-realistic effects are naturally supported by ray tracing based rendering algorithms [Glassner 1989]. Due to recent research advances and the constantly increasing computing power of commodity PCs, ray tracing is emerging as an interesting alternative for interactive applications. In this paper we present RTSG (Real-Time Scene Graph), a flexible scene management and rendering system. RTSG is X3D-compliant and has been designed to efficiently support both ray tracing and rasterization using a backend-independent rendering infrastructure. We describe two ray tracing and one rasterization backends and demonstrate that they achieve real-time rendering performance.
An SOM-Hybrid Supervised Model for the Prediction of Underlying Physical Parameters from Near-Infrared Planetary Spectra
Authors: Lili Zhang, Erzsébet Merényi, William M. Grundy, Eliot F. Young
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

Near-Infrared reflectance spectra of planets can be used to infer surface parameters, sometimes with relevance to recent geologic history. Accurate prediction of parameters (such as composition, temperature, grain size, crystalline state, and dilution of one species within another) is often difficult because parameters manifest subtle but significant details in noisy spectral observations, because diverse parameters may produce similar spectral signatures, and because of the high dimensionality of the feature vectors (spectra). These challenges are often unmet by traditional inference methods. We retrieve two underlying causes of the spectral shapes, temperature and grain size, with an SOM-hybrid supervised neural prediction model. We achieve 83.0±2.7% and 100.0±0.0% prediction accuracy for temperature and grain size, respectively. The key to these high accuracies is the exploitation of an interesting antagonistic relationship between the nature of the physical parameters, and the learning mode of the SOM in the neural model.
Parsing and subcategorization data
Authors: Jianguo Li
Venue: Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop (2006)

In this paper, we compare the performance of a state-of-the-art statistical parser (Bikel, 2004) in parsing written and spoken language and in generating subcategorization cues from written and spoken language. Although Bikel's parser achieves a higher accuracy for parsing written language, it achieves a higher accuracy when extracting subcategorization cues from spoken language. Additionally, we explore the utility of punctuation in helping parsing and extraction of subcategorization cues. Our experiments show that punctuation is of little help in parsing spoken language and extracting subcategorization cues from spoken language. This indicates that there is no need to add punctuation in transcribing spoken corpora simply in order to help parsers.
Evolution of a Video-Learning Object Format
Authors: Peter J. Fadde
Venue: eLearn (2009)

In a previous article, Peter J. Fadde emphasized the value of creating an identifiable format for video-learning objects. Developing such a format requires an investment of time and creativity, yet the return-on-investment is significant. In addition, viewers (or learners) know what to expect from each video-learning object -- of key importance with video objects because they can't be perused in a glance. Here, I analyze a series of mini-lecture video-learning objects called 'Real Time Minutes' (RTMs) produced by Jonathan Finkelstein, the creator/curator of Learning Times, an online community for teachers.
Plenary lecture II: geometric function theory and applications (new development)
Authors: Maslina Darus
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

The theory of analytic univalent function is a classical problem of complex analysis which belongs to a beautiful part of geometric function theory (GFT). To our interest, GFT denotes the part of functions analysis devoted to estimations of different magnitudes related to conformal mapping of one region onto another. Conformal mapping is a classical part of complex analysis having intimately connected with the theory of boundary value problems for harmonic functions, thus has numerous applications in mathematical physics and other branches of mathematics. A large number of generalizations of the class of univalent function have been explored and properties such as distortion theorems, radii and Fekete-Szego theorems are the main interests of solving problems. To date, various methods have been used such as method of differential subordinations, method of differential inequalities and methods of arising from the convolution theory. These are rather some curiosity provoking and recently attracted many other mathematicians to the derivation of new subclasses and new properties. Results from the theory of the geometric function are remarkable by their particular elegance and simplicity of formulations. However, in searching for a new breakthrough in the field, new approach and new development are indeed needed.
Genius: negotiation environment for heterogeneous agents
Authors: Koen Hindriks, Catholijn M. Jonker, Sarit Kraus, Raz Lin, Dmytro Tykhonov
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this demo, we present Genius, a tool that facilitates research in the area of bilateral multi-issue negotiation. It implements an open architecture allowing easy development and integration of existing negotiating agents. Genius can be used to simulate individual negotiation sessions as well as tournaments between negotiating agents in various negotiation scenarios. It allows the specification of negotiation domains and preference profiles by means of a graphical user interface. A number of negotiating agent implementations as well as negotiation scenarios have been collected in Genius. Genius can be used in experiments with human negotiators that negotiate against automated agents or other humans. An analytical toolbox integrated in Genius calculates optimal solutions, such as the Pareto efficient frontier, Nash product and others. This toolbox may be used to visualize a negotiation process and creates an extensive log.
Generating Multi-Threaded code from Polychronous Specifications
Authors: Bijoy A. Jose, Hiren D. Patel, Sandeep K. Shukla, Jean-Pierre Talpin
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

SIGNAL, Lustre, Esterel, and a few other synchronous programming language compilers accomplish automated sequential code generation from synchronous specifications. In generating sequential code, the concurrency expressed in the synchronous programs is sequentialized mostly because such embedded software was designed to run on single-core processors. With the widespread advent of multi-core processors, it is time for model-driven generation of efficient concurrent multi-threaded code. Synchronous programming models capture concurrency in the computation quite naturally, especially in its data-flow multi-clock (polychronous) flavor. Therefore, it seems reasonable to attempt generating multi-threaded code from polychronous data-flow models. However, multi-threaded code generation from polychronous languages aimed at multi-core processors is still in its infancy. In the recent release of the Polychrony compiler, multi-threaded code generation uses micro-level threading which creates a large number of threads and equally large number of semaphores, leading to inefficiency. We propose a process-oriented and non-invasive multi-threaded code generation using the sequential code generators. By noninvasive we mean that instead of changing the compiler, we use the existing sequential code generator and separately synthesize some programming glue to generate efficient multi-threaded code. This paper describes the problem of multi-threaded code generation in general, and elaborates on how Polychrony compiler for sequential code generation is used to accomplish multi-threaded code generation.
Pierson vs. Post RevisitedA Reconstruction using the Carneades Argumentation Framework
Authors: Thomas F. Gordon, Douglas Walton
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

The Pierson vs. Post case [1] has become an important benchmark in the field of AI and Law for computational models of argumentation. In [2], Bench-Capon used Pierson vs. Post to motivate the use of values and value preferences in his theory-construction account of legal argument. And in a more a recent paper by Atkinson, Bench-Capon and McBurney [3], it was used to illustrate a formalization of an argumentation scheme for practical reasoning. Here we offer yet another reconstruction of Pierson vs. Post, using our Carneades Argumentation Framework, a formal mathematical model of argument structure and evaluation based on Walton's theory of argumentation [4], and compare it to this prior work. Carneades, named in honor of the Greek skeptic philosopher who emphasized the importance of plausible reasoning, applies proof standards [5] to determine the defensibility of arguments and the acceptability of statements on an issue-by-issue basis.
Implementation of the DWT using intel IA-32 SIMD extensions
Authors: Enrique P. Martin, Jose Salvado
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

This paper presents some results on the implementation of the DWT (DWT-1) trough the lifting scheme by using general purpose processor SIMD extensions. We perform image analysis and reconstruction up to 3 levels of decomposition, using the DWT factored into lifting steps for the 9/7 wavelet filter pair. The algorithm was implemented in "C" code and evaluated in terms of performance and image degradation. Three approaches were used: floating-point representation, integer fixed-point representation and SIMD extensions integer code. The results obtained when compared to floating-point code implementation, indicate that the processing time for fixed-point is around 54% and SIMD extensions code is around 24.2%. The average PSNR results are also better for fixed-point and SIMD extensions than with floating-point code implementation.
ConVeS: a context verification framework for object recognition system
Authors: Mozaherul Hoque Abul Hasanat, Dhanesh Ramachandram, Mandava Rajeswari
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

Context is a vital element in both biological as well as synthetic vision systems. It is essential for deriving meaningful explanation of an image. Unfortunately, there is a lack of consensus in the computer vision community on what context is and how it should be represented. In this paper context is defined generally as "any and all information that is not directly derived from the object of interest but helps in explaining it". Furthermore, a description of context is provided in terms of its three major aspects namely scope, source and type. As an application of context in improving object detection results a Context Verification System (ConVeS) is proposed. ConVeS incorporates semantic and spatial context with an external knowledgebase to verify object detection results provided by state-of-the-art machine learning algorithms such as support vector machine or artificial neural network. ConVeS is presented as a simple framework that can be effectively applied to a wide range of computer vision applications such as medical image, surveillance video, and natural imagery.
On systematic scan for sampling H-colorings of the path
Authors: Kasper Pedersen
Venue: Random Structures Algorithms (2009)

We show that systematic scan for H-colorings of the n-vertex path mixes in O(log n) scans for any fixed H using block dynamics. For a restricted family of H we furthermore show that systematic scan mixes in O(log n) scans for any scan order. For completeness we show that a random update Markov chain mixes in O(nlog n) updates for any fixed H. &copy; 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Programming Agents with Emotions
Authors: Mehdi Dastani, John-Jules Ch. Meyer
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This paper presents the syntax and semantics of a simplified version of a logic-based agent-oriented programming language to implement agents with emotions. Four types of emotions are distinguished: happiness, sadness, anger and fear. These emotions are defined relative to agent's goals and plans. The emotions result from the agent's deliberation process and influence the deliberation process. The semantics of each emotion type is incorporated in the transition semantics of the presented agent-oriented programming language.
Reduced order multiport parallel and multidirectional neural associative memories
Authors: Abdul Aziz Bhatti
Venue: Biological Cybernetics (2009)

This paper proposes multiport parallel and multidirectional intraconnected associative memories of outer product type with reduced interconnections. Some new reduced order memory architectures such as k-directional and k-port parallel memories are suggested. These architectures are, also, very suitable for implementation of spatio-temporal sequences and multiassociative memories. It is shown that in the proposed memory architectures, a substational reduction in interconnections is achieved if the actual length of original N-bit long vectors is subdivided into k sublengths. Using these sublengths, submemory matrices, T s or W s , are computed, which are then intraconnected to form k-port parallel or k-directional memories. The subdivisions of N-bit long vectors into k sublengths save $${\frac{(k-1)\times 100}{k}\% }$$of interconnections. It is shown, by means of an example, that more than 80% reduction in interconnections is achieved. Minimum limit in bits on k as well as maximum limit on subdivisions in k is determined. The topologies of reduced interconnectivity developed in this paper are symmetric in structure and can be used to scale up to larger systems. The underlying principal of construction, storage and retrieval processes of such associative memories has been analyzed. The effect of complexity of different levels of reduced interconnectivity on the quality of retrieval, signal to noise ratio, and storage capacity has been investigated. The model possesses analogies to biological neural structures and digital parallel port memories commonly used in parallel and multiprocessing systems.
An overview of programming language based security
Authors: Jaime Niño
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

This paper provides a survey of security features in modern programming languages for Computer Science instructors. We present the role that type safety and capabilities provide for the building of secure systems, and how language systems allow designers to model security issues that once were part-and-parcel of Operating Systems, or that can not be modeled by the latter.
Brief paper: Simplex sliding mode methods for the chattering reduction control of multi-input nonlinear uncertain systems
Authors: Giorgio Bartolini, Elisabetta Punta, Tullio Zolezzi
Venue: Automatica (Journal of IFAC) (2009)

The simplex sliding mode control method is further developed by considering uncertain control systems non-affine in the control law. In order to reduce chattering effects, a set of integrators is added in the input channels. The augmented system is then controlled by a switching logic based on the simplex control method. As a result, the original control vector turns out to be continuous. A second order sliding mode observer is used when the sliding output is not available. Explicit conditions are identified about systems uncertainties and the simplex geometry in order to guarantee the convergence of the proposed methodology.