ppxscal/embedding_network huggingface dataset:
Extracting a verb lexicon for deep parsing from FrameNet
Authors: Mark McConville, Myroslava O. Dzikovska
Venue: Proceedings of the Workshop on Deep Linguistic Processing (2007)

We examine the feasibility of harvesting a wide-coverage lexicon of English verbs from the FrameNet semantically annotated corpus, intended for use in a practical natural language understanding (NLU) system. We identify a range of constructions for which current annotation practice leads to problems in deriving appropriate lexical entries, for example imperatives, passives and control, and discuss potential solutions.
A Selection of Human Factors Tools: Measuring HCI Aspects of Flight Deck Technologies
Authors: Rolf Zon, Henk Dijk
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Within the HILAS project two experiments in high fidelity flight simulators were performed. In the current paper results from one of those experiments are discussed. Focus of that discussion is on the added value of using a set of HF tools rather than individual tools and on a number of lessons that were identified from this experiment. The set of Human Factors tools that was applied in this experiment might be helpful for manufacturers of flight deck technologies or aviation authorities to establish whether new technologies should receive the predicate "Human factors certified".
SemEval-2007 task 15: TempEval temporal relation identification
Authors: Marc Verhagen, Robert Gaizauskas, Frank Schilder, Mark Hepple, Graham Katz, James Pustejovsky
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

The TempEval task proposes a simple way to evaluate automatic extraction of temporal relations. It avoids the pitfalls of evaluating a graph of inter-related labels by defining three sub tasks that allow pairwise evaluation of temporal relations. The task not only allows straightforward evaluation, it also avoids the complexities of full temporal parsing.
Aspect-oriented Requirement and Reuse Aspect
Authors: Cai Hongli, Zhang Yang, Zhou Xianlin, Peng Jing, Wang Jianliang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Aspect-oriented programming may improve the design level of software, the reusability of components and the implementation of separation of concerns. Component-based software development approach is one of the most promising solutions for the emerging high development cost, low productivity, unmanageable software equality and high risk. This approach, however, encounters the separation of concerns that is easy to lead to the code-tangling and code-scattering. This paper aims to solve this problem on requirement level through the aspect-oriented requirement. At the same time, we also give concerns to the reuse of aspect.
Interactive disambguation of natural language input: a methodology and two implementations for French and English
Authors: Herve Blanchon
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

As natural language is highly ambiguous even in restricted domains, interactive disambiguation is seen as a necessity for achieving more robust and user-friendly interactive systems, face-to-face translation systems and Dialogue-Based Machine Translation systems. We have proposed a methodology which distinguishes between two parts in a disambiguation module: an engine (language- and application-independent) and a lingware (language- and application-dependent). The engine is, thus, to be reused in the design of any disambiguation module. This paper presents the current state of our work, that is: an engine that has been used to design two interactive disambiguation modules, for French, and English.
A Register Allocation Algorithm Based on Predicate Analysis System
Authors: Fengqin Wang, Ying Li, Zhengxia Zhang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

In order to allocate registers efficiently for predicated code, a new algorithm based on Predicate Analysis System is presented, which uses binary decision diagrams for constructing refined interference graph. The algorithm is implemented in the compiler of XXX-DSP/700 chip developed byour college. Experiment results show that the number of used registers is reduced 24.51% evenly, and the average speedup of code execution time reaches 1.31.
Ranking and Selecting Services
Authors: Alberto Sillitti, Giancarlo Succi
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

Service composition is the most recent approach to software reuse. The interactions among services propose many problems already approached in the composition of software components even if introducing more issues related to the run-time composition that is very limited in the components world. One of such problems is the identification of a set of services that can be integrated to build a complete system. This paper proposes an adaptation of a methodology for ranking and selecting components to a service-based environment. In particular, the methodology has been extended to support the peculiarities of services and include the support to the related technologies.
Lexical and syntactic priming and their impact in deployed spoken dialog systems
Authors: Svetlana Stoyanchev, Amanda Stent
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

In this paper, we examine user adaptation to the system's lexical and syntactic choices in the context of the deployed Let's Go! dialog system. We show that in deployed dialog systems with real users, as in laboratory experiments, users adapt to the system's lexical and syntactic choices. We also show that the system's lexical and syntactic choices, and consequent user adaptation, can have an impact on recognition of task-related concepts. This means that system prompt formulation, even in flexible input dialog systems, can be used to guide users into producing utterances conducive to task success.
A novel system for displacement sensing, integrated on a plastic substrate
Authors: A. Petropoulos, G. Kaltsas, D. Goustouridis
Venue: Microelectronics Journal (2009)

