ppxscal/embedding_network huggingface dataset:
Representation as a Fluent: An AI Challenge for the Next Half Century
Authors: Alan Bundy, Fiona McNeill
Venue: IEEE Intelligent Systems (2006)

AI systems must be able to manipulate their own internal representations automatically to deal with an infinitely complex and ever-changing world and to scale up to rich, complex applications. Such manipulation must go beyond changing beliefs and learning new concepts in terms of old concepts; it must be able to change an ontology's underlying syntax and semantics. Initial progress has been made, but further progress is urgently needed owing to the demands of autonomous multiagent systems. Understanding and automating this ability must be a major focus of AI for the next 50 years.This article is part of a special issue on the Future of AI.
Assembly Line Reconfiguration Under Disturbances: An Evolutionary Approach to Decision Making
Authors: Sergio M. Ramirez-Campos, Luis M. Torres Trevino, M. Gaston Cedillo Campos, Joge Villegas Leza
Venue: Proceedings of the 15th International Conference on Computing (2006)

Considering the disturbances affect all production lines, this article describes a response mechanism to determine adjustments that conserve or improve profit. The modifications of the product force us to eliminate some tasks and to incorporate others, at the same time as a certain production speed must be satisfied. In order to satisfy these new conditions, the possible positions of each work element are analyzed until we are able to select an appropriate configuration that fulfills a certain goal. In this new configuration the company decides if the changes are to be carried out, after evaluating the cost of relocation of tools, devices, and materials. This focus has two advantages: first, a quick evaluation of many configurations and second, an identification of better configurations. The mechanism in question has been applied successfully in an automotive plant.
Timeslot-sharing algorithm with a dynamic grouping for WDM broadcast-and-select star networks
Authors: Jyh-Horng Wen, Kuo-Ting Huang, Cheng-Ying Yang, Tzu-Chen Tsai
Venue: Journal of Systems and Software (2006)

The all-to-all transmission schedule is suitable for Wavelength division multiplexing (WDM) broadcast-and-select star networks under uniform traffic patterns. The performance suffers degradation under non-uniform traffic conditions. The timeslot-sharing algorithm with a dynamic grouping is proposed to decrease the degradation under the non-uniform traffic matrices. According to a given traffic matrix, the algorithm decomposes the given traffic matrix into a transmission matrix and a residual matrix. The algorithm aims to obtain a transmission matrix with most entries and to approach a uniform traffic matrix. Also, its complexity is evaluated. In the simulations, the system with the proposed algorithm provides a superior performance based on throughput, packet delay and node's buffer size. The results show that the algorithm is an efficient solution to improve the performance under uniform and non-uniform traffic distributions.
The DISCO network calculator: a toolbox for worst case analysis
Authors: Jens B. Schmitt, Frank A. Zdarsky
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

In this paper we describe the design, implementation, and analytical background of the DISCO Network Calculator. The DISCO Network Calculator is an open-source toolbox written in Java&trade; which we developed for worst-case analyses based on network calculus. To our knowledge it is the first of its kind. It allows to do network analyses regarding performance characteristics such as delay and backlog bounds for piecewise linear arrival and service curves. We illustrate the tool's usefulness by two comprehensive example applications.
Research of SMS-Based Highly Distributed Data Acquisition System
Authors: Qichang Duan, Li Mao, Congli Zhang, L Zhang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper has presented a SMS (Short Message Service)-based wireless solution for a highly distributed data acquisition system. This system is a three-hierarchy model. At the top level is a master station which acquires data from multiple slave stations distributed in a very wide area. These slave stations are considered at the middle level and they communicate with the master station by SMS through GSM network. Each slave station also acts as a master in its own local RS485 network to which several temperature detection modules are connected. These temperature detection modules are thought at the lowest level. This paper has analyzed the general structure of this whole system; focused on the hardware and software implementation of one of its most important parts: the slave station; and described the communication protocol between the slave station and the master station.
Crime Pattern Detection Using Data Mining
Authors: Shyam Varan Nath
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Data mining can be used to model crime detection problems. Crimes are a social nuisance and cost our society dearly in several ways. Any research that can help in solving crimes faster will pay for itself. About 10% of the criminals commit about 50% of the crimes. Here we look at use of clustering algorithm for a data mining approach to help detect the crimes patterns and speed up the process of solving crime. We will look at k-means clustering with some enhancements to aid in the process of identification of crime patterns. We applied these techniques to real crime data from a sheriff's office and validated our results. We also use semi-supervised learning technique here for knowledge discovery from the crime records and to help increase the predictive accuracy. We also developed a weighting scheme for attributes here to deal with limitations of various out of the box clustering tools and techniques. This easy to implement data mining framework works with the geo-spatial plot of crime and helps to improve the productivity of the detectives and other law enforcement officers. It can also be applied for counter terrorism for homeland security.
On some properties of grounding uniform sets of modal conjunctions
Authors: Radoslaw P. Katarzyniak
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2006)

