ppxscal/embedding_network huggingface dataset:
Performance Analysis of k-Ary n-Cubes with Fully Adaptive Routing
Authors: H. Sarbazi-Azad, L. M. Mackenzie, M. Ould-Khaoua
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Several analytical models of deterministic routing in wormhole-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhole-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.
Synchronisation Delay in Hardware Fault-Tolerance Techniques
Authors: Simonetta Balsamo, Ivan Mura
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

This work deals with analytical modeling of synchronization delay experienced in multiprocessing systems which execute redundant software to improve dependability figures. We propose a stochastic model based on a queuing network approach of system behavior. We derive a bounded approximation of the distribution function of synchronization delay by applying the matrix-geometric technique to analyze the model. An exact aggregation of the underlying Markov process is applied to cope with the exponential growth of the state space. Experimental results show that a very tight approximation can be achieved at a low computational time complexity.
DEPEND: a simulation environment for system dependability modeling and evaluation
Authors: G. Ries, Z. Kalbarczyk, T. Kraljevic, M.-C. Hsueh, R. K. Iyer
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

DEPEND is an evolving simulation-based environment for the evaluation of designs from functional and dependability viewpoints. DEPEND supports the VHDL hardware descriptive language as well as the C++ programming language. In addition, DEPEND provides a graphical modeling facility to allow interactive model construction. Designs under evaluation can be functional or structural descriptions of the designs. The Task and Environment Manager provides an easy-access window-based manual page and a tool-kit to allow users to create, modify, and simulate models without leaving the DEPEND environment. At the core of DEPEND are simulation engines supported by a fault injector, a set of fault dictionaries, and component libraries. The component libraries contain model building blocks with detailed functional descriptions and characteristics; the fault dictionaries embody possible fault effects of given fault types, devices, and circuits; and the fault injector provides mechanisms to inject faults.
A hybrid global optimization method: the multi-dimensional case
Authors: Peiliang Xu
Venue: Journal of Computational and Applied Mathematics (2003)

We extend the hybrid global optimization method proposed by Xu (J. Comput. Appl. Math. 147 (2002) 301-314) for the one-dimensional case to the multi-dimensional case. The method consists of two basic components: local optimizers and feasible point finders. Local optimizers guarantee efficiency and speed of producing a local optimal solution in the neighbourhood of a feasible point. Feasible point finders provide the theoretical guarantee for the new method to always produce the global optimal solution(s) correctly. If a nonlinear nonconvex inverse problem has multiple global optimal solutions, our algorithm is capable of finding all of them correctly. Three synthetic examples, which have failed simulated annealing and genetic algorithms, are used to demonstrate the proposed method.
SVG For Designers: Using Scalable Vector Graphics in Next-Generation Web Sites, 1 edition
Authors: Bill Trippe, Kate Binder
Venue:  (2002)

:Scalable Vector Graphics (SVG), the next groundbreaking graphics and animation tool for computer imaging -- allows designers to create fast-loading Web graphics that can be viewed equally well on a Web browser, a handheld computer, or a cell phone. SVG For Designers fully explains the technology, and offers a practical, easy-to-follow guide to its many uses for graphic designers. Learn why SVG-based graphics and Web pages can save time and money, improve quality, and revolutionize the way Web graphics convey information. Take advantage of SVG's open-standard platform and resolution-independent technology -- with minimal cost for new software or training, whether you're in publishing, graphic arts, Web design, or production.
PREMO: A case study in formal methods and multimedia system specification
Authors: David A. Duce, D. J. Duke, G. Faconti, Ivan Herman, M. Massink
Venue:  (1997)

SC24, the sub-committee of the International Organisation for Standardization responsible for the area of computer graphics and image processing, is in the process of completing work on a new standard for multimedia systems, called PREMO. For the first time in SC24, formal methods were employed during the development of the standard. The lessons learned from this exercise are interesting for two reasons. First, PREMO spans concerns ranging from the underlying object model through to issues related to media content. The broad scope of this work has presented challenges to the use of formal methods that have not been reported in other industrial applications. Second, the standards development process places restrictions on how formal methods can be applied. This paper describes the approaches that the PREMO specification group adopted to address the technical demands of the application area and, critically, where those approaches were found wanting. The lessons learned from the case study are discussed in the context of recent debates within the formal methods community on making formal methods relevant to software practitioners.
Communication protocol for group of distributed objects
Authors: T. Tachikawa, M. Takizawa
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In distributed applications, a group of multiple objects are cooperated. On receipt of request messages, the objects send back the responses. The kinds of group communication protocols discussed so far, support the reliable and ordered delivery of messages at the network level. Only messages to be ordered at the application level, not necessarily all messages, are required to be causally delivered in the required order. The state of the object depends on in what order the requests are computed and the responses and requests are transmitted. In this paper, we would like to define the significant precedence order of messages based on the conflicting relation among the requests. We would like to discuss a protocol which supports the significantly ordered delivery of request and response messages.
Process Modeling for Object Oriented Analysis Using BORM Object Behavioral Analysis
Authors: Roger P. Knott, V. Merunka, Jiri Polak
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

