ppxscal/embedding_network huggingface dataset:
Advances in Network Simulation
Authors: Lee Breslau, Deborah Estrin, Kevin Fall, Sally Floyd, John Heidemann, Ahmed Helmy, Polly Huang, Steven McCanne, Kannan Varadhan, Ya Xu, Haobo Yu
Venue: Computer (2000)

The Internet's rapid growth has spurred development of new protocols and algorithms to meet changing operational requirements-- such as security, multicast transport, mobile networking, policy management, and quality-of-service support. Development and evaluation of these operational tools requires answering many design questions.Despite their value, custom simulators, wide-area test-beds, and small-scale lab evaluations all have drawbacks. Because they use real code, experiments run in testbeds or labs automatically capture important details that might be missed in a simulation. However, building testbeds and labs is expensive, reconfiguring and sharing them is difficult, and they are relatively inflexible.In the current paradigm, directly comparable data would be available only if designers implemented all competing mechanisms within every simulator.The Virtual InterNetwork Testbed (VINT) project, detailed and explained in this article, provides improved simulation tools for network researchers to use in the design and deployment of new wide-area Internet protocols.
SH3: High Code Density, Low Power
Authors: Atsushi Hasegawa, Ikuya Kawasaki, Kouji Yamada, Shinichi Yoshioka, Shumpei Kawasaki, Prasenjit Biswas
Venue: IEEE Micro (1995)

Hitachi's SH series represents a 32-bit RISC architecture with 16-bit fixed-length instruction set. SH3 is a pipelined implementation of the SH architecture with on-chip cache, MMU, and software programmable power management. This article briefly describes the SH architecture and SH3 implementation, and establishes the advantages of such an instruction set. SH3 achieves 60-Dhrystone MIPS of performance and dissipates 400 mW at 60 MHz. Higher code density and corresponding improvement in instruction fetch latency leads to higher performance as compared with typical 32-bit RISC architectures. Small die size, low power consumption, and software-controlled power management capability make SH3 an ideal microprocessor for embedded applications such as nomadic computing systems or multimedia systems.
Time-Space Trade-Off Analysis of Morphic Trie Images
Authors: R. W. P. Luk
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In this paper, we explore the use of tries to represent tries. A morphic trie image is a trie that represents a set of transformed keywords using an isomorphism h: \Sigma^* \rightarrow (\sigma^q)^*. Morphic trie images using tenary alphabets achieve near optimal performances but approximation errors degrade their performances. A condition which determines whether tenary or bit tries should be used is found. Even though bit tries have better storage reduction in some cases, tenary tries access faster than bit tries. We show that the morphic trie images use less space than minimal prefix tries. If morphic trie images were compressed to form minimal prefix tries, then the total storage reduction is the product of the two. Approximation errors have no effect on minimal prefix tries.
A Software System Evaluation Framework
Authors: Germinal Boloix, Pierre N. Robillard
Venue: Computer (1995)

The authors propose a software system evaluation framework that provides a classification scheme for identifying sets of similar systems. The framework integrates previous studies on software evaluation, productivity models, software quality factors, and total quality models. It also classifies information about software systems from the perspective of the project, the system, and the environment. The project view (developers and enhancers) considers characteristics of the agents, the process, and the tools used during software system production. The system view (operators, administrators, and managers) depicts the software system's characteristics, technology, and performance. The environment view (users and stakeholders) identifies user and stakeholder concerns, such as the software system's usability, its contribution to the organization, and its compliance with requirements. The authors describe these characteristics and summarize the evaluation criteria used to define each one as basic, intermediate, or advanced. Next, the authors present two actual evaluations performed with the framework. One involves computer-aided software engineering tools called the Structure Editor and the Static Analyzer, while the other concerns rule-based aggregation. Finally, the authors explain how they would like to see the framework evolve. They conclude that this framework can help software engineering nonexperts who may require software system evaluations, and they cite some possible applications.
Seeded Region Growing
Authors: R. Adams, L. Bischof
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We present here a new algorithm for segmentation of intensity images which is robust, rapid, and free of tuning parameters. The method, however, requires the input of a number of seeds, either individual pixels or regions, which will control the formation of regions into which the image will be segmented. In this correspondence, we present the algorithm, discuss briefly its properties, and suggest two ways in which it can be employed, namely, by using manual seed selection or by automated procedures.
SPAR: A New Architecture for Large Finite Element Computations
Authors: Abhiram Ranade, Valerie E. Taylor, David G. Messerschmitt
Venue: IEEE Transactions on Computers (1995)

