ppxscal/embedding_network huggingface dataset:
A Decentralized Scheduling Policy for a Dynamically Reconfigurable Production System
Authors: Stefano Giordani, Marin Lujak, Francesco Martinelli
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

In this paper, the static layout of a traditional multi-machine factory producing a set of distinct goods is integrated with a set of mobile production units - robots. The robots dynamically change their work position to increment the product rate of the different typologies of products in respect to the fluctuations of the demands and production costs during a given time horizon. Assuming that the planning time horizon is subdivided into a finite number of time periods, this particularly flexible layout requires the definition and the solution of a complex scheduling problem, involving for each period of the planning time horizon, the determination of the position of the robots, i.e., the assignment to the respective tasks in order to minimize production costs given the product demand rates during the planning time horizon.We propose a decentralized multi-agent system (MAS) scheduling model with as many agents as there are the tasks in the system, plus a resource (robot) owner which assigns the robots to the tasks in each time period on the basis of the requests coming from the competing task agents. The MAS model is coupled with an iterative auction based negotiation protocol to coordinate the agents' decisions. The resource prices are updated using a strategy inspired by the subgradient technique used in the Lagrangian relaxation approach. To measure the effectiveness of the results, the same are evaluated in respect to that of the benchmark centralized model.
Assessment of the Tertiary Industrial Development Level in Lucheng District of Wenzhou
Authors: Ying Zhang, Weilai Huang, Jing Hu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Factor analysis is a statistical method used to uncover relationships among many variables. Factor analysis could be used to separate the information gained about the interdependencies variables, helping reduce a large number of variables to a smaller number of factors for modeling purposes. It is becoming more and more popular in socio-economics statistics. This paper, based on mathematical statistics and data analysis, evaluates the tertiary industrial development level in Lucheng District of Wenzhou, benefit for deep understanding Lucheng District's tertiary industrial status, and provide the decision-making for the further investment.
The Causal Graph Revisited for Directed Model Checking
Authors: Martin Wehrle, Malte Helmert
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state space traversal is guided through a function that estimates the distance to nearest error states. States with lower estimates are preferably expanded during the search. Obviously, the challenge is to develop distance functions that are efficiently computable on the one hand and as informative as possible on the other hand. In this paper, we introduce the causal graph structure to the context of directed model checking. Based on causal graph analysis, we first adapt a distance estimation function from AI planning to directed model checking. Furthermore, we investigate an abstraction that is guaranteed to preserve error states. The experimental evaluation shows the practical potential of these techniques.
Data-Efficient Information-Theoretic Test Selection
Authors: Marianne Mueller, Rómer Rosales, Harald Steck, Sriram Krishnan, Bharat Rao, Stefan Kramer
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimates of joint distributions over collections of variables. However, in general computing accurate joint distributions conditioned on a large set of variables is expensive in terms of data and computing power. Therefore, one must seek alternative ways to calculate the relevant quantities and still use all the available observations. We describe and compare a basic approach consisting of averaging MI estimates conditioned on individual observations and another approach where it is possible to condition on all observations at once by making some conditional independence assumptions. This yields a data-efficient variant of information maximization for test selection. We present experimental results on public heart disease data and data from a controlled study in the area of breast cancer diagnosis.
Research Commentary---Weighing the Benefits and Costs of Flexibility in Making Software: Toward a Contingency Theory of the Determinants of Development Process Design
Authors: Robert D. Austin, Lee Devin
Venue: Information Systems Research (2009)

