ppxscal/embedding_network huggingface dataset:
An Agent Architecture for Network Support of Distributed Simulation Systems
Authors: Robert Simon, Woan Sun Chang, J. Mark Pullen
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Continued research into distributed agent-based systems and evolving web based technologies are opening up tremendous possibilities for the deployment of large scale andhighly extensible and flexible simulation systems. However, the question remains as to how well agent and web based simulation systems can use underlying network services. This is especially true for complex distributed simulations that have multiple participants and real-time data delivery requirements. This paper addresses the issue of interconnection patterns among web-based simulation agents. We first describe a simple agent-oriented architectural extension to an existing distributed simulation system. Next, we present a set of interconnection algorithms between the agents in the system, under the assumption that only end-host multicast is available. We experimentally evaluate our approach under a number of different scenarios. Our results show that by using a proper connection strategy it is possible to get performance comparable to network-layer multicast for agent-based systems that use end-host multicast.
Acquiring design rationale automatically
Authors: Karen L. Myers, Nina B. Zumel, Pablo Garcia
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The value of comprehensive rationale for documenting a design has long been recognized. However, designers rarely produce detailed rationale in practice because of the substantial time investment required. Efforts to support the acquisition of rationale information have focused on languages and tools for structuring the acquisition process, but still require substantial involvement on the part of the designer. This paper describes an experimental system, the Rationale Construction Framework (RCF), that acquires rationale information for the detailed design process without disrupting a designer's normal activities. The underlying approach involves monitoring designer interactions with a commercial computer-assisted design (CAD) tool to produce a rich process history. This history is subsequently structured and interpreted relative to a background theory of design metaphors that enable explanation of certain aspects of the design process. The framework provides an environment that can acquire rich, meaningful rationale information in a time- and cost-effective manner, with minimal disruption to the designer.
Extensionally defining principles and cases in ethics: an AI model
Authors: Bruce M. McLaren
Venue: Artificial Intelligence (2003)

Principles are abstract rules intended to guide decision-makers in making normative judgments in domains like the law, politics, and ethics. It is difficult, however, if not impossible to define principles in an intensional manner so that they may be applied deductively. The problem is the gap between the abstract, open-textured principles and concrete facts. On the other hand, when expert decision-makers rationalize their conclusions in specific cases, they often link principles to the specific facts of the cases. In effect, these expert-defined associations between principles and facts provide extensional definitions of the principles. The experts operationalize the abstract principles by linking them to the facts.This paper discusses research in which the following hypothesis was empirically tested: extensionally defined principles, as well as cited past cases, can help in predicting the principles and cases that might be relevant in the analysis of new cases. To investigate this phenomenon computationally, a large set of professional ethics cases was analyzed and a computational model called SIROCCO, a system for retrieving principles and past cases, was constructed. Empirical evidence is presented that the operationalization information contained in extensionally defined principles can be leveraged to predict the principles and past cases that are relevant to new problem situations. This is shown through an ablation experiment, comparing SIROCCO to a version of itself that does not employ operationalization information. Further, it is shown that SIROCCO's extensionally defined principles and case citations help it to outperform a full-text retrieval program that does not employ such information.
Identification structures using rational wavelets: examples of application
Authors: Liliana R. Castro, Osvaldo E. Agamennoni, Carlos E. D'Attellis
Venue: Applied Numerical Mathematics (2003)

In this paper we present three examples that show the applications of a black-box identification structure already defined. This structure can be described as a concatenation of a mapping from observed data to a finite set of linear filters realized using rational wavelets, and a nonlinear mapping from the output of the linear dynamic part to the system output represented by a hidden layer perceptron neural network, or a basis (that might be orthonormal) of high level canonical piecewise linear functions. The wavelets used for identifying the linear dynamic part are selected taking into account the linear dynamics of the system and consequently they can be considered as semiphysical regressors. Also, this structure allows to approximate the dynamic evolution of any nonlinear, causal, time-invariant system with fading memory.
Can a parser be generated from examples?
Authors: Marjan Mernik, Goran Gerlič, Viljem Žumer, Barrett R. Bryant
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming language design. Possible approaches are to build a domain-specific language from parameterized building blocks or by language (grammar) induction. This paper uses an evolutionary approach to grammar induction. Grammar-specific genetic operators for crossover and mutation are proposed to achieve this task. Suitability of the approach is shown by small experiments where underlying grammars are successfully genetically obtained and parsers are than automatically generated.
FPGA Implementation of Carrier Synchronization for QAM Receivers
Authors: Chris Dick, Fred Harris, Michael Rice
Venue: Journal of VLSI Signal Processing Systems (2004)

