ppxscal/embedding_network huggingface dataset:
On Selecting Software Visualization Tools for Program Understanding in an Industrial Context
Authors: Scott Tilley, Shihong Huang
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

This paper discusses issues related to selecting software visualization tools for program understanding in an industrial context. Visualization tools are often advocated as an effective means of aiding program understanding by creating graphical representations of the subject system through reverse engineering. However, there are numerous practical considerations related to tool selection for large, real-world projects that are regularly unaddressed. For example, the choices are often limited to commercial tools that are widely available, that have a low cost of deployment and training, and that easily integrate into existing software engineering processes. To illustrate some of these unique issues, two types of constraints imposed on the process of software visualization tool selection to support program understanding in the domain of embedded, real-time control systems are described.
IP routing on logical address group
Authors: Chan Park, Jong Hyup Lee, Jin Oh Kim, Hyup Jong Kim
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

In principle, more than one routers are intervened between different IP subnets. IETF RFC1577 "Classical IP and ARP over ATM", which is specified to provide IP services on an ATM network, also requires that the router be used between different logical IP subnet (LISs). However, the intervention of the router is not always an effective solution on an ATM network. If there is a direct virtual channel connection between two endpoints on the ATM network, they can exchange their information directly without the help of routers. Actually, some groups of the IETF and ATM Forum are working on such tasks. As a result, the Next Hop Resolution Protocol (NHRP) or MultiProtocol Over ATM (MPOA) is being drafted. However, since those protocols are too heavy and complicated, they are not easy to implement. We propose a simple efficient solution for inter-LIS communication-LIS Information Protocol. Our solution is exactly compatible with RFC1577. We describe how RFC1577 can be used to provide inter-LIS communications and introduce our prototype systems and test-bed network.
Decomposing Properties into Safety and Liveness
Authors: Fred B. Schneider
Venue:  (1987)

A new proof is given that every property can be expressed as a conjunction of safety and liveness properties. The proof is in terms of first-order predicate logic.
A System Level Approach in Designing Dual-Duplex Fault Tolerant Embedded Systems
Authors: C. Bolchini, L. Pomante, F. Salice, D. Sciuto
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper presents an approach for designing embedded systems able to tolerate hardware faults, defined as an evolution of our previous work proposing an hardware/software co-design framework for realizing reliable embedded systems. The framework is extended tosupport the designer in achieving embedded systems with fault tolerant properties minimizing overheads and limiting power consumption. A reference system architecture is proposed; the specific hardware/software implementation and reliability methodologies (to achieve the fault tolerance properties) are the result of an enhanced hw/sw partitioning process driven by the designer' constraints and by the reliability constraints, set at the beginning of the designprocess. By introducing also the reliability constraints during specification, the final system can benefit from the introduced redundancy also for performance gains, while limiting area, time, performance and power consumption overheads.
System-Level Synthesis of Application Specific Systems using A* Search and Generalized Force-Directed Heuristics
Authors: Chunho Lee, Miodrag Potkonjak, Wayne Wolf
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

This paper presents a system-level approach to the synthesis of multi-task, hard real-time applications. The goal is to select a set of off-the-shelf processors with minimal cost while satisfying timing constraints. Our approach has three design phases: resource allocation, assignment, and scheduling. With the observation that the resource allocation is a search for a set of processors which requires the minimum cost, we adopted A* search based technique. For assignment we use a variation of the force-directed technique. Final task scheduling is based on the Earliest Deadline First (EDF) algorithm. Experimental results show that this approach is highly effective on a variety of examples.
Adaptive policy gradient in multiagent learning
Authors: Bikramjit Banerjee, Jing Peng
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Inspired by the recent results in policy gradient learning in a general-sum game scenario, in the form of two algorithms, IGA and WoLF-IGA, we explore an alternative version of WoLF. We show that our new WoLF criterion (PDWoLF) is also accurate in 2 × 2 games, while being accurately computable even in more than 2-action games, unlike WoLF that relies on estimation. In particular, we show that this difference in accuracy in more than 2-action games translates to faster convergence (to Nash equilibrium policies in self-play) for PDWoLF in conjunction with the general Policy Hill Climbing algorithm. Interestingly, this expedience gets more pronounced with increasing learning rate ratio, for which we also delve into an explanation. We also show experimentally that learning faster with PDWoLF could also entail learning better policies earlier in self play. Finally we present the scalable version of PDWoLF and show that even in such domains requiring generalizations and approximations, PDWoLF could dominate WoLF in performance.
CBC MAC for Real-Time Data Sources
Authors: Erez Petrank, Charles Rackoff
Venue:  (1997)

