ppxscal/embedding_network huggingface dataset:
System level design with spade: an M-JPEG case study
Authors: Paul Lieverse, Todor Stefanov, Pieter van der Wolf, Ed Deprettere
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper we present and evaluate the Spade (System level Performance Analysis and Design space Exploration) methodology through an illustrative case study. Spade is a method and tool for architecture exploration of heterogeneous signal processing systems. In this case study we start from an M-JPEG application and use Spade to evaluate alternative multi-processor architectures for implementing this application. Spade follows the Y-chart paradigm for system level design; application and architecture are modeled separately and mapped onto each other in an explicit design step. Spade permits architectures to be modeled at an abstract level using a library of generic building blocks, thereby reducing the cost of model construction and simulation. The case study shows that Spade supports efficient exploration of candidate architectures; models can be easily constructed, modified and simulated in order to quickly evaluate alternative system implementations.
An Expressive Query Language for Product Recommender Systems
Authors: Derek Bridge, Alex Ferguson
Venue: Artificial Intelligence Review (2002)

We argue that existing approaches to the construction of content-based Product Recommender Systems (Filter-Based Retrieval and Similarity-Based Retrieval) use inadequately expressive query languages. We introduce a new approach, which we call Order-Based Retrieval. We define and exemplify the six operators that constitute its query language. We show how these operators can better support the elicitation of both the customer's initial requirements and refinements to the initial requirements.
Profiting from Value-Added Wireless Services
Authors: Xianjun Geng, Andrew B. Whinston
Venue: Computer (2001)

Product differentiation offers the best strategy for achieving financial success in the 3G mobile commerce market.
A test of normality with high uniform power
Authors: Douglas G. Bonett, Edith Seier
Venue: Computational Statistics Data Analysis (2002)

Kurtosis can be measured in more than one way. A modification of Geary's measure of kurtosis is shown to be more sensitive to kurtosis in the center of the distribution while Pearson's measure of kurtosis is more sensitive to kurtosis in the tails of the distribution. The modified Geary measure and the Pearson measure are used to define a joint test of kurtosis that has high uniform power across a very wide range of symmetric nonnormal distributions.
Generalized Spatio-Chromatic Diffusion
Authors: Giuseppe Boccignone, Mario Ferraro, Terry Caelli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

In this paper, a framework for diffusion of color images is presented. The method is based on the theory of thermodynamics of irreversible transformations which provides a suitable basis for designing correlations between the different color channels. More precisely, we derive an equation for color evolution which comprises a purely spatial diffusive term and a nonlinear term that depends on the interactions among color channels over space. We apply the proposed equation to images represented in several color spaces, such as RGB, CIELAB, Opponent colors, and IHS.
Video Content Management in Consumer Devices
Authors: Nevenka Dimitrova, Thomas McGee, Herman Elenbaas, Jacquelyn Martino
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Methods for video content analysis are necessary for the growing amount of video information delivered to consumers today. In this paper, we present a system for video content analysis called Vitamin, which provides management of a home video library. The system presents the user with a Visual Table of Contents that provides an overview of the video content and direct access to particular points in the stored video. In this process, we apply a computationally inexpensive, simple, yet powerful mechanism for cut detection and keyframe filtering. Our initial implementation and results show that this system can perform video content extraction in real time on a low-end platform that matches a Visual Table of Contents extracted by an expert.
First commentary on "XML and the new design regime"
Authors: Glenda Burch
Venue: ACM Journal of Computer Documentation (JCD) (2002)

While taking exception with some of Wilkes's points and with the omission of details in the article, the author fundamentally agrees that Wilkes succeeds in his primary purposes of setting XML within a theoretical framework for changes in written artifacts.
A Network System of Medical and Welfare Information Service for the Patients, Their Families, Hospitals, Local Governments, and Commercial Companies in a Medical Service Area
Authors: Kouji Matsumura, Yasuaki Antoku, Reika Inoue, Mariko Kobayashi, Eisuke Hanada, Yasutaka Iwasaki, Yasushi Kumagai, Haruya Iwamoto, Saburo Tsuchihashi, Miho Iwaki, Jun-Ichi Kira, Yoshiaki Nose
Venue: Journal of Medical Systems (2002)

