ppxscal/embedding_network huggingface dataset:
Book Reviews
Authors: Benjamin Lev, Frederic H. Murphy, Bruce W. Fowler
Venue: Interfaces (2000)

The range of books reviewed is wide, covering theory and applications in operations research, statistics, management science, econometrics, mathematics, computers, and information systems (no software is reviewed). In addition, we include books in other fields that emphasize technical applications. Publishers who wish to have their books reviewed should send them to Professor Benjamin Lev. We list the books received; not all books received can be reviewed because space and time are limited. Those who would like to review books are urged to send me their names, addresses, and specific areas of expertise. We commission all reviews and do not accept unsolicited book reviews. Readers are encouraged to suggest books that might be reviewed or to ask publishers to send me copies of such books.
Performance Prediction with Benchmaps
Authors: Sivan Toledo
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Benchmapping is a performance prediction method for data-parallel programs that is based on modeling the performance of runtime systems. This paper describes a benchmapping system, called BenchCvl, that predicts the running time of data-parallel programs written in the NESL language on several computer systems. BenchCvl predicts performance using a set of more than 200 parameterized models. The models quantify the cost of moving data between processors, as well as the cost of moving data within the local memory hierarchy of each processor. The parameters for the models are automatically estimated from measurements of the execution time of runtime system calls on each computer system.
Multi-objective circuit partitioning for cutsize and path-based delay minimization
Authors: Cristinel Ababei, Navaratnasothie Selvakkumaran, Kia Bazargan, George Karypis
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper we present multi-objective hMetis partitioning for simultaneous cutsize and circuit delay minimization. We change the partitioning process itself by introducing a new objective function that incorporates a truly path-based delay component for the most critical paths. To avoid semi-critical paths from becoming critical, the traditional slack based delay component is also included in the cost function. The proposed timing driven partitioning algorithm is built on top of the hMetis algorithm, which is very efficient. Simulations results show that 14% average delay improvement can be obtained. Smooth trade-off between cutsize and delay is possible in our algorithm.
Philip M. Morse and the Beginnings
Authors: John D. C. Little
Venue: Operations Research (2002)

Morse was the many-sided founding father of operations research in the United States. Following his pioneering wartime effort, he vigorously promoted the nonmilitary development of the field. A glimpse into his activities and accomplishments helps explain the vitality and high intellectual standards of the field.
Hidden Tree Markov Models for Document Image Classification
Authors: Michelangelo Diligenti, Paolo Frasconi, Marco Gori
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Classification is an important problem in image document processing and is often a preliminary step toward recognition, understanding, and information extraction. In this paper, the problem is formulated in the framework of concept learning and each category corresponds to the set of image documents with similar physical structure. We propose a solution based on two algorithmic ideas. First, we obtain a structured representation of images based on labeled XY-trees (this representation informs the learner about important relationships between image subconstituents). Second, we propose a probabilistic architecture that extends hidden Markov models for learning probability distributions defined on spaces of labeled trees. Finally, a successful application of this method to the categorization of commercial invoices is presented.
Modelling architectures for dynamic systems
Authors: Peter Henderson
Venue: Programming methodology (2003)

A dynamic system is one that changes its configuration as it runs. It is a system into which we can drop new components that then cooperate with the existing ones. We are concerned with formally defining architectures for such systems and with realistically validating designs for applications that run on those architectures. We describe a generic architecture based on the familiar registry services of CORBA, DCOM and Jini. We illustrate this architecture by formally describing a simple point-of-sale system built according to this architecture. We then look at the sorts of global properties that a designer of applications would wish a robust system to have and discuss variations on the architecture which make validation of applications more practical.
Walking the Web of Trust
Authors: Germano Caronni
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

Most currently deployed Public Key Infrastructures (PKIs) are hierarchically oriented and rely on a centralized design. Hierarchical PKIs may be appropriate solutions for many usage-scenarios, but there exists the viable alternative of the 'Web of Trust'. In a web of trust, each user of the system can choose for himself whom he elects to trust, and whom not. After contrasting the properties of web-of-trust based PKIs to those of hierarchical PKIs, an introduction to webs of trust and to quantitative trust calculations is given. The paper concludes with the presentation of an efficient, sub-exponential algorithm that allows heuristic computations of trust paths in a web of trust.
Software architecture supporting integrated real-time systems
Authors: Daeyoung Kim, Yann-Hang Lee, Mohamed Younis
Venue: Journal of Systems and Software (2003)

