ppxscal/embedding_network huggingface dataset:
Forensic Automatic Speaker Classification in the "Coming Paradigm Shift"
Authors: Joaquin Gonzalez-Rodriguez, Daniel Ramos
Venue: Speaker Classification I: Fundamentals, Features, and Methods (2007)

A new paradigm for forensic science has been encouraged in the last years, motivated by the recently reopened debate about the infallibility of some classical forensic disciplines and the controversy about the admissibility of evidence in courts. Standardization of procedures, proficiency testing, transparency in the scientific evaluation of the evidence and testability of the system and protocols are emphasized in order to guarantee the scientific objectivity of the procedures. In this chapter those ideas and their relationship to automatic forensic speaker classification will be analyzed in order to define where automatic speaker classification is and which direction should it take under this context. Following the DNA methodology, which is being regarded as the scientific "golden" standard for evidence evaluation, the Bayesian approach has been proposed as a scientific and logical methodology. Likelihood ratios (LR) are computed based on the similarity-typicality pair, which facilitates the transparency in the process. The speaker classification is performed by the fact finder, who defines the possible hypotheses involved in the classification process. Thus, the prior probability of the hypotheses and the LR computed by the forensic system are used to assign a class to each suspected speaker depending on the defined hypotheses. The definition of this hypotheses typically refer to the speaker identity, thus leading to a speaker recognition task, but they can be defined in a more general context of speaker classification. The concept of calibration as a way of reporting reliable and accurate opinions is also addressed. Application-independent evaluation techniques (C llr and APE curves) are addressed as a proper way for presenting results of proficiency testing in courts, as these evaluation metrics clearly show the influence of calibration errors in the accuracy of the inferential decision process. In order to illustrate the effects of calibration, we conclude with new experimental examples used as blind proficiency test following the NIST SRE 2006 evaluation protocol.
Customizing the Branch Predictor to Reduce Complexity and Energy Consumption
Authors: Michael C. Huang, Daniel Chaver, Luis Pinuel, Manuel Prieto, Francisco Tirado
Venue: IEEE Micro (2003)

To exploit instruction-level parallelism, high-end processors use branch predictors consisting of many large, often underutilized structures that cause unnecessary energy waste and high power consumption. By adapting the branch target buffer's size and dynamically disabling a hybrid predictor's components, the authors create a customized branch predictor that saves a significant amount of energy with little performance degradation.
Tracking sub-page components in document workflows
Authors: James A. Ollis, Steven R. Bagley, David F. Brailsford
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Documents go through numerous transformations and intermediate formats as they are processed, in a workflow, from abstract markup into final printable form. Unfortunately, it is common to find that ideas about document components, which might exist in the source code for the document, become completely lost within an amorphous, unstructured, page of PDF prior to being rendered. Given the importance of a component-based approach in Variable Data Printing (VDP) we have developed a collection of tools that allow information about the various transformations to be embedded at each stage in the workflow, together with a visualization tool that uses this embedded information to display the relationships between the various intermediate documents. We demonstrate these tools in the context of an example workflow using DocBook markup but the techniques described are widely applicable and would be easily adaptable to other workflows and for use in teaching tools to illustrate document component and VDP concepts.
Network P2P for exploring and visualization of proteomic data produced by two dimensional electrophoresis
Authors: Gregorio Mercurio, Silvio Maglio, Antonella Agrusti, Giorgio DeNunzio, Rosella Cataldo, Ivan DeMitri, Marco Favetta, Andrea Massafra, Giovanni Marsella, Daniele Vergara, Michele Maffia
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Our working group has started a project aiming at the development of analysis algorithms devoted to images produced by two-dimensional electrophoresis (2-DE) for general applications in the field of proteomics. General analysis problems have been addressed, with the ultimate goal of the maximization of the "automation level" of the analysis procedure, without reducing the accuracy now reachable only with manual intervention. For this purpose, the working group is analyzing 2-DE images that a real ready stored or that will be produced by means of the instrumentation and the know-how of the biologists participating to the project. It's obvious that the "key" for the project success is primarily the availability of many images produced by different groups, but especially their "comparability", and their significant "clinical contextualization". For these reasons, the group has started the implementation of federation of heterogeneous biobanks of images founded on open Registry/Repository for P2P architecture (ebXML RR)[1], on images stored with standard metadata for their comparability (EFMI MIP) [2], and on standard electronic documents for their clinical contextualization (HL7 CDA) [3]. This paper summarizes the concepts of the initiative, describes its current state and presents an overview of related work.
Semantics and Knowledge Grids: Building the Next-Generation Grid
Authors: Mario Cannataro, Domenico Talia
Venue: IEEE Intelligent Systems (2004)

