ppxscal/embedding_network huggingface dataset:
A new general method to generate random modal formulae for testing decision procedures
Authors: Peter F. Patel-Schneider, Roberto Sebastiani
Venue: Journal of Artificial Intelligence Research (2003)

The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed test generators is very satisfactory. To cope with this fact, we present a new random generation method that provides benefits over previous methods for generating empirical tests. It fixes and much generalizes one of the best-known methods, the random CNF???m test, allowing for generating a much wider variety of problems, covering in principle the whole input space. Our new method produces much more suitable test sets for the current generation of modal decision procedures. We analyze the features of the new method by means of an extensive collection of empirical tests.
Effect of External Bending Moment and Creep on Sealing Behavior of Bolted Flanged Connections
Authors: Zhenguo Sun, Boqin Gu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A mechanical model based on the tightness of bolted flanged connections subjected to external bending moment was developed by numerical simulation with finite element method (FEM), in which creep and relaxation of bolts, flanges and gasket were taken into consideration. The residual stress distribution of gasket under different operating conditions was obtained. The effect of external bending moment and creep on the tightness of sealing connections was revealed. The FEM results were compared to that of analytical method established on the basis of the former research, and the leakage rate of the connection was predicted. The results obtained by both FEM and analytical method were in good agreement. The research can be used to analyze and assess the tightness of the bolted flanged connections in active service subjected to external bending moment and creep
Neural network training with optimal bounded ellipsoid algorithm
Authors: Jos&#x00e9; de Jes&#x00fa;s Rubio, Wen Yu, Andr&#x00e9;s Ferreyra
Venue: Neural Computing and Applications (2009)

Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence, since it has a similar structure as Kalman filter. OBE has some advantages over Kalman filter training, the noise is not required to be Guassian. In this paper OBE algorithm is applied in training the weights of the feedforward neural network for nonlinear system identification. Both hidden layers and output layers can be updated. From a dynamic system point of view, such training can be useful for all neural network applications requiring real-time updating of the weights. Two simulations give the effectiveness of the suggested algorithm.
Computational Methods in Modern Science and Engineering: Advances in Computational Science Lectures presented at the International Conference on Computational, 1st edition
Authors: George Maroulis, Theodore E. Simos
Venue: Aip Conference Proceedings (2009)

The aim of ICCMSE 2008 is to bring together computational scientists and engineers from several disciplines in order to share methods, methodologies and ideas. The potential readers are all the scientists with interest in: Computational Mathematics, Theoretical Physics, Computational Physics, Theoretical Chemistry, Computational Chemistry, Mathematical Chemistry, Computational Engineering, Computational Mechanics, Computational Biology and Medicine, Scientific Computation, High Performance Computing, Parallel and Distributed Computing, Visualization, Problem Solving Environments, Software Tools, Advanced Numerical Algorithms, Modelling and Simulation of Complex Systems, Web-based Simulation and Computing, Grid-based Simulation and Computing, Computational Grids, and Computer Science.
Selecting and Weighting Data for Building Consensus Gene Regulatory Networks
Authors: Emma Steele, Allan Tucker
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

Microarrays are the major source of data for gene expression activity, allowing the expression of thousands of genes to be measured simultaneously. Gene regulatory networks (GRNs) describe how the expression level of genes affect the expression of the other genes. Modelling GRNs from expression data is a topic of great interest in current bioinformatics research. Previously, we took advantage of publicly available gene expression datasets generated by similar biological studies by drawing together a richer and/or broader collection of data in order to produce GRN models that are more robust, have greater confidence and place less reliance on a single dataset. In this paper a new approach, Weighted Consensus Bayesian Networks, introduces the use of weights in order to place more influence on certain input networks or remove the least reliable networks from the input with encouraging results on both synthetic data and real world yeast microarray datasets.
Optimal Embedding into Star Metrics
Authors: David Eppstein, Kevin A. Wortman
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We present an O(n 3 log2 n)-time algorithm for the following problem: given a finite metric space X, create a star-topology network with the points of X as its leaves, such that the distances in the star are at least as large as in X, with minimum dilation. As part of our algorithm, we solve in the same time bound the parametric negative cycle detection problem: given a directed graph with edge weights that are increasing linear functions of a parameter ¿, find the smallest value of ¿ such that the graph contains no negative-weight cycles.
Reducing the level of switching costs in mobile communications: The case of Mobile Number Portability
Authors: Juan Pablo Maicas, Yolanda Polo, F. Javier Sese
Venue: Telecommunications Policy (2009)

