ppxscal/embedding_network huggingface dataset:
Analysis of a Sampling Control Scheme for a Perishable Inventory System
Authors: David Perry
Venue: Operations Research (1999)

We consider an inventory system in which both the arrival of items and the demand for those items are Poisson processes. The stored items have two phases of shelf-life. If the item has not been taken by a demand during the first phase it is inspected. With probability q it is removed and with probability p = 1 - q it is transferred to the second phase. The blood bank model inspired this study. We compute ergodic limits for the number of items in the system, the lost demands, and the two types of outdating.
Optimizing Delivery Fees for a Network of Distributors
Authors: Anantaram Balakrishnan, Harihara Prasad Natarajan, Michael S. Pangburn
Venue: Manufacturing Service Operations Management (2000)

The third-party logistics industry has grown rapidly in recent years, accounting for $46 billion of the total $921 billion in logistics spending in the United States during 1999. This figure is expected to grow by 15 to 20% annually as manufacturing firms increasingly partner with third-party logistics providers to cost effectively distribute their products, while meeting increasingly stringent service expectations of customers. These logistics partnerships have introduced a new set of decision requirements to negotiate compensation for distribution services. Based on a collaborative project with a leading building products manufacturer, this paper describes the development and implementation of a novel linear programming model to decide the delivery fees paid to distributors. The model applies to manufacturer-distributor partnerships where distributors are compensated using fee values that depend on delivery weights and distances. It ensures that the expected compensation, considering stochastic demands, is adequate to cover the aggregate distribution costs for each distributor, and permits imposing various consistency conditions to ensure that fee values are credible. The model proved effective in helping the manufacturer develop a new fee table that generated considerable economic savings and provided more equitable compensation to distributors.
Solution of a Min-Max Vehicle Routing Problem
Authors: David Applegate, William Cook, Sanjeeb Dash, André Rohe
Venue: INFORMS Journal on Computing (2002)

We use a branch-and-cut search to solve the Whizzkids'96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework combines the LP-based traveling salesman code of Applegate, Bixby, ChvÃ¡tal, and Cook, with specialized cutting planes and a distributed search algorithm, permitting the use of a computing network located across Rice, Princeton, AT&T, and Bonn. The 1996 problem instance wasdeveloped by E. Aartsand J. K. Lenstra, and the competition was sponsored by the information technology firm CMG and the newspaper De Telegraaf.
DEMOIR: A Hybrid Architecture for Expertise Modeling and Recommender Systems
Authors: Dawit Yimam, Alfred Kobsa
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

Although employees' expertise has long been regarded as an important asset in organizations at least on a par with capital, goods and documented information, it is only recently that automated systems to enhance the visibility and traceability of employees with particular expertise started to receive research attention. In this paper, we introduce a systematic classification of alternative architectures for a core functionality of expert finding systems, namely expertise modeling. We also analyze the advantages and disadvantages of each approach and present our hybrid solution. We discuss how this solution addresses the requirements of (1) distributed and heterogeneous organizational and personal expertise data sources and, (2) centralized access to extracted expertise information.
Collaborative commerce
Authors: Scott Kownslar
Venue: Ubiquity (2002)

The next phase of the Internet's impact on business
Microarray image compression: SLOCO and the effect of information loss
Authors: R. Jornsten, W. Wang, B. Yu, K. Ramchandran
Venue: Signal Processing (2003)

Microarray image technology is a powerful tool for monitoring the expression of thousands of genes simultaneously. Each microarray experiment produces immense amounts of image data, and efficient storage and transmission require compression that takes advantage of microarray image structure. In this paper we develop a compression scheme for microarray images which can be either lossless or lossy with successive refinements. Existing measures of distortion such as mean squared pixel-wise error and visual fidelity are not appropriate for microarray images. We introduce a new measure of distortion for lossy compression: the sensitivity of microarray information extraction to compression loss. Furthermore, our scheme has a coded data structure that allows fast decoding and reprocessing of image sub-blocks, and includes summary statistics and image segmentation information. The average lossless compression ratio is 1.83:1 for our cDNA test images and 2.43:1 for our inkjet test images, comparable or better than state-of-the-art lossless schemas, yet with additional structure and information. At an average lossy compression ratio of 8:1 for cDNA microarrays, we find that our scheme minimizes the effects of compression loss compared to other algorithms. We show that the variability in differential gene expression levels extracted from lossily vs. losslessly compressed microarray images is less than both the variability between different arrays and the variability between different extraction algorithms. In fact, lossy compression can improve the estimation of gene expression levels for cDNA images.
Computational Intelligence for Medical Knowledge Acquisition with Application to Glaucoma
Authors: Nicolae Varachiu, Cynthia Karanicolas, Mihaela Ulieru
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

