ppxscal/embedding_network huggingface dataset:
Some Strategic Y2K Blessings
Authors: Leon A. Kappelman
Venue: IEEE Software (2000)

Y2K showed everyone the importance of systems and software in enterprise success and gave software professionals valuable lessons. The author explains that the IT industry needs to pick itself up from Y2K and exploit the knowledge it gained from upgrading and redesigning its enterprise software systems and practices.
Alternative Approaches to Modeling time Variation in the Case of the U.S. Real Interest Rate
Authors: Basma Bekdache
Venue: Computational Economics (1998)

This paper compares three approaches for modeling time variation in the U.S. real interest rate: a three-state Markov switching model as estimated by Garcia and Perron (1994), a random-walk model with two-state Markov switching variance, and a time-varying parameter model with two-state Markov switching variance. The findings are generally supportive of modeling continual change in the mean of the real rate process rather than employing a model that limits variation in the mean to a specified number of states.
Numerical analysis of boundary-value problems for singularly-perturbed differential-difference equations with small shifts of mixed type
Authors: M. K. Kadalbajoo, K. K. Sharma
Venue: Journal of Optimization Theory and Applications (2002)

In this paper, we use a numerical method to solve boundary-value problems for a singularly-perturbed differential-difference equation of mixed type, i.e., containing both terms having a negative shift and terms having a positive shift. Similar boundary-value problems are associated with expected first exit time problems of the membrane potential in models for the neuron. The stability and convergence analysis of the method is given. The effect of a small shift on the boundary-layer solution is shown via numerical experiments. The numerical results for several test examples demonstrate the efficiency of the method.
Neural network models for the gaze shift system in the superior colliculus and cerebellum
Authors: Xiaoxing Wang, Jesse Lin, Marwan Jabri
Venue: Neural Networks (2002)

We investigate the role that the superior colliculus (SC) and the cerebellum might play in generating gaze shifts. The discharge of cells in the intermediate layers of the SC is tightly linked to the occurrence of saccades. Many studies have demonstrated that the cerebellum is involved in both eye and head movements. When the head is unrestrained, large amplitude gaze shifts are composed of coordinated eye and head movements. In this study, we propose that the gaze saccades system is controlled by a feedback loop between the SC and the cerebellum. The SC only encodes retinal coordinates and controls the eye displacement (to move the fovea to the target), while the cerebellum deals with the gaze programming and controls the head displacement. When a target appears in space, the buildup cells within the SC decode the target signal in the retina before the saccade onset, and input the signal of the gaze displacement to the cerebellum. The cells in the cerebellum vermis encode the initial position of the eye in the orbit. The gaze displacement is decomposed into the head amplitude and the eye amplitude within the cerebellum. There are two output signals from the cerebellum. One signal controls the head movement. The other is projected back to the SC, and forms a component of the saccade vector to control the eye movement. The sum of the vectors provided by the cerebellum and the vector provided by the burst cells in the SC indicates the direction and the amplitude of the desired movement of the eye during the saccade. We propose a cerebellum model to predict the displacements of the eye and head under the condition that the position of the target signal in the retina and the initial position of the eye in the orbit are known. The results from the model are close to that observed physiologically. We conclude that before gaze shift onset, the cerebellum may play an important role in decomposing the gaze displacement into an eye amplitude and head amplitude signal.
Surviving Network Partitioning
Authors: Peter Michael Melliar-Smith, Louise Elizabeth Moser
Venue: Computer (1998)

Applications implemented as distributed systems must withstand network partitioning faults, which split the system into two or more components. Though processes in the same component can communicate with each other, they cannot communicate with processes in other components. If processes continue to operate in the disconnected components, they might perform incompatible operations and make the application data inconsistent. A real-world business cannot stop operating if the network partitions. The authors have developed a strategy that permits processing to continue in all components of a partitioned network. The processes in the disconnected components generate and queue fulfillment transactions that record the actions taken while the network is partitioned. When communication is restored and the components remerge, the fulfillment transactions are dequeued and processed to obtain a consistent state of the application data. Fulfillment transactions allow continued operations, require little additional infrastructure, incur little additional overhead, and are programmed just like other types of transactions.
Effective Hardware-Based Data Prefetching for High-Performance Processors
Authors: Jean-Loup Baer, Tien-Fu Chen
Venue: IEEE Transactions on Computers (1995)

