ppxscal/embedding_network huggingface dataset:
Correlation modeling of MLLR transform biases for rapid HMM adaptation to new speakers
Authors: E. Bocchieri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper concerns rapid adaptation of hidden Markov model (HMM) based speech recognizers to a new speaker, when only few speech samples (one minute or less) are available from the new speaker. A widely used family of adaptation algorithms defines adaptation as a linearly constrained reestimation of the HMM Gaussians. With few speech data, tight constraints must be introduced, by reducing the number of linear transforms and by specifying certain transform structures (e.g. block diagonal). We hypothesize that under these adaptation conditions, the residual errors of the adapted Gaussian parameters can be represented and corrected by dependency models, as estimated from a training corpus. Thus, after introducing a particular class of linear transforms, we develop correlation models of the transform parameters. In rapid adaptation experiments on the Switchboard corpus, the proposed algorithm performs better than the transform-constrained adaptation and the adaptation by correlation modeling of the HMM parameters, respectively.
Managing distributions from the software vendor's perspective
Authors: James E. J. Bottomley, Paul Clements
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

This paper describes one vendor's quest for a simple distribution model for a software product which will install on (almost) any Linux distribution. The focus of this paper will primarily be minimising the vendor production and support costs and secondly improving the product's install-ability from the customer perspective. The goal will be to describe a method which achieves a significant lowering of the development costs associated with deploying on multiple flavours of Linux.
SNEO: Proposal of a Platform for Network Game Using Overlay Network
Authors: Yoichi Nakamura, Hiroki Saito, Shin Ito, Yoshito Tobe
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Recently, many online games have been developed by improvement of network technology in consumer game machines and portable game machines. Typical network game architecture is based on clientserver model and Hybrid-P2P model. Because of heavy resource needs in servers, it is not easy to develop network games in game providers. We propose a platform based on overlay network which does not need the server for the online game, and develop a common platform in online game. This platform's name is SNEO (non Server Network game Environment by using Overlay network) .Game provides can share the common platform in various games. Game providers become possible to produce games without considering about the load of networks and servers. In this paper, it proposes the outline of our platform, and the opponent matching protocol which becomes essence in online games.
On traffic analysis attacks and countermeasures
Authors: Wei Zhao, Riccardo Bettati
Venue:  (2005)

Security and privacy have gained more and more attention with the rapid growth and public acceptance of the Internet as a means of communication and information dissemination. Security and privacy of a computing or network system may be compromised by a variety of well-crafted attacks. In this dissertation, we address issues related to security and privacy in computer network systems. Specifically, we model and analyze a special group of network attacks, known as traffic analysis attacks, and develop and evaluate their countermeasures. Traffic analysis attacks aim to derive critical information by analyzing traffic over a network. We focus our study on two classes of traffic analysis attacks: link-load analysis attacks and flow-connectivity analysis attacks. Our research has made the following conclusions: (1) We have found that an adversary may effectively discover link load by passively analyzing selected statistics of packet inter-arrival times of traffic flows on a network link. This is true even if some commonly used countermeasures (e.g., link padding) have been deployed. We proposed an alternative effective countermeasure to counter this passive traffic analysis attack. Our extensive experimental results indicated this to be an effective approach. (2) Our newly proposed countermeasure may not be effective against active traffic analysis attacks, which an adversary may also use to discover the link load. We developed methodologies in countering these kinds of active attacks. (3) To detect the connectivity of a flow, an adversary may embed a recognizable pattern of marks into traffic flows by interference. We have proposed new countermeasures based on the digital filtering technology. Experimental results have demonstrated the effectiveness of our method. From our research, it is obvious that traffic analysis attacks present a serious challenge to the design of a secured computer network system. It is the objective of this study to develop robust but cost-effective solutions to counter link-load analysis attacks and flow-connectivity analysis attacks. It is our belief that our methodology can provide a solid foundation for studying the entire spectrum of traffic analysis attacks and their countermeasures.
Towards Model-Checking Quantum Security Protocols
Authors: P. Baltazar, R. Chadha, P. Mateus, A. Sernadas
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

