ppxscal/embedding_network huggingface dataset:
PUNCH: Web Portal for Running Tools
Authors: Nirav H. Kapadia, Renato J. Figueiredo, José A. B. Fortes
Venue: IEEE Micro (2000)

This distributed network computer lets users access and run engineering tools anytime, anywhere via Web browsers. It is the enabling technology for NETCARE, an Internet resource that is now freely available for computer architecture education and research.
The Partitioned Synchronization Rule for Planar Extendible Partial Orders
Authors: Paul Ammann, Vijayalakshmi Atluri, Sushil Jajodia
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

The partitioned synchronization rule is a technique for proving the correctness of concurrency control algorithms. Prior work has shown the applicability of the partitioned synchronization rule to hierarchically decomposed databases whose structure is restricted to semitrees. The principal contribution of this paper is a demonstration that the partitioned synchronization rule also applies to more general structures than semitrees, specifically, to any planar extendible partial order, a partial order which when extended with a least and a greatest element still remains planar. To demonstrate utility, the paper presents two applications of the partitioned synchronization rule. The first application shows correctness of a component-based timestamp generation algorithm suitable for implementing a timestamp ordering concurrency control algorithm. The second application shows correctness of a snapshot algorithm for concurrency control in a replicated multilevel secure database; we choose this application to highlight that hierarchically decomposed databases and multilevel secure databases are structurally similar. In both cases, the correctness proofs via the partitioned synchronization rule are substantially simpler than corresponding direct proofs.
Worst case asymptotics of power-weighted Euclidean functionals
Authors: Sungchul Lee
Venue: Discrete Mathematics (2002)

Let A, |A| ≤ n, be a subset of [0, 1]d, and let L(A, [0, 1]d, p) be the length of the minimal matching, the minimal spanning tree, or the traveling salesman problem on A with weight function w(e) = |e|p. In the case 1 ≤ p ≤ d, Yukich (Combinatorica 16 (1996) 575) obtained the asymptotic of αL(n, d, p) = max A⊆[0,1]d,|A| ≤ nL(A,[0,1]d,p). In this paper we extend his result to the whole range 0 ≤ p ≤ ∞.
Defining the Web: The Politics of Search Engines
Authors: Lucas Introna, Helen Nissenbaum
Venue: Computer (2000)

Although the Web itself might truthfully claim a sovereign disinterested and unbiased attitude toward the people who use it, the authors of this article claim that search engines, the tools that navigate the astronomical number of pages (800 million and counting), favor popular, wealthy, and powerful sites at the expense of others. Some researchers have estimated that, taken individually, none of the Web search engines studied indexes more than 16 percent of the total indexable Web. Combined, the results from all search engines they studied covered only about 42 percent of the Web. But what about those portions of the Web that remain hidden from view? This article looks at how search engine developers, designers, and producers grapple with the technical limits that restrict what their engines can find. The authors also examine influences that may determine systematic inclusion and exclusion of certain sites, and the wide-ranging factors that dictate systematic prominence for some sites while relegating others to systematic invisibility.
Energy-efficient broadcast and multicast trees in wireless networks
Authors: Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides
Venue: Mobile Networks and Applications (2002)

The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree construction, and we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the Broadcast Incremental Power (BIP) algorithm, and adapt it to multicast operation by introducing the Multicast Incremental Power (MIP) algorithm. These algorithms exploit the broadcast nature of the wireless communication environment, and address the need for energy-efficient operation. We demonstrate that our algorithms provide better performance than algorithms that have been developed for the link-based, wired environment.
Shopbot Economics
Authors: Jeffrey O. Kephart, Amy R. Greenwald
Venue: Autonomous Agents and Multi-Agent Systems (2002)

Shopbots are Internet agents that automatically search for information pertaining to the price and quality of goods and services. As the prevalence and usage of shopbots continues to increase, one might expect the resultant reduction in search costs to alter market behavior significantly. We explore the potential impact of shopbots upon market dynamics by proposing, analyzing, and simulating a model that is similar in form to some that have been studied by economists investigating the phenomenon of price dispersion. However, the underlying assumptions and methodology of our approach are different, since our ultimate goal is not to explain human economic behavior, but rather to design economic software agents and study their behavior. We study markets consisting of shopbots and other agents representing buyers and sellers in which (i) search costs are nonlinear, (ii) some portion of the buyer population makes no use of search mechanisms, and (iii) shopbots are economically motivated, strategically pricing their information services so as to maximize their own profits. Under these conditions, we find that the market can exhibit a variety of hitherto unobserved dynamical behaviors, including complex limit cycles and the co-existence of several buyer search strategies. We also demonstrate that a shopbot that charges buyers for price information can manipulate markets to its own advantage, sometimes inadvertently benefitting buyers and sellers.
Countable Set of Limit Cycles for the Equation {dw \over dz} = {P_n(z,w)\over Q_n(z,w)}
Authors: A. A. Shcherbakov, E. Rosales-González, L. Ortiz-Bobadilla
Venue: Journal of Dynamical and Control Systems (1998)

