ppxscal/embedding_network huggingface dataset:
Research on MAC in Zinc-Air Battery Pole Manufacturing Line
Authors: Guan Yuming, Wang Zhifeng, Xiao Yanjun, Xu Bo
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The system of zinc-air battery pole manufacturing line is multi-variable, large time lag and strong coupling, and it isdifficult to build the precise math model. So the traditional PID control is difficultly designed and realized. Since the recent years, the self-adaptive and self-tuning control has been rapidly developed, which can resolve uncertain questions in some degree. But in nature it still request model identification online, and the robust is not very well. The model algorithmic control (MAC), brought forward by Mehra etc, is one of predictive control theories. It adopts the non-parameter model based the pulse or step response of the controlled object, and doesn’t need precise model. At the same time, the MAC is convenient to be acquired and the control quality is excellent. In this paper, the MAC was applied in zinc-air battery pole manufacturing line, which adopts the strategies of reference trajectory, online calibration and optimization calculation. Through the simulation results, the controller can concertedly regulate control variable, and achieve the goal, which the PID controller can't do.
An Immunity Inspired Real-Time Cooperative Control Framework for Networked Multi-agent Systems
Authors: Steven Y. Lu, Henry Y. Lau
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

This paper presents a cooperative control framework developed based on the inspiration from the immune system for controlling networked multi-agent systems. The framework is inspired from the meta-dynamics of lymphocyte repertoires in the adaptive immune system, including the continual circulation, continual turnover, concentration control and other relevant mechanisms. We design this framework for the control of a team of autonomous defending agents in RoboFlag Drill, a test-bed for studying cooperative systems. Simulation results are presented to demonstrate the effectiveness of the proposed immunity inspired cooperative control framework. The results of the simulations demonstrated that a set of defenders- can intercept attacker sets with larger set sizes from entering a specific Defense Zone for 60% of the randomly generated RoboFlag Drill problem instances.
Scheduling Medical Residents at Boston University School of Medicine
Venue: Interfaces (2009)

The chief residents in the psychiatry program at Boston University School of Medicine (BUSM) must construct a schedule that simultaneously assigns residents to five types of call shifts, spanning three different hospitals, over a 365-day planning horizon. We show how user expertise and heuristic approaches alone fail to find acceptable solutions to this complex combinatorial problem; likewise, mathematical programming techniques alone are inadequate, largely because they lack a clearly definable objective function. However, by combining both approaches, we were able to find high-quality solutions in a very short time. The resulting schedule, which BUSM uses currently, has yielded substantial benefits; the solution quality has improved, and the effort required to develop the solution has been reduced.
Evaluation of the real-time Java runtime environment for deployment in time-critical systems
Authors: John F. Schommer, Dominik Franke, Stefan Kowalewski, Carsten Weise
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

This paper evaluates the results of benchmarking an implementation of the Real-Time Specification for Java. First, a motivation is given, which describes the need for applications that realize different levels of timing behavior. The difficulties with such applications are described, also. Then tests for memory allocation, communication buffering, and timer accuracy, which are derived from those difficulties, are formulated. The test results are evaluated in the last section.
Secure Routing Approach for Unstructured P2P Systems
Authors: Stefan Kraxberger, Udo Payer
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Although P2P systems have found its way into almost every field of application, the lack of adequate security concepts, research for specific security algorithms and implementations of suitable security mechanisms are still limiting their full potential. We are focusing on getting an overall view on the security of heterogeneous unstructured P2P systems and finding solutions to this challenging task. This work tries to make the first step towards secure unstructured P2P systems by applying security to routing. Existing secure routing protocols are either intended for structured P2P systems or use mechanisms not adequate for heterogeneous P2P system. We used the dynamic source routing protocol and proposed security extensions as foundation, adapted and modified the inherent principles to comply with the P2P concept and verified the applicability in a real world system.
A corpus-based approach for the prediction of language impairment in monolingual English and Spanish-English bilingual children
Authors: Keyur Gabani, Melissa Sherman, Thamar Solorio, Yang Liu, Lisa M. Bedore, Elizabeth D. Peña
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