Software defined radios (SDR) are highly configurable hardware platforms that provide the technology for realizing the rapidly expanding third (and future) generation digital wireless communication infrastructure. While there are a number of silicon alternatives available for implementing the various functions in a SDR, field programmable gate arrays (FPGAs) are an attractive option for many of these tasks for reasons of performance, power consumption and flexibility. Amongst the more complex tasks performed in a high data rate wireless system is synchronization. This paper examines carrier synchronization in SDRs using FPGA based signal processors. We provide a tutorial style overview of carrier recovery techniques for QPSK and QAM modulation schemes and report on the design and FPGA implementation of a carrier recovery loop for a 16-QAM modern. Two design alternatives are presented to highlight the rich design space accessible using configurable logic. The FPGA device utilization and performance for a carrier recovery circuit using a look-up table approach and CORDIC arithmetic are presented. The simulation and FPGA implementation process using a recent system level design tool called System Generator&trade; for DSP described.
Incorporating linkage learning into the GeLog framework
Authors: Tim Fühner, Gabriella Kókai
Venue: Acta Cybernetica (2003)

This article introduces modifications that have been applied to GeLog, a genetic logic programming framework, in order to improve its performance. The main emphasis of this work is the structure processing of genetic algorithms. As studies have shown, the linkage of genes plays an important role in the performance of genetic algorithms. Thus, different approaches that take linkage learning into account have been reviewed and the most promising has been implemented and tested with GeLog. It is demonstrated that the modified program solves problems that proved hard for the original system.
Pervasive Computing in Emergency Situations
Authors: Vassilis Kostakos, Eamonn O'Neill
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Pervasive computing is still in its infancy and is mainly used in tightly constrained situations and environments. Examples such as "smart houses" are constrained both physically and conceptually. As a result, their computing power is not genuinely pervasive. This paper looks at how we can introduce pervasive systems in everyday large-scale public environments that are not tightly controlled or monitored. The impact of social issues on pervasive computing is discussed, along with ideas on overcoming the challenges posed by social requirements and constraints.
Ant-routing-algorithm for mobile multi-hop ad-hoc networks
Authors: Mesut Günes, Otto Spaniol
Venue: Network control and engineering for Qos, security and mobility II (2003)

A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These networks have an important advantage, they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. This flexibility, however, comes at a price: communication is difficult to organize due to frequent topology changes.The Ant-Colony-Based Routing Algorithm (ARA) is highly adaptive, efficient and scalable. It is based on ant algorithms which are a class of swarm intelligence. Ant algorithms try to map the solution capability of ant colonies to mathematical and engineering problems.In this paper we present some extensions to the basic idea and show through simulation results the performance gain and compare it with AODV and DSR.
A finite element model of exit burrs for drilling of metals
Authors: L. Ken Lauderbaugh Saunders
Venue: Finite Elements in Analysis and Design (2003)

A finite element model is presented to address the limitations of classical models of burr formation in drilling. In this finite element model, 2D analysis is used to predict the temperature distribution and stress state in the workpiece. Material removal is simulated through the use of element death and continues until a failure condition is predicted. At the point of failure, the remaining material is bent out to form the burr. The FEA model is compared with previous "classical" models as well as experimental data for 2024 aluminum.
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
Authors: Fumiaki Okushi, Allen Van Gelder
Venue: Annals of Mathematics and Artificial Intelligence (2004)

Model elimination is a back-chaining strategy to search for and construct resolution refutations. Recent extensions to model elimination, implemented in Modoc, have made it a practical tool for satisfiability checking, particularly for problems with known goals. Many formulas can be refuted more succinctly by recording certain derived clauses, called lemmas. Lemmas can be used where a clause of the original formula would normally be required. However, recording too many lemmas overwhelms the proof search. Lemma management has a significant effect on the performance of Modoc. Earlier research studied pure persistent (global) strategies, and pure unit-lemma (local) strategies. This paper describes and evaluates a hybrid strategy to control the lifetime of lemmas, as well as a new technique for deriving certain lemmas efficiently, using a lazy strategy. Unit lemmas are recorded locally as in previous practice, but certain lemmas that are considered valuable are asserted globally. A range of functions for estimating value is studied experimentally. Criteria are reported that appear to be suitable for a wide range of application-derived formulas.
A neural network simulating human reach grasp coordination by continuous updating of vector positioning commands
Authors: Antonio Ulloa, Daniel Bullock
Venue: Neural Networks (2003)