This paper presents an approach that integrates computational intelligence/soft computing paradigms with clinical investigation methods and knowledge. Computational intelligence methods (including fuzzy logic, neural networks and genetic algorithms) deal in a suitable way with imprecision, uncertainty and partial truth. These aspects can be found quite often in practical medical activities and in medical knowledge. The proposed approach uses a knowledge discovery process in order to develop an intelligent system for diagnosis andprediction of laucoma. The knowledge acquired is embedded in a fuzzy logic inference system. The resulting Neuro-fuzzy Glaucoma Diagnosis and Prediction System is expected to lower the effort, difficulties and risk cost related to this disease (the leading cause of blindness in North America.)
On-line Recognition of Renqun's Handwritten Shorthand
Authors: Xiaoping Chen, Yizheng Qiao
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A computer-based transcription system of Chinese Renqun shorthand is introduced in this paper. Shorthands are inputted from a writing tablet, after preprocessing, segmentation, feature extraction and coarse classification, artificial intelligence (AI) and dynamic programming (DP) methods are used to recognize the shorthands. Test results show that the development of a computer transcription system of Renqun shorthand is feasible and encouraging.
Advanced environments for parallel and distributed applications: a view of current status
Authors: Pasqua D'Ambra, Marco Danelutto, Daniela di Serafino, Marco Lapegna
Venue: Parallel Computing (2002)

In this paper we provide a view of the design and development activity concerning advanced environments for parallel and distributed computing. We start from assessing the main issues driving this research track, in the areas of hardware and software technology and of applications. Then, we identify some key concepts, that can be considered as common guidelines and goals in the development of modern advanced environments, and we come up with a "classification" of these environments into two main classes: programming environments and problems solving environments. Both classes are widely discussed, in light of the key concepts previously outlined, and several examples are provided, in order to give a picture of the current status and trends.
Type systems
Authors: Benjamin C. Pierce
Venue: Programming methodology (2003)

The study of type systems has emerged as one of the most active areas of research in programming languages, with applications in software engineering, language design, high-performance compiler implementation, and security. This chapter discusses the motivations and history of type systems and their role in programming language design.
Entrepreneurial Resources, Organizational Choices, and Competitive Outcomes
Authors: Patricia J. Guinan, Jay G. Cooprider, Samer Faraj, Elaine Mosakowski
Venue: Organization Science (1998)

This paper examines the link between a firm's resources and its efficient organization form with a focus on entrepreneurial resources. Entrepreneurial resources are defined as the propensity of an individual to behave creatively, act with foresight, use intuition, and be alert to new opportunities. This paper assumes that these entrepreneurial resources can be distributed in two ways throughout the firm: they can be held by one or a few individuals- "individual entrepreneurial resources "-or they can be dispersed among a team of individuals- "team entrepreneurial resources. " Agency theory is used to consider how various organizational characteristics-such as the assignment of decision responsibilities, incentives and risk bearing, the number of hierarchical levels, horizontal linking structures, mutual monitoring and bonding devices, and information systems-will differ in the individual and team entrepreneurial forms. Generally, the individual entrepreneurial form resembles the"classic entrepreneurial firm " (Fama and Jensen 1983) in which various decision making roles and risk bearing are performed by a single entrepreneur. The team entrepreneurial form is similar to what Bartlett and Ghoshal (1993) call"beyond the m-form. " Responsibility for steps in the decision process is dispersed in the team form, and monitoring the decision process will occur at the organization's apex. The CEO will not make operational or strategic decisions; instead, he manages the internal market for managers and develops an organization's cultural context and information systems. Below the CEO level, team entrepreneurs are responsible for ratifying innovative decisions, and below this team entrepreneurs are responsible for initiating innovative decisions. After presenting these two entrepreneurial forms, this paper relates them to extant research on corporate entrepreneurship and organizational forms.
Physical world applications of search algorithms for students
Authors: R. Stephen Dannelly, Carl W. Steidley, Mario A. Garcia, Sreevani Pelala
Venue: Journal of Computing Sciences in Colleges (2003)

