ppxscal/embedding_network huggingface dataset:
Formal Verification Based on Guided Random Walks
Authors: Thang H. Bui, Albert Nymeyer
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

In software development, formal verification and simulation are seen as complimentary paradigms: the former can guarantee the correctness of systems with respect to properties, but does not scale; the latter does scale but cannot guarantee the absent of errors. In the authors' previous work, a mechanism of statically analysing a model has been used to build an abstraction of the original model, which in turn is used to guide a heuristic search in a guided model checker. We extend that work and apply the same technique to build a heuristically-driven, or guided, random-walk model checker. This work sits at the intersection of a number of research areas: model checking, random walks, heuristic search and simulation. Novel here is the use of a heuristic mechanism to guide the random walk towards states of the model that possibly violate user-defined properties, and the use of an automatic abstraction scheme to build the heuristic. In a series of experiments, we compare the performance of our guided, random-walk based tool to standard model-checking tools. A new metric that we call Process Error Participation (PEP) has also been devised to classify model behaviour.
The effects of organizational citizenship behaviors on ERP system success
Authors: Cheolho Yoon
Venue: Computers in Human Behavior (2009)

Although the research on organizational citizenship behaviors (OCBs) has increased dramatically in diverse fields during the past decade, little is known about the OCBs in the information systems area. The purpose of this study was to explore the effect of OCBs on enterprise resource planning (ERP) system success. In order to perform empirical analyses, measurements on the OCBs constructs based on the five dimensions of [Organ, D.W. (1988). Organizational citizenship behavior: The ''Good Soldier'' syndrome. MA: Lexington Books]: altruism, conscientiousness, courtesy, civic virtue, and sportsmanship were developed, and the research model including the relationships between the OCBs constructs and ERP system success variables of information quality, work efficiency, and intention of IT innovation was proposed and empirically analyzed using structural equation modeling. The contribution of this study is to provide strategic insights for successfully managing ERP systems by identifying the effects of organizational citizenship behaviors in ERP context.
Modern risk control techniques for improving the environmental management system in Romanian HV installations
Authors: Stefania Popadiuc, Bogdan Popa, Frangiskos Topalis, Cristiana Geambasu
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

Environmental protection keeps on being one of the main concerns of our company, together with the economic efficiency and providing of high quality energy services. The general goal of the environmental policy consists in improving the environmental management system and mitigating the power units' negative impact in compliance with the regulations in force. The specific goal accommodates the general goal to substations and electric lines, having as short and medium term target the compliance with the European requirements. As a result, more and more companies organise environmental studies and audits in order to evaluate their environmental performance. But such activities are not sufficient in themselves to provide the certainty that the performances comply to the regulation in force, and to the environment policy requirements. In order to become effective, these studies and audits have to be organised within a structured management, based on modern systems of global pollutants monitoring. These activities correspond to the ever stricter regulation and to the development of the economic policies and similar measures liable to stimulate environmental protection and the interest of the implied parties on environmental issues, sustainable development included. International standards on environmental management aim at providing the interested parties the fundamental elements of an environmental management system, elements that are specific to other management requirements as well and are expected to facilitate the companies to reach their environmental and economic objectives. The success of these activities depends on the company commitment at each level and responsibility.
Personalised mobile learning content delivery: a learner centric approach
Authors: Ty Mey Eap, Dragan Gasevic, Kinshuk, Fuhua (Oscar) Lin
Venue: International Journal of Mobile Learning and Organisation (2009)

This research proposes a context-aware framework that automatically adapts learning content designed for personal computers for mobile learners. The framework is a web application plug-in that captures access patterns and uses the patterns with trained configurations, learner preferences and device profiles to tailor learning content to the learners' needs. Learners can switch devices without losing learning context, and the framework would use Semantic technology to search and make content learners may eventually need available to them. The framework is in line with the surveys recently conducted on mobile learning and uses only proven technologies to guarantee a successful implementation.
Magic cards: a paper tag interface for implicit robot control
Authors: Shengdong Zhao, Koichi Nakamura, Kentaro Ishii, Takeo Igarashi
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Typical Human Robot Interaction (HRI) assumes that the user explicitly interacts with robots. However, explicit control with robots can be unnecessary or even undesirable in certain cases, such as dealing with domestic services (or housework). In this paper, we propose an alternative strategy of interaction: the user implicitly controls a robot by issuing commands on corresponding real world objects and the environment. Robots then discover these commands and complete them in the background. We implemented a paper-tag-based interface to support such implicit robot control in a sensor-augmented home environment. Our initial user studies indicated that the paper-tag-based interface is particularly simple to use and provides users with flexibility in planning and controlling their housework tasks in a simulated home environment.
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
Authors: Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan Chen
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

