ppxscal/embedding_network huggingface dataset:
A New On-Line Robust Approach to Design Noise Immune Speech Recognition Systems
Authors: F. Vargas, R. D. Fagundes, D. Barros Jr.
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We summarize hereafter a new approach * dealing to couple with the harmful effects of noise on speech recognition systems (SRS). This approach is oriented to hardware redundancy andit is essentially a modification of the classic software-based recovery blocks scheme. When compared to conventional approaches using Fast Fourier Transform (FFT) and Hamming Code, the primary benefit of such a technique is to improve system performance when operating in real (i.e., noisy) environments. The second advantage is related to the considerably low complexity and reduced area overhead required for implementation. We implemented a fully version of the proposed algorithm using the C language. The goal of thisimplementation is twofold: first, it is used in this paper to illustrate the effectiveness of the proposed ideas and enrich further discussions. Second, it will be used in a near future as asystem single-source code specification that will be partitioned and implemented according to a HW-SW codesign methodology we have proposed in previous works.
Enabling conversations with web services
Authors: L. Ardissono, A. Goy, G. Petrone
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The emerging standards for the publication of Web Services enable the invocation of services having simple interaction protocols, but they fail to support complex e-business interactions, where the peers exchange several messages. In order to extend the classes of services which can be invoked by the consumers, we propose a conversational model supporting the management of complex interactions between clients and Web Services. Our model supports the consumer in the management of a conversation which respects the business logic of the service without imposing the explicit management of the conversational context.
Principal Manifolds and Bayesian Subspaces for Visual Recognition
Authors: Baback Moghaddam
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We investigate the use of linear and nonlinear principal manifolds for learning low-dimensional representations for visual recognition. Three techniques: Principal Component Analysis (PCA), Independent Component Analysis (ICA) and Nonlinear PCA (NLPCA) are examined and tested in a visual recognition experiment using a large gallery of facial images from the "FERET" database. We compare the recognition performance of a nearest-neighbor matching rule with each principal manifold representation to that of a maximum a posteriori (MAP) matching rule using a Bayesian similarity measure derived from probabilistic subspaces and demonstrate the superiority of the latter.
Alison Balter's Mastering Access 2002 Enterprise Development
Authors: Alison Balter
Venue:  (2002)

:Many books address desktop development with Access 2002. Few Access books handle client/server and other enterprise issues. This book picks up where Alison Balter's Mastering Access 2002 Desktop Development leaves off. In this book, you'll learn Access's role in the client/server model. This book covers both how you create client/server applications in Microsoft Access and how you set up and manage the SQL Server whose data your application utilizes. In addition to the client/server topics covered, you will also learn how Access and SQL Server can participate in intranet and Internet applications. You'll learn not only how to publish Access and SQL Server data to the Web, but also how to build data access pages (Access forms viewed in a browser). Finally, you'll learn how Access and SQL Server participate in the exciting world of XML.
A Dynamic Scheduling Benchmark: Design, Implementation and Performance Evaluation
Authors: Babak Hamidzadeh, Ng Siu Kee
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Games, such as Chess, Eight Queens, and Tiles Puzzle, have traditionally been used as popular benchmarks for evaluating different problem solving strategies. Such benchmarks usually impose specific constraints that are considered important for a technique to address and to solve. These specific problems and constraints facilitate a fair and tangible comparison of different techniques. Many of the game benchmarks (e.g. Eight Queens and Tiles Puzzle) are suitable for evaluating static scheduling techniques. In such benchmarks, the scheduling phase and the execution phase (i.e. when the schedule is executed to play the game) are disjoint. The scheduling technique can be executed to compute a complete schedule prior to the execution of any moves to play the game. Due to recent interests in on-line problem solving techniques, there is a need for benchmarks which can evaluate the performance trade-offs of dynamic scheduling techniques. Many modern video and computer games can be suitable candidates for dynamic scheduling benchmarks, since they require on-line problem solving. These benchmarks and their system testbeds should be chosen and implemented such that they can accurately reveal important performance trade-offs of dynamic scheduling techniques. In this paper, we introduce a dynamic scheduling benchmark and its system testbed. This benchmark is based on an extended version of the Tetris computer game. The rules and semantics of the game were modified to lend themselves well to evaluation of discrete problem solving and optimization techniques. The system testbed is implemented in a distributed and asynchronous fashion, on a network of workstations, to reveal performance trade-offs between scheduling time, schedule quality, and problem constraints. We provide the results of a set of experiments which evaluate the benchmark and its system, and which evaluate the performance trade-offs of a set of scheduling techniques under different benchmarks constraints.
ADMIT-1 : Automatic Differentiation and MATLAB Interface Toolbox
Authors: Thomas F. Coleman, Arun Verma
Venue:  (1998)