The finite element method is a general and powerful technique for solving partial differential equations. The computationally intensive step of this technique is the solution of a linear system of equations. Very large and very sparse system matrices result from large finite-element applications. The sparsity must be exploited for efficient use of memory and computational components in executing the solution step. In this paper we propose a scheme, called SPAR, for efficiently storing and performing computations on sparse matrices. SPAR consists of an alternate method of representing sparse matrices and an architecture that efficiently executes computations on the proposed data structure. The SPAR architecture has not been built, but we have constructed a register-transfer level simulator and executed the sparse matrix computations used with some large finite element applications. The simulation results demonstrate a 95% utilization of the floating-point units for some 3D applications. SPAR achieves high utilization of memory, memory bandwidth, and floating-point units when executing sparse matrix computations.
Path Analysis and Renaming for Predicated Instruction Scheduling
Authors: Lori Carter, Beth Simon, Brad Calder, Larry Carter, Jeanne Ferrante
Venue: International Journal of Parallel Programming (2000)

Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural mechanism that increases instruction level parallelism by removing branches and allowing simultaneous execution of multiple paths of control, only committing instructions from the correct path. In order for the compiler to expose and use such parallelism, traditional compiler data-flow and path analysis needs to be extended to predicated code. In this paper, we motivate the need for renaming and for predicates that reflect path information. We present Predicated Static Single Assignment (PSSA) which uses renaming and introduces Full -Path Predicates to remove false dependences and enable aggressive predicated optimization and instruction scheduling. We demonstrate the usefulness of PSSA for Predicated Speculation and Control Height Reduction. These two predicated code optimizations used during instruction scheduling reduce the dependence length of the critical paths through a predicated region. Our results show that using PSSA to enable speculation and control height reduction reduces execution time from 12 to 68%.
Primal-dual Newton-type interior-point method for topology optimization
Authors: R. H. W. Hoppe, S. I. Petrova, V. Schulz
Venue: Journal of Optimization Theory and Applications (2002)

We consider the problem of minimization of energy dissipation in a conductive electromagnetic medium with a fixed geometry and a priori given lower and upper bounds for the conductivity. The nonlinear optimization problem is analyzed by using the primal-dual Newton interior-point method. The elliptic differential equation for the electric potential is considered as an equality constraint. Transforming iterations for the null space decomposition of the condensed primal-dual system are applied to find the search direction. The numerical experiments treat two-dimensional isotropic systems.
Discrete Polymatroids
Authors: Jürgen Herzog, Takayuki Hibi
Venue: Journal of Algebraic Combinatorics: An International Journal (2002)

The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960's and in early 1970's, in the present paper the combinatorics and algebra on discrete polymatroids will be studied.
Understanding the slowdown of large jobs in an M/GI/1 system
Authors: Mor Harchol-Balter, Karl Sigman, Adam Wierman
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the it slowdown experienced by largest jobs. We consider scheduling policies that bias against large jobs, towards large jobs, and those that are fair, e.g., Processor-Sharing. We prove that as job size increases to infinity, all work conserving policies converge almost surely with respect to this metric to no more than 1/(1-&rho;), where &rho; denotes load. We also find that the expected slowdown under any work conserving policy can be made arbitrarily close to that under Processor-Sharing, for all job sizes that are sufficiently large.
Software Engineering Technology Watch
Authors: Robert David Cowan, Ali Mili, Hany Ammar, Alan McKendall,  Jr., Lin Yang, Dapeng Chen, Terry Spencer
Venue: IEEE Software (2002)

Predicting the evolution of software engineering technology is, at best, a dubious proposition. Typically, it is a frustrating and disappointing exercise. It is not difficult to see why: Software technology evolves at a fast pace and is determined by a dizzying array of factors, many of them outside the arena of software engineering. Most of them cannot be identified, let alone predicted, with any significant advance notice. This article briefly discusses the authors' first ventures in this domain and some preliminary conclusions and suggestions.
Simulation and analysis of rotary forging a ring workpiece using finite element method
Authors: Wang Guangchun, Zhao Guoqun
Venue: Finite Elements in Analysis and Design (2002)

