ppxscal/embedding_network huggingface dataset:
PRIMA-UML: a performance validation incremental methodology on early UML diagrams
Authors: Vittorio Cortellessa, Raffaela Mirandola
Venue: Science of Computer Programming (2002)

The development of complex software systems satisfying performance requirements is achievable only spending careful attention to performance goals throughout the lifecycle, and especially from its very beginning. Unified modeling language (UML) is quickly becoming a standard notation for specification and design of software systems. UML offers several diagrams for separating concerns of different system views, and this feature is helpful to derive early performance models that take into account combined data from these diagrams. In this paper, we introduce a methodology Performance Incremental Validation in UML (PRIMA-UML) aimed at generating a queueing network based performance model from UML diagrams that are usually available early in the software lifecycle. PRIMA-UML is incremental in that it combines information extracted from (and annotated into) different UML diagrams to piecewise build the performance model. Besides, this is not a "black box" approach, as the methodology is open to embed information coming from other UML diagrams (possibly in late lifecycle phases) for detailing, refining or domain tailoring the performance model. This work is a contribute to encompass the performance validation task as an integrated activity within the development process of complex systems. We apply the methodology to a quite simple example to show how effective it can be to get early performance insights.
Loop Restructuring for Data I/O Minimization on Limited On-Chip Memory Embedded Processors
Authors: Waibhav Tembe, Santosh Pande
Venue: IEEE Transactions on Computers (2002)

In this paper, we propose a framework for analyzing the flow of values and their reuse in loop nests to minimize data traffic under the constraints of limited on-chip memory capacity and dependences. Our analysis first undertakes fusion of possible loop nests intra-procedurally and then performs loop distribution. The analysis discovers the closeness factor of two statements which is a quantitative measure of data traffic saved per unit memory occupied if the statements, were under the same loop nest over the case where they are under different loop nests. We then develop a greedy algorithm which traverses the program dependence graph (PDG) to group statements together under the same loop nest legally to promote maximal reuse per unit of memory occupied. We implemented our framework in Petit, a tool for dependence analysis and loop transformations. We compared our method with one based on tiling of fused loop nest and one based on a greedy strategy to purely maximize reuse. We show that our methods work better than both of these strategies in most cases for processors such as TMS320Cxx, which have a very limited amount of on-chip memory. The improvements in data I/O range from 10 to 30 percent over tiling and from 10 to 40 percent over maximal reuse for JPEG loops.
Perception of 3-D Surfaces from 2-D Contours
Authors: F. Ulupinar, R. Nevatia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Inference of 3-D shape from 2-D contours in a single image is an important problem in machine vision. The authors survey classes of techniques proposed in the past and provide a critical analysis. They show that two kinds of symmetries in figures, which are known as parallel and skew symmetries, give significant information about surface shape for a variety of objects. They derive the constraints imposed by these symmetries and show how to use them to infer 3-D shape. They also discuss the zero Gaussian curvature (ZGC) surfaces in depth and show results on the recovery of surface orientation for various ZGC surfaces.
Edge-coloring critical graphs with high degree
Authors: Lian-ying Miao, Jian-liang Wu
Venue: Discrete Mathematics (2002)

It is proved here that any edge-coloring critical graph of order n and maximum degree Δ ≥ 8 has the size at least 3(n + Δ - 8). It generalizes a result of Hugh Hind and Yue Zhao.
Cutting Plane Algorithms for Nonlinear Semi-Definite Programming Problems with Applications
Authors: Hiroshi Konno, Naoya Kawadai, Hoang Tuy
Venue: Journal of Global Optimization (2003)

We will propose an outer-approximation (cutting plane) method for minimizing a function fX subject to semi-definite constraints on the variables X&isin;Rn. A number of efficient algorithms have been proposed when the objective function is linear. However, there are very few practical algorithms when the objective function is nonlinear. An algorithm to be proposed here is a kind of outer-approximation(cutting plane) method, which has been successfully applied to several low rank global optimization problems including generalized convex multiplicative programming problems and generalized linear fractional programming problems, etc. We will show that this algorithm works well when f is convex and n is relatively small. Also, we will provide the proof of its convergence under various technical assumptions.
The inside story: including physiology in structural plant models
Authors: Michael Renton, Jim Hanan, Pekka Kaitaniemi
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Using models of frangipani, cotton and birch plants, this paper shows how physiology can be included in structural plant models through local plant component resource modelling, crop level modelling and canonical mathematical modelling at the level of the individual plant. These simulations are more than just pictorial representations of these plants, and more than just three-dimensional structural representations changing over time. They respond to their environment as they grow, which is achieved by including aspects of physiology in the models. However, they do not require detailed and complex quantitative understanding of the individual plant's physiology. This paper demonstrates the possibility of constructing such adaptive virtual plant simulations, with environmentally sensitive complex emergent structure, by modelling physiology in simple, yet effective ways.
The Event Matching Language for Querying Temporal Data
Authors: Tsz S. Cheng, Shashi K. Gadia
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Querying object evolution in temporal databases is interesting, but neither SQL-like algebraic languages nor general purpose languages take evolution into account. This paper presents a language, called the Event Matching Language, that is specifically designed for querying object evolution. The language is a pattern matching language based on the concept of cursor borrowed from SNOBOL4.
Combinatorial Analysis of the Fault-Diameter of the N-Cube
Authors: S. Latifi
Venue: IEEE Transactions on Computers (1993)

