ppxscal/embedding_network huggingface dataset:
Increasing the Output Length of Zero-Error Dispersers
Authors: Ariel Gabizon, Ronen Shaltiel
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

Let $\cal C$ be a class of probability distributions over a finite set ¿. A function is a disperser for $\cal C$ with entropy threshold k and error if for any distribution X in $\cal C$ such that X gives positive probability to at least 2 k elements we have that the distribution D(X) gives positive probability to at least elements. A long line of research is devoted to giving explicit (that is polynomial time computable) dispersers (and related objects called "extractors") for various classes of distributions while trying to maximize m as a function of k.In this paper we are interested in explicitly constructing zero-error dispersers (that is dispersers with error ). For several interesting classes of distributions there are explicit constructions in the literature of zero-error dispersers with "small" output length m and we give improved constructions that achieve "large" output length, namely m = ¿(k).We achieve this by developing a general technique to improve the output length of zero-error dispersers (namely, to transform a disperser with short output length into one with large output length). This strategy works for several classes of sources and is inspired by a transformation that improves the output length of extractors (which was given in [29] building on earlier work by [15]). Nevertheless, we stress that our techniques are different than those of [29] and in particular give non-trivial results in the errorless case.Using our approach we construct improved zero-error dispersers for the class of 2-sources. More precisely, we show that for any constant ¿> 0 there is a constant ¿> 0 such that for sufficiently large n there is a poly-time computable function such that for any two independent distributions X 1,X 2 over such that both of them support at least 2 ¿n elements we get that the output distribution D(X 1,X 2) has full support. This improves the output length of previous constructions by [2] and has applications in Ramsey Theory and in constructing certain data structures [13].We also use our techniques to give explicit constructions of zero-error dispersers for bit-fixing sources and affine sources over polynomially large fields. These constructions improve the best known explicit constructions due to [26,14] and achieve m = ¿(k) for bit-fixing sources and m = k ¿ o(k) for affine sources.
A Hybrid Generative-Discriminative Approach to Speaker Diarization
Authors: Athanasios K. Noulas, Tim Kasteren, Ben J. Kröse
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

In this paper we present a sound probabilistic approach to speaker diarization. We use a hybrid framework where a distribution over the number of speakers at each point of a multimodal stream is estimated with a discriminative model. The output of this process is used as input in a generative model that can adapt to a novel test set and perform high accuracy speaker diarization. We manage to deal efficiently with the less common, and therefore harder, segments like silence and multiple speaker parts in a principled probabilistic manner.
Design and Implementation of GIS-Based Logistic Information System
Authors: Jianhe Guan, Peiguang Lin
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

To improve the efficiency and high quality service of the logistic companies, a gis-based logistics information system is designed and implemented by this paper. Firstly, it analyzes the requirements of the logistics management information system established on the GIS platform. The system realizes the application service by the architecture of B/S (Browser/Server) structure. Then the database design, the module and function design about the system are discussed in the paper. This framework in the practical application has made impressive result, and was provided as an effective one.
A Fast Method to Segment the Liver According to Couinaud's Classification
Authors: Shao-Hui Huang, Bo-Liang Wang, Ming Cheng, Wei-Li Wu, Xiao-Yang Huang, Ying Ju
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

