ppxscal/embedding_network huggingface dataset:
Making PVS do what you want
Authors: M. Archer
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We focus on how to capture common specification and proof patterns in PVS in order to tailor PVS for the verification of a particular class of systems. The use of specification templates can simplify the development of PVS strategies that correspond to proof steps that recur in proofs of specific classes of system properties.
Structuring Programs for Efficient Operation in Virtual Memory Systems
Authors: A. L. Barrese
Venue: IEEE Transactions on Software Engineering (1979)

Procedures are presented for reducing page faults by program restructuring and utilization of bin packing techniques. A Markov model is presented and used as a basis for the methods presented. Parameter estimation of appropriate software statistics for the model is given. The techniques described are applicable to completed programs as weli as those under development. Experimental results are included.
A testing scenario for probabilistic processes
Authors: Ling Cheung, Mariëlle Stoelinga, Frits Vaandrager
Venue: Journal of the ACM (JACM) (2007)

We introduce a notion of finite testing, based on statistical hypothesis tests, via a variant of the well-known trace machine. Under this scenario, two processes are deemed observationally equivalent if they cannot be distinguished by any finite test. We consider processes modeled as image finite probabilistic automata and prove that our notion of observational equivalence coincides with the trace distribution equivalence proposed by Segala. Along the way, we give an explicit characterization of the set of probabilistic generalize the Approximation Induction Principle by defining an also prove limit and convex closure properties of trace distributions in an appropriate metric space.
An illumination-independent edge detection and fuzzy enhancement algorithm based on wavelet transform for non-uniform weak illumination images
Authors: Wanpeng Cao, Rensheng Che, Dong Ye
Venue: Pattern Recognition Letters (2008)

An illumination-independent edge detection and fuzzy enhancement algorithm based on wavelet transform is proposed to extract edges out of the non-uniform weak illumination image. Firstly, to work out the illumination-independent edge detection method based on wavelet transform, the illumination-reflection image formation model and CCD camera imaging formula are introduced. In succession, the pixels' wavelet module coefficients in the local edge area of the image are analyzed and compared, and the illumination-independent edge detection formula insensitive to illumination variation is presented. Then, for increasing the difference between edges, background and noise, the fuzzy enhancement operator which takes not only the wavelet module magnitude into account, but also the wavelet gradient direction is designed. Finally, single pixel edges are taken out of images according to edge pixels' characteristic after wavelet transform. Through synthetic and real images experiments, this edge detection method's performance for the non-uniform weak illumination images is analyzed and compared with other two edge detection methods quantitatively and qualitatively. The experiment result proves the edge detection method works well for the uneven gray and low contrast images.
Implementation and Performance Evaluation of Socket and RMI based Java Message Passing Systems
Authors: SeungJun Bang, JinHo Ahn
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Recently, as speeds of computer processors and networks are rapidly increasing, a lot of researches are actively progressing to develop efficient and lightweight parallel computing platforms using heterogeneous and networked computers. According to this technical trend, this paper designs and implements a message passing library called JMPI(Java Message Passing Interface) which complies with MPJ, the MPI standard specification for Java language. This library provides some graphic user interface tools to enable parallel computing environments to be configured very simply by their administrators and JMPI applications to be executed very conveniently. Especially, it is implemented as two versions based on two typical distributed system communication mechanisms, Socket and RMI. According to these communication mechanisms, the performance of each message passing system is evaluated by measuring its processing speed with respect to the increasing number of computers by executing three well-known applications. Experimental results show that the most efficient processing speedup can be obtained by increasing the number of the computers in consideration of network traffics generated by applications.
Developments and Software Requirements of the Emerging National Supercomputer Research Centers
Venue: IEEE Software (1985)

