ppxscal/embedding_network huggingface dataset:
Loop Transformation Using Nonunimodular Matrices
Authors: Agustín Fernández, José M. Llabería, Miguel Valero-García
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Linear transformations are widely used to vectorize and parallelize loops. A subset of these transformations are unimodular transformations. When a unimodular transformation is used, the exact bounds of the transformed loop nest are easily computed and the steps of the loops are equal to 1. Unimodular loop transformations have been widely used since they permit the implementation of many useful loop transformations. Recently, nonunimodular transformations have been proposed to reduce communication requirements or to use the memory hierarchy efficiently. The methods used for unimodular transformations do not work in the case of nonunimodular transformations, since they do not produce the exact bounds of the transformed loop nest. In this paper, we present a method for nested loop transformation which gives the exact bounds for both unimodular and nonunimodular transformations. The basic idea is to use the Hermite Normal Form (HNF) of the transformation matrix.
Comments on "Performability Analysis of Distributed Real-Time-Systems"
Authors: A. Shallof, S. Bennett
Venue: IEEE Transactions on Computers (1994)

For original article see S.M Islam and H. Ammar, "Performability analysis of distributed real-time system", IEEE Trans. Comput., vol.40, no.11, p.1239-1251, Nov. 1991. Referring to the above-mentioned paper, some errors are detected and correct solutions are proved and some remarks are given.
Efficient finite-difference method for quasi-periodic steady-state and small signal analyses
Authors: Baolin Yang, Dan Feng
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

This paper discusses a finite-difference mixed frequency-time (MFT) method for the quasi-periodic steady-state analysis and introduces the quasi-periodic small signal analysis. A new approach for solving the huge nonlinear system the MFT finite difference method generates from practical circuits is given, which makes efficient frequency-sweeping quasi-periodic small-signal analysis possible. The new efficient solving technique works well with the Krylovsubspace recycling or reuse [4], which can not be achieved with existing techniques. In addition, this paper gives a way to calculate the quasi-periodic Fourier integration weights, necessary in the adjoint MFT small-signal analyses, and a way to calculate quasi-periodic large-signal Fourier spectrum that is more efficient than existing methods. Numerical examples also show that the finite-difference MFT method can be significantly more accurate than shooting-Newton MFT method and the new preconditioning technique is more efficient.
Routing Strategies for Fast Networks
Authors: Yossi Azar, Joseph (Seffi) Naor, Raphael Rom
Venue: IEEE Transactions on Computers (1996)

Modern fast packet switching networks are being forced to rethink the routing schemes that are used in more traditional networks. The reexamination is necessitated because in these fast networks switches on the message's route can afford to make only minimal and simple operations. For example, examining a table of a size proportional to the network size is out of the question. In this paper we examine routing strategies for such networks based on flooding and predefined routes. Our concern is to get both efficient routing and an even (balanced) use of network resources. We present efficient algorithms for assigning weights to edges in a controlled flooding scheme but show that the flooding scheme is not likely to yield a balanced use of the resources. We then present efficient algorithms for choosing routes along: 1) bfs trees and 2) shortest paths. We show that in both cases a balanced use of network resources can be guaranteed.
Semantic Query Optimization for Query Plans of Heterogeneous Multidatabase Systems
Authors: Chun-Nan Hsu, Craig A. Knoblock
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

New applications of information systems, such as electronic commerce and healthcare information systems, need to integrate a large number of heterogeneous databases over computer networks. Answering a query in these applications usually involves selecting relevant information sources and generating a query plan to combine the data automatically. As significant progress has been made in source selection and plan generation, the critical issue has been shifting to query optimization. This paper presents a semantic query optimization (SQO) approach to optimizing query plans of heterogeneous multidatabase systems. This approach provides global optimization for query plans as well as local optimization for subqueries that retrieve data from individual database sources. An important feature of our local optimization algorithm is that we prove necessary and sufficient conditions to eliminate an unnecessary join in a conjunctive query of arbitrary join topology. This feature allows our optimizer to utilize more expressive relational rules to provide a wider range of possible optimizations than previous work in SQO. The local optimization algorithm also features a new data structure called AND-OR implication graphs to facilitate the search for optimal queries. These features allow the global optimization to effectively use semantic knowledge to reduce data transmission cost. We have implemented this approach into the pesto query plan optimizer as a part of the sims information mediator. Experimental results demonstrate that pesto can provide significant savings in query execution cost over query plan execution without optimization.
Planar sets containing no three collinear points and non-averaging sets of integers
Authors: Yonutz V. Stanchescu
Venue: Discrete Mathematics (2002)