We developed a neural network model to simulate temporal coordination of human reaching and grasping under variable initial grip apertures and perturbations of object size and object location/orientation. The proposed model computes reach-grasp trajectories by continuously updating vector positioning commands. The model hypotheses are (1) hand/wrist transport, grip aperture, and hand orientation control modules are coupled by a gating signal that fosters synchronous completion of the three sub-goals. (2) Coupling from transport and orientation velocities to aperture control causes maximum grip apertures that scale with these velocities and exceed object size. (3) Part of the aperture trajectory is attributable to an aperture-reducing passive biomechanical effect that is stronger for larger apertures. (4) Discrepancies between internal representations of targets partially inhibit the gating signal, leading to movement time increases that compensate for perturbations. Simulations of the model replicate key features of human reach-grasp kinematics observed under three experimental protocols. Our results indicate that no precomputation of component movement times is necessary for online temporal coordination of the components of reaching and grasping.
Real-time depth-cueing beyond fogging
Authors: Daniel Weiskopf, Thomas Ertl
Venue: Journal of Graphics Tools (2002)

We propose a generic and flexible depth-cueing scheme which subsumes a large class of color-based depth-cueing approaches. In particular, it includes standard fog-based depth-cueing and widely neglected saturation depth-cueing. Our depth-cueing scheme is based on linear transformations in the 3D tristimulus space of colors and on weighted sums of colors. Since all of the required operations are supported by contemporary consumer graphics hardware, the depth-cueing scheme can be implemented with minimal reduction of performance. Therefore, any real-time rendering application can be enriched by sophisticated depth-cueing.
Mining concept-drifting data streams using ensemble classifiers
Authors: Haixun Wang, Wei Fan, Philip S. Yu, Jiawei Han
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Recently, mining data streams with concept drifts for actionable insights has become an important and challenging task for a wide range of applications including credit card fraud protection, target marketing, network intrusion detection, etc. Conventional knowledge discovery tools are facing two challenges, the overwhelming volume of the streaming data, and the concept drifts. In this paper, we propose a general framework for mining concept-drifting data streams using weighted ensemble classifiers. We train an ensemble of classification models, such as C4.5, RIPPER, naive Beyesian, etc., from sequential chunks of the data stream. The classifiers in the ensemble are judiciously weighted based on their expected classification accuracy on the test data under the time-evolving environment. Thus, the ensemble approach improves both the efficiency in learning the model and the accuracy in performing classification. Our empirical study shows that the proposed methods have substantial advantage over single-classifier approaches in prediction accuracy, and the ensemble framework is effective for a variety of classification models.
Application of component state model for identifying constructability conflicts in a merged construction schedule
Authors: David K. H. Chua, Yuanbin Song
Venue: Advances in Engineering Software (2003)

Project schedules developed by various project players often reveal conflicts when they are merged together. The main challenge of communication among the constructors lies in the implicit interfacial dependencies between the project activities. The Component State Model (CSM) integrates the building product, construction process and constructability criteria. An activity cannot start until it fulfils the triggering criteria. These criteria present the preconditions explicitly to facilitate the communication. The inference engine can perform a schedule simulation to determine the potential constructability conflicts using the constructability knowledge represented as component type and activity type. The application of CSM is illustrated using an example to show the interaction of the pipe installation and wall plastering activities.
Adapting support vector machine methods for horserace odds prediction
Authors: David Edelman
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The methodology of Support Vector Machine Methods is adapted to enable the analysis of stratified outcomes such as horseracing results. As the strength of the Support Vector Machine approach lies in the apparent ability to produce generalisable models when the dimensionality of the inputs is large relative to the the number of observations, such methodology would appear to be particularly appropriate in the horseracing context, where the often number of input variables deemed as being potentially relevant can be difficult to reconcile with the scarcity of relevant race results. The methods are applied to a relatively small (200 races in-sample) sample of Australian racing data and tested on 100 races out-of-sample with promising results, especially considering the relatively large number (12) of input variables used.
The Cougar Project: a work-in-progress report
Authors: Alan Demers, Johannes Gehrke, Rajmohan Rajaraman, Niki Trigoni, Yong Yao
Venue: ACM SIGMOD Record (2003)