In this paper the language grounding problem is considered for a modal language consisting of logic conjunctions extended with modal operators of knowledge, belief and possibility. This language is grounded in an artificial cognitive agent which is located in a world built from objects that can exhibit particular sets of properties. This cognitive agent is equipped with sensors that make it possible to observe states of properties in external objects. Results of observations (reflections of objects) are collected and treated as the source of data which induces internal meaning accessible to the agent. This meaning is assigned to modal conjunctions. The triple of a modal conjunction, the embodied empirical content and an external object are a particular case of semiotic triangle concept within which the phenomenon of language grounding is modelled and studied. It is assumed that conditions for proper grounding of modal conjunctions are defined by the so called epistemic satisfaction relations which specify what empirical content should be collected in the cognitive agent in order to embody commonsense meaning of modal conjunctions. It is proved in this paper that the accepted definition for epistemic satisfaction results in desirable language behaviour corresponding to commonsense intentional semantics and pragmatics of natural language discourse. The desirable language expectations are considered for uniform sets of modal conjunctions.
Reconfigurable acoustic modem for underwater sensor networks
Authors: Ethem Mutlu Sözer, Milica Stojanovic
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

There is a growing interest for underwater sensor networks where long term monitoring of water masses around the world for scientific, environmental, commercial, and military reasons is desired. In this paper we will present the concept of a highly flexible acoustic modem called the Reconfigurable Modem (rModem) that can be used for rapid testing and development of such networks.
Evaluation of a Large Scale Lookup Algorithm in ASP Based Grids
Authors: L. Philippe, S. Damy, B. Herrmann, I. Djama, S. Dahan
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

The Internet development and the availability of reliable networks led to the emergence of Grid architectures. The aim of these architectures is to take benefit of widely distributed resources to improve execution possibilities. Depending on their properties, these architectures are usually classified into desktop grids, resources grids and application based grids. Application based grids provide an easy access to applications deployed on the grid on the ASP (Application Service Provider) mode. When these grids grow of orders of magnitude, application lookup will become a costly activity of the grid. In this article, we study how a lookup algorithm scales when the size of the grid grows up. We exhibit a "lookup throughput" which characterizes the grid interconnections graph and the lookup algorithm.
Caribbean/Q: A Massively Multi-Agent Platform with Scenario Description Language
Authors: Yuu Nakajima, Hironori Shiina, Shohei Yamane, Hirofumi Yamaki, Toru Ishida
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Making a truly useful massively multi-agent system is difficult since the actions of the full ensemble of agents cannot be controlled by designing just one agent. It is critical to control all the agents by using protocols that describe the interaction of agents and the environment in a top-down approach. We introduce a system that uses interaction protocol descriptions and has the capability of controlling hundreds of thousands of agents. This makes it feasible to realize a mega-scale navigation system that can assist the inhabitants of a small city. In developing a massively multiagent system, protocol design and agent development need to be separated to allow specialists to work in concert with one another while honing the different technologies. As a platform for mega-scale navigation system, we devise an architecture for multiagent platforms where the execution of agents scenario and the implementation of agents are explicitly separated. This paper also gives the evaluation and an application example using the platform.
Inference of Design Pattern Instances in UML models via Logic Programming
Authors: Dae-Kyoo Kim, Lunjin Lu
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

This paper formalizes the notion of a design model structurally conforming to a design pattern by representing the model as a logic program whilst the pattern as a query. The conformance of a model to a design pattern is equivalent to the satisfaction of the query by the logic program. Harnessing logic inference capability of logic programming languages, we obtain an automated method that infers all the instances of a design pattern in a UML class diagram. We use the Visitor pattern and a price calculation application to demonstrate the technique.
An Effective Array for 2-D Direction-of-Arrival Estimation
Authors: Maohui Xia, Cai Liu, Ruiyan Du, Jin Li
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