Differential equations on the complex plane with a rational right-hand side are considered. In a generic case such equation has a countable set of homologically independent limit cycles. It is proved that the exceptional set &ndash; the set of equations such that they do not have this property &ndash; has the real codimension at least two in the space of equations with right-hand side of degree no greater than a fixed number n.
Learning implicit user interest hierarchy for context in personalization
Authors: Hyoung R. Kim, Philip K. Chan
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

To provide a more robust context for personalization, we desire to extract a continuum of general (long-term) to specific (short-term) interests of a user. Our proposed approach is to learn a user interest hierarchy (UIH) from a set of web pages visited by a user. We devise a divisive hierarchical clustering (DHC) algorithm to group words (topics) into a hierarchy where more general interests are represented by a larger set of words. Each web page can then be assigned to nodes in the hierarchy for further processing in learning and predicting interests. This approach is analogous to building a subject taxonomy for a library catalog system and assigning books to the taxonomy. Our approach does not need user involvement and learns the UIH "implicitly." Furthermore, it allows the original objects, web pages, to be assigned to multiple topics (nodes in the hierarchy). In this paper, we focus on learning the UIH from a set of visited pages. We propose a few similarity functions and dynamic threshold-finding methods, and evaluate the resulting hierarchies according to their meaningfulness and shape
A Lamarckian Approach for Neural Network Training
Authors: Paulo Cortez, Miguel Rocha, José Neves
Venue: Neural Processing Letters (2002)

In Nature, living beings improve their adaptation to surrounding environments by means of two main orthogonal processes: evolution and lifetime learning. Within the Artificial Intelligence arena, both mechanisms inspired the development of non-orthodox problem solving tools, namely: Genetic and Evolutionary Algorithms (GEAs) and Artificial Neural Networks (ANNs). In the past, several gradient-based methods have been developed for ANN training, with considerable success. However, in some situations, these may lead to local minima in the error surface. Under this scenario, the combination of evolution and learning techniques may induce better results, desirably reaching global optima. Comparative tests that were carried out with classification and regression tasks, attest this claim.
Contactless High-Speed Waveform Measurements on Gallium Arsenide ICs
Authors: H. K. Seitz, A. Blacha, R. Clauberg, H. Beha, J. Feder
Venue: IEEE Design Test (1990)

A setup for photoemission testing, which compares favorably with results from electron-beam testing, particularly in terms of measurement time, is presented. The photoemission sampling system described has a unique detector design and a viewer for the added convenience of the equipment operator. performance results when this technique is used to measure delay and rise times on integrated gallium arsenide MESFET circuits are reported. The switching time of these circuits is around 200 ps. The system measures electrical pulses with an 8-ps rise time, so these GaAs circuits can be tested by the system. An interesting feature for special testing is the system's ability to activate devices within a chip by a pulsed visible light beam.
Surviving Information Warfare Attacks
Authors: Sushil Jajodia, Paul Ammann, Catherine D. McCollum
Venue: Computer (1999)

The past few years have seen governmental, military, and commercial organizations widely adopt Web-based commercial technologies because of their convenience, ease of use, and ability to take advantage of rapid advances in the commercial market. With this increasing reliance on internetworked computer resources comes an increasing vulnerability to information warfare. In today's heavily networked environment, safety demands protection from both obvious and subtle intrusions that can delete or corrupt vital data. Traditionally, information systems security focuses primarily on prevention: putting controls and mechanisms in place that protect confidentiality, integrity, and availability by stopping users from doing bad things. Moreover, most mechanisms are powerless against misbehavior by legitimate users who perform functions for which they are authorized: the so-called "insider threat.'' Many network-based attacks, such as password sniffing and session hijacking, allow an attacker to masquerade as a legitimate user. Although, ultimately, preventing malicious attacks from succeeding is key, not all attacks can be averted at the outset. The goal therefore should be to develop an adaptable system that maintains maximum availability even when under attack: At any time, healthy components of the system remain available while damaged components have either limited or no availability.
Modular Fault-Tolerant Boolean N-Cubes
Authors: Chu-Sing Yang, Shun-Yue Wu
Venue: IEEE Micro (1994)