Evolving grid resources, tools, and applications offer a means of dealing intelligently with enormous quantities of data. The authors survey the field and propose a software architecture that integrates semantic modeling and knowledge discovery with grid technologies.
Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications
Authors: Marc Mouffron
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

To implement efficiently and securely good non-linear functions with a very large number of input variables is a challenge. Partially symmetric functions such as transitive functions are investigated to solve this issue. Known results on Boolean symmetric functions are extended both to transitive functions and to q-ary functions (on any set of q elements including finite fields GF(q) for any q). In a special case when the number of variables is n = p k with p prime, an extension of Lucas' theorem provides new counting results and gives useful properties on the set of transitive functions. Results on balanced transitive q-ary functions are given. Implementation solutions are suggested based on q-ary multiple-valued decision diagrams and examples show simple implementations for these kind of symmetric functions. Applications include ciphers design and hash functions design but also search for improved covering radius of codes.
On the digital tangent bundle and some extensions
Authors: Fabien Feschet, Alexandre Faure
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Following the continuous notion of the tangent bundle of a manifold, we provide in this paper a digital counterpart. We recall a linear time algorithm for its construction. Moreover due to the finite nature of this construction, we provide a mapping onto the class of circular arc graphs. Hence, our construction can be extended to other constructions similar to the tangent bundle, providing a family of bundles. We also provide some applications of these constructions for polygonal decomposition and multi-scale analysis. In the paper, we also give a way to extend this construction to an arbitrary dimension.
Human-Likeness in Utterance Generation: Effects of Variability
Authors: Anna Hjalmarsson, Jens Edlund
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

There are compelling reasons to endow dialogue systems with human-like conversational abilities, which require modelling of aspects of human behaviour. This paper examines the value of using human behaviour as a target for system behaviour through a study making use of a simulation method. Two versions of system behaviour are compared: a replica of a human speaker's behaviour and a constrained version with less variability. The version based on human behaviour is rated more human-like, polite and intelligent.
Methods for Decreasing Time and Effort during Development and Maintenance of Intellectual Software User Interfaces
Authors: Valeriya Gribova
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Methods for automated development and maintenance of intellectual software user interfaces are proposed. They rest on an ontology-based approach and are intended for decreasing effort and time for user interface development and maintenance. The principal conception of the approach, user interface project components, and methods for automated development of the project as well as a comparison of the methods and their analogues are presented.
Where Is the Proof? - A Review of Experiences from Applying MDE in Industry
Authors: Parastoo Mohagheghi, Vegard Dehlen
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

Model-Driven Engineering (MDE) has been promoted as a solution to handle the complexity of software development by raising the abstraction level and automating labor-intensive and error-prone tasks. However, few efforts have been made at collecting evidence to evaluate its benefits and limitations, which is the subject of this review. We searched several publication channels in the period 2000 to June 2007 for empirical studies on applying MDE in industry, which produced 25 papers for the review. Our findings include industry motivations for investigating MDE and the different domains it has been applied to. In most cases the maturity of third-party tool environments is still perceived as unsatisfactory for large-scale industrial adoption. We found reports of improvements in software quality and of both productivity gains and losses, but these reports were mainly from small-scale studies. There are a few reports on advantages of applying MDE in larger projects, however, more empirical studies and detailed data are needed to strengthen the evidence. We conclude that there is too little evidence to allow generalization of the results at this stage.
Structured Document Retrieval, Multimedia Retrieval, and Entity Ranking Using PF/Tijah
Authors: Theodora Tsikrika, Pavel Serdyukov, Henning Rode, Thijs Westerveld, Robin Aly, Djoerd Hiemstra, Arjen P. Vries
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

