ppxscal/embedding_network huggingface dataset:
Taking an object-centric view on dynamic information with object flow analysis
Authors: Adrian Lienhard, Stéphane Ducasse, Tudor Gırba
Venue: Computer Languages, Systems and Structures (2009)

A large body of research analyzes the runtime execution of a system to extract abstract behavioral views. Those approaches primarily analyze control flow by tracing method execution events or they analyze object graphs of heap memory snapshots. However, they do not capture how objects are passed through the system at runtime. We refer to the exchange of objects as the object flow, and we claim that it is necessary to analyze object flows if we are to understand the runtime of an object-oriented application. We propose and detail object flow analysis, a novel dynamic analysis technique that takes this new information into account. To evaluate its usefulness, we present a visual approach that allows a developer to study classes and components in terms of how they exchange objects at runtime. We illustrate our approach on three case studies.
Anticipation in Attention
Authors: Christian Balkenius, Alexander Förster, Birger Johansson, Vin Thorsteinsdottir
Venue: The Challenge of Anticipation: A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems (2008)

Although attention can be purely reactive, like when we react to an unexpected event, in most cases, attention is under deliberate control anticipating events in the world. Directing attention and preparing for action takes time, and it is thus useful to be able to predict where an important event will occur in the environment and direct attention to it even before it happens. Another reason for the need for anticipation is the processing delays in the visuomotor system. In the human system it takes at least 100 ms to detect a visual target (Lamme and Roelfsema, 2000) and to just look at a moving object, we need to anticipate its movement to control the muscles of the eyes to move our gaze to the location where the target will be (von Hofsten and Rosander, 1997).The role of anticipation in attention can also be seen in the close connection between attention and action (Balkenius, 2000).
Simulation and spectral analysis of inharmonic tones of musical instruments
Authors: Varsha Shah, Rekha S. Patil
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Simulation and spectral analysis of harmonic and inharmonic pure tones of musical instruments is undertaken. It is shown how the basic wave such as sine can be used to simulate various harmonic and inharmonic sound signals of different instruments generating different timbres. It is shown that even the modest value of inharmonicity coefficient is sufficient to raise the frequency of inharmonic spectrum by a partial step more than that of the harmonic spectrum thus deviating the spectrum from strictly harmonic case. Listening tests of the simulated tones are also conducted which proves that the perception of inharmonicity depends on the number of partials present in the sound.
Electric properties of molecules using stationary coupled-cluster method
Authors: Sourav Pal, Nayana Vaval
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

In this review, we record recent developments of coupled-cluster methods for molecular electric properties. We focus on the stationary coupled-cluster response method and various coupled-cluster functionals. We note the important properties of extended coupled-cluster functional and recent interest in this. Recent results of properties using the above approach are reported to emphasize the point.
Reaction functions for task allocation to cooperative agents
Authors: Xiaoming Zheng, Sven Koenig
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In this paper, we present ARF, our initial effort at solving task-allocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routing problems where several agents need to visit targets simultaneously, for example, to move obstacles out of the way cooperatively. First, we propose reaction functions as a novel way of characterizing the costs of agents in a distributed way. Second, we show how to approximate reaction functions so that their computation and communication times are polynomial. Third, we show how reaction functions can be used by a central planner to allocate tasks to agents. Finally, we show experimentally that the resulting task allocations are better than those of other greedy methods that do not use reaction functions.
A New Networked Surveillance Video System by Combination of Omni-Directional and Network Controlled Cameras
Authors: Yousuke Sato, Koji Hashimoto, Yoshitaka Shibata
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

In recent years, in the surveillance system which observes the behavior of human invasion to building or indoor, it is required not only to capture the high quality and wide area image, but also to automatically track to the specific suspicious person in real-time to reduce the number of the required surveillance cameras. While these installations have included more video streams, they have been also placed in contexts with limited personnel for monitoring. Using the suggested system, the location of the target motion objects in wide area with 360 degrees surround it can be detected and tracked by capturing high quality images in real-time.
Providing Explanations for Database Schema Validation
Authors: Guillem Rull, Carles Farré, Ernest Teniente, Toni Urpí
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

