ppxscal/embedding_network huggingface dataset:
A Unified Derivation of Operational Matrices for Integration in Systems Analysis
Authors: Jiunn-lin Wu, Chin-hsing Chen, Chih-fan Chen
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Using the operational matrix of an orthogonal function to perform integration for solving, identifying and optimizing a linear dynamic system has several advantages: (1) the method is computer oriented, thus solving higher order differential equation becomes a matter of dimension increasing; (2) the solution is a multi-resolution type; (3) the answer is convergent, even the size of increment is very large.The traditional methods of deriving the operational matrix is much involved and not unified, this paper presents a new unified approach to deriving the operational matrices of orthogonal functions. We apply it first to the derivation of the operational matrices of the square wave group which consist of (i) the block pulse function, (ii) the Walsh function and (iii) the Haar wavelet function, then to the sinusoidal group which includes (i) the discrete Fourier transform, (ii) the discrete cosine transform and (iii) the discrete Hartley transform. Finally, we use the operational matrices to solve a linear differential equation for demonstrating its usefulness.
Using Group Communication Technology to Implement a Reliable and Scalable Distributed IN Coprocessor
Authors: Roy Friedman, Ken Birman
Venue:  (1996)

In this paper we explore the use of group communication technology, developed in the Horus project to implement a reliable and scalable distributed IN coprocessor. The proposed implementation can handle up to 20,000 calls per second with 12 computing nodes, can tolerate a single node failure or recovery, and can recover from periods of overload. Our work suggests that group communication technology can bring substantial benefits, including scalability, fault-tolerance, and real-time responsiveness to the most demanding telecommunications applications.
On Peer-to-Peer Media Streaming
Authors: Dongyan Xu, Mohamed Hefeeda, Susanne Hambrusch, Bharat Bhargava
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

In this paper, we study a peer-to-peer media streaming system with the following characteristics: (1) its streaming capacity grows dynamically; (2) peers do not exhibit server-likebehavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each streaming session may involve multiple supplying peers. Based on these characteristics, we investigate two problems: (1) how to assign media data to multiple supplying peers in one streaming session and (2) how to fast amplify the system's total streaming capacity. Our solution to the first problem is an optimal media data assignment algorithm OTSp2p, which results in minimum buffering delay in the consequent streaming session. Our solution to the second problem is a distributed differentiated admission control protocol DACp2p. By differentiating between requesting peers with different out-bound bandwidth, DACp2p achieves fast system capacityamplification; benefits all requesting peers in admission rate, waiting time, and buffering delay; and creates an incentive for peers to offer their truly available out-bound bandwidth.
A Statistical Approach to Snakes for Bimodal and Trimodal Imagery
Authors: Anthony Yezzi Jr, Andy Tsai, Alan Willsky
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In this paper, we describe a new region-based approach to active contours for segmenting images composed of two or three types of regions characterizable by a given statistic. The essential idea is to derive curve evolutions which separate two or more values of a predetermined set of statistics computed over geometrically determined subsets of the image. Both global and local image information is used to evolve the active contour. Image derivatives, however, are avoided, thereby giving rise to a further degree of noise robustness compared to most edge-based snake algorithms.
Smooth motion of a rigid body in 2D and 3D
Authors: F. S. Chaudhry, D. C. Handscomb
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Given measurements of the positions of a number of marked points on a rigid body at a sequence of times t/sub i/ (i=0, 1, ..., n), we represent the motion of the body, assuming this motion to be smooth, by means of piecewise-rational curves, one through each sequence of positions, sharing a common denominator and having the property that the distance between these curves always remains constant. We consider in detail the motion in 2D and 3D of a rigid rod marked at each end.
Helios: A Modeling Language for Nonlinear Constraint Solv ing and Global Optimization using Interval Analysis
Authors: Pascal VanHentenryck, Laurent Michel
Venue:  (1995)

