ppxscal/embedding_network huggingface dataset:
When to Use a Multi-Agent System?
Authors: Paul Bogg, Ghassan Beydoun, Graham Low
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

The decision of which development approach to adopt (e.g. traditional, object oriented, agent oriented) is often taken after identifying the specific features of the problem. If agent oriented software engineering (AOSE) is to be taken seriously as a software engineering paradigm, then a clearly identifiable set of criteria of when to apply it, as distinguished from other alternatives such as object-oriented practices, is necessary. The paper is part of an effort to determine when is best to adopt a Multi Agent System approach, identifying a number of critical factors to include in a decision framework.
Modelling the Grammatical Circle of the Pāninian System of Sanskrit Grammar
Authors: Anand Mishra
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

In the present article we briefly sketch an extended version of our previously developed model for computer representation of the Pāninian system of Sanskrit grammar. We attempt to implement an antecedent analytical phase using heuristical methods and improve the subsequent phase of reconstitution using the rules of Aṣṭādhyāyī by incorporating strategies for automatic application of grammatical rules.
BACH: Bounded reachAbility CHecker for linear hybrid automata
Authors: Lei Bu, You Li, Linzhang Wang, Xuandong Li
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Hybrid automata are well studied formal models for hybrid systems with both discrete and continuous state changes. However, the analysis of hybrid automata is quite difficult. Even for the simple class of linear hybrid automata, the reachability problem is undecidable. In the author's previous work, for linear hybrid automata we proposed a linear programming based approach to check one path at a time while the length of the path and the size of the automaton being checked can be large enough to handle problems of practical interest. Based on this approach, in this paper we present a prototype tool BACH to perform bounded reachability checking of linear hybrid automata. The experiment data shows that BACH has good performance and scalability, and supports our belief that BACH could become a powerful assistant to design engineers for the reachability analysis of linear hybrid automata.
Hardware-dependent software synthesis for many-core embedded systems
Authors: Samar Abdi, Gunar Schirner, Ines Viskic, Hansu Cho, Yonghyun Hwang, Lochi Yu, Daniel Gajski
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents synthesis of Hardware Dependent Software (HdS) for multicore and many-core designs using Embedded System Environment (ESE). ESE is a tool set, developed at UC Irvine, for transaction level design of multicore embedded systems. HdS synthesis is a key component of ESE backend design flow. We follow a design process that starts with an application model consisting of C processes communicating via abstract message passing channels. The application model is mapped to a platform net-list of SW and HW cores, buses and buffers. A high speed transaction level model (TLM) is generated to validate abstract communication between processes mapped to different cores. The TLM is further refined into a Pin-Cycle Accurate Model (PCAM) for board implementation. The PCAM includes C code for all the HdS layers including routing, packeting, synchronization and bus transfer. The generated HdS methods provide a library of application level services to the C processes on individual SW cores. Therefore, the application developer does not need to write low level HdS for board implementation. Synthesis results for an multi-core MP3 decoder design, using ESE, show that the HdS is generated in order of seconds, compared to hours of manual coding. The quality of synthesized code is comparable to manually written code in terms of performance and code size.
MTNet: design of a wireless test framework for heterogeneous nanometer systems-on-chip
Authors: Dan Zhao, Yi Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

The rapid migration to nanometer design processes has brought an unprecedented level of integration by allowing system designers to pack a wide variety of functionalities on-chip, namely, systems-on-a-chip (SoCs). In the meantime, electronic testing becomes an enabling technology for this SoC paradigm, since the integration of various core tests is a big challenge, and has revealed a widening gap between design and manufacturing. In particular, the increasing complexity and density of nanometer SoCs have led to the problem of visibility and accessibility in testing. In this paper, we propose an integrated wireless test framework to resolve the acerbated core accessibility problem and to eliminate the incompatibility between the existing SoC test strategies and the next generation billion-transistor SoC specification. Under such a test strategy, the intra-chip wireless links form the wireless test access mechanism (TAM) to transport test data chip-wide. We present a self-configurable multi-hop wireless test micronetwork, dubbed MTNet, with simple and efficient data transmission protocols, and develop a system level design-for-testability structure. Consequently, we propose a geographic routing algorithm to find the test access paths for the deeply embedded cores and a path driven test scheduling algorithm to design and integrate the MTNet-based SoC test access architecture. Extensive simulation study show the feasibility and applicability of MTNet.
Motivated Learning from Interesting Events: Adaptive, Multitask Learning Agents for Complex Environments
Authors: Kathryn Merrick, Mary Lou Maher
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2009)

