ppxscal/embedding_network huggingface dataset:
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
Authors: Bo Zeng, Jean-Philippe P. Richard
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

In this paper, we present a systematic method to derive strong superadditive approximations of multidimensional lifting functions using single-dimensional superadditive functions. This constructive approach is based on the observation that, in many cases, the lifting function of a multidimensional problem can be expressed or approximated through the single-dimensional lifting function of some of its components. We then apply our approach to two variants of classical models and show that it yields an efficient procedure to derive strong valid inequalities.
Ambient Intelligence: A Multimedia Perspective
Authors: Emile Aarts
Venue: IEEE MultiMedia (2004)

This article reviews the concept of ambient intelligence and elaborates on its relation with multimedia. The emphasis is on qualitative aspects, highlighting those elements that play a role in realizing ambient intelligence.
Framework and service allocation for network robot platform and execution of interdependent services
Authors: Yukihiro Nakamura, Tamotsu Machino, Manabu Motegi, Yoshiyuki Iwata, Takanori Miyamoto, Satoshi Iwaki, Shin-yo Muto, Ken-ichiro Shimokura
Venue: Robotics and Autonomous Systems (2008)

This research introduces a framework for network robot platform (NWR-PF) and a service allocation method for heterogeneous distributed robots; they cooperate to perform services that include interdependent tasks. The proposed framework is composed of three layers: connection units, the area management gateway, and the robot-user interaction database. The area management gateway and robot-user interaction database treat the information of the users, robots, services, and service history in a uniform manner, because the connection units hide the differences, such as format and protocol, among the heterogeneous robots. The 4W1H matching method is also proposed for service allocation. The method selects the most suitable robots by comparing the elements of user, robot, and service information. Moreover, it generates robot commands in a common format, by combining the service scenario, and service history. A feature of the method is that both robotic functions to execute service and functions that robots possess are described as independent parameters. After the service trigger is received, both the robot and scenario needed to execute the service are decided by matching these parameters. Experiments show that robots controlled by NWR-PF can perform interdependent services by referring to the service history.
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
Authors: Kentaro Kikuchi
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses global proof transformations while the other consists of local ones. Both of them include permutation of cuts to simulate &beta;-reduction in an isomorphic image of the &lambda;-calculus. We establish the confluence properties through a conservativity result on the cut-elimination procedures.
A Role-Based Framework for Multi-agent Teaming
Authors: Jinsong Leng, Jiuyong Li, Lakhmi C. Jain
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Multi-agent teaming is a key research field of multi-agent systems. BDI (Belief, Desire, and Intension) architecture has been widely used to solve complex problems. The theory of joint behavior has been widely used to solve the team level optimisation problems. Due to the inherent complexity of real-time and dynamic environments, it is often extremely complex and difficult to formally specify the joint behavior of the team a priori. This paper presents a role-based BDI framework to facilitate cooperation and coordination problems. This BDI framework is extended and based on the commercial agent software development environment known as JACK Teams. A real-time 2D simulation environment known as soccerbots has been used to investigate the difficulties of multi-agent teaming. The layered architecture has been used to group the agents' competitive and cooperative behaviors, which can be learned through experience by using the reinforcement learning techniques.
Calculating and Modeling Common Parts of Software Product Lines
Authors: Alexander Gruler, Martin Leucker, Kathrin Scheidemann
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

This paper builds on product line CCS (PL-CCS), an algebraic approach to modeling the behavior of software product lines. The semantics of PL-CCS specifications is given in terms of labeled transition systems for individual products as well as for the entire product line and can be derived automatically. In this paper, we extend PL-CCS with a concept for specifying dependencies, show how to integrate it into a development methodology for product lines and validate its practical applicability by modeling a typical reactive system from the automotive domain. Most importantly, due to the algebraic nature of our model, we can derive calculation laws that allow to compute common parts of a product line. The application of the corresponding calculation rules is illustrated in detail with an example. By this, we obtain a formal foundation for restructuring product lines.
Architecting system of systems: artificial life analysis of financial market behavior
Authors: C. H. Dagli, D. Enke
Venue:  (2007)