In this paper we explore a learning-based approach to the problem of predicting language impairment in children. We analyzed spontaneous narratives of children and extracted features measuring different aspects of language including morphology, speech fluency, language productivity and vocabulary. Then, we evaluated a learning-based approach and compared its predictive accuracy against a method based on language models. Empirical results on monolingual English-speaking children and bilingual Spanish-English speaking children show the learning-based approach is a promising direction for automatic language assessment.
Exploiting Multi-sensors for a Fuzzy Controller in the Photo Bioreactor
Authors: Tao Chi, Xu-xiong Huang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

this paper introduces an intelligent fuzzy controller, which makes full use of the computer's computing capability with joined human-specific intelligence. Based on expert knowledge, the algae’s growth environment is divided into several fuzzy regions and the fuzzy integral algorithm is used to produce the on-site multi-source information fusion. The data fusion result reflects the precise distance arriving at the center of four environmental sample modes. Depending on the result the system will be able to identify their current growth patterns of the environment and is done according to the final pre-defined automated control operations. The study in view of the actual project object, the method involved has the certain practical value regarding the environment examination and the control.
Biologically-Inspired Target Recognition in Radar Sensor Networks
Authors: Qilian Liang
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Inspired by biological systems' (such as human's) innate ability to process and integrate information from disparate, network-based sources, we apply biologically-inspired information integration mechanisms to target detection in cognitive radar sensor network. Humans' information integration mechanisms have been modelled using maximum-likelihood estimation (MLE) or soft-max approaches. In this paper, we apply these two algorithms to radar sensor networks target detection. Discrete-cosine-transform (DCT) is used to process the integrated data from MLE or soft-max. We apply fuzzy logic system (FLS) to automatic target detection based on the AC power values from DCT. Simulation results show that our MLE-DCT-FLS and soft-max-DCT-FLS approaches perform very well in the radar sensor network target detection, whereas the existing 2-D construction algorithm doesn't work in this study.
Measuring the level of transfer learning by an AP physics problem-solver
Authors: Matthew Klenk, Ken Forbus
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Transfer learning is the ability of an agent to apply knowledge learned in previous tasks to new problems or domains. We approach this problem by focusing on model formulation, i.e., how to move from the unruly, broad set of concepts used in everyday life to a concise, formal vocabulary of abstractions that can be used effectively for problem solving. This paper describes how the Companions cognitive architecture uses analogical model formulation to learn to solve AP Physics problems. Our system starts with some basic mathematical skills, a broad common sense ontology, and some qualitative mechanics, but no equations. Our system uses worked solutions to learn how to use equations and modeling assumptions to solve AP Physics problems. We show that this process of analogical model formulation can facilitate learning over a range of types of transfer, in an experiment administered by the Educational Testing Service.
Relationship identification for social network discovery
Authors: Christopher P. Diehl, Galileo Namata, Lise Getoor
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

In recent years, informal, online communication has transformed the ways in which we connect and collaborate with friends and colleagues. With millions of individuals communicating online each day, we have a unique opportunity to observe the formation and evolution of roles and relationships in networked groups and organizations. Yet a number of challenges arise when attempting to infer the underlying social network from data that is often ambiguous, incomplete and context-dependent. In this paper, we consider the problem of collaborative network discovery from domains such as intelligence analysis and litigation support where the analyst is attempting to construct a validated representation of the social network. We specifically address the challenge of relationship identification where the objective is to identify relevant communications that substantiate a given social relationship type. We propose a supervised ranking approach to the problem and assess its performance on a manager-subordinate relationship identification task using the Enron email corpus. By exploiting message content, the ranker routinely cues the analyst to relevant communications relationships and message traffic that are indicative of the social relationship.
Program Repair as Sound Optimization of Broken Programs
Authors: Bernd Fischer, Ando Saabas, Tarmo Uustalu
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