ADMIT-1 enables you to compute {\em sparse} Jacobian and Hessian matrices, using automatic differentiation technology, from a MATLAB environment. You need only supply a function to be differentiated and ADMIT-1 will exploit sparsity if present to yield sparse derivative matrices (in sparse MATLAB form). A generic AD tool, subject to some functionality requirements, can be plugged into ADMIT-1; examples include ADOL-C ~\cite{Griewank1996b} (C/C++ target functions) and ADMAT ~\cite{admat} (MATLAB target functions). ADMIT-1 also allows for the calculation of gradients and has several other related functions.
A Distributed Programming Platform using Mobile Agents
Authors: Djamel H. Sadok, Judith Kelner, R. A. Silva
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Current distributed computing is based on rigid paradigms such as client server computing, that lack run-time adaptive behaviour. The designer of such systems has to consider all possibilities during the design stage and the services that are offered remain constant until a new re-design is done.Although there have been attempts to provide different programming languages that consider programming both distributed and non distributed applications the same, the two remain however different. New paradigms are needed that consider factors such as dynamic adaptability, interaction, ability to monitor and react to the environment, mobility, network latency, partial failure and concurrency. In this work, we show that the agent based programming paradigm, agentware, is closer to fulfilling some of these requirements and describe the proposed Agentware Virtual Machine (AVM), a generic distributed agent-based computing environment.With the emergence of intelligent agent-based technology, a number of distributed applications are being re-engineered taking advantage of this new design methodology.
Implementing Replicated State Machines Over Partitionable Networks
Authors: Roy Friedman, Alexey Vaysburd
Venue:  (1996)

This paper presents an implementation of a replicated state machine in asynchronous distributed environments prone to node failures and network partitions. This implementation has two appealing properties: It allows minority partitions to continue providing service for idempotent requests, and it guarantees that progress will be made whenever a majority of replicas can communicate with each other.
The WristCam as Input Device
Authors: Andrew Vardy, John Robinson, Li-Te Cheng
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We show how images of a user's hand from a video camera attached to the underside of the wrist can be processed to yield finger movement information. Discrete (and discreet) movements of the fingers away from a rest position are translated into a small set of base symbols. These are interpreted as input to a wearable computer, providing unobtrusive control.
On Trace Generation of Parallel Programs
Authors: Mark Holliday, S C Ellis
Venue:  (1990)

For given input, the global trace generated by a parallel program in a distributed shared memory environment may change as the environment changes. Consequently, if trace-driven simulation is used, care must be taken to adjust the trace to reflect the reference pattern that would result from program execution in the new environment. We propose an algorithm that generates a correct global trace for different environments
Reducing Cognitive Overheads in a Web Warehouse Using Reverse-Osmosis
Authors: Sourav S. Bhowmick, Wee Keong Ng, Ee-Peng Lim, Sanjay Madria
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

This paper provides a quantitative analysis of reducing cognitive overheads in a web warehouse using an important class of operation called reverse osmosis. The analysis is used to examine two different cognitive overheads of locating relevant nodes or information and display time of a web table. A reverse-osmosis operation enables us to eliminate irrelevant information from a collection of web documents stored in the form of a web table. We call such operation reverse-osmosis because it is analogous to the reverse osmosis process in the field of water purification. We discuss formal algorithm of reverse-osmosis operation.
Stability and Adaptability of Autonomous Decentralized Flow Control in High-Speed Networks
Authors: Chisa Takano, Masaki Aida
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

This paper focuses on flow control in high-speed networks. Each node in a network handles its local traffic flow only on the basis of the information it is aware of, but it is preferable that the decision-making of each node leads to high performance of the whole network. To this end, we investigate the relationship between the flow control mechanism of each node and network performance. We consider the situation in which the capacity of a link in the networkis changed but individual nodes are not aware of this. Then we investigate the stability and adaptability of the network performance when the capacity of a link is changed, and discuss an appropriate flow control model on the basis of simulation results.
OctMesh - Interactive Mesh Browsing over the Internet
Authors: Hongwu Wang, Jin Li
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper proposes OctMesh, an interactive mesh-browsing scheme over the Internet. In OctMesh, a large-scale mesh is encoded into one bit-stream, which is organized with respect to spatial locality and resolution. When the mesh is viewed over the Internet, by examining the user's viewpoint, the compressed mesh with desired locality and resolution is streamed to the client. OctMesh enables large-scale mesh to be viewed quickly over the Internet.
On Program Transformations
Authors: Sofoklis G. Efremidis
Venue:  (1994)

