ppxscal/embedding_network huggingface dataset:
An Axiomatization of Shapley Values of Games on Set Systems
Authors: Aoi Honda, Yoshiaki Okazaki
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

An axiomatization of a generalized Shapley value of games is proposed. The authors follow Faigle and Kern, in the sense that our basic material is the maximal chains of the underlying set system. This generalized Shapley value may have applicability to the game on set systems which satisfy the condition of a sort of normality.
Transforming Discourse Models to Structural User Interface Models
Authors: Sevan Kavaldjian, Cristian Bogdan, Jürgen Falb, Hermann Kaindl
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

User-interface design is still a time consuming and expensive task to do, but recent advances allow generating them from interaction design models. We present a model-driven approach for generating user interfaces out of interaction design models. Our interaction design models are discourse models, more precisely models of classes of dialogues. They are based on theories of human communication and should, therefore, be more understandable to humans than programs implementing user interfaces. Our discourse models also contain enough semantics to transform them automatically into user interfaces for multiple devices and modalities. This paper presents a two-step transformation approach with an intermediate user interface model. By showing specific transformation rules, we concentrate on a major part of the first step, transforming discourse models to structural user interface models.
Real-Time Photorealistic Virtual Human Anatomy
Authors: Yanling Liu, Jim X. Chen, Lin Yang
Venue: Computing in Science and Engineering (2008)

This article presents a new, voxel-based virtual human anatomy learning system. Using cryosection images to construct human parts provides accurate natural-appearance rendering for both the boundary and inner structure of human parts. The authors developed a novel voxel-based surface-reconstruction algorithm for fast surface reconstruction and real-time modification to volume data. Focusing on high-quality human parts rendering as well as real-time interaction, the system provides a better platform for virtually learning human anatomy.
The well-tempered PHP developer
Authors: Federico Kereki
Venue: Linux Journal (2008)

PHP developers can get a comfortable, powerful environment with Eclipse plus some well-chosen plugins.
Does the use of stereotypes improve the comprehension of UML sequence diagrams?
Authors: Marcela Genero, José A. Cruz-Lemus, Danilo Caivano, Silvia Abrahão, Emilio Insfran, José Angel Carsí
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

This paper reports on a controlled experiment that investigates the influence of stereotypes in UML sequence diagrams. The comprehension of UML sequence diagrams with and without stereotypes is analyzed from three different perspectives: semantic comprehension, retention and transfer. The experiment was carried out with 77 undergraduate students of Computer Science from the University of Bari in Italy. The results obtained show a slight tendency in favor of the use of stereotypes in facilitating the comprehension of UML sequence diagrams. Further replications are needed to obtain more conclusive results.
Ab initio calculation of the nonlinear susceptibility &chi;$^{(2)}$ of a crystal surface
Authors: Isabelle Baraille, Clovis Darrigan, Michel Rérat
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

The polarizability and first hyperpolarizability of a crystal surface are calculated from a sum over states method using crystalline orbitals of the CRYSTAL program. The linear and nonlinear optical properties of the (001) LiF surfaces are evaluated layer by layer, showing that the response of inner layers to an electric field tends effectively to the bulk response value while the &chi;$^{(2)}$susceptibility components responsible of second harmonic generation (SHG) are no longer equal to zero at the surface of the crystal.
OpenMP Extensions for Irregular Parallel Applications on Clusters
Authors: Jue Wang, Changjun Hu, Jilin Zhang, Jianjiang Li
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

Many researchers have focused on developing the techniques for the situation where data arrays are indexed through indirection arrays. However, these techniques may be ineffective for nonlinear indexing. In this paper, we propose extensions to OpenMP directives, aiming at efficient irregular OpenMP codes including nonlinear indexing to be executed in parallel. Furthermore, some optimization techniques for irregular computing are presented. These techniques include generation of communication sets and SPMD code, communication scheduling strategy, and low overhead locality transformation scheme. Finally, experimental results are presented to validate our extensions and optimization techniques.
Efficiently Discovering Recent Frequent Items in Data Streams
Authors: Ferry Irawan Tantono, Nishad Manerikar, Themis Palpanas
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

