ppxscal/embedding_network huggingface dataset:
An Analysis of Several New Product Performance Metrics
Authors: Morris A. Cohen, Jehoshua Eliashberg, Teck H. Ho
Venue: Manufacturing Service Operations Management (2000)

For most firms, new product development is the engine for growth and profitability. A firm's new product success depends on its ability to manage the product development process in a way that employs scarce resources to achieve the goal of the firm as well as the specific project's objectives. Simple and measurable performance metrics have been proposed and applied to monitor and compensate the development teams. In this paper, we develop a modeling frame work to analyze the implications of setting managerial priorities for three commonly used new product performance metrics: (1) time-to-market, (2) product performance, and (3) total development cost. We model new product development as a "product performance production" process that requires scarce development resources. Setting a target for development teams for each of these performance metrics can constrain this performance production process and, thereby, affect the other performance metrics. We model the constrained process as a restricted case of a general process that does not have such constraints. We benchmark each constrained process against the optimal, unrestricted process with respect to the level of the resource intensity employed during the development process, the time-to-market, and the performance level of the new product at launch. We show that an overly ambitious time-to-market target leads to an upward bias in resource intensity usage and a downward bias in product performance (i.e., evolutionary product innovation). In addition, our results suggest that the target time-to-market approach may ignore the effect of cannibalization and, thus, can perform suboptimally if a significant degree of cannibalization in the existing product market is expected. Given a target product performance, we show that the coordination between marketing and R&D is easier because the resulting development resource intensity and time-to-market decisions becomes separable. However, an overly ambitious product performance target leads to an upward bias in the development resource intensity and a delayed product launch that misses the window of opportunity. Finally, we show that the target development cost approach can lead a downward bias in product performance and a premature product launch. The above analyses are performed for a monopolistic firm, and they are extended to passive and active competitive environment.
On solving periodically perturbed nonconservative systems with a one-parameter embedding
Authors: G. Liu, D. Fu, Z. Shen
Venue: Computing (2002)

The paper is concerned with solving the periodically perturbed nonconservative systems, which will be differentiably imbedded into an one-parameter family of operators. The solution of the systems is then found by continuing the solution curve of operator homotopy. When the Newton-Kantorovich's procedure is applied to the corresponding operator equations, an efficient algorithm is derived. Furthermore, the suitable condition on the optimum step size of the parameter is provided for assuring that the approximation solution will converge to the unique solution of the nonlinear periodically boundary value problem. Finally, the theoretical results are in excellent agreement with the numerical examples.
Efficient channel allocation tree generation for data broadcasting in a mobile computing environment
Authors: Wen-Chih Peng, Ming-Syan Chen
Venue: Wireless Networks (2003)

The research issue of broadcasting has attracted a considerable amount of attention in a mobile computing system. By utilizing broadcast channels, a server continuously and repeatedly broadcasts data to mobile users. These broadcast channels are also known as "broadcast disks" from which mobile users can retrieve data. Using broadcasting, mobile users can obtain the data of interest efficiently and only need to wait for the required data to present on the broadcast channel. The issue of designing proper data allocation in the broadcast disks is to reduce the average expected delay of all data items. We explore in this paper the problem of generating hierarchical broadcast programs with the data access frequencies and the number of broadcast disks in a broadcast disk array given. Specifically, we first transform the problem of generating hierarchical broadcast programs into the one of constructing a channel allocation tree with variant-fanout. By exploiting the feature of tree generation with variant-fanout, we develop a heuristic algorithm VFK to minimize the expected delay of data items in the broadcast program. In order to evaluate the solution quality obtained by algorithm VFK and compare its resulting broadcast program with the optimal one, we devise an algorithm OPT based on a guided search to obtain the optimal solution. Performance of these algorithms is comparatively analyzed. Sensitivity analysis on several parameters, including the number of data items and the number of broadcast disks, is conducted. It is shown by our simulation results that by exploiting the feature of variant-fanout in constructing the channel allocation tree, the solution obtained by algorithm VFK. is of very high quality and is in fact very close to the optimal one resulted by algorithm OPT. Moreover, algorithm VFK is of very good scalability which is important for algorithm VFK to be of practical use to generate hierarchical broadcast programs dynamically in a mobile computing environment.
A compositional formalism for object viewpoints
Authors: Einar Broch Johnsen, Olaf Owe
Venue: Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V (2002)