A service information system using the Internet, which connected the various people who are related to medical treatment and nursing welfare, was constructed. An intractable neurological disease patient who lives in the Onga district, Fukuoka, Japan, and the people who are related to the service were chosen as test users in an experimental model. The communicated service information was divided into open-use data (electronic bulletin board, welfare service, medical care service, and link to private company service home page) and closed-use data (the individual patient's hysterics). The open data server was installed in an Internet service provider. The open data could be accessed not only by the patient, but also by the family, information center, companies, hospitals, and nursing commodity store related to patient's nursing and medical treatment. Closed data server was installed in an information center (public health center). Only patient and information center staff can access the closed data. Patients should search and collect the service information of various medical and welfare services by themselves. Therefore, services prepared for the patient are difficult to know, and they cannot be sufficiently utilized. With the use of this information system, all usable service information became accessible, and patients could easily use it. The electronic bulletin board system (BBS) was used by patients for knowing each other or each others' family, and was used as a device for exchange of wisdom. Also, the questions for the specialist, such as doctor, dentist, teacher, physical therapist, care manager, welfare office staff member, and public health nurse, and the answers were shown on the BBS. By arranging data file, a reference of various patients in question and answer, which appeared in this BBS, was made as &ldquo;advisory hints&rdquo; and was added to the open data. The advisory hints became the new service information for the patients and their family. This BBS discovered the possibility of becoming an important information source for companies, hospital and, administration to know the requirements of patients and their families and the kind of services to be served. Although suppliers provide medical and welfare services for the patient, there is a tendency that the service information is sent by the suppliers at their own convenience. The information system in which various people participated was constructed in order to collect information for the patient, taking a patient-oriented approach. The result of the model test showed that this information system using Internet technology is a good system for both the service supplier and its receiver.
MAgNET: Mobile Agents for Networked Electronic Trading
Authors: Prithviraj Dasgupta, Nitya Narasimhan, Louise E. Moser, P. m. Melliar-Smith
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Electronic commerce technology offers the opportunity to integrate and optimize the global production and distribution supply chain. The computers of the various corporations, located throughout the world, will communicate with each other to determine the availability of components, to place and confirm orders, and to negotiate delivery timescales. In this paper, we describe MAgNET, a system for networked electronic trading that is based on the Java mobile agent technology, called aglets. Aglets are dispatched by the buyer to the various suppliers, where they negotiate orders and deliveries, returning to the buyer with their best deals for approval. MAgNET handles the deep supply chain, where a supplier may need to contact further suppliers of subcomponents in order to respond to an enquiry. Experimental results demonstrate the feasibility of using the Java aglet technology for electronic commerce.
ITRON-MP: An Adaptive Real-Time Kernel Specification for Shared-Memory Multiprocessor Systems
Authors: Hiroaki Takada, Ken Sakamura
Venue: IEEE Micro (1991)

A real-time kernel specification named ITRON-MP (industrial-oriented TRON for multiprocessor systems), which defines a standard kernel interface adaptable to various shared-memory multiprocessor architectures, is presented. ITRON-MP is an extension of ITRON, which is a specification of real-time kernels for embedded systems. The ITRON-MP specification is an open architecture, in that anyone can freely implement a kernel based on the specification. A universal implementation of ITRON-MP generates an adapted kernel code for each architecture. This approach presents a standard operating system interface for the development of various real-time systems and improves the efficiency of system development. Moreover, because the executed kernel code is tuned to each architecture, the runtime performance is not degraded by the standardization. The design principles and main features of ITRON-MP are described.
An Adaptive Approach to Offline Handwritten Word Recognition
Authors: Jaehwa Park
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

An adaptive handwritten word recognition method is presented. The key ideas of adaptation are 1) to actively and successively select a subset of features for each word image which provides the minimum required classification accuracy to get a valid answer and 2) to derive a consistent decision metric which works in a multiresolution feature space and considers the interrelationships of a lexicon at the same time. A recursive architecture based on interaction between flexible character classification and deductive decision making is developed. The recognition process starts from the initial coarse level using a minimum number of features, then increases the discrimination power by adding other features adaptively and recursively until the result is accepted by the decision maker. For the computational aspect of a feasible solution, a unified decision metric, recognition confidence, is derived from two measurements: pattern confidence, evaluation of absolute confidence using shape features, and lexical confidence, evaluation of the relative string dissimilarity in the lexicon. Practical implementation and experimental results in reading the handwritten words of the address components of US mail pieces are provided. Up to a 4 percent improvement in recognition performance is achieved compared to a nonadaptive method. The experimental result shows that the proposed method has advantages in producing valid answers using the same number of features as conventional methods.
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing
Authors: Guanling Lee, Shou-Chih Lo, Arbee L. P. Chen
Venue: IEEE Transactions on Computers (2002)

Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach.
On Design Validation Using Verification Technology
Authors: Dinos Moundanos, Jacob A. Abraham
Venue: Journal of Electronic Testing: Theory and Applications (1999)

