ppxscal/embedding_network huggingface dataset:
Programming with Proofs: Language-Based Approaches to Totally Correct Software
Authors: Aaron Stump
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

Tremendous progress has been made in automated and semi-automated verification since the seminal works on program verification. Automated deductive techniques like model checking have been highly successful for many verification tasks (e.g., [17, 18, 13]). Impressive advances continue to be made in static analysis, type systems, and static bug finding (e.g., [21, 12]). These approaches aim to verify code or find bugs in existing systems as automatically as possible, with as little developer help as possible. This has been the aim of the research community for many years, possibly due in part to the bad reputation that continues to plague full program verification. Theorem proving approaches to program verification have continued to make advances, but indeed, they still are generally applied only to the most critical applications (e.g., [7, 5, 16, 11]).
Visual Methods for Examining SVM Classifiers
Authors: Doina Caragea, Dianne Cook, Hadley Wickham, Vasant Honavar
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

Support vector machines (SVM) offer a theoretically wellfounded approach to automated learning of pattern classifiers. They have been proven to give highly accurate results in complex classification problems, for example, gene expression analysis. The SVM algorithm is also quite intuitive with a few inputs to vary in the fitting process and several outputs that are interesting to study. For many data mining tasks (e.g., cancer prediction) finding classifiers with good predictive accuracy is important, but understanding the classifier is equally important. By studying the classifier outputs we may be able to produce a simpler classifier, learn which variables are the important discriminators between classes, and find the samples that are problematic to the classification. Visual methods for exploratory data analysis can help us to study the outputs and complement automated classification algorithms in data mining. We present the use of tour-based methods to plot aspects of the SVM classifier. This approach provides insights about the cluster structure in the data, the nature of boundaries between clusters, and problematic outliers. Furthermore, tours can be used to assess the variable importance. We show how visual methods can be used as a complement to crossvalidation methods in order to find good SVM input parameters for a particular data set.
A feedback linearization technique by using neural networks: Application to bioprocess control
Authors: Y. S. Boutalis, O. I. Kosmidou
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

In this paper an approach for the problem of feedback linearization of an uncertain system using Artificial Neural Networks (ANN) is proposed. A bioprocess system is considered as an example of a highly nonlinear and time varying uncertain system. The neural network is used as a compensator to the effect of the model uncertainties, which appear in the linearizing control law. The updating of the neural weights is carried out on-line using a conventional back propagation scheme. The stability of the tracking error system as well as the decay of the tracking error to zero are guaranteed by defining an appropriate error signal which has to be minimized by the trained ANN. It is also experimentally shown that the proposed neural network compensator performs well even in the case where the full state vector of the system is not available for measurement.
A Genetic Rate Control Algorithm for Video Compression
Authors: Yu Sun, Siqing Li, Zhidan Feng, YaDong Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Rate control is crucial in controlling compression bitrates for video encoding. However, most rate control algorithms are heuristic, meaning that they are suboptimal and susceptible to get stuck into local optima. In this paper, we conduct a trial research which applies genetic algorithms to video rate control. Experimental results show that the proposed genetic rate control algorithm works well and achieves global optimal results, which can provide the upper-bound for performance evaluations of heuristic rate control algorithms.
Modelling and solving temporal reasoning as propositional satisfiability
Authors: Duc Nghia Pham, John Thornton, Abdul Sattar
Venue: Artificial Intelligence (2008)

Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely used formalisms for representing interval-based qualitative temporal information is Allen's interval algebra (IA). The fundamental reasoning task in IA is to find a scenario that is consistent with the given information. This problem is in general NP-complete. In this paper, we investigate how an interval-based representation, or IA network, can be encoded into a propositional formula of Boolean variables and/or predicates in decidable theories. Our task is to discover whether satisfying such a formula can be more efficient than finding a consistent scenario for the original problem. There are two basic approaches to modelling an IA network: one represents the relations between intervals as variables and the other represents the end-points of each interval as variables. By combining these two approaches with three different Boolean satisfiability (SAT) encoding schemes, we produced six encoding schemes for converting IA to SAT. In addition, we also showed how IA networks can be formulated into satisfiability modulo theories (SMT) formulae based on the quantifier-free integer difference logic (QF-IDL). These encodings were empirically studied using randomly generated IA problems of sizes ranging from 20 to 100 nodes. A general conclusion we draw from these experimental results is that encoding IA into SAT produces better results than existing approaches. More specifically, we show that the new point-based 1-D support SAT encoding of IA produces consistently better results than the other alternatives considered. In comparison with the six different SAT encodings, the SMT encoding came fourth after the point-based and interval-based 1-D support schemes and the point-based direct scheme. Further, we observe that the phase transition region maps directly from the IA encoding to each SAT or SMT encoding, but, surprisingly, the location of the hard region varies according to the encoding scheme. Our results also show a fixed performance ranking order over the various encoding schemes.
Read Mapping Algorithms for Single Molecule Sequencing Data
Authors: Vladimir Yanovsky, Stephen M. Rumble, Michael Brudno
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Single Molecule Sequencing technologies such as the Heliscope simplify the preparation of DNA for sequencing, while sampling millions of reads in a day. Simultaneously, the technology suffers from a significantly higher error rate, ameliorated by the ability to sample multiple reads from the same location. In this paper we develop novel rapid alignment algorithms for two-pass Single Molecule Sequencing methods. We combine the Weighted Sequence Graph (WSG) representation of all optimal and near optimal alignments between the two reads sampled from a piece of DNA with k-mer filtering methods and spaced seeds to quickly generate candidate locations for the reads on the reference genome. We also propose a fast implementation of the Smith-Waterman algorithm using vectorized instructions that significantly speeds up the matching process. Our method combines these approaches in order to build an algorithm that is both fast and accurate, since it is able to take complete advantage of both of the reads sampled during two pass sequencing.
Image guided navigation for minimally invasive surgery
Authors: Hua Zhong
Venue:  (2007)