This article presents a computational model of motivation for learning agents to achieve adaptive, multitask learning in complex, dynamic environments. Motivation is modeled as an attention focus mechanism to extend existing learning algorithms to environments in which tasks cannot be completely predicted prior to learning. Two agent models are presented for motivated reinforcement learning and motivated supervised learning, which incorporate this model of motivation. The formalisms used to define these agent models further allow the definition of consistent metrics for evaluating motivated learning agent models. The article concludes with a demonstration of the motivated reinforcement learning agent model that uses novelty and interest as the motivation function. The model is evaluated using the new metrics. Results show that motivated reinforcement learning agents using general, task-independent concepts such as novelty and interest can learn multiple, task-oriented behaviors by adapting their focus of attention in response to their changing experiences in their environment.
Implementation of a modified Marder-Weitzner method for solving nonlinear eigenvalue problems
Authors: Yu-Jiang Wu, Yang Wang, Min-Li Zeng, Ai-Li Yang
Venue: Journal of Computational and Applied Mathematics (2009)

Our goal is to propose four versions of modified Marder-Weitzner methods and to present the implementation of the new-type methods with incremental unknowns for solving nonlinear eigenvalue problems. By combining with compact schemes and modified Marder-Weitzner methods, six schemes well suited for the calculation of unstable solutions are obtained. We illustrate the efficiency of the new algorithms by using numerical computations and by comparing them with existing methods for some two-dimensional problems.
Methodology for Multi Criteria Group Decision and Negotiation Support on Value-Based Decision
Authors: Christiono Utomo, Arazi Idrus, Madzlan Napiah
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper presents a methodology for multi agent negotiation in value-based decision on building system selection. It consists of methods and knowledge acquisition, negotiation protocols, and model of the agent negotiation. The project management of research including review of research positioning in domain of computer application in value engineering, data necessary and analysis, agent methodology. Results presented are knowledge of building system (roof system) with a model of decision-making using Analytical Hierarchy Process (AHP) based on three-stakeholder preferences and concept of protocol negotiation. This methodology combines value analysis method, decision method and multi agent development method. FAST analysis is a tool for value analysis. AHP is a tool for decision process. Prometheus model has been used for developing a negotiation agent.
Brief paper: Simultaneous linear and anti-windup controller synthesis using multiobjective convex optimization
Authors: Eric F. Mulder, Pradeep Y. Tiwari, Mayuresh V. Kothare
Venue: Automatica (Journal of IFAC) (2009)

We present a method for the synthesis of a control law for input constrained linear systems that incorporates both a traditional linear output-feedback controller as well as a static anti-windup compensator. Unlike traditional two-step anti-windup controller designs in which the linear controller and anti-windup compensator are designed sequentially, our method synthesizes all controller parameters simultaneously. This one-step design retains the anti-windup structure, thus providing structurally 'a priori' compensation for saturation. We derive sufficient conditions for guaranteeing global quadratic stability and for satisfying multiple, possibly conflicting, performance objectives on the constrained and unconstrained closed-loop dynamics. The resulting synthesis problem is recast as an optimization over linear matrix inequalities (LMIs). We demonstrate the proposed method on a benchmark problem.
On computational issues of immersed finite element methods
Authors: X. Sheldon Wang, L. T. Zhang, Wing Kam Liu
Venue: Journal of Computational Physics (2009)

The objective of this paper is to provide a review of recent finite element formulations for immersed methods. In these finite element formulations, independent Lagrangian solid meshes are introduced to move on top of a background Eulerian fluid mesh. This key feature allows the handling, without excessive fluid mesh adaptation, multiple deformable solids immersed in viscous fluid. In particular, pros and cons of both explicit and implicit approaches are illustrated along with subtle differences between incompressible and slightly compressible models.
The Information Management System of County Distribution Based on GIS
Authors: Dong-ming Li, Yuan-zhi Wang, Yan Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Distribution system’s management was based on the management of point, line, surface objection on the area. There were figure data and attribution data in this management which form GIS with special space in-fighting. The paper adopted SuperMap2000 and VB as developing tools, explored designing scheme, developing process and overall function designing of rural power enterprises' distribution system GIS.
W3C Adopts Web-Accessibility Specifications
Authors: Linda Dailey Paulson
Venue: Computer (2009)

