ppxscal/embedding_network huggingface dataset:
Integration of Perturbed Initial Value Problems through Reduction Theory
Authors: Jesús Palacián
Venue: SIAM Journal on Numerical Analysis (2004)

We propose a method to integrate an initial value problem formed by the differential equations of a perturbed dynamical system plus the initial condition. The approach consists of several steps. First of all, if the original system does not enjoy a continuous symmetry, it is transformed up to a certain order of approximation M into an equivalent but equivariant one after truncation at order M. Second, this new symmetry allows us to define a reduction map which produces in its whole phase space a splitting of the transformed equations. Specifically, the latter system is decoupled into two subsystems, also initial value problems, one of them defined in the orbit space associated with the reduction and the other linear in its coordinates. As a third step the reduced subsystems are analytically resolved or numerically integrated using standard methods. Finally, the solution of the original system is recovered by inverting back the reduction map and thereafter the analytic transformations. We apply our procedure to three examples.
An interactive high-level debugger for control-flow optimized programs
Authors: Polle T. Zellweger
Venue: ACM SIGPLAN Notices (1983)

The transformations performed by an optimizing compiler have traditionally impeded interactive debugging in source language terms. A prototype system called Navigator has been developed for debugging optimized programs written in Cedar, an Algol-like language. Navigator can be used to monitor program execution flow in the presence of two optimizations: inline procedure expansion and cross-jumping (merging identical tails of code paths that join). This paper describes the problems that these two optimizations create for debugging and Navigator's solutions to these problems. The selected approach collects extra information during the optimization phases of compilation. At runtime, Navigator uses the additional information to hide the effects of the optimizations from the programmer.
On Complexity Measures for Biological Sequences
Authors: Fei Nan, Donald Adjeroh
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Abstract. In this work, we perform an empirical study of different published measures of complexity for general sequences, to determine their effectiveness in dealing with biological sequences. By effectiveness, we refer to how closely the given complexity measure is able to identify known biologically relevant relationships, such as closeness on a phylogenic tree. In particular, we study three complexity measures, namely, the traditional Shanonýs entropy, linguistic complexity, and T-complexity. For each complexity measure, we construct the complexity profile for each sequence in our test set, and based on the profiles we compare the sequences using different performance measures based on: (i) the information theoretic divergence measure of relative entropy; (ii) apparent periodicity in the complexity profile; and (iii) correct phylogeny. The preliminary results show that the Tcomplexity was the least effective in identifying previously established known associations between the sequences in our test set. Shannonýs entropy and linguistic-complexity provided better results, with Shannonýs entropy having an upper hand.
Restrictions of production engineering on micro-specific product development
Authors: A. Albers, J. Marz
Venue: Microsystem Technologies (2004)

The influences deriving from technology on the functions achievable by means of product design are typical characteristics of the development of micro-technological products. As a result, unlike the conventional design process the function attainable in micro technology due to product design appears to be less subjected to certain requirements. Multitechnological influences, resulting from production processes, material characteristics or micro-specific effects have an especially restrictive impact on the design of machine elements. On the basis of the product development process for primary shaped micro components from metallic and ceramic materials a method is presented which makes it possible to detect the know-how provided by disciplines subsequent and adjacent to the design process, having influence on the design of the machine element and interpret this relevant to design. The computer-aided availability of knowledge is accomplished with a knowledge-based design environment.
Vision-Based Camera Motion Recovery for Augmented Reality
Authors: Manolis I. A. Lourakis, Antonis A. Argyros
Venue: Proceedings of the Computer Graphics International (2004)

