ppxscal/embedding_network huggingface dataset:
Low-Voltage CMOS Log-Companding Techniques for Audio Applications
Authors: Francisco Serra-Graells, Adoración Rueda, José Luis Huertas
Venue: Analog Integrated Circuits and Signal Processing (2004)

This paper presents a collection of novel current-mode circuit techniques for the integration of very low-voltage (down to 1 V) low-power (few hundreds of &mu;A) complete SoCs in CMOS technologies. The new design proposal is based on both, the Log Companding theory and the MOSFET operating in subthreshold. Several basic building blocks for audio amplification, AGC and arbitrary filtering are given. The feasibility of the proposed CMOS circuits is illustrated through experimental data for different design case studies in 1.2 and 0.35 &mu;m VLSI technologies.
Extracting unstructured data from template generated web documents
Authors: Ling Ma, Nazli Goharian, Abdur Chowdhury, Misun Chung
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

We propose a novel approach that identifies web page templates and extracts the unstructured data. Extracting only the body of the page and eliminating the template increases the retrieval precision for the queries that generate irrelevant results. We believe that by reducing the number of irrelevant results; the users are encouraged to go back to a given site to search. Our experimental results on several different web sites and on the whole cnnfn collection demonstrate the feasibility of our approach.
Incremental Redundancy and Link Adaptation in Wireless Local AreaNetworks Using Residue Number Systems
Authors: A. S. Madhukumar, François Chin, A. B. Premkumar
Venue: Wireless Personal Communications: An International Journal (2003)

The paper explores the use of residue number systems (RNS) to incorporate incremental redundancy (IR) and link adaptation (LA) in wireless communication systems. This also explores the use of RNS to increase the transmission data rate and to enhance the privacy of a wireless network. By exploiting IR and LA further, one can design an appropriate coding scheme for transmission at the currently experienced SNR level. The proposed method is implemented in existing wireless local area network (WLAN) standards and simulated extensively to find its suitability. The results of simulation studies are discussed in details.
Efficiency of Transient Bit-Flips Detection by Software Means: A Complete Study
Authors: B. Nicolescu, P. Peronnard, R. Velazco, Y. Savaria
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper characterizes the effectiveness of an error detection technique that addresses transient faults induced by the environment (radiation, EMC) in processor-based architectures. Experimental results obtained from fault injection sessions performed on two platforms built around a 32-bit digital signal processor and an 8-bit microcontroller, provide objective figures about the efficiency of the proposed approach.
Computer graphics and theatre
Authors: Who Jeong Lee
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

In this paper, I discuss the multifaceted ways of integrating computer graphics and theatre. This includes my experience working with the Advanced Computing Center for the Arts and Design and the Ohio State University department of theatre, experimenting with CG to create graphics for physical and virtual environments.The ultimate example of this application is achieved by Sleep Deprivation Chamber, the joint production between the ACCAD (Advanced Computing Center for the Arts and Design) and the theatre department at the Ohio State University. This production is presented in the Bowen Theatre at the Ohio State University form May 7th to May 27th, 2003. This production encompasses a broad range of computer graphics and interactive triggering technologies as a theatrical performance form.I hope examples I describe in this paper show possibilities of creating new curriculum for theatre courses or interdisciplinary courses between theatre and computer graphics in which students can share their ideas and technical skills.
E-commerce and executive information systems: a managerial perspective
Authors: Geoff Erwin, Udo Averweg
Venue: The economic and social impacts of e-commerce (2003)

The rapid spread of connectivity via the World Wide Web has dramatically altered the ways in which organizations deal with customers and the methods that executives adopt to be informed about business operations. This chapter reviews Executive Information Systems (EIS) and the way in which EIS interacts with e-commerce applications.
JACOT: a tool to dynamically visualise the execution of concurrent Java programs
Authors: Hugo Leroux, Annya Réquilé-Romanczuk, Christine Mingins
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The introduction of concurrency within emerging languages such as Java brings challenging new concepts to the user. Owing to the inherent non-determinism of threads and multiple flow of control in concurrent programs, traditional debugging and comprehension techniques, such as source code analysis, do not suffice. We believe that visualisation can assist in expediting comprehension of concurrent programs. We present, Jacot, a visualisation tool to depict the execution of concurrent Java programs. Jacot has two views based on the Unified Modeling Language (UML) Sequence diagram paradigm. It is implemented in Java and uses the Java Debug Interface (JDI) for event gathering. It depicts the interaction between objects and the interleaving of threads in a timely fashion, using method invocations.
Prospect Theory: Much Ado About Nothing?
Authors: Moshe Levy, Haim Levy
Venue: Management Science (2002)

