ppxscal/embedding_network huggingface dataset:
A Data-Driven Implement at Ion of Telecommunication Network Systems
Authors: Hiroaki Nishikawa, Souichi Miyata, Shinichi Yoshida, Tsuyoshi Muramatsu, Hiroshi Ishii, Hidetsugu Kobayashi, Yuji Inoue
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

What should future information environment be like? At present, it is not so easy to answer the question but an inevitable issue. Undoubtedly, Users' requirements and engineering constraints will give a great influence onto the future information environment.Abstract: The authors therefore have started a project named CUE (Coordinating Users' requirements and Engi- neering constraints). The CUE project look up ef- jicient ultra-multi-processing capability with overload -tolerance and maintenabili~y/expandability incorporal- ing run-time reconfiguration as essential requirements lo realize distributed networking systems such as TINA(Telecommunications Information Networking Ar- chitecture) which is being studied aiming at interoperabil- ity, reusability and transparency of applicalion software essentially demanded by users of future infrastructure.To satisfy these requirements from engineering view- points, the CUE project proposes applying to the nek work systems an autonomous decentralized data-driven processor which has been studied by some of the authors through various VLSI realizations. The data-driven pro- cessors adopt autonomous execution control scheme in which packetized data passing through the elastic pipeline including flow-branching/merging mechanisms achieves all data transferring, processing and storing/buffering functions in a completely decentralized manner. The pro- cessor can therefore perform high flow-rate multi-media streams with considerable flow-fluctuations and act as a functional module flexibly adding/removing to/from sys- tem at run-time without any overheads.In this paper, essential requirements to realize the dis- tributed networking environment such as TINA are first discussed. The applicability of our data-driven proces- sor is shown through actual performance evaluations by the latest VLSI systems. Autonomous run-time reconjig- uration scheme in a multi-processor system is also pro- posed to demonstrate potential of the data-driven proces- sor which will be introduced to our data-driven processor currently being designed. Finally, the current status and futvre directions of the CUE project are briefly addressed.
On Detection and Generation of Dead-lock free Reshuffling in the VLSI Synthesis Method
Authors: Jiazhao J Xu
Venue:  (1996)

No Abstract. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Cooperative Simulation Mechanism of Distributed Control Systems Based on Object-Oriented Design Patterns
Authors: Toyoaki Tomura, Satoshi Kanai, Takeshi Kishinami
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Distributed control systems (DCSs) consisting of a plant, a controller composed of many devices, and an open network interconnecting devices, are now used in many automation areas. For assuring the control performance under the heavy traffic on the network, the simulation of DCS is strongly needed. In the case of DCSs for controlling a mechanical plant, the graphical and cooperative simulation between the controller model and the plant model becomes important to verify the sequence of motions of the plant. For this purpose, we propose a systematic object-oriented-based DCS modeling procedure to efficiently and uniformly develop the DCS simulation model. From this procedure, we can describe the formaldescription of DCS simulation model based on five object-oriented design patterns which describe the structure and behavior of the DCS. We also propose an event chain mechanism between the statechart-based controller model and the graphical plant model. Finally, the cooperative DCS simulation software is developed by using the Java 3D API.
Learning the Gestalt rule of collinearity from object motion
Authors: Carsten Prodöhl, Rolf P. Würtz, Christoph von der Malsburg
Venue: Neural Computation (2003)

The Gestalt principle of collinearity (and curvilinearity) is widely regarded as being mediated by the long-range connection structure in primary visual cortex. We review the neurophysiological and psychophysical literature to argue that these connections are developed from visual experience after birth, relying on coherent object motion. We then present a neural network model that learns these connections in an unsupervised Hebbian fashion with input from real camera sequences. The model uses spatiotemporal retinal filtering, which is very sensitive to changes in the visual input. We show that it is crucial for successful learning to use the correlation of the transient responses instead of the sustained ones. As a consequence, learning works best with video sequences of moving objects. The model addresses a special case of the fundamental question of what represents the necessary a priori knowledge the brain is equipped with at birth so that the self-organized process of structuring by experience can be successful.
A Distributed Multifrontal Algorithm Using Clique Trees
Authors: Alex Pothen, Chunguang Sun
Venue:  (1991)

We describe a parallel multifrontal sparse Cholesky factorization algorithm for distributed-memory multiprocessors that makes use of the clique tree to organize the factorization. A new task-toprocessor mapping algorithm applicable to general sparse problems is problems is described, and its performance is compared with the only general mapping algorithm that has been proposed previously. In our experiments on a collection of problems from the Boeing-Harwell test set, we obtain efficiencies comparable to those obtained for the model grid problem. We obtain a characterization of the clique tree of the grid problem, and thereby compute the maximum and minimum arithmetic and communication that a processor is responsible for. The arithmetic and communication requirements of the distributed multifrontal algorithm are shown to be balanced and asymptotically optimal for the model problem.
ATM switching based on deflection routing
Authors: A. Pattavina
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

