ppxscal/embedding_network huggingface dataset:
Mathematical analysis of the use of application-level traffic measurements for capacity engineering
Authors: Y. Chandramouli, Arnold L. Neidhardt
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

In general, the traffic characteristics of the individual applications that constitute the aggregate traffic on a network can be important for capacity engineering. In this paper, we demonstrate, based on mathematical analysis, the value of application-specific measurements, even when there is no service differentiation. Specifically, under certain assumptions, we obtain the result that engineering errors occur when traffic characteristics of individual applications are ignored, and that the errors are in the direction of under-engineering. The assumptions are that the individual applications can be modeled adequately as Fractional Brownian Motions and that measurements are available only at relatively coarse time scales (as is common presently). The results in this paper emphasize the value of collecting fine-grained traffic measurements.
A D&T Special Report-Boundary Scan: An End-of-Term Report-IEEE Std 1149.1 Survey Results
Authors: Colin Maunder
Venue: IEEE Design Test (1992)

The level of commercial support for and the extent to which manufacturers are using IEEE Std 1149.1 Standard Test-Access Port and Boundary-Scan Architecture in their products are described. The author's involvement in the IEEE 1149.1 Working Group is discussed.
Evolutionary domains: a basis for sound software evolution
Authors: Takuya Katayama
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Though significant amount of work has been done so far, software evolution problem is still a challenge. It is not only due to the inherent difficulty of changing complex objects such as software, but also it comes from the fact that evolution activities are not performed properly. In this paper, aiming at establishing a sound and scientific basis for software evolution, we propose a general framework of software evolution. It is based on the concept of evolutionary domains and evolutionary development between them. We consider that this will serve as a reference model of software evolution and can be used for evaluating, assessing and guiding evolution activities.
Bounds on the Covering Radius of Linear Codes
Authors: A. Ashikhmin, A. Barg
Venue: Designs, Codes and Cryptography (2002)

Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribution of codes to derive new results for linear codes.
What Makes Patterns Interesting in Knowledge Discovery Systems
Authors: Avi Silberschatz, Alexander Tuzhilin
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

One of the central problems in the field of knowledge discovery is the development of good measures of interestingness of discovered patterns. Such measures of interestingness are divided into objective measures¿those that depend only on the structure of a pattern and the underlying data used in the discovery process, and the subjective measures¿those that also depend on the class of users who examine the pattern. The focus of this paper is on studying subjective measures of interestingness. These measures are classified into actionable and unexpected, and the relationship between them is examined. The unexpected measure of interestingness is defined in terms of the belief system that the user has. Interestingness of a pattern is expressed in terms of how it affects the belief system. The paper also discusses how this unexpected measure of interestingness can be used in the discovery process.
Moment Forms Invariant to Rotation and Blur in Arbitrary Number of Dimensions
Authors: Jan Flusser, Jirí Boldys, Barbara Zitová
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We present the construction of combined blur and rotation moment invariants in arbitrary number of dimensions. Moment invariants to convolution with an arbitrary centrosymmetric filter are derived first, and then their rotationally invariant forms are found by means of group representation theory to achieve the desired combined invariance. Several examples of the invariants are calculated explicitly to illustrate the proposed procedure. Their invariance, robustness, and capability of using in template matching and in image registration are demonstrated on 3D MRI data and 2D indoor images.
A 3D Spreadsheet Based on Intensional Logic
Authors: Weichang Du, William W. Wadge
Venue: IEEE Software (1990)

A three-dimensional spreadsheet design based on intensional logic is proposed. Intensional logic is concerned with assertions and other expressions whose meaning depends on an implicit context. The intensional spreadsheet is a declarative spreadsheet with a simple formal semantics called intensional semantics. It is expected to be suitable for a wide range of applications and for various users, including those who have had conventional programming experience. As an example of using the intensional 3-D spreadsheet, the formalization of a systolic algorithm for matrix multiplication is considered.
Seteli: The Strategy Expert for Telecommunication Investments
Authors: Ahti Salo, Raimo P. Hamalainen
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

A description is given of the Seteli system, which combines technical knowledge about network structure with managers' subjective assessments. Managers can examine how the network would evolve subject to different assumptions regarding demand and subscriber preferences. The nature of the telecommunication planning problem in Finland (where Seteli was developed) is described. The development of Seteli is briefly recounted, its structure is examined, and the use of the system is discussed. Seteli's current status and its utility are assessed.
Evolutionary Project Management
Authors: Stuart Woodward
Venue: Computer (1999)

