ppxscal/embedding_network huggingface dataset:
Scenario Reduction Algorithms in Stochastic Programming
Authors: Holger Heitsch, Werner Römisch
Venue: Computational Optimization and Applications (2003)

We consider convex stochastic programs with an (approximate) initial probability distribution P having finite support supp P, i.e., finitely many scenarios. The behaviour of such stochastic programs is stable with respect to perturbations of P measured in terms of a Fortet-Mourier probability metric. The problem of optimal scenario reduction consists in determining a probability measure that is supported by a subset of supp P of prescribed cardinality and is closest to P in terms of such a probability metric. Two new versions of forward and backward type algorithms are presented for computing such optimally reduced probability measures approximately. Compared to earlier versions, the computational performance (accuracy, running time) of the new algorithms has been improved considerably. Numerical experience is reported for different instances of scenario trees with computable optimal lower bounds. The test examples also include a ternary scenario tree representing the weekly electrical load process in a power management model.
Task Scheduling in Multiprocessing Systems
Authors: Hesham El-Rewini, Hesham H. Ali, Ted Lewis
Venue: Computer (1995)

A scheduling problem arises when concurrent parts of a parallel program must be arranged in time and space so that the program's overall execution time is minimized. A program can be viewed as a collection of tasks that may run serially or in parallel. The goal of scheduling is to determine an assignment of tasks to processing elements and to prioritize task execution to optimize certain performance measures. The authors look at different forms of the scheduling problem and survey relevant models, optimal algorithms, heuristic algorithms, and useful software tools. They provide models for representing parallel programs, parallel systems, and communication cost. Examples and algorithms illustrate various approaches to scheduling. The scheduling problem, which is NP-complete, has led to the development of numerous heuristics for approximating an optimal solution; each may work under different circumstances. The effectiveness of these heuristics depends on factors such as grain size, interconnection topology, communication bandwidth, and program structure. Scheduling software tools represent another promising approach. Working with such tools can help a programmer find answers to numerous questions that arise in developing a parallel application. The authors describe three of these scheduling tools.
Revised Report on the Algorithmic Language Scheme
Authors: H. Abelson, R. K. Dybvig, C. T. Haynes, G. J. Rozas, N. I. Adams Iv, D. P. Friedman, E. Kohlbecker, G. L. Steele,  Jr., D. H. Bartley, R. Halstead, D. Oxley, G. J. Sussman, G. Brooks, C. Hanson, K. M. Pitman, M. Wand
Venue: Higher-Order and Symbolic Computation (1998)

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele, Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including imperative, functional, and message passing styles, find convenient expression in Scheme.The introduction offers a brief history of the language and of the report.The first three chapters present the fundamental ideas of the language and describe the notational conventions used for describing the language and for writing programs in the language.Sections 5 and 6 describe the syntax and semantics of expressions, programs, and definitions.Section 7 describes Scheme&lsquo;s built-in procedures, which include all of the language&lsquo;s data manipulation and input/output primitives.Section 8 provides a formal syntax for Scheme written in extended BNF, along with a formal denotational semantics. An example of the use of the language follows the formal syntax and semantics.The report concludes with a list of references and an alphabetic index and is followed by a short list of clarifications and corrections.
Optical Correlators for Space Applications: Prospects and Problems
Authors: Edward R. Washwell, Gregory O. Cheen, Chao H. Huang
Venue: IEEE Micro (1994)

Demanding ever-increasing throughput and processing power, space applications push the outer limits of conventional pattern-recognition technology. Optical correlators offer a siren's song of potential advantages over all-electronic devices. Realizing these advantages, however, will be difficult because of limitations on current spatial light modulators, key elements in an optical correlator. We propose a promising architecture that may overcome these limitations.
High-Quality and High-Speed Wireless Multimedia Transmission Technologyfor Personal Handy Phone System
Authors: Hitoshi Takanashi, Toshiaki Tanaka, Tomoyoshi Oono, Hideo Matsuki, Takeshi Hattori
Venue: Wireless Personal Communications: An International Journal (1999)

The Personal Handy-phone System (PHS), developed as a PCS, has been very widely accepted. This system offers many benefits as the infrastructure of the mobile data communication services that are expected to be available soon with the popularity of nomadic computing. Data communication systems based on PHS and some applications are proposed in this paper. One of the key technologies, an error control scheme, is also introduced. Three kinds of possible system configurations are discussed as a data communication platform for PHS. One of them has an ARQ function which corrects all errors that occur in the propagation path. Conventional application software on nomadic computers can be used in the mobile environment because this ARQ function is installed as a lower layer protocol. The introduced system connects all mobile computers to all servers that are on the networks which include ISDN, the conventional analog PSTN, cellular networks and PHS networks.
A note on a consistency property for permutations
Authors: Jean Derks, Hans Peters
Venue: Discrete Mathematics (2002)