The seven centers surveyed here make supercomputers available to researchers. But innovative software development is needed to ensure their effective use. 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
Machine Learning for Question Answering from Tabular Data
Authors: Mahboob Alam Khalid, Valentin Jijkoun, Maarten de Rijke
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Question Answering (QA) systems automatically answer natural language questions in a human-like manner. One of the practical approaches to open domain QA consists in extracting facts from free text offline and using a lookup mechanism when answering user's questions online. This approach is related to natural language interfaces to databases (NLIDBs) that were studied extensively from the 1970s to the 1990s. NLIDB systems employed a range of techniques, from simple pattern-matching rules to formal logical calculi such as the lambda calculus, but most were restricted to specific domains. In this paper we describe a machine learning approach to querying tabular data for QA which is not restricted to specific domains. Our approach consists of two steps: for an incoming question, we first use a classifier to identify appropriate tables and columns in a structured database, and then employ a free-text retrieval to look up answers. The system uses part-of-speech tagging, named-entity normalization and a statistical classifier trained on data from the TREC QA task. With the TREC QA data, our system is shown to significantly outperform an existing rule-based table lookup method.
A Student Experiment Method for Embedded System Education Based on Incremental Upgrade
Authors: Hiroyasu Mitsui, Hidetoshi Kambe, Dilmurat Tilwaldi, Hisao Koizumi
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The applications of embedded systems are widespread not only in consumer products and industrial machines but also for ubiquitous or sensor networking. However, the number of embedded system engineers is small and a few universities in Japan offer education pertaining to embedded systems. Embedded system engineers should acquire both the hardware (HW) and software (SW) technologies. We propose an educational method using student experiments to train embedded SW engineers who understand HW technologies. The experiments are related to developing SW, designing FPGA devices and learning HW/SW co-design. By conducting these experiments, students learn system modeling, HW/SW trade-off and development of SW and HW modules. We developed a JPEG encoder experiment using HW/SW co-design for evaluation.
Synchronization verification in system-level design with ILP solvers
Authors: T. Sakunkonchak, S. Komatsu, M. Fujita
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making design and verification difficult tasks. In this work, we propose a synchronization verification method for system-level designs described in the SpecC language. Instead of modeling the design with timed FSMs and using a model checker for timed automata (such as UPPAAL or KRONOS), we formulate the timing constraints with equalities/inequalities that can be solved by integer linear programming (ILP) tools. Verification is conducted in two steps. First, similar to other software model checkers, we compute the reachability of an error state in the absence of timing constraints. Then, if a path to an error state exists, its feasibility is checked by using the ILP solver to evaluate the timing constraints along the path. This approach can drastically increase the sizes of the designs that can be verified. Abstraction and abstraction refinement techniques based on the counterexample-guided abstraction refinement (CEGAR) paradigm are applied. The proposed verification flow is introduced and some preliminary results are presented here.
Experiments on Network Services for the Grid
Authors: Christoph Barz, Peter Martini, Markus Pilz, Florian Purnhagen
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

For demanding Grid applications that use resources at different cluster sites a reservation mechanism can ensure the availability of resources to guarantee a certain level of QoS. Besides computational and storage resources, we see the network as a reservable resource as well. Our approach to QoS is to schedule resources in the network for exclusive usage in advance. For this purpose, a flexible reservation mechanism is needed to meet the requirements of Grid applications and schedulers. In this paper we introduce a wider notion of network service than previous work. Special focus is on a file transfer service that guarantees the timely availability of data at the different Grid sites. To cope with these requirements, strategies and algorithms for a flexible network reservation service are introduced and evaluated systematically. Here, algorithms using a single path strategy are compared to algorithms using multiple paths. Our simulation results show that data transport via multiple paths leads to a higher user and network provider satisfaction than single path transfers.
Efficient unit test case minimization
Authors: Andreas Leitner, Manuel Oriol, Andreas Zeller, Ilinca Ciupa, Bertrand Meyer
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Randomized unit test cases can be very effective in detecting defects. In practice, however, failing test cases often comprise long sequences of method calls that are tiresome to reproduce and debug. We present a combination of static slicing and delta debugging that automatically minimizes the sequence of failure-inducing method calls. In a case study on the EiffelBase library, the strategy minimizes failing unit test cases on average by 96%. This approach improves on the state of the art by being far more efficient: in contrast to the approach of Lei and Andrews, who use delta debugging alone, our case study found slicing to be 50 times faster, while providing comparable results. The combination of slicing and delta debugging gives the best results and is 11 times faster.
Toward a Formalization of UML2.0 Metamodel using Z Specifications
Authors: Ahmed M. Mostafa, Manal A. Ismail, Hatem EL-Bolok, E. M. Saad
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The Unified Modeling Language (UML) has become a widely adopted standard in the software development industry. Unfortunately, the UML is a semi-formal language which lacks precisely defined constructs. Z language is a formal specification language. Formal languages are used to ensure that systems meet regulations and standards. This paper aims to reduce risks associated with software development and increase safety and reliability. This goal is achieved by formalizing the syntax of (a sub-set of) the popular UML diagrams (Use Case diagram, Class diagram, and State Machine diagram) using Z specifications.
LDA-Based Compound Distance for Handwritten Chinese Character Recognition
Authors: T.-F Gao, C.-L. Liu
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we propose a linear discriminant analysis (LDA)-based compound distance measure for discriminating similar characters in handwritten Chinese character recognition. The previous compound Mahalanobis function (CMF) is shown to be a special case of the proposed method. On finding similar character pairs by cross-validation using a baseline classifier, LDA is applied to each similar pair, and the LDA-based distance measure is combined with the discriminant function of the baseline classifier. In our experiments on the ETL9B and CASIA databases using the modified quadratic discriminant function (MQDF) as baseline classifier, the LDA-based compound distance is demonstrated to outperform the previous compound function methods.
Interactive Visualization of Volumetric White Matter Connectivity in DT-MRI Using a Parallel-Hardware Hamilton-Jacobi Solver
Authors: Won-Ki Jeong, P. Thomas Fletcher Ran Tao Ross Whitaker
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