We present PROUD -- A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast to data with certainty, an uncertain series is an ordered sequence of random variables. The distance between two uncertain series is also a random variable. We use a general uncertain data model, where only the mean and the deviation of each random variable at each timestamp are available. We derive mathematical conditions for progressively pruning candidates to reduce the computation cost. We then apply PROUD to a streaming environment where only sketches of streams, like wavelet synopses, are available. Extensive experiments are conducted to evaluate the effectiveness of PROUD and compare it with Det, a deterministic approach that directly processes data without considering uncertainty. The results show that, compared with Det, PROUD offers a flexible trade-off between false positives and false negatives by controlling a threshold, while maintaining a similar computation cost. In contrast, Det does not provide such flexibility. This trade-off is important as in some applications false negatives are more costly, while in others, it is more critical to keep the false positives low.
Building Bridges: Between Mathematics and Computer Science (Bolyai Society Mathematical Studies), 1st edition
Authors: Martin Grtschel, Gyula O.H. Katona
Venue:  (2008)

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Lszl Lovsz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovszs 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.
Analysis and evaluation of fieldbus communication and protocol static characteristic
Authors: Hongwei Gao, Weiming Tong
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The MAC mechanism, communication data type, and communication reference model which are very important to fieldbus communication are summarized and analyzed. A set of fieldbus static performance indices described by layered concept are proposed. Through diagram and simulation method, the evaluation results of the static performance indices for several mainstream fieldbuses are presented; furthermore, the scope of application of some fieldbuses in industrial control field is discussed. Through the way of layered description and diagram comparison, lots of static performance indices can be decomposed and classified effectively, and the favorable mapping relationship between application requirement and static performance indices is achieved.
Prediction of cis/trans isomerization using feature selection and support vector machines
Authors: Konstantinos P. Exarchos, Costas Papaloukas, Themis P. Exarchos, Anastassios N. Troganis, Dimitrios I. Fotiadis
Venue: Journal of Biomedical Informatics (2009)

In protein structures the peptide bond is found to be in trans conformation in the majority of the cases. Only a small fraction of peptide bonds in proteins is reported to be in cis conformation. Most of these instances (>90%) occur when the peptide bond is an imide (X-Pro) rather than an amide bond (X-nonPro). Due to the implication of cis/trans isomerization in many biologically significant processes, the accurate prediction of the peptide bond conformation is of high interest. In this study, we evaluate the effect of a wide range of features, towards the reliable prediction of both proline and non-proline cis/trans isomerization. We use evolutionary profiles, secondary structure information, real-valued solvent accessibility predictions for each amino acid and the physicochemical properties of the surrounding residues. We also explore the predictive impact of a modified feature vector, which consists of condensed position-specific scoring matrices (PSSMX), secondary structure and solvent accessibility. The best discriminating ability is achieved using the first feature vector combined with a wrapper feature selection algorithm and a support vector machine (SVM). The proposed method results in 70% accuracy, 75% sensitivity and 71% positive predictive value (PPV) in the prediction of the peptide bond conformation between any two amino acids. The output of the feature selection stage is investigated in order to identify discriminatory features as well as the contribution of each neighboring residue in the formation of the peptide bond, thus, advancing our knowledge towards cis/trans isomerization.
A characteristic set method for ordinary difference polynomial systems
Authors: Xiao-Shan Gao, Yong Luo, Chunming Yuan
Venue: Journal of Symbolic Computation (2009)

We prove several basic properties for difference ascending chains, including a necessary and sufficient condition for an ascending chain to be the characteristic set of its saturation ideal and a necessary and sufficient condition for an ascending chain to be the characteristic set of a reflexive prime ideal. Based on these properties, we propose an algorithm to decompose the zero set of a finite set of difference polynomials into the union of zero sets of certain ascending chains. This decomposition algorithm is implemented and used to solve the perfect ideal membership problem, and to prove certain difference identities automatically.
Using an SMT solver and Craig interpolation to detect and remove redundant linear constraints in representations of non-convex polyhedra
Authors: Christoph Scholl, Stefan Disch, Florian Pigorsch, Stefan Kupferschmid
Venue: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning (2008)