This paper introduces Helios, a mathematical modeling language to solve nonlinear constraint systems and global optimization problems using interval analysis. Helios makes it possible to state nonlinear applications almost as in scientific publications by offering computer-readable equivalents of many mathematical notations. As a consequence, Helios significantly simplifies the solving of these applications by letting users focus on modeling aspects instead of on low-level details. Helios statements are used as inputs to state-of-the-art interval analysis algorithms, which combine techniques from numerical analysis and artificial intelligence. Helios has been evaluated on a variety of benchmarks. On traditional constraint-solving benchmarks, it outperforms the interval methods we are aware of and is competitive with state-of-the-art continuation methods. On global optimization problems, Helios outperforms the interval algorithms we are aware of.
Parametric Modeling: Concept and Implementation
Authors: Alexander N. Inozemtsev, Dmitry I. Troitsky
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The implementation of parametric modeling in industrial and design enterprises has resulted in the ability of computer graphics users to reduce redundant labor practices by the creation of interactive databases. Designers and production staff now have the luxury of being able to edit these databases rather than always having to redesign models required to meet current needs or updated specifications. The regeneration of parametric models now allows reduced time in ¿art to part¿ production as well as providing a foundational database upon which future product development and revisions may rest.However, the large learning curves of most parametric modeling software packages more often than not makes their introduction into manufacturing enterprises a slow and arduous experience. There are solutions to this ramp-up time that can allow manufacturers the ability to educate their computer users in the use of parametric modeling packages and at the same time respond to the evolving needs of their enterprises.
Design-Manufacturing Interface in the Deep Submicron: Is Technology Independent Design Dead?
Authors: Carlo Guardiani, Andrzej J. Strojwas
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Not so long ago, the technology independent design style was advertised as the way to go, at least for ASICs. Seamless mapping of RTL code onto pre-characterized IP libraries and automatic P&R seemed to provide a smooth path from HDL to mask layout. Unfortunately, this approach does not appear to be feasible in the deep submicron (DSM) era, especially for high performance IC's.To achieve top performance while maintaining satisfactory manufacturing yields, the technology capabilities, including quasi-transmission line effects in interconnections, must be extracted and abstracted to be used up-front in the design synthesis. The design-manufacturing interface must be changed in order to account for these DSM effects, while still being able to handle the increasing complexity of designs.This panel will address the requirements imposed on the design - manufacturing interface for the DSM technologies by gathering experts from the different segments of the semiconductor industry, to address design needs versus available solutions and potential show-stoppers in designing high complexity chips for leading edge technologies.
Computational Complexity and Nondeterminism in Flowchart Programs
Authors: Theodore P Baker
Venue:  (1973)

NO SUPPLIED 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
The Hierarchical Daisy Architecture for Causal Delivery
Authors: Roberto Baldoni, Roy Friedman, Robbert van Renesse
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

In this paper, we propose the hierarchical daisy architecture, which provides causal delivery of messages sent to any subset of processes. The architecture provides fault tolerance and maintains the amount of control information within a reasonable size. It divides processes into logical groups. Messages inside a logical group are sent directly, while messages that need to cross logical groups' boundaries are forwarded by servers. We proof the correctness of the daisy architecture and discuss possible optimizations.
Dual multiresolution HyperSlice for multivariate data visualization
Authors: Pak Chung Wong, A. H. Crabb, R. D. Bergeron
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

We present a new multiresolution visualization design which allows a user to control the physical data resolution as well as the logical display resolution of multivariate data. A system prototype is described which uses the HyperSlice representation. The notion of space projection in multivariate data is introduced. This process is coupled with wavelets to form a powerful tool for very large data visualization.
Analog Switches in Programmable Analog Devices: Quiescent Defective Behaviours
Authors: R. Rodríguez-Montañés, D. Muñoz, L. Balado, J. Figueras
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Analog Switches (AS) have played an essential role in a large number of Mixed Signal (M-S) circuits. Depending on the use of the AS, designers have optimised their topology to the needs of each specific switching function. The success of field programmable devices in the digital domain has motivated some manufacturers to explore similar solutions to fast prototyping in the analog and M-S domains. In this work we explore the defective behaviours of programmable AS under realistic catastrophic and parametric defects. A classification ofthe defective behaviours for bridge and open defects is done. It shows that the simple fault model, with faulty state of permanently transistor stuck-on or stuck-off, is not sufficient to reflect the real behaviour of the switch.
On Low-Cost Error Containment and Recovery Methods for Guarded Software Upgrading
Authors: Ann T. Tai, Kam S. Tso, Leon Alkalai, Savio N. Chau, William H. Sanders
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

