6732453
Enterprise computing environments and cost assessment
120676923
Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
A new efficient system of representing the decision-maker's preference structure in solving multicriteria integer programming problems is developed. The problem is solved by an interactive branch-and-bound method that employs the procedure of Zionts and Wallenius Zionts, S., J. Wallenius. 1983. An interactive multiple objective linear programming method for a class of underlying nonlinear utility functions. Management Sci.295. for multicriteria linear programming. The decision-maker's underlying utility function is assumed to be pseudoconcave, and his pairwise comparisons of decision alternatives are used to determine his preference structure in terms of certain convex cones in the objective function space and constraints on the weights on the objectives in the weight space. The two forms of preference structure representation are interrelated, and their underlying theory is developed. The primary objective of a representation scheme is exactness, and, in this respect, it is shown that the constraints on the weights are not adequate for representing nonlinear utility functions. On the other hand, the convex cones exactly represent any quasiconcave utility function and clearly avoid the approximations and inaccuracies in other utility assessment systems. Accordingly, an efficient ordered representation using convex cones is developed. An algorithmic framework for multicriteria integer programming that integrates the representation using convex cones with the branch-and-bound solution procedure is developed. Computational experience with bicriteria problems having up to 80 variables and 40 constraints is presented.
32066139
Topographically discounted Internet infrastructure resources: a panel study and econometric analysis
The Internet infrastructure is increasingly utilized for the provision and delivery of a variety of services. The rapid growth and substantial demand fluctuations of the supported services are placing strain on the service providers to effectively manage their infrastructure resources. Capacity Provision Network (CPN) is a market-driven mechanism that enables the service providers to efficiently allocate, share and trade service capabilities. Central to the operation of CPN is the notion of discounted capacities which capture the underlying topology of the Internet. It serves as a practical instrument for service providers to evaluate the utility of capacity services available at remote sites vis-à-vis the capacities available locally and from the content providers. We conducted an Internet based longitudinal field experiment to empirically assess and validate the critical properties of discount factors. Our analysis reveals that discount factors exhibit markedly lower volatility than network delays, and are more stable over seasonal and temporal trend patterns. The results related to size effects suggest that sharing and trade agreements with larger content can be particularly effective. Our finding on the existence of the concavity property points to the ability of intermediation services to enhance the overall gains from resource sharing arrangements.
5067407
An integrated framework for decision support in corporate planning
Abstract Corporate planning and decision making is a complex but critical management process in multidivisional organizations. This process entails a determination of the objectives and operational constraints at various levels of management. The decision-making function in such large diversified corporations proceeds by assessing the decision alternatives at each level of management with reference to their mutual tradeoffs, and arriving at an equilibrium point. In this paper, we develop a conceptual framework for the design of an integrated DSS in hierarchical organizations. The proposed framework consists of five steps: Analysis of the corporate decision making process, building a model of the decision making process, configuring a DSS for this model, pilot study and implementation. We illustrate the proposed design principles by considering a three-level hierarchical organization and modeling the decision-making process within this organization. A case analysis of the proposed integrated framework is provided. The case study has been conducted with decision makers in a simulated business environment. This research has given rise to several new avenues of exploration and extensions of the proposed design. We present the conclusions from this study and directions for future research in this area. Our experience with this approach in the case analysis has been quite positive, and this suggests that similar results may be obtained in real world organizations as well. We are currently testing the proposed approach with a local organization.
13648716
EARS: An online bibliographic search and retrieval system based on ordered explosion
Abstract Ergonomics Abstracts Retrieval System (EARS) is an online bibliographic information search and retrieval system using the hierarchical subject classification of the Ergonomics Abstracts . EARS is designed using an inverted file organization and is implemented on CDC-Cyber. The data base of abstracts is organized using a fixed-length record format, where each logical record corresponds to a variable number of fixed-length physical records. Accordingly, an index for the identification of physical records from the logical records is used. The data base is inverted on a three-level hierarchical classification scheme and postings files are used for data base inversion. The data base is accessed after selectively traversing a 4-layer structure of indexes and postings files. EARS provides facilities to perform combinations of searches, limited searches, and certain editing functions. The system is currently used extensively by the Western New York Human Factors research community. The logical and physical designs of EARS, its interactive operational features, and its current expansions are described in this paper.
10727206
A New Scheduling Algorithms For Real Time Tasks
The main objective of this paper is to develop the two different ways in which round robin architecture is modified and made suitable to be implemented in real time and embedded systems. The scheduling algorithm plays a significant role in the design of real time embedded systems. Simple round robin architecture is not efficient to be implemented in embedded systems because of higher context switch rate, larger waiting time and larger response time. Missing of deadlines will degrade the system performance in soft real time systems. The main objective of this paper is to develop the scheduling algorithm which removes the drawbacks in simple round robin architecture. A comparison with round robin architecture to the proposed architectures has been made. It is observed that the proposed architectures solves the problems encountered in round robin architecture in soft real time by decreasing the number of context switches waiting time and response time thereby increasing the system throughput.
6059279
Information systems frontiers
COMMUNICATIONS OF THE ACM January 2000/Vol. 43, No. 1 71 In this article, we focus on certain important and promising IS/IT frontiers identified from the perspectives of academia, industry, and federal research funding agencies. Our objective is to focus the collective awareness of the IS community and those in related disciplines on some of the frontier developments in IS/IT with a vision of the road ahead and point to challenges and opportunities [1]. We address the following emerging frontiers in IS/IT: the integrated circuits (IC) revolution, object technologies, knowledge and distributed intelligence, the evolving multiagent intelligent systems, satellite networks and mobile computing and the virtual corporation of the next millennium. These frontiers capture significant areas of research and development with the potential to fundamentally alter the field of IS/IT in the next millennium. Jagdish Chandra, Salvatore T. March,
30893368
Nonlinear Pattern Matching in Trees
Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as mechanical theorem proving, term rewriting, symbolic computation and nonprocedural programming languages. In this paper we present new sequential algorithms for nonlinear pattern matching in trees. Our algorithm improves upon known tree pattern matching algorithms in important aspects such as time performance, ease of integration with several reduction strategies and ability to avoid unnecessary computation steps on match attempts that fail. The expected time complexity of our algorithm is linear in the sum of the sizes of the two trees.
14332724
Simultaneous Optimization of Design Tolerance and Total Cost for a Piston and Cylinder Assembly
Rapid changes in the market place have led designers and manufacturers to continuously develop new products to satisfy the demands of more exigent customers. Therefore, to be competitive, designers and manufacturers have to perform those steps accurately to ensure final Product quality and manufacturing cost. So Product quality and manufacturing cost have a significant impact on Tolerance. A more scientific approach is often desirable for better performance to overcome this Tolerance problem. In this paper, Design and machining tolerances have been allocated based on optimum total machining cost. New global nonlinear optimization techniques called Pattern Search algorithm and Genetic algorithm have been implemented to find the optimal tolerance allocation and total cost. Finally with respect to total cost both the methods have been compared.
46697244
Multistage Indexing for Speeding Prolog Executions
In a previous article we proposed a new and efficient indexing technique that utilizes all the functors in the clause-heads and the goal. The salient feature of this technique is that the selected clause-head unifies (modulo nonlinearity) with the goal. As a consequence, our technique results in sharper discrimination, fewer choice points and reduced backtracking. 
 
 
 
A naive and direct implementation of our indexing algorithms considerably slowed down the execution speeds of a wide range of programs typically seen in practice. This is because it handled deep and shallow terms, terms with few indexable arguments, small and large procedures uniformly. To beneficially extend the applicability of our algorithms we need mechanisms that are ‘sensitive’ to term structures and size and complexity of procedures. We accomplish this in the v-ALS compiler by carefully decomposing our indexing process into multiple stages. The operations performed by these stages increase in complexity ranging from first argument indexing to unification (modulo nonlinearity). Further the indexing process can be terminated at any stage if it is not beneficial to continue further. 
 
 
 
We have now completed the design and implementation of v-ALS. Using it we have enhanced the performance of a broad range of programs typically encountered in practice. Our experience strongly suggests that indexing based on unification (modulo nonlinearity) is a viable idea in practice and that a broad spectrum of useful programs can realize all of its benefits.