Logics for reasoning about quantum states have been given in the literature. Ln this paper, we extend one such logic with temporal constructs mimicking the standard computational tree logic used to reason about classical transition systems. We investigate the model-checking problem for this temporal quantum logic and illustrate its use by reasoning about the BB84 key distribution protocol.
Switch or Struggle: Risk Assessment for Late Integration of COTS Components
Authors: Soren Blom, Matthias Book, Volker Gruhn, Ralf Laue
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The domain requirements of software projects often seem so specialized to developers that their original design does not incorporate any commercial-off-the-shelf (COTS) components. However, if major implementation problems are encountered at a later stage in the project, the integration of a COTS component that promises to solve those problems may become a desirable alternative to struggling on with the original implementation. While a number of methods and criteria have already been proposed for requirements engineering, risk assessment and candidate selection of COTS components, they were developed for application in the initial phases of a project and thus do not take into account the much tighter time and design constraints imposed in a later project stage. To spark discussion on necessary adaptations of the established methods, this position paper uses the example of a concrete project to illustrate the characteristics of "switch or struggle" situations and proposes an initial set of risk factors to be considered at that time.
A deterministic dynamic associative memory (ddam) model for concept space representation
Authors: Stefan Valerian Pantazi
Venue:  (2006)

This dissertation aims at the general goal of solving the problem of representing and processing information on conceptual principles, in an unsupervised, human-like manner, and using existing computational methods. Given this very general context, the need for intelligent applications that meet the complexity and sensitivity requirements of Medical Informatics is postulated in what is referred to as "the axiom of medical information systems." The reformulation of the axiom that "medical information systems must be, at the same time, usable and useful" leads naturally to the identification of more immediate, achievable objectives in the form of context dependent information processing and case-based reasoning research on memory models capable of unsupervised representation and processing of information, in a similarity-based manner. Further, the unification of these objectives is proposed in the form of the general problem of managing associative concept representation spaces characterized by four fundamental properties: high dimensionality, sparseness, dynamicity and similarity based organization. The thesis of this dissertation is that the solution to this problem can be approached in the most appropriate way by memory models that specifically address each and every one of the four fundamental properties. The support for the thesis is twofold and comprises theoretical accounts which lead naturally to the definition of a memory model, the deterministic dynamic associative memory model (DDAM) which is based on the existing mathematical structure of partial order set. The model is first introduced informally by means of examples and depictions that speak for its usability. Further the formal description of the DDAM model and learning algorithms is achieved using existing fundamental concepts of set theory and combinatorics. Finally, the DDAM model is evaluated and compared with existing approaches in a series of experiments and simulations that demonstrate usefulness comparable or superior to existing approaches.
Design and characterisation of a low-power micromachined spatial light modulator
Authors: G. McRobbie, Zaikang Ling, F. Clark
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The MEMS spatial modulator proposed in this paper consists of a silicon element coated with a gold reflective layer. The silicon element is supported in the centre of a silicon nitride membrane and a platinum heater is used to control the temperature of the silicon and gold films. Increasing the temperature of the materials encompassed by the heater induces distortions analogous to those produced by heating a bimetallic beam fixed at both ends. To investigate these distortions, a 3-dimensional model of the membrane and the overlay components was constructed with ANSYS finite element software. Analysis of the results generated showed that a half-wavelength phase shift was obtainable with power consumptions less than 10 mW.
Segmentation of Evolving Complex Data and Generation of Models
Authors: Corrado Loglisci, Margherita Berardi
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The problem of time-series segmentation has been widely discussed and it has been successfully applied in a variety of areas including computational genomics, telecommunications and process monitoring. Nevertheless not many techniques have been devised to deal with multidimensional evolving data describing complex objects. Moreover, in many applications the resulting segments have not a description understandable to the user, and this is exacerbated in the applications with complex data. Our contribute aims to propose an algorithmic framework to segment multidimensional evolving data or multidimensional time-series and to resort to an ILP system to generate characterizations of segments close to the user. The application and the results to the realworld data are reported.
On solution strategies to Saint-Venant problem
Authors: Walter Lacarbonara, Achille Paolone
Venue: Journal of Computational and Applied Mathematics (2007)

