ppxscal/embedding_network huggingface dataset:
Combining Tests and Proofs
Authors: Madhu Gopinathan, Aditya Nori, Sriram Rajamani
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

Proof methods (or static analysis) and test methods (or dynamic analysis) have complementary strengths. While static analysis has the potential to obtain high coverage, it typically suffers from imprecision (and imprecision is needed to scale the analysis to large programs). While dynamic analysis has the potential to be very precise, it typically suffers from poor coverage.
Beginning Google Web Toolkit: From Novice to Professional, 1 edition
Authors: Bram Smeets, Uri Boness, Roald Bankras
Venue:  (2008)

The open source, lightweight Google Web Toolkit (GWT) is a framework that allows Java developers to build Rich Internet Applications (RIA), more recently called Ajax applications, in Java. Typically, writing these applications requires a lot of JavaScript development. However, Java and JavaScript are very distinctively different languages (although the name suggests otherwise), therefore requiring a different development process. In Beginning Google Web Toolkit: From Novice to Professional, youll learn to build rich, userfriendly web applications using a popular Javabased Ajax web framework, the Google Web Toolkit. The authors will guide you through the complete development of a GWT front end application with a nononsense, downtoearth approach. Youll start with the first steps of working with GWT and learn to understand the concepts and consequences of building this kind of application. During the course of the book, all the key aspects of GWT are tackled pragmatically, as youre using them to build a realworld sample application. Unlike many other books, the inner workings of GWT and other unnecessary details are shelved, so you can focus on the stuff that really matters when developing GWT applications. What youll learn Get a solid foundation to develop RIAs. Understand the basics of the GWT Framework and its components. Fit GWT into your applications life cycle and development process. Develop rich web frontend GUIs using widgets, composite widgets, panels, and much more. Integrate with Spring, RPC, and various other data formats. Reinforce principles learned throughout the book by working through a realworld sample application created with GWT from scratch. Who is this book for? Beginning Google Web Toolkit: From Novice to Professional is written for Java developers of all levels who want to start building Rich Internet Applications. The book assumes no prior knowledge of developing Ajax applications and/or working with JavaScript. 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!
Empowering Software Maintainers with Semantic Web Technologies
Authors: René Witte, Yonggang Zhang, Jürgen Rilling
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Software maintainers routinely have to deal with a multitude of artifacts, like source code or documents, which often end up disconnected, due to their different representations and the size and complexity of legacy systems. One of the main challenges in software maintenance is to establish and maintain the semantic connections among all the different artifacts. In this paper, we show how Semantic Web technologies can deliver a unified representation to explore, query and reason about a multitude of software artifacts. A novel feature is the automatic integration of two important types of software maintenance artifacts, source code and documents, by populating their corresponding sub-ontologies through code analysis and text mining. We demonstrate how the resulting "Software Semantic Web" can support typical maintenance tasks through ontology queries and Description Logic reasoning, such as security analysis, architectural evolution, and traceability recovery between code and documents.
A Software Tool for Accurate Estimation of Parameters of Heterogeneous Communication Models
Authors: Alexey Lastovetsky, Vladimir Rychkov, Maureen O'Flynn
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Analytical communication performance models play an important role in prediction of the execution time of parallel applications on computational clusters, especially on heterogeneous ones. Accurate estimation of the parameters of the models designed for heterogeneous clusters is a particularly challenging task due to the large number of parameters. In this paper, we present a set of communication experiments that allows us to get the accurate estimation of the parameters with minimal total execution time, and software that implements this solution. The experiments on heterogeneous cluster demonstrate the accuracy and efficiency of the proposed solution.
Novel LMI Criteria for Stability of Neural Networks with Distributed Delays
Authors: Qiankun Song, Jianting Zhou
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, the global asymptotic and exponential stability are investigated for a class of neural networks with distributed time-varying delays. By using appropriate Lyapunov-Krasovskii functional and linear matrix inequality (LMI) technique, two delay-dependent sufficient conditions in LMIs form are obtained to guarantee the global asymptotic and exponential stability of the addressed neural networks. The proposed stability criteria do not require the monotonicity of the activation functions and the differentiability of the distributed time-varying delays, which means that the results generalize and further improve those in the earlier publications. An example is given to show the effectiveness of the obtained condition.
Creation and maintenance of a communication tree in wireless sensor networks
Authors: Duncan M. Walker
Venue:  (2007)

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree structure connecting sensor nodes to the base station (sink or root) is dynamically reconfigured during information dissemination. Unlike other location based routing approaches, INP does not take any support from a high costing system that gives position information such as GPS. For reconfigurations, INP uses only local relational information in the tree structure among nearby nodes by collaboration between the nodes that does not need global maintenance, so that INP is energy efficient and it scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme (SWR) that uses a global metric and the modified GRAdient broadcast scheme (GRAB-F) that uses interleaving multiple paths by computation and by simulations. The comparisons demonstrate that using local relative information is mostly enough for reconfigurations, and it consumes less energy and mostly better delivery rates than other algorithms especially in dense environments. For the control observer to know the network health status, two new diagnosis algorithms (Repre and Local) that deal with crash faults for wireless sensor networks are also introduced in the dissertation. The control observer knows not only the static faults found by periodic testing but also the dynamic faults found by a path reconfiguration algorithm like INP that is invoked from evidence during information dissemination. With based on this information, the control observer properly treats the network without lateness. Local algorithm is introduced for providing scalability to reduce communication energy consumption when the network size grows. The performance of these algorithms is computationally compared with other crash faults identification algorithm (WSNDiag). The comparisons demonstrate that maintaining the communication tree with local reconfigurations in Repre and Local needs less energy than making a tree per each diagnosis procedure in WSNDiag. They also demonstrate that providing scalability in Local needs less energy than other approaches.
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
Authors: Zhao Zhang, Xiaofeng Gao, Weili Wu
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