For establishing a plan of Living Donor Liver Transplantation (LDLT), it is very important to estimate the volume of each liver segment. Usually Couinaud's classification is used to segment a liver, which is based on the liver anatomy. However, it is not easy to perform this method in a 3D space directly. In this paper, a fast segment method based on the hepatic vessel tree was proposed. This method was composed of four main steps: vasculature segmentation, 3D thinning, vascular tree pruning and classification, and vascular projection and curve fitting. This method was validated by application to a 3D liver from CT data, and it was shown to approximate closely Couinaud's classification with high speed.
Finding Reliable Subgraphs from Large Probabilistic Graphs
Authors: Petteri Hintsanen, Hannu Toivonen
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Consider information search or discovery in a large graph of concepts and their weighted relationships. The user initiates a query by specifying some concepts ("search terms"), and wishes to obtain other concepts and relationships that connect the search concepts. An application example is in analysis of biological information, conveniently represented as a graph of biological concepts and their relations. A search engine we envision would allow a life scientist to query for connections between a gene and a phenotype, for instance, to find information supporting a hypothesis, or to help discover new hypothesis.
Cognitive and Emotional Interaction
Authors: Amel Achour, Jeanne Villaneau, Dominique Duhaut
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The ANR project EmotiRob aims at conceiving and realizing a companion robot which interacts emotionally with fragile children. However, the project MAPH which is an extension of EmotiRob tries to extend the cognitive abilities of the robot to implement a linguistic interaction with the child. For this, we studied a children corpus and got semantic links that could exist between each pair of words. This corpus elaborated by D. Bassano has been used to evaluate language development among children under five. Using this corpus, we tried to make a taxonomy in accordance with the conceptual world of children and tested its validity. Using the taxonomy and the semantic properties that we attributed to the corpus words, we defined rapprochement coefficients between words in order to generate new sentences, answer the child questions and play with him. As a perspective for this, we envisage to make the robot able of enriching its vocabulary, and to define new learning patterns basing on its reactions.
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Authors: Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Peng
Venue: Computer Vision and Image Understanding (2008)

Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology priors as global constraints. We show that the optimization of the energy function we consider here is NP-hard. However, our algorithm is guaranteed to find an approximate solution that conforms to the initialization, which is a desirable property in many applications since the globally optimum solution does not consider any initialization information. The key innovation of our algorithm is the organization of the search for maximum flow in a way that allows consideration of topology constraints. In order to achieve this, we introduce a label attribute for each node to explicitly handle the topology constraints, and we use a distance map to keep track of those nodes that are closest to the boundary. We employ the bucket priority queue data structure that records nodes of equal distance and we efficiently extract the node with minimal distance value. Our methodology of embedding distance functions in a graph-based algorithm is general and can also account for other geometric priors. Experimental results show that our algorithm can efficiently handle segmentation cases that are challenging for graph-cut algorithms. Furthermore, our algorithm is a natural choice for problems with rich topology priors such as object tracking.
Explicit Dependence Metadata in an Active Visual Effects Library
Authors: Jay L. Cornwall, Paul H. Kelly, Phil Parsonage, Bruno Nicoletti
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

Developers need to be able to write code using high-level, reusable black-box components. Also essential is confidence that code can be mapped to an efficient implementation on the available hardware, with robust high performance. In this paper we present a prototype component library being developed to deliver this for industrial visual effects applications. Components are based on abstract algorithmic skeletons that provide metadata characterizing data accesses and dependence constraints. Metadata is combined at run-time to build a polytope representation which supports aggressive inter-component loop fusion. We present results for a wavelet-transform-based degraining filter running on multicore PC hardware, demonstrating 3.4x---5.3x speed-ups, improved parallel efficiency and a 30% reduction in memory consumption without compromising the program structure.
A Probabilistic Method to Estimate Life Expectancy of Application Software
Authors: Shengzhong Yuan, Hong He
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

The security of network applications is more important in Internet days. A kind of randomized protocol to find out application software security bug is raised. We discuss the security testing method with randomized protocol; put forward an attack-proof theorem which shows a way of computing average number of attack times easily with a Weibull probability map before a software system having concealed bugs becomes invalid. It is also proved a fairly good method to estimate life expectancy of application software on Internet under various random attacks.
Operational Semantics of Ada Ravenscar
Authors: Irfan Hamid, Elie Najm
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

The Ada programming language has been designed from the ground up for safety-critical real-time systems. This trend has continued with the Ada 2005 language definition which has incorporated the Ravenscar Profile for high-integrity systems into the language standard. Here we describe the operational semantics for Ada Ravenscar code generated automatically from an architecture description of the system given in the Architecture Analysis and Design Language.
Comparing methods for estimating the Jacobian in visual servoing
Authors: Philipp Roebrock
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

This paper discusses different methods for estimating the Jacobian matrix in visual servoing, the calculation via inversion of the Feature Jacobian and the direct calculation by solving a linear system. It places special focus on the usage of sensor signal sources with different noise ratio.
Cryptanalysis of Achterbahn-128/80 with a New Keystream Limitation
Authors: María Naya-Plasencia
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