It is shown that the diameter of an n-dimensional hypercube can only increase by an additive constant of 1 when (n-1) faulty processors are present. Based on the concept of forbidden faulty sets, which guarantees the connectivity of the cube in the presence of up to (2n-3) faulty processors. It is shown that the diameter of the n-cube increases to (n-2) as a result of (2n-3) processor failures. It is also shown that only those nodes whose Hamming distance is (n-2) have the potential to be located at two ends of the diameter of the damaged cube. It is proven that all the n-cubes with (2n-3) faulty processors and a fault-diameter of (n+2) are isomorphic. A generalization to the subject study is presented.
A Case Study: Acquiring Strategic Knowledge for Expert System Development
Authors: Duane Sharman, E. J. M. Kendall
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The authors focus on methodological issues that establish knowledge engineering as an alternative to structured analysis and design, concentrating on the acquisition of strategic knowledge as an implementation structure determinant. They analyze benefits derived from applying expert systems in cellular telecommunications systems, discuss related artificial intelligence work, define structural characteristics of knowledge-based systems, examine a verbal problem-solving protocol from an expert, describe a prototypical knowledge-based program, and review methods and results. They discuss the role of deep knowledge in maintenance tasks, present the resulting system design, and examine the relevant development methodology.
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
Authors: L. Sha, R. Rajkumar, J. P. Lehoczky
Venue: IEEE Transactions on Computers (1990)

An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol. Both protocols solve the uncontrolled priority inversion problem. The priority ceiling protocol solves this uncontrolled priority inversion problem particularly well; it reduces the worst-case task-blocking time to at most the duration of execution of a single critical section of a lower-priority task. This protocol also prevents the formation of deadlocks. Sufficient conditions under which a set of periodic tasks using this protocol may be scheduled is derived.
Adaptive Fault Detection and Diagnosis of RAM Interconnects
Authors: Jun Zhao, Fred J. Meyer, Fabrizio Lombardi
Venue: Journal of Electronic Testing: Theory and Applications (1999)

We give three new algorithms to compute tests for faults in the interconnects of random access memories (RAM) using only read and write operations. Diagnosis of address line faults is the most difficult step. Our Adaptive Diagnosis Algorithm (ADA) considers each address line separately. Single line faults are easy to diagnose, so the objective is to ascertain which address lines are free of faults, thereby pruning impossible multi-line faults. Our Consecutive Diagnosis Algorithm (CDA) uses a more complicated and lengthier test sequence. However, with CDA, interpreting the test results is easier and the diagnostic resolution is superior. Our third algorithm, Adaptive Diagnosis Algorithm with Repair (ADAR), relies upon additional testing after repair in order to diagnose more faults than would otherwise be possible. ADAR has three test stages with two repair stages between them.
Suspension Terms as a Means for Meta-coordination in the &mu;Log Coordination Framework
Authors: K. De Bosschere, J.-M. Jacquet
Venue: The Journal of Supercomputing (2003)

In this paper we introduce the concept of suspension terms as a reification of the suspension of coordination operations in the &mu;Log framework. Each time a coordination operation suspends, a corresponding suspension term is created. By creating primitives that can manipulate the suspension terms, we are able to introduce coordination primitives at the meta-level (e.g., dealing with success, failure, suspension). This is called meta-coordination. In this paper, we introduce the new primitives, give a formal definition of their basic semantics, and argue their expressiveness. The paper is concluded with an argumentation why first order suspension terms suffice and how higher order suspension terms can be replaced by lower order suspension terms.
Homeomorphs and amallamorphs of the Petersen graph
Authors: Hossein Shahmohamad, Earl Glen Whitehead,  Jr.
Venue: Discrete Mathematics (2002)

