ppxscal/embedding_network huggingface dataset:
Measuring Efficiency by Product Group: Integrating Dea with Activity-Based Accounting in a Large Mideast Bank
Authors: Jeffrey Kantor, Shlomo Maital
Venue: Interfaces (1999)

We built a method for measuring product-specific inefficiency in bank branches to facilitate precise measurement of waste and identify its causes. Our method combines and integrates two separate, widely used models for measuring costs and efficiency performance: activity-based cost accounting (ABC) and data envelopment analysis (DEA). The resulting method for activity-based management provides managers with detailed quantitative performance benchmarks for the specific business activities of their firms or divisions. We used an integrated model to create a branch profile of a large 250-branch Mideast bank that measures inefficiency separately for customer services and transactions.
An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
Authors: Gregory A. Godfrey, Warren B. Powell
Venue: Transportation Science (2002)

In a companion paper (Godfrey and Powell 2002) we introduced an adaptive dynamic programming algorithm for stochastic dynamic resource allocation problems, which arise in the context of logistics and distribution, fleet management, and other allocation problems. The method depends on estimating separable nonlinear approximations of value functions, using a dynamic programming framework. That paper considered only the case in which the time to complete an action was always a single time period. Experiments with this technique quickly showed that when the basic algorithm was applied to problems with multiperiod travel times, the results were very poor. In this paper, we illustrate why this behavior arose, and propose a modified algorithm that addresses the issue. Experimental work demonstrates that the modified algorithm works on problems with multiperiod travel times, with results that are almost as good as the original algorithm applied to single period travel times.
A LCOS microdisplay driver with frame buffer pixels
Authors: Sangrok Lee, James C. Morizio, Kristina M. Johnson
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

An 8-bit liquid crystal on silicon microdisplay driver for projection display has been designed and fabricated using AMI 0.5 µm double-poly, triple-level metal CMOS process. The driver includes frame buffering at the pixel level, which presents optimized optical characteristics for field sequential color operation, and a mixed mode gray scale method which implements distinct 256 gray levels per color with a simpler driver architecture.
Quantum Mechanical and Human Violations of Compound Probability Principles: Toward a Generalized Heisenberg Uncertainty Principle
Authors: Jinfa Chen, David D. Yao, Shaohui Zheng, Robert F. Bordley
Venue: Operations Research (1998)

A key central tenet of decision theory is that decomposing an uncertain event into sub-events should not change the overall probability assigned to that uncertain event. As we show, both quantum physics and behavioral decision theory appear to systematically violate this principle in very similar ways. These results suggest that the structuring phase of decision analysis-which specifies how various events are decomposed-helps shape the subjective probabilities which will ultimately be assigned to those events.
SPMH: a solution to the problem of malicious hosts
Authors: Chong Zhou, Yongqiang Sun
Venue: Journal of Computer Science and Technology (2002)

In this paper, a solution to the Problem of Malicious Hosts. named SPMH, is suggested. At first, Mobile Agent Blackbox Construction Method based on Loureiro's Protocol (MABCM-LP) is suggested to convert a mobile agent into a Mobile Agent Blackbox (MAB) which makes the mobile agent difficult to be understood and tampered by malicious hosts. At the same time, a Protocol Tracing the Inputs/outputs and Results (PTIR) is developed to trace the mobile agent running at a host, which can be used to detect and prove the attacks by malicious hosts. It is proved that this solution is secure, correct, and robust. It is found firstly that the detection method and the prevention method are complementary to each other, and this is the first solution that integrated both of these two methods too.
Avalanche: an environment for design space exploration and optimization of low-power embedded systems
Authors: Jörg Henkel, Yanbing Li
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

Power estimation and optimization has become a key issue in embedded system design, especially in the rapidly growing market of mobile handheld computing, communication, internet devices that are driven by battery power. It is of paramount importance to estimate and optimize power of those systems during an early design stage at a high level of abstraction in order to efficiently explore the design space and to take full advantage of the related high optimization potential.In this paper, we present Avalanche, a prototyping framework that addresses the issues of power estimation and optimization for mixed hardware and software embedded systems. Avalanche is based on a generic embedded system architecture consisting of embedded CPU, custom hardware, and a memory hierarchy. For system-level power estimation, given various system parameters like cache sizes, cache policies, and bus width, etc., Avalanche is able to rapidly evaluate/estimate power and performance and thus facilitate comprehensive design space explorations. For system-level power optimization, Avalanche offers different modes reflecting various design scenarios: if no hardware/software partitioning or only partial partitioning has been conducted, Avalanche guides the designer in finding power-aware hard-ware/software partitioning; when a system has already been partitioned, Avalanche can optimize system parameters such as cache and memory size; if system parameters and partitioning are given, Avalanche applies additional optimizations for power including source-to-source compiler transformations.Avalanche has been deployed during the design phase of real-world applications including an MPEG II encoder in a set-top box design. Extensive design space explorations in terms of power and performance could be conducted within several hours and various optimization techniques led to power reductions of up to 94% withoul performance losses and only a slight increases in total chip size (i.e., transistor count).
Evaluating Income Streams: a Decision Analysis Approach
Authors: Gonzalo Cortazar, Eduardo S. Schwartz, Marcelo Salinas, James E. Smith
Venue: Management Science (1998)