We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations by using an incremental SMT solver and then removes the redundant constraints based on Craig interpolation. The approach is evaluated both for formulas from the model checking context including boolean combinations of linear constraints and boolean variables and for random trees composed of quantifiers, AND-, OR-, NOT-operators, and linear constraints produced by a generator. The results clearly show the advantages of our approach in comparison to state-of-the-art solvers.
Success probability of the Hellman trade-off
Authors: Daegun Ma, Jin Hong
Venue: Information Processing Letters (2009)

Cryptanalytic time memory trade-off is a probabilistic algorithm for inverting a generic one-way function. Since its first introduction by Hellman, many variants and their analysis results have appeared. We present a new estimate for the success probability of the original Hellman trade-off, that is more accurate than the lower bound that is widely being used today.
Derivation of invariant scene characteristics from images
Authors: Berthold K. P. Horn
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

To us, vision is an immediate experience, not subject to careful introspection. We cannot write down protocols of processing steps that lie between the raw image intensities and our vivid impression of the surrounding scenery. Furthermore, we find ourselves in possession of this faculty long before we learn to master the more sequential processing tasks involved in the use of language, for example. Consequently, the difficulties of the vision process are often not appreciated. This is as true today, when many inroads have been made on the problem of understanding this process, as it was earlier when it was thought that vision could be understood simply in terms of some general ideas of artificial intelligence.
More than face-to-face: empathy effects of video framing
Authors: David T. Nguyen, John Canny
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Video conferencing attempts to convey subtle cues of face-to-face interaction (F2F), but it is generally believed to be less effective than F2F. We argue that careful design based on an understanding of non-verbal communication can mitigate these differences. In this paper, we study the effects of video image framing in one-on-one meetings on empathy formation. We alter the video image by framing the display such that, in one condition, only the head is visible while, in the other condition, the entire upper body is visible. We include a F2F control case. We used two measures of dyad empathy and found a significant difference between head-only framing and both upper-body framing and F2F, but no significant difference between upper-body framing and F2F. Based on these and earlier results, we present some design heuristics for video conferencing systems. We revisit earlier negative experimental results on video systems in the light of these new experiments. We conclude that for systems that preserve both gaze and upper-body cues, there is no evidence of deficit in communication effectiveness compared to face-to-face meetings.
Evaluation of Water Quality Using Grey Clustering
Authors: Changjun Zhu, Qinghua Liu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Evaluation of water environment quality plays an important role in environment science. Because of many factors affecting environment quality, it is a basic task to select rational pattern and make full use of limited information from monitors so as to describe environment quality objectively. In view of the deficiency of the traditional methods, based on the grey theory, a grey clustering model is established to evaluate water quality. The proposed model was applied to assess the water quality of 20 sections in Suzhou River. The evaluation result was compared with that of the traditional method and the reported results in the Suzhou River. It is indicated that the performance of the proposed model is practically feasible in the application of water quality assessment and its application is simple.
Hamilton&#x2013;Pontryagin Integrators on Lie Groups Part&#x00a0;I: Introduction and Structure-Preserving Properties
Authors: Nawaf Bou-Rabee, Jerrold E. Marsden
Venue: Foundations of Computational Mathematics (2009)

In this paper, structure-preserving time-integrators for rigid body-type mechanical systems are derived from a discrete Hamilton&#x2013;Pontryagin variational principle. From this principle, one can derive a novel class of variational partitioned Runge&#x2013;Kutta methods on Lie groups. Included among these integrators are generalizations of symplectic Euler and St&#x00f6;rmer&#x2013;Verlet integrators from flat spaces to Lie groups. Because of their variational design, these integrators preserve a discrete momentum map (in the presence of symmetry) and a symplectic form. In a companion paper, we perform a numerical analysis of these methods and report on numerical experiments on the rigid body and chaotic dynamics of an underwater vehicle. The numerics reveal that these variational integrators possess structure-preserving properties that methods designed to preserve momentum (using the coadjoint action of the Lie group) and energy (for example, by projection) lack.
Fuzzy rational approximation of irrationals
Authors: Jaroslav Hančl, Ladislav Mišík, János T. Tóth
Venue: Fuzzy Sets and Systems (2009)

