ppxscal/embedding_network huggingface dataset:
Managerial Issues of Enterprise Resource Planning Systems, 1 edition
Authors: David L. Olson
Venue:  (2003)

The primary purpose of this text is to lay out the scope of ERP Systems implementation, explain the competitive advantages of using ERP Systems, and support general concepts with short case studies. This text covers the fundamental issues important in ERP implementation and management, starting from an information systems, information technology project management perspective. Each chapter will include a review of real cases of ERP implementations related to that particular chapter content. The text is meant to be software product independent, in order to enable schools to select their own ERP Systems software tools and use them as time permits.Table of contentsChapter 1: Enterprise Resource Planning SystemsChapter 2: ERP Modules and Historical DevelopmentChapter 3: ERP System Options and Selection MethodsChapter 4: Business Process Reengineering and Best PracticesChapter 5: ERP System InstallationChapter 6: ERP Project ManagementChapter 7: ERP Implementation and MaintenanceChapter 8: Business Intelligence Systems and ERPChapter 9: ERP and Supply ChainsChapter 10: Advanced Technology and ERP SecurityChapter 11: Trends in ERP
A Nonantagonistic Game in the Problem of Modeling of the Commercial Activity of Wholesale Enterprises
Authors: A. N. Vashchekin, M. M. Khrustalev
Venue: Automation and Remote Control (2003)

A system is set up for macroeconomic mathematical models of the activity of wholesale enterprises of an agrochemical complex, which are entrusted with the task of implementation of the state support of agriculture with the aim of establishing the conditions for an increase of volumes of the agricultural production. The suggestion is made to develop strategies of basic subjects of economic interaction, which take into account their natural interests, proceeding from the solution of a nonantogonistic hierarchical game.
An efficient automatic mesh generator for quadrilateral elements implemented using C++
Authors: M. Bastian, B. Q. Li
Venue: Finite Elements in Analysis and Design (2003)

This paper presents an efficient mesh generation algorithm for creating unstructured quadrilateral meshes for finite element computations. The algorithm is developed by improving upon an existing recursive mesh generation scheme and implemented using the C++ object-oriented language. Exhaustive cases of misshaped elements for which a general remedy is not possible are identified through extensive numerical testing and treated case by case. These improvements make it possible to generate quadrilateral elements for any case without any need for final mesh resolution by human interference. The implementation of the algorithm using object-oriented methods allows flexibility in programming and increases the computational efficiency of mesh generation. The use of object data structures, such as line segments and elements, expedites the algorithm implementalion. Numerical experience shows that not only is programming simplified when objects are used, but computational speed is also increased. When comparing two nodes for best splitting lines, line segments do not compare nodes on the same segment. This immediately eliminates all nodes on the segment the starting point of the potential splitting line is on. By automatically doing this, a great saving in computing time is achieved. Examples of automatic mesh generation in both simply and multiply connected domains are given and their computational efficiencies are also assessed.
Scheduling in Wireless Networks with Multiple Transmission Channels
Authors: Satish Damodaran, Krishna M. Sivalingam
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

This paper describes scheduling algorithms for scheduling traffic in wireless data networks with multiple channels per cell. The paper assumes that a reservation-based MAC protocol is used. The main objective of the scheduling algorithms is to reduce the computation time while maximizing the utilization of the network resources, thereby improving the system throughput. In this paper, we consider two type of systems -- single priority and multiple priority. For each system, two different algorithms are considered depending on whether slots are allocated contiguously or not. A performance study that considers network utilization, computation time, and the throughput for 2 Mbps and 10 Mbps data-streams for the above algorithms is presented.
Open VMS with Apache, OSU, and WASD
Authors: Alan Winston
Venue:  (2002)

:-If your business needs reliable, full-featured web service, you need this book-Offers information not available anywhere else for OpenVMS, whose unbeatable reliability makes it the web server of choice for institutions that can't afford downtime for their websites -Provides examples and step-by-step procedures that show how to do the same task in different servers Learn how to successfully run a web server on an OpenVMS system, using any one of the three currently supported servers  OSU, WASD, and Compaq Secure Web Server (based on Apache). The book explains the suitability of VMS clusters for 24x7 operation, covers the various TCP/IP products, and discusses cluster aliases and load-balancing techniques. The chapters are organized by function, answering the question "How do I do X" for each of the servers. Winston evaluates many relevant freeware and some commercial products. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Process Variation: Is It too Much to Handle?
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The panel will discuss the impact of increasing process variation with technology scaling from the aspect of manufacturing, design, and design tools. Increase in process induced parameter variation makes it harder to understand the correlation between what was designed and what gets manufactured. To guarantee product quality this often results in the need for worst-case assumptions during design phase. Can we continue this? If not, should the manufacturing and process engineers get their act together and reduce variation? Or, should the circuit designers stop complaining and learn to live with the variation by building process tolerant circuits? How should the CAD community help in these endeavors? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Relational Query Optimization with Enhanced ADTs
Authors: Praveen Seshadri
Venue:  (1998)

