ppxscal/embedding_network huggingface dataset:
Prefix Computations on Symmetric Multiprocessors
Authors: David R. Helman, Joseph JáJá
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We introduce a new optimal prefix computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch targeted their algorithm for implementation on a vector multiprocessor architecture, we develop our algorithm for implementation on the symmetric multiprocessor architecture (SMP). These symmetric multiprocessors dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Our prefix computation algorithm was implemented in C using POSIX threads and run on four symmetric multiprocessors - the IBM SP-2 (High Node), the HP-Convex Exemplar (S-Class), the DEC AlphaServer, and the Silicon Graphics Power Challenge.We ran our code using a variety of benchmarks which we identified to examine the dependence of our algorithm on memory access patterns. For some problems, our algorithm actually matched or exceeded the performance of the standard sequential solution using only a single thread. Moreover, in spite of the fact that the processors must compete for access to main memory, our algorithm still achieved scalable performance with up to 16 processors, which was the largest platform available to us.
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Authors: Ellis L. Johnson, George L. Nemhauser, Martin W.P. Savelsbergh
Venue: INFORMS Journal on Computing (2000)

This paper is about modeling and solving mixed integer programming (MIP) problems. In the last decade, the use of mixed integer programming models has increased dramatically. Fifteen years ago, mainframe computers were required to solve problems with a hundred integer variables. Now it is possible to solve problems with thousands of integer variables on a personal computer and obtain provably good approximate solutions to problems such as set partitioning with millions of binary variables. These advances have been made possible by developments in modeling, algorithms, software, and hardware. This paper focuses on effective modeling, preprocessing, and the methodologies of branch-and-cut and branch-and-price, which are the techniques that make it possible to treat problems with either a very large number of constraints or a very large number of variables. We show how these techniques are useful in important application areas such as network design and crew scheduling. Finally, we discuss the relatively new research areas of parallel integer programming and stochastic integer programming.
An asymptotically optimal multiversion B-tree
Authors: Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1996)

In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and querying these multiversion data efficiently, external storage structures are an absolute necessity. We propose a multiversion B-tree that supports insertions and deletions of data items at the current version and range queries and exact match queries for any version, current or past. Our multiversion B-tree is asymptotically optimal in the sense that the time and space bounds are asymptotically the same as those of the (single-version) B-tree in the worst case. The technique we present for transforming a (single-version) B-tree into a multiversion B-tree is quite general: it applies to a number of hierarchical external access structures with certain properties directly, and it can be modified for others.
Integrated Modeling Environments in Organizations: An Empirical Study
Authors: Gordon P. Wright, Alok R. Chaturvedi, Radha V. Mookerjee, Susan Garrod
Venue: Information Systems Research (1998)

Considerable attention in the information systems and management science literature has focused on computer-based modeling environments, sometimes called integrated modeling environments or model management systems. This research has been primarily concerned with suggesting features/components of modeling environments such as improved executable modeling languages for model creation, integration, and data representation; specialized database systems for managing model data; and customized model-solver software. However, there has been little (if any) empirical guidance offered in the literature about the specific needs of business and industry for computer-based integrated modeling environments. Using a data set compiled from a national survey of modelers (analysts) and model users (decision makers), we empirically investigate the validity of several of the key assumptions of modeling environment research reported in the literature, and examine the relationships between the modeling factors: data complexity, model complexity, modeling intensity, modeler/user requirements, and need for computer-based integrated modeling environments in organizations. Our empirical analysis of the data set shows that practitioners rank automated access to model data and automated error checking (e.g., model syntax and semantics checking) high as desirable components in modeling environments. We find that users prefer to have modeling environments linked to their current modeling and modeling-support software systems. Our findings further suggest that a high percentage of modelers and users are dissatisfied with the software systems they are currently using to support their modeling activities. Finally, a covariance structure analysis of the modeling environment factors clearly shows that: (a) model complexity has a direct positive effect on modeling intensity; (b) data complexity has an insignificant direct effect on modeling intensity, but has a negative effect on modeler/user requirements; and (c) modeler/user requirements have a direct positive effect on need for computer-based integrated modeling environments in organizations.
Cognitive Support for Real-Time Dynamic Decision Making
Authors: F. Javier Lerch, Donald E. Harter
Venue: Information Systems Research (2001)