Memory latency and bandwidth are progressing at a much slower pace than processor performance. In this paper, we describe and evaluate the performance of three variations of a hardware function unit whose goal is to assist a data cache in prefetching data accesses so that memory latency is hidden as often as possible. The basic idea of the prefetching scheme is to keep track of data access patterns in a Reference Prediction Table (RPT) organized as an instruction cache. The three designs differ mostly on the timing of the prefetching. In the simplest scheme (basic), prefetches can be generated one iteration ahead of actual use. The lookahead variation takes advantage of a lookahead program counter that ideally stays one memory latency time ahead of the real program counter and that is used as the control mechanism to generate the prefetches. Finally the correlated scheme uses a more sophisticated design to detect patterns across loop levels.These designs are evaluated by simulating the ten SPEC benchmarks on a cycle-by-cycle basis. The results show that 1) the three hardware prefetching schemes all yield significant reductions in the data access penalty when compared with regular caches, 2) the benefits are greater when the hardware assist augments small on-chip caches, and 3) the lookahead scheme is the preferred one cost-performance wise.
Protein-Based Optical Computing and Memories
Authors: Robert R. Birge
Venue: Computer (1992)

The current and potential uses of bacteriorhodopsin in optical computing and memory devices are reviewed. The protein has significant potential for use in these applications due to unique intrinsic photophysical properties, and the range of chemical and genetic methods available for optimizing performance for specific application environments. The intrinsic properties of the native bacteriorhodopsin protein are described. The applications of bacteriorhodopsin in spatial light modulators, integral components in a majority of one-dimensional and two-dimensional optical processing environments, and holographic associative memories are presented.
Bayesian Grid Matching
Authors: Karsten Hartelius, Jens Michael Carstensen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov Random Field (MRF) model which represents the spatial coordinates of the grid nodes. Knowledge of how grid nodes are depicted in the observed image is described through the observation model. The prior consists of a node prior and an arc (edge) prior, both modeled as Gaussian MRFs. The node prior models variations in the positions of grid nodes and the arc prior models variations in row and column spacing across the grid. Grid matching is done by placing an initial rough grid over the image and applying an ensemble annealing scheme to maximize the posterior distribution of the grid. The method can be applied to noisy images with missing grid nodes and grid-node artifacts and the method accommodates a wide range of grid distortions including: large-scale warping, varying row/column spacing, as well as nonrigid random fluctuations of the grid nodes. The methodology is demonstrated in two case studies concerning 1) localization of DNA signals in hybridization filters and 2) localization of knit units in textile samples.
Some expansions in basic Fourier series and related topics
Authors: Sergei K. Suslov
Venue: Journal of Approximation Theory (2002)

We consider explicit expansions of some elementary and q-functions in basic Fourier series introduced recently by Bustoz and Suslov. Natural q-extensions of the Bernoulli and Euler polynomials, numbers, and the Riemann zeta function are discussed as a by-product.
A Template-Based Approach to the Generation of Distributed Applications Using a Network of Workstations
Authors: A. Singh, J. Schaeffer, M. Green
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A computational model and system for the generation of distributed applications in a workstation environment are presented. The well-known RPC model is modified by a novel concept known as template attachment. A computation consists of a network of sequential procedures which have been encapsulated in templates. A small selection of templates is available from which a distributed application with the desired communication behavior can be rapidly built. The system generates all the required low-level code for correct synchronization, communication, and scheduling. This results in a system that is easy to use and flexible and can provide a programmer with the desired amount of control in using idle processing power over a network of workstations. The practical feasibility of the model has been demonstrated by implementing it for Unix-based workstation environments.
G-Tree: A New Data Structure for Organizing Multidimensional Data
Authors: A. Kumar
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

The author describes an efficient data structure called the G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparison with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.
New primitive ∇ for APL-style structured control
Authors: F. H. D. van Batenburg
Venue: ACM SIGAPL APL Quote Quad (2001)

A control structure is described which is more APL-ish than the currently implemented keywords. It is much more in the spirit of APL because it merges all conventional control concepts into one single concept represented by one single symbol "&nabla;". The result is more simple and yet more powerful. Various paragraphs will show how to do all the conventional control structuring with this new primitive. The theoretical exposition concludes with a practical paragraph that summarises how much of the proposal is currently available in the APL implementation APL2C.
A Global Perspective on Web Site Usability
Authors: Shirley A. Becker, Florence E. Mottay
Venue: IEEE Software (2001)

Online business failures are increasing as customers turn away from unusable or unfriendly sites. From a global perspective, usability requires cultural sensitivity in language translation, along with the appropriate use of color, design, and animation.
The V.42bis Standard for Data-Compressing Modems
Authors: Clark Thomborson
Venue: IEEE Micro (1992)