Switching costs are one of the most important economic forces that affect market competition in mobile communications. Both theoretical and empirical studies have shown that switching costs reduce market competition leading to higher prices, lower product and service quality, and lower customer welfare. Given their negative consequences, national regulatory authorities have designed policies aimed at reducing switching costs and fostering competition. One of the most important of these, in the mobile communications industry, is mobile number portability (MNP). The aim of this paper is to investigate the effect of MNP on switching costs in mobile phone services. First, a hierarchical Bayes model is proposed to measure switching costs at the customer level and to investigate the impact of MNP on them. Second, this study examines the drivers of MNP adoption by customers using a binary logit specification. The results reveal that this regulatory policy has significantly reduced the cost of switching and that MNP adoption partially depends on customer-related variables.
Demo abstract: ControlCity - Integrating wireless sensor networks and building management systems
Authors: Jin-Yeop Chang, JinYoung Kim, Ohyuk Kwon, Chung-Hyeok Lee, Won Il Lee, Minhwan Oh, Un Hak Paek, Hyojin Yoon, Jeonghoon Kang, Jung Kwon Ko, Wonsik Ko, Chang-Keun Lee
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

We demonstrate an industrial-strength wireless sensor network application for indoor environment monitoring built on top of TinyOS. The application is integrated with a building management system in wide use in South Korea called, ControlCity™. We discuss issues that arise in deploying and integrating a sensor network for commercial building management systems, ranging from case design to overall system architecture.
Statistical machine reordering
Authors: Marta R. Costa-jussà, José A. R. Fonollosa
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