The methods of dealing with some key problems in analyzing a rotary forging process with a finite element method are given. The presented mechanical model of the finite element analysis is in accordance with the actual conditions of the rotary forging process. A three-dimensional rigid-plastic finite element analysis code is developed in FORTRAN language and used to analyze the rotary forging process of a ring workpiece. Velocity fields and stress-strain fields of both contact and non-contact zones of the ring workpiece in the rotary forging are obtained. The deformation mechanism and metal flow laws of the contact zone surface of the ring workpiece in the rotary forging process are revealed. The pressure distributions of the contact surface along the radial and tangential directions and effects of rotary forging parameters on deformation characteristics are given.
Site and Query Scheduling Policies in Multicomputer Database Systems
Authors: O. Frieder, C. K. Baru
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations.
Minimum BER diagonal precoder for MIMO digital transmissions
Authors: P. Rostaing, O. Berder, G. Burel, L. Collin
Venue: Signal Processing (2002)

We propose a minimum bit error rate (MBER) diagonal precoder for multi-input multi-output (MIMO) transmission systems. This work is based on previous results obtained by Sampath et al. (IEEE ISPACS, Honolulu, Hawaii, 2000, p. 823) in which the global transmission system (precoder and equalizer) is optimized with the minimum mean square error (MMSE) criterion. This process leads to an interesting diagonality property which decouples the MIMO channel into parallel and independent data streams and allows to perform an easy maximum likelihood (ML) detection. This system is then optimized using a new diagonal precoder that minimizes the BER. Our work is motivated by the fact that, from a practical point of view, people are likely to prefer a system that minimizes the BER rather than the mean square error. The performance improvement is illustrated via Monte Carlo simulations using a quadratic amplitude modulation (QAM).
Knowledge-Based Software Architectures: Acquisition, Specification, and Verification
Authors: Jeffrey J. P. Tsai, Alan Liu, Eric Juan, Avinash Sahay
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

The concept of knowledge-based software architecture has recently emerged as a new way to improve our ability to effectively construct and maintain complex large-scale software systems. Under this new paradigm, software engineers are able to do evolutionary design of complex systems through architecture specification, design rationale capture, architecture validation and verification, and architecture transformation. This paper surveys some of the important techniques that have been developed to support these activities. In particular, we are interested in knowledge/requirement acquisition and analysis. We survey some tools that use the knowledge-based approach to solve these problems. We also discuss various software architecture styles, architecture description languages (ADLs), and features of ADLs that help build better software systems. We then compare various ADLs based on these features. The efficient methods that were developed for verification, validation, and high assurance of architectures are also discussed. Based on our survey results, we give a basis for comparing the various knowledge-based systems and list these comparisons in the form of a table.
Is Business Intelligence a Smart Move?
Authors: Sixto Ortiz Jr.
Venue: Computer (2002)

As businesses continue to use computer systems for a growing number of functions, they face the challenge of processing and analyzing huge amounts of data and turning it into profits. In response to this, vendors are trying to upgrade their business intelligence (BI) products, which are sets of tools and technologies designed to efficiently extract useful information from oceans of data. If successful, upgrading the technology would not only help users but could also let BI vendors widen their products' audience. However, despite the recent improvements, widespread adoption still faces several key challenges, such as high costs and the need for BI systems to integrate and interoperate with the many heterogeneous corporate data sources.
Compiling Conceptual Graphs
Authors: Gerard Ellis
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

This paper addresses problems in conceptual graph implementation: subsumption and classification in a taxonomy. Conceptual graphs are typically stored using a directed acyclic graph data structure based on the partial order over conceptual graphs.We give an improved algorithm for classifying conceptual graphs into this hierarchy. It prunes the search space in the database using the information gathered while searching.We show how conceptual graphs in this hierarchy can be compiled into instructions which represent specialized cases of the canonical formation rules. This compiles subsumption of conceptual graphs and compresses knowledge in a knowledge base. Conceptual graphs are compiled as differences between adjacent graphs in the hierarchy. The differences represent the rules used in deriving the graph from the adjacent graphs. We illustrate how the method compresses knowledge bases in some experiments.Compilation is effected in three ways: removal of redundant data, use of simple instructions which ignore redundant checks when performing matching, and by sharing common processing between graphs.
Visual Modeling for Agent-Based Applications
Authors: Benjamin Falchuk, Ahmed Karmouch
Venue: Computer (1998)

Programmers have tools to specify, customize, and control mobile agent behavior. But there are no such tools for nonprogrammers. Developing tools to specify mobile agents and their itineraries is not simple. The fluid state of agent-related standards, emerging proprietary solutions, and workstation technology all influence the design of such tools. This article describes the work being done on the interface to the Agent Inception System. The AIS helps both programmers and nonprogrammers create agent-based applications, including information retrieval, courseware acquisition, videoconference setup, network management, and electronic commerce. The system's interface, the Iconic Modeling Tool (IMT), uses icons to help users visualize and model mobile agents and their itineraries. The IMT is a simple and intuitive tool for modeling mobile agent itineraries. It is designed to be easier for novice users to learn than an agent scripting language or a programming language like Java. As yet there are no formal statistics on user interaction with the IMT, but in preliminary experiments, users were able to create even a complex agent in less than four minutes.
Applying Fuzzy Logic to Codesign Partitioning
Authors: Vincenzo Catania, Michele Malgeri, Marco Russo
Venue: IEEE Micro (1997)