As a developer of financial software, the author has witnessed various project management strategies. Three years ago, he participated in and managed two nearly identical systems for investment managers, undertaken at two different companies. The first project used conventional project management techniques and failed without delivering a functional product after 21 months. Subsequently, the author joined another company, Anite, and became the project manager of the OMAR (Order Management And Routing) system in July 1996. He determined to learn from the first project's failure and decided to adopt the Evolutionary Project Management (EPM). This time he succeeded. This article describes EPM's advantages over conventional software project management and how the author adapted EPM to Anite's small-team environment.
Proceedings of the 4th International Workshop on Principles of Software Evolution
Venue: International Conference on Software Engineering (2001)

Welcome to the IWPSE 2001, the International Workshop on Principles of Software Evolution, held in conjunction with the 8th European Software Engineering Conference (ESEC)/9th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE-9).The IWPSE 2001 is the fourth workshop in a series started from IWPSE '98 held with International Conference on Software Engineering (ICSE '98) in Kyoto, Japan. Since then, the workshops have been held annually in Japan, as IWPSE '99, and ISPSE 2000, the International Symposium on Principles of Software Evolution. The IWPSE 2001 is the first workshop held outside Japan, and has much international flavor. This year, we received 40 submissions, including 15 full papers and 25 short/position papers, from 18 countries. The IWPSE2001 program committee conducted three concurrent reviews to each submitted papers, and accepted 7 full papers and 29 short/position papers.Besides these papers, we are very honored to have two excellent keynotes. The first keynote is presented by Professor Manny Lehman from Imperial College, United Kingdom. Professor Lehman is one of the pioneers in the research on software evolution. The second keynote is presented by Takuya Katayama from JAIST, Japan. Professor Katayama has been leading software evolution research and community. We hope this workshop will provide a forum for not only presenting papers but also exchanging ideas and plans on this subject of software evolution.
A Parallel Unification Machine
Authors: F. N. Sibai, K. L. Watson, Mi Lu
Venue: IEEE Micro (1990)

A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data formats, and processor organization are described. The machine has been simulated at the register-transfer level with the ISPS computer description language. The simulated performance is compared with that of two serial unification coprocessors. Significant speedup is observed.
Intensional Answers to Database Queries
Authors: A. Motro
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

In addition to data, database systems store various kinds of information about their data. Examples are: class hierarchies, to define the various data classes and their relationships; integrity constraints, to state required relationships among the data; and inference rules, to define new classes in terms of known classes. This information is often referred to as intensional information (the data are referred to as extensional information). There have been several independent research works that suggested ways by which intensional information may be used to improve the conventional (extensional) database answers. Although each of these efforts developed its own specific methods, they all share a common belief: database answers would be improved if accompanied by intensional statements that describe them more abstractly. We study and compare the various approaches to intensional answers by using various classifications; we examine their relative merits with regard to key aspects; we discuss remaining issues; and we offer new research directions.
A Fully Implicit Parallel Ocean Model Using MUMPS
Authors: Jos De Kloe, Aad Van Der Steen, Hakan Öksüzoğlu, Henk Dijkstra
Venue: The Journal of Supercomputing (2002)

The formulation, implementation and performance of a new fully implicit parallel model of the ocean circulation is presented. Within this model, steady states can be traced in one of the control parameters. In addition, transient flows can be computed using relatively (compared to traditional ocean models) large time steps such that long integration times can be reached. The discretized equations of the ocean model are solved by the Newton-Raphson technique and the emerging linear systems are solved by a (MPI) version of the MUltifrontal Massively Parallel Solver. The performance of the code on an SGI Origin 2000 platform is presented here using typical results for a sector ocean flow.
Preventing dielectric damage of low-k organic siloxane by passivation treatment
Authors: T. C. Chang, Y. S. Mor, P. T. Liu, T. M. Tsai, C. W. Chen, Y. J. Mei, F. M. Pan, W. F. Wu, S. M. Sze
Venue: Microelectronic Engineering (2002)

An organic SOG, the Hybird-Organic-Siloxane-Polymer (HOSP), has high applicability to ULSI processes, because of the low dielectric constant of about 2.5. However, the HOSP film will be damaged after photoresist removal. The function groups of HOSP will be destroyed by O2 plasma ashing and chemical wet stripper, which leads to electrical degradation. In order to avoid the issue, H2 plasma treatment is proposed to prevent HOSP film from photoresisit stripping damage. It is found that leakage current is decreased significantly and the dielectric constant is still maintained at a low k value even after photoresist stripping. Therefore, H2 plasma treatment is an effective technique to enhance the resistance of HOSP film against photoresist stripping damage.
Supply facility and input/output point locations in the presence of barriers
Authors: Shoou-Jiun Wang, Joyendu Bhadury, Rakesh Nagi
Venue: Computers and Operations Research (2002)