The CCITT V.42bis standard for data-compressing modems, a conservative and economically implementable scheme, is discussed from algorithmic, experimental, practical, and marketing standpoints. It is shown that 4.2bis compresses text about as well as the Lempel-Ziv-Welch algorithm of the Berkeley Unix Compress utility. Other Ziv-Lempel variants are discussed briefly.
An adaptive generalized transmission protocol for ad hoc networks
Authors: Andrew D. Myers, Gergely V. Záruba, Violet R. Syrotiuk
Venue: Mobile Networks and Applications (2002)

Wireless networking and group communication in combination allows groups of dispersed mobile users to collaborate. This paper presents AGENT, a medium access control (MAC) protocol that unifies point-to-point and multi-point transmission services to facilitate group communication in ad hoc networks. Analysis and experiments performed in a simulated ad hoc network demonstrate that AGENT exhibits reliable and stable performance with high spatial bandwidth reuse. Moreover, variation in the proportion of point-to-point and multi-point traffic is shown to have little impact on the overall performance of AGENT. Comparison with the other tested MAC protocols reveals that the performance of AGENT is superior, achieving higher channel utilization and lower access delay.
Subword Parallelism with MAX-2
Authors: Ruby B. Lee
Venue: IEEE Micro (1996)

Subword Parallelism is a technique that enables the full use of word-oriented datapaths when dealing with lower-precision data. It is a form of low-cost, small-scale SIMD parallelism. This paper discusses the needs of subword parallelism, and gives an example of how it can be supported with a very small set of MAX-2 instructions. MAX-2 is the second generation of Multimedia Acceleration eXtensions introduced with the PA-RISC 2.0 processors. Because MAX-2 strives to be a minimal set supporting subword parallelism, we discuss both instructions included and excluded. Mix and Permute instructions are introduced as new simple yet powerful subword rearrangement primitives. We illustrate how programs with inherent data parallelism may be accelerated with subword parallel instructions. We also give many short examples capturing key aspects of the use of MAX-2 instructions.
Rapid Hardware Prototyping on RPM-2
Authors: Michel Dubois, Jaeheon Jeong, Yong Ho Song, Adrian Moga
Venue: IEEE Design Test (1998)

Field-Programmable Gate Arrays is an emerging technology which promises easy hardware reconfigurability by software at low cost. Entire systems can be built in which some parts are programmable. Such systems implement various architectures. Each architecture prototype is a detailed hardware implementation of the architecture --including I/O-- on which complex software systems can be ported.We have built a multiprocessor emulator called RPM --Rapid Prototyping engine for Multiprocessor systems. The second version of the hardware called RPM-2 is up and running. In this article, we present the design and the performance of our first emulator, a cache-coherent non uniform memory access multiprocessor (CC-NUMA).
Polyhedral graphs with restricted number of faces of the same type
Authors: M. Voigt, H. Walther
Venue: Discrete Mathematics (2002)

Let G = G(V,E,F) be a polyhedral graph with vertex set V, edge set E and face set F. A face α is an 〈a1,.....,al〉-face if α is an l-gon and the degrees d(xi) of the vertices x1,.....,xl incident with α in the cyclic order are a1,....,al, respectively. The lexicographic minimum 〈b1,....,bl〉 such that α is a 〈b1,...,bl〉-face is called the type of α. Furthermore let z be a given integer. We consider polyhedral graphs where the number of faces of each type is restricted by z. We prove that there is only a finite number of such graphs.
Integrating Usability Techniques into Software Development
Authors: Jean Anderson, Francie Fleek, Kathi Garrity, Fred Drake
Venue: IEEE Software (2001)

Focusing on the user early in the development process goes a long way toward improving product quality and eliminating rework. In this article, the authors show how their company is working toward this goal.
Realistic Built-In Self-Test for Static RAMs
Authors: Rob Dekker, Frans Beenker, Loek Thijssen
Venue: IEEE Design Test (1989)

The authors present the specification and design of a self-test mechanism for static random-access memories (RAMs). The test algorithm provides excellent fault detection, and its structure is independent of address and data scrambling. The self-test machine generates data backgrounds on chip and is therefore suitable for both bit-oriented and word-oriented SRAMs. It is also suitable for both embedded SRAMs and stand-alone SRAMs, and adapts to boundary-scan environment. Because of the regular and symmetric structure of the test algorithm, the silicon overhead is only 3% for a 16 K synchronous SRAM.
Efficient performance estimation for general real-time task systems
Authors: Hongchao Stephanie Liu, Xiaobo Sharon Hu
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