To assure dependable onboard evolution, we have developed a methodology called guarded software upgrading (GSU). In this paper, we focus on a low-cost approach to error containment and recovery for GSU. To ensure low development cost, we exploit inherent system resource redundancies as the fault tolerance means. In order to mitigate the effect of residual software faults at low performance cost, we take a crucial step in devising error containment and recovery methods by introducing the ¿confidence-driven¿ notion. This notion complements the message-driven (or ¿communication-induced¿) approach employed by a number of existing checkpointing protocols for tolerating hardware faults. In particular, we discriminate between the individual software components with respect to our confidence in their reliability, and keep track of changes of our confidence (due to knowledge about potential process state contamination) in particular processes. This, in turn, enables the individual processes in the spaceborne distributed system to make decisions locally, at run-time, on whether to establish a checkpoint upon message passing and whether to roll back or roll forward during error recovery. The resulting message-driven confidence-driven approach enables cost-effective checkpointing and cascading-rollback free recovery.
Training Feedforward Neural Networks Using Orthogonal Iteration of the Hessian Eigenvectors
Authors: Andrew Hunter
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

The paper describes a new training algorithm that has scalable memory requirements, which may range horn O(W) to O(W2), although in practice the useful range is limited to lower complexity levels. The algorithm is based upon a novel iterative estimation of the principal eigen-subspace of the Hessian, together with a quadratic step estimation procedure. It is shown that the new algorithm has convergence time comparable to conjugate gradient descent and maybe preferable if early stopping is used as it converges more quickly during the initial phases. Section 2 overviews the principles of second order training algorithms. Section 3 introduces the new algorithm. Second 4 discusses some experiments to confirm the algorithm's performance; section 5 concludes the paper.
A Measurement-Based Performability Model For A Multiprocessor System
Authors: C M Hsueh, K R Iyer, S K Trivedi
Venue:  (1987)

This paper describes a measurement-based performability model based on real error-data collected on a multi-processor system. Model development from the raw error-data to the estimation of cumulative reward is described. Both normal and failure behavior of the system are characterized. The measured data show that the holding times in key operational and failure states are not simple exponential and that a semi-Markov process is necessary to model the system behavior. A reward function, based on the service rate and the error rate in each state, is then defined in order to estimate the performability of the system and to depict the cost of different failure types and recovery procedures.
Interactive Information Retrieval
Authors: Gerard Salton
Venue:  (1969)

The advent of time-sharing computer organizations and input-output console equipment has made it possible to experiment with interactive information handling methods in which the user takes on important functions both in planning and in executing information searches. The principal interactive text storage and retrieval processes are briefly reviewed, including text editing, text analysis and indexing, query formulation, and information searching. The user''s role is stressed in each case, and particular attention is paid to interactive search procedures in which both the user queries and the stored information files become altered as a result of the user-system interaction. Evaluation results obtained with the SMART retrieval system are exhibited for some of the proposed methodology.
Formal Automatic Verification of Authentication Cryptographic Protocols
Authors: M. Debbabi, M. Mejri, N. Tawbi, I. Yahmadi
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

We address the formal analysis of authentication cryptographic protocols. We present a new verification algorithm that generates from the protocol description the set of possible flaws, if any, as well as the corresponding attack scenarios. This algorithm does not require any property or invariant specification. The algorithm involves three steps: extracting the protocol roles, modeling the intruder abilities and verification. In addition to the classical known intruder computational abilities such as encryption and decryption, we also consider those computations that result from different instrumentations of the protocol. The intruder abilities are modeled as a deductive system. The verification is based on the extracted roles as well as the deductive system. It consists in checking whether the intruder can answer all the challenges uttered by a particular role. If it is the case, an attack scenario is automatically constructed. The extracted proof system does not ensure the termination of deductions. For that purpose, we present a general transformation schema that allows one to automatically rewrite the non-terminating proof system into a terminating one. The transformation schema is shown to be correct. To exemplify the usefulness and efficiency of our approach, we illustrate it on the Woo and Lam authentication protocol. Abadi and Needham have shown that the protocol is insecure and they proposed a new corrected version. Thanks to this method we have discovered new unknown flaws in the Woo and Lam protocol and in the corrected version of Abadi and Needham.
Some New Results on Optimal Codes Over F5
Authors: Iliya Bouyukliev, Juriaan Simonis
Venue: Designs, Codes and Cryptography (2003)

