ppxscal/embedding_network huggingface dataset:
Higher-order term indexing using substitution trees
Authors: Brigitte Pientka
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We present a higher-order term indexing strategy based on substitution trees for simply typed lambda-terms. There are mainly two problems in adapting first-order indexing techniques. First, many operations used in building an efficient term index and retrieving a set of candidate terms from a large collection are undecidable in general for higher-order terms. Second, the scoping of variables and binders in the higher-order case presents challenges. The approach taken in this article is to reduce the problem to indexing linear higher-order patterns, a decidable fragment of higher-order terms, and delay solving terms outside of this fragment. We present insertion of terms into the index based on computing the most specific linear generalization of two linear higher-order patterns, and retrieval based on matching two linear higher-order patterns. Our theoretical framework maintains that terms are in &beta;&eta;-normal form, thereby eliminating the need to renormalize and raise terms during insertion and retrieval. Finally, we prove correctness of our presented algorithms. This indexing structure is implemented as part of the Twelf system to speed up the execution of the tabled higher-logic programming interpreter.
Human Factor Analysis on Marine Accidents Based on Attribute Reduction
Authors: Bin Zheng, Shaosheng Xia, Jinbiao Chen, Yongxing Jin
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A new method based on attribute reduction, which is developed from rough set theory, is introduced to dig out main factors leading to human errors in marine accidents. The basic theory of rough set is mentioned, and a method of attribute deduction based on genetic algorithm is introduced. Experiment based on RSES, a rough set analysis tool, is implemented on a data-set which includes 30 factors which may be lead to Look-out Missing, a common human error on board. Reasonable result, an accurate set of main factors, is received after the implementation of the experiment and a conclusion that attribute reduction is a reliable and convenient way to generalize main factors lead to human errors in marine accident is made finally according to the experiment result.
Visualizing Potential Deadlocks in Multithreaded Programs
Authors: Byung-Chul Kim, Sang-Woo Jun, Dae Joon Hwang, Yong-Kee Jun
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

It is important to analyze and identify potential deadlocks resident in multithreaded programs from a successful deadlock-free execution, because the nondeterministic nature of such programs may hide the errors during testing. Visualizing the runtime behaviors of locking operations makes it possible to debug such errors effectively, because it provides intuitive understanding of different feasible executions caused by nondeterminism. However, with previous visualization techniques, it is hard to capture alternate orders imposed by locks due to their representation of a partial-order over locking operations. This paper presents a novel graph, called lock-causality graph, which represents alternate orders over locking operations. A visualization tool implements the graph, and demonstrates its power using the classical dining-philosophers problem written in Java. The experiment result shows that the graph provides a simple but powerful representation of potential deadlocks in an execution instance not deadlocked.
College Technology Programs: Computer applications, Word, Excel, Access, and PowerPoint
Authors: LingLing Yen
Venue:  (2009)

This study was to determine how college students assess their college technology programs and how they perceive the adequacy of the technology skills they had acquired in meeting workplace needs. A survey research design was used in this study. Major skill areas include Word,Access,Excel,and PowerPoint. The findings indicated that participants were satisfied with the quality of their technology programs but they expressed some concern with the areas of instructional materials and integrating technology. Four-year college participants agreed that they had acquired the necessary Word,Excel,PowerPoint,and Access skills. Two-year college participants agreed that they have acquired the necessary Word,Excel,and PowerPoint skills but did not express they had acquired the necessary Access skills.Recommendations included:(a) conducting survey research to identify businesses and industries? technology needs,(b)improving the questionnaire,(c)interviewing faculty members and students for survey research,(d)conducting a pilot study,(e)establishing validity and reliability for the modified questionnaire,and(f)using research design. 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
Inductance Transducer for Pressure Difference Measurement with Magnetic Fluid
Authors: Ruican Hao, Decai Li, Guoqiang Dong
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In the paper, a transducer with a kind of functional material--magnetic fluid was studied. Based on the fluidity and the paramagnetism of magnetic fluid, the behavior of the magnetic fluid in the magnetic field was introduced. The inductance of the coils in the circuit and the voltage output was presented based on the electromagnetic theory and the ferrohydrodynamics. The results of the experiment which was presented demonstrated output voltage is proportional to the input pressure difference ignoring the magnetoviscous effect of the magnetic fluid, and the theory and the research work of the transducer with magnetic fluid is workable.
Existence of solutions of vector variational inequalities and vector complementarity problems
Authors: Q. H. Ansari, A. P. Farajzadeh, S. Schaible
Venue: Journal of Global Optimization (2009)