In recent years, flexibility has emerged as a divisive issue in discussions about the appropriate design of processes for making software. Partisans in both research and practice argue for and against plan-based (allegedly inflexible) and agile (allegedly too flexible) approaches. The stakes in this debate are high; questions raised about plan-based approaches undermine longstanding claims that those approaches, when realized, represent maturity of practice. In this commentary, we call for research programs that will move beyond partisan disagreement to a more nuanced discussion, one that takes into account both benefits and costs of flexibility. Key to such programs will be the development of a robust contingency framework for deciding when (in what conditions) plan-based and agile methods should be used. We develop a basic contingency framework in this paper, one that models the benefit/cost economics described in narratives about the transition from craft to industrial production of physical products. We use this framework to demonstrate the power of even a simple model to help us accomplish three objectives: (1) to refocus discussions about the appropriate design of software development processes, concentrating on when to use particular approaches and how they might be usefully combined; (2) to suggest and guide a trajectory of research that can support and enrich this discussion; and (3) to suggest a technology-based explanation for the emergence of agile development at this point in history. Although we are not the first to argue in favor of a contingency perspective, we show that there remain many opportunities for information systems (IS) research to have a major impact on practice in this area.
Metal-MACiE
Authors: Claudia Andreini, Ivano Bertini, Gabriele Cavallaro, Gemma L. Holliday, Janet M. Thornton
Venue: Bioinformatics (2009)

Summary: Metal-MACiE is a new publicly available web-based database, held in MySQL, which aims to organize the available information on the properties and the roles of metals in the context of the catalytic mechanisms of metalloenzymes. Metal-MACiE, which currently covers 75% of metal-dependent enzyme commission (EC) sub-sub-classes and is continuously growing, exploits the existing MACiE database for the annotation of the reaction mechanisms. The two databases constitute complementary sources of information for enzymology, biochemistry and molecular pharmacology studies. Availability: http://www.ebi.ac.uk/thornton-srv/databases/Metal_MACiE/home.html Contact: andreini@cerm.unifi.it Supplementary information:Supplementary data are available at Bioinformatics online.
Quantum Copy-Protection and Quantum Money
Authors: Scott Aaronson
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Forty years ago, Wiesner proposed using quantum states to create money that is physically impossible to counterfeit, something that cannot be done in the classical world. However, Wiesner's scheme required a central bank to verify the money, and the question of whether there can be unclonable quantum money that anyone can verify has remained open since. One can also ask a related question, which seems to be new: can quantum states be used as copy-protected programs, which let the user evaluate some function f, but not create more programs for f? This paper tackles both questions using the arsenal of modern computational complexity. Our main result is that there exist quantum oracles relative to which publicly-verifiable quantum money is possible, and any family of functions that cannot be efficiently learned from its input-output behavior can be quantumly copy-protected. This provides the first formal evidence that these tasks are achievable. The technical core of our result is a "Complexity-Theoretic No-Cloning Theorem," which generalizes both the standard No-Cloning Theorem and the optimality of Grover search, and might be of independent interest. Our security argument also requires explicit constructions of quantum t-designs. Moving beyond the oracle world, we also present an explicit candidate scheme for publicly-verifiable quantum money, based on random stabilizer states; as well as two explicit schemes for copy-protecting the family of point functions. We do not know how to base the security of these schemes on any existing cryptographic assumption. (Note that without an oracle, we can only hope for security under some computational assumption.)
Study on Train Operation Adjustment Based on Hybrid Convergent Particle Swarm Optimization
Authors: Xuelei Meng, Limin Jia, Yong Qin, Jie Xu, Tao Zhou
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Train operation adjustment is an important part of the railway dispatch work, which is the core work to assure the transportation order and efficiency. The essence of the adjustment is to adjust the train to run according to the planned schedule. In this paper, a train operation adjustment model is built and the hybrid convergent particle swarm optimization is employed to solve the optimizing problem. It not only satisfies the constraints of train operation adjustment, bt also has the real-time adjusting ability. Computing results are changed into a train operation adjustment plan. It is concluded that the algorithm has excellent performance, compared with the basic swarm algorithm. The train operation adjustment plan is practical and efficient.
Dynamic Topology Reconfiguration Method for Service Overlay Networks Using Users' Community Information
Authors: Tomoyasu Ogasa, Yousuke Takahashi, Hiroyuki Ohsaki, Takeshi Yagi, Junichi Murayama, Makoto Imase
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