Topics include a high-speed, optical firewall; an accessibility specification to help disabled and older users work with the Web; an algorithm that makes routers more efficient; and a robot with videoconferencing capabilities.
A 300 nW, 7 ppm/&deg;C CMOS voltage reference circuit based on subthreshold MOSFETs
Authors: Ken Ueno, Tetsuya Hirose, Tetsuya Asai, Yoshihito Amemiya
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

An ultra-low power CMOS voltage reference circuit has been fabricated in a 0.35-&mu;m standard CMOS process. The circuit generates a reference voltage based on threshold voltage of a MOSFET at absolute zero temperature. Theoretical analyses and experimental results showed that the circuit generates a quite stable reference voltage of 745 mV on average. The temperature coefficient and line sensitivity of the circuit were 7 ppm/&deg;C and 20 ppm/V, respectively. The power supply rejection ratio (PSRR) was -45 dB at 100 Hz. The circuit consists of subthreshold MOSFETs with a low-power dissipation of 0.3 &mu;W or less and a 1.5-V power supply. Because the circuit generates a reference voltage based on threshold voltage of a MOSFET in an LSI chip, it can be used as an on-chip process monitoring circuit and as a part of the on-chip process compensation circuit systems.
Clarifying CONWIP versus push system behavior using simulation
Authors: S. T. Enns, Paul Rogers
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This research examines the performance of CONWIP versus "push" workload control in a simple, balanced manufacturing flowline. Analytical models and simulation experiments are used to evaluate the tradeoffs between throughput and inventory performance. Tradeoff curves based on inflating the inventory level for the CONWIP system and the arrival rate for the "push" system are generated. As well, the variability of interarrival and processing times are considered as experimental factors. Results show that, contrary to what some previous studies have indicated, CONWIP efficiency is not inherently superior to "push" system efficiency. Instead, the release mechanism used for the "push" system has a significant impact on which system will perform better. Utilization levels and processing time variability also affect the relative performances.
A Review on the Dynamic Control of Parallel Kinematic Machines: Theory and Experiments
Authors: Flavien Paccot, Nicolas Andreff, Philippe Martinet
Venue: International Journal of Robotics Research (2009)

In this article, we review the dynamic control of parallel kinematic machines. It is shown that the classical control strategies from serial robotics generally used for parallel kinematic machine have to be rethought. Indeed, it is first shown that the joint space control is not relevant for these mechanisms for several reasons such as mechanical behavior or computational efficiency. Consequently, Cartesian space control should be preferred over joint space control. Nevertheless, some modifications to the well-known Cartesian space control strategies of serial robotics are proposed to make them perfectly suited to parallel kinematic machines, particularly a solution using an exteroceptive measure of the end-effector pose. The expected improvement in terms of accuracy, stability and robustness are discussed. A comparison between the main presented strategies is finally performed both in simulation and experiments.
Probabilistic Protocols for Fair Communication in Wireless Sensor Networks
Authors: Ioannis Chatzigiannakis, Lefteris Kirousis, Thodoris Stratiotis
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

In this work we present three new distributed, probabilistic data propagation protocols for Wireless Sensor Networks which aim at maximizing the network's operational life and improve its performance. The keystone of these protocols' design is fairness which declares that fair portions of network's work load should be assigned to each node, depending on their role in the system. All the three protocols, EFPFR, MPFR and TWIST, emerged from the study of the rigorously analyzed protocol PFR. Its design elements were identified and improvements were suggested and incorporated into the introduced protocols. The experiments conducted show that our proposals manage to improve PFR's performance in terms of success rate, total amount of energy saved, number of alive sensors and standard deviation of the energy left. Indicatively we note that while PFR's success rate is 69.5%, TWIST is achieving 97.5% and its standard deviation of energy is almost half of that of PFR.
Efficient online computation of core speeds to maximize the throughput of thermally constrained multi-core processors
Authors: Ravishankar Rao, Sarma Vrudhula
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We address the problem of efficient online computation of the speeds of different cores of a multi-core processor to maximize the throughput (which is expressed as a weighted sum of the speeds), subject to an upper bound on the core temperatures. We first compute the solution for steady-state thermal conditions by solving a linear program. We then present two approaches to computing the transient speed curves for each core: (i) a local solution, which involves solving a linear program every time step (of about 10 ms), and (ii) a global solution, which computes the optimal speed curve over a large time window (of about 100 s) by solving a non-linear program. We showed that the local solution is insensitive to the weights assigned in the performance objective (hence the need for the global solution). This is because a reduction in the speed of a core can only reduce the temperature of the other cores over much larger time periods (of the order of several seconds). The local solution is then completely determined by the temperature constraint equations. We show that the constraint matrix exhibits a special property - it can be expressed as the sum of a diagonal matrix and a matrix with identical rows. This allows us to solve the multi-core thermal constraint equations analytically to determine the (temporally) local optimum speeds. Further, we showed that due to this property, the steady-state speed solution selects a set of threads to operate at maximum temperature, and turns off all unused cores. Hence, to ensure that all available threads are scheduled, we impose a "fairness" constraint. Finally, we show how the open-loop speed control methods proposed above could be used together with a feedback controller to achieve robustness to model uncertainty.
Test-driven design for introductory OO programming
Authors: Viera K. Proulx
Venue: ACM SIGCSE Bulletin (2009)