Today's systems typically do not stand alone in isolation. Often a system fits within a System of Systems, a network of interconnected systems that often exhibits unpredictable behavior. This study is motivated by the challenges of understanding the emergent system level behavior of System of Systems given the opaque characteristics of social processes and continuously changing operating and environmental conditions. An artificial life based framework for modeling System of Systems is presented as an analysis technique. The framework comprises cognitive architectures embedded in multi-agent models. Financial markets are selected as an analysis domain to demonstrate the framework since they are a good example of self-organizing systems that exhibit System of Systems characteristics, specifically emergence on a grand scale. The effects of different mechanisms on system level market dynamics are analyzed. In particular, the effects of the covering mechanism, learning mechanism and bias mechanism are analyzed. A trader-based architecture is proposed to formulate a trader decision model that combines bias mechanisms with learning mechanisms. A prediction accuracy based Learning Classifier System is used to model the trader learning mechanism. Markov processes are utilized to model the bias mechanism of traders. Simulation experiments are generated using the Anylogic5.1&trade; software. Homogenous rational expectations equilibrium is utilized as the benchmark for comparison of results from the hybrid proposed model. The model derived from the framework contributes to understanding the market behavior and potential sources of deviation from efficient market equilibrium. The artificial life based framework provides a flexible way of modeling sub-systems of System of Systems and captures the adaptive and emergent behavior of the system.
On the Hardness of Computing Intersection, Union and&#x00a0;Minkowski Sum of Polytopes
Authors: Hans Raj Tiwary
Venue: Discrete Computational Geometry (2008)

For polytopes P 1,P 2&#x2282;&#x211d;d , we consider the intersection P 1&#x2229;P 2, the convex hull of the union CH(P 1&#x222a;P 2), and the Minkowski sum P 1+P 2. For the Minkowski sum, we prove that enumerating the facets of P 1+P 2 is NP-hard if P 1 and P 2 are specified by facets, or if P 1 is specified by vertices and P 2 is a polyhedral cone specified by facets. For the intersection, we prove that computing the facets or the vertices of the intersection of two polytopes is NP-hard if one of them is given by vertices and the other by facets. Also, computing the vertices of the intersection of two polytopes given by vertices is shown to be NP-hard. Analogous results for computing the convex hull of the union of two polytopes follow from polar duality. All of the hardness results are established by showing that the appropriate decision version, for each of these problems, is NP-complete.
Optimal polarity for dual Reed-Muller expressions
Authors: Khalid Faraj, A. E. A. Almaini
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

In this paper we present two algorithms, which can be used in converting between product of sum (POS) and fixed polarity dual Reed_Muller (FPDRM) and find the optimal polarity for large number of variables. The first algorithm is used to compute the coefficients of FPDRM directly from the truth table of POS. This algorithm is also used to compute the coefficients of POS from FPDRM. The second algorithm will find the optimal polarity among the 2n different polarities for large n-variable functions, without generating all of the polarity sets. This algorithm is based on separating the truth vector of POS and the use of sparse techniques, which will lead to the optimal polarity. Time efficiency and computing speed are thus achieved in this technique.
A probabilistic zonal approach for swarm-inspired wildfire detection using sensor networks
Authors: Chandrasekar Ramachandran, Sudip Misra, Mohammad S. Obaidat
Venue: International Journal of Communication Systems (2008)

In this paper, we propose a novel swarm-inspired system for detecting wildfires using sensor networks. There are three-fold concerns of this paper. The first is the speed of information propagation, the second is the accuracy of the information being propagated and the third is the reliability of the system over a long period of time. With these in mind, we develop a probabilistic model for focusing on responses for query requests in an accurate manner, similar to the assignment of probabilities of occurrence in a distributed database. We follow a data-centric approach where the system executes a swarm-inspired routing and aggregation algorithm. For effective management of the system, zones of reachability are formed which denote areas, which help the sensor nodes in local maintenance, and through an interaction of these zones, a globally robust system is obtained. The system generates various kinds of reports and is connected to disaster response stations. We simulate our proposed system in NS-2 for certain parameters, and more importantly in the presence of failures, to conclude that the system performs well for different scenarios and very well when an optimal zone radius is chosen. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Session-Based QoS Management Architecture for Wireless Local Area Networks
Authors: Badis Tebbani, Kamel Haddadou, Guy Pujolle
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

