ppxscal/embedding_network huggingface dataset:
Model of the precautionary and motivational role of insurance
Authors: T. I. Ovchinnikova
Venue: Automation and Remote Control (2005)

A model of decision making by the insurer about the size of the insurance payment was considered. The flexible mechanisms of insurance rates were shown to be both precautionary, that is, stimulating the insured to increase the assignments to the precautionary measures, and motivational, that is, stimulating the insured to take actions that reduce the damage of the insured accidents.
Mining Evolving Customer-Product Relationships in Multi-dimensional Space
Authors: Xiaolei Li, Jiawei Han, Xiaoxin Yin, Dong Xin
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Previous work on mining transactional database has focused primarily on mining frequent itemsets, association rules, and sequential patterns. However, interesting relationships between customers and items, especially their evolution with time, have not been studied thoroughly. In this paper, we propose a Gaussian transformation-based regression model that captures time-variant relationships between customers and products. Moreover, since it is interesting to discover such relationships in a multi-dimensional space, an efficient method has been developed to compute multi-dimensional aggregates of such curves in a data cube environment. Our experimental results have demonstrated the promise of the approach.
A Novel Multiobjective Evolution Strategy: Design for Adaptive Balance Between Proximity and Diversity
Authors: Yang Shu Min, Ju Xing Xiang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

This paper proposes a new multi-objective evolutionary approach to investigate the adaptive balance between proximity and diversity. The proposed algorithm combines several elements such as Gaussian and Cauchy mutations, a nondominance selection, and a dynamic external archive. Numerical experimentations are presented using three benchmark instances, and results are compared with three state-of-the-art algorithms. It is drawn that our algorithm is superior to some extent in term of finding a near-optimal, well-extended and uniformly diversified Pareto optimal front.
Towards an Understanding of No Trouble Found Devices
Authors: Scott Davidson
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

This paper gives a model for understanding no trouble found (NTF) parts, including predictions of how many can be expected at different stages of a product life cycle, an understanding of when NTFs are of concern, and when they are to be expected. We also show how NTF rates can be used as a measure of process health.
Apple Pro Training Series: Advanced Logic Pro 7 (Apple Pro Training)
Authors: David Dvorin
Venue:  (2005)

If you want to do more than simply use Logic to improve the audio in your video projects-if you want to start actually creating and producing music with it-this Apple-certified guide provides the key. Whether you're a composer, producer, songwriter, engineer, studio programmer or simply want to create and produce pro-quality music in your Logic-based home studio, you'll find all the self-paced, step-by-step instruction you need here to begin creating your audio master works immediately. As both a professional musician and a former employee of eMagic and Apple (the former and current makers of the software), author David Dvorin knows Logic like no one else. Here, he uses project-based tutorials to reveal all of its secrets, including its newest: advanced DSP techniques and the ability to layer MIDI instruments and split channels. In short order you'll be scoring and composing; jamming with Logic's software instruments; employing advanced mixing, editing, and production techniques; and more. A companion CD includes trial Logic plug-in software and the lesson files needed to complete the book's exercises.
CQ: the Communication Quotient for IS professionals
Authors: Robert W. Service
Venue: Journal of Information Science (2005)

As a programmer, analyst, IS executive, and professor it is clear to me that it is becoming more difficult to communicate, not easier. It would seem that with all of the current communications technologies this statement does not make sense. However, the more sophisticated society gets, the more sophisticated communications must become. Information technologies have made it faster and easier to get messages out to vast numbers of people, but they have increased the danger that any message will be misunderstood. IS/IT professionals often exemplify this problem through personal and organizational communications. The purpose of this article is to provide useful information for those wishing to improve their personal and organizational communications and move up in the organizational ranks. This goal is accomplished by presenting the Communication Quotient (CQ) as a measurable and improvable type of intelligence.
Survey on programming language facilities for numerical computation
Authors: John R. Rice
Venue: ACM SIGNUM Newsletter (1981)

New programming languages are still appearing and old ones are being modernized. Even in the numerical areas there is little information to guide the language designer as to what the users like or need. This survey is collect some such information. Facilities are described in functional terms and there is no intention to describe syntax or even the details of semantics. There is little discussion of "general purpose" language facilities unless there is some special aspect of this facility relevant to numerical computation. It is recognized that there are normally many ways to provide a given capability within a particular programming language design.
Coarse grained gather and scatter operations with applications
Authors: Laurence Boxer, Russ Miller
Venue: Journal of Parallel and Distributed Computing (2004)