In this thesis, we present a catheter navigation system for minimally invasive surgery. The core of such a navigation system is to register pre-operative high resolution 3D or 4D heart model with infra-operative bean shape model to build a combined heart shape. With such a combine shape model the intra-operative catheter motion can be tracked and displayed with it Then clinicians can easily navigate catheters inside human heart. The most difficult part of such a registration is how to quickly and reliably capture infra-cardiac heart shape measurement. We designed a 3D ultrasound catheter "virtual touch" technique which can capture heart shape measurement during operation in a much faster and more accurate way than conventional manual collection method. Our system can use 4D model and points which captures the heart shape change during one cardiac cycle for registration. To address non-rigid shape changes from breathing cycles and other sources, our system has a local non-rigid registration component to further correct the high resolution pre-operative shape model based on infra-operative realtime shape measurement from "virtual touch".
Contour Integration and Synchronization in Neuronal Networks of the Visual Cortex
Authors: Ekkehard Ullner, Raúl Vicente, Gordon Pipa, Jordi García-Ojalvo
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The visual perception of contours by the brain is selective. When embedded within a noisy background, closed contours are detected faster, and with higher certainty, than open contours. We investigate this phenomenon theoretically with the paradigmatic excitable FitzHugh-Nagumo model, by considering a set of locally coupled oscillators subject to local uncorrelated noise. Noise is needed to overcome the excitation threshold and evoke spikes. We model one-dimensional structures and consider the synchronization throughout them as a mechanism for contour perception, for various system sizes and local noise intensities. The model with a closed ring structure shows a significantly higher synchronization than the one with the open structure. Interestingly, the effect is most pronounced for intermediate system sizes and noise intensities.
Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
Authors: Ondřej Klíma, Libor Polák
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We present here new hierarchies of literal varieties of languages. Each language under consideration is a disjoint union of a certain collection of "basic" languages described here. Our classes of languages correspond to certain literal varieties of homomorphisms from free monoids onto nilpotent groups of class ≤ 2.
Progressive Solutions to FSM Equations
Authors: Khaled El-Fakih, Nina Yevtushenko
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

The equation solving problem is to derive the behavior of the unknown component X knowing the joint behavior of the other components (or the context) C and the specification of the overall system S. The component X can be derived by solving the Finite State Machine (FSM) equation C $\lozenge$ X ~ S, where $\lozenge$ is the parallel composition operator and ~ is the trace equivalence or the trace reduction relation. A solution X to an FSM equation is called progressive if for every external input sequence the composition C $\lozenge$ X does not fall into a livelock without an exit. In this paper, we formally define the notion of a progressive solution to a parallel FSM equation and present an algorithm that derives a largest progressive solution (if a progressive solution exists). In addition, we generalize the work to a system of FSM equations. Application examples are provided.
Variations in Access Control Logic
Authors: Martín Abadi
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