Let A ⊆ Z2 be a finite set of lattice points and let |A| =n. We prove that if A does not contain any three collinear points, then |A ± A| ≥ n(log n)δ. Here δ can be every positive absolute constant δ ≤ 1/8. This lower bound provides an answer to an old question of Freiman. Some further related questions on non-averaging sets of integers are posed and discussed.
A myopic policy for the gradual obsolescence problem with price-dependent demand
Authors: F. J. Arcelus, T. P. M. Pakkala, G. Srinivasan
Venue: Computers and Operations Research (2002)

The purpose of this paper is to develop a retailer's profit-maximizing myopic inventory policy for an item recognized as subject to gradual obsolescence. Demand is assumed to be a decreasing function of both the retailer's sale price and of time, up to a certain stochastic time point when obsolescence occurs and, as a result, the demand suddenly drops to zero. For each ordering cycle, the decision variables are the retailer's selling price and the order size. A stop-ordering rule is developed on the basis of finding the time point beyond which it is profitable to stop ordering, even if there is still some demand for the item. In addition, the sudden obsolescence problem is shown to be a limiting and non-trivial case of its gradual counterpart. The numerical example illustrates the main features of the model, including the importance of the vendor dropping the price charged to retailers, so as to provide the needed incentives for the retailers to drop the price charged to their own customers and thereby palliate as much as possible to negative effects of obsolescence.
Workshop Summary: The cobbler's children: How can and should we use CSCW tools in our own work?
Authors: George M. Wyner
Venue: ACM SIGOIS Bulletin (1995)

The purpose of this workshop was to consider the practical ways CSCW tools are already being used or might be used by the CSCW research community itself. Participants explored the full lifecycle of research, from idea generation and issue definition to collaborative writing and the peer review process. Several collaborative applications already in use in the CSCW research community were presented, discussed, and debated, with special consideration given to how and whether the CSCW Program Committee's experimental use of Lotus Notes should be extended in the future.
An approach to guaranteeing generalisation in neural networks
Authors: J. Gary Polhill, Michael K. Weir
Venue: Neural Networks (2001)

A novel approach to generalisation is presented that is able, under certain circumstances, to guarantee the generalisation to binary-output data for which no targets have been given. The basis of the guarantee is the recognition of a persistent global minimum error solution. An empirical test for whether the guarantee holds is provided which uses a technique called target reversal. The technique employs two neural networks whose convergence using opposing targets signals validity of the guarantee.
Matching of 3D Polygonal Arcs
Authors: Douglas R. Heisterkamp, Prabir Bhattacharya
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We define a distance measure between 3D polygonal arcs of equal length, and show that the minimum value of this distance measure is the smallest eigenvalue of a certain matrix. Using this, we develop a mismatch measure and a matching algorithm for 3D polygonal arcs of unequal lengths.
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs
Authors: Ding-Zhu Du, Y. -D. Lyuu, D. F. Hsu
Venue: IEEE Transactions on Computers (1993)

A graph has spread (m, k, l) if for any m+1 distinct nodes x, y/sub 1/, . . ., y/sub m/ and m positive integers r/sub 1/, . . ., r/sub m/, such that Sigma /sub i/r/sub i/=k, there exist k node-disjoint paths of length at most 1 from x to the y/sub i/, where r/sub i/ of them end at y/sub i/. This concept contains, and is related to many important concepts used in communications and graph theory. The authors prove an optimal general theorem about the spreads of digraphs generated by line digraph iterations. Useful graphs, like the de Bruijn and Kautz digraphs, can be thus generated. The theorem is applied to the de Bruijn and Kautz digraphs to derive optimal bounds on their spreads, which implies previous results and resolves open questions on their connectivity, diameter, k-diameter, vulnerability, and some other measures related to length-bound disjoint paths.
Knowledge Intensive Software Engineering Tools
Authors: C. Rich, R. C. Waters
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Most software engineering tools use a shallow representation of software objects and manipulate this representation using procedural methods. This approach allows one to get off to a fast start and quickly provides a tool that delivers benefits. However, a point will be reached where more knowledge-intensive approaches will be needed to achieve significantly higher levels of capability. The authors suggest that the software engineering tools of the future will have to rely on: deep representation to capture a sufficiently large part of knowledge about programming in general and particular programs; inspection methods to deal with complexity; and intelligent assistance.
Reconstruction of 3-D Binary Tree-Like Structures From Three Mutually Orthogonal Projections
Authors: Y. Sun, I. Liu, J. K. Grady
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A method is developed to generate the 3D binary representation for a tree-like object from three mutually orthogonal projections. This is done by first backprojecting the binarized images from three directions and then iteratively removing artifacts in the backprojection. Three different algorithms have been developed: the Lagrange multiplier algorithm, the conjugate gradient algorithm, and the minimum-voxel representation algorithm (MRA). The performance of these algorithms under noise-free conditions is evaluated using mathematically projected images of a 3D tree structure. While all three algorithms are capable of producing a relatively accurate reconstruction, the MRA is superior not only because it requires the least amount of computation but also because it uses binary instead of gray-scale information in the input images. Reconstruction of 3D coronary arterial structures using MRA is further verified with X-ray images of a human chest phantom and shows a satisfactory performance. The result of this study should be valuable for 3D imaging of blood vessels.
Modeling and Analysis of a Time-Stamp History Based Certification Protocol for Concurrency Control
Authors: P. S. Yu, H. -U. Heiss, D. M. Dias
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