Reordering is currently one of the most important problems in statistical machine translation systems. This paper presents a novel strategy for dealing with it: statistical machine reordering (SMR). It consists in using the powerful techniques developed for statistical machine translation (SMT) to translate the source language (S) into a reordered source language (S'), which allows for an improved translation into the target language (T). The SMT task changes from S2T to S'2T which leads to a monotonized word alignment and shorter translation units. In addition, the use of classes in SMR helps to infer new word reorderings. Experiments are reported in the EsEn WMT06 tasks and the ZhEn IWSLT05 task and show significant improvement in translation quality.
A Coauthoring Method of Keyword Dictionaries for Knowledge Combination on Corporate Discussion Web Sites
Authors: Shinji Takao, Tadashi Iijima, Akito Sakurai
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

This paper states the issues faced, and the role played by keyword dictionaries with regard to discussion based web sites which aim to achieve a 'collective knowledge' through the voluntary participation of corporate employees, and proposes a corrective strategy. A keyword dictionary is valuable in that it helps to integrate fragmented accumulated knowledge with generalized knowledge. However, this necessitates a method that allows for coauthoring, and Wiki, BBS and other existing tools are still insufficient in this respect. As well as offering a method for expanding BBS, this paper shows a method for assessing use within an actual corporation.
Lower Bounds for Kernelizations and Other Preprocessing Procedures
Authors: Yijia Chen, Jörg Flum, Moritz Müller
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We first present a method to rule out the existence of strong polynomial kernelizations of parameterized problems under the hypothesis P $\ne$ NP. This method is applicable, for example, to the problem Sat parameterized by the number of variables of the input formula. Then we obtain improvements of related results in [1,6] by refining the central lemma of their proof method, a lemma due to Fortnow and Santhanam. In particular, assuming that PH $\ne \Sigma^{\rm {P}}_3$, i.e., that the polynomial hierarchy does not collapse to its third level, we show that every parameterized problem with a "linear OR" and with NP-hard underlying classical problem does not have polynomial reductions to itself that assign to every instance x with parameter k an instance y with |y| = k O(1)·|x|1 ¿ ¿ (here ¿ is any given real number greater than zero).
Research of Complex Question Parsing Based on Condition Extraction
Authors: Xiuling Pang, Keliang Jia
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

To the complex condition question, the parsing algorithm based on condition extraction is proposed. The complex condition question includes two parts: the condition description part and the question focus description part. The two parts are processed separately and then merged to obtain the complex condition question semantic representation. The algorithm can objectively reveal the structure essence of the complex condition question. The experimental result shows that this algorithm has obtained certain effect in the restricted domain question answering system.
Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation
Authors: Keith B. Frikken
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

In [18] it was shown that the ability to perform oblivious automata evaluation was useful for performing DNA searching and matching. By oblivious automata evaluation we mean that one participant has a finite state machine and the other participant has a sequence, and at the end of the protocol the sequence owner learns whether the machine accepts the sequence. A protocol was given in [18], but it required O(n) rounds (where n is the number of characters in the sequence) and O(mn) modular exponentiations (where m is the number of states in the automata). Both of these factors limit the applicability of this approach. In this paper we propose a new protocol that requires only O(1) rounds and reduces the number of modular exponentiations to O(n) without revealing any additional information. We have implemented both schemes and have shown experimentally that our scheme is two to three orders of magnitude faster than the previous scheme.
Social Computers for the Social Animal: State-of-the-Art and Future Perspectives of Social Signal Processing
Authors: Alessandro Vinciarelli
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Following Aristotle, "Man is by nature a social animal; an individual who is unsocial naturally and not accidentally is either beneath our notice or more than human." This is more than an abstract philosophical statement if, twenty five centuries after, we observe that people have exactly the same social behavior whether they interact with a computer or with another person. Furthermore, there is evidence that users tend to appreciate more computers displaying social behaviors similar to those they appreciate in people. This body of evidence suggests that there is a gap between current, unsocial, computers and user expectations for social behavior.Social Signal Processing (SSP) is the new, emerging, domain that aims at making computers as social as their human users by modeling people and groups involved in social interactions. The SSP approach focuses on analysis, understanding and synthesis of social signals, the complex aggregates of nonverbal behavioral cues through which people convey their attitude towards others (including machines) and social environments. The development of SSP technologies will help computers to adapt to users like people adapt to others (i.e. depending on the kind of interaction and social context), and to personalize their interface in terms of characteristics socially desirable for the users. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Application-Specific Product Generics
Authors: John Lach, Vinu Vijay Kumar
Venue: Computer (2009)

Hybrid FPGAs and structured ASICs make it possible to amortize nonrecurring engineering costs across multiple products, but such platforms have high area, performance, and power penalties. A new technique provides the flexibility to implement many product instances while maintaining the qualities of custom ASICs.
Propeller of Amphibious Robot Optimizing Design Based on Integrated Software Platform
Authors: Xueqiang Zhang, Jiancheng Yu, Aiqun Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The propeller of amphibious robot is a device facilitating the robot to swim and climb. Integrated software platform (ISP) is an optimization tool coupling some commercial design software with optimization software iSIGHT. Two types of commercial software are integrated in the ISP for optimizing mass and thrust of propeller. CAD software is used to design the propeller and calculate its mass, and CFD software is used to compute propeller thrust. The two optimization objectives as minimizing mass and maximizing thrust at the same time conflicts, thus a modified objective function including both objectives is formulated as the design function. In the paper, design of experiment (DOE) has been applied and variable effects on design function based on Pareto plot have been analyzed. The design process uses response surface model (RSM) to approximate mathematical model of the design objective as the function of design variables, and the approximated polynomial model is given. The optimal combination of the design variables affecting the propeller performance has been plotted using contour line.
Extending BPM Environments of Your Choice with Performance Related Decision Support
Authors: Mathias Fritzsche, Michael Picht, Wasif Gilani, Ivor Spence, John Brown, Peter Kilpatrick
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

What-if Simulations have been identified as one solution for business performance related decision support. Such support is especially useful in cases where it can be automatically generated out of Business Process Management (BPM) Environments from the existing business process models and performance parameters monitored from the executed business process instances. Currently, some of the available BPM Environments offer basic-level performance prediction capabilities. However, these functionalities are normally too limited to be generally useful for performance related decision support at business process level. In this paper, an approach is presented which allows the non-intrusive integration of sophisticated tooling for what-if simulations, analytic performance prediction tools, process optimizations or a combination of such solutions into already existing BPM environments. The approach abstracts from process modelling techniques which enable automatic decision support spanning processes across numerous BPM Environments. For instance, this enables end-to-end decision support for composite processes modelled with the Business Process Modelling Notation (BPMN) on top of existing Enterprise Resource Planning (ERP) processes modelled with proprietary languages.
Online large-margin training of syntactic and structural translation features
Authors: David Chiang, Yuval Marton, Philip Resnik
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimize. Building on the work of Watanabe et al., we explore the use of the MIRA algorithm of Crammer et al. as an alternative to MERT. We first show that by parallel processing and exploiting more of the parse forest, we can obtain results using MIRA that match or surpass MERT in terms of both translation quality and computational cost. We then test the method on two classes of features that address deficiencies in the Hiero hierarchical phrase-based model: first, we simultaneously train a large number of Marton and Resnik's soft syntactic constraints, and, second, we introduce a novel structural distortion model. In both cases we obtain significant improvements in translation performance. Optimizing them in combination, for a total of 56 feature weights, we improve performance by 2.6 Bleu on a subset of the NIST 2006 Arabic-English evaluation data.
Searching Ground States of Ising Spin Glasses with a Tree Bond-Based Representation
Authors: Andrei Bautu, Elena Bautu, Henri Luchian
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Ising spin glasses are a rich source of challenging highly multimodal optimization problems.The Ising model is one of the most widely used models for disordered systems in statistical physics.Finding the ground state of an Ising spin glass can be expressed as the problem of determining the minimum weighted cut in a graph.The classical approach when dealing with a spin glasses system is to encode the state of the system based on the states of spins.This paper presents a new representation for the states of Ising spin glasses based on the bonds between spins.This encoding is used with a specially designed Genetic Algorithm to search for low energy states of such systems, with the goal of finding ground states.To this end, special genetic operators are also defined and presented in detail in the paper.The results of preliminary experiments are very promising for this class of problems.
Transmission Performance Simulation of Broadcast Encryption Schemes with Pay-TV System Implementation Consideration
Authors: Yichun Zhang, Jinliang Wan
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Broadcast encryption schemes are suitable for one-way content distribution and protection applications.However, most of the related papers are from the theoretical point of view, and there is something useful for implementation being overlooked. In this paper, we introduce the Pay-TV System as a concrete implementation of broadcast encryption schemes, and simulate the transmission performance of four highly efficient broadcast encryption schemes. Based on these quantitative results, we analysis performance in respective environments and some suggestions are given based on implementation consideration for further research on this subject.
Visual Haptic-Based Biomolecular Docking and Its Applications in E-Learning
Authors: Olga Sourina, Jaume Torres, Jing Wang
Venue: Transactions on Edutainment II (2009)

Visual haptic-based biomolecular docking systems could be used for both research and e-learning in research intensive disciplines such as biology, physical chemistry, molecular medicine, biophysics, structural biology, bioinformatics, etc. The assembly of molecules in a three-dimensional space or molecular docking is used for rational drug design where a ligand docks onto a receptor. The computer-aided design systems allow a real-time interactive visualization and manipulation of molecules in virtual environment. These techniques help the user to understand molecular interactions. In recent years, besides the visualization techniques, there has been increasing interest in using haptic interfaces to facilitate the exploration and analysis of molecular docking. Haptic device enables the users to manipulate the molecules and feel its interaction during the docking process in virtual experiment on computer. In this paper, we describe a visual haptic-based biomolecular docking system that we developed for research in helix-helix docking and propose its application in e-learning. We also describe haptic-based collaborative e-learning scenarios.
Simulating Information Transmission Mechanisms on a Network through Particle Swarm Optimization
Authors: Toru Takahashi, Takashi Yamada, Takao Terano
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

This paper proposes an information transmission model through Particle Swarm Optimization (PSO). This model enables us to manage the complexity of information topic. We consider the factors of PSO as the three aspects of the information transmission: 1) the structure of network, 2) the value of information, and 3) the character of agents. Our main findings are 1) the relation between topics and the information network, 2) how the character of agent affects, and 3) the characters of agents based on his degree.