ppxscal/embedding_network huggingface dataset:
Algorithms and Implementation for Interconnection Graph Problem
Authors: Hongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

The Interconnection Graph Problem (IGP) is to compute for a given hypergraph H = (V, R) a graph G = (V, E) with the minimum number of edges |E| such that for all hyperedges N ¿ R the subgraph of G induced by N is connected. Computing feasible interconnection graphs is basically motivated by the design of reconfigurable interconnection networks. This paper proves that IGP is NP-complete and hard to approximate even when all hyperedges of H have at most three vertices. Afterwards it presents a search tree based parameterized algorithm showing that the problem is fixed-parameter tractable when the hyperedge size of H is bounded. Moreover, the paper gives a reduction based greedy algorithm and closes with its experimental justification.
Personalized Location Area Design with Genetic Algorithm for Future PCS Networks
Authors: Radhika Varadarajan, Emma Regentova, Jun Zheng
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

In Personal Communication Services (PCS) networks, mobile terminals (MT) are communicating frequently using variety of services. The increasing demands for diverse services dictate a high-quality framework for location management. To accomplish this objective, it is necessary to track MTs roving in the system within the time limit to deliver the services in timely manner. The expected reduction of the cell sizes due to transmission power concerns and for better frequency reuse in future PCS networks, and increasing speeds of MTs on the other hand, would cause a considerable signaling in the always updating (AU) strategy adopted in current PCS networks. Personalized location area (PLA) is an efficient way to reduce the location management cost by considering both the movement behavior of the individual users in the networks system and the system parameters. However, the PLA design problem is found to be NP-complete with high computation complexity. In this paper, we try to solve the problem by using the genetic algorithm (GA). Simulation results show that the location management cost of the designed PLAs by GA is significantly lower than that of the AU mechanism.
Storage System Support for Continuous-Media Applications, Part 1: Requirements and Single-Disk Issues
Authors: Pal Halvorsen, Carsten Griwodz, Vera Goebel, Ketil Lund, Thomas Plagemann, Jonathan Walpole
Venue: IEEE Distributed Systems Online (2004)

To meet multimedia servers' increasing performance and scalability requirements, researchers must design multimedia storage system components that adapt to various workloads and requirements. They must also develop strategies for combining components into a single high-performance system.
Development of E-Learning Design Criteria with Secure Realization Concepts
Authors: Christian J. Eibl, Sigrid E. Schubert
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

This article introduces design criteria for e-learning systems based on implications from the disciplines of educational science, software engineering, and information security. Theoretical realization concepts to implement stated requirements are discussed. A conceptual implementation of a proxy server realized within this research project is also presented. This proxy server demonstrates the feasibility of stated concepts and enables outsourcing of security-related tasks to an automated process.
Ontology-Based Design Pattern Recognition
Authors: Damir Kirasić, Danko Basch
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper presents ontology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontologies and analyser. The parser subsystem translates the input code to AST that is constructed as an XML tree. The OWL ontologies define code patterns and general programming concepts. The analyser subsystem constructs instances of the input code as ontology individuals and asks the reasoner to classify them. The experience gained in the implementation of the proposed system and some practical issues are discussed. The recognition system successfully integrates the knowledge representation field and static code analysis, resulting in greater flexibility of the recognition system.
Motion accuracy of NC machine tools
Authors: Marin Doina, Stanciu Ioan, Marin Dan Mihail
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Modern CNC machines have two principal systems: the cutting system and feeding system. Work piece accuracy is the overall outcome of cutting and feeding systems. This paper investigate the contour errors (circular and square corner path) on the bases of a complete CNC system, that includes all group of functions in CNC machining. Trajectory planning, trajectory tracking, the cutting process and the machine structure are established. The dependence of contour errors on trajectory profile (path), feed-rate, cutting depth and frequency response of the table system are investigated as well.
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Authors: Ray-Yaung Chang, Andy Podgurski, Jiong Yang
Venue: IEEE Transactions on Software Engineering (2008)

Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach to revealing neglected conditions that integrates static program analysis and advanced data mining techniques to discover implicit conditional rules in a code base and to discover rule violations that indicate neglected conditions. The approach requires the user to indicate minimal constraints on the context of the rules to be sought, rather than specific rule templates. To permit this generality, rules are modeled as graph minors of enhanced procedure dependence graphs (EPDGs), in which control and data dependence edges are augmented by edges representing shared data dependences. A heuristic maximal frequent subgraph mining algorithm is used to extract candidate rules from EPDGs, and a heuristic graph matching algorithm is used to identify rule violations. We also report the results of an empirical study in which the approach was applied to four open source projects (openssl, make, procmail, amaya). These results indicate that the approach is effective and reasonably efficient.
A P2P Trust Model Based on Dynamic Fuzzy Theory -- BGTR
Authors: Jing Xi, Pengpeng Nie, Jiande Lu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The anonymity and dynamic characters of p2p (peer to peer) system makes p2p become hotbed with selfish and vicious action. In order to solve the problem of node cheating caused by high dynamic property of P2P, this paper designs a security trust model -- BGTR based on the idea of probability model and fuzzy mathematics. The scheme adopts a new query method that the inquiry peer initiates the calculated trust value of the queried peer, and combines it with the global trust value calculated at the same time by the queried peer. The theory of uncertainty is also introduced into three aspects of the model to make more adaptive to real situation, which includes Bayesian distinguish model, the triad of trust value, and the transaction times and interval of time. The BGTR model has been tested in effectiveness of transaction success rate caused by the risk index, and in the properties of anti-interference. The P2P network with BGTR trust model has proved higher security and has better performance to resolve problems of impostors, malicious collective attacks and free-rides.
User-Centric Profiling on the Basis of Cognitive and Emotional Characteristics: An Empirical Study
Authors: Nikos Tsianos, Zacharias Lekkas, Panagiotis Germanakos, Costas Mourlas, George Samaras
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