We present a new, semantics-based approach to mechanical program repair where the intended meaning of broken programs (i.e., programs that may abort under a given, error-admitting language semantics) can be defined by a special, error-compensating semantics.Program repair can then become a compile-time, mechanical program transformation based on a program analysis. It turns a given program into one whose evaluations under the error-admitting semantics agree with those of the given program under the error-compensating semantics. We present the analysis and transformation as a type system with a transformation component, following the type-systematic approach to program optimization from our earlier work. The type-systematic method allows for simple soundness proofs of the repairs, based on a relational interpretation of the type system, as well as mechanical transformability of program correctness proofs between the Hoare logics for the error-compensating and error-admitting semantics.We first demonstrate our approach on the repair of file-handling programs with missing or superfluous open and close statements. Our framework shows that this repair is strikingly similar to partial redundancy elimination optimization commonly used by compilers.In a second example, we demonstrate the repair of programs operating a queue that can over- and underflow, including mechanical transformation of program correctness proofs.
The Technical Differences between Serial ATA and Ultra ATA Technology
Authors: Zhang Fengqi, Li Zhiyuan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper is to discuss the technical differences between Ultra ATA and Serial ATA technology, and to provide explanation for the transition from a parallel to serial bus architecture. The key design points of each technology will be described and compared, followed by an overview of the system level and end-user advantages of Serial ATA technology.
Wreath Products of Forest Algebras, with Applications to Tree Logics
Authors: Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics {CTL} and { EF}, and first-order logic over the ancestor relation. While the characterizations are in general non-effective, we are able to use them to formulate necessary conditions for definability and provide new proofs that a number of languages are not definable in these logics.
RepoGuard: A Framework for Integration of Development Tools with Source Code Repositories
Authors: Malte Legenhausen, Stefan Pielicke, Jens Ruhmkorf, Heinrich Wendel, Andreas Schreiber
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Today modern software development is not possible without the aid of tools like version control systems, bug tracking systems or instruments that ensure the compliance with code conventions. Unfortunately, all of these tools “live in their own world”, are only loosely coupled and do not interact with each other. RepoGuard addresses this problem by linking version control systems to other software development tools. It is implemented as an extension to several version control systems and provides interfaces to integrate other tools. The use of RepoGuard allows maximum control and validation of all committed resources before they are permanently stored. Additionally, RepoGuard provides communication channels in order to inform all relevant stakeholders about the failure or success of the process. Overall, RepoGuard provides simple but effective means to guarantee software quality standards in distributed development processes.
Bayesian separation of spectral sources under non-negativity and full additivity constraints
Authors: Nicolas Dobigeon, Saïd Moussaoui, Jean-Yves Tourneret, Cédric Carteret
Venue: Signal Processing (2009)

This paper addresses the problem of separating spectral sources which are linearly mixed with unknown proportions. The main difficulty of the problem is to ensure the full additivity (sum-to-one) of the mixing coefficients and non-negativity of sources and mixing coefficients. A Bayesian estimation approach based on Gamma priors was recently proposed to handle the non-negativity constraints in a linear mixture model. However, incorporating the full additivity constraint requires further developments. This paper studies a new hierarchical Bayesian model appropriate to the non-negativity and sum-to-one constraints associated to the sources and the mixing coefficients of linear mixtures. The estimation of the unknown parameters of this model is performed using samples obtained with an appropriate Gibbs algorithm. The performance of the proposed algorithm is evaluated through simulation results conducted on synthetic mixture data. The proposed approach is also applied to the processing of multicomponent chemical mixtures resulting from Raman spectroscopy.
Calculating Similarity Efficiently in a Small World
Authors: Xu Jia, Yuanzhe Cai, Hongyan Liu, Jun He, Xiaoyong Du
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

SimRank is a well-known algorithm for similarity calculation based on link analysis. However, it suffers from high computational cost. It has been shown that the world web graph is a "small world graph". In this paper, we observe that for this kind of small world graph, node pairs whose similarity scores are zero after first several iterations will remain zero in the final output. Based on this observation, we proposed a novel algorithm calledSW-SimRank to speed up similarity calculation by avoiding recalculating those unreachable pairs' similarity scores. Our experimental results on web datasets showed the efficiency of our approach. The larger the proportion of unreachable pairs is in the relationship graph, the more improvement the SW-SimRank algorithm will achieve. In addition, SW-SimRank can be integrated with other SimRank acceleration methods.
An adaptive solver for the spherical shallow water equations
Authors: L. Gavete, B. Alonso, M. L. Gavete, F. Ureña, J. J. Benito
Venue: Mathematics and Computers in Simulation (2009)