An examination is made of a technique to derive the time-stamp or interval of time-stamps dynamically by using limited time-stamp history information to re-order transaction at commit time and to derive a back-shifted time-stamp for certification to reduce read-write conflicts. An analytic model to quantify the performance improvement by comparison with the basic time-stamp certification scheme is developed. Since the committed conflicting transaction may itself be back-shifted, the analytic model needs to estimate the distribution of the back-shift of the certification time-stamp in order to determine the probability of successfully back-shifting a transaction requesting commit. It is shown how this relatively complex protocol can be analyzed using a few simple approximations, validate the analysis through simulations, and the range of parameter values for which this approach is most beneficial is determined.
Additive Composition of Supervised Self-Organizing Maps
Authors: Jean-Luc Buessler, Jean-Philippe Urban, Julien Gresser
Venue: Neural Processing Letters (2002)

The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split the processing into tasks of small dimensionality. The sub-tasks can be implemented with neural networks, although the learning examples cannot be used anymore to supervise directly each of the networks. This article addresses the problem of learning in a modular context, developing in particular additive compositions. A simple rule allows defining efficient training, and combining, for example, several Supervised-SOM networks. This technique is important because it introduces interesting generalizations in many modular compositions, permitting data fusion or sequential combinations of neural networks.
An incremental approach for large displacement response of structures subjected to dynamic loads
Authors: V. Ramamurti, S. Rajarajan, G. Venkateswara Rao
Venue: Finite Elements in Analysis and Design (2002)

Finite element method using three-noded plate and shell element and 3D beam element in conjunction with mode superposition method is employed for studying the large dynamic displacement response of a typical payload fairing due to a typical separation impulse. Incremental technique is used for solving the geometric non-linear problem. Linear formulations are assumed and a step-by-step analysis is performed on the deformed state of each previous time step. The geometry is updated and the stiffness matrix recomputed after every finite time step and the eigenvalue analysis repeated. The formulations are validated using NASTRAN and NISA finite element packages. The results are compared with the linear analysis and the significance of the geometric non-linearity is stressed.
Status Report on Software Measurement
Authors: Shari Lawrence Pfleeger, Ross Jeffery, Bill Curtis, Barbara Kitchenham
Venue: IEEE Software (1997)

The most successful measurement programs are ones in which researchers, practitioner, and customer work hand in hand to meet goals and solve problems. But such collaboration is rare. The authors explore the gaps between these groups and point toward ways to bridge them.
First- and Second-Order Integral Functionals of the Calculus of Variations which Exhibit the Lavrentiev Phenomenon
Authors: A. V. Sarychev
Venue: Journal of Dynamical and Control Systems (1997)

We study the possible mechanisms of occurrence of the Lavrentiev phenomenon for the basic problem of the calculus of variations {\cal J}(x)= \int\limits^1_0 L(t,x(t),\dot{x}(t))dt \rightarrow \inf, \quad x(0)=x_0, \quad x(1)=x_1, when the infimum of the problem in the class of absolutely continuous functions W1,1&lsqb;0, 1&rsqb; is strictly less than the infimum of the same problem in the class of Lipshitzian functions W1,&infin;&lsqb;0,1&rsqb;. We suggest an approach to constructing new classes of integrands which exhibit the Lavrentiev phenomenon (Theorem 2.1).A similar method is used to construct (Theorem 3.1) a class of autonomous C1-differentiable integrands L(x,\dot{x}, \ddot{x}) of the calculus of variations which are regular, i.e., convex, coercive w.r.t. \ddot{x}, and exhibit the W2,1 &ndash; W2,&infin; Lavrentiev gap, i.e., for some choice of boundary conditions of the variational problem {\cal J}(x(\cdot))=\int\limits^1_0L(x(t),\dot{x}(t),\ddot {x}(t))dt \rightarrow \inf, x(0)=x_0, \quad \dot {x}(0)=v_0,\quad x(1)=x_1, \quad \dot {x}(1)=v_1, the infimum of this problem over the space W2,1&lsqb;0, 1&rsqb; is strictly less than its infimum over the space W2,&infin;&lsqb;0, 1&rsqb;. This provides a negative answer to the question of whether functionals with regular autonomous second-order integrands should only have minimizers with essentially bounded second derivative.
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens
Authors: Bernard A. Nadel
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