In cooperative game theory allocation of earnings to players may take place on the basis of selectors or--more restrictively--consistent selectors, or on the basis of a permutation representing the queueing of the players. This note gives a graph theoretic characterization of those situations in which the latter allocation method results in allocation with consistent selectors.
The Visual Hull Concept for Silhouette-Based Image Understanding
Authors: A. Laurentini
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Many algorithms for both identifying and reconstructing a 3-D object are based on the 2-D silhouettes of the object. In general, identifying a nonconvex object using a silhouette-based approach implies neglecting some features of its surface as identification clues. The same features cannot be reconstructed by volume intersection techniques using multiple silhouettes of the object. This paper addresses the problem of finding which parts of a nonconvex object are relevant for silhouette-based image understanding. For this purpose, the geometric concept of visual hull of a 3-D object is introduced. This is the closest approximation of object S that can be obtained with the volume intersection approach; it is the maximal object silhouette-equivalent to S, i.e., which can be substituted for S without affecting any silhouette. Only the parts of the surface of S that also lie on the surface of the visual hull can be reconstructed or identified using silhouette-based algorithms. The visual hull depends not only on the object but also on the region allowed to the viewpoint. Two main viewing regions result in the external and internal visual hull. In the former case the viewing region is related to the convex hull of S, in the latter it is bounded by S. The internal visual hull also admits an interpretation not related to silhouettes. Algorithms for computing visual hulls are presented and their complexity analyzed. In general, the visual hull of a 3-D planar face object turns out to be bounded by planar and curved patches.
Array-Based Analog Computation
Authors: Alan H. Kramer
Venue: IEEE Micro (1996)

The Neural Network Design Group at SGS-Thomson Microelectronics has been working to explore the advantages and limitations of analog computation and neural network architectures. We are investigating 3 large-scale analog VLSI chips, all of which work on problems in image processing. The use of analog computing arrays, because of their efficiency and regularity, have formed the basis of all of our designs, while several different computing modes, including current, charge, and conductance have been explored. Another area in which we have focused is on the use of floating-gate devices for both non-volatile analog storage and computation. This paper shares insights into the lessons we have learned, the results we have achieved and the limitations we have encountered. Particular emphasis is made on two subjects: computational efficiency and equivalent precision of array-based analog computing circuits.
Oriented tensor reconstruction: tracing neural pathways from diffusion tensor MRI
Authors: Leonid Zhukov, Alan H. Barr
Venue: Proceedings of the conference on Visualization '02 (2002)

In this paper we develop a new technique for tracing anatomical fibers from 3D tensor fields. The technique extracts salient tensor features using a local regularization technique that allows the algorithm to cross noisy regions and bridge gaps in the data. We applied the method to human brain DT-MRI data and recovered identifiable anatomical structures that correspond to the white matter brain-fiber pathways. The images in this paper are derived from a dataset having 121x88x60 resolution. We were able to recover fibers with less than the voxel size resolution by applying the regularization technique, i.e., using a priori assumptions about fiber smoothness. The regularization procedure is done through a moving least squares filter directly incorporated in the tracing algorithm.
Data Semantics for Improving Retrieval Performance of Digital News Video Systems
Authors: Gulrukh Ahanger, Thomas D. C. Little
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We propose a novel four-step hybrid approach for retrieval and composition of video newscasts based on information contained in different metadata sets. In the first step, we use conventional retrieval techniques to isolate video segments from the data universe using segment metadata. In the second step, retrieved segments are clustered into potential news items using a dynamic technique sensitive to the information contained in the segments. In the third step, we apply a transitive search technique to increase the recall of the retrieval system. In the final step, we increase recall performance by identifying segments possessing creation-time relationships. A quantitative analysis of the performance of the process on a newscast composition shows an increase in recall by 59 percent over the conventional keyword-based search technique used in the first step.
Introducing Tobus: the System Bus in the TRON Architecture
Authors: Ken Sakamura, Royichi Sano, Kazuhiko Honma
Venue: IEEE Micro (1988)

The Japanese TRON (The Real-Time Operating Nucleus) project has as its goal the design of a computer architecture that includes a CPU, operating systems and a man-machine interface. Peripherals are portable because TRON designers set a board-level standard for the system bus protocol. The end product transfers data at rates from 50 M to 100 M bytes/s. A description is given of Tobus, the system bus designed to fit the standard. Bus arbitration, data transfer and interrupt-handling are discussed.
Verification of timed automata based on similarity
Authors: Piotr Dembiński, Wojciech Penczek, Agata Pólrola
Venue: Fundamenta Informaticae (2002)

