ppxscal/embedding_network huggingface dataset:
ERP training strategies: conceptual training and the formation of accurate mental models
Authors: Tony Coulson, Conrad Shayo, Lorne Olfman, C. E. Tapie Rohm
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

Enterprise Resource Planning (ERP) systems are large, complex integrated software applications that often take years to implement. This study examined a major determinant of successful ERP implementation, end-user training. Specifically, this study advances research in the area of ERP software through examining end-user training strategies that may impact the effective use of these complex systems. The Sein, Bostrom, and Olfman [19] Hierarchical Knowledge-Level model is applied in an experiment to develop more effective ERP training strategies. The experiment was a non-equivalent quasi-experimental design involving two groups of approximately 35 senior business students: one group was given the introduction of ERP workflow concepts as an advance organizer (TCT Group); the other received traditional, procedurally-oriented (PT Group) ERP training over the same 5 week time period. A series of post-test measures were administered after each training treatment, and ten days after all treatments concluded. The study finds that a workflow conceptual advanced organizer strategy (TCT group) improves end-users' mental model accuracy over time as demonstrated by the subjects' ability to recall ERP specific concepts. Results indicate that a conceptual advance organizer is an important component of ERP training and should be incorporated into an organization's training strategy.
Triangulation of NURBS surfaces through adaptive refinement
Authors: Jaroslaw Sugier
Venue: Machine Graphics Vision International Journal (2002)

This paper discusses adaptive approach to the problem of automatic triangulation of NURBS surfaces. The algorithm presented here generates triangulation through the so-called adaptive refinement - a process carried out entirely in a parametric space with a variable triangle size adjusted to the local curvature of the surface, so that the imposed approximation error is not exceeded. The mesh is generated as an adaptive one right from the start, and no further decimation is required. Sample triangulations generated by the algorithm as well as a discussion of its computational complexity are included. Running times of the computer implementation confirm that an average computational cost of the algorithm is ∼ O(N), with N denoting the total number of triangles in the final mesh.
Knowledge management and sharing
Authors: Bee K. Yew, WeiXiong Ho, Marvin D. Troutt
Venue: Decision making support systems: achievements, trends and challenges for (2002)

The knowledge economy is driven by growth and development of intellectual capital in organizations. Knowledge is defined to be reusable abstractions that can produce new knowledge and modify existing knowledge. Decision making, which includes task solving, is a common feature of the working organization, and it requires good knowledge as input. This chapter provides a review of the knowledge management (KM) concepts and perspectives, with an introduction to the knowledge management Systems (KMS) and its related technologies. The importance of a knowledge base for KM and knowledge sharing (KS) activities is illustrated for Callisma, a consulting firm. Models for knowledge cycle and conversions are covered to provide further theory for KM research. KS, in particular, is an important concern for a knowledge organization as it is believed that effective knowledge sharing or better knowledge utilization can result in increased organizational capabilities as defined by competitiveness, efficiency, competency, and creativity. The inquiring models based on Kant, Hegel, Locke and Liebnitz mental models are presented to provide an analytical framework for knowledge creating and sharing activities.
Tangible search for stacked objects
Authors: Kensaku Fujii, Jun Shimamura, Kenichi Arakawa, Tomohiko Arikawa
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The goal of Tangible Search is to more effectively support the user in physically locating one of a number of stacked objects. It consists of two operations - automatic logging of stacked objects and direct annotation; image processing is used to determine the heights of the stack and of the user's finger. Tangible Search offers stable and accurate 3D analysis since it uses our previously proposed method. It employs a single camera with a compound half-mirror; this configuration also allows the top and side views of the stack to be captured simultaneously. Our approach is to make it easier for the user to handle stacks of items; it will enhance the tabletop metaphor for intuitive interaction in real-world environments where stacks are very common.
Optimal Policies of Yield Management with Multiple Predetermined Prices
Authors: Youyi Feng, Baichun Xiao
Venue: Operations Research (2000)

It is a common practice for industries to price the same products at different levels. For example, airlines charge various fares for a common pool of seats. Seasonal products are sold at full or discount prices during different phases of the season. This article presents a model that reflects this yield management problem. The model assumes that (1) products are offered at multiple predetermined prices over time; (2) demand is price sensitive and obeys the Poisson process; and (3) price is allowed to change monotonically, i.e., either the markup or markdown policy is implemented. To maximize the expected revenue, management needs to determine the optimal times to switch between prices based on the remaining season and inventory. Major results in this research include (1) an exact solution for the continuous-time model; (2) piecewise concavity of the value function with respect to time and inventory; and (3) monotonicity of the optimal policy. The implementation of optimal policies is fairly facile because of the existence of threshold points embedded in the value function. The value function and time thresholds can be solved with a reasonable computation effort. Numerical examples are provided.
Existence of blowing-up solutions for a slightly subcritical or a slightly supercritical non-linear elliptic equation on Rn
Authors: Anna Maria Micheletti, Angela Pistoia
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