This article deals with the problems connected to the Hardware/Software Codesign partitioning phase. The novelties of our proposal lies in the approach to choosing between hardware and software implementation. To achieve this, the framework proposed benefits from the simultaneous use of Soft Computing, i.e. Fuzzy Logic, Genetic Algorithms and Neural Networks, which allow the performance of single modules to be evaluated without having to actually perform a low-level simulation of the synthesized device. Finally, we propose an algorithm to choose a good solution for partitioning based on a fuzzy resolver which uses the data provided by the previous analysis.
Groups of Germs of Analytic Diffeomorphisms in (C2, 0)
Authors: Fabio Enrique Brochero Martínez
Venue: Journal of Dynamical and Control Systems (2003)

Let G be a group of germs of analytic diffeomorphisms in (C2, 0). We find some remarkable properties supposing that G is finite, linearizable, abelian, nilpotent, and solvable. In particular, if the group is abelian and has a generic dicritic diffeomorphisms, then the group is a subgroup of a 1-parametric group. In addition, we study the topological behavior of the orbits of a dicritic diffeomorphisms. Last, we find some invariants in order to know when two diffeomorphisms are formally conjugate.
A Region-Based Fuzzy Feature Matching Approach to Content-Based Image Retrieval
Authors: Yixin Chen, James Z. Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper proposes a fuzzy logic approach, UFM (unified feature matching), for region-based image retrieval. In our retrieval system, an image is represented by a set of segmented regions, each of which is characterized by a fuzzy feature (fuzzy set) reflecting color, texture, and shape properties. As a result, an image is associated with a family of fuzzy features corresponding to regions. Fuzzy features naturally characterize the gradual transition between regions (blurry boundaries) within an image and incorporate the segmentation-related uncertainties into the retrieval algorithm. The resemblance of two images is then defined as the overall similarity between two families of fuzzy features and quantified by a similarity measure, UFM measure, which integrates properties of all the regions in the images. Compared with similarity measures based on individual regions and on all regions with crisp-valued feature representations, the UFM measure greatly reduces the influence of inaccurate segmentation and provides a very intuitive quantification. The UFM has been implemented as a part of our experimental SIMPLIcity image retrieval system. The performance of the system is illustrated using examples from an image database of about 60,000 general-purpose images.
Applying Formal Specifications to Real-World Software Development
Authors: Girish Keshav Palshikar
Venue: IEEE Software (2001)

While formal methods are gaining acceptance in the software industry, there is a need for practical guidelines for making the best use of formal specifications. The author provides a few such pragmatic tips for people involved in the industrial use of formal specifications. The 15 guidelines are split into two areas, dealing with process and content. The author also includes a full-page reference for literature available over the Web.
MBone Provides Audio and Video Across the Internet
Authors: Michael R. Macedonia, Donald P. Brutzman
Venue: Computer (1994)

Researchers have produced the Multicast Backbone (MBone), which provides audio and video connectivity from outer space to under water/spl minus/and virtually everyplace in between. MBone is a virtual network that has been in existence since early 1992. It originated from an effort to multicast audio and video from meetings of the Internet Engineering Task Force. Today. hundreds of researchers use MBone to develop protocols and applications for group communication. Multicast provides one-to-many and many-to-many network delivery services for applications such as videoconferencing and audio where several hosts need to communicate simultaneously. This article describes the network concepts underlying MBone, the importance of bandwidth considerations, various application tools, MBone events, interesting MBone uses, and provides guidance on how to connect your Internet site to the MBone.
Identifying Software Productivity Improvement Approaches and Risks: Construction Industry Case Study
Authors: Peter Hantos, Mario Gisbert
Venue: IEEE Software (2000)

The realities of the global economy are forcing US manufacturers to identify ways to control software development more effectively, even if the discipline presently lacks agreed-upon processes and standard quality metrics. To foster improvements in software research and development, interdisciplinary, cross-pollination approach can provide many benefits within individual and group settings. Using a popular training video from the construction industry, Hantos and Gisbert identify ways to overcome cultural, institutional, and implementation barriers to software process improvement.