The problem of frequent item discovery in streaming data has attracted a lot of attention lately. While the above problem has been studied extensively, and several techniques have been proposed for its solution, these approaches treat all the values of the data stream equally. Nevertheless, not all values are of equal importance. In several situations, we are interested more in the new values that have appeared in the stream, rather than in the older ones.In this paper, we address the problem of finding recent frequent items in a data stream given a small bounded memory, and present novel algorithms to this direction. We propose a basic algorithm that extends the functionality of existing approaches by monitoring item frequencies in recent windows. Subsequently, we present an improved version of the algorithm with significantly improved performance (in terms of accuracy), at no extra memory cost. Finally, we perform an extensive experimental evaluation, and show that the proposed algorithms can efficiently identify the frequent items in ad hoc recent windows of a data stream.
Surface Reconstruction Techniques Using Neural Networks to Recover Noisy 3D Scenes
Authors: David Elizondo, Shang-Ming Zhou, Charalambos Chrysostomou
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

This paper presents a novel neural network approach to recovering of 3D surfaces from single gray scale images. The proposed neural network uses photometric stereo to estimate local surfaces orientation for surfaces at each point of the surface that was observed from same viewpoint but with different illumination direction in surfaces that follow the Lambertian reflection model. The parameters for the neural network are a 3x3 brightness patch with pixel values of the image and the light source direction. The light source direction of the surface is calculated using two different approaches. The first approach uses a mathematical method and the second one a neural network method. The images used to test the neural network were both synthetic and real images. Only synthetic images were used to compare the approaches mainly because the surface was known and the error could be calculated. The results show that the proposed neural network is able to recover the surface with a highly accurately estimate.
Solving shortest path problem using particle swarm optimization
Authors: Ammar W. Mohemmed, Nirod Chandra Sahoo, Tan Kim Geok
Venue: Applied Soft Computing (2008)

This paper presents the investigations on the application of particle swarm optimization (PSO) to solve shortest path (SP) routing problems. A modified priority-based encoding incorporating a heuristic operator for reducing the possibility of loop-formation in the path construction process is proposed for particle representation in PSO. Simulation experiments have been carried out on different network topologies for networks consisting of 15-70 nodes. It is noted that the proposed PSO-based approach can find the optimal path with good success rates and also can find closer sub-optimal paths with high certainty for all the tested networks. It is observed that the performance of the proposed algorithm surpasses those of recently reported genetic algorithm based approaches for this problem.
Point-to-Point Shortest Path Algorithms with Preprocessing
Authors: Andrew V. Goldberg
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

This is a survey of some recent results on point-to-point shortest path algorithms. This classical optimization problem received a lot of attention lately and significant progress has been made. After an overview of classical results, we study recent heuristics that solve the problem while examining only a small portion of the input graph; the graph can be very big. Note that the algorithms we discuss find exact shortest paths. These algorithms are heuristic because they perform well only on some graph classes. While their performance has been good in experimental studies, no theoretical bounds are known to support the experimental observations. Most of these algorithms have been motivated by finding paths in large road networks.We start by reviewing the classical Dijkstra's algorithm and its bidirectional variant, developed in 1950's and 1960's. Then we review A* search, an AI technique developed in 1970's. Next we turn our attention to modern results which are based on preprocessing the graph. To be practical, preprocessing needs to be reasonably fast and not use too much space. We discuss landmark- and reach-based algorithms as well as their combination. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Acquiring a Functionally Compositional System of Goal-Directed Actions of a Simulated Agent
Authors: Yuuya Sugita, Jun Tani
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