CWI and University of Twente used PF/Tijah, a flexible XML retrieval system, to evaluate structured document retrieval, multimedia retrieval, and entity ranking tasks in the context of INEX 2007. For the retrieval of textual and multimedia elements in the Wikipedia data, we investigated various length priors and found that biasing towards longer elements than the ones retrieved by our language modelling approach can be useful. For retrieving images in isolation, we found that their associated text is a very good source of evidence in the Wikipedia collection. For the entity ranking task, we used random walks to model multi-step relevance propagation from the articles describing entities to all related entities and further, and obtained promising results.
Social networks, collaboration and groupware software for the scientific research process in the web 2.0 world
Authors: Serena Pastore
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The web is evolving into machine-centric and user-centric perspectives. We are seeing tools and platforms to facilitate user collaboration and sharing collected under the term "web 2.0" and influencing all types of communities. The scientific community, especially, benefits from such platforms, since it can be involved in constant data sharing and discussion while research is in progress rather then much later when the work is finished. This paper discusses the requirements of a web collaboration software platform designed to assist in the scientific research process; it could be used by mediators to communicate with individuals about specific research areas, or to assist groups of people working on a project. Depending on the users' requirements, there is often debate about the choice of platform which provides the best software solution. Such solutions could be available as a package to be installed on a server, or could be provided as a set of web services provided by major internet companies like Google or Yahoo. The paper shows two examples, one for each category, and discusses the contexts in which they are used by a research institute's individuals. It also outlines technology trends in application development, which is shifting to rich internet applications available from the desktop.
Building Surface Refinement Using Cluster of Repeated Local Features by Cross Ratio
Authors: Hoang-Hon Trinh, Dae-Nyeon Kim, Kang-Hyun Jo
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This paper describes an approach to recognize building surfaces. A building image is analyzed to extract the natural characters such as the surfaces and their areas, vanishing points, wall region and a list of SIFT feature vectors. These characters are organized as a hierarchical system of features to describe a model of building and then stored in a database. Given a new image, the characters are computed in the same form with in database. Then the new image is compared against the database to choose the best candidate. A cross ratio based algorithm, a novel approach, is used to verify the correct match. Finally, the correct match is used to update the model of building. The experiments show that the approach method clearly decreases the size of database, obtains high recognition rate. Furthermore, the problem of multiple buildings can be solved by separately analyzing each surface of building.
Observing Outdoor Activity Using Global Positioning System-Enabled Cell Phones
Authors: Yvonne Michael, Erin M. Mcgregor, James Allen, Stephen Fickas
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

Global positioning system (GPS) technology offers a methodological advance over existing methods of assessing exposure to social and built environments in health studies. The usefulness of GPS-enabled cell phones with open-source software to track users in real-life situations was assessed by carrying phones through three standardized loops in Portland, Oregon. Overall, the cell phones recorded position in 62.8% of tests. Position acquisition varied by the environment in which the cell phone was carried, highest in open areas (83.5%) and lowest under cover (37.5%). The ability of the cell phones to track varied by mode of transportation. Tracking performance was adequate when moving by car (46.6%) or on foot (29.9%), but low on public transportation (3.8%). The GPS-enabled cell phone system showed adequate reliability under typical study conditions to track outdoor activity. Systems built on consumer electronics offer inexpensive and reliable technology for clinical/epidemiological location-based studies.
Efficient constraint dynamics using MILC SHAKE
Authors: A. G. Bailey, C. P. Lowe, A. P. Sutton
Venue: Journal of Computational Physics (2008)

We address the problem of imposing rigid constraints between connected sites in a dynamic computer simulation. For two important cases, the linear and ring topologies, each site is connected to at most two nearest neighbors. The constraint matrix is then invertible in order n operations. We show that, this being the case, a computational method based on a matrix inversion of the linearized constraint equations (MILC SHAKE) can be orders of magnitude faster than the simple SHAKE or RATTLE methods.
Multi-rate Relaying for Performance Improvement in IEEE 802.11 WLANs
Authors: Laura Marie Feeney, Bilge Cetin, Daniel Hollos, Martin Kubisch, Seble Mengesha, Holger Karl
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