In order to clarify whether extending learners' profiles in an adaptive educational system to cognitive and emotional characteristics may have a positive effect on performance, we conducted an empirical study that consists of two subsequent experiments. The human factors that were taken into consideration in the personalization process were cognitive style, visual working memory span, control/speed of processing and anxiety. With the exception of control/speed of processing, matching the instructional style to users' characteristics was revealed to be statistically significant in optimizing their performance (n=219). On the basis of this empirical assessment, this paper argues that individual differences at this intrinsic level are important, and their main effect can be manipulated by taking advantage of adaptive technologies.
Efficient pointwise and blockwise encrypted operations
Authors: Tiziano Bianchi, Alessandro Piva, Mauro Barni
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

Signal processing tools working directly on encrypted data could provide an efficient solution to application scenarios where sensitive signals must be protected from an untrusted processing device. In this paper, we investigate an issue usually neglected in the proposed solutions for secure processing in the encrypted domain, that is the data expansion from the plaintext to the encrypted representation of signals, due to the use of cryptosystems operating on very large algebraic structures. A packed signal representation is proposed that allows to speed up pointwise operations on encrypted signal via parallel processing and to reduce the size of the whole encrypted signal.
C programming on waiting line systems
Authors: Ozer Ozdemir
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

In this article, the particular queue will be a place where customers are waiting for service behind each other. For the purpose of this study, a simulation in C language is created in order to simulate the aforementioned queue system. With this simulation, it is aimed to increase customers' satisfaction by decreasing service cost, and to increase the quality of service with minimum waiting time. Considering alternative solutions, the optimal system is obtained to ensure economical stability between the interests of the customers and the management.
Budgeted Allocations in the Full-Information Setting
Authors: Aravind Srinivasan
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We build on the work of Andelman Mansour and Azar, Birnbaum, Karlin, Mathieu Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.
COSAIR: A Platform for AI Education and Research in Computer Strategy Games
Authors: Darko Obradovič
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

Computer strategy games are very challenging for AI agents and highly interesting for students. We present a game platform specifically developed to support practical AI education of students. Featuring all the complexity criteria in a simplified form, it easily supports the evaluation of bots, the reuse of existing AI modules, the inclusion of learning techniques and the sharing of results and code. The platform has been used by a number of students and proved to be in a fairly mature state.
A Summation Algorithm from 11th Century China
Authors: Andrea Bréard
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Mathematical writings in China relied entirely on the algorithmic mode to express sequences of operations, to justify the correctness of these, and to bring mathematical objects in relation one to another. In this paper, I shall use one example to show how the structural elements in an algorithm convey a mathematical meaning and can be interpreted in the light of the ancient Chinese geometrical tradition. The example stems from an 11th century text by Shen Gua ¿¿ and calculates the number of kegs of wine piled up in the form of a truncated pyramid with a rectangular base.
Middleware Support for Performance Improvement of MABS Applications in the Grid Environment
Authors: Dawit Mengistu, Paul Davidsson, Lars Lundberg
Venue: Multi-Agent-Based Simulation VIII: International Workshop, MABS 2007, Honolulu, HI, USA, May 15, 2007, Revised and Invited Papers (2008)