In understanding complex algorithms, the notions of encapsulation and modularization have played a key role. An algorithm is broken into several parts or modules, and understanding of each part is independent of others. In addition, each part contains details that are not needed by other parts and so can be hidden from them. Programming languages provide support for encapsulation and modularization in many different forms. Early programming languages provided the procedure and function as a means for modularization. Later, files were introduced as a means of modularizing programs. More sophisticated mechanisms were then introduced, like modules, packages, structures, and classes. In all these cases, the interface to a module remained the procedure or function call. Programs that use such modules contain calls to functions and procedures for communicating with a module. Ideally, using the operations that are provided by a module should be done in exactly the same way as using operations that are provided by modules should be easy to intermix. In addition, substituting one module for another that has the same functionality but different implementation should involve a minimal amount of effort. Recently, a new programming language, Polya, has been designed, which attempts to support modularization and at the same time incorporate the operations that are provided by the modules in the programming language itself. This is done by a sophisticated type-definition facility and a mechanism for transforming programs at the source-program level. This thesis studies mechanisms for program transformation at the source program level, in the context of Polya. Program transformation is based on a set of transformation rules that prescribe how a part of a program is to be transformed, and a set of directives that prescribe which program variables are to be transformed. We first give an algorithm for processing program transformations as described by the transform construct. The algorithm constructs a coordinate transformation of an abstract program based on a set of transforms and transform directives for transforming program variables. We then study the problem of transforming expressions that have compound types. Both the type constructor and the component expressions of the original expression may be transformed. No extra rules need be added to the bodies of transforms that transform the type constructor and the component expressions. In the sequel we investigate the problem of transforming procedures and functions that have parameters that need to be transformed. Finally, the problem of transforming program-transformation rules is studied. The program transformation techniques are applied to two well-known algorithms. The algorithms are source programs, which are subsequently transformed to programs of conventional programming languages, and then compiled and run.
Configuring Citrix Metaframe XP for Windows, Including Feature Release 1
Authors: Chris Broomes, Ralph Jj. Crump, Elias N. Khnaser
Venue:  (2002)

:Citrix MetaFrame XP is designed for scalable server farms. It is capable of load balancing user sessions across multiple servers while providing redundancy, security, and ease-of-administration. This revision of the best-selling first edition is the one Citrix MetaFrame XP book you need to plan, design, test, install, configure, and manage your Citrix server. Author Biographies: Melissa Craft (CCNA, MCNE, MCSE, Network+, CNE-3, CNE-4, CNE-GW, CNE-5, CCA) is the Vice President and CIO for Dane Holdings, Inc., a financial services corporation in Phoenix, AZ, where she manages Web development, and the LAN and WAN for the company. Ralph &ldquo;JJ&rdquo; Crump (CCNP/CCDP, Citrix CCEA, MCSE, MCNE, Cisco Security Specialist, and Compaq ASE) is a Senior Consulting Engineer for an advanced solutions consulting firm in Atlanta, GA. Craig Luchtefeld (MCSE, MCP+I, CCEA, CCNA) is a Senior Network Engineer for STL Technology Partners, a leading information technology systems provider in the Central Illinois region. Chris Broomes (MCSE, MCT, MCP+I, CCNA) is a Senior Network Analyst at Devon IT, a leading enterprise service provider specializing in voice and data network design, security, and VPN solutions based in King of Prussia, PA. Chris co-authored Hack Proofing Your Web Applications (Syngress Publishing, ISBN: 1-928994-31-8). Connie Wilson (CAN, MSCE, CCA) is a Senior Network Engineer with GE Capital in a designated &ldquo;Center of Excellence&rdquo; technology site. Elias N. Khnaser (CCEA, MCSE, CCNA, CCA, MCP + I) is currently the Citrix Network Engineer for General Growth Properties and is a contributing author at Techrepublic.com. Thomas Eck (MCSE+I, MCSD, MCDBA, CCA, ASE, CNA, GCA) isa Senior Specialist with Perot Systems Corporation&rsquo;s Financial Services Industry Group. Thomas also writes for Windows & .NET Magazine&rsquo;s Solutions journals.
DP Matching Using Kalman Filter as Pre-Processing in On-Line Signature Verification
Authors: Masahiro Tanaka, Yumi Ishino, Hironori Shimada, Takashi Inoue
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper proposes the point-wise matching method which is to be used as the pre-processing in on-line signature verification using only the positional information. After this pre-processing, various dynamical or local features of the signature can be used in verification. The test signature and the model one are to be matched point-wise by applyingtime-variant linear transformation. Kalman filter and the smoother are used for estimating the time-variant transformation parameters. Numerical experiment shows quite a good performance for real on-line signatures.
Hybrid fuzzy proportional-integral plus conventional derivative control of robotics systems
Authors: Meng Joo Er, Ya Lei Sun
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter presents a new approach towards optimal design of a hybrid fuzzy proportional-integral-derivative (PID) controller for robotics systems using genetic algorithm (GA). The proposed hybrid fuzzy PID controller is derived by replacing the conventional PI controller by a two-input normalized linear fuzzy logic controller and implementing the Conventional D controller in an incremental form. The salient features of the proposed controller are: (1) Gain scheduling method is incorporated in the design to linearize the robotics system for a given reference trajectory. (2) Only one well-defined linear fuzzy control space is required for multiple local linearized systems. (3) The linearly defined fuzzy logic controller can generate sector bounded nonlinear outputs so that the closed-loop system is stable and has better performance. (4) Optimal tuning of controller gains is carried out by using GA. (5) It is simple and easy to implement. Simulation studies on a pole balancing robot and a multi-link robot manipulator demonstrate the effectiveness and robustness of the proposed controller. Comprehensive comparisons with other latest approaches show that the proposed approach is superior in terms of tracking performance and robustness.
PPD: A practical parallel loop detector for parallelizing compilers
Authors: Cheng-Tien Wu, Chao-Tung Yang, Shian-Shyong Tseng
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

