ppxscal/embedding_network huggingface dataset:
Simultaneous Events and the “Once-Only” Effect
Authors: Haythem O. Ismail
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

Some events recur, and some happen only once. Galton refers to the latter as “once-only” events [1]. In a first-order logic of events that makes a type-token distinction, the possibility of concurrent occurrences of the same event renders the characterization of the intuitive once-onliness not very intuitive. In particular, the paradigmatic case of the nth occurrence of a recurring event is shown to be not necessarily once-only. Counter-examples give rise to a classification of events based on the temporal relations among their occurrences. The problematic cases turn out to be those events that involve an indefinite individual; we call these indefinitely-specified events. We consider two options. The first is to restrict our event ontology, as has been implicitly done in most logics of events, to events that are definitely-specified. The second is to admit all sorts of events into our ontology and distinguish those that are definitely-specified from those that are not by statements in the object language. We opt for a representation of events as functional terms in the logic, and those terms denoting indefinitely-specified events seem to inevitably contain variables. Such non-ground terms turn out to be semantically problematic. To smoothly resolve these problems, we adopt Shapiro's logic of arbitrary and indefinite objects in which indefinite individuals are denoted by special terms [2]. Thus, indefinitely-specified events are naturally represented by functional terms with at least one argument denoting an indefinite individual.
The PHDS project: a success story of cooperation between Industry and academia
Authors: L. Romano, V. Vianello, L. Coppolino, S. Giordano
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

PHDS ("A Middleware Infrastructure for Real-Time Processing of Heterogeneous Data Streams") is a project financed by "Regione Campania" in which have been engaged partners belonging to Industry and Academia. The acronym PHDS has a double meaning. From one side it recall the main topic of the research project, namely heterogeneous data stream processing, and from the other side it is the plural form of the word PhD (Doctor of Philosophy) the highest level of university education. This double meaning emphasizes the strong relationship between Industry and Academia, which is at the basis of the PHDS project. In this paper is described a middleware infrastructure for stream processing, which is the main outcome of the PHDS project. Further a prototype has been developed and showed at the end of the paper.
Filtered statistics
Authors: Pawel Terlecki, Hardik Bati, Cesar Galindo-Legaria, Peter Zabback
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Column statistics are an important element of cardinality estimation frameworks. More accurate estimates allow the optimizer of a RDBMS to generate better plans and improve the overall system's efficiency. This paper introduces filtered statistics, which model value distribution over a set of rows restricted by a predicate. This feature, available in Microsoft SQL Server, can be used to handle column correlation, as well as focus on interesting data ranges. In particular, it fits well for scenarios with logical subtables, like flexible schema or multi-tenant applications. Integration with the existing cardinality estimation infrastructure is presented.
Belief Rough Set Classifier
Authors: Salsabil Trabelsi, Zied Elouedi, Pawan Lingras
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

In this paper, we propose a new rough set classifier induced from partially uncertain decision system. The proposed classifier aims at simplifying the uncertain decision system and generating more significant belief decision rules for classification process. The uncertainty is reperesented by the belief functions and exists only in the decision attribute and not in condition attribute values.
3DM: Domain-oriented Data-driven Data Mining
Authors: Guoyin Wang, Yan Wang
Venue: Fundamenta Informaticae (2009)

Recent developments in computing, communications, digital storage technologies, and high-throughput data-acquisition technologies, make it possible to gather and store incredible volumes of data. It creates unprecedented opportunities for knowledge discovery large-scale database. Data mining technology is a useful tool for this task. It is an emerging area of computational intelligence that offers new theories, techniques, and tools for processing large volumes of data, such as data analysis, decision making, etc. There are countless researchers working on designing efficient data mining techniques, methods, and algorithms. Unfortunately,most data mining researchers pay much attention to technique problems for developing data mining models and methods, while little to basic issues of data mining. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? What is the rule we would obey in a data mining process? What is the relationship between the prior knowledge of domain experts and the knowledgemind from data? In this paper, we will address these basic issues of data mining from the viewpoint of informatics [1]. Data is taken as a manmade format for encoding knowledge about the natural world. We take data mining as a process of knowledge transformation. A domain-oriented data-driven data mining (3DM) model based on a conceptual data mining model is proposed. Some data-driven data mining algorithms are also proposed to show the validity of this model, e.g., the data-driven default rule generation algorithm, data-driven decision tree pre-pruning algorithm and data-driven knowledge acquisition from concept lattice.
Adding GPS-Control to Traditional Thermostats: An Exploration of Potential Energy Savings and Design Challenges
Authors: Manu Gupta, Stephen S. Intille, Kent Larson
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