The Cipher Block Chaining (CBC) Message Authentication Code (MAC) is an authentication method which is widely used in practice. It is well known that the naive use of CBC MAC for variable length messages is not secure, and a few thumb rules for the correct use of CBC MAC are known by ``folklore''''. The first rigorous proof of the security of CBC MAC, when used on fixed length messages, was given only recently by Bellare, Kilian and Rogaway \cite{bkr}. They also suggested variants of CBC MAC that handle variable length messages but in these variants the length of the message has to be known in advance (i.e., before the message is processed). \par We study CBC authentication of real time applications in which the length of the message is not known until the message ends, and furthermore, since the application is real-time, it is not possible to start processing the authentication only after the message ends. Providing authentication for real time communication is an important task, which involves authenticating real time speech transmissions, real time camera source of video transmission, and other human-driven multi media interaction. This also involves fax transmissions, in which the number of pages is not known in advance, and we would like to send the authentication as soon as the last page has been fed into the machine. \par We first present a variant of CBC MAC, called {\em double MAC} (DMAC) which handles messages of variable unknown lengths. Computing DMAC on a message is virtually as simple and as efficient as computing the standard CBC MAC on the message. We provide a rigorous proof that its security is implied by the security of the underlying block cipher. Next, we argue that the basic CBC MAC is secure when applied to prefix free message space. A message space can be made prefix free by authenticating also the (usually hidden) last character which marks the end of the message.
Statistical Characterization of Wide-Area IP Traffic
Authors: Matthew T. Lucas, Dallas E. Wrege, Bert J. Dempsey, Alfred C. Weaver
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Background traffic models are fundamental to packet-level network simulation since the background traffic impacts packet drop rates, queuing delays, end-to-end delay variation, and also determines available network bandwidth. In this paper, we present a statistical characterization of wide-area IP traffic based on 90-minute traces taken from a week-long trace of packets exchanged between a large campus network, a state-wide educational network, and a large Internet service provider. The results of this analysis can be used to provide a basis for modeling background load in simulations of wide-area packet-switched networks such as the Internet, contribute to understanding the fractal behavior of wide-area network utilization, and provide a benchmark to evaluate the accuracy of existing traffic models. The key findings of our study include the following: (1) both the aggregate packet stream and its component substreams exhibit significant long-range dependencies in agreement with other recent traffic studies, (2) the empirical probability distributions of packet arrivals are log-normally distributed, (3) packet sizes exhibit only short-term correlations, and (4) the packet size distribution and correlation structure are independent from both network utilization and time of day.
Finite element method contact simulations of CMC brake disk systems for high speed rail vehicles
Authors: R. Dotoli, O. Manni, L. Barone
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

While CMCs have some attractive properties for engineering industries i.e. high thermo-mechanical properties, good friction coefficient, stability at high service temperatures, the used fabrication techniques, such as chemical vapour infiltration (CVI) suffer from disadvantages such as long manufacturing times and excessive machining requirements, which results in large costs.In TRASMAT project funded by Italian Ministry of Scientific and Technological Research [1], an innovative hybrid method for the manufacturing of long-fiber CMC brake disk was settled, evaluating the advantages in terms of costs, thermo-mechanical performances, etc..In this paper, a numerical model for the mechanical analysis of this innovative CMC disk brake is proposed.In particular, three disk working conditions are simulated and analysed, evidencing the high capability of the model to predict the mechanical performance of the disk taking into account the complex contact interaction with the pads.
An Efficient ILP-Based Scheduling Algorithm for Control-Dominated VHDL Descriptions
Authors: Authors: Michael Muench, Manfred Glesner, Norbert Wehn
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

In this paper, we present for the first time a mathematical framework for solving a special instance of the scheduling problem in control-flow dominated behavioral VHDL descriptions given that the timing of I/O signals has been completely or partially specified. It is based on a code-transformational approach which fully preserves the VHDL semantics. The scheduling problem is mapped onto an integer linear program (ILP) which can be constrained to be solvable in polynomial time, but still permits optimizing the statement sequence across basic block boundaries.
Future Directions for Autonomous Decentralized Systems (Opening Statement of the Panel)
Authors: H. Kopetz
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

To me, the future for autonomous decentralized systems (ADS) looks bright, because of ongoing developments in the following four areas (i) system complexity (ii) hardware architecture (iii) legacy systems (iv) fault-tolerance. Let me discuss some of the issues in each one of these areas in detail. 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
RMESH Algorithms for Parallel String Matching
Authors: Hsi-Chieh Lee, Fikret Ercal
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines, and spelling correction. Especially with the introduction of search engines dealing with tremendous amount of textual information presented on the world wide web and the research on DNA sequencing, this problem deserves special attention and any algorithmic or hardware improvements to speed up the process will benefit these important applications. In this paper, we present three algorithms for string matching on reconfigurable mesh architectures. Given a text T of length n and a pattern P of length m, the first algorithm finds the exact matching between T and P in O(1) time on a 2-dimensional RMESH of size (n-m+1) \times m. The second algorithm finds the approximate matching between T and P in O(k) time on a 2D RMESH, where k is the maximum edit distance between T and P. The third algorithm allows only the replacement operation in the calculation of the edit distance and finds an approximate matching between T and P in constant-time on a 3D RMESH.
A Formal Basis for Consistency, Evolution and Rationale Management in Requirements Engineering
Authors: Aditya K. Ghose
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper presents a formal framework that addresses the twin problems of inconsistencies in requirements specifications and requirements evolution. We present techniques (building on results from the areas of default reasoning and belief revision) for identifying maximal consistent subsets of a specification rendered inconsistent by a change step, with provision for retaining requirements that would be otherwise discarded, in anticipation of their future reuse. We identify the need for consistent application of requirements rationale and provide support for this in our framework. We observe that while the problem of requirements evolution is intractable in the general case, tractable special cases exist within our framework. We also provide pointers to designing tools based on this framework.
Analysis and Design of ESD Protection Circuits for High-Frequency/RF Applications
Authors: Choshu Ito
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Electrostatic discharge (ESD) protection devices can have an adverse effect on the performance of high frequency and RF circuits. This work presents for the first time, an s-parameter based analysis of the performance of RF circuits with various ESD protection designs. Additionally, a design methodology for distributed ESD protection using coplanar waveguides is developed to achieve a better impedance match over a broad frequency range. By using this technique, an ESD device with a parasitic capacitance of 200 fF will attenuate the signal power by only 0.27 dB at 10 GHz. 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
Towards a pareto-optimal solution in general-sum games
Authors: Sandip Sen, Stephane Airiau, Rajatish Mukherjee
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Multiagent learning literature has investigated iterated two-player games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such equilibrium configuration implies that there is no motivation for one player to change its strategy if the other does not. Often, in general sum games, a higher payoff can be obtained by both players if one chooses not to respond optimally to the other player. By developing mutual trust, agents can avoid iterated best responses that will lead to a lesser payoff Nash Equilibrium. In this paper we work with agents who select actions based on expected utility calculations that incorporates the observed frequencies of the actions of the opponent(s). We augment this stochastically-greedy agents with an interesting action revelation strategy that involves strategic revealing of one's action to avoid worst-case, pessimistic moves. We argue that in certain situations, such apparently risky revealing can indeed produce better payoff than a non-revealing approach. In particular, it is possible to obtain Pareto-optimal solutions that dominate Nash Equilibrium. We present results over a large number of randomly generated payoff matrices of varying sizes and compare the payoffs of strategically revealing learners to payoffs at Nash equilibrium.
A local discontinuous Galerkin method for KdV-type equations
Authors: Shu Jue Yan and Chi-Wang
Venue:  (2001)

In this paper we develop a local discontinuous Galerkin method for solving KdV type equations containing third derivative terms in one and two space dimensions. The method is based on the framework of the discontinuous Galerkin method for conservation laws and the local discontinuous Galerkin method for viscous equations containing second derivatives, however the guiding principle for inter-cell fluxes and nonlinear stability is new. We prove L2 stability and a cell entropy inequality for the square entropy for a class of nonlinear PDEs of this type both in one and multiple spatial dimensions, and give an error estimate for the linear cases in the one dimensional case. The stability result holds in the limit case when the coefficients to the third derivative terms vanish, hence the method is especially suitable for problems which are ``convection dominate'''', i.e. those with small second and third derivative terms. Numerical examples are shown to illustrate the capability of this method. The method has the usual advantage of local discontinuous Galerkin methods, namely it is extremely local and hence efficient for parallel implementations and easy for h-p adaptivity. 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
On the Performance of the HONG Network for Pattern Classification
Authors: Ajantha S. Atukorale, Tom Downs, P. N. Suganthan
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In this paper, a new neural network model called the hierarchical overlapped neural gas (HONG) network is introduced and its performance on several datasets is described. In order to obtain improved classification accuracy, the HONG network partitions the input space by projecting the input data onto several different second layer neural gas networks. This duplication enables the HONG network to generate multiple classifications for every sample presented in the form of confidence values, and these confidence values are combined to obtain the final classification. Excellent recognition rates for several benchmark datasets are presented.
Analysis of Per-Flow and Aggregate QoS in Scalable QoS Networks
Authors: Eryk Dutkiewicz, Paul Boustead
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