To achieve reliability, reusability, and cost reduction, a significant trend in building large complex real-time systems is to integrate separate application modules of different criticalities in a common hardware platform. An essential requirement of integrated real-time systems is to guarantee spatial and temporal partitioning among applications in order te ensure an exclusive access of physical and temporal resources to the applications. In this paper we propose software architecture, implemented as SPIRIT-µKernel, for strongly partitioned integrated real-time systems. The SPIRIT-µKernel has been designed and implemented based on a two-level hierarchical scheduling methodology such that the real-time constraints of each application can be guaranteed. To demonstrate the feasibility of the SPIRIT-µKernel, we have ported two real-time operating systems (RTOS), WindRiver's VxWorks and Cygnus's eCos, on the top of the microkernel. Thus, different RTOS can be applied in various partitions to provide required features for each application. Based on the measured performance results, the SPIRIT-µKernel architecture is practical and appealing due to its low overheads of kernel services and the support for dependable integration of real-time applications via scheduling algorithm.
Incremental behaviour of hyperelastic dielectrics and piezoelectric crystals
Authors: Eveline Baesu, Danielle Fortune, Eugen Soós
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2003)

The equations describing the behaviour of a hyperelastic dielectric under pre-existing mechanical and electrical fields are derived. The associated differential system is shown to be self-adjoint. This property, in turn, is used to establish the equivalence of linear static and dynamic stability criteria.
From university wide outcomes to course embedded assessment of CS1
Authors: Deborah Whitfield
Venue: Journal of Computing Sciences in Colleges (2003)

This paper discusses the implementation of course embedded assessment in CS 1. Each programming assignment is assessed using criteria that are linked to course objectives. These course objectives are linked to Computer Science degree outcomes which are linked to University Wide Outcomes. The results of student surveys of CS1/CS2 are given along with the results of the course embedded assessment of programming assignments.
Optimizing the energy consumed by secure wireless sessions: wireless transport layer security case study
Authors: Ramesh Karri, Piyush Mishra
Venue: Mobile Networks and Applications (2003)

In this paper we identified the various sources of energy consumption during the setup, operation and tear down of a secure wireless session by considering the wireless transport layer security protocol. Our analysis showed that data transfers during a secure wireless transaction, number and size of messages exchanged during secure session establishment and cryptographic computations used for data authentication and privacy during secure data transactions in that order are the main sources of energy consumption during a secure wireless session. We developed techniques based on information compression, session negotiation protocol optimization and hardware acceleration of crypto-mechanisms to reduce the energy consumed by a secure session. A mobile test bed was developed to verify our energy management schemes and to study the energy consumption versus security tradeoffs. Using our proposed schemes we were able to reduce the session establishment energy by more than 6. 5x and the secure data transaction energy by more than 1. 5x during data transmission and by more than 2. 5x during data reception.
The programming language concurrent Pascal
Authors: Per Brinch Hansen
Venue: The origin of concurrent programming: from semaphores to remote procedure calls (2002)

The paper describes a new programming language for structured programming of computer operating systems. It extends the sequential programming language Pascal with concurrent programming tools called processes and monitors. Part I explains these concepts informally by means of pictures illustrating a hierarchical design of a simple spooling system. Part II uses the same example to introduce the language notation. The main contribution of Concurrent Pascal is to extend the monitor concept with an explicit hierarchy of access rights to shared data structures that can be stated in the program text and checked by a compiler.
Dynamic Routing for Priority Shipments in LTL Service Networks
Authors: Raymond K. Cheung, B. Muralidharan
Venue: Transportation Science (2000)

Currently, less-than-truckload (LTL) carriers route both the regular and the priority shipments through their service networks using some fixed route patterns, known as load plans. In this paper, we consider an alternative strategy for routing priority shipments in LTL networks. This strategy exploits the stochasticity and dynamism embedded in the routing process where the real-time information at the current terminal (such as the loading status of trailers and the arrival of shipments) and the expected travel times from its neighboring terminals to the destination are used to route shipments adaptively. We show that this strategy can be approximated by the problem of finding dynamic shortest paths over a network with random arc costs. We develop an efficient algorithm to compute the expected travel times of these paths. These times can then be used when we implement the proposed strategy. In the numerical testing with real data, we observe that the level of service for priority shipments can be improved significantly.
A Novel Low-Cost Multi-Mode Reed Solomon Decoder Design Based on Peterson-Gorenstein-Zierler Algorithm
Authors: Huai-Yi Hsu, Sheng-Feng Wang, An-Yeu (Andy) Wu
Venue: Journal of VLSI Signal Processing Systems (2003)