We introduce asymptotically optimal algorithms for gathering and scattering a small-to-moderate sized set of data on a coarse grained parallel computer. We use these operations to obtain efficient to optimal solutions to several fundamental problems in image processing and string matching (exact or approximate) for coarse grained parallel computers.
Optimum space-time transmission for a high K factor wireless channel with partial channel knowledge: Invited Papers
Authors: Mai Vu, Arogyaswami J. Paulraj
Venue: Wireless Communications Mobile Computing (2004)

We study the optimum transmission scheme that maximizes ergodic capacity of a 2 &times; 1 multiple-input single-output (MISO) system, when the channel knowledge at the transmitter is characterized by a known gain ratio and a known probability density function (PDF) of the phase shift between antennas. Such a channel scenario can arise in a forward link at the base station when there is a single direct path propagation. We show that the optimum transmit solution is beamforming on the mean value of the phase shift with unequal power input to the antennas. When the phase is completely unknown, the solution reduces to a single antenna transmission. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Improving the performance of dictionary-based approaches in protein name recognition
Authors: Yoshimasa Tsuruoka, Jun'ichi Tsujii
Venue: Journal of Biomedical Informatics (2004)

Dictionary-based protein name recognition is often a first step in extracting information from biomedical documents because it can provide ID information on recognized terms. However, dictionary-based approaches present two fundamental difficulties: (1) false recognition mainly caused by short names; (2) low recall due to spelling variations. In this paper, we tackle the former problem using machine learning to filter out false positives and present two alternative methods for alleviating the latter problem of spelling variations. The first is achieved by using approximate string searching, and the second by expanding the dictionary with a probabilistic variant generator, which we propose in this paper. Experimental results using the GENIA corpus revealed that filtering using a naive Bayes classifier greatly improved precision with only a slight loss of recall, resulting in 10.8% improvement in F-measure, and dictionary expansion with the variant generator gave further 1.6% improvement and achieved an F-measure of 66.6%.
Interactive global and local deformations for virtual clay
Authors: Guillaume Dewaele, Marie-Paule Cani
Venue: Graphical Models (2004)

Making virtual modeling as easy and intuitive as real-clay manipulation is still an unsolved problem. This paper takes a step in this direction: in addition to offering standard features such as addition and removal of material, it uses a new real-time plasticity model to let the user apply local and global deformations such as those made in real clay by pressing with a finger or bending a sculpture with one hand. Although not completely physically accurate, the model exhibits several important features of real clay, namely plasticity, mass conservation, and surface tension effects. These features make the model intuitive, since the user obtains the shapes he expects, as demonstrated by our results.
An efficient normalized maximum likelihood algorithm for DNA sequence compression
Authors: Gergely Korodi, Ioan Tabus
Venue: ACM Transactions on Information Systems (TOIS) (2005)

This article presents an efficient algorithm for DNA sequence compression, which achieves the best compression ratios reported over a test set commonly used for evaluating DNA compression programs. The algorithm introduces many refinements to a compression method that combines: (1) encoding by a simple normalized maximum likelihood (NML) model for discrete regression, through reference to preceding approximate matching blocks, (2) encoding by a first order context coding and (3) representing strings in clear, to make efficient use of the redundancy sources in DNA data, under fast execution times. One of the main algorithmic features is the constraint on the matching blocks to include reasonably long contiguous matches, which not only reduces significantly the search time, but also can be used to modify the NML model to exploit the constraint for getting smaller code lengths. The algorithm handles the changing statistics of DNA data in an adaptive way and by predictively encoding the matching pointers it is successful in compressing long approximate matches. Apart from comparison with previous DNA encoding methods, we present compression results for the recently published human genome data.
Analyzing Heap Error Behavior in Embedded JVM Environments
Authors: G. Chen, M. Kandemir, N. Vijaykrishnan, A. Sivasubramaniam, M. J. Irwin
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Recent studies have shown that transient hardware errors caused by external factors such as alpha particles and cosmic ray strikes can be responsible for a large percentage of system down-time. Denser processing technologies, increasing clock speeds, and low supply voltages used in embedded systems can worsen this problem. In many embedded environments, one may not want to provision extensive error protection in hardware because of (i) form-factor or power consumption limitations, and/or (ii) to keep costs low. Also, the mismatch between the hardware protection granularity and the field access granularity can lead to false alarms and error cancellations. Consequently, software-based approaches to identify and possibly rectify these errors seem to be promising. Towards this goal, this paper specifically looks to enhance the softwareýs ability to detect heap memory errors in a Java-based embedded system. Using several embedded Java applications, this paper first studies the tradeoffs between reliability, performance, and memory space overhead for two schemes that perform error checks at object and field granularities. We also study the impact of object characteristics (e.g., lifetime, re-use intervals, access frequency, etc.) on error propagation. Considering the pros and cons of these two schemes, we then investigate two hybrid strategies that attempt to strike a balance between memory space and performance overheads and reliability. Our experimental results clearly show that the granularity of error protection and its frequency can significantly impact static/dynamic overheads and error detection ability.
Synthesis of application-specific highly efficient multi-mode cores for embedded systems
Authors: Lih-yih Chiou, Swarup Bhunia, Kaushik Roy
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2005)