The future Internet will support a large variety of services whose QoS requirements may vary widely. In order to provide scalable quality of service traffic aggregation may be necessary. We examine several approaches to providing scalable QoS services which includes soft QoS with relative performance guarantees, and hard performance guarantees signaled by RSVP over an aggregated cell switched core. In these approaches QoS is based on aggregate traffic. The question then arises as to what level of QoS is perceived by individual flows within the aggregate. This has an important implication on QoS guarantees which the network can make to individual users.To provide answers to the above question we analyze per-flow and aggregate QoS in an ATM Virtual Path (VP) which is used as an example of a cut-through handling IP flows. Using cell loss as a measure of QoS, our analysis allows us to investigate the impact of the parameters of individual flows on per-flow QoS. We then compare per-flow QoS against the QoS experienced by the aggregate flow in the VP. Based on numerical tests we find that cell loss experienced by individual flows may be very different from cell loss experienced by the aggregate flow. Thus if aggregate cell loss is used as a QoS constraint in dimensioning of VPs this may lead to unfair treatment of flows and hence to potential user dissatisfaction
Improving the Visibility of Graphical Program Displays: An Experimental Study
Authors: Panagiotis K. Linos, Esther T. Ososanya, Vijay Karunakaran
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

This paper describes an experimental study, which compares the performance of various layout heuristics used to increase the visibility of graphical representations of computer programs. In particular, a special layout graph is considered which is known as m-column graph, and it is used to display data flow program dependencies. In this work, we show experimentally that an incremental layout heuristic approach outperforms the traditional layout techniques such as pair exchanging or greedy insertion of graph vertices. Finally, we conclude by presenting our recommendations with respect to the application of such layout heuristics especially on interactive software systems.
Method Schemas
Authors: Serge Abiteboul, Paris Kanellakis, Sridhar Ramaswamy, Emmanuel Waller
Venue:  (1992)

A method schema is a simple programming formalism for object-oriented databases with features such as classes, methods, inheritance, name overloading, and late binding. An important problem is to check whether a given method schema can lead to an inconsistency in some interpretation. This consistency question is shown to be undecidable in general. Decidability is obtained for monadic and/or recursion-free method schemas. In particular, consistency of monadic method schemas is shown to be decidable in $O(nc^3)$ time, where $n$ is the size of the method definitions and $c$ is the size of the class hierarchy; also, it is logspace-complete in PTIME, even for monadic, recursion-free schemas. Method signature covariance is shown to simplify the computational complexity of key decidable cases. For example: one coded method in the context of base methods with covariant signatures can be tested for consistency in $O(n+c)$ time for the monadic case (without covariance this problem is in $O(nc^2)$ time) and in PTIME for the fixed arity polyadic case (without covariance this problem is NP-complete). Incremental consistency checking of method schemas is a formalization of the database schema evolution problem, for which a sound, but necessarily incomplete, heuristic is proposed.