Aspect-oriented approaches have recently been proposed to address the problem of specifying dynamic object-based systems, by depicting the various roles of the objects separately. In this paper, we consider an approach based on the observable behavior of objects and propose a specification formalism for reusable object interfaces with input/output-driven assumption-guarantee predicates. The formalism supports compositional reasoning and exchange of object identities between objects in an environment where the number of objects is unbounded.
Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm
Authors: Michaël Rusinowitch, Sorin Stratulat, Francis Klay
Venue: Journal of Automated Reasoning (2003)

The Available Bit Rate protocol (ABR) for ATM networks is well adapted to data traffic by providing minimum rate guarantees and low cell loss to the ABR source end system. An ABR conformance algorithm for controlling the source rates through an interface has been defined by ATM Forum, and a more efficient version of it has been designed by Rabadan and Klay. We present in this work the first complete mechanical verification of the equivalence between these two algorithms. The proof is involved and has been supported by the PVS theorem prover. It has required many lemmas, case analysis, and induction reasoning for the manipulation of unbounded scheduling lists. Some ABR conformance protocols have been verified in previous works. However, these protocols are approximations of the one we consider here. In particular, the algorithms assume a bound on the number of rates to be scheduled.
NAMD: biomolecular simulation on thousands of processors
Authors: James C. Phillips, Gengbin Zheng, Sameer Kumar, Laxmikant V. Kalé
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

NAMD is a fully featured, production molecular dynamics program for high performance simulation of large biomolecular systems. We have previously, at SC2000, presented scaling results for simulations with cutoffelectrostatics on up to 2048 processors of the ASCI Red machine, achieved with an object-based hybrid force and spatial decomposition scheme and an aggressive measurement-based predictive load balancing framework. We extend this work by demonstrating similar scaling on the much faster processors of the PSC Lemieux Alpha cluster, and for simulations employing efficient (order N log N) particle mesh Ewald full electrostatics. This unprecedented scalability in a biomolecular simulation code has been attained through latency tolerance, adaptation to multiprocessor nodes, and the direct use of the Quadrics Elan library in place of MPI by the Charm++/Converse parallel runtime system.
Approximation algorithms for the maximum satisfiability problem
Authors: Takao Asano, Takao Ono, Tomio Hirata
Venue: Nordic Journal of Computing (1996)

The maximum satisfiability problem (MAX SAT) is the following: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present approximation algorithms for MAX SAT, including a 0.76544-approximation algorithm. The previous best approximation algorithm for MAX SAT was proposed by Goemans-Williamson and has a performance guarantee of 0.7584. Our algorithms are based on semidefinite programming and the 0.75-approximation algorithms of Yannakakis and Goemans-Williamson.
Compiling for instruction cache performance on a multithreaded architecture
Authors: Rakesh Kumar, Dean M. Tullsen
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Instruction cache aware compilation seeks to lay out a program in memory in such a way that cache conflicts between procedures are minimized. It does this through profile-driven knowledge of procedure invocation patterns. On a multithreaded architecture, however, more conflicts may arise between threads than between procedures on the same thread. This research examines opportunities for the compiler to optimize instruction cache layout on a multithreaded architecture. We examine scenarios where (1) the compiler has knowledge, about multiple programs that will be or are likely to be co-scheduled, and where (2) the compiler has no knowledge at compile time of which applications will be co-scheduled. We present solutions for both environments.
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
Authors: Knut Haase, Guy Desaulniers, Jacques Desrosiers
Venue: Transportation Science (2001)

This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single depot case with a homogeneous fleet of vehicles. This approach relies on a set partitioning formulation for the driver scheduling problem that incorporates side constraints for the bus itineraries. The proposed solution approach consists of a column generation process (only for the crew schedules) integrated into a branch-and-bound scheme. The side constraints on buses guarantee that an optimal vehicle assignment can be derived afterwards in polynomial time. A computational study shows that this approach out-performs the previous methods found in the literature for a set of randomly generated instances. A heuristic version of the solution approach is also proposed and tested on larger instances.
Proctor Assignment at Carleton University
Authors: Rania M. Awad, John W. Chinneck
Venue: Interfaces (1998)

Carleton University needs proctors during examination sessions to oversee the students as they write their final examinations. The process of assigning proctors to examinations is quite complex because of the sheer number of examinations and various complex constraints on allowable assignments. We developed a computer-based system to replace an existing manual system for assigning proctors, freeing up valuable staff time in the overloaded scheduling office. Our system combines some problem-specific heuristics, a genetic-algorithm framework, and a simple user interface based on readily available software tools.
Reconceptualizing the Context-Design Issue for the Information Systems Function
Authors: Carol V. Brown, Sharon L. Magill
Venue: Organization Science (1998)