BORM Object Behavior Analysis (BOBA) is a first stage in a process of object modeling which has proved successful in a wide number of applications. This paper discusses this method and describes a simple application. One advantage of BOBA is the small number of concepts required combined with considerable expressiveness. In this way, BOBA is in the tradition established over the past few years by E-R modeling.
Decidability results for Watson--Crick D0L systems with nonregular triggers
Authors: Juha Honkala
Venue: Theoretical Computer Science (2003)

We show that sequence equivalence, language equivalence, growth equivalence and road equivalence are decidable for standard Watson-Crick D0L systems having bounded balance.
Verification and Validation in Industry " A Qualitative Survey on the State of Practice
Authors: Carina Andersson, Per Runeson
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Verification and validation activities take a substantial share of project budgets and need improvements. This is an accepted truth, but the current practices are seldom assessed and analyzed. In this paper, we present a qualitative survey of the verification and validation processes at 11 Swedish companies. The purpose was to exchange experience between the companies and to lay out a foundation for further research on the topic. The survey is conducted through workshop and interview sessions, loosely guided by a questionnaire scheme. It is concluded from the survey that there are substantial differences between small and large companies. In large companies, the documented process is emphasized while in small companies, single key persons have a dominating impact on the procedures. Large companies use commercial tools while small companies make in-house tools or use shareware. Common to all the surveyed companies is that verification and validation is considered important, and thus having rather high status. An experience from the survey as such, is that the information exchange between the companies during the survey was considered very valuable to the involved subjects.
The Visualization of Building Data in VR-DIS
Authors: H. J. P. Timmermans
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The VR-DIS system is a design application for the Building and Construction industry (VR-DIS stands for Virtual Reality - Design Information System). The user interface is characterised by a mixed representation of the task domain. A pictorial representation of the appearance of the building is combined with a visualisation of the formal description of the design. The latter visualisation is worked out as a highly interactive 3D graph in which relation types are mapped on distinct planar directions and the browsing history is visualised in the third dimension. We discuss the theoretical foundations of the interface as a whole and those of the developed 3D graph.
Protection at the micromachine level
Authors: Charlie McDowell
Venue: ACM SIGARCH Computer Architecture News (1982)

One possible reason that user writable control stores on microprogrammable computers are not used heavily, is the lack of a secure environment in which to run the WCS programs. This paper describes a simple method of adding hardware protection to the micromachine level of a computer.
FBSF: A New Fast Packet Switching Fabric based-on Multistage Interconnection Network with Multiple Outlets
Authors: ByoungSeob Park
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

In this paper, we propose a new ATM switch architecture with output queueing, the proposed switch, FBSF(FAB Banyan Switching Fabrics) can deliver up to 2r packets simultaneously destined for the same outlet in a single time slot. The switch fabrics consist of batcher sorter, a radix-r double shuffle network, r-packet distributors, two FAB networks, and output buffer modules. The performance of the switch fabric is evaluated by measures of throughput, average queue length, and average waiting time. Numerical results indicate that the switch exhibits very good delay-throughput performance over a wide range of input traffic.
A simplistic approach to keyhole plan recognition
Authors: Annika Waern, Ola Stenborg
Venue:  (1995)