We propose a new method for database schema validation that provides an explanation when it determines that a certain desirable property of a database schema does not hold. Explanations are required to give the designer a hint about the changes of the schema that are needed to fix the problem identified. Our method is an extension of the CQC method, which has been shown successful for testing such properties.
Performance Analysis of Classifier Ensembles: Neural Networks Versus Nearest Neighbor Rule
Authors: R. M. Valdovinos, J. S. Sánchez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

We here compare the performance (predictive accuracy and processing time) of different neural network ensembles with that of nearest neighbor classifier ensembles. Concerning the connectionist models, the multilayer perceptron and the modular neural network are employed. Experiments on several real-problem data sets demonstrate a certain superiority of the nearest-neighbor-based schemes, in terms of both accuracy and computing time. When comparing the neural network ensembles, one can observe a better behavior of the multilayer perceptron than that of the modular networks.
Portably solving file races with hardness amplification
Authors: Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da Silva
Venue: ACM Transactions on Storage (TOS) (2008)

The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time-of-check-to-time-of-use) race conditions. Existing solutions either help users to detect these problems (by pinpointing their locations in the code), or prevent the problem altogether (by modifying the kernel or its API). But the latter alternative is not prevalent, and the former is just the first step: Programmers must still address TOCTTOU flaws within the limits of the existing API with which several important tasks cannot be accomplished in a portable straightforward manner. Recently, Dean and Hu [2004] addressed this problem and suggested a probabilistic hardness amplification approach that alleviated the matter. Alas, shortly after, Borisov et al. [2005] responded with an attack termed &ldquo;filesystem maze&rdquo; that defeated the new approach. We begin by noting that mazes constitute a generic way to deterministically win many TOCTTOU races (gone are the days when the probability was small). In the face of this threat, we: (1) develop a new user-level defense that can withstand mazes; and (2) show that our method is undefeated even by much stronger hypothetical attacks that provide the adversary program with ideal conditions to win the race (enjoying complete and instantaneous knowledge about the defending program's actions and being able to perfectly synchronize accordingly). The fact that our approach is immune to these unrealistic attacks suggests it can be used as a simple and portable solution to a large class of TOCTTOU vulnerabilities, without requiring modifications to the underlying operating system.
Protecting the Publishing Identity in Multiple Tuples
Authors: Youdong Tao, Yunhai Tong, Shaohua Tan, Shiwei Tang, Dongqing Yang
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Current privacy preserving methods in data publishing always remove the individually identifying attribute first and then generalize the quasi-identifier attributes. They cannot take the individually identifying attribute into account. In fact, tuples will become vulnerable in the situation of multiple tuples per individual. In this paper, we analyze the individually identifying attribute in the privacy preserving data publishing and propose the concept of identity-reserved anonymity. We develop two approaches to meet identity-reserved anonymity requirement. The algorithms are evaluated in an experimental scenario, demonstrating practical applicability of the approaches.
Smooth Boosting for Margin-Based Ranking
Authors: Jun-Ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distributions over data. SoftRankBoost provably achieves approximately the maximum soft margin over all pairs of positive and negative examples, which implies high AUC score for future data.
A Long-Distance Time Domain Sound Localization
Authors: Jhing-Fa Wang, Jia-Chang Wang, Bo-Wei Chen, Zheng-Wei Sun
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

This paper presents a computer simulation of a long distance time domain sound source localization algorithm that localizes a single sound source by using two separated channel microphones. This paper uses the Time-Difference-Of-Arrival (TDOA) method for estimating the time delay difference between the incoming sound signals to microphones using the Average-Magnitude-Difference-Function (AMDF) algorithm. This algorithm has the main advantage of requiring no multiplication operations. The key design objectives are to reduce hardware circuit complexity and implement the algorithm on FPGA board. The computer simulation results have average error within 8° of accuracy in 1 to 5 meters.
Labeling of Human Motion by Constraint-Based Genetic Algorithm
Authors: Fu Yuan Hu, Hau San Wong, Zhi Qiang Liu, Hui Yang Qu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

This paper presents a new method to label parts of human body automatically based on the joint probability density function (PDF). To adapt to different motion for different articulation, the probabilistic models of each triangle different number of mixture components with MML are adopted. To solve the computation load problem of genetic algorithm (GA), a constraint-based genetic algorithm (CBGA) is developed to obtain the best global labeling. Our algorithm is developed to report the performance with experiments from running, walking and dancing sequences.
Is multidisciplinary research more highly cited? A macrolevel study
Authors: Jonathan M. Levitt, Mike Thelwall
Venue: Journal of the American Society for Information Science and Technology (2008)

Interdisciplinary collaboration is a major goal in research policy. This study uses citation analysis to examine diverse subjects in the Web of Science and Scopus to ascertain whether, in general, research published in journals classified in more than one subject is more highly cited than research published in journals classified in a single subject. For each subject, the study divides the journals into two disjoint sets called Multi and Mono. Multi consists of all journals in the subject and at least one other subject whereas Mono consists of all journals in the subject and in no other subject. The main findings are: (a) For social science subject categories in both the Web of Science and Scopus, the average citation levels of articles in Mono and Multi are very similar; and (b) for Scopus subject categories within life sciences, health sciences, and physical sciences, the average citation level of Mono articles is roughly twice that of Multi articles. Hence, one cannot assume that in general, multidisciplinary research will be more highly cited, and the converse is probably true for many areas of science. A policy implication is that, at least in the sciences, multidisciplinary researchers should not be evaluated by citations on the same basis as monodisciplinary researchers. &copy; 2008 Wiley Periodicals, Inc.
Semantics-Preserving Design of Embedded Control Software from Synchronous Models
Authors: Leonardo Mangeruca Massimo Baleani Alberto Ferrari Alberto Sangiovanni-Vincentelli
Venue: IEEE Transactions on Software Engineering (2007)

The design of embedded controllers is experiencing a growth in complexity as embedded systems increase their functionality while they become ubiquitous in electronic appliances, cars, airplanes, etc. As requirements become more challenging, mathematical models gain importance for mastering complexity. Among the different computational models proposed, synchronous models have proved to be the most widely used for control dominated applications. While synchronous models simplify the way of dealing with concurrency by decoupling functional and timing aspects, their software implementation on multitasking and multiprocessor platforms is far from straightforward, because of the asynchronous nature of most industrial software platforms. Known solutions in the literature either restrict the solution space or focus on special cases. We present a method for preserving the synchronous semantics through buffer-based intertask communication mechanisms, grounded on an abstraction of the target platform. This allows us to deal with any task set and, most importantly, being independent of the implementation, to explore the design space effectively.
Estimation of certainty for responses to multiple-choice questionnaires using eye movements
Authors: Minoru Nakayama, Yosiyuki Takahasi
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

To examine the feasibility of estimating the degree of strength of belief (SOB) of responses using eye movements, the scan paths of eye movements were analyzed while subjects reviewed their own responses to multiple choice tasks. All fixation points of eye movements were classified into visual areas, or cells, which corresponded with the positions of answers. Two estimation procedures are proposed using eye-movement data. The first one is identifying SOB using scan-path transitions. By comparing subject's reports of high and low SOB and eye-movement estimations, a significant correct rate of discrimination of SOB was observed. When the threshold of discrimination was controlled, a high rate of correct responses was obtained if it was set at a low level. The second procedure is conducting SOB discrimination using support vector machines (SVM) trained with features of fixations. Subject's gazing features were analyzed while they reviewed their own responses. A discrimination model for SOB was trained with several combinations of features to see whether performance of a significant level could be obtained. As a result, a trained model with 3 features (which consist of interval time, vertical difference, and length between fixations) can provide significant discrimination performance for SOB. These results provide evidence that strength of belief can be estimated using eye movements
The teacher's dilemma: a game-based approach for motivating appropriate challenge among peers
Authors: Jordan B. Pollack
Venue:  (2008)

In classroom-based studies, peer tutoring has proved to be an effective learning strategy, both for the tutees and for their peer tutors. Today, the increasingly widespread availability of computers and Internet access in the homes and after-school programs of students offers a new venue for peer learning. In seeking to translate the successes of peer-assisted learning from the classroom to the Internet, one major hurdle to overcome is that of motivation. When teachers are no longer supervising student activity and when participation itself becomes voluntary, peer tutoring protocols may stop being educationally productive. In order to successfully leverage these peer interactions, we must find a way to facilitate and motivate learning among a group of unsupervised peers. In this dissertation, we respond to this challenge by reconceptualizing the interactions among peers within the context of a different medium: that of games. In designing a peer tutoring experience as a two-player game, we gain a valuable set of tools and techniques for affecting student participation, engagement, goals, and strategies. Our contributions: (1) We define a criteria for games&mdash;the Teacher's Dilemma criteria&mdash;that motivates players to challenge one another with problems of appropriate difficulty; (2) We show three games that satisfy the Teacher's Dilemma criteria when played by rational players under idealized conditions; (3) We demonstrate, using computer simulations of strategic dynamics, that game-play will converge towards meeting these criteria, through time, under more realistic conditions; (4) We design a suite of software that incorporates a Teacher's Dilemma game into several web-based activities for different learning domains; (5) We collect data from thousands of students using these activities, and examine how the games actually affected the game-play strategy and learning among these students. The game-theoretic analysis establishes the possibility for a game-based mechanism for motivating appropriate challenges, the simulations support the plausibility of this approach given non-optimal players, the implemented software systems demonstrate the scalability of this model, and the data analysis supports the real-world applicability of this game-based approach to motivating appropriate challenges for learning among unsupervised peers.
A Learning Assistance Tool for Enhancing ICT Application Ability of Elementary and Secondary School Students
Authors: Chenn-Jung Huang, Yun-Cheng Luo, Chun-Hua Chen, Tun-Yu Chang, Kai-Wen Hu, Tsung-Hsien Wu, Kuo-Liang Huang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In recent years, developing useful learning assistance systems has become a hot research topic in the literature. The learner can be benefited by the useful guidance provided by the learning assistance tool. An effective learning assistance tool can reduce the teaching load of the teacher. However, it is rarely seen that a learning assistance tool employs machine learning techniques to provide appropriate diagnosis or feedback to learners or teachers in the literature. We thus propose a learning assistance tool that employs reinforcement learning technique to continuously interact with the environment in order to offer learners suitable and timely feedback, guide them through the difficulties. Our experimental results reveal that our learning assistance tool can effectively enhance the learners' ICT application ability and assist the learners in overcoming difficulties. The teaching load of the teacher is also significantly reduced.
Intelligent Guidance and Suggestions Using Case-Based Planning
Authors: Javier Bajo, Juan Manuel Corchado, Sara Rodríguez
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

This paper presents a multiagent system that provides guidance on leisure facilities and suggestions for shopping in malls. This paper presents a deliberative agent which incorporates a case based planner that provides suggestions in execution time. This agent is described together with its guidance and suggestion mechanism. The multiagent system has been tested, and the results obtained are presented in this paper.
Topic 10: Parallel Numerical Algorithms
Authors: H. -J. Bungartz, J. D. Bruguera, P. Arbenz, B. A. Hendrickson
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Since the early days of supercomputing, numerical routines have caused the highest demand for computing power anywhere, making their efficient parallelisation one of the core methodical tasks in high-performance computing. And still, many of today's fastest computers in the world are mostly used for the solution of huge systems of equations as they arise in the simulation of complex large-scale problems in science and engineering. But the scope of numerical algorithms goes far beyond numerical simulation, as their increasing importance in imaging or for search engine algorithmics shows.
A Uniform Approach Towards Succinct Representation of Trees
Authors: Arash Farzan, J. Ian Munro
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We propose a uniform approach for succinct representation of various families of trees. The method is based on two recursive decomposition of trees into subtrees. Recursive decomposition of a structure into substructures is a common technique in succinct data structures and has been shown fruitful in succinct representation of ordinal trees [7,10] and dynamic binary trees [16,21]. We take an approach that simplifies the existing representation of ordinal trees while allowing the full set of navigational operations. The approach applied to cardinal (i.e. k-ary) trees yields a space-optimal succinct representation allowing cardinal-type operations (e.g. determining child labeled i) as well as the full set of ordinal-type operations (e.g. reporting the number of siblings to the left of a node). Existing space-optimal succinct representations had not been able to support both types of operations [2,19].We demonstrate how the approach can be applied to obtain a space-optimal succinct representation for the family of free trees where the order of children is insignificant. Furthermore, we show that our approach can be used to obtain entropy-based succinct representations. We show that our approach matches the degree-distribution entropy suggested by Jansson et al. [13]. We discuss that our approach can be made adaptive to various other entropy measures.