We address the problem of tracking the 3D position andorientation of a camera, using the images it acquires whilemoving freely in unmodeled, arbitrary environments. Thistask has a broad spectrum of useful applications in domainssuch as augmented reality and video post production. Mostof the existing methods for vision-based camera trackingare designed to operate in a batch, off-line mode, assumingthat the whole video sequence to be tracked is availablebefore tracking commences. Typically, such methodsoperate non-causally, processing video frames backwardsand forwards in time as they see fit. Furthermore, they resortto optimization in very high dimensional spaces, a processthat is computationally intensive. For these reasons,batch methods are inapplicable to tracking in on-line, time-criticalapplications such as video see-through augmentedreality. This paper puts forward a novel feature-based approachfor camera tracking. The proposed approach operateson images continuously as they are acquired, hasrealistic computational requirements and does not requiremodifications of the environment. Sample experimental resultsdemonstrating the feasibility of the approach on videoimages are also provided.
Proactive Recovery in Distributed CORBA Applications
Authors: Soila Pertet, Priya Narasimhan
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Unanticipated runtime events, such as faults, can leadto missed deadlines in real-time systems. While it is notalways possible to know when a fault will occur, we cansometimes exploit pre-fault "symptoms" to initiate proactive(rather than reactive) fault-recovery. In this paper, wedescribe the design and implementation of a proactive recoverystrategy for distributed CORBA applications in thepresence of resource-exhaustion faults. We analyze the effectof different proactive recovery schemes on client/serverresponse times, and we demonstrate a significant reduction,both in jitter and in the number of client-side failures.
Timing analysis of compound scheduling policies: application to posix1003.1b
Authors: Jörn Migge, Alain Jean-Marie, Nicolas Navet
Venue: Journal of Scheduling (2003)

The analysis of fixed priority preemptive scheduling has been extended in various ways to improve its usefulness for the design of real-time systems. In this paper, we define the layered preemptive priority scheduling policy which generalizes fixed preemptive priorities by combination with other policies in a layered structure. In particular, the combination with the Round Robin scheduling policy is studied. Its compliance with Posix 1003.1b requirements is shown and its timing analysis is provided. For this purpose and as a basis for the analysis of other policies, the concept of majorizing work arrival function, is introduced to synthesize essential ideas used in existing analysis of the fixed preemptive priority policy.If critical resources are protected by semaphores, the Priority Ceiling Protocol (PCP) can be used under fixed preemptive priorities to control resulting priority inversions. An extension of the PCP is proposed for Round Robin, to allow a global control of priority inversions under the layered priority policy and to prevent deadlocks. The initial timing analysis is extended to account for the effects of the protocol. The results are illustrated by a small test case.
BDD Circuit Optimization for Path Delay Fault Testability
Authors: Gorschwin Fey, Junhao Shi, Rolf Drechsler
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The complexity of integrated circuits is rapidly growing. This leads to more and more time and money spent on the test of these circuits. Besides minimizing the logic needed for a given function the testability of the resulting circuit becomes a major issue during synthesis. One way to synthesize a circuit for a given function is to directly convert the Binary Decision Diagram (BDD) of that function into a circuit. It is known that optimizations of the BDD transfer to the derived circuit. Therefore in this paper we evaluate different optimization techniques for BDDs based on variable reordering with respect to the path delay fault testability of the resulting circuit. We show an optimization strategy that allows to compromise during synthesis between logic size and testability.
Otolith responses to dynamical stimuli: results of a numerical investigation
Authors: R. Jaeger, T. Haslwanter
Venue: Biological Cybernetics (2004)