The main purpose of this paper is to construct a family of positive solutions for both the slightly subcritical and slightly supercritical equations -Δu + V(x)u = n(n - 2)(u+)(n+2)/(n-2)±ε in Rn, which blow-up and concentrate at a single point as ε goes to 0, under certain conditions on the potential V.
Models and Methods for Merge-in-Transit Operations
Authors: Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
Venue: Transportation Science (2003)

We develop integer programming formulations and solution methods for addressing operational issues in merge-in-transit distribution systems. The models account for various complex problem features, including the integration of inventory and transportation decisions, the dynamic and multimodal components of the application, and the nonconvex piecewise linear structure of the cost functions. To accurately model the cost functions, we introduce disaggregation techniques that allow us to derive a hierarchy of linear programming relaxations. To solve these relaxations, we propose a cutting-plane procedure that combines constraint and variable generation with rounding and branch-and-bound heuristics. We demonstrate the effectiveness of this approach on a large set of test problems with instances derived from actual data from the computer industry that contain almost 500,000 integer variables.
Internet Filtering in China
Authors: Jonathan Zittrain, Benjamin Edelman
Venue: IEEE Internet Computing (2003)

The Chinese government has made few official statements about its filtering of Internet content, but this report explores the scope, depth, and various methods used to selectively bar to Internet access through networks in China.
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Authors: F. Benjamin Zhan, Charles E. Noon
Venue: Transportation Science (1998)

The classic problem of finding the shortest path over a network has been the target of many research efforts over the years. These research efforts have resulted in a number of different algorithms and a considerable amount of empirical findings with respect to performance. Unfortunately, prior research does not provide a clear direction for choosing an algorithm when one faces the problem of computing shortest paths on real road networks. Most of the computational testing on shortest path algorithms has been based on randomly generated networks, which may not have the characteristics of real road networks. In this paper, we provide an objective evaluation of 15 shortest path algorithms using a variety of real road networks. Based on the evaluation, a set of recommended algorithms for computing shortest paths on real road networks is identified. This evaluation should be particularly useful to researchers and practitioners in operations research, management science, transportation, and Geographic Information Systems.
Impact of Ceo Succession in Japanese Companies: a Coevolutionary Perspective
Authors: Tomoaki Sakano, Arie Y. Lewin
Venue: Organization Science (1999)

In this paper, we set out to investigate whether strategic leadership matters at a moment in the life cycle of the firm when a change is made in the top leadership. By far, most of the conceptual and empirical literature on the consequences of CEO succession involves United States companies. Therefore, in this paper, we set out to investigate the impact of CEO succession on strategic and organizational changes in Japanese companies. The empirical study consisted of a matched control group design involving 81 Japanese companies experiencing a CEO succession event and 81 companies with continuity of their CEO leadership. The results of the study can be summarized as follows. Overall CEO succession was not associated with radical strategic and organization changes. Japanese companies did engage in evolutionary organization and strategic adaptations during the five year period of the study but independent of CEO succession. The governance structure moderates organization changes (independent of CEO succession) in particular when the firm was affiliated with a main bank and the firm was experiencing severe financial pressure.
A vision system for an underwater cable tracker
Authors: Alberto Ortiz, Miquel Simó, Gabriel Oliver
Venue: Machine Vision and Applications (2002)

Nowadays, the surveillance and inspection of underwater installations, such as power and telecommunication cables and pipelines, is carried out by operators that, being on the surface, drive a remotely operated vehicle (ROV) with cameras mounted over it. This is a tedious and high time-consuming task, easily prone to errors mainly because of loss of attention or fatigue of the human operator. Besides, the complexity of the task is increased by the lack of quality of typical seabed images, which are mainly characterised by blurring, non-uniform illumination, lack of contrast and instability in the vehicle motion. In this study, the development of a vision system guiding an autonomous underwater vehicle (AUV) able to detect and track automatically an underwater power cable laid on the seabed is the main concern. The vision system that is proposed tracks the cable with an average success rate above 90%. The system has been tested using sequences coming from a video tape obtained in several tracking sessions of various real cables with a ROV driven from the surface. These cables were installed several years ago, so that the images do not present highly contrasted cables over a salady seabed; on the contrary, these cables are partially covered in algae or sand, and are surrounded by other algae and rocks, thus making the sequences highly realistic.
Evolving learning in the stuff swamp
Authors: Jon Dron, Chris Boyne, Richard Mitchell
Venue: Adaptive evolutionary information systems (2003)