Although manual and programmable home thermostats can save energy when used properly, studies have shown that over 40% of U.S. homes may not use energy-saving temperature setbacks when homes are unoccupied. We propose a system for augmenting these thermostats using just-in-time heating and cooling based on travel-to-home distance obtained from location-aware mobile phones. Analyzing GPS travel data from 8 participants (8-12 weeks each) and heating and cooling characteristics from 5 homes, we report results of running computer simulations estimating potential energy savings from such a device. Using a GPS-enabled thermostat might lead to savings of as much as 7% for some households that do not regularly use the temperature setback afforded by manual and programmable thermostats. Significantly, these savings could be obtained without requiring any change in occupant behavior or comfort level, and the technology could be implemented affordably by exploiting the ubiquity of mobile phones. Additional savings may be possible with modest context-sensitive prompting. We report on design considerations identified during a pilot test of a fully-functional implementation of the system.
Using program metadata to support SDT in object-oriented applications
Authors: Daniel Williams, Jason D. Hiser, Jack W. Davidson
Venue: Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems (2009)

Software dynamic translation (SDT) is a powerful technology that enables software malleability and adaptivity at the instruction level by providing facilities for run-time monitoring and code modification. SDT has been used as the basis for many valuable tools, including dynamic optimizers, profilers, security policy enforcement, and binary translation to name a few. However, modern object-oriented programming techniques and their implementations (e.g., virtual functions, exceptions, dynamic code, etc.) pose unique challenges to high performing SDT systems. In this paper, we present Metaman, a generalized program metadata manager that stores and manages program information so that it can be efficiently accessed by emerging SDT systems to improve overall runtime performance of a managed executable. Using the information collected by Metaman, the run-time performance of an existing SDT system was improved by 22% making its execution speed only 3% slower than native (i.e., non-managed) execution.
Probabilistic Logic Based Reinforcement Learning of Simple Embodied Behaviors in a 3D Simulation World
Authors: Ari Heljakka, Ben Goertzel, Welter Silva, Cassio Pennachin, Andre' Senna, Izabela Goertzel
Venue: Proceeding of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006 (2007)

Logic-based AI is often thought of as being restricted to highly abstract domains such as theorem-proving and linguistic semantics. In the Novamente AGI architecture, however, probabilistic logic is used for a wider variety of purposes, including simple reinforcement learning of infantile behaviors, which are primarily concerned with perception and action rather than abstract cognition. This paper reports some simple experiments designed to validate the viability of this approach, via using the PLN probabilistic logic framework, implemented within the Novamente AGI architecture, to carry out reinforcement learning of simple embodied behaviors in a 3D simulation world (AGISim). The specific experiment focused upon involves teaching Novamente to play the game of “fetch” using reinforcement learning based on repeated partial rewards. Novamente is an integrative AGI architecture involving considerably more than just PLN; however, in this “fetch” experiment, the only cognitive process PLN is coupled with is simple perceptual pattern mining; other Novamente cognitive processes such as evolutionary learning and economic attention allocation are not utilized, so as to allow the study and demonstration of the power of PLN on its own.
Hybrid methods for music analysis and synthesis: audio key finding and automatic style-specific accompaniment
Authors: Elaine Chew
Venue:  (2008)

This dissertation presents computational approaches to two problems in music analysis and synthesis&mdash;audio key finding and automatic style-specific accompaniment. The two studies belong in the realm of computational music cognition, with a focus on automatic music analysis, which impacts information retrieval, and synthesis, which impacts the understanding of human creativity. The first problem addresses the automatic extraction of key from audio signals. Audio key finding is challenging due to the unique characteristics of music audio, such as the harmonic series produced by individual tones. In this dissertation, I experiment with various approaches to obtain pitches from audio recordings, and discover that equal treatment of all detected pitches may not be the best approach. I then modify Chew's Spiral Array model, a mathematical model for tonality, to adapt it to audio signals. I also propose a fuzzy analysis method, inspired by the membership concept in fuzzy logic, to clarify bass notes using information from higher frequency harmonics. The results show that audio key finding can sometimes outperforms MIDI (symbolic) key finding, thus providing evidence that harmonics in music audio may be helpful for audio key finding. Sensitivity analysis on different system components reveal successful key finding strategies. The second problem is concerned with automatic style-specific accompaniment (ASSA). The goal is to create a system that can analyze and learn the style from a small number of songs in the user's preferred style, then automatically generate a sequence of chords to accompany the melody created by the user. The accompaniment generation process uses machine learning techniques to model melody-chord relations, and applies statistical modeling to chord transitions represented as neo-Riemannian transforms. I propose various evaluation methods, including the conducting of Turing tests. I also design several metrics to measure style specificity of generated accompaniments. I test different training strategies, and show that more data may not necessarily improve the style emulation results. System comparisons show that the accompaniments generated by the ASSA system are stylistically closer to the original than those generated by the Temperley-Sleator Harmonic Analyzer and a random chord generator.
Signal processing algorithms for simplified-hardware multistatic synthetic aperture radar
Authors: Ahmed H. Tewfik
Venue:  (2008)