ATM switch architectures based on deflection routing are examined and compared with regards to their internal operations. Their common feature is the availability of multiple I/O paths through a multistage unbuffered interconnection network where conflicts for the same internal link are dealt with, stage by stage, by deflecting the packets onto the wrong path. The main engineering parameter of the architecture, that is the number of network stages that provides a given packet loss performance, is studied. In particular it is found that basically all the examined architectures have a complexity on the order of Nlog/sub 2/N in the range of switch sizes of usual interest. Furthermore it has been possible to rank the architectures with comparable complexity based on the loss performance they provide.
Increased Software Reliability Through Input Validation Analysis and Testing
Authors: Jane Huffman Hayes, A. Jefferson Offutt
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The Input Validation Testing (IVT) technique has been developed to address the problem of statically analyzing input command syntax as defined in English textual interface and requirements specifications and then generating test cases for input validation testing. The technique does not require design or code, so it can be applied early in the lifecycle. A proof-of-concept tool has been implemented and validation has been performed. Empirical validation on industrial software shows that the IVT method found more requirement specification defects than senior testers, generated test cases with higher syntactic coverage than senior testers, and found defects that were not found by the test cases of senior testers. Additionally, the tool performed at a much-reduced cost.
Effective Implementation of Software Performance Engineering
Authors: U C Smith
Venue:  (1984)

The software performance engineering (SPE) methodology and its relationship to popular software engineering techniques is presented. SPE is a set of procedures to support software system development. Through its use, predicted performance metrics are devised and used to evaluate the proposed system against specified performance goals prior to implementation. Quantitative information on the performance of implementation alternatives is easily obtained using the prescribed techniques. This is particularly important for large, complex systems where the interaction between components is not obvious or intuitive. Integral to the software performance engineering methodology is the construction and evaluation of performance models. The techniques for modeling software systems prior to implementation are reviewed. Next, the costs, benefits, and risks of applying SPE are discussed. The critical success factors in the effective implementation of SPE are presented. They include organizational issues, project management implications, and performance analyst responsibilities. Finally, future trends in VLSI and in software development environments are discussed along with their implications for software performance engineering.
Quality in Use: Incorporating Human Factors into the Software Engineering Lifecycle
Authors: N. Bevan, M. Azuma
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

The relationship between the different approaches to quality in ISO standards is reviewed, contrasting the manufacturing approach to quality in ISO 9000 (quality is conformance to requirements) with the product orientation of ISO 8402 (quality is the presence of specified features) and the goal orientation of quality in use in ISO/IEC 14598-1 (quality is meeting user needs). It is shown how ISO 9241-11 enables quality in use to be measured, and ISO 13407 defines the activities necessary in the development lifecycle for achieving quality in use.
A linear-programming approach to the generalized Randić index
Authors: Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann
Venue: Discrete Applied Mathematics (2003)

The generalized Randic´ index Rα(G) of a graph G is the sum of (dG(u)dG(v))α over all edges uv of G. Using a linear-programming approach, we establish results on graphs with a given number of vertices and edges and a bounded maximum degree that are of minimum generalized Randic´ index for α ∈ {- ½, - 1}.
A Rigorous Approach to Modeling Autonomous Traffic Control Systems
Authors: V. S. Alagar, D. Muthiayen
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The paper describes an abstract object model for autonomous traffic control systems and proposes a verification approach based on its formal description. Traffic control systems are safety-critical real-time reactive systems, whose correct behavior must be verified before deploying them. Formalism integrated with visual descriptions provide a good approach to meeting the above requirement.
Geometric Optimization and Computational Complexity
Authors: Chanderjit Bajaj
Venue:  (1984)