The paper presents a modification of the standard partitioning technique to generate abstract state spaces preserving similarity for Timed Automata. Since this relation is weaker than bisimilarity, most of the obtained models (state spaces) are smaller than bisimilar ones, but still preserve the universal fragments of branching time temporal logics. The theoretical results are exemplified for strong, delay, and observational simulation relations.
The Future of Microprocessors
Authors: Albert Yu
Venue: IEEE Micro (1996)

In my role as head of Intel's microprocessor products, I am often asked to paint a picture of the microprocessor of the future. Even if our newest processor has just hit the streets and has not even come close to full use, people naturally crave information about where they're going rather than where they've been. My colleagues and I have been trying to identify trends about the microprocessor of the future for about 10 years now. While these are based on a wide variety of unknown factors inherent in developing new technology, for the most part, we have been close to the mark. However, before making statements about microprocessor trends 10 years out--Micro 2006--we revisit our past statements about the microprocessor of today and the microprocessor of 2000. Then we can see where we have been right and where wrong. This retrospective will reveal important trends that promise to give some insight into the microprocessor of the next decade.
Architectures and VLSI Implementations of the AES-Proposal Rijndael
Authors: N. Sklavos, O. Koufopavlou
Venue: IEEE Transactions on Computers (2002)

Two architectures and VLSI implementations of the AES Proposal, Rijndael, are presented in this paper. These alternative architectures are operated both for encryption and decryption process. They reduce the required hardware resources and achieve high-speed performance. Their design philosophy is completely different. The first uses feedback logic and reaches a throughput value equal to 259 Mbit/sec. It performs efficiently in applications with low covered area resources. The second architecture is optimized for high-speed performance using pipelined technique. Its throughput can reach 3.65 Gbit/sec.
Constant Weight Codes and Group Divisible Designs
Authors: Simon Blake-Wilson, Kevin T. Phelps
Venue: Designs, Codes and Cryptography (1999)

The study of a class of optimal constant weight codes over arbitrary alphabets was initiated by Etzion, who showed that such codes are equivalent to special GDDs known as generalized Steiner systems GS(t,k,n,g) Etzion. This paper presents new constructions for these systems in the case t=2, k=3. In particular, these constructions imply that the obvious necessary conditions on the length n of the code for the existence of an optimal weight 3, distance 3 code over an alphabet of arbitrary size are asymptotically sufficient.
Divisible designs from semifield planes
Authors: Cinzia Cerroni
Venue: Discrete Mathematics (2002)

We give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.
On Duality of Behavioural Systems
Authors: Harish K. Pillai, H. Narayanan
Venue: Multidimensional Systems and Signal Processing (2002)

The notions of controllability and observability are duals in the traditional input-state-output framework of systems theory for 1-D systems. Recently, there has been a study on the duality between controllability and observability in behavioural systems [2] by the construction of a suitable adjoint for 1-D behavioural systems. In this paper we show, among other things, that formally this definition carries over also to n-D behavioural systems. We then explore the nature of the duality between controllability and observability for n-D systems using this definition of adjoint.
On the indecomposable partition problem: IPP(10,A)
Authors: Ziba Eslami
Venue: Discrete Mathematics (2002)

In this paper, we determine all indecomposable triple systems of order 10 and index 4 with a non-trivial automorphism group and show that exactly 101 such designs exist. We then answer some questions about IPP(10,Λ) and finally obtain a lower bound for the number of LS[4](2,3,10).
Looking Beyond CASE
Authors: Ed Acly
Venue: IEEE Software (1988)

The user needs and industry trends that will drive the evolution of computer-aided software engineering (CASE) are examined. The architecture of CASE's successor, referred to as computer-aided development and maintenance environments (CADME), is examined. The development of a standard for information-resource dictionary systems is discussed.
Design pattern concerns for software evolution
Authors: Natsuko Noda, Tomoji Kishi
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Most design patterns help to make systems flexible and extensible. They have potential effects to support evolutionary software development. Ordinary implementation of design patterns, however, is not always enough for evolution. It is based on the inheritance mechanism. This makes application classes quite dependent on patterns and reduces reusability of application classes. In addition, it is difficult to exchange patterns once a system is designed. In this paper, we introduce a way to implement design patterns more flexibly, applying the concept of separation of concerns. It is realized by separating design patterns, as explicit concerns, from the application core that is responsible for the primary functionalities. The new implementation technologies that support the advanced separation of concerns such as Hyper/J&trade; help with coding this kind of design. Using an example, we show that it is possible to exchange patterns to support different behavior without any change on the application core. Our approach has an advantage that reusability of both design patterns and the application core is improved.
The normalized least-squares order-recursive lattice smoother
Authors: Dong Kyoo Kim, PooGyeon Park
Venue: Signal Processing (2002)