In this paper we investigate the design space of access control logics. Specifically, we consider several possible axioms for the common operator says. Some of the axioms come from modal logic and programming-language theory; others are suggested by ideas from security, such as delegation of authority and the Principle of Least Privilege. We compare these axioms and study their implications.
A Call to Action: Look Beyond the Horizon
Authors: Jeannette M. Wing
Venue: IEEE Security and Privacy (2003)

Today's attacks exploit code-level flaws such as buffer overruns and type-invalid input. Now we should turn to tomorrow's attacks, and think beyond buffer overruns, code levels, and the horizon. This article is a call to arms to the research community to look toward the future.
A Multi-stage Competitive Neural Networks Approach for Motion Trajectory Pattern Learning
Authors: Hejin Yuan, Yanning Zhang, Tao Zhou, Fang'An Deng, Xiuxiu Li, Huiling Lu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper puts forward a multi-stages competitive neural networks approach for motion trajectory pattern analysis and learning. In this method, the rival penalized competitive learning method, which could well overcome the competitive networks' problems of the selection of output neurons number and weight initialization, is used to discover the distribution of the flow vectors according to the trajectories' time orders. The experiments on different sites with CCD and infrared cameras demonstrate that our method is valid for motion trajectory pattern learning and can be used for anomaly detection in outdoor scenes.
Foveation image coding with fuzzy-based joint parameter selection
Authors: Wuttipong Kumwilaisak
Venue: Journal of Visual Communication and Image Representation (2008)

This paper presents a novel method of the foveation image coding based on the fuzzy-based joint parameter selection. Our objective is to maximize foveated wavelet image quality index (FWQI) of the reconstructed image. With the foveated visual sensitivity model, image regions are first prioritized. The image regions close to foveation points have higher priorities than those far away from the foveation points. The discrete wavelet transform (DWT) is utilized to transform the considering image to the wavelet domain. The wavelet coefficients from different image regions are weighted using the foveated visual sensitivity model and then scaled down before entropy encoding. To achieve the objective, we use a fuzzy logic system and an iterative search to select image coding parameters under the bit budget constraint. The coding parameters consist of a number of weighted wavelet coefficients in the list significant pixel (LSP) of the SPIHT codec [A. Said, W.A. Pearlman, A new, fast, and efficient image codec based on set partitioning in hierarchical trees, IEEE Trans. Circuits Syst. Video Technol. 6 (3) (1996) 243-250], represented as N"L"S"P, and a scaling down factor (QP). There are two inputs and one output in the proposed fuzzy logic system. The inputs are N"L"S"P and targeted bit per pixel used to encode an image. The output is an interval of QP. The QP value corresponding to the input N"L"S"P giving the highest FWQI is selected from the derived interval. We iteratively search for the values of N"L"S"P and QP providing the highest FWQI. Then, the SPIHT codec is used to generate a scalable bitstream of the discrete wavelet coefficients with the optimal pair of N"L"S"P and QP. The sub-optimal search algorithm to compute both N"L"S"P and QP with low complexity is also proposed. Our simulation results show that the proposed scheme provides a better reconstructed image quality comparing to previous work in both objective and subjective qualities.
Experiencing Audio and Music in a Fully Immersive Environment
Authors: Xavier Amatriain, Jorge Castellanos, Tobias Höllerer, Joann Kuchera-Morin, Stephen T. Pope, Graham Wakefield, Will Wolcott
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