The paper presents a novel approach to compute tight upper bounds on the processor utilization independent of the implementation for general real-time systems where tasks are composed of subtasks and precedence constraints may exist among subtasks of the same task. We formulate the problem as a set of linear programming (LP) problems. Observations are made to reduce the number of LP problem instances required to be solved, which greatly improves the computation time of the utilization bounds. Furthermore, additional constraints are allowed to be included under certain circumstances to improve the quality of the bounds.
Dual-Space Diversity over Land Mobile Satellite Channels Operating in the L and K Frequency Bands
Authors: W. Zhuang, J.-Y. Chouinard, D. Makrakis
Venue: Wireless Personal Communications: An International Journal (1997)

Land mobile satellite communication systems at Ka/K band (30/20 GHz) are attracting more and more attention to researchers because of its frequency band availability and the possibility of using small earth stations and satellite antennas for the systems. However, the Ka/K-band communications also give significant challenges in the system design due to severe channel impairments expected from the satellite links. In this paper, K-band channel characteristics are studied and compared with those at L band. The channel is modeled as Rayleigh multipath fading with the line-of-sight (LOS) component following a lognormal distribution. The first and second-order statistics of the fading channel are studied. Dual-space diversity reception is investigated to combat the flat channel fading. The bit error rate performance of coherent binary phase shift keying (BPSK) with ideal bit and carrier phase synchronization over the fading channel at K band is evaluated theoretically and verified by computer simulations in the case with and without diversity reception.
Systematically Testing a Real-Time Operating System
Authors: Manthos A. Tsoukarellas, Vasilis C. Gerogiannis, Kostis D. Economides
Venue: IEEE Micro (1995)

Testing large and complex software is an inherently difficult process, which must be as systematic as possible, in order to provide adequate reliability and quality assurance. This is particularly true in the case of a complex real-time operating system, in which an ad hoc testing approach would certainly fail to affirm the quality and the correctness of the requirements specification, design and implementation. The main purpose of this article, after presenting well-established testing strategies, is to show their adaptation to the testing of an under-development, real-time operating system (RTOS), in the context of ESPRIT III project 8906 OMI/CLEAR1.
Domain Monotonicity and the Performance of Local Solutions Strategies for CDPS-based Distributed Sensor Interpretation and Distributed Diagnosis
Authors: Norman Carver, Victor Lesser
Venue: Autonomous Agents and Multi-Agent Systems (2003)

The growth in computer networks has created the potential to harness a great deal of computing power, but new models of distributed computing are often required. Cooperative distributed problem solving (CDPS) is the subfield of multi-agent systems (MAS) that is concerned with how large-scale problems can be solved using a network of intelligent agents working together. Building CDPS systems for real-world applications is still very difficult, however, in large part because the effects that domain and strategy characteristics have on the performance of CDPS systems are not well understood. This paper reports on the first results from a new simulation-based analysis system that has been created to study the performance of CDPS-based distributed sensor interpretation (DSI) and distributed diagnosis (DD). To demonstrate the kind of results that can be obtained, we have investigated how the monotonicity of a domain affects the performance of a potentially very efficient class of strategies for CDPS-based DSI/DD. Local solutions strategies attempt to limit communications among the agents by focusing on using the agents' local solutions to produce global solutions. While these strategies have been described as being important for effective CDPS-based DSI/DD, they need not perform well if a domain is nonmonotonic. We had previously suggested that the reason they have performed well in several research systems was that many DSI/DD domains are what we termed nearly monotonic. In this paper, we will provide quantitative results that relate the performance of local solutions strategies to the monotonicity of a domain. The experiments confirm that domain monotonicity can be important to consider, but they also show that it is possible for these strategies to be effective even when domains are relatively nonmonotonic. What is required is that the agents receive a significant fraction of the data that is relevant to their subproblems. This has important implications for the design of DSI/DD systems using local solutions strategies. In addition, while the work indicates that many DSI/DD domains are likely to be &ldquo;nearly monotonic&rdquo; according to our original definitions, it also shows that these measures are not as predictive of performance as other measures we define. This means that near monotonicity alone does not explain why local solutions strategies have performed well in previous systems. Instead, a likely explanation is that these systems typically involved only a small number of agents.
Universal H-colorable graphs without a given configuration
Authors: Paul A. Dreyer,  Jr., Christopher Malon, Jaroslav Nesetril
Venue: Discrete Mathematics (2002)

For every pair of finite connected graphs F and H, and every positive integer k, we construct a universal graph U with the following properties: (1) There is a homomorphism π: U → H, but no homomorphism from F to U. (2) For every graph G with maximum degree no more than k having a homomorphism h:G → H, but no homomorphism from F to G, there is a homomorphism α: G → U, such that h = π o α. Particularly, this solves a problem presented in [1] and [2] regarding the chromatic number of a universal graph.