Growing demands for the public wireless broadband services will require more capacity than the one provided by IP-based service providers (ISPs). The increasing popularity of WLANs due to the use of license-free radio spectrum with low-cost, easily deployable, high-data-rate wireless services, has encouraged service providers to consider their deployment in high density usage areas such us public hotspots to provide complementary broadband access to their networks and services. In order to provide consistent QoS control for multimedia applications (VoIP, VoD,...) over hotspots, a Session Initiation Protocol (SIP) based QoS management architecture is proposed in this article. Performance evaluations are discussed to illustrate the feasibility of the proposed architecture.
PBS: Private Bartering Systems
Authors: Keith Frikken, Lukasz Opyrchal
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Barter trade is a growing part of the world economy. Hundreds of thousands of companies in the US alone participate in barter. Barter is also used in other domains, such as resource management in distributed systems. Existing algorithms for finding barter trades require that values of goods are publicly known (whether they are set by a global function or individual utility functions for each user). The fact that each user must reveal her utility function in order to find barter trades is a potential disincentive to using bartering. We present a first step in the creation of a privacy-preserving bartering system. We present algorithms and privacy-preserving protocols in the honest but curious model for determining the existence of win-win trades (and algorithms and protocols for finding such trades). We discuss a number of remaining open problems and extensions for future work.
SitCom --- Development Platform for Multimodal Perceptual Services
Authors: Pascal Fleury, Jan Cuřín, Jan Kleindienst
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

In this paper we introduce SitCom, a novel software utility for developing context-aware services, editing and deploying context situation models, and simulating perceptual components. SitCom, which stands for Situation Composer, is constructed as an open and extensible framework with rich graphical rendering capabilities, including 3D visualization. One of SitCom's main goals is to simulate interactions among people and objects in various settings such as presentation rooms, meetings halls, social places, homes, or car cockpits. Moreover, SitCom captures and models such environmental context and delivers the abstracted information to context-aware user services. Contextual models are designed as pluggable modules. They can be configured to build hierarchies of contextual models and deployed and reused across applications, agent systems or cognitive architectures. SitCom allows plugging-in various multi-modal sensing components such as body trackers, face detectors, speech recognition engines, gesture recognizers, etc. Therefore, switching from simulated to real components with SitCom is seamless, typically involving no change in the contextual models and the services.
Musimage: A System for Automatically Presenting Pictures Depending on the Music Being Played
Authors: Jesús Ibáñez, David García, Oscar Serrano
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

This paper presents Musimage, a novel system which displays pictures according to the songs being played at the same time. By using the interface the user selects the songs to be played, but the pictures are automatically selected. For each song to be played, the system selects a set of pictures, according to various criteria corresponding to some features of the song. In this sense, the pictures to be shown are, metaphorically, triggered by the songs.
On technological issues affecting online learners' behavior
Authors: Dimitris Stavrinoudis, Michalis Xenos
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

This paper investigates the technological issues that affect the behavior of the users of an e-Learning system. In particular, it examines how user-based quality evaluation is influenced by the way the content of an e-Learning system is structured, as well as by aesthetic issues such as colors used. The paper presents a case study, in which a representative sample of users evaluated two different implementations of an e-learning system, developed particularly for the purposes of this survey. The users' evaluation focuses on three specific factors: the content structure, the navigation and the aesthetics of the system. The main aim of this paper is to determine these factors' effect on e-learning systems users' behavior by gathering and analyzing the opinions of the users who participated in this case study.
Research Center Ambient Intelligence: Assisted Bicycle Team Training
Authors: Bernd Schürmann, Roland Volk
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

Today's bicycle computers and power meters allow cyclists to control the training at any time. But what should be done if several cyclists ride in a group? Here, the cyclists will be stressed differently due to the exploitation of lee. To take maximum advantage of the group, the position of the cyclists has to be changed at the right time. The speed must be in accordance with the overall training or racing goal as well as with the current fitness of all group members. A bicycle demonstrator of the research center "Ambient Intelligence" (AmI) at the University of Kaiserslautern shall optimize this problem.
Cross-Lingual Information Retrieval System for Indian Languages
Authors: Jagadeesh Jagarlamudi, A. Kumaran
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 describes our attempt to build a Cross-Lingual Information Retrieval (CLIR) system as a part of the Indian language sub-task of the main Adhoc monolingual and bilingual track in CLEF competition. In this track, the task required retrieval of relevant documents from an English corpus in response to a query expressed in different Indian languages including Hindi, Tamil, Telugu, Bengali and Marathi. Groups participating in this track were required to submit a English to English monolingual run and a Hindi to English bilingual run with optional runs in rest of the languages. Our submission consisted of a monolingual English run and a Hindi to English cross-lingual run.We used a word alignment table that was learnt by a Statistical Machine Translation (SMT) system trained on aligned parallel sentences, to map a query in the source language into an equivalent query in the language of the document collection. The relevant documents are then retrieved using a Language Modeling based retrieval algorithm. On the CLEF 2007 data set, our official cross-lingual performance was 54.4% of the monolingual performance and in the post submission experiments we found that it can be significantly improved up to 76.3%.
2-inch polycrystalline silicon thin film transistor array using field aided lateral crystallization
Authors: Jae Hoon Jung, Myeong Ho Kim, Young Bae Kim, Duck-Kyun Choi
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