The computational Grid is an infrastructure which enables the execution of applications demanding huge computing resources. Hence, it can be the right environment for large-scale Multi-agent based simulation (MABS) applications. However, due to the nature of the Grid and the characteristics of MABS, achieving optimum performance poses a great challenge. Performance study of MABS applications is therefore a necessary undertaking which requires an understanding of these characteristics and the extent of their influence. Moreover, owing to the dynamicity and heterogeneity of the Grid, it is difficult to achieve performance gains without a middleware support for application deployment and dynamic reconfiguration. This paper presents a study of the key features of MABS applications that affect performance and proposes a supportive middleware to MABS platforms. Experiments show that the proposed middleware can bring performance improvement for MABS applications on the Grid.
Social Animation in Complex Environments
Authors: Francisco Grimaldo, Miguel Lozano, Fernando Barber
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

This work presents a market-based social model to produce good quality behavioral animations for groups of intelligent virtual agents. The social model coordinates the activities of groups of virtual characters and also includes social actions in the agent decision-making. We follow the Multi-Agent Resource Allocation approach presented in [2], where agents express their preferences using utility functions. The dynamics of social interactions is inspired by the theory of Piaget [3] over which we have implemented reciprocal task exchanges.
ViRbot: A System for the Operation of Mobile Robots
Authors: Jesus Savage, Adalberto Llarena, Gerardo Carrera, Sergio Cuellar, David Esparza, Yukihiro Minami, Ulises Peñuelas
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

This paper describes a robotics architecture, the ViRbot, used to control the operation of service mobile robots. It accomplish the required commands using AI actions planning and reactive behaviors with a description of the working environment. In the ViRbot architecture the actions planner module uses Conceptual Dependency (CD) primitives as the base for representing the problem domain. After a command is spoken to the mobile robot a CD representation of it is generated, a rule based system takes this CD representation, and using the state of the environment generates other subtasks represented by CDs to accomplish the command. By using a good representation of the problem domain through CDs and a rule based system as an inference engine, the operation of the robot becomes a more tractable problem and easier to implement. The ViRbot system was tested in the Robocup@Home [1] category in the Robocup competition at Bremen, Germany in 2006 and in Atlanta in 2007, where our robot TPR8, obtained the third place in this category.
Opportunistic Clock Synchronization in a Beacon Enabled Wireless Sensor Network
Authors: Nicola Altan, Erwin P. Rathgeb
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

Wireless sensor networks (WSN) consisting of a large number of tiny inexpensive sensor nodes are a viable solution for many problems in the field of building automation. In order to meet the energy constraints, the nodes have to operate according to an extremely low duty cycle schedule. In such a scenario the reduction of the synchronization error, at least among directly communicating nodes, is a crucial functionality of the MAC layer. We propose a time synchronization mechanism based on the usage of a Kalman Filter (KF) on a smoothed sequence of measured beacon intervals. A side effect of this method is the introduction of a global clock synchronization. The implementation of the proposed solution is feasible on sensor devices with minimum processor, memory and energy capacity.
3D Body Scanning and Healthcare Applications
Authors: Philip Treleaven, Jonathan Wells
Venue: Computer (2007)

Developed largely for the clothing industry, 3D body-surface scanners are transforming our ability to accurately measure and visualize a person's body size, shape, and skin-surface area. Advancements in 3D whole-body scanning seem to offer even greater potential for healthcare applications.
Social acquisition of ontologies from communication processes
Authors: Matthias Nickles
Venue: Applied Ontology (2007)