Frequently in the Computer Science curriculum we introduce topics in an abstract fashion in which the abstraction seems perfectly straightforward as well as easily implementable to students. Such is the topic of search. Generally, the topic of search is introduced to students as early as the data structures course where the student is introduced to various algorithms for the search of tree structures. In this light students understand and are able to implement search as an abstract method of information retrieval. However, in this paper we describe a project in which students implement one kind of goal-based agent called a problem-solving agent. The development and implementation of this agent required the construction of a search process to find solutions to real-world physical problems.[4.,8.]
Reduced code size modulo scheduling in the absence of hardware support
Authors: Josep Llosa, Stefan M. Freudenberger
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Modulo scheduling is a very effective instruction scheduling technique that exploits Instruction Level Parallelism (ILP) in loop bodies by overlapping the execution of successive iterations. Unfortunately, modulo scheduling has been shown to cause heavy code expansion. To avoid the penalties of code expansion, some processors have dedicated hardware support for modulo scheduled loops. However, this dedicated hardware support has a cost in chip area, cycle time, processor complexity, and compiler complexity.This paper shows that the right combination of scheduling heuristics combined with speculative modulo scheduling can significantly reduce code expansion. In addition, several code generation schema heuristics are proposed to further reduce code expansion. The evaluations show that loops can be effectively modulo scheduled with an average code expansion only 1.5 times the original loop size. Compared with a state of the art modulo scheduler, our code size sensitive heuristics reduce the size of embedded domain benchmarks binaries by 30% on average. While performance is mostly unchanged, some applications show speed-ups up to 20% due to a reduction in instruction cache capacity misses.
Engaging students using a simple electronic daily response journal
Authors: David A. Reimann
Venue: Journal of Computing Sciences in Colleges (2001)

This paper describes and analyzes a simple mechanism designed to enhance learning by encouraging meaningful class attendance, engaging students inside the classroom, and encouraging critical thinking outside the classroom. A web-based method for a simple journal system is presented that solves some of the logistical problems that occur with paper journals. Each day after class students respond to course material by submitting two important lecture points and one unresolved question via a web form. A simple CGI script ensures a valid submission and places it into a course specific text file with other student responses. Prior to the next class, a processing script is run to convert the responses into a web page accessible to all students. The responses are reviewed anonymously in the following class, providing rapid feedback on important concepts. The daily response journal encourages students to think critically and reflect about their questions, and it promotes discussion that better includes introverted and reflective students. This review time also serves as a focused review of the previous class and provides a nice transition between course topics. Daily responses are posted and available throughout the semester for student reference and review. Students from three courses were given a questionnaire related to the effectiveness of the daily response journal. The results indicate students found the daily response helpful overall. In particular, this format improved clarification and feedback on difficult concepts, facilitated classroom discussion, fostered an inquisitive attitude, gave them a voice in class, made it easier to ask questions, and stimulated their thinking outside the classroom. This method can be easily employed in a wide variety of settings to promote student engagement in the learning process.
Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations
Authors: Huifen Chen
Venue: INFORMS Journal on Computing (2001)

We propose a specific method for generatingn-dimensional random vectors with given marginal distributions and correlation matrix. The method uses the NORTA (NORmal To Anything) approach, which generates a standard normal random vector and then transforms it into a random vector with specified marginal distributions. During initialization,n( n-1)/2 nonlinear equations need to be solved to ensure that the generated random vector has the specified correlation structure. To solve these equations, we apply retrospective approximation, a generic stochastic root-finding algorithm, with slight changes. Internal control variates are used to estimate function values. Empirical comparisons show that the control-variate variance-reduction technique improves the algorithm's convergence speed as well as its robustness. Simulation results for a variety of marginal distributions and correlation matrices are also presented.
Lie symmetries and differential Galois groups of linear equations
Authors: W. R. Oudshoorn, M. van der Put
Venue: Mathematics of Computation (2002)

For a linear ordinary differential equation the Lie algebra of its infinitesimal Lie symmetries is compared with its differential Galois group. For this purpose an algebraic formulation of Lie symmetries is developed. It turns out that there is no direct relation between the two above objects. In connection with this a new algorithm for computing the Lie symmetries of a linear ordinary differential equation is presented.
A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
Authors: Jun Zhang, Tong Xiao
Venue: The Korean Journal of Computational Applied Mathematics (2003)