Most important decision problems-virtually all capital investiments and planning situations-involve risky cash flows with uncertainties that are resolved over time. In most of these problems, the decision-maker has access to financial markets and may borrow and lend to smooth consumption over time. Yet, because of the difficulty of incorporating these borrowing and lending decisions into the evaluation models, these opportunities are rarely explicitly modeled in decision and risk analyses of these investments. In this paper, we study the errors induced by failing to account for these borrowing and lending decisions, and we develop extensions to the standard decision and risk analysis procedures that, given certain market and preference assumptions, take these borrowing and lending opportunities into account without overburdening the evaluation models.
A graphical &#x00B5;-calculus and local model checking
Authors: Huimin Lin
Venue: Journal of Computer Science and Technology (2002)

A graphical notation for the propositional µ-calculus, called modal graphs, is presented. It is shown that both the textual and equational presentations of the µ-calculus can be translated into modal graphs. A model checking algorithm based on such graphs is proposed. The algorithm is truly local in the sense that it only generates the parts of the underlying search space which are necessary for the computation of the final result. The correctness of the algorithm is proven and its complexity analysed.
Polymorphic directional types for logic programming
Authors: Pawel Rychlikowski, Tomasz Truderung
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe [16], and the complementary system of directional types that has been proposed by Aiken and Lakshman [1].Our main technical inventions are a new method of deriving more specific types from a given type, which we call pruning, and the notion of the main type from which, using a combination of substitution, subtyping and pruning all types of a predicate can be obtained.We describe a type checking algorithm, and a type reconstruction algorithm which for a given program and a predicate finds its main type. A complexity analysis of these algorithms is provided. In spite of large theoretical complexity bounds these algorithms work quite fast in practice.
Efficiently publishing relational data as XML documents
Authors: Jayavel Shanmugasundaram, Eugene Shekita, Rimon Barr, Michael Carey, Bruce Lindsay, Hamid Pirahesh, Berthold Reinwald
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2001)

XML is rapidly emerging as a standard for exchanging business data on the World Wide Web. For the foreseeable future, however, most business data will continue to be stored in relational database systems. Consequently, if XML is to fulfill its potential, some mechanism is needed to publish relational data as XML documents. Towards that goal, one of the major challenges is finding a way to efficiently structure and tag data from one or more tables as a hierarchical XML document. Different alternatives are possible depending on when this processing takes place and how much of it is done inside the relational engine. In this paper, we characterize and study the performance of these alternatives. Among other things, we explore the use of new scalar and aggregate functions in SQL for constructing complex XML documents directly in the relational engine. We also explore different execution plans for generating the content of an XML document. The results of an experimental study show that constructing XML documents inside the relational engine can have a significant performance benefit. Our results also show the superiority of having the relational engine use what we call an &ldquo;outer union plan&rdquo; to generate the content of an XML document.
A network flow approach to memory bandwidth utilization in embedded DSP core processors
Authors: Catherine H. Gebotys
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

This paper presents a network flow approach to solving the register binding and allocation problem for multiword memory access DSP processors. In recently announced DSP processors, 16-bit instructions which simultaneously access four words from memory are supported. A polynomial-time network flow methodology is used to allocate multiword accesses, including constant data-memory layout, while minimizing code size. Results show that improvements of up to 87% in terms of memory bandwidth are obtained compared to compiler-generated DSP code. This research is important for industry since this value-added technique can improve code size and utilize higher-memory bandwidths without increasing cost.
A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming
Authors: Arjan Berkelaar, Cees Dert, Bart Oldenkamp, Shuzhong Zhang
Venue: Operations Research (2002)