We present some results on almost maximum distance separable (AMDS) codes and Griesmer codes of dimension 4 over over the field of order 5. We prove that no AMDS code of length 13 and minimum distance 5 exists, and we give a classification of some AMDS codes. Moreover, we classify the projective strongly optimal Griesmer codes over F5 of dimension 4 for some values of the minimum distance.
Algorithms and Lower Bounds for P-Gossiping in Circulant Networks
Authors: E. A. Monakhova
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We consider the broadcast and gossiping problems in circulant networks. The circulant graphs are studied extensively as reliable interconnection networks for the multiprocessor systems. We consider gossiping in the store-and-forward, full-duplex and shouting model for the case when communicating nodes can exchange up to a fixed number p of packets at each round of gossiping (p-gossiping). A general method for evaluation of the lower bounds for p-gossiping in circulant graphs is established. The parallel decentralized node-invariant broadcast and p-gossiping algorithms are proposed which provide the minimum execution time and the minimum of message loading of the network during message-passing.
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
Authors: William Leinberger, George Karypis, Vipin Kumar
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Multi-capacity bin-packing is a generalization of the classical one-dimensional bin-packing problem in which the bin capacity and the item sizes are represented by d-dimensional vectors. Previous work in d-capacity bin-packing algorithms analyzed variants of single capacity bin-packing, extended to deal with the d capacities.These extended algorithms are oblivious to the additional capacity information, however, and do not scale well with increasing d. We provide new packing algorithms which use the additional capacity information to provide better packing and show how these algorithms might lead to better multi-resource allocation and scheduling solutions.
Non-normal Dynamics and Hydrodynamic Stability
Authors: Jeffrey S Baggett
Venue:  (1996)

This thesis explores the interaction of non-normality and nonlinearity in continuous dynamical systems. A solution beginning near a linearly stable fixed point may grow large by a linear mechanism, if the linearization is non-normal, until it is swept away by nonlinearities resulting in a much smaller basin of attraction than could possibly be predicted by the spectrum of the linearization. Exactly this situation occurs in certain linearly stable shear flows, where the linearization about the laminar flow may be highly non-normal leading to the transient growth of certain small disturbances by factors which scale with the Reynolds number. These issues are brought into focus in Chapter 1 through the study of a two-dimensional model system of ordinary differential equations proposed by Trefethen, et al. [Science, 261, 1993]. In Chapter 2, two theorems are proved which show that the basin of attraction of a stable fixed point, in systems of differential equations combining a non-normal linear term with quadratic nonlinearities, can decrease rapidly as the degree of non-normality is increased, often faster than inverse linearly. Several different low-dimensional models of transition to turbulence are examined in Chapter 3. These models were proposed by more than a dozen authors for a wide variety of reasons, but they all incorporate non-normal linear terms and quadratic nonlinearities. Surprisingly, in most cases, the basin of attraction of the "laminar flow" shrinks much faster than the inverse Reynolds number. Transition to turbulence from optimally growing linear disturbances, streamwise vortices, is investigated in plane Poiseuille and plane Couette flows in Chapter 4. An explanation is given for why smaller streamwise vortices can lead to turbulence in plane Poiseuille flow. In plane Poiseuille flow, the transient linear growth of streamwise streaks caused by non-normality leads directly to a secondary instability. Certain unbounded operators are so non-normal that the evolution of infinitesimal perturbations to the fixed point is entirely unrelated to the spectrum, even as i -< infinity. Two examples of this phenomenon are presented in Chapter 5.
Capturing Complete and Accurate Requirements by Refinement
Authors: Shaoying Lin
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Complete and accurate functional equirements arethe foundation for valid specification refinement andcorrectness verification of implemented software systemswhen they are developed with a formal method.However , capturing quality requirements is a difficulttask, and there is a lack of well-defined and effectivetechnique that solves the problem as well. In this paperwe argue that the refinement technique used inconventional formal methods for transforming formalspecifications into programs is actually an effectivetechnique for capturing the functional requirements.We define the completeness of formal specificationsand explain by examples how it can be achieved. 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