This research examines how decision makers manage their attentional resources when making a series of interdependent decisions in a real-time environment. Decision strategies for real-time dynamic tasks consist of two main overlapping cognitive activities: monitoring and control. Monitoring refers to decision makers' tracking of key system variables as they work toward arriving at a decision. Control refers to the decision maker's generation, evaluation, and selection of alternative actions. In real-time tasks, these two activities compete for the same attentional resources. The questions that motivate the two studies presented here are: (1) can decision making be improved by increasing individuals' attentional resources, thereby enhancing their ability to monitor the system, and (2) can decision making be improved by providing individuals with feedback and/or feedforward control support? Our findings show that some kinds of cognitive support degrade performance, rather than enhance it. These results indicate that providing support for real-time dynamic decision making may be very difficult, and that designing effective decision aids requires a detailed understanding of the underlying cognitive processes.
A New Era for Crew Recovery at Continental Airlines
Authors: Gang Yu, Michael Argüello, Gao Song, Sandra M. McCowan, Anna White
Venue: Interfaces (2003)

Airlines face schedule disruptions daily because of unexpected events, including inclement weather, aircraft mechanical problems, and crew unavailability. These disruptions can cause flight delays and cancellations. As a result, crews may not be in position to service their remaining scheduled flights. Airlines must reassign crews quickly to cover open flights and to return them to their original schedules in a cost-effective manner while honoring all government regulations, contractual obligations, and quality-of-life requirements. CALEB Technologies developed the CrewSolver decision-support system for Continental Airlines to generate globally optimal, or near optimal, crew-recovery solutions. Since its implementation, the system has dealt successfully with several high-profile events, including the December 2000 and March 2001 Nor'easter snowstorms, the June 2001 Houston flood, and most dramatically, the September 11th terrorist attacks. In each case, Continental recovered quickly and obtained overall benefits worth millions of dollars. Continental estimates that in 2001 the CrewSolver system helped it save approximately US $40 million for major disruptions only.
A comparison of foreign authorship distribution in JASIST and the journal of documentation
Authors: Shaoyi He, Amanda Spink
Venue: Journal of the American Society for Information Science and Technology (2002)

This article reports findings from a study of the geographic distribution of foreign authors in the Journal of American Society for Information Science & Technology (JASIST) and Journal of Documentation (JDoc). Bibliographic data about foreign authors and their geographic locations from a 50-year publication period (1950-1999) are analyzed per 5-year period for both JASIST and JDoc. The distribution of foreign authors by geographic locations was analyzed for the overall trends in JASIST and JDoc. UK and Canadian authors are the most frequent foreign authors in JASIST. Authors from the United States and Canada are the most frequent foreign authors in JDoc. The top 10 geographic locations with highest number of foreign authors and the top 10 most productive foreign authors were also identified and compared for their characteristics and trends.
Collaborative internet mediated computer science
Authors: Philip L. Miller
Venue: Journal of Computing Sciences in Colleges (2002)

Carnegie Technology Education was created to make Carnegie Mellon University's software development curriculum and courses available to partnering institutions worldwide. The model and empirical results from over 6,000 at-distance students are presented.
Efficient multicast stream authentication using erasure codes
Authors: Jung Min Park, Edwin K. P. Chong, Howard Jay Siegel
Venue: ACM Transactions on Information and System Security (TISSEC) (2003)

We describe a novel method for authenticating multicast packets that is robust against packet loss. Our focus is to minimize the size of the communication overhead required to authenticate the packets. Our approach is to encode the hash values and the signatures with Rabin's Information Dispersal Algorithm (IDA) to construct an authentication scheme that amortizes a single signature operation over multiple packets. This strategy is especially efficient in terms of space overhead, because just the essential elements needed for authentication (i.e., one hash per packet and one signature per group of packets) are used in conjunction with an erasure code that is space optimal. Using asymptotic techniques, we derive the authentication probability of our scheme using two different bursty loss models. A lower bound of the authentication probability is also derived for one of the loss models. To evaluate the performance of our scheme, we compare our technique with four other previously proposed schemes using empirical results.
Effective binary perspectives in algorithmic problem solving
Authors: David Ginat
Venue: Journal on Educational Resources in Computing (JERIC) (2002)