Test-Driven Design (TDD) has been shown to increase the productivity of programming teams and improve the quality of the code they produce. However, most of the introductory curricula provide no introduction to test design, no support for defining the tests, and do not insist on a comprehensive test coverage that is the driving force of the TDD. This paper presents a curriculum, pedagogy, and the software support for introductory object-oriented program design that uses the TDD consistently from the very beginning. The testing software does not increase the program complexity and is designed to work with the simplest programs. It has been used by hundreds of students at several colleges and is freely available on the web. Our experiences show that besides improving the quality of code students produce, TDD combined with the novice-appropriate test libraries reinforces students' understanding of the object oriented program design.
Intelligent system for identification and replacement of faulty sensor measurements in Thermal Power Plants (IPPAMAS: Part 1)
Authors: Christina Athanasopoulou, Vasilis Chatziathanasiou
Venue: Expert Systems with Applications: An International Journal (2009)

This paper describes a procedure of identifying sensor faults and reconstructing the erroneous measurements. Knowledge discovery in databases is successfully applied for deriving models that estimate the value of one variable based on correlated others. The estimated values can then be used instead of the recorded ones of a measuring instrument with false reading. The aim is to reassure the correctness of data entered to an optimization software application that was developed for the Thermal Power Plants of Western Macedonia, Greece. The architecture of the application follows the Multi-Agent System approach in order to cope with its complexity and distributed nature. The application was tested on a case study and proved to be efficient.
The Summary of MAPGIS Building Platform System
Authors: Jin Luo, Xiao-Fang Zu, Xin-Cai Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the information technology developing rapidly, the enterprise application scale expands massed. The appearance of new technology doesn't solve the problem of the software productive forces.The attempt to new method can not shake off the "shackles" of "silver bullet" yet.Where will the Enterprise Application Development go? This article simply describes the system frame of the MAPGIS building platform, and how to use the building platform to solve the problem of enterprise applications productivity.
An efficient sliding window strategy for accurate location of eukaryotic protein coding regions
Authors: Nini Rao, Xu Lei, Jianxiu Guo, Hao Huang, Zhenglong Ren
Venue: Computers in Biology and Medicine (2009)

The sliding window is one of important factors that seriously affect the accuracy of coding region prediction and location for the methods based on power spectrum technique. It is very difficult to select the appropriate sliding step and the window length for different organisms. In this study, a novel sliding window strategy is proposed on the basis of power spectrum analysis for the accurate location of eukaryotic protein coding regions. The proposed sliding window strategy is very simple and the sliding step of window is changeable. Our tests show that the average location error for the novel method is 12 bases. Compared with the previous location error of 54 bases using the fixed sliding step, the novel sliding window strategy increased the location accuracy greatly. Further, the consumed CPU time to run the novel strategy is much shorter than the strategy of the fixed length sliding step. So, the computational complexity for the novel method is decreased greatly.
Economic and business dimensionsIncreasing gender diversity in the IT work force
Authors: LeAnne Coder, Joshua L Rosenbloom, Ronald A. Ash, Brandon R. Dupont
Venue: Communications of the ACM (2009)

Want to increase participation of women in IT work? Change the work.
HasCasl: Integrated higher-order specification and program development
Authors: Lutz Schröder, Till Mossakowski
Venue: Theoretical Computer Science (2009)

We lay out the design of HasCasl, a higher order extension of the algebraic specification language Casl that serves both as a wide-spectrum language for the rigorous specification and development of software, in particular but not exclusively in modern functional programming languages, and as an expressive standard language for higher-order logic. Distinctive features of HasCasl include partial higher order functions, higher order subtyping, shallow polymorphism, and an extensive type-class mechanism. Moreover, HasCasl provides dedicated specification support for monad-based functional-imperative programming with generic side effects, including a monad-based generic Hoare logic.