In this paper we present a method to compute and visualize volumetric white matter connectivity in diffusion tensor magnetic resonance imaging (DT-MRI) using a Hamilton-Jacobi (H-J) solver on the GPU (Graphics Processing Unit). Paths through the volume are assigned costs that are lower if they are consistent with the preferred diffusion directions.The proposed method finds a set of voxels in the DTI volume that contain paths between two regions whose costs are within a threshold of the optimal path.The result is a volumetric optimal path analysis, which is driven by clinical and scientific questions relating to the connectivity between various known anatomical regions of the brain.To solve the minimal path problem quickly, we introduce a novel numerical algorithm for solving H-J equations, which we call the Fast Iterative Method (FIM). This algorithm is well-adapted to parallel architectures, and we present a GPU-based implementation, which runs roughly 50-100 times faster than traditional CPU-based solvers for anisotropic H-J equations. The proposed system allows users to freely change the endpoints of interesting pathways and to visualize the optimal volumetric path between them at an interactive rate. We demonstrate the proposed method on some synthetic and real DT-MRI datasets and compare the performance with existing methods.
Uncertainty Analysis in Software Reliability Modeling by Bayesian Analysis with Maximum-Entropy Principle
Authors: Yuan-Shun Dai, Min Xie, Quan Long, Szu-Hui Ng
Venue: IEEE Transactions on Software Engineering (2007)

In software reliability modeling, the parameters of the model are typically estimated from the test data of the corresponding component. However, the widely used point estimators are subject to random variations in the data, resulting in uncertainties in these estimated parameters. For large complex systems made up of many components, the uncertainty of each individual parameter amplifies the uncertainty of the total system reliability. Ignoring the parameter uncertainty can result in grossly underestimating the uncertainty in the total system reliability. This paper attempts to study and quantify the uncertainties in the software reliability modeling of a single component with correlated parameters and in a large system with numerous components. Previous works on quantifying uncertainties have assumed a sufficient amount of available data. However, a characteristic challenge in software testing and reliability is the lack of available failure data from a single test which often makes modeling difficult. This lack of data poses a bigger challenge in the uncertainty analysis of the software reliability modeling. To overcome this challenge, this paper proposes to utilize experts' opinions and historical data from previous projects to complement the small number of observations to quantify the uncertainties. This is done by combining the Maximum-Entropy Principle (MEP) into the Bayesian approach. This paper further considers the uncertainty analysis at the system level which contains multiple components, each with its respective model/parameter/uncertainty using a Monte Carlo approach. Some examples with different modeling approaches (NHPP, Markov, Graph theory) are illustrated to show the generality and effectiveness of the proposed approach. Furthermore, we illustrate how the proposed approach for considering the uncertainties in various components improves a large-scale system reliability model proposed in Dai & Levitin (2006) by relaxing a critical assumption.
An Event Correlation Synchronization Algorithm for MMOG
Authors: Xiang-bin Shi, Liu Fang, Du Ling, Zhou Xing-hai, Xing Yuan-sheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