This paper presents two key-recovery attacks against the modification of Achterbahn-128/80 proposed by the authors at SASC 2007 due to the previous attacks. The 80-bit variant, Achterbahn-80, was limited to produce at most 252 bits of keystream with the same pair of key and IV, while Achterbahn-128 was limited to 256 bits. The attack against Achterbahn-80 has complexity 264.85 and needs fewer than 252 bits of keystream, and the one against Achterbahn-128 has complexity 2104 and needs fewer than 256 keystream bits. These attacks are based on the previous ones. The attack against Achterbahn-80 uses a new idea which allows us to reduce the required keystream length.
Application of Tree Growing up Algorithm to Protein Secondary Structure Estimation
Authors: Seda Arslan Tuncer, Ali Karci
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

In order to solve NP-type problems, a lot of methods have been developed by exploiting the properties of systems in the nature. Genetic Algorithms, Ant Colony Optimization, Artificial Neural Networks, Artificial Immune Systems, etc. are this-type algorithms. In this study, tree growing up algorithm inspired by growing up of trees was used to estimate the secondary structure of proteins. Proteins 1bbe, 1a89 and 1a9a were selected for experimental applications and obtained results illustrates the superiority of the applied method, since it obtained success of 99% based on the real-valued problems.
Estimating Reliability of Conditional Promises
Authors: Alva L. Couch, Hengky Susanto, Marc Chiarini
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Using conditional promises, the reliability of promises can be measured without reference to the reliability of the issuing agent, by defining notions of when conditions operate and when promises are expected to be fulfilled. This inspires an analytical method that attributes promise failures to incomplete knowledge rather than agent unreliability. This analysis allows agents to choose between conditional offers of service based upon statistical measures of the completeness of stated conditions.
Development of Interactive Map-Based Tour Information System for Busan
Authors: Y. Batu Salman, Kyong-Hee Lee, Yoonjung Kim, Hong-In Cheng, Hyunjeong Kim
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

The Internet is the most efficient modern media providing the tourists with the information for organizing many traveling activities. It is time consuming and difficult work to organize transportation, accommodation, restaurants, adventures etc. for effective and memorable trip. Although there are many tourist sites containing a great amount of information, it is not easy to find proper and tailored information satisfying various tourists. In this study, a development process to build the web-based tour information system for Busan, Korea, and the final prototype was introduced. Current tour information websites and online maps were inspected first for the information, contents, services, and functions provided on the web sites. The user study was conducted by employing six participants to investigate the users' preferences and needs. Design principles and final contents were determined based on the user requirements analysis. A design prototype for the map-based interactive tourist information system was finally developed and suggested.
Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Authors: Xinxin Fan, Guang Gong, David Jao
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

Pairings on the Jacobians of (hyper-)elliptic curves have received considerable attention not only as a tool to attack curve based cryptosystems but also as a building block for constructing cryptographic schemes with new and novel properties. Motivated by the work of Scott, we investigate how to use efficiently computable automorphisms to speed up pairing computations on two families of non-supersingular genus 2 hyperelliptic curves over prime fields. Our findings lead to new variants of Miller's algorithm in which the length of the main loop can be up to 4 times shorter than that of the original Miller's algorithm in the best case. We also implement the calculation of the Tate pairing on both a supersingular and a non-supersingular genus 2 curve with the same embedding degree of k = 4. Combining the new algorithm with known optimization techniques, we show that pairing computations on non-supersingular genus 2 curves over prime fields use up to 55.8% fewer field operations and run about 10% faster than supersingular genus 2 curves for the same security level.
Security and Privacy in Sensor Networks
Authors: Haowen Chan, Adrian Perrig
Venue: Computer (2003)

Sensor networks offer economically viable solutions for a variety of applications. For example, current implementations monitor factory instrumentation, pollution levels, free-way traffic, and the structural integrity of buildings. Other applications include climate sensing and control in office buildings and home environmental sensing systems for temperature, light, moisture, and motion.
Tetrahedral mesh generation with good dihedral angles using point lattices
Authors: Jonathan Shewchuk
Venue:  (2007)