It is well known that the presence of nodes using a low data transmit rate has a disproportionate impact on the performance of an IEEE 802.11 WLAN. ORP is an opportunistic relay protocol that allows nodes to increase their effective transmit rate by replacing a low data rate transmission with a two-hop sequence of shorter range, higher data rate transmissions, using an intermediate node as a relay. ORP differs from existing protocols in discovering relays experimentally, by optimistically making frames available for relaying. Relays identify themselves as suitable relays by forwarding these frames. This approach has several advantages compared with previously proposed relay protocols: Most importantly, ORP does not rely on observations of received signal strength to infer the availability of relay nodes and transmit rates. We present analytic and simulation results showing that ORP improves the throughput by up to 40% in a saturated IEEE 802.11b network.
NeC4.5: Neural Ensemble Based C4.5
Authors: Zhi-Hua Zhou
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Decision tree is with good comprehensibility while neural network ensemble is with strong generalization ability. In this paper, these merits are integrated into a novel decision tree algorithm NeC4.5. This algorithm trains a neural network ensemble at first. Then, the trained ensemble is employed to generate a new training set through replacing the desired class labels of the original training examples with those output from the trained ensemble. Some extra training examples are also generated from the trained ensemble and added to the new training set. Finally, a C4.5 decision tree is grown from the new training set. Since its learning results are decision trees, the comprehensibility of NeC4.5 is better than that of neural network ensemble. Moreover, experiments show that the generalization ability of NeC4.5 decision trees can be better than that of C4.5 decision trees.
n-LDA: n-Layers Data Aggregation in Sensor Networks
Authors: Ioana Rodhe, Christian Rohner
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

We present a protocol for secure data aggregation in wireless sensor networks that offers end-to-end data confidentiality by using homomorphic functions and interleaved encryption. Hop-by-hop aggregation in sensor networks is an efficient way to save energy. Node compromises in hostile environments require protocols for data aggregation where the intermediate nodes contribute with their own values to the aggregated data without getting access to it. Homomorphic encryption schemes allow aggregation on ciphertext and thus can provide end-to-end data confidentiality. We propose a layered data aggregation protocol which ensures that, in the presence of less than n captured nodes, an attacker cannot get access to any aggregated data from the network. When more than n nodes are captured, the attacker can only get access to the aggregated values received by the captured nodes. Our protocol is resilient to node failure and no pre-built tree for data aggregation is needed.
Incremental Learning and Its Application to Bushing Condition Monitoring
Authors: Christina B. Vilakazi, Tshilidzi Marwala
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The problem of fault diagnosis of electrical machine has been an ongoing research in power systems. Many machine learning tools have been applied to this problem using static machine learning structures such as neural network, support vector machine that are unable to accommodate new information as it becomes available into their existing models. This paper presents a new method to bushing fault condition monitoring using fuzzy ARTMAP(FAM). FAM is introduced for bushing condition monitoring because it has the ability to incrementally learn information as it becomes available. An ensemble of classifiers is used to improve the classification accuracy of the systems. The testing results show that FAM ensemble gave an accuracy of 98.5%. Furthermore, the results show that fuzzy ARTMAP can update its knowledge in an incremental fashion without forgetting previously learned information.
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
Authors: Bishnu Bhattacharyya, Frank Dehne
Venue: Information Processing Letters (2008)

The length-constrained heaviest path (LCHP) in a weighted tree T, where each edge is assigned a weight and a length, is the path P in T with maximum total path weight and total path length bounded by a given value B. This paper presents an O(nlogn) time LCHP algorithm which utilizes a data structure constructed from the spine decomposition of the input tree. This is an improvement over the existing algorithm by Wu et al. (1999), which runs in O(nlog^2n) time. Our method also improves on a previous O(nlogn) time algorithm by Kim (2005) for the special case of finding a longest nonnegative path in a constant degree tree in that we can handle trees of arbitrary degree within the same time bounds.
Colouring Random Empire Trees
Authors: Andrew R. Mcgrae, Michele Zito
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We first notice that 2r colours are necessary and sufficient to solve the problem in the worst-case. Then we define the notion of a random r-empire tree and, applying a method for enumerating spanning trees in a particular class of graphs, we find exact and asymptotic expressions for all central moments of the number of (balanced) s-colourings of such graphs. Such result in turns enables us to prove that, for each r ¿ 1, there exists a positive integer s r < r such that, for large n, almost all n country r-empire trees need more than s r colours, and then to give lower bounds on the proportion of such maps that are colourable with s > s r colours.