Connected Vertex Cover Problem (CVC) is an $\mathcal NP$-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial Time Approximation Scheme for CVC in Unit Disk Graph.
Typing Linear Constraints for Moding CLP(${\cal R}$) Programs
Authors: Salvatore Ruggieri, Fred Mesnard
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

We present a type system for linear constraints over reals and its use in mode analysis of CLP programs. The type system is designed to reason about the properties of definiteness, lower and upper bounds of variables of a linear constraint. Two proof procedures are presented for checking validity of type assertions. The first one considers lower and upper bound types, and it relies on solving homogeneous linear programming problems. The second procedure, which deals with definiteness as well, relies on computing the Minkowski's form of a parameterized polyhedron. The two procedures are sound and complete. We extend the approach to deal with strict inequalities and disequalities. Type assertions are at the basis of moding constraint logic programs. We extend the notion of well-moding from pure logic programming to CLP(${\cal R}$).
A Research of Enhanced Web-Based USIM System Using by ActiveX
Authors: Cheul-Jun Hwang, Se-Woon Oh, Min-Soo Jung
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

USIM is the most popular user certification system on 3G mobile communication system. For this reason, USIM is installed inside of Mobile Equipments or user certification system. USIM card user gives more convenience services when they use mobile phone application service. USIM’s main purposes are user certification and sensitive data (healthcare information, user PIN number, electronic cash, etc.) store. USIM is an Open platform structures so more convenient application and contents can be present. However if someone wants a USIM card setup and post-issuance process, they must know USIM card specification and detailed techniques. This is very complex and time consuming job. In this paper, we propose a web-based USIM access system. Web browser is a popular client system. It supports user friendly interfaces and various download application programs. We will propose a new type interface system using by ActiveX control for USIM.
The SKM Algorithm: A K-Means Algorithm for Clustering Sequential Data
Authors: José G. Dias, Maria João Cortinhal
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

This paper introduces a new algorithm for clustering sequential data. The SKM algorithm is a K-Means-type algorithm suited for identifying groups of objects with similar trajectories and dynamics. We provide a simulation study to show the good properties of the SKM algorithm. Moreover, a real application to website users' search patterns shows its usefulness in identifying groups with heterogeneous behavior. We identify two distinct clusters with different styles of website search.
Secure Media Distribution Scheme Based on Chaotic Neural Network
Authors: Shiguo Lian, Zhongxuan Liu, Zhen Ren, Haila Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