In this paper, we propose an efficient dynamic topology reconfiguration method for a service overlay network called ACBP (Approximate Cluster-Based Policy), which does not require detailed information on future traffic requirements.Instead of the detailed information on future traffic requirements, ACBP utilizes community information of a social network among users for roughly estimating traffic requirements among users. In this paper, we also evaluate the effectiveness of our ACBP through simulations. Consequently, we show that the total cost of ACBP, which does not use the detailed information on traffic requirements, is only approximately 10% larger than that of existing method CBP (Cluster-Based Policy), which requires the detailed traffic information.
A reductive semantics for counting and choice in answer set programming
Authors: Joohyung Lee, Vladimir Lifschitz, Ravi Palla
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the meaning of counting and choice by reducing these constructs to first-order formulas. For the new language, the concept of a safe program is defined, and its semantic role is investigated. We compare the new language with the concept of a disjunctive program with aggregates introduced by Faber, Leone and Pfeifer, and discuss the possibility of implementing a fragment of the language by translating it into the input language of the answer set solver DLV. The language is also compared with cardinality constraint programs defined by Syrjänen.
Control Strategy Research and Simulation Analysis of Electric Power Steering System for Automobile
Authors: Yang Ying, Li Ting, Sui Tao, Ma Dongbo
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Automobiles’ maneuverability, security and comfort are very important. To obtain the ideal steering stability and cornering portability of vehicles in any conditions, a multi-body dynamic model of automobile equipped with electric power steering system (EPS) is established in Matlab/Simulink and ADAMS.A new control method is presented which combined control strategy with parameter compensation method. The simulation results show that, yaw compensation can improve the stability of automobiles when steering a large angle on slippery roads; Return compensation can improve the lack of returning ability when steering at a low speed. This EPS can improve both the steering portability and road feeling.
Review of Power-Quality Disturbance Recognition Using S-transform
Authors: Nantian Huang, Lin Lin, Wenhuan Huang, Jiajin Qi
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Power quality (PQ) disturbance recognition is the foundation of power quality monitoring and analysis. The S- transform (ST) is an extension of the ideas of the continuous wavelet transform (CWT). It is based on a moving and scalable localizing Gaussian window. S-transform has better time frequency and localization property than traditional.With the excellent time—frequency resolution (TFR) characteristics of the S-transform, ST is an attractive candidate for the analysis and feature extraction of power quality disturbances under noisy condition also has the ability to detect the disturbance correctly. This paper overviewed the theory of basis S-transform and two types of typical improved S-transform summarized their applications in the area of power quality disturbance recognition. The comparison between the ST-based method and other methods such as the wavelet-transform-based method for power-quality disturbance recognition shows the method has good scalability and very low sensitivity to noise levels. All of these show ST based methods has great potential for the future development of fully automated monitoring systems with online classification capabilities. The analysis direction and emphasis of studying about the power quality (PQ) disturbance recognition also put forward.
Design and Implement of Multifunctional Monitoring System for the Suspension and Guidance System of Maglev Train
Authors: Chunxia Zhao, Longhua She, Wensen Chang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