Prospect theory is a paradigm challenging the expected utility paradigm. One of the fundamental components of prospect theory is the S-shaped value function. The value function is mainly justified by experimental investigation of the certainty equivalents of prospects confined either to the negative or to the positive domain, but not of mixed prospects, which characterize most actual investments. We conduct an experimental study withmixed prospects, using, for the first time, recently developed investment criteria called Prospect Stochastic Dominance (PSD) and Markowitz Stochastic Dominance (MSD). We reject the S-shaped value function, showing thatat least 62%--76% of the subjects cannot be characterized by such preferences. We find support for the Markowitz utility function, which is a reversed S-shaped function--exactly the opposite of the prospect theory value function. It is possible that the previous results supporting the S-shaped value function are distorted because the prospects had only positive or only negative outcomes, presenting hypothetical situations which individuals do not usually face, and which are certainly not common in financial markets.
A Poisson &#x002A; Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
Authors: Hsien-Kuei Hwang
Venue: Combinatorics, Probability and Computing (1998)

Given a class of combinatorial structures &Cscr;, we consider the quantity N(n, m), the number of multiset constructions &Pscr; (of &Cscr;) of size n having exactly m &Cscr;-components. Under general analytic conditions on the generating function of &Cscr;, we derive precise asymptotic estimates for N(n, m), as n&rarr;&infin; and m varies through all possible values (in general 1&le;m&le;n). In particular, we show that the number of &Cscr;-components in a random (assuming a uniform probability measure) &Pscr;-structure of size n obeys asymptotically a convolution law of the Poisson and the geometric distributions. Applications of the results include random mapping patterns, polynomials in finite fields, parameters in additive arithmetical semigroups, etc. This work develops the &lsquo;additive&rsquo; counterpart of our previous work on the distribution of the number of prime factors of an integer [20].
Streaming content distribution networks with minimum delivery cost
Authors: Jussara Marques De Almeida
Venue:  (2003)

A Content Distribution Network, or CDN, is a system to improve the delivery of content to the end users (or clients) in the Internet, in which popular content may be cached or replicated at a number of servers, placed closer to some of the client populations. The design of a CDN consists of defining: (a) which content should be replicated at each server (server content), (b) the number of servers and where they should be placed in the network (server placement), (c) which server a client's requests should be sent to (server selection) and (d) how the server responses should be routed to the clients (routing). CDNs were originally designed for traditional web files (i.e., HTML, image files). However, given the increase in streaming media (i.e., video and audio) content in the Internet, the development of efficient CDN design methods that take into account the special characteristics of media objects is of great interest. These characteristics include the sustained high bandwidth requirements and the new and complex tradeoffs introduced by multicast delivery. The main goal of this thesis is to develop methods for designing streaming media CDNs with (near) minimum delivery cost, where the delivery cost includes both the server and the network bandwidth costs. We propose and evaluate a new simple minimum cost caching algorithm for conventional CDNs that use unicast delivery. We also develop cost models to determine the optimal server content, server placement and routing for scalable CDNs that use multicast delivery, and new approximate algorithms for determining the near optimal server placement and routing for scalable CDNs. In order to develop the cost models and to evaluate our solutions, a reasonably small set of system and workload parameters that have primary impact on a CDN delivery cost are identified. These parameters are varied over a wide range of values in order to cover as much of CDN design space as it is practically feasible. This thesis also provides an extensive analysis of the workloads of two educational media servers to provide data for creating realistic synthetic workloads and to gain insights into efficient CDN design strategies.
Intelligent Mobile Agents for Efficient and Inexpensive e-Shopping
Authors: Lin Lu, Yan-Qing Zhang
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

To mine useful information for e-shopping users, theintelligent mobile agents is built on the Kaariboga mobileagents system. The centralized fuzzy mobile data miningalgorithm for the intelligent mobile agents is designedand implemented to process distributed wired andwireless databases at different shopping centers. Themajor goal is to provide a user with current e-shoppinginformation to help the user make efficient shoppingdecisions.
Analysis of predictive spatio-temporal queries
Authors: Yufei Tao, Jimeng Sun, Dimitris Papadias
Venue: ACM Transactions on Database Systems (TODS) (2003)