A secure media distribution scheme is proposed in this paper, which distributes different copy of media content to different customer in a secure manner. At the sender side, media content is encrypted with a chaotic neural network based cipher under the control of a secret key. At the receiver side, the encrypted media content is decrypted with the same cipher under the control of both a secret key and the customer information. Thus, the decrypted media copy containing customer information is slightly different from the original one. The difference can be detected and used to trace media content's illegal distribution. The scheme's performances, including security, imperceptibility and robustness, are analyzed and tested. It is shown that the scheme is suitable for secure media distribution.
Overlapping Clustered Graphs: Co-authorship Networks Visualization
Authors: Rodrigo Santamaría, Roberto Therón
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

The analysis of scientific articles produced by different groups of authors helps to identify and characterize research groups and collaborations among them. Although this is a quite studied area, some issues, such as quick understanding of groups and visualization of large social networks still pose some interesting challenges. In order to contribute to this study, we present a solution based in Overlapper, a tool for the visualization of overlapping groups that makes use of an enhanced variation of force-directed graphs. For a real case study, the tool has been applied to articles in the DBLP database.
An X3D Approach to Neuro-Rehabilitation
Authors: Mauro Zampolini, Riccardo Magni, Osvaldo Gervasi
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

We present an application based on X3D technologies for the telerehabilitation of patients affected by neurological diseases. In particular the virtual world is designed to integrate the activity made on NU!Reha Desk product with the activities performed on the virtual world. The main target of our system are patients with heavy neurological disease (people not able to move a forced in static positions because of therapies, etc).The system is designed to allow the remote monitoring and assessment of the patient's activities by the staff at the hospital.
Thin sheet springback optimal assessment
Authors: I. C. Constantin, A. Epureanu, C. Maier, A. Albut, M. Banu, F. B. Marin
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

In thin sheet metalforming process, the main cause of dimensional errors is the springback. The errors level is very responsive to small variations of the blank features (such as thickness or mechanical properties) and of the process features (such as the friction between blank and the blank holder). The measurement procedure to be applied in order to check if thin sheet workpieces are complying with the dimensional accuracy requirements implies higher costs than the procedure to be applied to thick sheet workpieces. The present paper proposes a springback optimal assessment technique based on support vector machine classification in which the training data are obtained by Finite Element Method (FEM) simulations. The trained model is used with data obtained from a real thin sheet metalforming process for optimal dimensional assessment. The optimization criterion is the assessment performance and the restrictions considered are the online assessment, along with small number of measurements and fast assessment procedure. The simulation of proposed springback assessment technique confirmed its efficiency. Furthermore, in some conditions, the assessment may lead to predictive control.
Handwritten Character Distinction Method Inspired by Human Vision Mechanism
Authors: Jumpei Koyama, Masahiro Kato, Akira Hirose
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Human beings are capable of distinguishing a variety of texture almost at a glance. By modelling the mechanism, we will realize a flexible texture analysis. We propose a new technique inspired by such human early-vision ability to distinguish handwritten character regions from machine-printed regions in document images. In the technique, we evaluate the two-dimensional power spectrum to extract feature values that reflects fluctuations unavoidable in handwritten characters. Experiments show that a certain feature value of handwritten characters is often larger than that of machine-printed characters. We generated a map obtained by superimposing the feature value on the document image. The map showed that our proposed method is useful to distinguish handwritten character regions from machine-printed character ones.
A different approach to off-line handwritten signature verification using the optimal dynamic time warping algorithm
Authors: İnan Güler, Majid Meghdadi
Venue: Digital Signal Processing (2008)

In this paper, a method for the automatic handwritten signature verification (AHSV) is described. The method relies on global features that summarize different aspects of signature shape and dynamics of signature production. For designing the algorithm, we have tried to detect the signature without paying any attention to the thickness and size of it. The results have shown that the correctness of our algorithm detecting the signature is more acceptable. In this method, first the signature is pre-processed and the noise of sample signature is removed. Then, the signature is analyzed and specification of it is extracted and saved in a string for the comparison. At the end, using adapted version of the dynamic time warping algorithm, signature is classified as an original or a forgery one.
Infection, incest, and iniquity: Investigating the neural correlates of disgust and morality
Authors: Jana Schaich Borg, Debra Lieberman, Kent A. Kiehl
Venue: Journal of Cognitive Neuroscience (2008)