It is well known that extracting parallel loops plays a significant role in designing parallelizing compilers. The execution efficiency of a loop is enhanced when the loop can be executed in parallel or partial parallel, like a DOALL or DOACROSS loop. This paper reports on the practical parallelism detector (PPD) that is implemented in PFPC (a portable FORTRAN parallelizing compiler running on OSF/1) at NCTU to concentrate on finding the parallelism available in loops. The PPD can extract the potential DOALL and DOACROSS loops in a program by invoking a combination of the ZIV test and the I test for verifying array subscripts. Furthermore, if DOACROSS loops are available, an optimization of synchronization statement is made. Experimental results show that PPD is more reliable and accurate than previous approaches.
Reference model and object oriented approach for business process design and workflow management
Authors: M. Rohloff
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

This paper introduces an object oriented approach to business process modeling. The approach integrates decisions on organisational design with information systems development. Based on the understanding of business processes as a customer-supplier relationship a general process model is introduced which summarizes fundamental characteristics of business processes. These characteristics are the ground for an object oriented approach which extends the OO modeling-technique OMT with features for business process modeling. An example illustrates the principal approach, the main modeling steps and the methodical support. It is based on an outside (macro) and an inside (micro) view on business processes.
Representations of Multiple-Output Switching Functions Using Multiple-Valued Pseudo-Kronecker Decision Diagrams
Authors: Hafiz Hasan Babu, Tsutomu Sasao
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, we propose a method to construct smaller multiple-valued pseudo-Kronecker decision diagrams (MVPKDDs). Our method first generates a 4-valued input 2-valued multiple-output function from a given 2-valued input 2-valued output functions. Then, it constructs a 4-valued decision diagram (4-valued DD) to represent the generated 4-valued input function. Finally, it selects a good expansion among 27 different expansions for each 4-valued node of the 4-valued DD and derives a 4-valued PKDD.We present heuristics to produce compact 4-valued PKDDs. Experimental results using benchmark functions show the efficiency of our method. From experiments, we also conjecture that, for n>1, to represent an n-bit adder (adr n), a 4-valued PKDD, a 4-valued DD (MDD), a 2-valued PKDD, and a shared binary decision diagram (SBDD) require 2n+1, 3n-1, 4n-1, and 9n-7 non-terminal nodes, respectively.
A Subspace Preconditioning Algorithm For Eigenvector/Eigenvalue Computation
Authors: James H. Bramble, Andrew V. Knyazev, Joseph E. Pasciak
Venue:  (1995)

We consider the problems of computing a modest number of the smallest eigenvalues along with orthogonal bases of the corresponding eigenspaces of a symmetric positive definite operator A defined on a finite dimensional real Hilbert space V. In our applications, the dimension of V is large and the cost fo inverting A is prohibitive. In this paper, we shall develop an effective parallelizable technique for compution these eigenvalues and eigenvectors utilizing sunspace iteration and preconditioning for A. Estimates will be provided which show that the preconditioned method coverages linearly when used with a uniform preconditioner under the assumption that the approximatiog subspace is close enough to the span of desired eigenvectors.
Understanding the Impact of Language Features on Reusability
Authors: R. L. Biddle, E. D. Tempero
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

We present a conceptual model for helping us understand the nature of software reusability, particularly to help us understand how language features affect the reusability of software. The fundamental concept for our model is that of dependencies. We identify properties of dependencies between segments of code that are important to reusability. We validate our model by showing its application to well-understood principles of reusability. We demonstrate that being able to describe these principles in a single framework allows us to gain a better understanding of reusability.