A micro system utilizing a novel sensing principle is presented in this paper. The determination of position is performed by exploiting the heat transfer between a heating source and a sensing device. The device itself consists of an array of temperature sensing elements, fabricated entirely on a plastic substrate. A specific fabrication technology was implemented which allows direct integration with read-out electronics and communication to the macro-world without the use of wire bonding. The fabricated sensing elements are temperature sensitive Pt thermistors. The device is able to detect both the position and the motion of a heating source by monitoring the induced resistance variation on the thermistor array. The heating source which performs a one-dimensional motion in a parallel plane to the temperature sensing array can be any element that can provide a highly localized temperature field. The system operation was characterized under both steady-state and dynamic conditions. In steady state mode the sensor exhibits a resolution of +/-50@mm, while in dynamic conditions the device can detect signal frequencies up to 10Hz.
Novelty Detection from Evolving Complex Data Streams with Time Windows
Authors: Michelangelo Ceci, Annalisa Appice, Corrado Loglisci, Costantina Caruso, Fabio Fumarola, Donato Malerba
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Novelty detection in data stream mining denotes the identification of new or unknown situations in a stream of data elements flowing continuously in at rapid rate. This work is a first attempt of investigating the anomaly detection task in the (multi-)relational data mining. By defining a data block as the collection of complex data which periodically flow in the stream, a relational pattern base is incrementally maintained each time a new data block flows in. For each pattern, the time consecutive support values collected over the data blocks of a time window are clustered, clusters are then used to identify the novelty patterns which describe a change in the evolving pattern base. An application to the problem of detecting novelties in an Internet packet stream is discussed.
Towards global bilevel dynamic optimization
Authors: Alexander Mitsos, Benoît Chachuat, Paul I. Barton
Venue: Journal of Global Optimization (2009)

The global solution of bilevel dynamic optimization problems is discussed. An overview of a deterministic algorithm for bilevel programs with nonconvex functions participating is given, followed by a summary of deterministic algorithms for the global solution of optimization problems with nonlinear ordinary differential equations embedded. Improved formulations for scenario-integrated optimization are proposed as bilevel dynamic optimization problems. Solution procedures for some of the problems are given, while for others open challenges are discussed. Illustrative examples are given.
Preference-aware publish/subscribe delivery with diversity
Authors: Marina Drosou, Kostas Stefanidis, Evaggelia Pitoura
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

In publish/subscribe systems, users describe their interests via subscriptions and are notified whenever new interesting events become available. Typically, in such systems, all subscriptions are considered equally important. However, due to the abundance of information, users may receive overwhelming amounts of events. In this paper, we propose using a ranking mechanism based on user preferences, so that only top-ranked events are delivered to each user. Since many times top-ranked events are similar to each other, we also propose increasing the diversity of delivered events. Furthermore, we examine a number of different delivering policies for forwarding ranked events to users, namely a periodic, a sliding-window and a history-based one. We have fully implemented our approach in SIENA, a popular publish/subscribe middleware system, and report experimental results of its deployment.
A situation-calculus semantics for an expressive fragment of PDDL
Authors: Jens Claßen, Yuxiao Hu, Gerhard Lakemeyer
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The Planning Domain Definition Language (PDDL) has become a common language to specify planning problems, facilitating the formulation of benchmarks and a direct comparison of planners. Over the years PDDL has been extended beyond STRIPS and ADL in various directions, for example, by adding time and concurrent actions. The current semantics of PDDL is purely meta-theoretic and quite complex, which makes an analysis difficult. Moreover, relating the language to other action formalisms is also nontrivial. We propose an alternative semantics for an expressive fragment of PDDL within the situation calculus. This yields at least two advantages. For one, the new semantics is purely declarative, making it amenable to an analysis in terms of logical entailments. For another, it facilitates the comparison with and mapping to other formalisms that are defined on top of the same logic, such as the agent control language Golog. In particular we obtain the semantical foundation for embedding efficient PDDL-based planners into the more expressive, yet computationally expensive Golog, thus combining the benefits of both. Other by-products of our investigations are a simpler account of durative actions in the situation calculus and a new notion of compulsory actions.
The Synchronization Problem for Locally Strongly Transitive Automata
Authors: Arturo Carpi, Flavio D'Alessandro
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The synchronization problem is investigated for a new class of deterministic automata called locally strongly transitive. An application to synchronizing colorings of aperiodic graphs with a cycle of prime length is also considered.
Performance Analysis of Self-Calibration Algorithm for L-shaped Array
Authors: Biao Wu, Hui Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A self-calibration algorithm (SAL: self-calibration algorithm for L-shaped array) is presented for L-shaped array in the presence of mutual coupling. The proposed algorithm utilizes special mutual coupling characteristic of L-shaped array to decouple the signal source information (DOA) and coupling coefficients of antenna array so that two kinds of parameter estimations can be realized without any calibration sources. This literature puts emphasis on the performance analysis of new proposed algorithm in the presence of unknown mutual coupling. Simulation results demonstrate that the proposed self-calibration algorithm can achieve the high resolution under the condition of unknown coupling. Meanthile, it possesses a better performance when SNR is larger than 15 dB and snapshot is larger than 150, which mean the estimation of coupling matrix is close to the true value.
Motion Detection Based on Temporal Difference Method and Optical Flow field
Authors: Wei Shuigen, Chen Zhen, Dong Hua
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

