ppxscal/embedding_network huggingface dataset:
View consistencies and exact implementations
Authors: Hon F. Li, Gabriel Girard
Venue: Parallel Computing (2003)

Numerous shared memory consistency models have appeared for the purpose of obtaining better shared memory parallel computers, ones which suffer less from long memory latency. This paper uses the primitive notion of program-order and value-order to define global view. Using this as a seed, various consistency models evolve and form hierarchies of models. The creation of these models comes naturally via one of the following means: (i) a global view is augmented with additional ordering among its operations whenever some orderings exist, or (ii) a global view should not contain certain orderings. The former involves augmentation rules, and the latter involves ordering requirements. These models may attract different implementations and a notion of exact implementation is developed. The usefulness of these models is also analyzed and exemplified.
A symbolic approach to syllogistic reasoning
Authors: Mohamed Yasser Khayata, Daniel Pacholczyk
Venue: Technologies for constructing intelligent systems: Tasks (2002)

In this paper we present a new approach to a symbolic treatment of quantified statements having the following form "Q A's are B's", knowing that A and B are labels denoting sets, and Q is a linguistic quantifier interpreted as a proportion evaluated in a qualitative way. Our model can be viewed as a symbolic generalization of statistical conditional probability notions as well as a symbolic generalization of the classical probabilistic operators. Our approach is founded on a symbolic finite M-valued logic in which the graduation scale of M symbolic quantifiers is translated in terms of truth degrees of a particular predicate. Then, we present symbolic syllogisms allowing us to deal with quantified statements.
Vector vs. superscalar and VLIW architectures for embedded multimedia benchmarks
Authors: Christoforos Kozyrakis, David Patterson
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Multimedia processing on embedded devices requires an architecture that leads to high performance, low power consumption, reduced design complexity, and small code size. In this paper, we use EEMBC, an industrial benchmark suite, to compare the VIRAM vector architecture to superscalar and VLIW processors for embedded multimedia applications. The comparison covers the VIRAM instruction set, vectorizing compiler, and the prototype chip that integrates a vector processor with DRAM main memory.We demonstrate that executable code for VIRAM is up to 10 times smaller than VLIW code and comparable to x86 CISC code. The simple, cache-less VIRAM chip is 2 times faster than a 4-way superscalar RISC processor that uses a 5 times faster clock frequency and consumes 10 times more power. VIRAM is also 10 times faster than cache-based VLIW processors. Even after manual optimization of the VLIW code and insertion of SIMD and DSP instructions, the single-issue VlRAM processor is 60%faster than 5-way to 8-way VLIW designs.
Panel discussion: laboratories for a computer security course
Authors: Charles Frank, Sharon Mason, Mary Micco, Robert Montante, Hart Rossman
Venue: Journal of Computing Sciences in Colleges (2003)

The panel members participated in an NSF sponsored faculty development Cybersecurity Workshop [1] held at Indiana University of Pennsylvania in August, 2001. The goal of this workshop was to help address the national shortage of information security workers by preparing faculty members to teach cybersecurity. Mary Micco was an organizer of the workshop. Hart Rossman as an instructor. Charles Frank, Sharon Mason, and Robert Montante were attendees. The panel members will relate the lessons learned at this workshop and how they applied these lessons to incorporating information security into computer laboratories.
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems
Authors: A. T. Ernst, M. Krishnamoorthy
Venue: INFORMS Journal on Computing (1998)

The problem of locating hub facilities arises in the design of transportation and telecommunications networks. The p-hub median problem belongs to a class of discrete location-allocation problems in which all the hubs are fully interconnected. Nonhub nodes may be either uniquely or multiply allocated to hubs. The hubs are uncapacitated and the total number of hubs, p is specified a priori. We describe a novel exact-solution approach for solving the multiple-allocation case of the p-hub median problem and show how a similar method can be adapted for solving the more difficult single-allocation case. The methods for both of these solve shortest-path problems to obtain lower bounds, which are used in a branch-and-bound scheme to obtain the exact solution. Numerical results show the superiority of this new approach over traditional LP-based methods.
Comprehensive synchronization elimination for Java
Authors: Jonathan Aldrich, Emin Gün Sirer, Craig Chambers, Susan J. Eggers
Venue: Science of Computer Programming (2003)