We propose a sub-symbolic connectionist model in which a functionally compositional system self-organizes by learning a provided set of goal-directed actions. This approach is compatible with an idea taken from usage-based accounts of the developmental learning of language, especially one theory of infants' acquisition process of symbols. The presented model potentially explains a possible continuous process underlying the transitions from rote knowledge to systematized knowledge by drawing an analogy to the formation process of a geometric regular arrangement of points. Based on the experimental results, the essential underlying process is discussed.
Multiscale Morphological Image Simplification
Authors: Leyza Baldo Dorini, Neucimar Jerônimo Leite
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Image simplification reduces the information content of an image, being frequently used as a preprocessing stage in several algorithms to suppress undesired details such as noise. Morphological filters, commonly used for this purpose, have as main drawbacks the asymmetric treatment of peaks and valleys and the difficulty to choose an appropriate structuring element size. Here, we propose a self-dual multiscale image simplification operator with sound edge preservation properties. This enables us to represent the inherent multiscale nature of real-world images by embedding the original signal into a family of derived signals, which represent simplified versions of the image obtained by successively removing its structures across scales. Thus, it is possible to analyze the different representation levels to extract the interest features, and the definition of a structure element size does not constitute a problem anymore. Based on these notions, we present some experiments on image segmentation, a basic step of various pattern recognition approaches.
Iscore: a system for writing interaction
Authors: Antoine Allombert, Myriam Desainte-Catherine, Gérard Assayag
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

In this article, we present the development of research carried out to design a system of interactive scores for composition and execution, based on temporal constraints called Iscore. This system has been designed in order to allow musicians to interpret pieces of electro-acoustic music but since it uses a symbolic representations of the scores, it can bee seen as a system for more generally writing interaction with a temporal approach. Then, numerous other applications could be possible. This system can be used to create interactive multimedia scenarios (for theater shows or museum visits as examples) and also for adapting musical pieces or interactive multimedia documents for mutli-player applications or players with limited ability.
Person Tracking in UAV Video
Authors: Andrew Miller, Pavel Babenko, Min Hu, Mubarak Shah
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

The UAV person tracking task for this evaluation was particularly difficult because of large, complicated, and low-quality videos, with only small images of people. We found that our best results were obtained using a combination of intensity thresholding (for IR imagery), motion compensation, interest-point detection and correspondence, and pattern classification. This can be considered a preliminary exploration into an extremely challenging problem.
Decision Tables in Petri Net Models
Authors: Marcin Szpyrka, Tomasz Szmuc
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Many monitoring and control computer systems contain a rule-based system as a part of them. Such a rule based system is used to determine which actions should be taken depending on the data collected from sensors. For both embedded and rule-based systems many different approaches have been proposed, but it is hardly possible to find a formalism that can cope with both of them. The paper deals with a problem of including decision tables into colour Petri net models. A few kinds of decision tables are considered and methods of transformation them into coloured Petri nets form called D-nets are presented. Both non-hierarchical and hierarchical D-nets are considered in the paper.
802.15.3 Transmitter: A Fast Design Cycle Using OFDM Framework in Bluespec
Authors: Teemu Pitkänen, Vesa-Matti Hartikainen, Nirav Dave, Gopal Raghavan
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Orthogonal Frequency-Division Multiplexing (OFDM) has become the preferred modulation scheme for both broadband and high bitrate digital wireless protocols because of its spectral efficiency and robustness against multipath interference. Although the components and overall structure of different OFDM protocols are functionally similar, the characteristics of the environment for which a wireless protocol is designed often result in different instantiations of various components. In this paper we present a new baseband processing transmitter case, namely 802.15.3 (WUSB), to existing OFDM framework which consists highly parametrized code in Bluespec for two different wireless baseband processing cases, namely 802.11a (WiFi) and 802.16 (WiMAX). The design cycle for transmitter of WUSB took only six week's for two designers which were not familiar with Bluespec, WUSB protocol or the OFDM framework.
Adaptive Kanerva-based function approximation for multi-agent systems
Authors: Cheng Wu, Waleed M. Meleis
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instances of classic multi-agent problems. We apply our techniques to the predator-prey pursuit problem. We first demonstrate that Kanerva Coding applied within a reinforcement learner does not give good results. We then describe our new adaptive Kanerva-based function approximation algorithm, based on prototype deletion and generation. We show that probabilistic prototype deletion with random prototype generation increases the fraction of test instances that are solved from 45% to 90%, and that prototype splitting increases that fraction to 94%. We also show that optimizing prototypes reduces the number of prototypes, and therefore the number of features, needed to achieve a 90% solution rate by up to 87%. These results demonstrate that our approach can dramatically improve the quality of the results obtained and reduce the number of prototypes required. We conclude that adaptive prototype optimization can greatly improve a Kanerva-based reinforcement learner's ability to solve large-scale multi-agent problems.
Intelligent Training Systems: Lessons Learned from Building Before It Is Time
Authors: Alan M. Lesgold
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