To investigate the dynamic effects of external forces on the displacement of the otolith membrane and subsequent neuronal responses of otoliths, we performed numerical analyses of otolith membrane displacements. In these studies we included the full geometry of the human otolith maculae, including their 3D curvature. The first part focuses on mechanical aspects of the otolith membrane. While it was found that the mechanical coupling of distant parts of the otolith membrane is only weak, these simulations indicate that curvature may have considerable local effects on displacements. They further suggest that the movements of the otoconia, embedded in the interotoconial matrix, show a resonance in a range between 100 and 2000 Hz. In the second part of the article we also investigate the tonic-phasic responses in the vestibular nerve emanating from hair cells in the striola region. Small head tilts away from head upright position are used. The simulations indicate that the direction of head tilt is coded in characteristic response patterns along the striola.
Quantifying trade-offs in resource allocation for VPNs
Authors: Satish Raghunath, Shivkumar Kalyanaraman, K. K. Ramakrishnan
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Virtual Private Networks (VPNs) feature notable characteristics in structure and traffic patterns that allow for efficient resource allocation. A strategy that exploits the underlying characteristics of a VPN can result in significant capacity savings to the service provider.There are a number of admission control and bandwidth provisioning strategies to choose from. We examine trade-offs in design choices in the context of distinctive characteristics of VPNs. We examine the value of signaling-based mechanisms, traffic matrix information and structural characteristics of VPNs in the way they impact resource utilization and service quality. We arrive at important conclusions which could have an impact on the way VPNs are architected. We show that the structure of VPNs profoundly influences achievable resource utilization gains with various admission control and provisioning schemes.
An Index System for Dynamic Peer-to-Peer Network Based on Document Usefulness
Authors: Taizo Yamada, Kenro Aihara, Atsuhiro Takasu, Jun Adachi
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Peer-to-Peer (P2P) systems are applied to cooperative working environments, but require more effective document sharing mechanisms, particularly, more efficient query processing. To achieve efficient query processing in the environment, we study a distributed indexing mechanism, normal Direct Indices (DIs), which are the key to reducing the number of queries and improving scalability over P2P networks. However, query processing with DIs cannot efficiently deal with an increase in the number of document categories because a DI holds the peer's information, not the document information. Therefore, we propose an improved DI, query-based DIs (QDIs). We assume that the peer is relevant to the query terms that the peer sends. This assumption allows each peer with correct QDIs to forward the query messages to their destination. To validate the QDIs, we show experimental results on query processing with and without DIs and show the improvement in network performance.
The Y-Architecture for On-Chip Interconnect: Analysis and Methodology
Authors: Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Ion Mandoiu, Qinke Wang, Bo Yao
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The Y-architecture for on-chip interconnect is based on pervasiveuse of 0-, 120-, and 240-degree oriented semi-global and globalwiring. Its use of three uniform directions exploits on-chip routingresources more efficiently than traditional Manhattan wiring architecture.This paper gives in-depth analysis of deployment issues associatedwith the Y-architecture. Our contributions are as follows:(1) We analyze communication capability (throughput of meshes)for different interconnect architectures using a multi-commodityflow approach and a Rentian communication model. Throughput ofthe Y-architecture is largely improved compared to the Manhattanarchitecture, and is close to the throughput of the X-architecture.(2) We propose a symmetrical Y clock tree structure with bettertotal wire length compared to both H and X clock tree structures,and better path length compared to the H tree. (3) We discuss powerdistribution under the Y-architecture, and give analytical and SPICEsimulation results showing that the power network in Y-architecturecan achieve 8.5% less IR drop than an equally-resourced power networkin Manhattan architecture. (4) We propose the use of via tunnelsand banks of via tunnels as a technique for improving routabilityfor Manhattan and Y-architectures.
On one-way cellular automata with a fixed number of cells
Authors: Andreas Malcher
Venue: Fundamenta Informaticae (2003)

We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is bounded by a constant number k, so-called kC-OCAs. In contrast to the general model, the generative capacity of the restricted model is reduced to the set of regular languages. A kC-OCA can be algorithmically converted to a deterministic finite automaton (DFA). The blow-up in the number of states is bounded by a polynomial of degree k. We can exhibit a family of unary languages which shows that this upper bound is tight in order of magnitude. We then study upper and lower bounds for the trade-off when converting DFAs to kC-OCAs. We show that there are regular languages where the use of kC-OCAs cannot reduce the number of states when compared to DFAs. We then investigate trade-offs between kC-OCAs with different numbers of cells and finally treat the problem of minimizing a given kC-OCA.
Implementation of Large Catalogs for Price Enforcement in B2B E-Commerce
Authors: Trung T. Pham, Simone K. Fuchter
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