This paper studies a facility location model in which two-dimensional Euclidean space represents the layout of a shop floor. The demand is generated by fixed rectangular-shaped user sites and served by a single supply facility. It is assumed that (i) communication between the supply point and a demand facility occurs at an input/output (I/O) point on the demand facility itself, (ii) the facilities themselves pose barriers to travel and (iii) distance measurement is as per the L1-metric. The objective is to determine optimal locations of the supply facility as well as I/O points on the demand facilities, in order to minimize total transportation costs. Several, increasingly more complex, versions of the model are formulated and polynomial time algorithms are developed to find the optimal locations in each case.
Modeling Live and Dead Lines in Cache Memory Systems
Authors: A. Mendelson, D. Thiebaut, D. K. Pradhan
Venue: IEEE Transactions on Computers (1993)

An analytical model that predicts the fraction of live and dead lines present in a cache memory in a multitasking environment is presented. The model is two-fold. The first portion evaluates the number of live lines created in a fully associative cache during the execution of a process. The second portion models the interaction of two processes that share a cache and run in an interleaved fashion. The model admits direct-mapped, set-associative, and fully associative cache architectures. The complete model assumes a hyperbolic (or fractal) model of program behavior. It predicts the variations of the total number of lines (footprint) as well as the number of live lines held by a process in the various caches as a function of the number of cache accesses. The accuracy of the model is validated through trace driven simulations.
A note on constructing binary heaps with periodic networks
Authors: Marek Piotrów
Venue: Information Processing Letters (2002)

We consider the problem of constructing binary heaps on constant degree networks performing compare-exchange operations only. The heap data structure, introduced by William and Williams [Comm. ACM 7 (6) (1964) 347-348], has many applications and, therefore, has been intensively studied in sequential and parallel context. In particular, Brodal and Pinotti [Theoret. Comput. Sci. 250 (2001) 235-245] have recently presented two families of comparator networks: the first of depth 4 log N and the second of size O(N log log N) for constructing binary heaps of size N. In this note, we give an new construction of such a network with the running time improved to 3 log N. Moreover, the network has a novel property of being 3-periodic, that is, for each unit of time i the same sets of operations are performed in units i and i + 3. Then we argue that our construction is optimal with respect to the length of the period, that is, we prove that there is no 2-periodic network that is able to build a binary heap in sublinear time. Finally, we show that our construction can be used to decrease also the depth of the networks with O(N log log N) size.
The Iowa Driving Simulator: An Immersive Research Environment
Authors: Jon Kuhl, Douglas Evans, Yiannis Papelis, Richard Romano, Ginger Watson
Venue: Computer (1995)

The Iowa Driving Simulator (IDS) is a high-fidelity, immersive virtual environment for driving simulation. It supports a variety of applications, ranging from traffic safety research to full-scale test and evaluation of vehicle designs. The IDS places an operator at the controls of a detailed, computational vehicle model in a rich, fully interactive environment, including traffic, roadway, and other environmental characteristics, while providing the driver with high-fidelity motion, visual, auditory, and force feedback cues. The immersive virtual environment can create a range of driving conditions from high density, multilane urban freeways to two-lane rural roads and off-road terrain. A wide variety of scenarios and events can be specified to meet experimental needs. The authors describe the capabilities and underlying architecture of the IDS and the approach used to model and control the virtual environment. Several current applications of the IDS are highlighted, including its use in the study of human-factors issues for an automated highway system and creation of a "virtual proving ground" for engineering evaluation of military and commercial vehicles. As of July 1995, approximately 1,000 experimental runs have been conducted in conjunction with 22 separate studies using the IDS. Another 450 runs will be made before the end of the year.
Constructing the Dependency Structure of a Multiagent Probabilistic Network
Authors: S. K. Michael Wong, Cory J. Butz
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

A probabilistic network consists of a dependency structure and corresponding probability tables. The dependency structure is a graphical representation of the conditional independencies that are known to hold in the problem domain. In this paper, we propose an automated process for constructing the combined dependency structure of a multiagent probabilistic network. Each domain expert supplies any known conditional independency information and not necessarily an explicit dependency structure. Our method determines a succinct representation of all the supplied independency information called a minimal cover. This process involves detecting all inconsistent information and removing all redundant information. A unique dependency structure of the multiagent probabilistic network can be constructed directly from this minimal cover. The main result of this paper is that the constructed dependency structure is a perfect-map of the minimal cover. That is, every probabilistic conditional independency logically implied by the minimal cover can be inferred from the dependency structure and every probabilistic conditional independency inferred from the dependency structure is logically implied by the minimal cover.
NASA's great zooms: a case study
Authors: Gregory W. Shirah, Horace G. Mitchell
Venue: Proceedings of the conference on Visualization '02 (2002)