This paper presents an effective antenna array based on MUSIC algorithm for two-dimensional direction-of-arrival estimation of multiple narrow-band sources impinging on the far field of the antenna array. Compared with the previous work, the proposed array can improve the performance of MUSIC algorithm, such as it can resolve the incoming rays with very close azimuth angles or very close elevation angles. In addition, the paring of the estimated azimuth angles and elevation angles is automatically determined.
Automated database and schema-based data interchange for modeling and simulation
Authors: Gregory A. Harrison, David S. Maynard, Eytan Pollak
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Creating a simulation of a large enterprise system by manually coding all the details into a simulator tool is not just time consuming, but yields a system that is difficult to maintain. By separating the model-configuration data from the models, a higher level of automation can be achieved, and enhance the usefulness of the simulation. The underlying data can be manipulated by the subject matter experts, and then transformed into the appropriate structure for simulator use. This paper describes a method that automatically configures a simulation using external data that interfaces to generic processing flow. The models and the simulation were co-designed along with the interchange data representation to enable generic models to be configured under software sequenced by a workflow system. This allowed model re-use, and automatic configuration changes, in support of optimization. We also describe the application of this technique to the simulation of an enterprise, student-training system.
Validating the capacity planning process and flowline product sequencing through simulation analysis
Authors: Jon H. Marvel, Mark A. Schaub, Gary Weckman
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This article illustrates the integration of discrete event simulation into the capacity planning process of a tier two automobile supplier. In this application, the capacity planning process is able to generate a feasible schedule for the 30% of the product line which generates 80% of the business. The schedule is "feasible" based on the ability to produce sufficient inventory to cover customer demand. The capacity planning process was unable to develop a schedule for the production of the remaining 70% of the product line or take into account shortages in customer supplied materials used in the production process. Simulation is used to validate the capacity planning process as well as generate a feasible schedule for the remaining products during the planning period as well as: evaluating the plan for customer supplied materials; identifying potential areas for improvement in the production process and determining material storage requirements for the facilities planner.
A Greedy Search Approach to Co-clustering Sparse Binary Matrices
Authors: Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

A co-clustering algorithm for large sparse binary data matrices, based on a greedy technique and enriched with a local search strategy to escape poor local maxima, is proposed. The algorithm starts with an initial random solution and searches for a locally optimal solution by successive transformations that improve a quality function which combines row and column means together with the size of the co-cluster. Experimental results on synthetic and real data sets show that the method is able to find significant co-clusters.
Critical densities in hard sphere packings. Delaunay simplex analysis.
Authors: A. V. Anikeenko, N. N. Medvedev, A. Elsner, K. Lochmann, D. Stoyan
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