In this paper, we consider vector variational inequality and vector F-complementarity problems in the setting of topological vector spaces. We extend the concept of upper sign continuity for vector-valued functions and provide some existence results for solutions of vector variational inequalities and vector F-complementarity problems. Moreover, the nonemptyness and compactness of solution sets of these problems are investigated under suitable assumptions. We use a version of Fan-KKM theorem and Dobrowolski's fixed point theorem to establish our results. The results of this paper generalize and improve several results recently appeared in the literature.
Covering a Tree by a Forest
Authors: Fanica Gavril, Alon Itai
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of trees of F, such that every vertex of T is covered exactly once. TheForest edge-cover problem (FEC): cover the edges of T by a minimum number of copies of trees of F, such that every edge of T is covered exactly once. For a solution to always exist, we assume that F contains a one vertex (one edge) tree.Two versions of Problem FVC are considered: ordered covers (OFVC), and unordered covers (UFVC). Three versions of Problem FEC are considered: ordered covers (OFEC), unordered covers (UFEC) and consecutive covers (CFEC). We describe polynomial time algorithms for Problems OFVC, UFVC and CFEC, and prove that Problems OFEC and UFEC are NP-complete.
Efficient Pruning Schemes for Distance-Based Outlier Detection
Authors: Nguyen Hoang Vu, Vivekanand Gopalkrishnan
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

Outlier detection finds many applications, especially in domains that have scope for abnormal behavior. In this paper, we present a new technique for detecting distance-based outliers, aimed at reducing execution time associated with the detection process. Our approach operates in two phases and employs three pruning rules. In the first phase, we partition the data into clusters, and make an early estimate on the lower bound of outlier scores. Based on this lower bound, the second phase then processes relevant clusters using the traditional block nested-loop algorithm. Here two efficient pruning rules are utilized to quickly discard more non-outliers and reduce the search space. Detailed analysis of our approach shows that the additional overhead of the first phase is offset by the reduction in cost of the second phase. We also demonstrate the superiority of our approach over existing distance-based outlier detection methods by extensive empirical studies on real datasets.
On a Decomposition Model for Optical Flow
Authors: Jochen Abhau, Zakaria Belhachmi, Otmar Scherzer
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