Let P be the Petersen graph. The main results of this paper are the discovery of infinite families of chromatically equivalent pairs of P homeomorphs and the discovery of infinite families of flow equivalent pairs of P amallamorphs. In particular, three families of P homeomorphs with 8 parameters, five families with 7 parameters and many families with fewer parameters are obtained. Also one family of P amallamorphs with 9 parameters, three families with 7 parameters, seven families with 6 parameters and many families with fewer parameters are obtained.
Pulse Shaping in OFDM Based Single Frequency Networks
Authors: G. Malmgren
Venue: Wireless Personal Communications: An International Journal (1999)

In systems using Orthogonal Frequency Division Multiplexed (OFDM) all transmitters in a radio broadcasting network may transmit identical signals in the same frequency block, forming a so called Single Frequency Network (SFN). The simultaneous transmission creates a severe artificial multipath propagation causing interference at the receiver. This interference consists not only by intersymbol interference (ISI), but also interchannel interference (ICI) due to orthogonality losses between OFDM scheme&lsquo;s subcarriers. A method that is often used to counter the &rsquo;&rsquo;self-interference&lsquo;&lsquo; is to insert a guard interval between consecutive OFDM frames combined with an increased symbol duration. The receiver in an SFN is normally experiencing a diversity gain of receiving several signals. Doubts concerning the performance has been raised due to the OFDM scheme&lsquo;s sensitivity to frequency errors. If the received signals are exposed to different carrier offsets it will lead to ICI, resulting into reduced coverage. In this paper we apply pulse shaping to reduce the effects of ISI and ICI. Pulse shaping of the transmitted OFDM signal is shown to give significant reductions in self-interference. It is hereby possible to achieve the same coverage with a reduced amount of transmitters. The system also becomes less sensitive to time and frequency synchronisation errors. A method to analyse the performance for time limited pulse shapes is presented using weight functions describing the amount of useful and interfering powers. In the receiver analysis, generalised expressions are given using Fourier transforms and series.
Embedded Control Problems, Thumb, and the ARM7TDMI
Authors: Simon Segars, Keith Clarke, Liam Goudge
Venue: IEEE Micro (1995)

This article discusses an architectural innovation from ARM known as Thumb. High-end embedded control applications such as cell-phones, disk drives, and modems are demanding more performance from their controllers whilst still requiring low costs. By implementing a second "compressed" instruction set, Thumb reduces RISC code size and hence provides 32-bit ARM RISC performance at 8/16-bit system cost.The article starts with a description of the problems of embedded control and then discusses the Thumb solution and its implementation. Typical application areas and competitive benchmarking are also covered.
Application of Second Order TVD and WENO Schemes in Internal Aerodynamics
Authors: Jiří Fürst, Karel Kozel
Venue: Journal of Scientific Computing (2002)

We deal with the comparison of several finite volume TVD schemes and finite difference ENO schemes and we describe a second order finite volume WENO scheme which was developed for the case of general unstructured meshes. The proposed second order WENO reconstruction is much simpler than the original ENO scheme introduced in &lsqb;Harten and Chakravarthy 1991&rsqb;. Moreover, the proposed WENO method is very easily extendible for unstructured meshes in 3D. All above mentioned schemes are applied for the solution of 2D and 3D transonic flows in the turbines and channels and the numerical solution is compared to experimental results or to the results obtained by other authors.
Shape and Nonrigid Motion Estimation Through Physics-Based Synthesis
Authors: D. Metaxas, D. Terzopoulos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A physics-based framework for 3-D shape and nonrigid motion estimation for real-time computer vision systems is presented. The framework features dynamic models that incorporate the mechanical principles of rigid and nonrigid bodies into conventional geometric primitives. Through the efficient numerical simulation of Lagrange equations of motion, the models can synthesize physically correct behaviors in response to applied forces and imposed constraints. Applying continuous Kalman filtering theory, a recursive shape and motion estimator that employs the Lagrange equations as a system model is developed. The system model continually synthesizes nonrigid motion in response to generalized forces that arise from the inconsistency between the incoming observations and the estimated model state. The observation forces also account formally for instantaneous uncertainties and incomplete information. A Riccati procedure updates a covariance matrix that transforms the forces in accordance with the system dynamics and prior observation history. Experiments involving model fitting and tracking of articulated and flexible objects from noisy 3-D data are described.
Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins
Authors: Chang-Hung Lee, Ming-Syan Chen
Venue: IEEE Transactions on Computers (2002)