In this paper, we describe three novel analyses for eliminating unnecessary synchronization that remove over 70% of dynamic synchronization operations on the majority of our 15 benchmarks and improve the bottom-line performance of three by 37-53%. Our whole-program analyses attack three frequent forms of unnecessary synchronization: thread-local synchronization, reentrant synchronization, and enclosed lock synchronization. We motivate the design of our analyses with a study of the kinds of unnecessary synchronization found in a suite of single- and multithreaded benchmarks of different sizes and drawn from a variety of domains. We analyze the performance of our optimizations in terms of dynamic operations removed and run-time speedup. We also show that our analyses may enable the use of simpler synchronization models than the model found in Java, at little or no additional cost in execution time. The synchronization optimizations, we describe enable programmers to design efficient, reusable and maintainable libraries and systems in Java without cumbersome manual code restructuring.
Data schema integration in web-enabled systems
Authors: Silvana Castano, Valeria De Antonellis, Sabrina De Capitani di Vimercati, Michele Melchiori
Venue: Web-enabled systems integration: practices and challenges (2003)

In the recent years, most enterprises have started to experience the use of the Web for work cooperation to improve efficiency and information interchange. As a consequence, enterprise information systems are being migrated onto the web, and methods and tools to effectively access data provided on the web in different formats from the autonomous heterogeneous data sources are required. In particular, integration tools are required to obtain a uniform data representation by abstracting from the formats in the origin data sources and thus to build a global information space suitable for query and access interface.The chapter will be devoted to discuss the characteristics of data schema integration in web-enabled, and to describe a comprehensive integration scheme for organizing heterogeneous information sources over the web, to enhance the capability of information interchange and interoperation among web-enabled systems.
Parallelized Network Simulators for Message-Passing Parallel Programs
Authors: Phillip M. Dickens, Philip Heidelberger, David M. Nicol
Venue: Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (1995)

This paper describes a software tool, LAPSE (Large Application Parallel Simulation Environment), for the simulation of large-scale programs written for the Intel Paragon, executed on smaller-scale machines. Two timing simulators are themselves parallelized; this paper describes the conservative synchronization algorithm we have developed to synchronize the simulation. We present performance data taken from LAPSE runs of an indirect linear system solver where we consider issues of simulated network complexity, and processor usage.
An introduction to the Smarandache square complementary function
Authors: Felice Russo
Venue: Smarandache notions (2002)

In this paper the main properties of Smarandache Square Complementary function has been analysed. Several problems still unsolved are reported too.
A user-centered approach to designing home network interfaces
Authors: Kook Hyun Chung, Kyoung Soon Oh, Cheong Hyun Lee, Jae Hyun Park, Sunae Kim, Soon Hee Kim, Beth Loring, Chris Hass
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This case study describes our approach to enhancing the way family members may interact with each other - and their homes - in the near future. Samsung Electronics and American Institutes for Research worked together to show how the user-centered design of network technology in the home could best enhance a family's ability to com-municate, play, and live harmoniously. We conducted user research in South Korea and in the U.S., held fast-paced collaborative design sessions, and created interaction design guidelines to inform the development of an innovative line of home networked products. The final user interface was prototyped on Samsung's Home Network Control PDA and showcased at the 2002 Consumer Electronics Show.
Random Yield and Random Demand in a Production System with Downward Substitution
Authors: Arthur Hsu, Yehuda Bassok
Venue: Operations Research (1999)

in this paper, we present and solve a single-period, multiproduct, downward substitution model. Our model has one raw material as the production input and produces N different products as outputs. The demands and yields for the products are random. We determine the optimal production input and allocation of the N products to satisfy demands. The problem is modeled as a two-stage stochastic program, which we show can be decomposed into a parameterized network flow problem. We present and compare three different solution methods: a stochastic linear program, a decomposition resulting in a series of network flow subproblems, and a decomposition where the same network flow subproblems are solved by a new greedy algorithm.
Going back in hypertext
Authors: Gene Golovchinsky
Venue: ACM SIGWEB Newsletter (2000)

Hypertext interfaces typically involve navigation, the act (and interaction) of moving from one piece of information to another. Navigation can be exploratory, or it may involve backtracking to some previously-visited node. While backtracking interfaces are common, they may not reflect differences in readers' purposes and mental models. This paper draws on some empirical evidence regarding navigation within documents to suggest an improvement on traditional hypertext navigation, and proposes a time-based model of backtracking.
Operations Research at Bell Laboratories through the 1970s: Part II
Authors: Cree S. Dawson, Charles J. Mccallum, R. Bradford Murphy, Eric Wolman
Venue: Operations Research (2000)