In this paper we present a variational method for determining cartoon and texture components of the optical flow of a noisy image sequence. The method is realized by reformulating the optical flow problem first as a variational denoising problem for multi-channel data and then by applying decomposition methods. Thanks to the general formulation, several norms can be used for the decomposition. We study a decomposition for the optical flow into bounded variation and oscillating component in greater detail. Numerical examples demonstrate the capabilities of the proposed approach.
Logic for automated mechanism design: a progress report
Authors: Michael Wooldridge, Thomas Agotnes, Paul E. Dunne, Wiebe Van der Hoek
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Over the past half decade, we have been exploring the use of logic in the specification and analysis of computational economic mechanisms. We believe that this approach has the potential to bring the same benefits to the design and analysis of computational economic mechanisms that the use of temporal logics and model checking have brought to the specification and analysis of reactive systems. In this paper, we give a survey of our work. We first discuss the use of cooperation logics such as Alternating-time Temporal Loglc (ATL) for the specification and verification of mechanisms such as social choice procedures. We motivate the approach, and then discuss the work we have done on extensions to ATL to support incomplete information, preferences, and quantification over coalition. We then discuss is the use of ATL-like cooperation logics in the development of social laws.
The Evolution of a Web Accessibility Testing Protocol
Authors: Tom Jewett, Wayne Dick
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In early 2007, the California State University (CSU) system initiated a program to make all information technology accessible to persons with disabilities; the authors were appointed to lead the Web portion of this effort. Campuses initially hoped to rely on automated testing of Web sites to evaluate their level of accessibility and determine what repairs would be needed. However, we found that automated testing tools were severely limited both in their ability to identify relevant problems and, surprisingly, in their scalability to sites of CSU magnitude. The first manual (non-automated, human intelligence based) testing protocols that we developed proved to be awkward in practice; this paper reports our substantial recent refinements after extensive use and incorporation of the newest accessibility guidelines. We also suggest how this protocol can become part of the Web development workflow, rather than being used solely to check legacy sites.
An Analysis of the Composition of Synchronous Systems
Authors: Bijoy A. Jose, Bin Xue, Sandeep K. Shukla
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Safety-critical embedded applications are often distributed. For example, software in an automotive control or in avionics control are distributed over a large number of distributed processors which are connected over some domain specific buses. Correctness of such applications is of paramount importance due to their safety-critical nature. Synchronous programming models (e.g. Esterel, SIGNAL, Lustre) make synchrony assumption (zero time intra-module computation and zero time inter module communication) while modeling such applications so that the model is easier to verify. Once verified, models built with such assumptions need to be distributed over an asynchronous communication based platform which brings out the challenge of Globally Asynchronous and Locally synchronous (GALS) design. The correctness preserving refinement of a fully synchronous model onto a globally asynchronous communication media implies that various restrictions be imposed on the synchronous model. In the realm of polychronous programming model (exemplified by the SIGNAL language), a property called 'endo-isochrony' was proposed in early 1990s. Endochrony of individual modules assures safe sequential code generation from the module specification, and isochrony ensures safe communication between modules. In this paper, first we provide a more general sufficient condition for isochrony. Second, we generalize the definition of isochrony for weakly-endochronous modules. Further, we introduce the notion of directional isochrony which provides sufficient conditions for safe communication between modules in one direction but not in the other direction. The results in this paper not only simplifies the understanding of the conditions under which a polychronous specification can be implemented in GALS, but also sheds interesting lights on causality and isochrony. When the synchronous modules are reused as IPs, the conditions described here can be checked to see whether those modules can be composed asynchronously with the same behavior as their synchronous composition.
Gear Fault Diagnosis Based on EMD and AR Spectrum Analysis
Authors: Shufeng Ai, Hui Li, Lihui Fu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

A novel method to fault diagnosis of gear crack based on empirical mode decomposition (EMD) and autoregressive (AR) spectrum is presented. This method can carry out empirical mode decomposition and extract feature information of different machine parts in condition monitoring and fault diagnosis of machinery. The main objective of empirical mode decomposition is to separate the time series data into components with different time scale. Then the AR model estimation is applied to each intrinsic mode function and the AR spectrum is obtained. As an example, the vibration signal of a gearbox is analyzed. The experimental results show that this method based on empirical mode decomposition and autoregressive spectrum can effectively diagnose the crack faults of gear.
Time-Bounded Verification
Authors: Joël Ouaknine, Alexander Rabinovich, James Worrell
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bounded language inclusion for timed automata is 2EXPSPACE-Complete. We also investigate the satisfiability and model-checking problems for Metric Temporal Logic (MTL), as well as monadic first- and second-order logics over the reals with order and the + 1 function (FO( < , + 1) and MSO( < , + 1) respectively). We show that, over bounded time intervals, MTL satisfiability and model checking are EXPSPACE-Complete, whereas these problems are decidable but non-elementary for the predicate logics. Nevertheless, we show that MTL and FO( < , + 1) are equally expressive over bounded intervals, which can be viewed as an extension of Kamp's well-known theorem to metric logics.It is worth recalling that, over unbounded time intervals, the satisfiability and model-checking problems listed above are all well-known to be undecidable.
Probabilistic Approximations of Signaling Pathway Dynamics
Authors: Bing Liu, P. S. Thiagarajan, David Hsu
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic approximation of the ODE dynamics by discretizing the value space and the time domain. We then sample a representative set of trajectories and exploit the discretization and the structure of the signaling pathway to encode these trajectories compactly as a dynamic Bayesian network. As a result, many interesting pathway properties can be analyzed efficiently through standard Bayesian inference techniques. We have tested our method on a model of EGF-NGF signaling pathway [1] and the results are very promising in terms of both accuracy and efficiency.
A modified genetic algorithm approach for scheduling of perfect maintenance in distributed production scheduling
Authors: S. H. Chung, Felix T. S. Chan, H. K. Chan
Venue: Engineering Applications of Artificial Intelligence (2009)