A large set of computer models (more then 200 models) of hard sphere packings with packing fraction n between 0.52 - 0.72 is examined. Every packing consist of 10.000 identical spheres in the model box with periodic boundary conditions. Delaunay simplexes (quadruples of mutually closest spheres) with shape resembling to perfect tetrahedron or quartoctahedron are studied. Fraction of such simplexes is studied as a function of packing density. Structure changes at the transition from disordered to crystalline phase are discussed. A limited packing fraction of the non-crystalline packing is estimated as 0.6455±0.0015. The ratio of tetrahedral to quartoctahedral simplexes (T/Q) in the packing at this density provided to be close to 2/3. We pay attention to one more critical interval of density at around n=0.665 ±0.005. At this density the crystalline nuclei which were in the packing run into unified crystal and the ratio T/Q reaches a crystalline value 1/2.
A Fault Tolerant Infrastructure for Mobile Agen
Authors: Summiya Summiya, Kiran Ijaz, Umar Manzoor, Arshad Ali Shahid
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Mobile agent technology is a promising paradigm for a myriad of real world applications. Owing to their tremendous capabilities, multiagent systems have been scoped in a large number of applications. However issues related to fault tolerance can hamper the suitability of mobile agents in these real world systems. In this paper we have proposed an infrastructure which provides agent fault tolerance. An algorithm similar to the sliding window model ensures a fault tolerant behavior. Different types of agents, work in collaboration to provide the desired system behavior by tolerating faults. The proposed infrastructure will be applicable in a variety of systems including, ecommerce, online banking etc. With the increasing market of electronic commerce it becomes an interesting aspect to use autonomous mobile agents for electronic business transactions.
Graph Grammar Induction on Structural Data for Visual Programming
Authors: Keven Ates, Jacek Kukluk, Lawrence Holder, Diane Cook, Kang Zhang
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph grammars. As graph grammars are usually constructed manually, construction can be a time-consuming process that demands technical knowledge. Therefore, a technique for automatically constructing graph grammars--at least in part--is desirable. An induction method is given to infer node replacement graph grammars. The method operates on labeled graphs of broad applicability. It is evaluated by its performance on inferring graph grammars from various structural representations. The correctness of an inferred grammar is verified by parsing graphs not present in the training set.
Robust variational speech separation using fewer microphones than speakers
Authors: S. Rennie, P. Aarabi, T. Kristjansson, B. J. Frey, K. Achan
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A variational inference algorithm for robust speech separation, capable of recovering the underlying speech sources even in the case of more sources than microphone observations, is presented. The algorithm is based upon an generative probabilistic model that fuses time-delay of arrival (TDOA) information with prior information about the speakers and application, to produce an optimal estimate of the underlying speech sources. Simulation results are presented for the case of two, three and four underlying sources and two microphones observations corrupted by noise. The resulting SNR gains (32 dB with two sources, 23 dB with three sources, and 16 dB with four sources) are significantly higher than previous speech separation techniques.
Server-Initiated Byzantine Agreement over Two-Level Combined Wired/Wireless Networks
Authors: Chien-Fu Cheng, Shu-Ching Wang, Tyne Liang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In previous results, most existing Byzantine Agreement (BA) protocols are designed for pure wired or pure wireless networks. In practice, most current networks are combined wired and wireless environments. In this paper, we extend the BA problem over combined wired/wireless network, consisting of both powerful computing processor and low-power mobile processor. Furthermore, the communication overhead of the BA protocol is inherently large because the BA protocol requires numerous rounds to exchange messages. Secure group communications over a combined wired/wireless network is very important. The protocols proposed in this paper use the hierarchical model concept to reduce the communication overhead and provide secure group communications well suited for combined wired/wireless networks.
On the logical implication of multivalued dependencies with null values
Authors: Sebastian Link
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). While axiomatisability, implication problem and many design problems have been intensely studied with respect to this notion, almost no research has been devoted towards the alternative notion of implication in which the underlying universe of attributes is left undetermined (Biskup 1980).A milestone in the advancement of database systems was the permission of null values in databases. In particular, many achievements on MVDs have been extended to encompass incomplete information. Multivalued dependencies with null values (NMVDs) were defined and axiomatised in (Lien 1982). The definition of NMVDs is again based on a fixed underlying universe of attributes, and any complete set of inference rules requires therefore some version of the complementation rule.In this paper we show that the axiomatisation in (Lien 1982) does not reflect the fact that the complementation rule is merely a means to achieve database normalisation. Moreover, we provide an alternative axiomatisation for NMVDs that does reflect this property. We also suggest an alternative notion for the implication of NMVDs in which the underlying universe is left undetermined, and propose several sound and complete sets of inference rules for this notion. Moreover, a correspondence between (minimal) axiomatisations in fixed universes that do reflect the property of complementation and (minimal) axiomatisations in undetermined universes is shown.
New Scheme of Implementing Real-Time Linux
Authors: Xue-Yu Hong, Ling Zhang, Jin-Long Hu
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

To well support the real-time requirement from applications, we enhance the real-time ability in Linux kernel through two new kernel mechanisms. Firstly, we present a new microsecond-level timer mechanism based on UTIME provided by Kurt-Linux, but different from it. The new timing implementation provides more flexible mechanism to support the different-grained timing requirement, as well as more flexible and preferential management of microsecond-level timers. Secondly, we present a new interrupt handler to reduce the kernel delay, which makes it possible scheduling interrupt handler with other processes under the system scheduler. Therefore, making interrupt routine under control is achieved. The experiments show that the improvements are distinct and significant.