Despite great advances in the area of Formal Verification during the last ten years, simulation is currently the primary means for performing design verification. The definition of an accurate and pragmatic measure for the coverage achieved by a suite of simulation vectors and the related problem of coverage directed automatic test generation are of great importance. In this paper we introduce a new set of metrics, called the Event Sequence Coverage Metrics (ESCMs). Our approach is based on a simple and automatic method to extract the control flow of a circuit so that the resulting state space can be explored for validation coverage analysis and automatic test generation. During simulation we monitor, in addition to state and transition coverage, whether certain control event sequences take place or not. We then combine formal verification techniques, using BDDs as the underlying representation, with traditional ATPG and behavioral test generation techniques to automatically generate additional sequences which traverse uncovered parts of the control state graph, or exercise an uninstantiated control event sequence.
An Overview of Standards and Related Technology in Web Services
Authors: Aphrodite Tsalgatidou, Thomi Pilioura
Venue: Distributed and Parallel Databases (2002)

The Internet is revolutionizing business by providing an affordable and efficient way to link companies with their partners as well as customers. Nevertheless, there are problems that degrade the profitability of the Internet: closed markets that cannot use each other's services&semi; incompatible applications and frameworks that cannot interoperate or built upon each other&semi; difficulties in exchanging business data. Web Services is a new paradigm for e-business that is expected to change the way business applications are developed and interoperate. A Web Service is a self-describing, self-contained, modular application accessible over the web. It exposes an XML interface, it is registered and can be located through a Web Service registry. Finally, it communicates with other services using XML messages over standard Web protocols. This paper presents the Web Service model and gives an overview of existing standards. It then sketches the Web Service life-cycle, discusses related technical challenges and how they are addressed by current standards, commercial products and research efforts. Finally it gives some concluding remarks regarding the state of the art of Web Services.
Toward autonomic computing with DB2 universal database
Authors: Sam S. Lightstone, Guy Lohman, Danny Zilio
Venue: ACM SIGMOD Record (2002)

As the cost of both hardware and software falls due to technological advancements and economies of scale, the cost of ownership for database applications is increasingly dominated by the cost of people to manage them. Databases are growing rapidly in scale and complexity, while skilled database administrators (DBAs) are becoming rarer and more expensive. This paper describes the self-managing or autonomic technology in IBM's DB2 Universal Database&reg; for UNIX and Windows to illustrate how self-managing technology can reduce complexity, helping to reduce the total cost of ownership (TCO) of DBMSs and improve system performance.
A+ Certification Kit with Cdrom, 2nd edition
Authors: David Groth
Venue:  (1998)

:A+ certification exams! This box set contains the A+: Core Module Study Guide and the A+: DOS/Windows Study Guide. Each book provides detailed coverage of every objective defined by CompTIA for its exam. Use the Sybex A+ Test-Preparation Programs included on the two CDs to make sure you're ready to ace the exams the first time.
Updating Distributed Materialized Views
Authors: A. Segev, J. Park
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The problem of updating materialized views in distributed database systems is discussed. An architecture and detailed procedures for updating a collection of remote views with arbitrary refresh times by using a single differential file are described. The efficiency of the update procedure is enhanced by adopting s multiquery optimization approach and by introducing a powerful prescreening procedure to eliminate differential tuples. It is shown that even for a single remote view, there are many instances where the update procedure performs better (with respect to total I/O and communication costs) than a base table approach.
Mixture models of categorization
Authors: Yves Rosseel
Venue: Journal of Mathematical Psychology (2002)