This historical account of operations research at Bell Laboratories was drafted in the late 1970s when the authors were part of the Operations Research Center within Bell Laboratories at AT&T; it has not previously appeared in the open literature. We have added a few references to later publications that describe particular aspects of the period covered. Discussions of technological practices and organizational arrangements expressed in the present tense represent a viewpoint of about 1980, before "divestiture" split up the Bell System. A comprehensive table of contents for parts I, II, and III can be found in the Online Collection of theOperations Research Home Page, at www.informs.org/pubs.We describe the work done in the Bell System up to about 1980, mainly at Bell Labs, both in developing the techniques of operations research and in applying them to the telecommunications business. This account does not include military OR or direct support of other federal government activities. Part II covers capacity expansion and operations analysis.
An image retrieval method using DCT features
Authors: Yun Fan, Runsheng Wang
Venue: Journal of Computer Science and Technology (2002)

In this paper a new image representation for compressed domain image retrieval and an image retrieval system are presented. To represent images compactly and hierarchically, multiple features such as color and texture features directly extracted from DCT coefficients are structurally organized using vector quantization. To train the codebook, a new Minimum Description Length vector quantization algorithm is used and it automatically decides the number of code words. To compare two images using the proposed representation, a new efficient similarity measure is designed. The new method is applied to an image database with 1,005 pictures. The results demonstrate that the method is applid to an image database with methods and two DCT-based image retrieval methods.
Warranty Economic Decision Models: a Summary and Some Suggested Directions for Future Research
Authors: Marlin U. Thomas, Sridevi S. Rao
Venue: Operations Research (1999)

Product guarantees or warranties have been around for generations, but formal approaches for establishing and examining warranties have been considered only during the past 20 years. A review of the literature on warranty models and analysis methods is provided, along with some suggestions for further research.
A Randomized Linear Programming Method for Computing Network Bid Prices
Authors: Kalyan Talluri, Garrett Van Ryzin
Venue: Transportation Science (1999)

We analyze a randomized version of the deterministic linear programming (DLP) method for computing network bid prices. The method consists of simulating a sequence of realizations of itinerary demand and solving deterministic linear programs to allocate capacity to itineraries for each realization. The dual prices from this sequence are then averaged to form a bid price approximation. This randomized linear programming (RLP) method is only slightly more complicated to implement than the DLP method. We show that the RLP method can be viewed as a procedure for estimating the gradient of the expected perfect information (PI) network revenue. That is, the expected revenue obtained with full information on future demand realizations. The expected PI revenue can, in turn, be viewed as an approximation to the optimal value function. We establish conditions under which the RLP procedure provides an unbiased estimator of the gradient of the expected PI revenue. Computational tests are performed to evaluate the revenue performance of the RLP method compared to the DLP.
Coordinating Independent Buyers in a Distribution System to Increase a Vendor's Profits
Authors: Qinan Wang
Venue: Manufacturing Service Operations Management (2001)

We study the coordination of a two-echelon distribution system where a vendor distributes a single product to a set of independent buyers. The problem is analyzed as a Stackelberg game in which the vendor acts as the leader and buyers act as followers. A simple strategy is developed for the vendor to employ a uniform quantity-discount policy to coordinate buyers' replenishment times by the power-of-two policy. Solution procedures are developed for the equilibrium strategy. It is shown that time coordination generally has a substantial benefit for the vendor, although the benefit to the buyers may be limited. Furthermore, uniform quantity discounts to all buyers are normally feasible but not sufficient to achieve perfect channel coordination when buyers act independently. The proposed strategy obtains a high proportion of the maximum benefit under perfect channel coordination.
National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios under the Free-Flight Paradigm
Authors: Hanif D. Sherali, J. Cole Smith, Antonio A. Trani, Srinivas Sale
Venue: Transportation Science (2000)