The query processing in a mobile computing environment involves join processing among different sites which include static servers and mobile computers. Because of the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore some unique features of a mobile environment and then, in light of these features, devise query processing methods for both join and query processing. Remote mobile joins are said to be effectual if they are, when being interleaved into a join sequence, able to reduce the amount of data transmission cost required for distributed mobile query processing. Since mobile relations are employed as reducers in our proposed query processing cost model, more mobile joins in the query processing lead to less data transmitted through the network. With proper scheduling, interleaving effectual remote mobile joins into a query scheduling can significantly reduce the total amount of data transmission among different sites. A simulator is developed to evaluate the performance of algorithms devised. Our results show that the approach of interleaving the processing of distributed mobile queries with effectual remote mobile joins is not only efficient, but also effective in reducing the total amount of data transmission cost required to process distributed mobile queries.
An Object-Oriented Progressive-Simplification-Based Vectorization System for Engineering Drawings: Model, Algorithm, and Performance
Authors: Jiqiang Song, Feng Su, Chiew Lan Tai, Shijie Cai
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Existing vectorization systems for engineering drawings usually take a two-phase workflow: convert a raster image to raw vectors and recognize graphic objects from the raw vectors. The first phase usually separates a ground truth graphic object that intersects or touches other graphic objects into several parts, thus, the second phase faces the difficulty of searching for and merging raw vectors belonging to the same object. These operations slow down vectorization and degrade the recognition quality. Imitating the way humans read engineering drawings, we propose an efficient one-phase object-oriented vectorization model that recognizes each class of graphic objects from their natural characteristics. Each ground truth graphic object is recognized directly in its entirety at the pixel level. The raster image is progressively simplified by erasing recognized graphic objects to eliminate their interference with subsequent recognition. To evaluate the performance of the proposed model, we present experimental results on real-life drawings and quantitative analysis using third party protocols. The evaluation results show significant improvement in speed and recognition rate.
The MIPS R10000 Superscalar Microprocessor
Authors: Kenneth C. Yeager
Venue: IEEE Micro (1996)

The Mips R10000 is a dynamic superscalar microprocessor that implements the 64-bit Mips-4 Instruction Set Architecture. It fetches and decodes four instructions per cycle and dynamically issues them to five fully pipelined low-latency execution units. Instructions can be fetched and executed speculatively beyond branches. Instructions graduate in order upon completion. Although instructions execute out of order, the processor still provides sequential memory consistency and precise exception handling.The R10000 is designed for high performance, even in large real-world applications which have poor memory locality. With speculative execution, it calculates memory addresses and initiates cache refills early. Its hierarchical nonblocking memory system helps hide memory latency with two levels of set-associative, write-back caches.
Viewing Knowledge Bases as Qualitative Models
Authors: William J. Clancey
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

A viewpoint on expert systems is developed that considers the qualitative nature of knowledge encoded in such programs. It is maintained that all knowledge bases contain models of systems in the world. Reasoning involves sequences of tasks (for example, monitoring and diagnosis) by which an understanding or model of specific situations is related to action plans. Programs use a simple repertoire of qualitative modeling techniques commonly called knowledge representations. The situation-specific-model concept makes concrete exactly what programs know and how to describe problem solving in terms of model-manipulation operators. The viewpoint is exemplified for the particular case of medical diagnosis. A historical perspective shows how AI's concern with adaptiveness and the rationality of the autonomous agent emphasizes the role of models as what a problem-solver knows. It is suggested that this has been to the detriment of understanding the primary characteristic of knowledge in terms of models that partition the world, viewing it selectively and making it coherent for some purpose.
Comparison of Wavelet Transform and FFT Methods in the Analysis of EEG Signals
Authors: M. Akin
Venue: Journal of Medical Systems (2002)

In this study, whether the wavelet transform method is better for spectral analysis of the brain signals is investigated. For this purpose, as a spectral analysis tool, wavelet transform is compared with fast Fourier transform (FFT) applied to the electroencephalograms (EEG), which have been used in the previous studies. In addition, the time-domain characteristics of the wavelet transform are also detected. The comparison results show that the wavelet transform method is better in detecting brain diseases.
Hybrid structured clock network construction
Authors: Haihua Su, Sachin S. Sapatnekar
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This paper hierarchically constructs a hybrid mesh/tree clock network structure consisting of overlying zero-skew clock meshes, with underlying zero-skew clock trees originating from the mesh nodes. We propose a mesh construction procedure, which guarantees zero skew under the Elmore delay model, using a simple and efficient linear programming formulation. Buffers are inserted to reduce the transition time (or rise time). As a post-processing step, wire width optimization under an accurate higher-order delay metric is performed to further minimize the transition time and propagation delay/skew. Experimental results show that the hybrid mesh/tree construction scheme can provide smaller propagation delay and transition time than a comparable clock tree.
Modeling User Interface-Application Interactions
Authors: William D. Hurley, John L. Sibert
Venue: IEEE Software (1989)

The authors describe how to model the interface between the user interface and the application. Their conceptual modeling system contains constructs and abstraction mechanisms that structure knowledge in a model. They use the interaction semantics of a spreadsheet to illustrate the practical applications of their system.