The effectiveness of viewing, representing, and manipulating data via binary values is illustrated in the domain of algorithmic problem solving. A variety of illuminating binary aspects, regarded as binary perspectives, are displayed through four lively algorithmic challenges, some of which are two-player games. The illustrations demonstrate the benefits of invoking binary representation of numbers, binary complement, bit-by-bit processing, parity considerations, and the reduction of an integer task into a 0/1 task. The solutions to the challenges are presented gradually, encapsulating general algorithmic considerations and problem-solving methods, including invariant properties, stepwise refinement, processing by atomic components, auxiliary coloring, backward reasoning, and inductive generalization. Each of the illustrations is tied to a variety of referenced algorithmic schemes and applications, which employ the aspects demonstrated in this article. The variety of binary aspects, algorithmic considerations, and problem-solving methods make these illustrations appealing teaching resources for computer science educators, in particular in the domain of algorithms.
Using FEM and neural network prediction on hydrodynamic deep drawing of T-piece maximum length
Authors: J. C. Lin
Venue: Finite Elements in Analysis and Design (2003)

The incremental updated Lagrangian elasto-plastic finite element method and abductive network was applied in this study to analyze hydrodynamic deep drawing of 3D T-piece design. A series of 24 sets of different geometry tools were used for a 3D T-piece deep drawing process, with difference variations in the die radius, material radius and matching the different thickness of product.The results of the deep-drawing maximum length from FEM-simulation are then input to a neural network to establish a model for the T-piece deep-drawing variables. The neural network is composed of a number of functional nodes. Once the T-piece control parameters (material thickness, material radius and die radius) are given, the drawing processing performance (deep-drawing maximum length) can be accurately predicted by this developed network. This research achieved a satisfactory result based on demonstration of simulation, proving that it is a new and feasible approach used in control of T-piece drawing process of materials.
A tournament problem
Authors: M. H. Eggar
Venue: Discrete Mathematics (2003)

When teams play a round robin tournament, the number of individual players with a sufficiently high average of wins is investigated.
The intrinsic problems of structural heterogeneity and an approach to their solution
Authors: Theo Härder, Günter Sauter, Joachim Thomas
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1999)

This paper focuses on the problems that arise when integrating data from heterogeneous sources in a single, unified database view. At first, we give a detailed analysis of the kinds of structural heterogeneity that occur when unified views are derived from different database systems. We present the results in a multiple tier architecture which distinguishes different levels of heterogeneity and relates them to their underlying causes as well as to the mapping conflicts resulting from the view derivation process. As the second essential contribution, the paper presents our approach to a mapping language solving the identified conflicts. The main characteristics of the language are its descriptiveness, its capability to map between schemas written in the relational, object-oriented, ER, or EXPRESS data model, and its facilities for specifying user-defined update operations on the view that are to be propagated to the data sources. Finally, we briefly discuss how this mapping information is employed to convert queries formulated with respect to the integrated view, into database operations over the heterogeneous data sources.
Comparison of the SAS, SPSS and STATISTICA systems in the area of clustering variables
Authors: Hana Rezanková, Dušan Húsek
Venue: Computational Statistics Data Analysis (2002)

Techniques for clustering variables that are contained in statistical packages are characterized, and capabilities of the SAS, SPSS and STATISTICA systems in this area are shown. The paper concentrates on factor analysis, nonlinear principle component analysis, cluster analysis, multidimensional scaling and multiple correspondence analysis. Important capabilities of the S-PLUS package and STATISTICA Neural Network software product are described. The main restrictions for the use of some methods are mentioned.
Information access on the wide open web
Authors: Ubiquity staff
Venue: Ubiquity (2003)

RLG's James Michalko discusses the issues surrounding the access and retrieval of scholarly information in today's environment of choice.
Spatially Adapted Multiwavelets and Sparse Representation of Integral Equations on General Geometries
Authors: Julio E. Castrillón-Candás, Kevin Amaratunga
Venue: SIAM Journal on Scientific Computing (2002)

In this paper we develop irregular wavelet representations for complex domains with the goal of demonstrating their potential for three-dimensional (3D) scientific and engineering computing applications. We show existence and construction of a large class of continuous spatially adapted multiwavelets in $R^{\eta}$ with vanishing moments over complex geometries. These wavelets share all of the major advantages of conventional wavelets in that they provide an analytical tool for studying data, functions, and operators at different scales. However, unlike conventional wavelets, which are restricted to uniform grids, spatially adapted multiwavelets allow fast transform, localization, and decorrelation on complex meshes, such as those encountered in finite element modeling. We show how these new constructions can be applied to partial differential equations cast in the integral form. We implement the wavelet approach for several model two-dimensional (2D) and 3D potential problems. It is shown that the optimal convergence rate is achieved, with only ${\cal O}( N ( {{\rm log}N} )^{\alpha} )$ entries of the discrete operator matrix, where $\alpha$ is a small number and N is the number of unknowns.
Knowledge, action, and the frame problem
Authors: Richard B. Scherl, Hector J. Levesque
Venue: Artificial Intelligence (2003)