Object-relational queries access large complex data types and expensive methods of those data types. In earlier work, we modeled complex types as "Enhanced ADTs" (E-ADTs) and demonstrated the resulting performance improvements when implemented in the PREDATOR system. This paper explores the opportunities for further improvements through interactions between relational query optimization and E-ADT optimization. We identify four broad categories of optimization opportunities and study specific examples in each of these categories. These examples span query rewrite, indexing, aggregation and join optimization. Our conclusion is that non-trivial interactions exist between E-ADTs and relational queries, and that special optimization techniques are necessary to achieve good performance. These techniques have been prototyped in PREDATOR, and we present experimental results that demonstrate their effect.
Walverine: a Walrasian trading agent
Authors: Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, L. Julian Schvartzman, Michael P. Wellman
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation market game. TAC presents a challenging travel-shopping scenario where agents must satisfy client preferences for complementary and substitutable goods by interacting through a variety of market types. Michigan's entry, Walverine, attempts to bid optimally based on a competitive analysis of the TAC travel economy. Walverine's approach embodies several techniques not previously employed in TAC: (1) price prediction based on competitive equilibrium analysis, (2) hedged optimization with respect to a model of outlier prices, (3) optimal bidding based on a decision-theoretic calculation of bid actions, and (4) reinforcement learning for CDA trading strategies. Each of these is potentially applicable in a broad class of trading environments.
Distributed Information Sharing for Collaborative Systems (DISCS)
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

With the advent of global competition, greater numbers of organisations require collaborations with others. Concurrent engineering can provide a highly effective framework for this collaboration. A Distributed Object Oriented Concurrent Engineering System (DISCS) focuses on the communication of data between the members of a distributed project team. Conceptually the communication is the enabling factor; technologically the use of the WWW and object oriented technologies. A portfolio of collaboration support tools facilitates practical mechanisms for information sharing within the distributed enterprise, communication / conferencing for project teams, configuration / version control and workflow structures. DISCS effectively facilitates the virtual team, currently within an engineering context.
OCP Oracle9i Database: Performance Tuning Exam Guide, 1 edition
Authors: Charles A. Pack, Jason S. Couchman
Venue:  (2002)

Prepare to pass the Oracle9i OCP DBA Performance Tuning exam using this focused, and complete guide. Covering all official exam objectives and containing over 300 practice questions, chapter self-tests, two minute drills, a glossary of key Oracle terms--plus a CD-ROM with a testing engine that simulates the actual exam--this is the best study tool available.Table of contents PART I: OCP Tuning Exam Guide 1: Database Tuning Overview 2: Oracle Performance Tuning Methodology 3: Diagnostic and Tuning Tools 4: Sizing the Shared Pool 5: Sizing the Buffer Cache 6: Sizing Other SGA Structures 7: Database Configuration and I/O Issues 8: Optimize Sort Operations 9: Diagnosing Contention for Latches 10: Tuning Rollback or Undo Segments 11: Monitoring and Detecting Lock Contention 12: Tuning Oracle Shared Server 13: Application Tuning 14: Using Oracle Blocks Efficiently 15: SQL Statement Tuning 16: OS Considerations and Oracle Resource Manager PART II: Practice Exams 17: Practice Exam 1 and 2
The Allocation and Scheduling Precedence and Timing-Constrained Tasks with communication Delays
Authors: B.-C. Cheng, T. Marlowe, A. Stoyenko, S. Baruah
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The problem of non-preemptively scheduling a set of n tasks on m identical processors with communication overhead subject to precedence and deadline constraints is considered. A new heuristic with the time complexity of O(n2m), Least Space-Time First (LSTLP), is pro-posed to minimize the maximum tardiness. From simulation results, it is shown that LSTF outperforms other heuristic algorithms. overhead subject to precedence and deadline constraints is considered. A new heuristic with the time complexity of O(n2m), Least Space-Time First (LSTLP), is pro-posed to minimize the maximum tardiness. From simulation results, it is shown that LSTF outperforms other heuristic algorithms.
Randomized Omega (n^2) Lower Bound for Knapsack
Authors: Dima Grigoriev, Marek Karpinski
Venue:  (1996)