Reed-Solomon (RS) codes play an important role in providing error protection and data integrity. Among various Reed-Solomon decoding algorithms, the Peterson-Gorenstein-Zierler (PGZ) algorithm in general has the least computational complexity for small t values. However, unlike the iterative approaches (e.g., Berlekamp-Massey and Euclidean algorithms), it will encounter divided-by-zero problems in solving multiple t values. In this paper, we propose a multi-mode hardware architecture for error numbers ranging from zero to three. We first propose a cost-down technique to reduce the hardware complexity of a t &equals; 3 decoder. A Finite-field Inversion (FFI) elimination scheme is also proposed in our PGZ kernel. Next, we perform an algorithmic-level derivation to identify the configurable feature of our design. With those manipulations, we are able to perform multi-mode RS decoding in one unified VLSI architecture with very simple control scheme. The very low cost and simple data-path make our design a good choice in small-footprint embedded VLSI systems such as Error Control Coding (ECC) in memory/storage systems.
A model of democracy
Authors: Ubiquity staff
Venue: Ubiquity (2003)

When can you have freedom, equality, moral reciprocity and a paycheck? Brook Manville on the surprising blueprint for organizational management.
Mixed finite element modelling of cartilaginous tissues
Authors: E. F. Kaasschieter, A. J. H. Frijns, J. M. Huyghe
Venue: Mathematics and Computers in Simulation (2003)

Swelling and shrinking of cartilaginous tissues is modelled by a four-component mixture theory. This theory results in a set of coupled non-linear partial differential equations for the electrochemical potentials and the displacement. For the sake of local mass conservation these equations are discretised in space by a mixed finite element method. Integration in time by backward Euler leads to a non-linear system of algebraic equations. A subtle solution strategy for this system is proposed and tested for one-dimensional situations.
Perceived Trustworthiness Within the Organization: The Moderating Impact of Communication Frequency on Trustor and Trustee Effects
Authors: Manuel Becerra, Anil K. Gupta
Venue: Organization Science (2003)

This paper investigates the antecedents of intraorganizational trust and, more specifically, how the frequency of communication between trustor and trustee moderates the impact of these factors on perceived trustworthiness. Data on 157 dyadic relationships among 50 senior managers within a multinational corporation confirm that the effect of both trustor, as well as trustee characteristics on the level of perceived trustworthiness, is moderated by the frequency of communication between the two parties. As communication frequency increases, the trustor's general attitudinal predisposition towards peers becomes less important as a determinant of his/her evaluation of trustworthiness of other managers within the organization. In contrast, as communication frequency increases, the trustor's and trustee's contexts within the organization become more important determinants of perceived trustworthiness.
From wireless LANs to wireless network systems: applying lessons from cellular networking to enterprise wireless networking
Authors: Sandeep K. Singhal
Venue: Wireless local area networks: the new wireless revolution (2002)

Enterprises are extending their wired LAN infrastructure to support wireless connectivity, using radio standards such as IEEE 802.11b, Bluetooth, HiperLAN, and other emerging technologies. Wireless LANs give mobile users "anywhere, anytime" access to the LAN, and wireless connectivity offers lower installation and maintenance costs compared with traditional wired network infrastructure. However, to play a mission-critical role within the enterprise, wireless LANs must satisfy the security, manageability, interoperability, simplicity, seamless mobility, and application needs of network managers and end users.In this chapter, we discuss the limitations of the wireless LAN standards as implemented within access points and client adapters. To bring security, manageability, usability, and performance to the wireless LAN, enterprises require additional network infrastructure. Borrowing from the design of cellular network infrastructure, the wireless LAN system creates a corporate-wide "Mobile Domain," a secure environment for mobile users within which they can access the information and resources they need to be more productive.
Managing Redundancy in Distributed Computer Networks: a State Transition Graph Approach for the Stashing Problem
Authors: Brian Walker, Brunilde Sanso
Venue: Operations Research (1998)

Managing redundant information is becoming an important issue in today's increasingly large distributed computer networks. As total redundancy is extremely costly to achieve, it has been proposed to keep perfectly updated information only at the servers, while keeping old copies of that information on local computers. For such copies to be useful, a maximum lifetime length is assigned to them. Before the lifetime has elapsed, the local devices must be stashed with a new updated copy. The problem of optimizing the updates so that the maximum lifetime length constraints are respected has been previously formulated as a binary problem and proved to be NP-hard through a reduction to the Steiner tree problem in graphs. In this paper we explore the properties of another formulation, based on a state transition graph approach. We prove that only a subset of states and transitions will be in the optimal solution and that, thanks to those properties, it is possible to greatly reduce the size of the graph. A solution algorithm that is based on an efficient evaluation of similar Steiner tree problems with similar properties is presented. We discuss extensions of this problem to future applications of broadband multicast services.
Data Mining by Decomposition: Adaptive Search for Hypothesis Generation
Authors: Hemant K. Bhargava
Venue: INFORMS Journal on Computing (1999)