When applying plan recognition to Human - Computer Interaction, one must cope with users exhibiting a large amount of reactive behaviour: users that change tasks, or change strategies for achieving tasks. Most current approaches to keyhole plan recognition do not address this problem. We describe an application domain for plan recognition, where users exhibit reactive rather than plan-based behaviour, and where existing approaches to plan recognition do not perform well. In order to enable plan recognition in this domain, we have developed an extremely simplistic mechanism for keyhole plan recognition, "intention guessing". The algorithm is based on descriptions of observable behaviour, and is able to recognize certain instances of plan failures, suboptimal plans and erroneous actions. At run-time, the algorithm only keeps track of a limited number of the most recent actions, which makes the algorithm "forgetful". This property makes the algorithm suitable for domains where users frequently change strategies.
A Generic Abstract Interpretation Algorithm and its Complexity Analysis (extended abstract)
Authors: Baudouin L Charlier, Kaninda Musumbu, Pascal Van Hentenryck
Venue:  (1990)

A generic abstract interpretation algorithm for Prolog programs is presented and its complexity analyzed. The algorithm is parametrized on the abstract domain and can be instantiated by choosing an abstraction of substitutions and an implementation of a number of abstract operations whose specifications are given as consistent abstractions of some concrete operations. The algorithm, which is representation-independent, has been developed by successive refinements from the abstract semantics and includes optimizations such as the detection of definitive results, the early recognition of termination, and the detection of dynamic dependencies. The worst-case complexity of the algorithm is analyzed for various classes of programs and behavioral assumptions.
Language-technical aspects of reuse
Authors: B. Stroustrup
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Reuse happens only when a variety of social conditions are favorable. However, social conditions, development processes, and design methods alone cannot guarantee success. In the end, working code must be produced, and at this stage programming languages and programming styles can make a critical difference. The paper focuses on C++ and its use because that's where the author's experience is, and because reuse in the abstract is a sterile exercise. To yield its obvious benefits, reuse must be practised. Reuse is a result of good design; it is not something you get from simple minded use of special language features. The paper presents examples of how designs of components for use in several contexts can be expressed directly and efficiently in C++. Concrete types, abstract classes, class hierarchies, and generic programming using templates are mentioned.
Effective bandwidths of departure processes from queues with time varying capacities
Authors: Cheng-Shang Chang, T. Zajic
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

In this paper, we consider a queue with a time varying capacity and identify the effective bandwidth of the stationary departure process from such a queue. Two important observations are made: (i) the effective bandwidths for the transient departure process and the stationary departure process from such a queue are in general different, and (ii) sometimes it is necessary to build up the queue first in order to have a large excursion of the stationary departure process. The new result on the effective bandwidth of the stationary departure process is applied to intree networks with time varying capacities and priority tandem queues. Algorithms for approximating the tail distributions of queue lengths in such networks are derived.
On the Intrinsic Reconstruction of Shape from Its Symmetries
Authors: Peter J. Giblin, Benjamin B. Kimia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

The main question we address is: What is the minimal information required to generate closed, nonintersecting planar boundaries? For this paper, we restrict ¿shape¿ to this meaning. More precisely, we examine whether the medial axis, together with dynamics, can serve as a language to design shapes and to effect shape changes, e.g., for modeling, to generate a morph sequence, etc. We represent the medial axis together with a direction of flow along the axis as the shock graph and examine the reconstruction of shape along each of the three types of medial axis points, (labeled A_1^2, A_1^3, A_3; see below for the A notation) and the associated six types of shock points. First, we show that the tangent and curvature of the medial axis and the speed and acceleration of the shock with respect to time of propagation, i.e., first and second order geometric and dynamic properties, are sufficient to determine the boundary tangent and curvature at corresponding points of the boundary. This implies that a rather coarse sampling of the symmetry axis, its tangent, curvature, speed, and acceleration is sufficient to regenerate accurately a local neighborhood of shape at regular axis points (A_1^2). We also show how higher order differential properties of the axis can be related to the higher-order differential properties of the boundary of the same order. Second, we examine the reconstruction of shape at branch points (A_1^3) where three regular branches are joined. We show that the three pairs of geometry (that is, curvature) and dynamics (that is, acceleration) must satisfy certain constraints. Finally, we derive similar results for the end points of shock branches (A_3 points). These formulas completely specify the local reconstruction of a shape from its shock-graph or medial axis and the conditions required to form a coherent shape from the medial axis.
3D Virtual Warehouse on the WEB
Authors: Jean-Claude Lafon
Venue: Proceedings of the International Conference on Information Visualisation (2000)

VRML2.0 language to model, visualize and to do interactive walking inside the warehouse. Key features of VRML 2.0 are underlined and new extensions are proposed in order to achieve a better realistic and ¿human-like¿ behavior inside the virtual warehouse.
Principality and Decidable Type Inference for Finite-Rank Intersection Types
Authors: Assaf J. Kfoury, Joe B. Wells
Venue:  (1998)