This paper introduces a variance- and angle-normalized version of the least-squares order-recursive lattice (LSORL) smoother, say the normalized LSORL smoother, via a geometric approach. The normalized LSORL smoother has excellent round-off noise properties and inherits all the other advantages of the normalized LSORL as well. Simulation results show that the normalized LSORL smoother outperforms the existing LSORL and QRD-based least-squares lattice smoother algorithms when finite-precision arithmetic is used.
Magnetoresistance in a GaAs-AlGaAs two-dimensional electron gas with one-dimensional periodic potential fabricated by AFM Local anodization
Authors: K. Oto, K. Shibuya, K. Matsumoto, K. Murase
Venue: Microelectronic Engineering (2002)

We report the application of the local anodization technique by using an atomic force microscope to GaAs-AlGaAs two-dimensional electron system. We have measured the magnetoresistance in samples with a one-dimensional periodic potential induced by this method, to investigate the properties of the introduced potential. The observed Weiss oscillations and the negative magnetoresistance are analyzed in samples with different ID potential strength controlled by the anodization conditions. The electron localization observed in the samples may be attributed to the inhomogeneity of the potential induced by the local anodization.
Divergence Control Algorithms for Epsilon Serializability
Authors: Kun-Lung Wu, Philip S. Yu, Calton Pu
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper presents divergence control methods for epsilon serializability (ESR) in centralized databases. ESR alleviates the strictness of serializability (SR) in transaction processing by allowing for limited inconsistency. The bounded inconsistency is automatically maintained by divergence control (DC) methods in a way similar to SR is maintained by concurrency control (CC) mechanisms. However, DC for ESR allows more concurrency than CC for SR. We first demonstrate the feasibility of ESR by showing the design of three representative DC methods: two-phase locking, timestamp ordering and optimistic approaches. DC methods are designed by systematically enhancing CC algorithms in two stages: extension and relaxation. In the extension stage, a CC algorithm is analyzed to locate the places where it identifies non-SR conflicts of database operations. In the relaxation stage, the non-SR conflicts are relaxed to allow for controlled inconsistency. We then demonstrate the applicability of ESR by presenting the design of DC methods using other most known inconsistency specifications, such as absolute value, age and total number of nonserializably read data items. In addition, we present a performance study using an optimistic divergence control algorithm as an example to show that a substantial improvement in concurrency can be achieved in ESR by allowing for a small amount of inconsistency.
Probabilistic surfaces: point based primitives to show surface uncertainty
Authors: Gevorg Grigoryan, Penny Rheingans
Venue: Proceedings of the conference on Visualization '02 (2002)

Efficient and informative visualization of surfaces with uncertainties is an important topic with many applications in science and engineering. Examples include environmental pollution borderline identification, identification of the limits of an oil basin, or discrimination between contaminated and healthy tissue in medicine. This paper presents an approach for such visualization using points as display primitives. Our approach is to render each polygon as a collection of points and to displace each point from the surface in the direction of the surface normal by an amount proportional to some random number multiplied by the uncertainty level at that point. This approach can be used in combination with other techniques such as pseudo-coloring and shading to give rise to efficient and revealing visualizations. The method is used to visualize real and simulated tumor formations with uncertainty of tumor boundaries.
Performance of high-speed network I/O subsystems: case study of a fibre channel network
Authors: Mengjou Lin, Jenwei Hsieh, David H. C. Du, James A. MacDonald
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Emerging high-speed networks provide several hundred megabits per second to several gigabits per second of raw communication bandwidth. However, the maximum achievable throughput available to the end-user or application is quite limited. In order to fully utilize the network bandwidth and to improve the performance at the application level, a careful examination of I/O subsystems is essential. In this paper, we study one emerging high-speed network, the Fibre Channel network. The objectives of this study are: 1) to understand how the I/O subsystem relates to network operations, 2) to evaluate and analyze the performance of such a subsystem, and 3) to propose possible approaches for improving the maximum achievable bandwidth. We will show (by simply modifying device driver code) a 75% maximum achievable bandwidth improvement. Other ways of improving network performance are also discussed.