The shallow water equations (SWE), which describe the flow of a thin layer of fluid in two dimensions have been used by the atmospheric modelling community as a vehicle for testing promising numerical methods for solving atmospheric and oceanic problems. The SWE are important for the study of the dynamics of large-scale flows, as well for the development of new numerical schemes that are applied to more complex models. In this paper we present a finite difference p-adaptive method based on high order finite differences that is applied using an error indicator for solving the SWE on the sphere. A standard test set is used to evaluate the accuracy of the new method. The results obtained are compared with the pseudo-spectral method.
Sample Filtering Relief Algorithm: Robust Algorithm for Feature Selection
Authors: Thammakorn Saethang, Santitham Prom-On, Asawin Meechai, Jonathan Hoyin Chan
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Feature selection (FS) plays a crucial role in machine learning to build a robust model for either learning or classification from a large amount of data. Among feature selection techniques, the Relief algorithm is one of the most common due to its simplicity and effectiveness. The performance of the Relief algorithm, however, could be dramatically affected by the consistency of the data patterns. For instance, Relief-F could become less accurate in the presence of noise. The accuracy would decrease further if an outlier sample was included in the dataset. Therefore, it is very important to select the samples to be included in the dataset carefully. This paper presents an effort to improve the effectiveness of Relief algorithm by filtering samples before selecting features. This method is termed Sample Filtering Relief Algorithm (SFRA). The main idea of this method is to discriminate outlier samples out of the main pattern using self organizing map (SOM) and then proceed with feature selection using the Relief algorithm. We have tested SFRA with a gene expression dataset of interferon-¿(IFN-¿) response of Hepatitis B patients that contains outlier data. SFRA could successfully remove outlier samples that have been verified by visual inspection by experts. Also, it has better accuracy in separating the relevant and irrelevant features than other feature selection methods considered.
A subject-based empirical evaluation of SSUCD's performance in reducing inconsistencies in use case models
Authors: Mohamed El-Attar, James Miller
Venue: Empirical Software Engineering (2009)

The problem of inconsistencies in Use Case models has plagued practitioners over the years and has been a topic of interest for many researchers. In Use Case driven approaches, the damaging effects of inconsistencies escalate as inconsistencies have a detrimental influence on every aspect of the development process. The repercussions of inconsistencies have been well documented, but little progress has been made towards reducing and remedying their effects. This paper presents a controlled experiment, which evaluates the reduction of inconsistencies resulting from deploying a new structure called (Simple Structured Use Case Descriptions) SSUCD, which is used to assist with the development of Use Case descriptions. This experiment also investigates the impact of improving consistency amongst Use Case models on other key Use Case modeling quality attributes. The results of this experiment demonstrate that using SSUCD leads to an improvement in consistency between use case models and their associated descriptions.
Analysing complex behaviour of hydrological systems through a system dynamics approach
Authors: Shahbaz Khan, Luo Yufeng, Aftab Ahmad
Venue: Environmental Modelling Software (2009)

The interaction among various water cycle components consists of complex, non-linear, and bidirectional (interdependent) biophysical processes which can be interpreted using feedback loops in a system dynamics (SD) environment. This paper demonstrates application of an SD approach with two case studies using a specialised software tool, Vensim. The first case study simulates water balance in a rice field system on a daily basis under aerobic conditions with provision of supplemental irrigation on demand. A physically based conceptual water balance model was developed and then implemented using Vensim to simulate the processes that occur in the field water balance system including percolation, surface runoff, actual evapotranspiration, and capillary rise. The second case study simulates surface-groundwater dynamic interactions in an irrigation area where river water and groundwater are two key sources of irrigation. The modelled system encompasses dynamically linked processes including seepage from the river, evaporation from a shallow watertable, groundwater storage, and lateral flow from upland to lowland areas. The model can be applied to simulate responses of different irrigation management scenarios, to develop strategies to improve water use efficiency and control watertable, to prevent salinization in upland, and to reduce the cost of groundwater abstraction in lowland areas. The discussed applications of the SD approach conclude that it helps to conceptualize and simulate complex and dynamic water system processes deterministically which are otherwise partly simulated by conventional hydrologic and stochastic modelling approaches. It is recognised that conceptualization and implementation phases of this approach are challenging, however, the latter is greatly assisted by modern computer softwares.