A motion detection method based on temporal difference and optical flow field is proposed in this paper. Firstly, an absolute differential image is calculated from two consecutive gray images. The absolute differential image is filtered by low-pass filter and translation into binary image. Edge of moving object is indexed from row-coordinate and column-coordinate. Secondly, optical flow field is calculated from image sequences by Hron’s algorithm. Thirdly, moving object area is found out by indexed edge and optical flow field above. Experimental results show that this method is suitable and effective.
Eye Tracking in Human-Computer Interaction and Usability Research
Authors: Tommy Strandvall
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

The objective of the tutorial is to give an overview on how eye tracking is currently used and how it can be used as a method in human computer interaction research and especially in usability research. An eye tracking system records how the eyes move while a subject is completing a task for example on a web site. By analyzing these eye movements we are able to gain an objective insight into the behavior of that person.
Brief paper: New results on H∞ control of discrete singularly perturbed systems
Authors: Shengyuan Xu, Gang Feng
Venue: Automatica (Journal of IFAC) (2009)

This paper studies the problem of H"~ control of discrete-time singularly perturbed systems. A new sufficient condition, which ensures the existence of state feedback controllers such that the resulting closed-loop system is asymptotically stable while satisfying a prescribed H"~ norm bound, is obtained. This condition is in terms of a linear matrix inequality, which is independent of the singular perturbation parameter. Furthermore, a new condition on searching for the allowable upper bound of the singular perturbation parameter is proposed, under which the discrete-time singularly perturbed system is asymptotically stable with an H"~ norm bound when the singular perturbation parameter is lower than this upper bound. In these derived conditions, the upper bound of the singular perturbation parameter is not required to be smaller than one. The reduced conservatism of our results is demonstrated via a numerical example.
An Extension of the StarSs Programming Model for Platforms with Multiple GPUs
Authors: Eduard Ayguadé, Rosa M. Badia, Francisco D. Igual, Jesús Labarta, Rafael Mayo, Enrique S. Quintana-Ortí
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