The modular design approach we propose for fault-tolerant Boolean n-cube architectures lets us reduce hardware cost and increase system reliability, while assuring high performance during message routing. Use of a specific module size with shared links and switches during reconfiguration helps keep system costs low. Though this strategy may increase the number of routing steps needed to transmit a message between nodes, routing performance nonetheless surpasses competing approaches, if we consider switching delays.
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Authors: E. Mohr, D. A. Kranz, R. H. Halstead,  Jr.
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

When a parallel algorithm is written naturally, the resulting program often produces tasks of a finer grain than an implementation can exploit efficiently. Two solutions to the granularity problem that combine parallel tasks dynamically at runtime are discussed. The simpler load-based inlining method, in which tasks are combined based on dynamic bad level, is rejected in favor of the safer and more robust lazy task creation method, in which tasks are created only retroactively as processing results become available. The strategies grew out of work on Mul-T, an efficient parallel implementation of Scheme, but could be used with other languages as well. Mul-T implementations of lazy task creation are described for two contrasting machines, and performance statistics that show the method's effectiveness are presented. Lazy task creation is shown to allow efficient execution of naturally expressed algorithms of a substantially finer grain than possible with previous parallel Lisp systems.
System on Chip or System on Package?
Authors: Rao R. Tummala, Vijay K. Madisetti
Venue: IEEE Design Test (1999)

Electronics products of the future must be realized efficiently promising higher performance at lower cost within much shorter product design and upgrade cycles. ASIC foundries and EDA vendors see increasing VLSI integration capabilities as a promising new business opportunity through the System-on-Chip (SOC) paradigm that extends ASICs design from the component level to the system level. The systems integration community and electronics packaging design vendors see the systems market as an extension of their current business, the so-called Systems-on-Package (SOP) paradigm, and one that raises their role to new level of importance in the product supply chain linking electronics packaging directly to product specification, early design and ASIC design. Political issues aside, there exist technical, legal, and business challenges both paradigms must overcome to find broad-based acceptance. In the authors' opinion, the Systems-on-Package (SOP) paradigm promises a higher return on investment (ROI) at a much lower risk for the electronics products design, well into the new millenium.
The home marking problem and some related concepts
Authors: Roxana Melinte, Olivia Oanea, Ioana Olga, Ferucio Laurentiu Tiplea
Venue: Acta Cybernetica (2002)

In this paper we study the home marking problem for Petri nets, and some related concepts to it like confluence, noetherianity, and state space inclusion. We show that the home marking problem for inhibitor Petri nets is undecidable. We relate then the existence of home markings to confluence and noetherianity and prove that confluent and noetherian Petri nets have an unique home marking. Finally, we define some versions of the state space inclusion problem related to the home marking and sub-marking problems, and discuss their decidability status.
Importance Sampling and Mean-Square Error in Neural Detector Training
Authors: José L. Sanz-González, Diego Andina, Juan Seijas
Venue: Neural Processing Letters (2002)

This letter deals with the use of Importance Sampling (IS) techniques and the Mean-Square (MS) error in neural network training, for applications to detection in communication systems. Topics such as modifications of the MS objective function, optimal and suboptimal IS probability density functions, and adaptive importance sampling are presented. A genetic algorithm was used for the neural network training, having considered adaptive IS techniques for improving MS error estimations in each iteration of the training. Also, some experimental results of the training process are shown in this letter. Finally, we point out that the mean-square error (estimated by importance sampling) attains quasi-optimum training in the sense of minimum error probability (or minimum misclassification error).
Highly energy-conservative finite difference method for the cylindrical coordinate system
Authors: Koji Fukagata, Nobuhide Kasagi
Venue: Journal of Computational Physics (2002)

A highly energy-conservative second-order-accurate finite difference method for the cylindrical coordinate system is developed. It is rigorously proved that energy conservation in discretized space is satisfied when appropriate interpolation schemes are used. This argument holds not only for an unequally spaced mesh but also for an equally spaced mesh on cylindrical coordinates but not on Cartesian coordinates. Numerical tests are undertaken for an inviscid flow with various schemes, and it turns out that the proposed scheme offers a superior energy-conservation property and greater stability than the intuitive and previously proposed methods, for both equally spaced and unequally spaced meshes.
Safety-Critical Systems Built with COTS
Authors: Joseph A. Profeta III, Nikos P. Andrianos, Bing Yu, Barry W. Johnson, Todd A. DeLong, David Guaspari, Damir Jamsek
Venue: Computer (1996)