This work represents contributions to the state of the art of radar tomography and SAR in three main areas. First, we develop a SAR measurement and image reconstruction framework for a downlooking, omnidirectional and multistatic SAR system. This framework, a significant generalization of previous work for downlooking monostatic SARs, models the SAR measurement process as a generalized integral transform of a reflectivity function. Secondly, based on this measurement and inversion framework, we resolve the novel question of SAR vehicle trajectory design for the purpose of optimal image quality in the presence of measurement noise. In addition, we introduce the concept of a random-location multistatic trajectory, and show that (for large enough problems) such a strategy is likely to approximate an upper performance bound; therefore a random strategy is likely to perform as well or better than any deterministic trajectory strategy. Finally, we expose connections between the Welti phase-coded radar sequences and the Discrete Wavelet transform. This connection directly yields very simple and natively high-speed implementations of pulse compression filters at the radar receiver. Furthermore, we generalize the idea of zero correlation zone sequences by developing methods to generate transmit waveforms which extend the perfect correlation width of such filter outputs without modifying the simplicity of the receive filters. This method provides a new system tradeoff between transmit energy and receiver hardware complexity and power.
Local Gabor Binary Pattern Whitened PCA: A Novel Approach for Face Recognition from Single Image Per Person
Authors: Hieu V. Nguyen, Li Bai, Linlin Shen
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

One major challenge for face recognition techniques is the difficulty of collecting image samples. More samples usually mean better results but also more effort, time, and thus money. Unfortunately, many current face recognition techniques rely heavily on the large size and representativeness of the training sets, and most methods suffer degraded performance or fail to work if there is only one training sample per person available. This so-called "Single Sample per Person" (SSP) situation is common in face recognition. To resolve this problem, we propose a novel approach based on a combination of Gabor Filter, Local Binary Pattern and Whitened PCA (LGBPWP). The new LGBPWP method has been successfully implemented and evaluated through experiments on 3000+ FERET frontal face images of 1196 subjects. The results show the advantages of our method - it has achieved the best results on the FERET database. The established recognition rates are 98.1%, 98.9%, 83.8% and 81.6% on the fb, fc, dup I, and dup II probes, respectively, using only one training sample per person.
Symbolic model checking for channel-based component connectors
Authors: Sascha Klüppelholz, Christel Baier
Venue: Science of Computer Programming (2009)

This paper introduces a temporal logic framework to reason about the coordination mechanisms and data flow of exogenous coordination models. We take a CTL-like branching time logic, augmented with regular expressions that specify the observable I/O-operations, as a starting point. The paper provides the syntax and semantics of our logic and introduces the corresponding model checking algorithm. The second part of the paper reports an implementation that relies on a symbolic representation of the coordination network and the connected components by means of binary decision diagrams. A couple of examples are given to illustrate the efficiency of the model checking techniques and their implementation.
Evaluation of Multicore Processors for Embedded Systems by Parallel Benchmark Program Using OpenMP
Authors: Toshihiro Hanawa, Mitsuhisa Sato, Jinpil Lee, Takayuki Imada, Hideaki Kimura, Taisuke Boku
Venue: Proceedings of the 5th International Workshop on OpenMP: Evolving OpenMP in an Age of Extreme Parallelism (2009)

Recently, multicore technology has been introduced to embedded systems in order to improve performance and reduce power consumption. In the present study, three SMP multicore processors for embedded systems and a multicore processor for a desktop PC are evaluated by the parallel benchmark using OpenMP. The results indicate that, even if the memory performance is low, applications that are not memory-intensive exhibit large speedups by parallelization. The results also indicate a large performance improvement due to parallelization using OpenMP, despite its low cost.
Improving Software Test Processes
Authors: Tanja Toroi
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