This study presents a technique for fabricating polycrystalline silicon (poly-Si) thin film transistors (TFTs) array from amorphous silicon (a-Si) by field-aided lateral crystallization (FALC) method which utilizes Ni-catalyst and electric field during crystallization. We could uniformly crystallize a-Si channels of 240 × 120 transistor array on 2-inch glass substrate by designing a unique common electrode connected to sources and drains. In order to enhance the uniformity, the current density flowing each cell was simulated. Raman analysis was done on the entire 2-inch array to confirm the crystallinity after the crystallization and it showed the identical Raman peak at 521cm-1 which is the characteristic value of crystalline silicon. The electrical properties of TFTs array turned out to be very uniform with the threshold voltage of 4.03V±0.25 and the subthreshold voltage slope of 1.18V/dec±0.45.
A Decentralized Fusion Algorithm Established in Geodetic Coordinate System for Naval Ships Cooperative Engagement
Authors: Li Duan, Xin-han Huang, Qi-Yuan Li, Bin Luo
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Aiming at naval cooperative engagement problem in wide sea battleground, a decentralized fusion architecture based on geodetic coordinate system for naval ships was presented. To increase the performance of maneuvering target tracking and fusion two efforts are made. On the one hand, more appropriate target motion model and observation model based on geodetic coordinate system are provided, on the other hand, by combining the square root-unscented Kalman filter methodology and the information filter framework, a decentralized fusion algorithm denoted as DSR-UKF is developed. The proposed algorithm can unify tracking and fusion algorithms in short range, intermediate range and long-distance circumstances, and simplifies the system information flow for target calculation. The simulation results show the efficiency and robustness of the proposed algorithm with high precision
Internal Timer Synchronization for Parallel Event Tracing
Authors: Jens Doleschal, Andreas Knüpfer, Matthias S. Müller, Wolfgang E. Nagel
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Performance analysis and optimization is an important part of the development cycle of HPC applications. Among other prerequisites, it relies on highly precise timers, that are commonly not sufficiently synchronized, especially on distributed systems. Therefore, this paper presents a novel timer synchronization scheme especially adapted to parallel event tracing. It consists of two parts. Firstly, recording synchronization information during run-time and, secondly, subsequent correction, i.e. transformation of asynchronous local time stamps to synchronous global time stamps.
Performance Evaluation of IEEE 802.11e EDCA with DCF Improvement Algorithms
Authors: Sueng Jae Bae, Hyung Joo Ki, Min Young Chung
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

In IEEE 802.11 standard, distributed coordination function (DCF) uses binary exponential backoff (BEB) algorithm to resolve collisions. However, performance of DCF with BEB decreases as the number of contending stations increases. To solve this problem, enhanced gentle DCF (EGDCF) and binary negative-exponential backoff algorithm (BNEB) have been proposed. In EGDCF algorithm, each station counts the number of consecutive successful transmissions in present backoff stage. If the number of consecutive successful transmissions reaches the predefined maximum value, station decreases its backoff stage. BNEB algorithm maintains a maximum contention window size during collisions and reduces a contention window size into half after complete transmission without retransmission. Since these two algorithms control backoff stage and contention window based on estimation of the number of stations, they improve performance of DCF. However, DCF cannot support differential quality of services (QoS) So IEEE 802.11e has adopted EDCA for contention-based medium access mechanism. In this paper, we adopt EGDCF and BNEB algorithms into EDCA to effectively support differentiated services in wireless LAN. We evaluate performance of conventional EDCA and EDCA with EGDCF and BNEB under saturation environment.