This paper investigates multifunctional monitoring system based on CAN/USB/CDMA, combines communications of USB and CDMA with the vehicle CAN bus, achieves both real-time on-line and wireless remote monitoring on maglev suspension and guidance system. Firstly, the structure and working principle of the monitoring system are elaborated. Secondly, the hardware and software of monitoring terminal and monitoring centre are designed. Moreover, the key techniques and design cruces are presented. Finally, the monitoring system has been successfully applied to the state-monitoring and parameters-debugging of maglev system. Test results prove that the proposed system has high dependability and real-time ability. Remote wireless monitoring based on CDMA 1X outperforms traditional radio-communication in the long-distance data transmission. Being multifunctional and practicable, this system can be well used in other areas.
SIP-Based Multimedia Conference Management System and Its Application
Authors: Wang Liang, Shen Jun
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Abstract—Based on the ITU-T H.323 protocol, the traditional multimedia conference is complicated in application and poor in scalability. Neither its reusability is not good enough. After analysis of SIP protocol, a component-based development method is put forward. Most of the function is implemented in component form. And applying function hierarchy approach for different function layers to obtain a clear stratification framework. Then establishing a system model according to the interaction rule for the final implementation and application. The method modularizes the system functions and transfers them to a lower level in application service layer. It improves the integration of the system and other application, simplifies the system complexity and enhances its scalability, which also obtains a great application in practice.
Fast Secure Routing for Highly Mobile Large-Scale Ad-Hoc Vehicular Networks
Authors: Wei Ren, Yi Ren, Hui Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In highly mobile large-scale vehicular ad-hoc networks, routing protocols must be fast and efficient in terms of low routing discovery delay and communication overhead to support the applications such as car talk. Such requirement becomes more difficult to achieve when inducing security enhancement to tackle the authentication of routing messages. In this paper, we propose a lightweight (fast) secure routing protocol, Secure Proactive Tree-based Routing (SPTR) to hit these two points. SPTR makes use of the characteristics of VANET networks, that is, the traffic originates from or terminates at the gateway or road side unit. SPRT also takes advantages of certificate-less ID-based cryptography to provide message authentication. Analysis and simulations show that SPTR has low routing discovery delay and communication overhead in highly mobile large-scale VANET even if authenticating routing messages.
Definition and Measures of an Opinion Model for Mining Forums
Authors: Anna Stavrianou, Julien Velcin, Jean-Hugues Chauchat
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Online discussion systems in the form of forums have recently been analyzed by using graphs and social network techniques. Each forum is regarded as a social network and it is modeled by a graph whose vertices represent forum participants. In this paper, we focus on the structure and the opinion content of the forum posts and we are looking at the social network that is developed from a semantics point of view. We formally define an opinion-oriented model whose purpose is to provide complementary information to the knowledge extracted by the social network model. We define and present measures that can give important information regarding the opinion flow as well as the general attitude of users and towards users throughout the whole forum. Applying our model to a real forum found on the Web shows the additional information that can be extracted.
Prediction of protein β-residue contacts by Markov logic networks with grounding-specific weights
Authors: Marco Lippi, Paolo Frasconi
Venue: Bioinformatics (2009)

Motivation: Accurate prediction of contacts between β-strand residues can significantly contribute towards ab initio prediction of the 3D structure of many proteins. Contacts in the same protein are highly interdependent. Therefore, significant improvements can be expected by applying statistical relational learners that overcome the usual machine learning assumption that examples are independent and identically distributed. Furthermore, the dependencies among β-residue contacts are subject to strong regularities, many of which are known a priori. In this article, we take advantage of Markov logic, a statistical relational learning framework that is able to capture dependencies between contacts, and constrain the solution according to domain knowledge expressed by means of weighted rules in a logical language. Results: We introduce a novel hybrid architecture based on neural and Markov logic networks with grounding-specific weights. On a non-redundant dataset, our method achieves 44.9% F1 measure, with 47.3% precision and 42.7% recall, which is significantly better (P < 0.01) than previously reported performance obtained by 2D recursive neural networks. Our approach also significantly improves the number of chains for which β-strands are nearly perfectly paired (36% of the chains are predicted with F1 ≥ 70% on coarse map). It also outperforms more general contact predictors on recent CASP 2008 targets. Contact: lippi@dsi.unifi.it Supplementary information: Supplementary data are available at Bioinformatics online.
Method for Forecasting Telecom Operators' Revenue: Based on DEA Regression
Authors: Jiang Xu, Jingmin Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In this paper, input-output efficiencies of 31 provinces in China have been got by setting up a Chinese Telecommunications Operators model for revenue forecasts adopting DEA regression analysis and score calculation, and the empirical research has been explored according to them. Meanwhile, the paper shows the superiority of DEA by the simultaneously of regression analysis and traditional regression analysis, and point outs DEA are the scientific methods of telecom operators income prediction, are greatly valued of the job of income measured and has reference for formulating the goal of income.