An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are form to solve linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed implicitly. A diagonal perturbation strategy is implemented to enhance factorization robustness. The factors obtained are used as a preconditioner for the conjugate gradient method. Numerical experiments are used to show the robustness and efficiency of this preconditioning technique, and to compare it with two other preconditioners.
Bidirectional mobile code trust management using tamper resistant hardware
Authors: John Zachary, Richard Brooks
Venue: Mobile Networks and Applications (2003)

Trust management in a networked environment consists of authentication and integrity checking. In a mobile computing environment, both remote hosts and mobile code are suspect. We present a model that addresses trust negotiation between the remote host and the mobile code simultaneously. Our model uses tamper resistant hardware, public key cryptography, and one-way hash functions.
A new hyperelastic model for transversely isotropic solids
Authors: Oana Cazacu
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

Experimental studies on porous materials show a clear dependence of the elastic parameters on the state of stress. In this paper, the implications of this stress dependency on the recoverability of strain and on the work done during a closed stress path for transversely isotropic materials are examined. The necessary and sufficient conditions for an elastic material to be hyperelastic are given. It is shown that the elastic parameters cannot depend on the third stress invariant and that the shear modulus in the plane normal to the axis of symmetry is a linear combination of the other parameters (i.e. the Saint-Venant's approximation [1] is satisfied). Finally, an example of application of the proposed hyperelastic model is presented.
Balancing search and retrieval in hypertext: context-specific trade-offs in navigational tool use
Authors: Stephania Padovani, Mark Lansdale
Venue: International Journal of Human-Computer Studies (2003)

We compare user navigation performance using two hypertext information sites of identical node structure but embedded in different metaphors. The first is based upon the layout of a house and is consistent with Euclidean space. The second represents social links between people for which a spatial metaphor is not apparent. Search for targets within the structures, and the speed of their subsequent retrieval on a second search, is compared in a 2 × 4 × 2 factorial design manipulating: metaphor (spatial or non-spatial); navigation, tools (participants have both a site map and bookmark tool, one of these, or no tools at all) and the time pressure under which navigation is carried out (paced or unpaced). A strong main effect is found in which the spatial metaphor produces higher performance under all conditions. Similarly, time pressure has the general effect of trading-off a faster initial search with less efficient retrieval later. However, navigation tool use is highly context dependent and sometimes counterintuitive: certain conditions show poorer performance with two navigation aids than one. We argue that navigation tools are mediating structures for activities, such as bookmarking and learning the structure of the site, which represent cognitive investment for future retrieval. In this view, user performance is optimized by the balance of two potentially antagonistic conditions. First, the usability of tools and metaphor must free cognitive resources for planning; but also, the difficulty of the task and the need for planning must remain visible to the user. The implications for design are discussed.
Logic, Optimization, and Constraint Programming
Authors: John N. Hooker
Venue: INFORMS Journal on Computing (2002)

Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how these ways can be combined. It sketches the intellectual background for recent efforts at integration. It traces the history of logic-based methods in optimization and the development of constraint programming in artificial intelligence. It concludes with a review of recent research, with emphasis on schemes for integration, relaxation methods, and practical applications.
Exploring the relationship between institutional context, user participation, and organizational change in a European telecommunications company
Authors: Tom Butler, Brian Fitzgerald
Venue: Advanced topics in end user computing (2002)

While much is known about the general process of user participation in information systems development, its effect on organizational change surrounding systems implementation has not been the subject of systematic, empirical investigation. With some notable exceptions, researchers have chosen to adopt variance- rather than process-based approaches to the study of these phenomena and have, therefore, failed to capture the complex interrelationships that exist between them. This study addresses these deficiencies and makes several important contributions to the literature. First, it describes the results of a process-based case study that illustrates how one large organization's institutional context shaped and influenced the content and process of user participation and associated management of change around the development and implementation of two operational support systems. Second, it presents a theoretical model that captures the institutional and development-related contexts which shape and influence the processes of user participation and management of change. Third, this study's findings indicate that institutionally mediated factors exert a major influence on the level of user acceptance of systems, especially in relation to (a)the expected change wrought by the new system; (b) user influence and power relationships; and (c) user commitment to development-related change. Finally, the model, framework, and findings provide a useful point of departure for future research in the area.