Our purpose here is to study problems involving geometric optimization, namely, questions of the type: Is there at least a minimum or at most a maximum number of certain geometric figures, that are within certain distances of other figures (objects). We are also concerned with the optimization of the size of these geometric figures. These problems arise as geometric reductions from various classes of location-allocation optimization problems and are inherently not pure combinatorial. Our primary aim, then, is to discover techniques of dealing with such geometric optimization problems, while adapting to these problems the older combinatorial design and analysis methods. The task of classifying problems accurately in the polynomial hierarchy is one of increasing importance. To solve an optimization problem deterministically it seems that one must solve both an $NP$ and a $Co-NP$ problem. The significance of the classes $NP$ and $Co-NP$ are that none of the problems they include is known to have a polynomial time solution. We show that if $NP \neq Co-NP$ then there are interesting natural geometric optimization problems (location-allocation problems under minsum) in $\Delta^{P}_{2}$ that are in neither $NP$ nor $Co-NP$. Hence, all these problems are shown to belong properly to $\Delta^{P}_{2}$, the second level of the polynomial hierarchy. We also show that if $NP \neq Co-NP$ then there are again some interesting geometric optimization problems (location-allocation problems under minmaz) properly in $\Delta^{P}_{2}$ and furthermore they are complete for a class $D^{P}$ (which is contained in $\Delta^{P}_{2}$ and contains $NP \bigcup Co-NP$). Also considered are the above geometric location-allocation optimization problems for the case when the allocation is predetermined. Both efficient algorithms and worst-case lower bounds are derived. Necessary conditions for the existence of mazima and minima in optimization problems are generally tied to the question of solvability of an equation or a system of equations. In calculus these equations are algebraic. By generating the minimal polynomial whose root over the field of rational numbers is the solution of the geometric optimization problem on the real (Euclidean) plane, we are able to prove the non-solvability of certain geometric optimization problems by radicals. The algebraic degree of the optimizing solution, which is the degree of the irreducible minimal polynomial for the problem, correlates with the inherent difficulty of constructing the solution and provides an algebraic complexity measure for these geometric optimization problems.
Constrained Simulated Annealing with Applications in Nonlinear Continuous Constrained Global Optimization
Authors: Benjamin W. Wah, Tao Wang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper improves constrained simulated annealing (CSA), a discrete global minimization algorithm with asymptotic convergence to discrete constrained global minima with probability one. The algorithm is based on the necessary and sufficient conditions for discrete constrained local minima in the theory of discrete Lagrange multipliers. We extend CSA to solve nonlinear continuous constrained optimization problems whose variables take continuous values. We evaluate many heuristics, such as dynamic neighborhoods, gradual resolution of nonlinear equality constraints and reannealing, in order to greatly improve the efficiency of solving continuous problems. We report much better solutions than the best-known solutions in the literature on two sets of continuous optimization benchmarks.
Term rewriting restricted to ground terms
Authors: Sándor Vágvögyi
Venue: Theoretical Computer Science (2003)

We study rewriting of ground terms. For an arbitrary term rewrite system R over a ranked alphabet Σ, we restrict the rewriting relation →R to ground terms. We introduce the relation →R,g = →R ∩(TΣ × TΣ). We show that ↔R,g* = ↔R* ∩(TΣ × TΣ). We show that for a given term rewrite system R and a given ground term rewrite system S over a ranked alphabet Σ it is decidable if ↔R,g* ⊆ ↔S* We show that for a given left-linear right-ground term rewrite system R over a ranked alphabet ∑ it is decidable if there is a ground term rewrite system S over Σ such that →R,g* = →S*.
Lavrentiev Regularization + Ritz Approximation = Uniform Finite Element Error Estimates for Differential Equations with Rough Coefficients
Authors: Andrew Knyazev, Olof Widlund
Venue:  (1998)

We consider a parametric family of boundary value problems for the diffusion equation with the diffusion coefficient equal to a small constant in a subdomain. Such problems are not uniformly well-posed when the constant gets small. However, in a series of papers, Bakhvalov and Knyazev have suggested a natural splitting of the problem into two well-posed problems. Using this idea, we prove a uniform finite element error estimate for our model problem in the standard parameter-independent Sobolev norm. We consider a traditional finite element method with only one additional assumption, namely, that the boundary of the subdomain with the small coefficient does not cut any finite element. One interpretation of our main theorem is in terms of regularization. Our FEM problem can be viewed as resulting from a Lavrentiev regularization and a Ritz--Galerkin approximation of a symmetric ill-posed problem. Our error estimate can then be used to find an optimal regularization parameter together with the optimal dimension of the approximation subspace.
Objective-C Pocket Reference, 1 edition
Authors: Andrew Duncan
Venue:  (2002)

:Objective-C is an exciting and dynamic approach to C-based object-oriented programming. It's the approach adopted by Apple as the foundation for programming under Mac OS X, a Unix-based operating system gaining wide acceptance among programmers and other technologists. Objective-C is easy to learn and has a simple elegance that is a welcome breath of fresh air after the abstruse and confusing C++. In this pocket reference, Andrew M. Duncan provides a quick and concise introduction to Objective-C for the experienced programmer. In addition to covering the essentials of Objective-C syntax, Andrew also covers important facets of the language such as memory management, the Objective-C runtime, dynamic loading, distributed objects, and exception handling.
Helios: A Mathematical Modeling Language for Newton
Authors: Laurent Michel, Pascal Van Hentenryck
Venue:  (1995)