The UCSB Allosphere is a 3-story-high spherical instrument in which virtual environments and performances can be experienced in full immersion. The space is now being equipped with high-resolution active stereo projectors, a 3D sound system with several hundred speakers, and with tracking and interaction mechanisms.The Allosphere is at the same time multimodal, multimedia, multi-user, immersive, and interactive. This novel and unique instrument will be used for research into scientific visualization/auralization and data exploration, and as a research environment for behavioral and cognitive scientists. It will also serve as a research and performance space for artists exploring new forms of art. In particular, the Allosphere has been carefully designed to allow for immersive music and aural applications.In this paper, we give an overview of the instrument, focusing on the audio subsystem. We give the rationale behind some of the design decisions and explain the different techniques employed in making the Allosphere a truly general-purpose immersive audiovisual lab and stage. Finally, we present first results and our experiences in developing and using the Allosphere in several prototype projects.
Beginning Python, 2 edition
Authors: Magnus Lie Hetland
Venue:  (2008)

Gain a fundamental understanding of Pythons syntax and features with the second edition of Beginning Python, an uptodate introduction and practical reference. Covering a wide array of Pythonrelated programming topics, including addressing language internals, database integration, network programming, and web services, youll be guided by sound development principles. Ten accompanying projects will ensure you can get your hands dirty in no time. Updated to reflect the latest in Python programming paradigms and several of the most crucial features found in the forthcoming Python 3.0 (otherwise known as Python 3000), advanced topics, such as extending Python and packaging/distributing Python applications, are also covered. What youll learn Become a proficient Python programmer by following along with a friendly, practical guide to the languages key features. Write code faster by learning how to take advantage of advanced features such as magic methods, exceptions, and abstraction. Gain insight into modern Python programming paradigms including testing, documentation, packaging, and distribution. Learn by following along with ten interesting projects, including a P2P filesharing application, chat client, video game, remote text editor, and more. Complete, downloadable code is provided for each project! Who is this book for? Programmers, novice and otherwise, seeking a comprehensive introduction to the Python programming language. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entrylevel job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together realworld projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory!
Study of nano-mechanical properties for thin porous films through instrumented indentation: SiO2 low dielectric constant films as an example
Authors: M. Herrmann, F. Richter, S. E. Schulz
Venue: Microelectronic Engineering (2008)

Much research has been focused on the mechanical properties of porous materials such as films of silica xerogels because of their potential for application to microelectronic interconnects. To accurately probe the film properties, one has to challenge with the porosity as well as the large differences between film and substrate properties. In this paper, a study is presented for the investigation of Young's modulus and yield stress of these porous films by instrumented indentation under complete consideration of the substrate influence by using the approach of the 'effectively shaped indenter concept'. This concept provides the basis of a more appropriate analysis for thin films in case of elastic-plastic contact situations as given for porous low-k films. It was found that the ratio of yield stress to Young's modulus, which equals the yield strain of the stress-strain curve, is not constant and changes with porosity.
Team Formation Strategies in a Dynamic Large-Scale Environment
Authors: Chris L. Jones, K. Suzanne Barber
Venue: Massively Multi-Agent Technology: AAMAS Workshops, MMAS 2006, LSMAS 2006, and CCMMS 2007 Hakodate, Japan, May 9, 2006 Honolulu, HI, USA, May 15, 2007 Selected and Revised Papers (2008)

In open markets and within business and government organizations, fully autonomous agents may form teams to work on large, multifaceted problems. Factors such as uncertain information, bounded rationality and environmental dynamicism can lead to sudden, unforeseen changes in both solution requirements and team participation. Accordingly, this paper proposes and examines strategies for team formation strategies in a large-scale, dynamic environment. Strategies control how agents select problems to work on and partners to work with. The paper includes an experimental evaluation of the relative utility of each strategy in an increasingly dynamic environment, and concludes that a strategy which combines greedy job selection with adaptive team selection performs best in highly dynamic environments. Alternatively, greedy job selection combined with selecting smaller teams performs best in environments with little to no dynamicism.
A Safe AODV (Ad Hoc On-Demand Distance Vector) Security Routing Protocol
Authors: Jin Taek Kim, Jeong-Ho Kho, Chang-Young Lee, Do-Won Lee, Cheol-Soo Bang, Geuk Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The field that is the key issue of wire, wireless environment is security and many routing protocols are studied also at the ad-hoc network. In the mobile ad-hoc network which has no fixed base structure, the weakest point is security. This paper analyzed AODV protocol, which is a routing protocol, the important routing protocol in ad-hoc network, so that it can overcome the problem in security threats. It used the lightest and fastest message authentication code, so was able to design rather safer AODV routing protocol.