This paper proposes a method for handling the frame problem for knowledge-producing actions. An example of a knowledge-producing action is a sensing operation performed by a robot to determine whether or not there is an object of a particular shape within its grasp. The work is an extension of Reiter's approach to the frame problem for ordinary actions and Moore's work on knowledge and action. The properties of our specification are that knowledge-producing actions do not affect fluents other than the knowledge fluent, and actions that are not knowledge-producing only affect the knowledge fluent as appropriate. In addition, memory emerges as a side-effect: if something is known in a certain situation, it remains known at successor situations, unless something relevant has changed. Also, it will be shown that a form of regression examined by Reiter for reducing reasoning about future situations to reasoning about the initial situation now also applies to knowledge-producing actions.
Crisis Construction and Organizational Learning: Capability Building in Catching-Up at Hyundai Motor
Authors: Bernd Skiera, Sonke Albers, Linsu Kim
Venue: Organization Science (1998)

Effective organizational learning requires high absorptive capacity, which has two major elements: prior knowledge base and intensity of effort. Hyundai Motor Company, the most dynamic automobile producer in developing countries, pursued a strategy of independence in developing absorptive capacity. In its process of advancing from one phase to the next through the preparation for and acquisition, assimilation, and improvement of foreign technologies, Hyundai acquired migratory knowledge to expand its prior knowledge base and proactively constructed crises as a strategic means of intensifying its learning effort. Unlike externally evoked crises, proactively constructed internal crises present a clear performance gap, shift learning orientation from imitation to innovation, and increase the intensity of effort in organizational learning. Such crisis cons truction is an evocative and galvanizing device in the personal repertoires of proactive top managers. A similar process of opportunistic learning is also evident in other industries in Korea.
Information voyeurism: social impact of physically large displays on information privacy
Authors: Desney S. Tan, Mary Czerwinski
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

A common observation when working on physically large displays, such as wall-sized projection, is that a certain amount of information privacy is lost. A common explanation for this loss in privacy is the higher legibility of information presented on large displays. In this paper, we present a novel paradigm for measuring whether or not a user has read certain content. We show that, even with constant visual angles and legibility, visitors are still more likely to glance over a user's shoulder to read information on a large wall-projected display than on a smaller traditional desktop monitor. We assert that, in addition to legibility, there are more subtle social factors that may contribute to the loss of privacy on physically large displays. Implementing hardware and software ideas for mitigating this loss of privacy remains future research.
Multiple positive solutions for first order nonlinear integro-differential equations in Banach spaces
Authors: Dajun Guo
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

By using the fixed point index theory, the author obtains the existence of two positive solutions for a boundary value problem of first-order nonlinear integro-differential equations on an infinite interval in a real Banach space.
Scientific workflow management in a distributed production environment
Authors: Nigel Baker, Richard McClatchey, Jean-Marie Le Goff
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

The Compact Muon Solenoid (CMS) high energy physics experiment will comprise several large high resolution detectors each of which will be constructed out of over a million precision parts and will be produced and assembled during the next decade by specialised centres distributed world-wide. Each constituent part of each detector must be accurately measured and tested locally prior to its ultimate assembly and integration in the experimental area at CERN. The CRISTAL (Concurrent Repositories and Information System for Tracking Assembly and production Lifecycles) system is a prototype being developed to monitor and control the production and assembly process of 110000 lead tungstate (PbWO/sub 4/) mono-crystals, and their associated fast electronics, to be installed in the CMS Electromagnetic Calorimeter (ECAL). The software will be generic in design and hence reusable for other CMS detector groups. The paper discusses the distributed computing problems and design issues posed by this project.
Towards efficient resource on-demand in Grid Computing
Authors: Kun Yang, Xin Guo, Alex Galis, Bo Yang, Dayou Liu
Venue: ACM SIGOPS Operating Systems Review (2003)

The essence of Grid Computing is to provide efficient Resource on Demand (RoD). This paper addresses this challenge from the perspective of network, the living platform of Grid, by providing effective Quality of Service (QoS) mechanisms (both IntServ and DiffServ) inside the Grid networking environment. Specifically, the efficiency of this QoS mechanism is maximized by policy-based management taking care of the flexible control of QoS parameters/components and active networks technology looking after the fast delivery of various QoS configurations. The first experiment exemplified the current implementation status.