This chapter describes the theory, background and some uses of CoFIND (Collaborative Filter in N Dimensions), a Web-based database of learning resources which is created by and for learners. CoFIND is designed to exploit principles of evolution and self-organisation to create an emergent structure to learning resources. Through the manipulation of learner-supplied metadata such as classifications and ratings, this structure shapes itself to the needs of the learners who create it, providing something akin to guidance traditionally supplied by a teacher. The chapter starts with a discussion of the weaknesses of existing means for groups of learners to discover learning resources including search engines, directories, seals of approval, and collaborative filters. It considers a range of methods by which self-organisation is achieved in natural systems (notably evolution and stigmergy) and which underpin the CoFIND system. CoFIND is described and examples are given of some of its uses. The authors discuss some issues which arise, especially its cold-start problem, influences of surrounding systems and the role of motivation. The chapter concludes with a discussion of potential future directions for CoFIND and identifies some other aspects of learning environments which may benefit from such a self-organising system.
Analysis of 2D piezoelectric strips and semi-strips
Authors: Yuantai Hu, Jiashi Yang, Qing Jiang
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2003)

Using Stroh's formalism and the theory of analytic functions, simple and explicit solutions for a generalized line dislocation in an infinite piezoelectric strip are obtained. The two boundaries of the strip are free of traction and electric charge. The problem of a generalized dislocation in a piezoelectric semi-strip with traction and charge free boundaries is also studied. A set of singular integral equations governing the unknown functions is derived. When all the eigenvalues of the material coefficient matrix are pure imaginary, explicit expressions of the unknown functions are given. The results obtained are valid not only for plane and anti-plane problems but also for coupled problems between in-plane and out-of-plane deformations.
On a lemma of Scarf
Authors: Ron Aharoni, Tamás Fleiner
Venue: Journal of Combinatorial Theory Series B (2003)

The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics has already been demonstrated in a paper by the first author and R. Holzman (J. Combin Theory Ser. B 73 (1) (1998) 1) where it was used to prove the existence of fractional kernels in digraphs not containing cyclic triangles. We indicate some links of the lemma to other combinatorial results, both in terms of its statement (being a relative of the Gale-Shapley theorem) and its proof (in which respect it is a kin of Sperner's lemma). We use the lemma to prove a fractional version of the Gale-Shapley theorem for hypergraphs, which in turn directly implies an extension of this theorem to general (not necessarily bipartite) graphs due to Tan (J. Algorithms 12 (1) (1991) 154). We also prove the following result, related to a theorem of Sands et al. (J. Combin. Theory Ser. B 33 (3) (1982) 271): given a family of partial orders on the same ground set, there exists a system of weights on the vertices, which is (fractionally) independent in all orders, and each vertex is dominated by them in one of the orders.
Optimal Design of Truss Structures by Logic-Based Branch and Cut
Authors: S. Bollapragada, O. Ghattas, J. N. Hooker
Venue: Operations Research (2001)

The truss design problem is to find the optimal placement and size of structural bars that can support a given load. The problem is nonlinear and, in the version addressed here, the bars must take certain discrete sizes. It is shown that a logic-based method that dispenses with integer variables and branches directly on logical disjunctions can solve substantially larger problems than mixed integer programming, even though the nonlinearities disappear in the mixed integer model. A primary purpose of the paper is to investigate whether advantages of logic-based branching that have been demonstrated elsewhere for linear problems extend to nonlinear programming.
Tutorial: Compiling concurrent languages for sequential processors
Authors: Stephen A. Edwards
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2003)

Embedded systems often include a traditional processor capable of executing sequential code, but both control and data-dominated tasks are often more naturally expressed using one of the many domain-specific concurrent specification languages. This article surveys a variety of techniques for translating these concurrent specifications into sequential code. The techniques address compiling a wide variety of languages, ranging from dataflow to Petri nets. Each uses a different method, to some degree chosen to match the semantics of concurrent language. Each technique is considered to consist of a partial evaluator operating on an interpreter. This combination provides a clearer picture of how parts of each technique could be used in a different setting.
Control of a Single-Server Tandem Queueing System with Setups
Authors: Izak Duenyas, Diwakar Gupta, Tava Lennon Olsen
Venue: Operations Research (1998)