Representation selection for a constraint satisfaction problem (CSP) is addressed. The CSP problem class is introduced and the classic n-queens problem is used to show that many different CSP representations may exist for a given real-world problem. The complexities of solving these alternative representations are compared empirically and theoretically. The good agreement found is due to two key features of the analytic results, their generality and their precision (or instance specificity), which are also discussed. The n-queens problem is used only to provide a convenient case study; the approach to CSP representation selection applies to arbitrary problems that can be formulated in terms of CSP and, when the corresponding mathematical results are available, should also be readily applicable when selecting representations in domains other than CSP.
A Self-Repairing Execution Unit for Microprogrammed Processors
Authors: Alfredo Benso, Silvia Chiusano, Paolo Prinetto
Venue: IEEE Micro (2001)

This processor dynamically reconfigures its internal microcode to execute each instruction using only fault-free blocks from the execution unit. Working without redundant or spare computational blocks, this self-repair approach permits a graceful performance degradation.
The Science of Making ERORS: What Error Tolerance Implies for Capacity in Neural Networks
Authors: S. S. Venkatesh
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Discusses the development of formal protocols for handling error tolerance which allow a precise determination of the computational gains that may be expected. The error protocols are illustrated in the framework of a densely interconnected neural network architecture (with associative memory the putative application), and rigorous calculations of capacity ar shown. Explicit capacities are also derived for the case of feedforward neural network configurations.
Agents of Change: Educating Software Engineering Leaders
Authors: David Garlan, David P. Gluch, James E. Tomayko
Venue: Computer (1997)

For the past nine years, Carnegie Mellon has been developing and refining a master of software engineering (MSE) curriculum. In the process, the university has had to determine how the curriculum would differ from traditional ones, what kinds of hands-on experience would be offered, and how much specialization to require. The result is a novel approach that aims to cultivate future leaders in software engineering. CMU's program combines a long-term, mentored software development project with an unusual core curriculum that stresses broad-based models and problem-solving skills. CMU's experience is that its graduates return to work with technical knowledge, well-developed skills, and a breadth of experience that prepares them to be agents of change in the industry.
On the Lower Bound to the VLSI Complexity of Number Conversion from Weighted to Residue Representation
Authors: G. Alia, E. Martinelli
Venue: IEEE Transactions on Computers (1993)

A lower bound AT/sup 2/= Omega (n/sup 2/) for the conversion from positional to residue representation is derived according to VLSI complexity theory, and existing solutions for the same problem are briefly reviewed in the light of such a bound. A VLSI system is proposed, one that operates according to a pipeline scheme and works asymptotically emulating an optimal structure, independently of residue number system parameters. This solution has been applied to a design of specific size (64-b input stream), and it has been found that a single CMOS custom chip can implement the design with a throughput of one residue representation every 30-40 ns.
A super-scheduler for embedded reconfigurable systems
Authors: S. Ogrenci Memik, E. Bozorgzadeh, R. Kastner, M. Sarrafzadeh
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Emerging reconfigurable systems attain high peformance with embedded optimized cores. For mapping designs on such special architectures, synthesis tools, that are aware of the special capabilities of the underlying architecture are necessary. In this paper we are proposing an algorithm to perform simultaneous scheduling and binding, targeting embedded reconfigurable systems. Our algorithm differs from traditional scheduling methods in its capability of efficiently utilizing embedded blocks within the reconfigurable system. Our algorithm can be used to implement several other scheduling techniques, such as ASAP, ALAP, and list scheduling. Hence we refer to it as a super-scheduler. Our algorithm is a path-based scheduling algorithm. At each step, an individual path from the input DFG is scheduled. Our experiments with several DFG's extracted from MediaBench suit indicate promising results. Our scheduler presents capability to perform the trade-off between maximally utilizing the high-performance embedded blocks and exploiting parallelism in the schedule.
Path Dictionary: A New Access Method for Query Processing in Object-Oriented Databases
Authors: Wang-Chien Lee, Dik Lun Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and associative search, respectively, with a path dictionary and a set of attribute indexes built on top of the path dictionary. We discuss issues on indexing and query processing in object-oriented databases; describe the operations of the new mechanism; develop cost models for its storage overhead and query and update costs; and compare the new mechanism to the path index method. The result shows that the path dictionary index method is significantly better than the path index method over a wide range of parameters in terms of retrieval and update costs and that the storage overhead grows slowly with the number of indexed attributes.