Efficient quality assurance and improved test processes are needed when component-based, distributed, and complicated systems are tested. Fortunately, there exist a variety of test process improvement models. However, these models do not cover all of those software testing aspects that are important from the testing process improvement viewpoint in component-based software development. Therefore, in this paper existing test process improvement models are examined and new aspects they should address are suggested. The paper also considers test process improvement based on the results of the survey of software and conformance testing in healthcare applications. The results of the survey suggest that respondents are generally interested in test process improvement. However, the maturity of the test processes is still surprisingly low, and there is a lot of improvement work to do.
A Compression Method for Natural Language Automata
Authors: Lamia Tounsi, Béatrice Bouchou, Denis Maurel
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

This paper deals with Finite State Automata used in Natural Language Processing to represent very large dictionaries. We present a method for an important operation applied to these automata, the compression with quick access. Our proposal is to factorize subautomata other than those representing common prefixes or suffixes. Our algorithm uses a DAWG of subautomata to iteratively choose the best substructure to factorize. The linear time accepting complexity is kept in the resulting compact automaton. Experiments performed on ten automata are reported.
The Promise of Science-Based Computational Engineering
Authors: Douglass Post
Venue: Computing in Science and Engineering (2009)

Associate editor in chief Douglass Post describes the importance of simulation for engineering design resources.
Understanding Asynchronous Teaching And Learning Dialogues --An integrative approach
Authors: E. Vass, F. Concannon, M. LeVoi, K. Littleton, D. Miell
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper discusses methodological considerations in research investigating processes of asynchronous online learning. It challenges existing conceptualisations of online discourse which foreground the cognitive dimension of computer-mediated interactions. Informed by two studies about online university courses at the Open University, UK and the University of Otago, NZ, the paper emphasises the need to re-examine the relationship between the cognitive, the social and the affective aspects of shared work. Based on socio-cultural theorising, it calls for a new framework for the analysis of online discourse which recognizes these three aspects as closely interlinked and central in the process of shared knowledge building.
On the girth of random Cayley graphs
Authors: A. Gamburd, S. Hoory, M. Shahshahani, A. Shalev, B. Virág
Venue: Random Structures Algorithms (2009)

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (logd-1|G|)1-2-2 and that random d-regular Cayley graphs of simple algebraic groups over &Fopf;q asymptotically almost surely have girth at least log d-1|G|-dim(G). For the symmetric p-groups the girth is between loglog |G| and (log |G|)&alpha; with &alpha; < 1. Several conjectures and open questions are presented. &copy; 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Computational simulation of Belousov&#x2013;Zhabotinskii oscillating chemical reaction
Authors: Jie Ren, Jinzhang Gao, Wu Yang
Venue: Computing and Visualization in Science (2009)

The suitability of computational simulation of the Belousov&#x2013;Zhabotinskii oscillating chemical reaction by differential kinetic methodology for resolving nonlinear multi-component system is demonstrated in this work. According to the Field&#x2013;K&#x00d6;r&#x00d6;s&#x2013;Noyes mechanism and the Oregonator model, the change of the concentrations of HBrO2, bromide ion and cerium ion are simulated. The results of computational simulation are consistent with experimental results very well. At the same time, the effect of variables and parameters, especially the rate constant on the oscillation curve, are investigated deeply. A simple method of estimating rate constants is obtained through simulation the concentrations of key components of the system, and then comparison the simulation results with the experimental ones. The reasonable rate constant is also proposed.
On the mechanics of the particle on a curve without friction
Authors: Nicolae-Doru Stanescu, Stefan Tabacu
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

In this paper we present a new method to study the mechanics of a particle on a curve without friction. Two aspects are discussed. First is the static developed in linear independent co-ordinates, not necessary orthogonal. The second aspect treats the dynamics in intrinsic co-ordinates, obtaining not only the speed but also the components of the acceleration and the time variation of the generalized co-ordinate on the curve. The theory is applied in practical situations.
Using coding patterns in a model-driven approach to teaching object oriented programming
Authors: James H. Paterson, John Haddow, Ka Fai Cheng
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This poster presents an approach used within object-oriented programming classes which focus explicitly on the transition from conceptual model classes to code. This approach is supported by a software tool which has been developed to provide support in the selection and implementation of appropriate coding patterns.