Different solution strategies to the relaxed Saint-Venant problem are presented and comparatively discussed from a mechanical and computational point of view. Three approaches are considered; namely, the displacement approach, the mixed approach, and the modified potential stress approach. The different solution strategies lead to the formulation of two-dimensional Neumann and Dirichlet boundary-value problems. Several solution strategies are discussed in general, namely, the series approach, the reformulation of the boundary-value problems for the Laplace's equations as integral boundary equations, and the finite-element approach. In particular, the signatures of the finite-element weak solutions-the computational costs, the convergence, the accuracy-are discussed considering elastic cylinders whose cross sections are represented by piece-wise smooth domains.
Increasing Participation in Distance Learning Courses
Authors: Jeffrey S. Saltz, Starr Roxanne Hiltz, Murray Turoff, Katia Passerini
Venue: IEEE Internet Computing (2007)

The Integrated Participation Evaluation Tool (iPET) is a Web-based application combining social-network analysis and visualization to enable distance learning instructors and students to improve their participation in online discourse and so improve their overall learning experience. An analysis of the results obtained in a study using iPET in a distance learning context shows that iPET increases participation and motivation in distance learning courses without increasing facilitator workload.
A Hierarchical Radiosity Method with Scene Distribution
Authors: E. J. Padron, M. Amor, M. Boo, R. Doallo
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Nowadays, one of the most active areas of research in computer graphics is focussed on improving the performance of global illumination methods. In this paper we present a new parallel method for hierarchical radiosity computation. Contrary to usual solutions in the literature our approach carries out an effective partitioning and distribution of the input geometry among the processors. Thus, the memory constraint is reduced when processing large scenes. The method presented in this paper also introduces a multi-thread scheduling to improve interaction between processors. This solution replaces the polling strategy usually used in parallel computing, when several independent tasks need to establish asynchronous communication. The great flexibility of our parallel implementation has been demonstrated by the good results achieved on a testbed with different computing systems and test scenes.
Communication Study and Implementation Analysis of Parallel Asynchronous Iterative Algorithms on Message Passing Architectures
Authors: D. El Baz
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The implementation of parallel asynchronous iterative algorithms on message passing architectures is considered. Several issues related to communication via message passing interfaces or libraries such as MPI-1, MPI-2, PVM or SHMEM are discussed in this survey paper. Practical implementations are proposed.
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Authors: Alberto Ciaffaglione, Luigi Liquori, Marino Miculan
Venue: Journal of Automated Reasoning (2007)

We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli's object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Inductive Constructions, by taking advantage of natural deduction semantics and coinduction in combination with weak higher-order abstract syntax and the Theory of Contexts. Our methodology allows us to implement smoothly the calculi in the target metalanguage; moreover, it suggests novel presentations of the calculi themselves. In detail, we present a compact formalization of the syntax and semantics for the functional and the imperative variants of the ¿-calculus. Our approach simplifies the proof of subject deduction theorems, which are proved formally in the proof assistant Coq with a relatively small overhead.
Analyzing information-enabled stockout management under vendor-managed inventory
Authors: Yuliang Yao, Yan Dong, Martin E. Dresner
Venue: Information Technology and Management (2007)

We develop a mechanism under vendor-managed inventory (VMI) by which a manufacturer provides an incentive contract to a retailer to convert lost sales stockouts into backorders. An incentive contract is required since the retailer's efforts are not directly observable. We first show that when there are no limits on order quantities or inventory levels imposed on the manufacturer, the manufacturer will push inventory onto the retailer. The manufacturer minimizes the possibility for lost sales stockouts by maintaining high inventory levels at the retailer rather than by paying incentives to the retailer. However, modern information systems (IS), such as radio frequency identification (RFID), allow the retailer to monitor inventory at its premises and to enforce limits on order quantities. With strict limits on order quantities, the manufacturer will provide incentives to the retailer to convert lost sales stockouts to backorders. We analyze the conditions under which these incentive payments are likely to be highest.
A Tool for the Expression of Failure Detection Protocols
Authors: Vincenzo De Florio, Chris Blondia
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Failure detection protocols an important building block of fault-tolerant distributed systems are often described by their authors making use of informal pseudocodes of their own devising. Often these pseudo-codes use syntactical constructs that are not available in COTS programming languages such as C or C++. This translates into informal descriptions that require ad hoc interpretations and implementations. Being informal, these descriptions cannot be tested by their authors, which may translate into insufficiently detailed or even faulty specifications. Being non-standard, they require the reader to understand each time a different lingo. This paper tackles the above problem introducing a formal syntax for the expression of failure detection protocols and a C library that implements that syntax: a toolset to express and reason about failure detection protocols. The resulting specifications are more diffuse but non ambiguous and eligible for becoming a standard form among researchers and practitioners.
Founding of the Chinese Academy of Sciences' Institute of Computing Technology
Authors: Zhang Jiuchun, Zhang Baichun
Venue: IEEE Annals of the History of Computing (2007)