This paper examines a series of NASA outreach visualizations created using several layers of remote sensing satellite data ranging from 4-kilometers per pixel to 1-meter per pixel. The viewer is taken on a seamless, cloud free journey from a global view of the Earth down to ground level where buildings, streets, and cars are visible. The visualizations were produced using a procedural shader that takes advantage of accurate georegistration and color matching between images. The shader accurately and efficiently maps the data sets to geometry allowing for animations with few perceptual transitions among data sets. We developed a pipeline to facilitate the production of over twenty zoom visualizations. Millions of people have seen these visualizations through national and international media coverage.
Platform Tuning for Embedded Systems Design
Authors: Frank Vahid, Tony Givargis
Venue: Computer (2001)

UCR's Dalton Project shows that platform tuning can increase performance and reduce power consumption for system-on-chip embedded platforms.
Hypertext and CASE
Authors: James Bigelow
Venue: IEEE Software (1988)

Computer-aided software engineering (CASE) systems require a database system that must let designers logically associate documentation and source code, make annotations to record explanations and assumptions, and manage different versions of the software. The author reports the development of a database, Neptune, which demonstrates that hypertext provides an appropriate data model for CASE systems. Hypertext is a medium-grained, entity-relationship-like data model that lets information be structured arbitrarily and keeps a complete version history of both information and structure. Neptune achieves application independence by using a layered system architecture; at the bottom is a transaction-based server, the Hypertext Abstract Machine, and layered above it are applications and the user interface. The use of Neptune in the Dynamic Design CASE environment is discussed.
Critical Factors Affecting Personal Software Processes
Authors: Xiaoming Zhong, Nazim H. Madhavji, Khaled El Emam
Venue: IEEE Software (2000)

Personal software process quality helps determine the success of software projects and orga-nizations. The authors dig deeper into the factors affecting personal processes.
Scheduling in Hard Real-Time Applications
Authors: Jiang Zhu, Ted G. Lewis, Weldon Jackson, Russel L. Wilson
Venue: IEEE Software (1995)

In a real-time system, the computer periodically gets information from the environment through sensors, updates its internal system states based on the inputs and the current internal states, and generates control commands to change the environment through actuators. A hard real-time system must make correct responses to environmental changes within specified time intervals, or deadlines. Hard deadlines are deadlines that a hard real-time system must meet or a catastrophe may result. In some hard real-time systems, such as those that control nuclear power plants and missiles, all deadlines are hard. A major problem with hard real-time systems is how to be assured that the systems really work. At the University of Oregon, work is being done on theorems that will provide this guarantee for a uniprocessor system. The work involves combining the use of graphical design languages and deadline-scheduling algorithms. Doing so lets developers combine dataflow and control-flow into one diagram, which easily reveals the whole picture of the hard real-time application. This is much more difficult to grasp when viewing the dataflow and control-flow diagrams separately. In this article we describe the application of a graphical design diagram that combines control-flow and dataflow descriptions of a hard real-time application to capture requirements in a form that can be analyzed for schedulability. The design is transformed into a set of precedence-constrained periodic tasks, which are then scheduled onto a single processor in a way that meets all deadlines. To determine if a task can be scheduled, our approach provides two optimal scheduling algorithms, one preemptive and one nonpreemptive. Although there has been much work on graphical design languages and deadline-scheduling algorithms, little has been done to combine the two. We present optimal algorithms for our scheduling problem, although we do not know optimal methods for decomposing a design into a task set, which includes deriving optimal task-release times and deadlines, imposing extra precedence constraints to keep data consistency when preemption is allowed, eliminating redundant computations, and so forth. In general, developing a hard real-time application with deterministic behavior is a very complex engineering process. We believe that for any such attempts to be practical, heuristic methods and rules of thumb must be employed.
A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints
Authors: Bintong Chen, Xiaojun Chen
Venue: Computational Optimization and Applications (2000)

In this paper, we propose a continuation method for box constrained variational inequality problems. The continuation method is based on the class of Gabriel-Mor&eacute; smooth functions and has the following attractive features: It can start from any point&semi; It has a simple and natural neighborhood definition&semi; It solves only one approximate Newton equation at each iteration&semi; It converges globally linearly and locally quadratically under nondegeneracy assumption at the solution point and other suitable assumptions. A hybrid method is also presented, which is shown to preserve the above convergence properties without the nondegeneracy assumption at the solution point. In particular, the hybrid method converges finitely for affine problems.