Disgust, an emotion related to avoiding harmful substances, has been linked to moral judgments in many behavioral studies. However, the fact that participants report feelings of disgust when thinking about feces and a heinous crime does not necessarily indicate that the same mechanisms mediate these reactions. Humans might instead have separate neural and physiological systems guiding aversive behaviors and judgments across different domains. The present interdisciplinary study used functional magnetic resonance imaging (n = 50) and behavioral assessment to investigate the biological homology of pathogen-related and moral disgust. We provide evidence that pathogen-related and sociomoral acts entrain many common as well as unique brain networks. We also investigated whether morality itself is composed of distinct neural and behavioral subdomains. We provide evidence that, despite their tendency to elicit similar ratings of moral wrongness, incestuous and nonsexual immoral acts entrain dramatically separate, while still overlapping, brain networks. These results (i) provide support for the view that the biological response of disgust is intimately tied to immorality, (ii) demonstrate that there are at least three separate domains of disgust, and (iii) suggest strongly that morality, like disgust, is not a unified psychological or neurological phenomenon.
Floating-point buffer compression in a unified codec architecture
Authors: Jacob Ström, Per Wennersten, Jim Rasmusson, Jon Hasselgren, Jacob Munkberg, Petrik Clarberg, Tomas Akenine-Möller
Venue: Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware (2008)

This paper presents what we believe are the first (public) algorithms for floating-point (fp) color and fp depth buffer compression. The depth codec is also available in an integer version. The codecs are harmonized, meaning that they share basic technology, making it easier to use the same hardware unit for both types of compression. We further suggest to use these codecs in a unified codec architecture, meaning that compression/decompression units previously only used for color-and depth buffer compression can be used also during texture accesses. Finally, we investigate the bandwidth implication of using this in a unified cache architecture. The proposed fp16 color buffer codec compresses data down to 40% of the original, and the fp16 depth codec allows compression down to 4.5 bpp, compared to 5.3 for the state-of-the-art int24 depth compression method. If used in a unified codec and cache architecture, bandwidth reductions of about 50% are possible, which is significant.
A Scalable Hybrid Multi-robot SLAM Method for Highly Detailed Maps
Authors: Max Pfingsthorn, Bayu Slamet, Arnoud Visser
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Recent successful SLAM methods employ hybrid map representations combining the strengths of topological maps and occupancy grids. Such representations often facilitate multi-agent mapping. In this paper, a successful SLAM method is presented, which is inspired by the manifold data structure by Howard et al. This method maintains a graph with sensor observations stored in vertices and pose differences including uncertainty information stored in edges. Through its graph structure, updates are local and can be efficiently communicated to peers. The graph links represent known traversable space, and facilitate tasks like path planning. We demonstrate that our SLAM method produces very detailed maps without sacrificing scalability. The presented method was used by the UvA Rescue Virtual Robots team, which won the Best Mapping Award in the RoboCup Rescue Virtual Robots competition in 2006.
Combinatorial dominance guarantees for problems with infeasible solutions
Authors: Daniel Berend, Steven S. Skiena, Yochai Twitto
Venue: ACM Transactions on Algorithms (TALG) (2008)

The design and analysis of approximation algorithms for NP-hard problems is perhaps the most active research area in the theory of combinatorial algorithms. In this article, we study the notion of a combinatorial dominance guarantee as a way for assessing the performance of a given approximation algorithm. An f(n) dominance bound is a guarantee that the heuristic always returns a solution not worse than at least f(n) solutions. We give tight analysis of many heuristics, and establish novel and interesting dominance guarantees even for certain inapproximable problems and heuristic search algorithms. For example, we show that the maximal matching heuristic of VERTEX COVER offers a combinatorial dominance guarantee of 2n &minus; (1.839 + o(1))n. We also give inapproximability results for most of the problems we discuss.