This paper proposes a new synchronization algorithm which introduces the concept of event correlation into Emewarp algorithm. Under this synchronization mechanism, state rollback is executed only when there exists an event whose timestamp is within the rollback time and the event is related with others that should be executed after it but has been done before. The simulation results show that the improved algorithm can reduce the rollback number effectively and decrease playout delay, so that MMOG's interactivity and playability are uplijled.
An Integrated Design Automation System for VLSI Circuits
Authors: O. Karatsu, T. Hoshino, M. Endo, H. Kitazawa, T. Adachi, K. Ueda
Venue: IEEE Design Test (1985)

Our Integrated Design Automation System consists of an integrated design database, automated design processors, verificationtools, and an interactive capture system. The automatic logic synthesis program, Angel, and the hierarchical layout systemChamp/Alpha, have been particularly important in reducing the total design effort. A unified design language, HSL-FX, hasbeen developed to broaden LSI design system coverage and to obtain better results from automatic logic synthesis. Using thissystem, a 10K-gate CPU has been designed in two man-months?from function-level description to layour pattern.
On the role of trust in collaborative Web search
Authors: Peter Briggs, Barry Smyth
Venue: Artificial Intelligence Review (2006)

Recommender systems combine ideas from information retrieval, user modelling, and artificial intelligence to focus on the provision of more intelligent and proactive information services. As such, recommender systems play an important role when it comes to assisting the user during both routine and specialised information retrieval tasks. Like any good assistant it is important that users can trust in the ability of a recommender system to respond with timely and relevant suggestions. In this paper, we will look at a collaborative recommendation system operating in the domain of Web search. We will show how explicit models of trust can help to inform more reliable recommendations that translate into more relevant search results. Moreover, we demonstrate how the availability of this trust-model facilitates important interface enhancements that provide a means to declare the provenance of result recommendations in a way that will allow searchers to evaluate their likely relevance based on the reputation and trustworthiness of the recommendation partners behind these suggestions.
Localization of ahead vehicles with on-board stereo cameras
Authors: Michele Zanin
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper introduces a vision based algorithm that detects and localizes ahead vehicles elaborating images taken by a stereo camera installed on an intelligent vehicle. The algorithm is based on the analysis of stereo images, estimating the ground plane by least square fitting of disparity data, and segmenting the obstacles by a rule based split/merge strategy. Quantitative experiments on complex real world sequences validate the approach. The method is demonstrated to operate in real-time.
Dependency-based distributed intrusion detection
Authors: Ji Li, Dah-Yoh Lim, Karen Sollins
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

Distributed network intrusion detection has attracted much attention recently. Our main focus in this work is on zero-day, slow-scanning worms, of which no existing signatures are available. We organize end hosts into regions based on network knowledge, which we posit is positively correlated to the dependency structure. Leveraging on this organization, we apply different intrusion detection techniques within and across regions. We use a hidden Markov model (HMM) within a region to capture the dependency among hosts, and use sequential hypothesis testing (SHT) globally to take advantage of the independence between regions. We conduct experiments on DETER, and preliminary results show improvement on detection effectiveness and reduction of communication overhead.
Infeasible/feasible search trajectories and directional rounding in integer programming
Authors: Fred Glover
Venue: Journal of Heuristics (2007)

The notion that strategies in non-linear and combinatorial optimization can benefit by purposefully and systematically navigating between feasible and infeasible space has been around for many years, but still is sometimes dismissed as having little relevance for creating more effective methods. To reinforce the case on behalf of approaches that endorse infeasible/feasible search trajectories, it is possible to formulate simple theorems disclosing useful properties of such trajectories in the context of integer programming. These results motivate a closer examination of integer programming search processes based on directional rounding processes, including a special variant called conditional directional rounding. From these foundations a variety of new strategies emerge for exploiting connections between feasible and infeasible space.
Region saliency as a measure for colour segmentation stability
Authors: Gunther Heidemann
Venue: Image and Vision Computing (2008)

This paper proposes a goodness function for colour segmentation, which allows to predict whether the segmented regions will be stable against noise, variation of lighting, and change of viewpoint. As such a measure, colour saliency defined from average border contrast is proposed. While the idea to maximise border contrast in segmentation is not novel per se, it is shown here empirically that maximisation of border contrast indeed leads to improved region stability. Experiments for three different algorithms show that the effect is independent of the particular functional principle of segmentation. Thus, the measure can be applied for the automatic and context-free optimisation of segmentation parameters.