We prove Omega (n^2) complexity lower bound for the general model of randomized computation trees solving the Knapsack Problem, and more generally Restricted Integer Programming. This is the first nontrivial lower bound proven for this model of computation. The method of the proof depends crucially on the new technique for proving lower bounds on the border complexity of a polynomial which could be of independent interest.
Computing the Unmeasured: An Algebraic Approach to Internet Mapping
Authors: Shavitt Yuval, Sun Xiaodong, Wool Avishai, Yener Bulent
Venue:  (2000)

Distance estimation is important to many Internet applications, most notably for a WWW client that needs to select a server among several potential candidates. Current approaches to distance (i.e., time delay) estimation in the Internet are based on placing Tracer stations in key locations and conducting measurements between them. The Tracers construct an approximated map of the Internet after processing the information obtained from these measurements. This work presents a novel algorithm, based on Algebraic tools, that computes additional distances, which are not explicitly measured. As such, the algorithm extracts more information from the same amount of measurement data. Our algorithm has several practical impacts. First, it can reduce the number of Tracers and measurements without sacrificing information. Second, our algorithm is able to compute distance estimates between locations where Tracers cannot be placed. This is especially important when unidirectional measurements are conducted, since such measurements require specialized equipment which cannot be placed everywhere. To evaluate the algorithm''s performance, we tested it both on randomly generated topologies and on real Internet measurements. Our results show that the algorithm computes up to 50-200% additional distances beyond the basic Tracer-to-Tracer measurements.
On a crossroad of resampling plans: bootstrapping elementary symmetric polynomials
Authors: Albert J. Es, Roelof Helmers, M. Hu\v{s}kov\''{a}
Venue:  (1997)

We investigate the validity of the bootstrap method for the elementary symmetric polynomials $S_n^{(k)}={n\choose k}^{-1}\sum\sb {1\leq i_1 > ...> i_k \leq n} X_{i_1}...X_{i_k}$ of i.i.d. random variables $X_1,\dots,X_n$. For both fixed and increasing order $k$, as $n\to\infty$ the cases where $\mu= {\rm E} X_1 \neq0$, the nondegenerate case, and where $\mu= {\rm E} X_1=0$, the degenerate case, are considered.
Photoshop 7 Power Shortcuts
Authors: Michael Ninness
Venue:  (2003)

:Photoshop's complexity grows with its popularity: Knowing and using keyboard and quick-click shortcuts can make a huge difference in your productivity. This book documents all of the shortcuts officially included (but not found in one spot) in the Photoshop documentation and organizes them so they're easy to find. The book shows how each shortcut works in the current AND previous versions of Photoshop, invaluable info for upgraders. Most significantly, the book contains dozens of shortcuts and workarounds undocumented anywhere else. A book like this belongs in every serious Photoshop user's work environment
Schwarz-Christoffel Toolbox User''s Guide
Authors: Tobin A. Driscoll
Venue:  (1994)

The Scwarz-Christoffel Toolbox (SC Toolbox) is a collection of files for the interactive computation and visualization of Schwarz-Christoffel conformal maps in MATLAB version 4. The toolbox is a descendant of SCPACK, a Fortran package developed by L. N. Trefethen in the early 1980''s [9]. However, the SC Toolbox has been written entirely in the MATLAB language, requires no programming by the user, and has many capabilities not in SCPACK.
Combinatorial Properties of Mesh of Trees
Authors: W.-M. Chen, G.-H. Chen, F. Hsu
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

The mesh of trees, which owns two favorable properties:small diameter and large bisection, is known as the fastestnetwork when considered in terms of speed. In this paper,we show that the wide diameter, fault diameter, and Rabinnumber, which are three generalizations of diameter, of atwo dimensional 2n x 2n mesh of trees are equal to 5n+I.
Some Negative Results Concerning Prime Number Generators
Authors: Paul Pritchard
Venue:  (1983)

Programs due to Wirth and Misra for generating the prime numbers up to a specified limit are investigated. It is shown that Wirth''s program is incorrect according to three increasingly weak criteria, and a composite number is exhibited that the program accepts as prime. This is the smallest known counter-example, and could not have been found by the usual method of program testing the program would run for trillions of years on the fastest computer before reaching it! Closely related counter-examples are given to a conjecture of Misra concerning his program.
COMPILING FOR NUMA PARALLEL MACHINES
Authors: Wei Li
Venue:  (1994)