Approximation of irrational numbers by fuzzy intervals are discussed. Irrational numbers are classified by measures of their expressibility by fuzzy intervals with rational core which are introduced in the paper. Some properties of these measures are studied.
Acoustic feature selection for automatic emotion recognition from speech
Authors: Jia Rong, Gang Li, Yi-Ping Phoebe Chen
Venue: Information Processing and Management: an International Journal (2009)

Emotional expression and understanding are normal instincts of human beings, but automatical emotion recognition from speech without referring any language or linguistic information remains an unclosed problem. The limited size of existing emotional data samples, and the relative higher dimensionality have outstripped many dimensionality reduction and feature selection algorithms. This paper focuses on the data preprocessing techniques which aim to extract the most effective acoustic features to improve the performance of the emotion recognition. A novel algorithm is presented in this paper, which can be applied on a small sized data set with a high number of features. The presented algorithm integrates the advantages from a decision tree method and the random forest ensemble. Experiment results on a series of Chinese emotional speech data sets indicate that the presented algorithm can achieve improved results on emotional recognition, and outperform the commonly used Principle Component Analysis (PCA)/Multi-Dimensional Scaling (MDS) methods, and the more recently developed ISOMap dimensionality reduction method.
An Efficient Flow Control Plan for End-to-End Delivery of Pre-Stored Compressed Videos
Authors: Sheau-Ru Tong, Sho-Chi Lee
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper studies the end-to-end flow control strategy of delivering videos over a data path, where in one end, a server retrieves large fixed-sized video blocks from its disk drive at a constant block rate. In the other end, a client consumes variable-sized compressed video frames at a fixed frame rate. Between the two ends, a network channel transmits small fixed-sized cells at a constant cell rate. We propose a flow control plan with two hierarchical phases, namely, the peer-level and network-level phases. Our control plans consume both the minimum buffer space and the minimum network channel bandwidth. We conduct a set of experiments by tracing several typical video tracks, and observe a few common facts that for each video flow, (1) the client only need to enforce couple seconds start-up delay before playback (2) the minimum total buffer space required is less than 1.4Mbytes and (3) the minimum network bandwidth required is very close to the video average bit rate.
Bound-based identification of timing-violating paths under variability
Authors: Lin Xie, Azadeh Davoodi
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

We introduce a bound-based technique to identify the top M timing-violating paths in a circuit under variability. These are the paths with the highest violation probability (i.e., Cp) which is the probability that a path (i.e., p) violates the timing constraint. To compute Cp, we require the violation probabilities of the nodes (i.e., Cn) and edges (i.e., Ce) on the path. First, we show computing Cn and Ce of all the nodes and edges requires only two rounds of Statistical Static Timing Analysis and then for each node/edge we need one table lookup for probability calculation using a technique known as Pearson Curve. Given Cn and Ce, our major contribution is in computing upper and lower bounds for Cp of an arbitrary path segment. We show constant-time for incremental update of the bounds when extending a path segment to a longer one. These bounds can be used to exactly construct the top violating paths. If the goal is to find the single most-violating path, we show a bound-based formulation that can prune a large portion of circuit without losing optimality. In our simulations, we verify the correctness and accuracy of our bounds for individual paths. We also verify identification of selected paths using Monte Carlo simulation. We obtain near-optimal accuracy with fast runtimes.
Exploiting idle CPU cores to improve file access performance
Authors: Takanori Ueda, Yu Hirate, Hayato Yamana
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Many-core CPUs require many parallel computation tasks to reach their full potential because CPU cores become idle if they do not have enough computation tasks. How best to utilize a number of cores in many-core CPUs should be examined. In this paper, we propose exploitation of idle cores for improving file access performance. Idle cores are used to extract file access patterns from access logs and the extracted patterns are used to improve file cache efficiency by reordering the LRU (Least Recently Used) list based on the extracted patterns. Data mining techniques are used to extract access patterns to reduce computation overhead. Our method was evaluated by simulation and also implemented on Linux kernel 2.6.26 as a prototype system. In the simulation experiment, our method improved the cache-hit ratio up to 1.09% on DBT-2 (TPC-C) trace logs. Our prototype implementation on Linux improves DBT-2 performance up to 5.24% on a real machine.