Numerous applications in science and engineering requires nonlinear constraint solving and optimization over real numbers. Helios is a mathematical modeling language designed to express these applications in a form close to traditional statements displayed in scientific papers and textbooks. Helios is compiled into Newton, a constraint logic programming language over nonlinear constraints which is one of the most efficient tools for the global solution of these problems. The paper illustrates the main functionalities of Helios, describes the compilation process, and reports experimental results on traditional benchmarks in this area. The results indicate that Helios should be a valuable addition to the set of tools available in this area.
The TANGO Algorithm Animation System
Authors: John Stasko
Venue:  (1988)

TANGO is an algorithm animation system designed to provide programmers with the capabilities to produce sophisticated, real-time animations of their programs with a minimum of graphics coding. The system is implemented using the conceptual framework for algorithm animation developed as part of the author''s Ph.D. research. The framework contains facilities for defining events to their corresponding animations. Animation design is based upon a ``path-transition'''' paradigm utilizing four animation data types: locations, images, paths, and transitions.
Design-By-Example: A Design Tool for Relational Databases
Authors: Dina Bitton, Heikki Mannila, Kari Raiha
Venue:  (1985)

In recent years, research in relational design theory and in query optimization has established a firm ground for designing well-structured logical and physical database schemes. However, the design process prequires mastering a considerable amount of theoretical results. Furthermore, even for the initiated database designer, many of the known algorithms for logical design do not provide constructive guidelines for generating a database scheme that would prevent update anomalies and data inconsistencies. Nor do the algorithms and evaluation methods for file structures and query processing provide constructive physical design rules. We propose an expert tool that would make knowledge in relational design theory and query optimization automatically and transparently available to the database designer. This tool is a system with an interactive, graphical interface that uses examples to guide the designer through several phases of logical and physical database design. Logical design is based on example relations, and physical design on example queries. The example relations are automatically generated by the system. They contain sample data and satisfy the data dependencies that the designer specifies with the assistance of the expert tool. The example queries and their expected frequency are specified by the designer, using graphically displayed skeleton queries. The system generates a physical design scheme that optimizes the mix of queries expected by the designer, and computes a performance forecast. Both example relations and example queries can be modified by the designer, until the expert tool generates a satisfactory design.
A Quasi-Newton $L_{2}$-Penalty Method for Minimization Subject to Nonlinear Equality Constraints
Authors: Thomas F. Coleman, Wei Yuan
Venue:  (1995)

We present a modified $L_{2}$ penalty function method for equality constrained optimization problems. The pivotal feature of our algorithm is that at every iterate we invoke a special change of variables to improve the ability of the algorithm to follow the constraint level sets. This change of variables gives rise to a suitable block diagonal approximation to the Hessian which is then used to construct a quasi-Newton method. We show that the complete algorithm is globally convergent with a local Q-superlinearly convergence rate. Preliminary computational results are given for a few problems.
A Comparison of Two Methods for Boolean Query Relevance Feedback
Authors: Gerard Salton, Edward A. Fox, Ellen M. Voorhees
Venue:  (1983)

The relevance feedback process uses information derived from an initially retrieved set of documents to improve subsequent search formulations and retrieval output. In a Boolean query environment this implies that new query terms must be identified and Boolean operators must be chosen automatically to connect the various query terms. In this study, two recently proposed automatic methods for relevance feedback of Boolean queries are evaluated and conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment.
An Engineering Design Process Supported by Knowledge Retrieval from a Spatial Database
Authors: Mark L. Manwaring, Terry G. Glagowski, Kent L. Jones
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

An algorithm is presented which has the purpose of allowing the search of a non-homogeneous database which contains engineering design information and other data relevant to the engineering design process. The purpose of this work is to develop a system which improves the design process by providing a quick access mechanism to heterogeneous, complex knowledge. The algorithm is based on a new type of fuzzy query (i.e. iterative, ranked retrieval) from an exclusive, partitional, spatial database. A prototype system which implements a small database and this retrieval from a PLOP hashing database is described, and an example is presented which demonstrates its application.
Composite planar coverings of graphs
Authors: Seiya Negami
Venue: Discrete Mathematics (2003)

We shall prove that a connected graph G is projective-planar if and only if it has a 2n-fold planar connected covering obtained as a composition of an n-fold covering and a double covering for some n ≥ 1 and show that every planar regular covering of a nonplanar graph is such a composite covering.