Abstract Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding a typing for a given term, if possible. We define an intersection type system which has principal typings and types exactly the strongly normalizable $\lambda$-terms. More interestingly, every finite-rank restriction of this system (using Leivant''s first notion of rank) has principal typings and also has decidable type inference. This is in contrast to System~F where the finite rank restriction for every finite rank at 3 and above has neither principal typings nor decidable type inference. This is also in contrast to earlier presentations of intersection types where the status of these properties is not known for the finite-rank restrictions at 3 and above. Furthermore, the notion of principal typings for our system involves only one operation, substitution, rather than several operations (not all substitution-based) as in earlier presentations of principality for intersection types (of unrestricted rank). A unification-based type inference algorithm is presented using a new form of unification, $\beta$-unification.
Using process waiver data to improve a design process: a case study of feedback and control using the FEAST model
Authors: L. G. Votta, M. L. Zajac
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Fundamental to any attempt of process reuse, the enacting organization needs to have the ability to adapt and modify itself to effectively use the recycled process elements. We examine the underlying feedback mechanism that is needed to drive and tune the organizational adaptation. We illustrate this adaptation using a process improvement case study of the 5ESS design process and the FEAST model for feedback in software development organizations. We found that it is crucial to understand the lag time between the time when the control signal is sampled and reapplied back to the design process. We discuss the 5ESS organizational setting, the FEAST feedback model, and the major observations from applying the model to the design improvement case study. We finish with a set of discussion points that illustrate important issues for any model of organizational feedback, and hence, important issues for process reuse.
The integration of computer aided design and analysis tools using a logic-based approach
Authors: D. Jonson, J. de Beer, N. Daya
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

The advancements in computer-aided design (CAD) software have revolutionized the traditional design process. The availability of sophisticated solid modeling tools has resulted in increased productivity and improved product quality. Computer-based analysis tools used for evaluating design or process performance have also made significant advances and are capable of analysing complex problems on a routine basis. The next stage in the development of computer-aided engineering tools is the seamless integration of the design generation and design evaluation phases. To date, there is in general no single commercial system that provides solutions to all aspects of the product development process of a specific industrial product. This paper addresses the development of a mechanical design system based on the integration of a CAD system with motion analysis (MA) and finite element analysis (FEA) codes. The basis for this integration involves the use of a common product data model and a mechanism for automating the exchange of information between design and analysis phases using predicate logic.
An Online Heuristic for Data Placement in Computer Systems with Active Disks
Authors: Sumalatha Adabala, José A. B. Fortes
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, an online heuristic is proposed and evaluated, for managing the dynamic memory in a computer system with Active Disks, by physically co-locating in disk memory or main memory, the data pages being accessed by a computation slice. This enables a runtime system that can offload the corresponding computation slice to the appropriate processing unit at the disk memory or main memory. A modified version of SEQUITUR, an online compressionalgorithm, is used to identify the affinity among sets of pages in a virtual memory page reference stream, and a page allocation and replacement policy that co-locates these setsof pages in memory is presented. The sets of pages identified by the algorithm are shown to closely match the sets of pages referenced by computation slices, using a suite of data access kernels as benchmarks. The paging policy is evaluated with page traces of micro benchmarks and real applications. In memory constrained environments, with additional memory at the disk, most of the benchmarks see improved performance, due to fewer page faults. The paging heuristic can co-locate 50% of the affinity sets on average and can offload up to 100% of the computation to disk, while the number of page faults are comparable to that of the LRU paging policy.
Solving bicriteria 0-1 knapsack problems using a labeling algorithm
Authors: M. Eugénia Captivo, João Clìmaco, José Figueira, Ernesto Martins, José Luis Santos
Venue: Computers and Operations Research (2003)

This paper examines the performances of a new labeling algorithm to find all the efficient paths (or non-dominated evaluation vectors) of the bicriteria 0-1 knapsack problem. To our knowledge this is the first time a bicriteria 0-1 knapsack is solved taking advantage of its previous conversion into a bicriteria shortest path problem over an acyclic network. Computational experiments and results are also presented regarding bicriteria instances of up to 900 items. The algorithm is very efficient for the hard bicriteria 0-1 knapsack instances considered in the paper.