The rail transportation industry has always been very safety conscious, given the potential for a catastrophic system failure. And the replacement of traditional relay-based systems with microprocessor-based control systems over the past two decades has made it all the more important to prove software correctness. At the same time, competitive pressure has led to the increased use of COTS (commercial, off-the-shelf) equipment in safety-critical systems, making it imperative that we extend proven safety techniques to COTS-based systems as well. To this end, we have developed the Vital Framework (V_Frame), which is used to develop a safety critical platform from COTS hardware and software. The key technologies in this framework are formal methods, information redundancy, a proprietary data format, and a concurrent checking scheme. Combining these technologies results in a real-time, checkable correctness criterion that is a signature of the application's algorithm structure and is independent of both the hardware and the operating system. Because it is a contradiction for a CPU to check itself and guarantee that it is correctly executing the intended semantics of an application, V_Frame uses a fail-safe, real-time application checker outside the domain of the CPU to ensure the correct (and proper) execution of the application. This is done by placing correctness criteria on the RAC that must be met to allow the outputs to be sent to the field. These correctness criteria are generated from the application rather than the compiled version of the application. This raises the checking process into the information universe as opposed to the physical universe (specific faults in the CPU registers or faults in the firmware running on the CPU). In the event that an error is detected, the system is placed into a known safe state.
Future trends in oil and gas visualization
Authors: Francine Evans, William Volz, Geoffrey Dorn, Bernd Fröhlich, David M Roberts
Venue: Proceedings of the conference on Visualization '02 (2002)

The question that this panel wishes to explore is: What are the future visualization trends and requirements for the oil and gas industry to efficiently handle and explore the ever-increasing volume and variety of available data?It has been proven many times that 3D visualization helps to reduce the risk in the search for, and development of, oil and gas resources and has been generally acknowledged to be an indispensable technology for the oil and gas industry. The role of the geoscientist is to combine his/her geological and geophysical expertise with the wide variety of data to find these natural resources and minimize the risk in the search for nature resources at the same time. The variety and size of the data makes the requirements unique in the visualization field: The data volumes that must be visualized range from a few megabytes to over 100 gigabytes. Multiple kinds of data and interpretation must be overlaid on the visualization. Multiple models of the subsurface are possible. Multiple specialized visualization software tools are available for the geoscientist to use.Combining the right visualization tools with the right data can reduce exploration risk and make the geoscientist a productive explorationist. This panel will explore the trends that are anticipated to meet the future needs of the Oil and Gas industry.
Scaling of micro-fabricated nanometer-sized Schottky diodes
Authors: G. D. J. Smit, M. G. Flokstra, S. Rogge, T. M. Klapwijk
Venue: Microelectronic Engineering (2002)

Diodes on the nanometer scale generally show non-ideal transport characteristics. In this paper, the transition of a conventional Schottky diode to a nano-diode is investigated. It is shown that electrostatic effects in small lithographically fabricated diodes can lead to a considerably thinner Schotty barrier, with the consequence of a greatly enhanced tunnelling current. We present numerical simulations as well as analytical calculations of the potential barrier shape in small devices, demonstrating this scaling effect. Special focus is placed on the role of the interconnects.
Synthesis of Scan Chains for Netlist Descriptions at RT-Level
Authors: Yu Huang, Chien-Chung Tsai, Nilanjan Mukherjee, Omer Samman, Wu-Tung Cheng, Sudhakar M. Reddy
Venue: Journal of Electronic Testing: Theory and Applications (2002)

This paper presents a methodology to insert scan paths in a functional Register Transfer Level (RTL) specification of a design that can exploit existing functional paths between sequential elements in the original circuit for establishing scan chains. The primary objective for RTL scan insertion is to reduce the time taken for DFT, and thus reduce the time to market. Additionally, building scan chains at the functional RT-Level is expected to reduce the total area overhead introduced by full scan without compromising the fault coverage achieved. In addition, it often eliminates the delay associated with the additional multiplexer as a part of a conventional scan-cell in high performance designs. Experimental results presented in this paper demonstrate that the proposed method achieves the above objectives while also achieving higher fault coverages for most of the benchmark circuits considered.
Fault Tolerance in Highly Parallel Hardware Systems
Authors: John F. Stockton
Venue: IEEE Micro (1994)

Notebook, palmtop, and pen-based computers have unique storage requirements. In addition to a rapid growth in capacity to support emerging multimedia applications, portable systems require small, removable media; high shock resistance; thermal resilience; and light-weight, unique form factors dictated by ergonomic constraints and choices. It is argued that storage is the critical enabling technology for many new multimedia applications and addressing its rapidly increasing requirements is key to bringing forward this new technology.
Creating a Software-Engineering Knowledge Base
Authors: Andrew J. Symonds
Venue: IEEE Software (1988)

A description is given of the CASE/MVS project, which combines knowledge engineering and software engineering to provide a powerful computer-aided software engineering (CASE) environment for developing the MVS/XA operating system. The components and characteristics of the knowledge base are discussed. Aspects of the CASE/MVS project are examined, namely, managing source specifications, creating and analyzing static models, dynamic analysis, and code generation.