Data mining methods search large databases for interesting patterns that may lead to useful decisions in organizations. When the database is defined over scores of attributes, the complexity of the search increases due to the combinatorial explosion at the attribute-space level, because billions of attribute subsets are candidates for forming interesting patterns in the database. A useful way to address this complexity is to partition the search problem and apply separate, but intertwined, algorithms for attribute search and pattern search. A genetic algorithm is applied on the attribute search problem to identify subsets that lead to more interesting patterns. This method is applied on a real world database arising from the investigations into the "Persian Gulf Illness." Computational experiments resulted in significant success compared to random or manual attribute selection.
Where Does Computational Media Aesthetics Fit?
Authors: Brett Adams
Venue: IEEE MultiMedia (2003)

The huge volume of multimedia data now availablecalls for effective management solutions.Computational media aesthetics, one response to thisdata-management problem, attempts to handlemultimedia data using domain-driven inferences. Toprovide a context for CMA, this article reviewsmultimedia content management research.
Implementation of three robotic control architectures for robot navigation
Authors: Mario Garcia
Venue: Journal of Computing Sciences in Colleges (2003)

In this paper three simple robotic control architectures for the safe navigation across a small room with static obstructions will be implemented. The first system is to be deliberative. It is to have a method for storing the room information, determining an appropriate path across the room, and executing the determined solution. The second system is to be reactive. It will have no knowledge of the room. Instead it will use its sensors and a set of rules to safely navigate across the room. The last system is to make use of a neural network in determining the navigation path.
The perils of the extrapolated technologist, or, the advantages of a contrarian career investment strategy
Authors: Espen Andersen
Venue: Ubiquity (2002)

Contrary to what you think, now is the time to study IT. Just make sure you are interested in the content of the field rather than its future trappings.
SPI: a system model for heterogeneously specified embedded systems
Authors: Dirk Ziegenbein, Kai Richter, Rolf Ernst, Lothar Thiele, Jürgen Teich
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

Embedded systems typically include reactive and transformative functions, often described in different languages and semantics which are well established in their respective application domains. Additionally, a large part of the system functionality and components is reused from previous designs including legacy code. There is little hope that a single language will replace this heterogeneous set of languages. A design process must be able to bridge the semantic differences for verification and synthesis and should account for limited knowledge of system properties. This paper presents the system property intervals (SPI) model, which employs behavioral intervals and process modes to allow the common representation of different languages and semantics. This model is the basis of a workbench which is targeted at the design of heterogeneously specified embedded systems.
Discrete-time deterministic and stochastic models for the spread of rabies
Authors: Linda J. S. Allen, David A. Flores, Ruwan K. Ratnayake, John R. Herbold
Venue: Applied Mathematics and Computation (2002)

Discrete spatial and temporal models for the spread and control of rabies are developed, analyzed and simulated. First, a deterministic model is formulated, then an analogous stochastic model. The models are structured with respect to space (m patches), age (juveniles and adults) and disease state. For each patch there are six state variables corresponding to either juveniles or adults and their disease state: susceptible, infected, or vaccinated. The models have seven stages which repeat every year. The impact of different vaccination strategies on the dynamics of the deterministic and stochastic models are compared. In particular, the relationships among the vaccination proportion, the width of the vaccination barrier, the initial number infected, and the transmissibility of the disease are examined. An estimate for the probability of disease elimination is given for the stochastic model. It is shown that in some cases where the deterministic model predicts disease persistence, the stochastic model predicts a high probability of disease elimination.
Managing Exceptionally
Authors: Henry Mintzberg
Venue: Organization Science (2001)

This paper is about two managers of Red Cross refugee camps in Tanzania who manage by exception in rather exceptional circumstances. Using a model of managerial work that delineates roles carried out at the information, people, and action levels, inside and outside the unit, these managers' activities concentrate especially on communicating and controlling a chaotic situation in a steady state, at least temporarily. While many other managers appear to be moving away from conventional forms of managing--to more linking instead of leading and convincing instead of controlling, etc.--here are two managers who seem to be going the other way, precisely because their situation is so unconventionally risky. Ned Bowman's great contribution has been not justabout risks and options per se, butin the risks that he himself took and the options that he himself exposed. In this spirit, the paper concludes with a plea for the opening up not simply of content, but of context.