Decision making under uncertainty is a challenge faced by many decision makers. Stochastic programming is a major tool developed to deal with optimization with uncertainties which has found applications in, e.g., finance, such as asset--liability and bond--portfolio management. Computationally, however, many models in stochastic programming remain unsolvable because of overwhelming dimensionality. For a model to be well solvable, its special structure must be explored. Most of the solution methods are based on decomposing the data. In this paper we propose a new decomposition approach for two-stage stochastic programming, based on a direct application of the path-following method combined with the homogeneous self-dual technique. Numerical experiments show that our decomposition algorithm is very efficient for solving stochastic programs. In particular, we apply our decomposition method to a two-period portfolio selection problem using options on a stock index. In this model the investor can invest in a money-market account, a stock index, and European options on this index with different maturities. We experiment with our model with market prices of options on the S&P500.
Evaluation of thumbwheel text entry methods
Authors: Peter Tarasewich
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Text entry becomes increasingly complex as devices shrink in size. This paper presents the findings of a comparison study of two thumbwheel text entry methods for mobile devices. In the first method, the character set (letters, numbers, punctuation) was implemented as a continuous loop. In the second method, characters were arranged in a two-level menu structure. Thumbwheel methods provide a viable and realistic alternative to keyboard, keypad, stylus, or voice text entry on ultra-small mobile devices.
Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management
Authors: John Sum, Hong Shen, Chi-sing Leung, G. Young
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

Ant routing is a method for network routing in the agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary analysis on an ant algorithm in regard to its population growing property and jumping behavior. For synchronous networks, three main results are shown. First, the expected number of agents in a node is shown to be no more than(1+\max_i\{|\Omega_i|\})km , where|\Omega_i|is the number of neighboring hosts of thei{\rm{th}}host,kis the number of agents generated per request, andmis the average number of requests. Second, the expected number of jumps of an agent is shown to be no larger than(1+\max_i\{|\Omega_i|\}) . Third, it is shown that for allp\geq (1+\max_i\{|\Omega_i|\})km , the probability of the number of agents in a node exceedingpis not greater than\int_p^\infty {\cal{P}}(x) dx , where{\cal{P}}(x)is a normal distribution function with mean and variance given by Mean =(1+\max_i\{|\Omega_i|\})km , Var. =2km (1+\max_i \{|\Omega_i|\})+{\frac{(km)^2(1+\max_i\{|\Omega_i|\})^2}{(1+2\max_i\{|\Omega_i|\})}} . The first two results are also valid for the case when the network is operated in asynchronous mode. All these results conclude that as long as the value\max_i\{|\Omega_i|\}is known, the practitioner is able to design the algorithm parameters, such as the number of agents being created for each request,k , and the maximum allowable number of jumps of an agent, in order to meet the network constraint.
Dynamic word based text compressio
Authors: K. S. Ng, L. M. Cheng, C. H. Wong
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We propose a dynamic text compression technique with a back searching algorithm and a new storage protocol. Codes being encoded are divided into three types namely copy, literal and hybrid codes. Multiple dictionaries are adopted and each of them has a linked sub-dictionary. Each dictionary has a portion of pre-defined words i.e. the most frequent words and the rest of the entries will depend on the message. A hashing function developed by Pearson (1990) is adopted. It serves two purposes. Firstly, it is used to initialize the dictionary. Secondly, it is used as a quick search to a particular word. By using this scheme, the spaces between words do not need to be considered. At the decoding side, a space character will be appended after each word is decoded. Therefore, the redundancy of space can also be compressed. The result shows that the original message will not be expanded even if we have poor dictionary design.
Integral representations and decision theory
Authors: Yasuo Narukawa, Toshiaki Murofushi, Michio Sugeno
Venue: Technologies for constructing intelligent systems: Tasks (2002)

A comonotonically additive and monotone functional (for short c.m.) on the class of continuous functions with compact support is represented by one Choquet integral if the universal set X is compact, while it is not represented by one Choquet integral but represented by the difference of two Choquet integral, if the universal set X is not compact but locally compact. This fact is expressed by the framework of decision making.
Workshop: developing interactive competence: Student centered discussion
Authors: Loreen Marie Butcher-Powell, Barbara Brazon
Venue: Journal of Computing Sciences in Colleges (2003)

This paper describes the redesign and implementation of undergraduate courses in first two years of the Information Science and Technology (IST) degree program. Many course have been transformed from a traditional lecture based model to a dynamic and situated learning environment using an approach called "Student Centered Discussion (SCD) (Wright, 2002). This has involved the development of an inquiry based learning environment for teaching IST courses for many complex problems in which students explore, analyze, and resolve. It has required a major change in pedagogical strategy, the reorganization of course content, and a reworking of the class assignments to integrate SCD into the courses. The object of each course is to provide the students with a challenging, critical thinking, novel, technology-focused, and learner-centered educational experience where they learn by pursuing knowledge, improving basic communication skills and most importantly taking responsibility for their own learning (Brown, Collins and Dugid, 1989).
Compressing the property mapping of polygon meshes
Authors: Martin Isenburg, Jack Snoeyink
Venue: Graphical Models (2002)