Many currently popular models of categorization are either strictly parametric (e.g., prototype models, decision bound models) or strictly nonparametric (e.g., exemplar models) (F. G. Ashby & L. A. Alfonso-Reese, 1995, Journal of Mathematical Psychology, 39, 216-233). In this article, a family of semiparametric classifiers is investigated where categories are represented by a finite mixture distribution. The advantage of these mixture models of categorization is that they contain several parametric models and nonparametric models as a special case. Specifically, it is shown that both decision bound models (F. G. Ashby & W. T. Maddox, 1992, Journal of Experimental Psychology: Human Perception and Performance, 16, 598-612; 1993, Journal of Mathematical Psychology, 37, 372-400) and the generalized context model (R. M. Nosofsky, 1986, Journal of Experimental Psychology: General, 115, 39-57) can be interpreted as two extreme cases of a common mixture model. Furthermore, many other (semiparametric) models of categorization can be derived from the same generic mixture framework. In this article, several examples are discussed and a parameter estimation procedure for fitting these models is outlined. To illustrate the approach, several specific models are fitted to a data set collected by S. C. McKinley and R. M. Nosofsky (1995, Journal of Experimental Psychology: Human Perception and Performance, 21, 128-148). The results suggest that semi-parametric models are a promising alternative for future model development.
Selective deposition of gold nanoclusters on silicon by a galvanic displacement process
Authors: L. Magagnin, V. Bertani, P. L. Cavallotti, R. Maboudian, C. Carraro
Venue: Microelectronic Engineering (2002)

Gold nanoclusters are deposited selectively on silicon substrates by galvanic displacement from reversed micelle microemulsions. The water-in-oil system investigated comprises an organic phase (n-heptane), a surfactant (AOT), and an aqueous solution of hydrofluoric acid and metallic ions. X-ray diffraction and scanning electron microscopy are employed to investigate the correlation between the nominal size of the reversed micelles and the size of the metal clusters formed on the silicon substrate. The measured gold cluster radius is in good quantitative agreement with nominal micelle radius over a wide range of cluster size and deposition time.
Cache Profiling and the SPEC Benchmarks: A Case Study
Authors: Alvin R. Lebeck, David A. Wood
Venue: Computer (1994)

A vital tool-box component, the CProf cache profiling system lets programmers identify hot spots by providing cache performance information at the source-line and data-structure level. Our purpose is to introduce a broad audience to cache performance profiling and tuning techniques. Although used sporadically in the supercomputer and multiprocessor communities, these techniques also have broad applicability to programs running on fast uniprocessor workstations. We show that cache profiling, using our CProf cache profiling system, improves program performance by focusing a programmer's attention on problematic code sections and providing insight into appropriate program transformations.
Shared-Memory Parallel Programming in C++
Authors: Bob Beck
Venue: IEEE Software (1990)

A set of portable parallel-programming constructs for C, implemented in M4 macros called Parmacs, developed by researchers at Argonne National Laboratory, is considered. The Parmacs macros make it possible to write parallel C programs for shared-memory, distributed-memory, and mixed-memory systems; are portable, highly functional, and efficient; and provide sufficient functions to build a variety of parallel programs. However, they have several problems. The M4 macros are awkward to use and hard to read, so it is easy to make errors when using them. They are a mechanism outside the C language; thus, someone familiar only with C cannot readily read the code. They are not cleanly extensible, and their use is not type-checked. It is shown that using C++, rather than C, addresses these problems adequately. The Parmacs macros are described, the C++ Parmacs classes and runtime model are presented, and examples that show the use of the C++ Parmacs constructs are given. The work described considers only shared-memory constructs. Directions for future work are indicated.
Evolution in Medical Decision Making
Authors: Matej Šprogar, Mitja Lenič, Silvia Alayon
Venue: Journal of Medical Systems (2002)

The classical approach to medical decision making can be limited by the underlying theories. The evolutionary computation is a different concept, which can find many different solutions of the problem. In medicine, this is useful because of different expectations the decision system must face. We implemented a tool for genetic induction of vector decision trees, which are a good choice for a medical decision model because of their simplicity and transparency. The vector decision tree gives multiple classifications in one single pass. Evolutionary development of such trees achieved good results when the results were statistically compared to those of other classical methods. For medical interpretation however a cooperation with doctors is needed to verify the model build.
The range test: a dependence test for symbolic, non-linear expressions
Authors: William Blume, Rudolf Eigenmann
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions (e.g. A (n*i+j), where 0 &le; j &le; n). In this paper, we describe a dependence test, called the range test, that can handle such expressions. Briefly, the range test proves independence by determining whether certain symbolic inequalities hold for a permutation of the loop nest. Powerful symbolic analyses and constraint propagation techniques were developed to prove such inequalities. The range test has been implemented in Polaris, a parallelizing compiler being developed at the University of Illinois.