Free-Flight is a paradigm of aircraft operations that permits the selection of more cost-effective routes for flights rather than simple traversals between designated way-points, from various origins to different destinations. In this paper, we consider the effect of this paradigm on sector workloads and potential conflicts or collision risks, based on current and projected levels of commercial air traffic. To accomplish this task, we first develop an Airspace Sector Occupancy Model (AOM) that identifies the occupancies of flights within three-dimensional (possibly nonconvex) regions of space called sectors, by utilizing an iterative procedure to trace each flight's progress through sector modules, that constitute the sectors. Next, we develop an Aircraft Encounter Model (AEM), which uses the information obtained from AOM to efficiently estimate the number and nature of blind-conflicts (i.e., conflicts under no avoidance or resolution maneuvers) resulting from a selected mix of flight plans. Besides identifying the existence of a conflict, AEM also provides useful information on the severity of the conflict and its geometry, such as the faces across which an intruder enters and exits the protective shell or envelope of another aircraft, the duration of intrusion, its relative heading, and the point of closest approach. For purposes of evaluation and assessment, we also develop a metric that provides a summary of the conflicts in terms of severities and difficulty of resolution. Finally, we apply these models to real data provided by the Federal Aviation Administration (FAA) for evaluating several Free-Flight scenarios under wind-optimized conditions. This study constitutes the first phase of a project undertaken by a joint FAA/Eurocontrol Collision Risk Modeling Group to develop tasks for investigating air traffic control strategies and related workload and collision risk consequences under various scenarios. Follow-on work will incorporate pilot blunders, random deviations, and air traffic control man-in-the-loop maneuvers within the context of the Free-Flight paradigm, using the basic tools developed in the present study.
Registration of technical drawings and calibrated images for industrial augmented reality
Authors: Mirko Appel, Nassir Navab
Venue: Machine Vision and Applications (2002)

Despite tremendous progress in 3D modelling technology, most sites in traditional industries do not have a computer model of their facilities at their disposal. In these industries, 2D technical drawings are typically the most commonly used documents. In many cases, a database of fully calibrated and oriented photograrnmetric images of parts of the plant is also available. These images are often used for metric measurement and 3D as-built modelling. For planning revamps and maintenance, it is necessary to use industrial drawings as well as images and 3D models represented in a common "world" coordinate system. This paper proposes a method for full integration of technical drawings, calibrated images and as-built 3D models. A new algorithm is developed in order to use only a few correspondences between points on a technical drawing and multiple images to estimate a metric planar transformation between the drawing and the world coordinate system. The paper describes the mathematical relationship between this transformation and the set of homographies needed for merging the technical drawing with all the calibrated images. The method is implemented and fully integrated into an industrial software we developed for 3D as-built reconstruction. We present examples of a real application, in which the method is successfully applied to create an augmented reality representation of a waste water plant.
Locally explicit schemes for three-dimensional diffusion with a non-local boundary specification
Authors: Mehdi Dehghan
Venue: Applied Mathematics and Computation (2003)

Two finite difference schemes based on the classical three-point forward time centred space (FTCS) method and the five-point FTCS formula, are used to solve the three-dimensional time dependent diffusion equation with a non-local boundary specification. In these methods locally one-dimensional (LOD) procedures are used to extend the one-dimensional techniques to solve the three-dimensional problem. Numerical integration procedures are also employed to overcome the non-local boundary specification. Results from some numerical experiments are presented, including error estimates derived in the maximum norm. The results of numerical testing show that the LOD techniques give better results than the fully explicit schemes. The CPU times used for the procedures developed in this article are also reported.
QMView and GAMESS: integration into the world wide computational grid
Authors: Kim K. Baldridge, Jerry P. Greenberg, Stephen T. Elbert, Stephen Mock, Philip Papadopoulos
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

High performance computing, storage, visualization, and database infrastructures are increasing geometrically in complexity as scientists move towards grid-based computing. While this is natural, it has the effect of pushing computational capabilities beyond the reach of scientists because of the time needed to harness the infrastructure. Hiding the complexity of networked resources becomes essential if scientists are to utilize them effectively. In this work, we describe our efforts to integrate various computational chemistry components into a scientific computing environment. We briefly describe improvements we have made to individual components of the chemistry environment as well as future directions, followed by a more in-depth discussion of our strategy for integration into a grid workflow environment based on web services, which enables access to remote resources while shielding users from the complexities of the grid infrastructures. A preliminary schema for storing data obtained from computational chemistry calculations is also described.
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Authors: Jean-François Cordeau, Goran Stojkovic, François Soumis, Jacques Desrosiers
Venue: Transportation Science (2001)

Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a minimum-cost set of aircraft routes and crew pairings such that each flight leg is covered by one aircraft and one crew, and side constraints are satisfied. While some side constraints such as maximum flight time and maintenance requirements involve only crews or aircraft, linking constraints impose minimum connection times for crews that depend on aircraft connections. To handle these linking constraints, a solution approach based on Benders decomposition is proposed. The solution process iterates between a master problem that solves the aircraft routing problem, and a subproblem that solves the crew pairing problem. Because of their particular structure, both of these problems are solved by column generation. A heuristic branch-and-bound method is used to compute integer solutions. On a set of test instances based on data provided by an airline, the integrated approach produced significant cost savings in comparison with the sequential planning process commonly used in practice. The largest instance solved contains more than 500 flight legs over a 3-day period.