In this paper, we present a novel design methodology for synthesizing multiple configurations (or modes) into a single programmable core that can be used in embedded systems. Recent portable applications require reconfigurability of a system along with efficiency in terms of power, performance, and area. The field programmable gate arrays (FPGAs) provide a reconfigurable platform; however, they are slower in speed with significantly higher power and area than achievable by a customized application-specific integrated circuits (ASIC). Implementation of a system in either FPGA or ASIC represents a trade-off between programmability and design efficiency. In this work, we have developed techniques to realize efficient reconfigurable cores for a set of user-specified applications. The resultant system, named as multimode system, can easily switch configurations throughout the set of configurations it is designed for. A data flow graph transformation method coupled with efficient scheduling and allocation is used to automatically synthesize a Multi-Mode system from its behavior-level specifications. Experimental results on several applications demonstrate that our implementations can achieve about 60X power reduction on average and run 3.5X faster over corresponding FPGA implementations.
An Introduction to TUG: A Language for Writing Reusable Formal Program Specifications
Authors: Chia-Chu Chiang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

TUG (Tree Unified with Grammar) was developed to support a system to be developed through an integration of conventional software development, operational specification, rapid prototyping via software transformations, software reuse, and analysis of specifications and programs via testing and proofs. The language integrates various software development paradigms into a coherent whole to fit specific needs of developing organizations. This paper shows how to write reusable specifications in TUG. Compared to other existing specification languages, the advantages, disadvantages, limitations, and strengths of the language will be discussed. The language improves the reusability of formal specifications in the following ways: (i) A developer can run a TUG specification as a prototype to study its behavior due to its executability at the front-end of the software life cycle. (ii) A developer can easily write a parametric program corresponding to its parametric specification due to the similar semantics.
Fine-grained hidden markov modeling for broadcast-news story segmentation
Authors: Warren Greiff, Alex Morgan, Randall Fish, Marc Richards, Amlan Kundu
Venue: Proceedings of the first international conference on Human language technology research (2001)

We present the design and development of a Hidden Markov Model for the division of news broadcasts into story segments. Model topology, and the textual features used, are discussed, together with the non-parametric estimation techniques that were employed for obtaining estimates for both transition and observation probabilities. Visualization methods developed for the analysis of system performance are also presented.
The production size and inventory policy for a manufacturer in a two-echelon inventory model
Authors: Chinho Lin, Yihsu Lin
Venue: Computers and Operations Research (2005)

This paper proposes a two-echelon inventory model for a periodical commodity, in which the market and manufacturing channels are combined. This model can be used to solve the production policy, the order policies of the raw materials for the manufacturer, and order size for the retailer. By assuming that the retailers' demand obeys normal distribution and that the retailer makes orders according to the Newsboy Rule, we derive the necessary and sufficient Conditions for the optimal solution of production size, wholesale price, and replenishment cycle of raw materials for the manufacturer. Also, the necessary condition is explored in order to gain managerial insights and economic implications based on numerical examples and sensitivity analysis.
Performance Portability on EARTH: A Case Study across Several Parallel Architectures
Authors: Weirong Zhu, Yanwei Niu, Guang R. Gao
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