Many polygon meshes have properties such as shading normals, colors, texture coordinates, or material attributes that are associated with the vertices, faces, or corners of the mesh. While current research in mesh compression has focused on connectivity and geometry coding, the compression of properties has received less attention. There are two kinds of information to compress. One specifies each individual property--the property values. The other describes how the properties are attached to the mesh--the property mapping. In this paper, we introduce a predictive compression scheme for the property mapping that is two to three times more compact than previously reported methods.
Improving a parallel algorithm through a visual display
Authors: Mythili Mantharam
Venue: Journal of Computing Sciences in Colleges (2003)

The RTZ algorithm reduces a real matrix by a sequence of orthogonal transformations to a Real Schur Form [13]. In this paper we present a parallel implementation of the RTZ algorithm. We tested our code with a visual display of a real matrix as it got reduced to a block triangular matrix. The display helped us to understand and correct some of the problems in the implementation of our algorithm.
From technical change to socio-technical change: towards a proactive approach to the treatment of organisational issues
Authors: Neil F. Doherty, Malcolm King
Venue: Socio-technical and human cognition elements of information systems (2003)

The organisational application of information technology commonly evokes a wide variety of impacts upon the enterprise as a whole, and the individual members of staff affected by it. However, there is much evidence to suggest that the identification and management of such impacts, which is typically referred to as the treatment of organisational issues, is poorly handled in practice. The primary aim of the research project, described in this chapter, was to develop a proactive approach to the analysis of organisational impacts. The aim of the approach, which is presented as a flow diagram, is to clearly articulate the sequence of activities that have to be undertaken and the decisions that need to be addressed to ensure that all organisational issues are treated effectively. This approach has been formulated from an extensive review of the literature, and the authors' experience working in this domain for the past six years. It is argued that this approach may well succeed, where many of its predecessors have failed, as it complements, rather than replaces, existing development tools and methods. Moreover, as this approach adopts a common-sense perspective, it should be relatively easy to learn and apply. Finally, it benefits from adopting a proactive, flexible and coherent approach to the treatment of organisational issues.
Website development issues
Authors: Beverly Caggiano
Venue: Building a virtual library (2003)

Since 1995, university academic libraries have seen increased computer demand and use by faculty, staff, and students; widespread use of bibliographic databases to identify the existence and content of local and remote information; the emergence of full-text electronic resources; and a plethora of network databases, protocols, and applications growing piecemeal throughout the academic setting. To provide on-line access to these resources, libraries created web 'gateways' using new browser-based technology.When any new technology develops, there is a tendency to discard the traditional way of doing things and start again. However, rather than arguing which approach is better, it is more constructive to examine and combine the strengths of each approach to provide a better service for the end-user. This is particularly applicable in the case of web sites, since the creation of a web site has become a relatively easy task. This chapter reviews the best practices gleaned from various disciplines, sprinkled with real-life examples, and tempered by experience. The goal of the chapter is to provide the framework for a viable library web project.
On cache memory hierarchy for Chip-Multiprocessor
Authors: Mohamed M. Zahran
Venue: ACM SIGARCH Computer Architecture News (2003)

Advances in integrated circuit technology have led the microprocessor design to more challenging areas by providing a high budget of transistors. The one billion microprocessor is not that far from now. This leads microarchitects to look for efficient ways to make use of this feature. Chip-Multiprocessor (CMP) is one of the strong candidates in this area. Memory system for any multiprocessor is a pivotal part and can boost the performance or decrease it dramatically. The purpose of this study is to investigate the most appropriate cache memory hierarchy for CMP. We provide comparisons between several candidates and present a conclusion that can lead to better performance for CMP as well as the configurations that must be avoided.
Several Results on the Design of Queueing Systems
Authors: Xiuli Chao, Carlton Scott
Venue: Operations Research (2000)

Given that the total service effort in a multiple-server environment is fixed, it is generally known that the single-server system yields the minimum time a customer spends in the system. However, in many manufacturing as well as service applications the waiting time in the queue is more significant than total time in the system. We consider several such queueing design problems and show that the results for minimizing the waiting time in the queue are markedly different from those for minimizing total time in the system.