The authors develop theory for predicting the distribution of decision making between the corporate and business-unit levels of management for a subset of information systems (IS) resources referred to as systems development. Drawing on literature from the fields of MIS, strategic management, and organization theory, they first determine how potentially influential context factors are likely to affect the locus of the lead decision making role from a multiple-contingencies perspective. Then they theorize how conflicting corporate and business-unit contingencies are likely to be resolved. They present a set of six propositions that predict a centralized, decentralized, or compromise design solution for a given business unit on the basis of (1) business-level strategy, (2) whether or not information technology (IT) plays a strategic role for the business unit, (3) the degree of line managers' IT knowledge at the business-unit level, and (4) the level at which opportunities for IT-related synergies across business units are being pursued at the corporate level.
The evaluation of adaptive systems
Authors: Judith Masthoff
Venue: Adaptive evolutionary information systems (2003)

This chapter discusses the evaluation of adaptive systems, as it is important to investigate the effectiveness of adaptation and how it may be optimised. It argues that evaluation is often neglected because of difficulties in attributing cause, defining effectiveness, obtaining significant results and getting resources. Using example evaluations of an interactive instruction system, it shows how these issues can be tackled by separating concerns, using learning curves, splitting subjects into groups, and using experts and models instead of subjects. The author hopes that these methods will be more widely adopted for evaluating adaptive systems (not just adaptive instruction systems), producing more insight in experimental data and its causes, delivering more significant results, and making evaluations less costly.
Construction of Kn-minor free graphs with given circular chromatic number
Authors: Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu
Venue: Discrete Mathematics (2003)

For each integer n ≥ 5 and each rational number r in the interval [2, n - 1], we construct a Kn-minor free graph G with χc(G) = r. This answers a question asked by Zhu (Discrete Mathematics, 229 (1-3) (2001) 371). In case n = 5, the constructed graphs are actually planar. Such planar graphs were first constructed in J. Graph Theory 24 (1997) 33 (for ∈ [2,3]) and in J. Combin. Theory 76 (1999) 170 (for r ∈ [3,4]). However, our construction and proof are much simpler.
Medical informatics and bioinformatics: European efforts to facilitate synergy
Authors: Victor Maojo, Ilias Iakovidis, Fernando Martin-Sanchez, Jose Crespo, Casimir Kulikowski
Venue: Computers and Biomedical Research (2001)

Over the past decade there have been several attempts to rethink the basic strategies and scope of medical informatics. Meanwhile, bioinformatics has only recently experienced a similar debate about its scientific character. Both disciplines envision the development of novel diagnostic, therapeutic, and management tools, and products for patient care. A combination of the expertise of medical informatics in developing clinical applications and the focused principles that have guided bioinformatics could create a synergy between the two areas of application. Such interaction could have a great influence on future health research and the ultimate goal, namely continuity and individualization of health care. This article summarizes current activities related to facilitating synergy between medical informatics and bioinformatics, emphasizing activities in Europe while relating them to efforts in other parts of the world. The report provides examples of the analysis that European investigators are carrying out, aiming to propose new ideas for collaborations between medical informatics and bioinformatics researchers in a variety of areas.
DVQ: Towards Visual Query Processing of XML Database Systems
Authors: Shihui Zheng, Aoying Zhou, Long Zhang, Hongjun Lu
Venue: World Wide Web (2003)

XML has been recognized as a promising language for data exchange over the Internet. A number of query languages have been proposed for querying XML data. Most of those languages are path-expression based. One difficulty in forming path-expression based queries is that users have to know the structure of XML data against which the queries were issued. In this paper, we describe a DTD-driven visual query interface for XML database systems. With such an interface, a user can easily form path-expression based queries by clicking elements in the DTD tree displayed on the screen and supplying conditions if necessary. The interface and the query generation process are described in detail.
Spatial decision support systems
Authors: Peter B. Keenan
Venue: Decision making support systems: achievements, trends and challenges for (2002)