This paper presents an efficient architecture to implement a catalog for its application in B2B electronic commerce. The architecture is designed based on a client-server model under the constraint of the unbalanced computing power between the buyer and suppliers. Computational algorithms are designed according to this assumption of limited computer resources at the client side and ample resources at the server side. The application is to provide a complete and workable catalog solution for price enforcement when fulfilling a purchase order to eliminate costs associated with having to make amendments to a past purchase order and having to delay a business transaction.
Synthesis of Heterogeneous Distributed Architectures for Memory-Intensive Applications
Authors: Chao Huang, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Memory-intensive applications present unique challenges to an ASICdesigner in terms of the choice of memory organization, memory size requirements,bandwidth and access latencies, etc. The high potential of single-chip distributed logic-memory architectures in addressing many of these issues has been recognized ingeneral-purpose computing, and more recently in ASIC design. However, such architectureswill be adopted widely by designers only when general techniques and toolsfor efficient high-level synthesis (HLS) of multi-partitioned ASICs become available.The techniques presented in this paper are motivated by the fact that many memory-intensiveapplications exhibit irregular array data access patterns (due to conditionalsin loop nests, etc.). Synthesis should, therefore, be capable of determining a partitionedarchitecture, wherein array data and computations may have to be heterogeneouslydistributed for achieving the best performance speedup. Furthermore, the synthesismethodology should not be restricted by the nature of array index functions (affine orotherwise) in a behavior. Therefore, our methodology employs simulation to provideinformation about the access patterns of array data references in a behavior, which isused by the rest of our analysis. We use a combination of clustering and min-cut stylepartitioning techniques to partition the behavior into sub-behaviors while consideringvarious factors including data access locality, balanced workloads, inter-partitioncommunication, etc. Finally, we also employ an iterative improvement strategy to determinethe best way of distributing array data into physical memory in each partition.Our experiments with several benchmark applications show that the proposed techniquescan yield partitioned architectures that can achieve upto 2.2X performancespeed-up over conventional HLS solutions, while achieving upto 1.6X performancespeedup over the best homogeneous partitioning solution feasible.
Processor-embedded distributed smart disks for I/O-intensive workloads: architectures, performance models and evaluation
Authors: Steve C. Chiu, Wei-keng Liao, Alok N. Choudhary, Mahmut T. Kandemir
Venue: Journal of Parallel and Distributed Computing (2004)

Processor-embedded disks, or smart disks, with their network interface controller, can in effect be viewed as processing elements with on-disk memory and secondary storage. The data sizes and access patterns of today's large I/O-intensive workloads require architectures whose processing power scales with increased storage capacity. To address this concern, we propose and evaluate disk-based distributed smart storage architectures. Based on analytically derived performance models, our evaluation with representative workloads show that offloading processing and performing point-to-point data communication improve performance over centralized architectures. Our results also demonstrate that distributed smart disk systems exhibit desirable scalability and can efficiently handle I/O-intensive workloads, such as commercial decision support database (TPC-H) queries, association rules mining, data clustering, and two-dimensional fast Fourier transform, among others.
Knowledge-based debugging: session summary
Authors: Mark A. Linton, Robert Balzer, R. J. Cunningham, Cordell Green, Robert Sedlmeyer, Elliott Solloway, William Swartout, Pamela Zave
Venue: ACM SIGPLAN Notices (1983)

Robert Balzer began the session by presenting an overview of where debugging fits into knowledge-based programming systems. He distinguished between differences in <italic>paradigm</italic> (the traditional software engineering approach in which the source code is the first formal representation vs. the operational specification approach in which the specification is both formal and <italic>executable</italic> and from which the implementation is formally derived) and differences in <italic>technology</italic> (traditional debuggers vs. knowledge-based tools), pointing out that it is possible to use traditional debugging techniques with the operational specification paradigm as well as use knowledge-based tools with the traditional software engineering paradigm. Balzer presented the operational specification paradigm for software development. The basic idea is that an implementation is derived from a specification through transformations chosen by the programmer and applied by the system. Assuming each transformation is correct, the resulting implementation will accurately reflect the intentions of the specification.
A Fast and Well-Structured Multiplier
Authors: Jung-Yup Kang, Jean-Luc Gaudiot
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The performance of multiplication is crucial for multimedia applications such as 3D graphics and signal processing systems which depend on extensive numbers of multiplications. Previously reported multiplication algorithms mainly focus on rapidly reducing the partial products rows down to final sums and carries used for the final accumulation. These techniques mostly rely on circuit optimization and minimization of the critical paths. In this paper, an algorithm to achieve fast multiplication in two's complement representation is presented. Indeed, our approach focuses on reducing the number of partial product rows. In turn, this directly influences the speed of the multiplication, even before applying partial products reduction techniques. Fewer partial products rows are produced, thereby lowering the overall operation time. This results in a true diamond-shape for the partial product tree which is more efficient in terms of implementation.
RetsoftPlus: A Tool for Retinal Image Analysis
Authors: Marc Lalonde, France Laliberte, Langis Gagnon
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper describes a research software application specifically developed to assistophthalmologists in performing retinal image analysis. The application provides powerfultools for automatic detection of lesions and anatomical structures as well as imageregistration and fusion, which are novel methods in ophthalmology. Usability is also akey strength of the application: wizards guide the user through the tasks to be carriedout.