With the rapidly increasing diversity of parallel architectures and the increasing time and labor for developing parallel applications, the performance portability of parallel programs is becoming increasingly important and should be considered when designing parallel execution models, APIs, and runtime system software. This paper analyzes both code portability and performance portability of parallel programs based on the EARTH model - an event-driven fine-grain multi-threaded execution and architecture model. We discuss several design considerations of the EARTH system that contribute to the performance portability of parallel applications. Experiments of four representative benchmarks are conducted on several different parallel architectures, including two clusters listed in the 23rd supercomputer TOP500 list. The results demonstrate that EARTH based programs can achieve robust performance portability across the selected hardware platforms without any code modification or tuning.
An improvement of the energy function
Authors: Konstantinos Drakakis, Dragan Radulović
Venue: Signal Processing (2005)

We propose an alternative definition/method of computation of the energy function of a stationary time series, which yields more reliable results than the traditional one. We also propose the more intuitively appealing averaging function, a simple renormalization of the energy function.
A Data-Re-Distribution Library for Multi-Processor Task Programming
Authors: Thomas Rauber, Gudula Runger
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

Multiprocessor task (M-task) programming is a suitable parallel programming model for coding application problems with an inherent modular structure. An M-task can be executed on a group of processors of arbitrary size, concurrently to other M-tasks of the same application program. The data of a multiprocessor task program usually include composed data structures, like vectors or arrays. For distributed memory machines or cluster platforms, those composed data structures are distributed within one or more processor groups. Thus, a concise parallel programming model for M-tasks requires a standardized distributed data format for composed data structure. Additionally, functions for data-re-distribution with respect to different data distribution and processor group layouts are needed to glue program parts together. In this paper, we present a data-re-distribution library which extends the M-task programming with Tlib, a library providing operations to split processor groups and map M-tasks to processor groups.
Cockpit Display Using Tactile Sensation
Authors: Takuya Nojima, Kohei Funabiki
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A new cockpit display system using tactile information was proposed. A 6x4 pin-array-type tactile display device was mounted on an aircraft control stick, and provides a pilot with altitude tracking cue. Results of preliminary pilot-in-the-loop simulation demonstrated that this system could support a pilot in maintaining an assigned altitude with only partial reference to altitude and/or vertical speed instrument indications.
Calculator problem and the design recipe
Authors: Viera K. Proulx, Tanya Cashorali
Venue: ACM SIGPLAN Notices (2005)

This paper presents an alternative --- and what we believe a superior --- approach to designing a solution to the calculator problem due to Alphonce [1]. While Alphonce presents a fictitious one-act play between professors, this paper consists of a narrative explanation of the Java code written by this paper's coauthor, - a student who just completed the freshman year.The purpose of this paper is to illustrate the use of the DESIGN RECIPE pedagogy and the idea of focusing on the design of the structure of data, the classes, and class hierarchies, rather than the design of program actions (the algorithmics) as the core idea for program design. By contrasting the pedagogical approach and the final outcome with the "traditional" objects-first approach, we illustrate the advantages of our curriculum that teaches the students how to think about program design in a truly object-oriented style.
Grid computing and active services: Research Articles
Authors: B. Schulze, E. R. M. Madeira
Venue: Concurrency and Computation: Practice Experience (2004)

Recent activities in Grid computing point in the direction of an open service architecture merging computational infrastructure with Grid services and Web services. We also see advantages in adding facilities offered by distributed object computing environments with their interoperable references and services. The use of open service architectures introduces the possibility of composing structures of nested services. In this paper we discuss architectural aspects of middleware for Grid computing based on an infrastructure of distributed clusters and&#x002F;or also services, and an access portal as a demonstration project in progress. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A simple linear time algorithm for cograph recognition
Authors: Michel Habib, Christophe Paul
Venue: Discrete Applied Mathematics (2005)

In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very simple test algorithm is provided to check whether the given graph is a cograph, using a single sweep of the permutation obtained in the first step.
Innovation for a human-centered network: NTT's R D activities for achieving the NTT group's medium-term management strategy
Authors: Yuji Inoue
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

This talk presents NTT's approach for realizing a Human-Centered Network. Last November, we announced the NTT Group's Medium-Term Management Strategy, which consists of three management objectives: (1) building the ubiquitous broadband market and helping achieve the e-Japan Strategy and the u-Japan Initiative; (2) building a safe, secure, and convenient communications network environment and broadband access infrastructure, while achieving a seamless migration from the legacy telephone network to the next generation network; and (3) striving to increase corporate value and achieve sustainable growth. Since the management strategy takes account of Japan's future social issues such as declining birthrate and aging population, the need to reduce the environmental load, etc, we believe that the R&D activities directed towards accomplishing these objectives consequently lead to the realization of a Human-Centered Network.