This work introduces a formal framework for the social acquisition of ontologies which are constructed dynamically from overhearing the possibly conflicting symbolic interaction of autonomous information sources, and an approach to the pragmatics of communicated ontological axioms. Technically, the framework is based on distributed variants of description logic for the formal contextualization of statements w.r.t. their respective provenance, speaker's attitude, addressees, and subjective degree of confidence. Doing so, our approach demarcates from the dominating more or less informal approaches to context and provenance representation on the semantic web, and carefully distinguishes between communication attitudes such as public assertion and intention exhibited on the (semantic) web on the one hand, and mental attitudes such as private belief on the other. Furthermore, our framework provides formal means for the probabilistic fusion of controversial opinions, and presents a semantics of information publishing acts. Our approach provides an incomplex and genuinely social approach to knowledge acquisition and representation, and is thus expected to be widely applicable in fields such as the semantic web and social software, and possibly also in other distributed environments such as P2P systems.
New Implementation Scheme for the Restoration of Voiced Speech Signals
Authors: Šarūnas Paulikas, Dalius Navakauskas
Venue: Informatica (2003)

Recently iterative procedure for the restoration of speech signals when prosodic elements: stress and accent, of comparatively long duration are missing was developed. Alternatively, it could be cast in a signal generation framework. Basing on that view the paper presents the efficient implementation scheme for the restoration of voiced speech signals. It enjoys parallel order of multirate processing utilizing interpolation and decimation filters parameterized by specific to problem coefficients. Presented simulation results confirm the feasibility of developed implementation.
Trust Modeling with Context Representation and Generalized Identities
Authors: Martin Rehák, Michal Pěchouček
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

We present a trust model extension that attempts to relax the assumptions that are currently taken by the majority of existing trust models: (i) proven identity of agents, (ii) repetitive interactions and (iii) similar trusting situations. The proposed approach formalizes the situation (context) and/or trusted agent identity in a multi-dimensional Identity-Context feature space, and attaches the trustworthiness evaluations to individual elements from this metric space, rather than to fixed identity tags (e.g. AIDs, addresses). Trustworthiness of the individual elements of the I-C space can be evaluated using any trust model that supports weighted aggregations and updates, allowing the integration of the mechanism with most existing work. Trust models with the proposed extension are appropriate for deployment in dynamic, ad-hoc and mobile environments, where the agent platform can't guarantee the identity of the agents and where the cryptography-based identity management techniques may be too costly due to the unreliable and costly communication.
On the Connection Between the Phase Transition of the Covering Test and the Learning Success Rate
Authors: Erick Alphonse, Aomar Osmani
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

To investigate the impact of the occurrence of a phase transition (PT) in the covering test on the learning success rate, systematic experiments with several learning algorithms have been conducted on a large set of artificially generated problems by Botta et al. [3]. The authors generated a set of 451 problems by choosing each target concept according to its location in the (m,L) plane with respect to the PT. The "yes", "no" and "pt" regions are uniformly visited by varying (m,L) pairs without replacement (m ranges in [5,30] and L ranges in [12,40]). One important conclusion of their work is that the occurrence of a PT in the covering test is a general problem for all learning algorithms: the PT is viewed as an attractor for the heuristic search of any learning algorithms, which are bound to find a concept definition in the PT. Moreover, for all tested learners, there exists a failure region, starting from the "pt" region to the beginning of the "no" region, where the learnt theories are seemingly randomly constructed, with no better predictive accuracy than random guessing.
Extracting Specific Medical Data Using Semantic Structures
Authors: Kerstin Denecke, Jochen Bernauer
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

In this paper, we discuss the architecture, functionality and performance of a medical information extraction system. The system is based on an approach to automatic generation of semantic structures for free-text. Using a multiaxial nomenclature (Wingert Nomenclature) and existing language-engineering technologies, a conceptual graph-like representation is produced for each sentence of a text. These semantic structures are then exploited to extract information. The components that might be adopted for processing texts in another language than German are identified. Results of first evaluations of the system's performance in an information extraction (IE) subtask in the medical domain are presented: The filling of selected template slots obtained values of 81- 95% precision and 83-97% recall.
Noticeably New: Case Reuse in Originality-Driven Tasks
Authors: Belén Díaz-Agudo, Enric Plaza, Juan A. Recio-García, Josep-Lluís Arcos
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

"Similar problems have similar solutions" is a basic tenet of case-based inference. However this is not satisfied for CBR systems where the task is to achieve original solutions -- i.e. solutions that, even for "old problems," are required to be noticeably different from previously known solutions. This paper analyzes the role of reuse in CBR systems in originality driven tasks (ODT), where a new solution has not only to be correct but noticeably different from the ones known in the case base. We perform an empirical study of transformational and generative reuse applied to an originality driven task, namely tale generation, and we analyze how search in the solution space and consistency maintenance are pivotal for ODT during the reuse process.