While general-purpose homogeneous multi-core architectures are becoming ubiquitous, there are clear indications that, for a number of important applications, a better performance/power ratio can be attained using specialized hardware accelerators. These accelerators require specific SDK or programming languages which are not always easy to program. Thus, the impact of the new programming paradigms on the programmer's productivity will determine their success in the high-performance computing arena. In this paper we present GPU Superscalar (GPUSs), an extension of the Star Superscalar programming model that targets the parallelization of applications on platforms consisting of a general-purpose processor connected with multiple graphics processors. GPUSs deals with architecture heterogeneity and separate memory address spaces, while preserving simplicity and portability. Preliminary experimental results for a well-known operation in numerical linear algebra illustrate the correct adaptation of the runtime to a multi-GPU system, attaining notable performance results.
Simulate Research on High Precise Electro-hydraulic System Adjusted by Hybrid Fuzzy Controller
Authors: Jun-xia Meng, Yu Wang, Xi-bin Wang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Combining Bang-Bang, fuzzy and integral control, a new hybrid controller is proposed for controlling a nonlinear, complex electro-hydraulic system with large moment of inertia of plant. Bang-Bang is adopted to reduce big error rapidly. Fuzzy and integral control enhances robustness of the controller, and eliminate steady-state-error completely. Integral coefficient is changed by a subordinate fuzzy controller online. As a result, Integral has faintly negative effect on system dynamic qualities, and eliminates steady-state-error fast. Using genetic algorithm to optimize scaling factors of main fuzzy controller offline in order to improve control performance. Finally, simulate analysis was made on MATLAB integrated plat. The result shows that the proposed controller has strong robustness, excellent dynamic and static index. It can satisfy control demand of the concerned system completely.
The Construction of Single-Chip Virtual Experiment Platform Based on Proteus
Authors: Shi Wei, Liu Jianhui
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In view of the insufficiency which exists in single-chip curriculum teaching and experimenting, we proposed to construct of the single-chip virtual experiment platform using the Proteus software, and verified the feasibility of the project through concrete examples and analysis. In actual operation, the project achieved hardware and software simulation and debugging without the physical circuit. It reduced the design difficulties and the development cost, and also has made a good teaching progress. So that this project has very high application value in colleges and universities.
Mining Discriminant Sequential Patterns for Aging Brain
Authors: Paola Salle, Sandra Bringay, Maguelonne Teisseire
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Discovering new information about groups of genes implied in a disease is still challenging. Microarrays are a powerful tool to analyse gene expression. In this paper, we propose a new approach outlining relationships between genes based on their ordered expressions. Our contribution is twofold. First, we propose to use a new material, called sequential patterns, to be investigated by biologists. Secondly, due to the expression matrice density, extracting sequential patterns from microarray datasets is far away from being easy. The aim of our proposal is to provide the biological experts with an efficient approach based on discriminant sequential patterns. Results of various experiments on real biological data highlight the relevance of our proposal.
Positioning Mobile Vehicle by Using Super-Short Baseline with AM Ultrasonic Beacon
Authors: Jianjun Long, Baihai Wu, Jinping Wu, Tibing Xiao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

To position a mobile vehicle, it is presented to improve conventional ultra-short baseline by using super-short baseline with AM ultrasonic beacons. The array distance increases about 10 times, and errors caused by time-delay is eliminated in the proposed method. To estimate the key phase differences in the proposed method, a measurement equation based on the elliptical area which is used for estimation of the parameters is put forward. The experiment set-up is established, and experiments were performed. Experimental results indicate that accuracy is close to ±3mm, and does that the SSBL with AM ultrasonic beacons in positioning is valid.
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
Authors: Rajeev Goré, Florian Widmann
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

We give an optimal (exptime), sound and complete tableau-based algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound method to track unfulfilled eventualities "on the fly" which allows us to detect "bad loops" sooner rather than in multiple subsequent passes. We achieve this by propagating and updating the "status" of nodes throughout the underlying graph as soon as is possible. We give sufficient details to enable an easy implementation by others. Preliminary experimental results from our unoptimised OCaml implementation indicate that our algorithm is feasible.
Evaluating Various Branch-Prediction Schemes for Biomedical-Implant Processors
Authors: Christos Strydis, Georgi N. Gaydadjiev
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

This paper evaluates various branch-prediction schemes under different cache configurations in terms of performance, power, energy and area on suitably selected biomedical workloads. The benchmark suite used consists of compression, encryption and data-integrity algorithms as well as real implant applications, all executed on realistic biomedical input datasets. Results are used to drive the (micro)architectural design of a novel microprocessor targeting microelectronic implants. Our profiling study has revealed that, under strict or relaxed area constraints and regardless of cache size, the ALWAYS TAKEN and ALWAYS NOT-TAKEN static prediction schemes are, in almost all cases, the most suitable choices for the envisioned implant processor. It is further shown that bimodal predictors with small Branch-Target-Buffer (BTB) tables are suboptimal yet also attractive solutions when processor I/D-cache sizes are up to 1024KB/512KB, respectively.
A Uniform Method for Computing the Distance between Ellipsoids
Authors: Zhou Zhi Ping, Gan Sheng Ke
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

In this paper, a uniform method is presented for computing the minimum translational distance (MTD) between a pair of ellipsoids. This article deduces a necessary and sufficient condition of the witness point-pair which achieve MTD value and reliable criteria for determining their spatial relation. Experimental results show the algorithm converge after a few iteration whether two objects overlap or not and perform better than other algorithms.