This paper considers the control of a single-server tandem queueing system with setups. Jobs arrive to the system according to a Poisson process and are produced to order. A single server must perform a number of different operations on each job. There is a setup time for the server to switch between different operations. We assume that there is a holding cost at each operation, which is nondecreasing in operation number (i.e., as value is added to a job, it becomes more expensive to hold). The cont rol problem is to decide which job the server should process at each point in time. We formulate this control problem as a Markov-Decision Process. We partially characterize the optimal policy, develop an exact analysis of exhaustive and gated polling policies, and develop an effective heuristic policy. The results of a simulation study, which tests the performance of the policies considered, are reported. These computational results indicate that our heuristic is effective for a wide variety of cases.
Analyzing the Dynamics of Cellular Flames Using Karhunen--Loève Decomposition and Autoassociative Neural Networks
Authors: Nejib Smaoui, Salem Al-Yakoob
Venue: SIAM Journal on Scientific Computing (2002)

Video data from experiments on the dynamics of two dimensional flames are analyzed. The tools used are Karhunen--Loève (K-L) decomposition and autoassociative neural networks (ANN). The K-L decomposition, known for its wide applications in scientific problems for data compression, noise filtering, and feature identification, is used to determine an intrinsic coordinate system or orthogonal eigenfunctions that best represent the flame data set. Five eigenfunctions are retained and the rest are disregarded so that reconstructions of the flame data based on the retained eigenfunctions capture most of the dynamics from the original data. The time dependent data coefficients in the expansion of the flame data are used to develop and train an ANN with the task of reducing the dimensionality of the dynamics into a space which reflects the intrinsic dimensionality of the problem.
An Inverse Problem of the Lanchester Square Law in Estimating Time-Dependent Attrition Coefficients
Authors: Hsi-Mei Chen
Venue: Operations Research (2002)

This paper considers the inverse problem of estimating time-varying attrition coefficients in Lanchester's square law with reinforcements, using observed data on some or all of the battle's strength histories and the reinforcement schedules. The method employed is a nonparametric extension of the parametric conjugate gradient method (P-CGM). We use hypothetical strength histories and reinforcement schedules that are known to be without error at several points in time to illustrate the method. However, the method has application in other circumstances. The problem of estimating the time-dependent attrition coefficients that best fit a set of given strength histories is inherently a nonparametric inverse problem. In this paper we cast it into a nonlinear optimization problem, and show how to solve it numerically by using a nonparametric conjugate gradient method (NP-CGM). Two numerical test cases are provided to illustrate the application of the method.
Towards efficient design space exploration of heterogeneous embedded media systems
Authors: A. D. Pimentel, S. Polstra, F. Terpstra, A. W. van Halderen, J. E. Coffland, L. O. Hertzberger
Venue: Embedded processor design challenges: systems, architectures, modeling, and simulation-SAMOS (2002)

Modern signal processing and multimedia embedded systems increasingly have heterogeneous system architectures. In these systems, programmable processors provide flexibility to support multiple applications, while dedicated hardware blocks provide high performance for time-critical application tasks. The heterogeneity of these embedded systems and the varying demands of their growing number of target applications greatly complicate the system design. As part of the Artemis project, we are developing a modeling and simulation environment which aims at efficient design space exploration of heterogeneous embedded systems architectures. In this paper, we present an overview of the modeling and simulation methodology used in Artemis. Moreover, using a case study in which we have applied an initial version of our prototype modeling and simulation environment to an M-JPEG encoding application, we illustrate the ease with which alternative candidate architectures can be modeled and evaluated.
Dual-based heuristics for a hierarchical covering location problem
Authors: Luis Gonzalo Acosta Espejo, Roberto D. Galvão, Brian Boffey
Venue: Computers and Operations Research (2003)

A 2-level hierarchical extension of the maximal covering location problem is considered and an effective method for its solution developed. A combined Lagrangean-surrogate (L-S) relaxation is defined which reduces to a 0-1 knapsack problem. Tests were carried out using a subgradient-based heuristic incorporating the L-S relaxation, with the resulting knapsack problems being solved both with and without the integrality constraints relaxed. Results were obtained for test problems available in the literature ranging from 55-node to 700-node networks. These were compared, where possible, with exact results obtained using CPLEX. It was found that computing times were reasonable.
Introducing computer science after programming
Authors: Cary G. Gray, Michael D. Frazier
Venue: Journal of Computing Sciences in Colleges (2002)

We describe replacement of a more traditional (CS1/CS2) introductory sequence with one that starts after a one-semester programming-only course. The change simplifies placement for entering students (whether from other colleges or directly from high school), and the new structure more effectively communicates the nature of the science to beginning students. The new sequence accommodates the entering students who lack a high level of mathematical maturity, but without compromising the mathematical nature of the major.
E-commerce security measures: are they worth it?
Authors: Avi Rushinek, Sara Rushinek
Venue: Ubiquity (2002)

Cost benefits of the security and systems management of electronic publishing Internet Web server subscription services and e-commerce.