Computer science originated in the People's Republic of China in 1956 with the founding of the Chinese Academy of Sciences. Institute of Computing Technology. The Soviet Union, which played a pivotal role, gave the Chinese the opportunity to learn computer science by supplying components and describing the manufacturing process. The Soviets also helped solve key difficulties and trained workers.
Yield strength of thin-film parylene-c
Authors: Ashok Sharma, T. A. Harder, Yu-Chong Tai
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

For the first time, the yield strength of thin-film parylene-c is measured from membrane load-deflection experiments and surface profile analysis. To do so, the onset pressure which causes plastic deformation of the membrane is first experimentally measured. Then a new 2-step displacement model, together with the energy minimization technique, is developed to convert the onset pressure to the yield strength on the pre-stressed parylene membrane under a uniform pressure loading. The results depict a Yield Strength of 59 MPa (or 0.012 of strain) for thin-film parylene-c in comparison to 55 MPa reported by parylene vendor (measured from large samples). To double check with the result, the balloon model is further used to compare with the stress value from our model at the center of parylene membranes and good agreements are obtained.
Facilitating learning design with software-realized scaffolding for collaboration
Authors: M. Guzdial, D. Carlson, J. Turns
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

A critical aspect of much of engineering is design. Design is most frequently a collaborative activity today, while collaboration is rarely taught in traditional engineering education. We are developing educational technologies to facilitate both doing and leaning about collaboration in engineering design activities. Our software environment, CaMILE (Collaborative and Multimedia Interactive Learning Environment), provides a structure for doing collaborative engineering design that facilitates integrating diverse media and other resources. In addition, CaMILE structures the way students collaborate. The importance of juxtaposing both learning and doing is one of the lessons leaned from our experience. By integrating collaboration with artifacts central to the design activity, we can motivate collaboration and facilitate learning.
Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks
Authors: Athanasios Kinalis, Sotiris Nikoletseas
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Data propagation in wireless sensor networks is usually performed as a multihop process. To deliver a single mes- sage, the resources of many sensor nodes are used and a lot of energy is spent. Recently, a novel approach is catching momentum because of important applications; that of hav- ing a mobile sink move inside the network area and collect the data with low energy cost. Here we extend this line of research by proposing and evaluating three new protocols. Our protocols are novel in a) investigating the impact of having many mobile sinks b) in weak models with restricted mobility, proposing and evaluating a mix of static and mo- bile sinks and c) proposing a distributed protocol that tends to equally spread the sinks in the network to further improve performance. Our protocols are simple, based on random- ization and assume locally obtainable information. We per- form an extensive evaluation via simulation; our findings demonstrate that our solutions scale very well with respect to the number of sinks and significantly reduce energy con- sumption and delivery delay.
Ontology Engineering to Model Clinical Pathways: Towards the Computerization and Execution of Clinical Pathways
Authors: Katrina F. Hurley, Syed Sibte Raza Abidi
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Clinical pathways translate evidence-based recommendations into locally practicable, process-specific algorithms that reduce practice variations and optimize quality of care. Our objective was to abstract practice-oriented knowledge from a cohort of real clinical pathways and represent this knowledge as a clinical pathway ontology. We employed a four step methodology: (1) knowledge source identification and classification of clinical pathways according to variations in setting, stage of care, patient type, outcome and specialty; (2) iterative knowledge abstraction using grounded theory; (3) ontology engineering as adapted from the Model-based Incremental Knowledge Engineering approach; and, (4) ontology evaluation through encoding a sample of real clinical pathways. We present our Clinical Pathway Ontology that offers a detailed ontological model describing the structure and function of clinical pathways. Our ontology can potentially integrate with a healthcare semantic web, and ontologies for clinical practice guidelines, patients and institutions to form the foundational knowledge for generating patient-specific CarePlans.