We present an update on the status of the Cougar Sensor Database Project, in which we are investigating a database approach to sensor networks: Clients "program" the sensors through queries in a high-level declarative language (such as a variant of SQL). In this paper, we give an overview of our activities on energy-efficient data dissemination and query processing. Due to space constraints, we cannot present a full menu of results; instead, we decided to only whet the reader's appetite with some problems in energy-efficient routing and in-network aggregation and some thoughts on how to approach them.
Predicting e-services adoption: a perceived risk facets perspective
Authors: Mauricio S. Featherman, Paul A. Pavlou
Venue: International Journal of Human-Computer Studies (2003)

Internet-delivered e-services are increasingly being made available to consumers; however, little is known about how consumers evaluate them for potential adoption. Past Technology Adoption Research has focused primarily on the positive utility gains attributable to system adoption. This research extends that approach to include measures of negative utility (potential losses) attributable to e-service adoption. Drawing from Perceived Risk Theory, specific risk facets were operationalized, integrated, and empirically tested within the Technology Acceptance Model resulting in a proposed e-services adoption model. Results indicated that e-services adoption is adversely affected primarily by performance-based risk perceptions, and perceived ease of use of the e-service reduced these risk concerns. Implications of integrating perceived risk into the proposed e-services adoption model are discussed.
Performance evaluation of Westwood+ TCP over WLANs with Local Error Control
Authors: Luigi A. Grieco, Saverio Mascolo
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Link layer error control is widely adopted in WirelessLANs (WLANs) to hide the unreliability of the wirelesschannel to higher level protocols. This allows classic end-to-end congestion control algorithms to achieve acceptablethroughput even in the presence of radio links. Thepresent work investigates the performance of Westwood+and NewReno TCP over a noisy wireless LAN channel. Inparticular, the effect of local error control persistency on theend-to-end performances of Westwood+ and NewReno TCPis addressed. The investigation has been carried out by usingns-2 computer simulation. Simulation results show that(1) in the presence of uniformly distributed packet losses awell tuned local error control leads both Westwood+ andNewReno TCP to full network utilization; (2) in the presenceof bursty losses Westwood+ TCP improves the good-putwith respect to NewReno TCP also in the presence oflocal error control; in particular, Westwood+ TCP requiresa smaller number of retransmissions at the link layer thanNew Reno to achieve full utilization of the wireless channel.
Managing virtual knowledge networks: topology and performance
Authors: Gregor Schrott, Daniel Beimborn
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Virtual informal communication networks are widely recognized as an important part of corporate knowledge management (KM). Unfortunately, most practices of community-engineering are characterized by intuitive actions from KM managers rather than systematic network development based on detailed analysis. Therefore, as part of a larger research framework, this paper addresses topological structures as action variable of community-engineering. A dynamic computer-based simulation model is introduced and applied to real-life data from over 800 students and staff of the Economics and Business Administration Department at Frankfurt University, Germany. Several metrics of networks performance are developed and illustrated using different exemplary actions of community-engineering.
Using Information Systems to Structurally Map Workplace Injury
Authors: David F. Brown, Andrea K. Kirk
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Previous authors have identified mechanical, human and work organisation factors that may contribute to accident occurrences and have noted the value of site-specific data in accident analysis. However, major criticisms of site-specific safety information systems have focused on the difficulties using traditional approaches for the identification of critical paths involving processes related to injury and non-injury incidents. This paper presents an idiographic approach to the study of accidents and through contextual analysis develops maps of workprocesses related to injury incidents in mining. The information used in the contextual maps includes data related to work area, activity and work role being performed, and equipment being used at the time of the injury incident. The computer algorithm consists of series of contextual conditionals where the incidents and lost days recorded in the final category of each pathway meet all of the conditionals of the previous categories. The order of selection indicates the criticality of the path. The analysis resolves the processes related to the incidentinto their constitutive components, and then redescribes these processes as paths in order to reveal associations. These contextual paths illustrate the processes which are part of an established pattern of recurring regularities associated with injury incidents.