Many types of challenging problems faced by decision makers have a geographic or spatial component. Spatial decision support systems (SDSS) can effectively support this class of problem. This represents a growing class of DMSS, taking advantage of the increasing capability of technology to deal with spatial data. SDSS is characterized by the use of significant amounts of public data external to the organizations that use it and the increasing availability of such spatial data facilities wider use of such systems. This chapter describes spatial systems, their history, their relationship to other systems, their mean areas of application and their future development.
Stamp out technology virginity
Authors: Espen Andersen
Venue: Ubiquity (2002)

Technology virginity and technology virgins are everywhere -- and more influential than you might like. Time to go on the offensive.
On weak solutions for generalized Oldroyd model for laminar and turbulent flows of nonlinear viscous-elastic fluid
Authors: Vladimir T. Dmitrienko, Mokhtar Kirane, Victor G. Zvyagin
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We consider the statement of an initial-boundary value problem for a generalized Oldroyd model describing both laminar and turbulent motions of a nonlinear viscous-elastic fluid. The operator interpretation of a posed problem is presented. The properties of operators forming the corresponding equations are investigated. We introduce approximating equations and prove their solvability. On that base the existence theorem for the operator equation equivalent to the stated initial-boundary value problem is proved.
ATPG-based logic synthesis: an overview
Authors: Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The ultimate goal of logic synthesis is to explore implementation flexibility toward meeting design targets, such as area, power, and delay. Traditionally, such flexibility is expressed using "don't cares" and we seek the best implementation that does not violate them. However, the calculation and storing of don't care information is CPU and memory-intensive. In this paper, we give an overview of logic synthesis approaches based on techniques developed for Automatic Test Pattern Generation (ATPG). Instead of calculating and storing don't cares explicitly, ATPG-based logic synthesis techniques calculate the flexibility implicitly. Low CPU and memory usage make those techniques applicable for practical industrial circuits. Also, the basic ATPG-based logic level operations create predictable, small layout perturbations, making an ideal foundation for efficient physical synthesis. Theoretical results show that an efficient, yet simple add-a-wire-and-remove-a-wire operation covers all possible complex logic transformations.
Immersive and interactive exploration of billion-atom systems
Authors: Ashish Sharma, Aiichiro Nakano, Rajiv K. Kalia, Priya Vashishta, Sanjay Kodiyalam, Paul Miller, Wei Zhao, Xinlian Liu, Timothy J. Campbell, Andy Haas
Venue: Presence: Teleoperators and Virtual Environments (2003)

We have developed a visualization system, named Atomsviewer, to render a billion atoms from the results of a molecular dynamics simulation. This system uses a hierarchical view frustum culling algorithm based on the octree data structure to efficiently remove atoms that are outside of the field of view. A novel occlusion culling algorithm, using a probability function, then selects atoms with a high probability of being visible. These selected atoms are further tested with a traditional occlusion culling algorithm before being rendered as spheres at varying levels of detail. To achieve scalability, Atomsviewer is distributed over a cluster of PCs that execute a parallelized version of the hierarchical view frustum culling and the probabilistic occlusion culling, and a graphics workstation that renders the atoms. We have used Atomsviewer to render a billion-atom data set on a dual processor SGI Onyx2 with an InfiniteReality2 graphics pipeline connected to a four-node PC cluster.
Guaranteed cost stabilization of neutral differential systems with parametric uncertainty
Authors: Ju H. Park
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we address the problem of the guaranteed cost stabilization for a class of neutral systems with parametric uncertainties and a given quadratic cost function. The parametric uncertainties are real time-varying norm bounded and state delay is a constant. The problem is to design the state feedback control laws such that the closed-loop system is asymptotically stable and the closed-loop cost function value is not more than a specified upper bound for all admissible uncertainty and delay. Two criteria for the existence of such controllers are derived based on the matrix inequality approach combined with the Lyapunov method. The developed guaranteed cost controllers can be synthesized in terms of the feasible solutions to the certain matrix inequalities.
Hacking primes
Authors: Patrick Amato
Venue: Ubiquity (2003)

Visualization of prime numbers may further the understanding and safeguarding of encryption techniques.
The Solo operating system: processes, monitors and classes
Authors: Per Brinch Hansen
Venue: The origin of concurrent programming: from semaphores to remote procedure calls (2002)

This paper describes the implementation of the Solo operating system written in Concurrent Pascal. It explains the overall structure and details of the system in which concurrent processes communicate by means of a hierarchy of monitors and classes. The concurrent program is a sequence of nearly independent components of less than one page of text each. The system has been operating since May 1975.