Given a set of objects S, a spatio-temporal window query q retrieves the objects of S that will intersect the window during the (future) interval qT. A nearest neighbor query q retrieves the objects of S closest to q during qT. Given a threshold d, a spatio-temporal join retrieves the pairs of objects from two datasets that will come within distance d from each other during qT. In this article, we present probabilistic cost models that estimate the selectivity of spatio-temporal window queries and joins, and the expected distance between a query and its nearest neighbor(s). Our models capture any query/object mobility combination (moving queries, moving objects or both) and any data type (points and rectangles) in arbitrary dimensionality. In addition, we develop specialized spatio-temporal histograms, which take into account both location and velocity information, and can be incrementally maintained. Extensive performance evaluation verifies that the proposed techniques produce highly accurate estimation on both uniform and non-uniform data.
A comprehensive and systematic model of user evaluation of web search engines: II. an evaluation by undergraduates
Authors: Louise T. Su
Venue: Journal of the American Society for Information Science and Technology (2003)

This paper presents an application of the model described in Part I to the evaluation of Web search engines by undergraduates. The study observed how 36 undergraduate used four major search engines to find information for their own individual problems and how they evaluated these engines based on actual interaction with the search engines. User evaluation was based on 16 performance measures representing five evaluation criteria: relevance, efficiency, utility, user satisfaction, and connectivity. Non-performance (user-related) measures were also applied. Each participant searched his/ her own topic on all four engines and provided satisfaction ratings for system features and interaction and reasons for satisfaction. Each also made relevance judgements of retrieved items in relation to his/her own information need and participated in post-search interviews to provide reactions to the search results and overall performance. The study found significant differences in precision PR1, relative recall, user satisfaction with output display, time saving, value of search results, and overall performance among the four engines and also significant engine by discipline interactions on all these measures. In addition, the study found significant differences in user satisfaction with response time among four engines, and significant engine by discipline interaction in user satisfaction with search interface. None of the four search engines dominated in every aspect of the multidimensional evaluation. Content analysis of verbal data identified a number of user criteria and users evaluative comments based on these criteria. Results from both quantitative analysis and content analysis provide insight for system design and development, and useful feedback on strengths and weaknesses of search engines for system improvement.
Techniques for efficiently allocating persistent storage
Authors: Arun Iyengar, Shudong Jin, Jim Challenger
Venue: Journal of Systems and Software (2003)

Efficient disk storage is a crucial component for many applications. The commonly used method of storing data on disk using file systems or databases incurs significant overhead which can be a problem for applications which need to frequently access and update a large number of objects. This paper presents efficient algorithms for managing persistent storage which usually only require a single seek for allocations and deallocations and allow the state of the system to be fully recoverable in the event of a failure. We have developed a portable implementation of our algorithms in Java. Results in this paper demonstrate the superiority of our approach over file systems and databases for Web-related workloads. Our system has been a crucial component for persistently storing data at a number of highly accessed Web sites. We describe our experiences from a large real deployment of our system.
Protocol design for scalable and reliable group rekeying
Authors: X. Brian Zhang, Simon S. Lam, Dong-Young Lee, Y. Richard Yang
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