I discuss what I learned while developing five generations of intelligent coached apprenticeship systems somewhat earlier than hardware, basic software support, programmers, or users were ready for them. First, it was essential to remain focused on the central instructional principles driving our work. Second, we learned that the social issues in deploying novel systems trump any demonstrations of return on investment or efficacy. People only use what they are comfortable using. Third, we learned that being as free as possible of specific operating system or software commitments was absolutely necessary. Fourth, we learned that the fundamental role of coached apprenticeship systems is to efficiently provide the rare moments from real life that afford the chance to learn deep and transferable skills and knowledge. Fifth, we learned that developing intelligent coached environments affords opportunities for learning by teachers/trainers and designers of work processes as well as by students/trainees. Finally, we learned that capabilities for which we can have complete student models are exactly those destined to be taken over by machines, placing a premium on far transfer as the goal for high-end training/teaching systems.
Using enthymemes in an inquiry dialogue system
Authors: Elizabeth Black, Anthony Hunter
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

A common assumption for logic-based argumentation is that an argument is a pair (&Phi;, &alpha;) where &Phi; is a minimal subset of the knowledgebase such that &Phi; is consistent and &Phi; entails the claim &alpha;. However, real arguments (i.e. arguments presented by humans) usually do not have enough explicitly presented premises for the entailment of the claim (i.e. they are enthymemes). This is because there is some common knowledge that can be assumed by a proponent of an argument and the recipient of it. This allows the proponent of an argument to encode an argument into a real argument by ignoring the common knowledge, and it allows a recipient of a real argument to decode it into the intended argument by drawing on the common knowledge. If both the proponent and recipient use the same common knowledge, then this process is straightforward. Unfortunately, this is not always the case, and this raises interesting issues for dialogue systems in which the recipient has to cope with the disparities between the different views on what constitutes common knowledge. Here we investigate the use of enthymemes in inquiry dialogues. For this, we propose a generative inquiry dialogue system and show how, in this dialogue system, enthymemes can be managed by the agents involved, and how common knowledge can evolve through dialogue.
A novel computational method to quantify and analyse osteoclastic bone resorption
Authors: Iannis E. Adamopoulos, Konstantinos Pataridis
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

Bone destruction is a common feature of arthritis. Bone is resorbed by bone resorbing cells, termed osteoclasts. In medical research, quantification of the amount of bone resorbed areas is vital in understanding the resorptive capacity of the osteoclast under certain pathologic conditions, and its response to various treatments and pharmacological inhibitors. Validated image analysis algorithms and procedures, therefore, have become critical for elevating the quality of bone resorption assays results. As in all computational experimental methods in biology the pressure increases to make analysis transparent and reproducible. In this paper we present the novel software "OsteoPro" which has been designed specifically to address those issues. "OsteoPro" is a "turnkey" application that functions with minimal human interaction, by making use of morphological operations and blob analysis to classify structures according to their hue, saturation and size. In these experiments we have cultured osteoclasts on dentine slices, and the amount of bone resorption was analysed with the "OsteoPro" software using the techniques described in this paper. Finally "OsteoPro" is compared and contrast with other generic image processing suites, and further enhancements of the procedures used are also discussed.
Bengali, Hindi and Telugu to English Ad-Hoc Bilingual Task at CLEF 2007
Authors: Sivaji Bandyopadhyay, Tapabrata Mondal, Sudip Kumar Naskar, Asif Ekbal, Rejwanul Haque, Srinivasa Rao Godhavarthy
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents the experiments carried out at Jadavpur University as part of the participation in the CLEF 2007 ad-hoc bilingual task. This is our first participation in the CLEF evaluation task and we have considered Bengali, Hindi and Telugu as query languages for the retrieval from English document collection. We have discussed our Bengali, Hindi and Telugu to English CLIR system as part of the ad-hoc bilingual task, the English IR system for the ad-hoc monolingual task and the associated experiments at CLEF. Query construction was manual for Telugu-English ad-hoc bilingual task, while it was automatic for all other tasks.