A common feature of many scalable parallel machines is non-uniform memory access (NUMA) --data access to local memory is much faster than to non-local memories. In addition, when a number of remote accesses must be made, it is usually more efficient to use block transfers of data rather than to use many small messages. Almost every modern processor is designed with a memory hierarchy organized into several levels -each smaller and faster than the level below. In general, the effective use of parallel machines requires careful attention to the following issues: (1) exposing and exploiting parallelism; (2) accessing local memory instead of remote memory; (3) using block transfers for remote accesses; (4) reusing data in the cache; and (5) load balancing. We have built a system called {\em Pnuma} for programming NUMA machines. We make the following contributions: First, we propose a parallelization scheme for both parallelism and data locality. Second, we develop a framework based on {\em non-singular} matrices and integer lattice theory for the systematic development of loop transformations. Program transformations, such as loop restructuring, are critical to achieving high performance. The framework can be used in parallelizing compilers for both coarse-grain and fine-grain parallel architectures. We have implemented a loop restructuring tool-kit called {\em Lambda} based on this framework. Third, using this loop transformation framework, we develop algorithms for improving memory locality. The memory locality algorithm restructures loop nests to expose opportunities for parallel execution and for block transfers, while keeping data accesses local wherever possible. Fourth, for cache locality, we introduce a new simple cache model based on {\em reuse distances\/}, which is more precise than the existing {\em reuse vector space} model. We develop a new loop transformation technique that optimizes directly on reuse distances, so that no exhaustive search is necessary. Fifth, we use our loop transformation framework to improve parallelism as well. We develop a unified algorithm for parallelism, memory locality and cache locality. System evaluations have been conducted on a multiprocessor machine without cache (BBN GP1000), a uniprocessor workstation with cache (HP 9000/720) and a multiprocessor machine with caches (KSR1), using programs from linear algebra, NASA benchmarks and SIMPLE hydrodynamics benchmark. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Issues in Ordered Multicast Performance: A Simulation Study
Authors: Michael Kalantar
Venue:  (1995)

Process groups are an increasingly popular tool for programming distributed systems. Such groups consist of collections of processes that work together to provide reliability, fault tolerance, task distribution, or some other abstraction. A combination of group actions, reliable failure detection, and ordered message delivery are used to provide group functionality. {\em Causal ordering}, one form of message ordering, is fundamental in process group systems. Its cost is therefore an important determinant of overall performance. In order to gain more insight into the behavior of causal order protocols, two simulations of process group systems were developed. The first, a detailed simulation of all system processes, groups, and interconnection networks, was used to study small systems. Using this model, a number of parameters were identified as having the greatest impact on ordered multicast performance. These parameters were used as indices to a set of precomputed probability distribution tables used by the second simulation. The second simulation focused only on key processes --packet originators and processes in multiple overlapping groups --and used precomputed probability tables to reduce simulation overhead. Simulations using this model showed that the delays imposed by the ordering protocols result in a tendency for packets to become ``convoyed'''' together. Consequences are larger delays and greater system and network burstiness. We speculate that this tendency for systems to become more bursty, or less uniform, is a general principle. That is, any system which delays actions on a ``microscopic'''' level results in burstiness at a ``macroscopic'''' level. The more times such delays occur, the greater the degree of burstiness. Such a principle would imply that systems with this characteristic are limited in scale by the size of the largest burst that can be handled. It also suggests that protocols that minimize the number and length of delays and which optimize the handling of bursts should be used. In the context of process group systems, burstiness can be limited by minimizing the number of groups through which a packet is filtered and by protocol designs which minimize the number of delays used to control out-of-order message arrival.
Advice-exchange in heterogeneous groups of learning agents
Authors: Luis Nunes, Eugénio Oliveira
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This research aims at studying the effects of exchanging information during the learning process in Multiagent Systems. The concept of advice-exchange, introduced in [3], consists in requesting extra feedback, in the form of episodic advice, from other agents that are solving similar problems. This work is concerned with the exchange of information in heterogeneous groups of learning-agents that either share the same environment or are solving problems with similar structure. Concepts, such as self confidence, trust and advisor preference, were introduced in the experiments that led to the results discussed in this paper.
Compiling Imperfectly-nested Sparse Matrix Codes with Dependences
Authors: Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali, Paul Stodghill
Venue:  (2000)

We present compiler technology for generating sparse matrix code from (i) dense matrix code and (ii) a description of the indexing structure of the sparse matrices. This technology embeds statement instances into a Cartesian product of statement iteration and data spaces, and produces efficient sparse code by identifying common enumerations for multiple references to sparse matrices. This approach works for imperfectly-nested codes with dependences, and produces sparse code competitive with hand-written library code.