We present the design and specification of a protocol for scalable and reliable group rekeying together with performance evaluation results. The protocol is based upon the use of key trees for secure groups and periodic batch rekeying. At the beginning of each rekey interval, the key server sends a rekey message to all users consisting of encrypted new keys (encryptions, in short) carried in a sequence of packets. We present a scheme for identifying keys, encryptions, and users, and a key assignment algorithm that ensures that the encryptions needed by a user are in the same packet. Our protocol provides reliable delivery of new keys to all users eventually. It also attempts to deliver new keys to all users with a high probability by the end of the rekey interval. For each rekey message, the protocol runs in two steps: a multicast step followed by a unicast step. Proactive forward error correction (FEC) multicast is used to reduce delivery latency. Our experiments show that a small FEC block size can be used to reduce encoding time at the server without increasing server bandwidth overhead. Early transition to unicast, after at most two multicast rounds, further reduces the worst-case delivery latency as well as user bandwidth requirement. The key server adaptively adjusts the proactivity factor based upon past feedback information; our experiments show that the number of NACKs after a multicast round can be effectively controlled around a target number. Throughout the protocol design, we strive to minimize processing and bandwidth requirements for both the key server and users.
Reliability Estimation Model of ICs Interconnect Based on Uniform Distribution of Defects on a Chip
Authors: Tianxu Zhao, Xuchao Duan, Yue Hao, Peijun Ma
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Electromigration effect is still a dominating failure mechanism of interconnect for deep-submicron and super deep-submicron scale. However, defect, which exists throughout IC manufacturing process, is another important factors affecting IC interconnection lifetime. When there is a defect on interconnection, this interconnection lifetime is shortened because of electromigration effect. In this paper, a new failure model of IC interconnection is proposed based on analysis of the available estimation models of IC interconnect lifetime. Many factors, such as the sizes of the defect, wire width, wire length and so on, are considered in this new model. The simulation results show that the model is valid.
Self-formation in Microelectronics
Authors: Stepas Janušonis
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The external formation of integrated circuits based on lithographic processes is not the only possible method for manufacturing electron devices, either integrated circuits or photovoltaic cells. Planar technology, based on external formation, requires a certain sequence of interactions between the structured medium and the object being formed, in which the configuration of the region to be formed and its position are defined by the structure of the media and their alignment with the object. By contrast, in self-formation the interaction between an object to be formed and its chaotic medium is controlled by the object structure itself, and it is this interaction that changes the object's structure, leading to its increasing complexity. Three kinds of self-formation can be used in manufacturing: self-formation, based on a certain sequential interaction between an object and chaotic media; development, which requires only a single chaotic medium; and reproduction, which involves a developing object generating primary objects. All these cases represent self-formation of artificial systems. Simpler patterns of self-formation have already led to various patents and technologies, while more complex ones may be applied in the future. The following article attempts to define the necessary and sufficient conditions for self-formation.
The fundamental solution method for elliptic boundary value problems
Authors: Pascal Roubides
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This article presents an efficient field discretization method based on fundamental solutions for elliptic boundary value problems, represented in this monogram by the steady-state heat conduction equation. The results have shown that the method is highly accurate and does not require the fine grid resolution that other techniques demand.
Manpower scheduling with time windows
Authors: Andrew Lim, Brian Rodrigues, Lei Song
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates from peculiar port yard scheduling needs where demand is generated from locations in the yard for servicemen who are dispatched from a central point and where the objectives are to minimize the number of servicemen scheduled, travel distances, travel times and waiting times at each location. Although closely related to the well-known vehicle routing problem, this problem is different while its solution could provide insight to the latter. We develop solutions using metaheuristic methods, and in particular provide tabu-embedded simulated annealing and squeaky wheel optimization with local search algorithms for this problem. We apply these newly-developed metaheuristics with adaptations for solutions to the manpower allocation problem, while our analysis throws light on how these work. Computational results are reported which show the effectiveness of our approach when applied to the manpower allocation problem.
Towards video-based immersive environments
Authors: Arun Katkere, Saied Moezzi, Don Y. Kuramura, Patrick Kelly, Ramesh Jain
Venue: Multimedia Systems (1997)

Video provides a comprehensive visual record of environment activity over time. Thus, video data is an attractive source of information for the creation of virtual worlds which require some real-world fidelity. This paper describes the use of multiple streams of video data for the creation of immersive virtual environments. We outline our multiple perspective interactive video (MPI-Video) architecture which provides the infrastructure for the processing and analysis of multiple streams of video data. Our MPI-Video system performs automated analysis of the raw video and constructs a model of the environment and object activity within this environment. This model provides a comprehensive representation of the world monitored by the cameras which, in turn, can be used in the construction of a virtual world. In addition, using the information produced and maintained by the MPI-Video system, our immersive video system generates virtual video sequences. These are sequences of the dynamic environment from an arbitrary view point generated using the real camera data. Such sequences allow a user to navigate through the environment and provide a sense of immersion in the scene. We discuss results from our MPI-Video prototype, outline algorithms for the construction of virtual views and provide examples of a variety of such immersive video sequences.
Migrating to the Solaris Operating System: The Discipline of UNIX-to-UNIX Migrations
Authors: Ken Pepple, Brian Down, David Levy
Venue:  (2003)

Increase efficiency with new technologies and processes Improve the performance and availability of your IT solutions Reduce IT total cost of ownershipThis book presents an established methodology for transitioning the people, processes, and technologies in IT environments to the Solaris(TM) Operating System. It steps you through the various phases of the migration process, using detailed case studies to illustrate the benefits, costs, and requirements associated with a migration project. While this book focuses on UNIX server migrations, the methodology and best practices presented apply for most migrations to the Solaris environment. They can be used for projects ranging from the smallest data conversion to the largest legacy migration.