Distributed Scheduling (DS) problems have attracted attention by researchers in recent years. DS problems in multi-factory production are much more complicated than classical scheduling problems because they involve not only the scheduling problems in a single factory, but also the problems in the higher level, which is: how to allocate the jobs to suitable factories. It mainly focuses on solving two issues simultaneously: (i) allocation of jobs to suitable factories and (ii) determination of the corresponding production schedules in each factory. Its objective is to maximize system efficiency by finding an optimal plan for a better collaboration among various processes. However, in many papers, machine maintenance has usually been ignored during the production scheduling. In reality, every machine requires maintenance, which will directly influence the machine's availability, and consequently the planned production schedule. The objective of this paper is to propose a modified genetic algorithm approach to deal with those DS models with maintenance consideration, aiming to minimize the makespan of the jobs. Its optimization performance has been compared with other existing approaches to demonstrate its reliability. This paper also tests the influence of the relationship between the maintenance repairing time and the machine age to the performance of scheduling of maintenance during DS in the studied models.
UIUC: a knowledge-rich approach to identifying semantic relations between nominals
Authors: Brandon Beamer, Suma Bhat, Brant Chee, Andrew Fister, Alla Rozovskaya, Roxana Girju
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper describes a supervised, knowledge-intensive approach to the automatic identification of semantic relations between nominals in English sentences. The system employs different sets of new and previously used lexical, syntactic, and semantic features extracted from various knowledge sources. At SemEval 2007 the system achieved an F-measure of 72.4% and an accuracy of 76.3%.
Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks
Authors: Patrick Schaller, Benedikt Schmidt, David Basin, Srdjan Capkun
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of physical properties of the environment, namely communication, location, and time. In particular, communication is subject to physical constraints, for example, message transmission takes time determined by the communication medium used and the distance traveled. All agents, including intruders, are subject to these constraints and this results in a distributed intruder with restricted, but more realistic, communication capabilities than those of the standard Dolev-Yao intruder. We have formalized our model in Isabelle/HOL and used it to verify protocols for authenticated ranging, distance bounding, and broadcast authentication based on delayed key disclosure.
DNA Computing Hardware Design and Application to Multiclass Cancer Data
Authors: Sun-Wook Choi, Chong Ho Lee
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

DNA computing-inspired pattern classification based on the hypernetwork model is a novel approach to pattern classification problems. The hypernetwork model has been shown to be a powerful tool for analysis of gene expression data. However, the ordinary hypernetwork model has limitations, such as using only binary data and operating sequentially. In this paper, we propose an improved method to process four-level data and to implement a hardware circuit for DNA computing-inspired pattern classifier. We show simulation results of multi-class cancer classification from the DNA microarray data for performance evaluation. Experiments show competitive diagnosis results over other conventional machine learning algorithms. Our four-level data approach also results stable and improved performance over the ordinary hypernetwork model.
Three-Dimensional Reconstruction Using Enhanced Shape from Stereo Technique
Authors: Osama Hosam, Xingming Sun
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Three-Dimensional reconstruction is the art of getting a 3D model using flat 2D images, this process becomes too difficult when we use a few number of images like the case of stereo images. In stereo images, pair of images are used to reconstruct the view. The reconstruction process depends on the matching process, in which every feature in the first image is matched with its exact feature in the second image. Matching the features only will affect the smoothness and the density of the reconstructed model, in addition matching the whole features in the first image with the whole features in the second image is an exhausting process, since it wastes the processing time and affects the accuracy of the matching process. In this paper we proposed a novel technique to get a more dense 3D model depending on more accurate matching process, we made the matching process in two levels, the first level is matching the features the second level is matching the pixels , then we used the adaptive window technique to match in a small area rather than matching the whole image. The results showed an essential enhancement in the accuracy of the matching process giving a more dense 3D model.