Three-dimensional meshes are frequently used to perform physical simulations in science and engineering. This involves decomposing a domain into a mesh of small elements, usually tetrahedra or hexahedra. The elements must be of good quality; in particular there should be no plane or dihedral angle close to 0 or 180 degrees. Automatically creating such meshes for complicated domains is a challenging problem, especially guaranteeing good dihedral angles, a goal that has eluded researchers for nearly two decades. By using point lattices, notably the body centered cubic lattice, we develop two tetrahedral mesh generation algorithms that, for the first time, come with meaningful guarantees on the quality of the elements. For domains bounded by an isosurface, we generate a tetrahedral mesh whose dihedral angles are bounded between 10.7 and 164.8 degrees, or (with a change in parameters) between 8.9 and 158.8 degrees. The algorithm is numerically robust and easy to implement because it generates tetrahedra from a small set of precomputed stencils. The algorithm is so fast that it can be invoked at each time step of a simulation, possibly in real time for small meshes. The tetrahedra are uniformly sized on the boundary, but in the interior it is possible to make them progressively larger. This combination of features makes the algorithm well suited for dynamic fluid simulation. If the isosurface is a smooth 2-manifold with bounded curvature, and the tetrahedra are sufficiently small, then the boundary of the mesh is guaranteed to be a geometrically and topologically accurate approximation of the isosurface. For polyhedral domains, Delaunay refinement is a common mesh generation technique that produces guaranteed-quality tetrahedra with one exception: sliver-shaped tetrahedra that can have dihedral angles arbitrarily close to 0 and 180 degrees. We show how slivers away from the boundary can be avoided by inserting lattice points while maintaining the Delaunay property of the mesh. It is possible to control the size of tetrahedra, this time both in the interior and on the boundary, and a user may input a set of points which must be vertices of the output mesh. The resulting dihedral angles are guaranteed to be between 30 and 135 degrees, except near the boundary. Most angle bounds are obtained by recursive bisection of the space of possible tetrahedron configurations together with interval arithmetic. They are guaranteed by computer-assisted proofs.
How to Measure Agile Software Development
Authors: Martin Kunz, Reiner R. Dumke, Andreas Schmietendorf
Venue: Software Process and Product Measurement: International Conference, IWSM-Mensura 2007, Palma de Mallorca, Spain, November 5-8, 2007. Revised Papers (2007)

Agile Software Development Methods are nowadays wide spread and accepted. From the Software Measurement point-of-view not all metrics and methods from conventional lifecycle models can be used without adoption. Therefore this paper describes distinct metrics and their implementation into a measurement tool for quality management in agile software development. Taking a closer look to agile methods we observe that some of metrics and the tool itself can be used for measurement in traditional software development as well.
Enhancing Comprehension of Ontologies and Conceptual Models Through Abstractions
Authors: C. Maria Keet
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In addition to the Database Comprehension Problem, where diagrammatic conceptual data models are too large for a modeller or domain expert to comprehend or manage, an Ontology Comprehension Problem is emerging. Formal ontologies are, however, more amenable to automated abstractions to improve understandability. Three ways of abstraction are defined with 11 abstraction functions that use foundational ontology categories. Usability of the abstraction functions is enhanced by associating the functions with a basic framework of levels and abstraction hierarchy, thereby facilitating querying and visualizing ontologies.
RMOST: A Shared Memory Model for Online Steering
Authors: Daniel Lorenz, Peter Buchholz, Christian Uebing, Wolfgang Walkowiak, Roland Wismüller
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Online steering means to visualize the current state of an application which includes application data and/or performance data, and to modify data in the application. Thus, in online steering the application as well as the steering tool must concurrently access and modify the same data at run time. In this paper a new model for online steering is presented which models the mechanism of online steering as access to a distributed shared memory. The integrity requirements of the steered application are analyzed. The integrity can be ensured through an appropriate consistency model. Finally, the online steering system RMOST is presented which is based on the distributed shared memory model and can be used to steer Grid jobs from the High Energy Physics experiment ATLAS.
The Authoring Tool of ADULT: Adaptive Understanding and Learning Text Environment
Authors: Alexandra Gasparinatou, Grammatiki Tsaganou, Maria Grigoriadou
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Previous research in the domain of text comprehension in Informatics has demonstrated that readers with little knowledge in this domain benefit from a coherent text, whereas high-knowledge readers benefit from a minimally coherent text. With respect to educational applications, these findings suggest constructing several versions of a text in order to adapt to varying levels of knowledge among readers. In this paper we present the design of the authoring tool of the learning environment ADULT (Adaptive Understanding and Learning from Texts), capable of supporting authors while constructing texts of different coherence in the domain of Informatics, accompanied by questions or tasks designed to access students' comprehension on line. This way students will be activated to use their background knowledge while reading and more students will have the opportunity to achieve better learning results in learning from Informatics texts than reading a single textbook in Informatics targeted at an average reader.