ppxscal/embedding_network huggingface dataset:
Data Analysis for Rotationally Resolved Spectra: A Simulated Annealing Approach
Authors: Julian Hjortshoj, Laura Philips
Venue:  (1992)

A new method for the analysis of rotationally resolved spectra is presented. The method employs a simulated annealing algorithm with two modifications. First, the standard simulated annealing process is extended to take advantage of parallel computing. Second, rather than using a continuous random search of the parameter space, at distinct intervals new optimization processes are started at points in parameter space that have promising x2 (squared) values. Together these modifications make more efficient use of computer time than a standard simulated annealing approach. The technique is applied to the analysis of simulated data as well as real high resolution experimental spectra to demonstrate the effectiveness of the parallel simulated annealing algorithm.
A Literal Gate Using Resonant-Tunneling Devices
Authors: T. Waho, K. J. Chen, M. Yamamoto
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We propose a novel literal gate consisting of one resonant-tunneling diode (RTD) and two resonant-tunneling transistors (RTTs). Logic operation is based on the control of the switching sequence of these devices through the modulation of their peak currents by the input signal. By using an integrated RTD-HEMT pair as an RTT, we implement literal gates and successfully obtain the literal function. A modified literal gate that allows us to vary literal-window width even after completing device fabrication is also demonstrated.
Filter Promotion Transformation Strategies for Deriving Efficient Programs from Z Specifications
Authors: Ali E. Abdallah
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

In recent years, there have been growing interests in systematic methods for refining Z specifications into programs. In this paper, we consider a transformational programming strategy known as filter promotion and examine its use for refining a class of Z specifications into sequential as well as parallel programs. This strategy is particularly useful for transforming specifications of generate and test problems into efficient algorithms. We find it convenient to use different notations at different level of abstractions: Z to capture the starting specification, Bird-Meertens functional notation to express algorithms and Hoare's CSP to describe parallelism and communications. The basic ideas are illustrated by systematic transformational developments of sequential and parallel algorithms for sorting and searching problems.
Personal Keys, Group Keys and Master Keys
Authors: Dorothy E. Denning, Fred B. Schneider
Venue:  (1980)

NO SUPPLIED
Technology of Video and Audio Streaming
Authors: David Austerberry, Gavin Starks
Venue:  (2002)

:For broadcasters, web developers, and project managers implementing streaming media systems, David Austerbery shows how to deploy the technology on your site, from video and audio capture through to the consumer's media player. The book first deals with Internet basics and gives a thorough coverage of telecommunications networks and the last mile to the home. Video and audio formats are covered, as well as compression standards including MPEG-4 and the leading proprietary architectures. The book then guides you through the streaming process showing in-depth how to encode audio and video. The deployment of media servers, live webcasting and how a stream is displayed on the consumer's media player are also covered. A final section on associated technologies illustrates how you can protect your revenue sources with digital rights management systems, looks at various forms of content delivery, offers guidance on how to monetize your content with ad insertion, and provides examples of successful streaming applications.
Automated integration for the joint maritime command information system
Authors: D. S. Lange
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Budget is one of the primary engineering constraints for United States Department of Defence (DOD) program managers. In order to satisfy expanding requirement sets with less development money, managers have consolidated projects eliminating systems that are designed for the requirements of a single site or class of sites. As the consolidation approach has risen in the hierarchy, the variety of software being brought together has grown and the amount of software reuse required has been amplified. As a result, a new method of system integration has become essential. The paper describes the integration standard and tool set being used by major elements of the DOD, including the Defence Information Systems Agency which is responsible for integrating the Global Command and Control System. By automating integration, the DOD has developed an efficient, repeatable process for integrating the work of many developers.
Priority based data flow testing
Authors: R. Gupta, M. L. Soffa
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Software testing is an expensive component of software development and maintenance. For data flow testing, test cases must be found to test the def-use pairs in a program. Since some of the def-use pairs identified through static analysis may be infeasible, no amount of testing effort may result in exhaustive testing of a program. Therefore in practice a fixed amount of effort is spent in testing a program. We develop an approach for assigning priorities to def-use pairs, such that the def-use pairs with higher priorities can be expected to require less effort for test case generation and therefore testing. Thus, by using the priorities as a guide for ordering the def-use pairs for testing, we can maximize the number of def-use pairs tested using a fixed amount of testing effort. We apply the technique to regression testing during the software maintenance phase, in which case the priorities are assigned to capture not only the difficulty in test case generation but also the likelihood that an error introduced by a program change is uncovered by the test case.
The covert channel limiter revisited
Authors: Keith Loepere
Venue: ACM SIGOPS Operating Systems Review (1989)

In a previous article1, I introduced the idea of a mechanism (the covert channel limiter) that would watch for the potential uses of covert channels and affect the responsible process (or process group) only when such potential uses exceeded the allowable bandwidth for covert channels. Recent work involving the design of the Opus operating system (target class B3) has refined and extended this idea. This paper extends the informal basis for the covert channel limiter and extends its possible utility. 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
Real World Adobe Photoshop 7
Authors: David Blatner, Bruce Fraser
Venue:  (2002)

:Master the essential day-in and day-out Photoshop production techniques with this definitive resource from best-selling authors David Blatner and Bruce Fraser. The authors place a dual emphasis on efficiency and getting the best quality possible out of Photoshop. You'll learn everything you need to know about color management, getting great scans, tonal and color correction, prepress and the Web, and working with Photoshop selections and silhouettes. Real World Adobe Photoshop 7 is copiously illustrated with completely revised screenshots and loaded with time-saving tips and shortcuts that will not only allow you to produce better results, but to do so faster than you ever thought possible.
A Comparison of Multiprocessor Scheduling Heuristics
Authors: A. A. Khan, C. L. McCreary, M. S. Jones
Venue:  (1994)

Many algorithms for scheduling DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is an NP-hard problem, no exact tractible algorithm exists, and no baseline is available from which to compare the resulting schedules. Furthermore, performance guarantees have been found for only a few simple DAGs. This paper is an attempt to quantify the differences in five of the heuristics. Classification criteria are defined for the DAGs, and the differences between the heuristics are noted for various criteria. The comparison is made between a graph based method, two critical path methods, and two list scheduling heuristics. The empirical performance of the five heuristics is compared when they are applied to the randomly generated DAGs.
Making Nondeterminism Unambiguous
Authors: Klaus Reinhardt, Eric Allender
Venue:  (1997)

We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly = UL/poly LogCFL/poly = UAuxPDA(log n, poly)/poly
Relating STDP to BCM
Authors: Eugene M. Izhikevich, Niraj S. Desai
Venue: Neural Computation (2003)

We demonstrate that the BCM learning rule follows directly from STDP when pre- and postsynaptic neurons fire uncorrelated or weakly correlated Poisson spike trains, and only nearest-neighbor spike interactions are taken into account.
A data model for autonomous objects
Authors: Johan F.P. Akker, Arno P.J.M. Siebes
Venue:  (1995)

Developments in distribution and networking of computing power raise questions about the feasibility of centralised control in an information system. At the same time the move towards information systems ranging over a number of different organisations brings us systems where central control is not desired. This asks for systems built of components that can function independently under local control only. A move towards autonomous components can also clearly be seen in the area of active databases. Rules are seen as part of the behaviour of objects or relations between objects. Following the encapsulation principle, this leads to encapsulation of all rules with objects. The definition of such an object is independent of other objects. To support these developments we defined the data model for autonomous objects proposed in this report. An autonomous object is an object with its own thread of control. The behaviour of an autonomous object is defined by methods, rules and dynamic constraints. The latter two refer to the complete history kept with the object. The semantics of a relation between objects is captured in relation objects. This enables us to represent arbitrary complex conditions on initiating and terminating relations and to have arbitrary actions taken on certain events. Dependent on the relations an object has, its capabilities will evolve. This is achieved through addons. An addon defines capabilities an object can be, temporarily, extended with. Structure is brought into the mass of objects at the instance level through the objects at the class level. Class objects occur for all object classes, relation object classes and addons. Their function as an object container enables the approach of groups of objects, for example for queries.
Interactive Multi-Marker Calibration for Augmented Reality Applications
Authors: Gregory Baratoff, Alexander Neubeck, Holger Regenbrecht
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Industrial Augmented Reality (AR) applications require fast, robust, and precise tracking. In environments where conventional high-end tracking systems cannot be applied for certain reasons, marker-based tracking can be used with success as a substitute if care is taken about (1) calibration and (2) run-time tracking fidelity. In out-of-the-laboratory environments multi-marker tracking is needed because the pose estimated from a single marker is not stable enough. The overall pose estimation can be dramatically improved by fusing information from several markers fixed relative to each other compared to a single marker only. To achieveresults applicable in an industrial context relative marker poses need to be properly calibrated. We propose a semi-automatic image-based calibration method requiring only minimal interaction within the workflow. Our method can be used off-line, or preferably incrementally online. When used online, our method shows reasonably good accuracy and convergence with workflow interruption of less than one second per incremental step. Thus, it can be interactively used. We illustrate our method with an industrial application scenario.
Perturbation Methods for Image Synthesis
Authors: Min Chen
Venue:  (1999)

This thesis presents new mathematical and computational tools for applying perturbation methods to image synthesis. The key idea is to characterize families of closely related optical paths by expanding a given path into a high-dimensional Taylor series. Our methods are based on the closed-form expressions for linear and higher-order approximations of specularly reflected rays of light, which are derived from the Implicit Function Theorem and Fermat''s Variation Principle. The expressions hold for general multiple-bounce specular paths and provide a mathematical foundation for exploiting path coherence in incremental rendering. To illustrate their use, new algorithms based on the perturbation formulas are developed for several applications, including fast approximation of specular reflections on curved surface and direct caustic contour generation. First, path Jacobians are introduced to formulate the linear perturbation of a ray path connecting a fixed point and a perturbed point through any number of intermediate reflection points. These Jacobian matrices are the derivatives of the reflection points with respect to the perturbed endpoint. A recurrence relation is derived to compute the closed-form expressions of path Jacobians for a general multiple-bounce reflection path, even when the new reflection path cannot be expressed in a closed form. Next, the concept of path Jacobian is generalized to tensors of third order, which we call path Hessians. A simiar recurrence formula for path Hessians is derived from tensor calculus. The expressions for path Jacobians and path Hessians hold for any reflection path involving implicitly-defined reflective surfaces. Based on the close-form expressions for the path Jacobian and the path Hessian, a reflection path can be expanded as a Taylor series up to the second order. This perturbation formula gives rise to a fast and accurate interpolation scheme for the unknown reflection paths nearby. Finally, new algorithms are presented for some applications that will benefit from our perturbation method. In one application, a new approach is presented for interactively approximating specular reflections in arbitrary curved surfaces. The technique is quite general as it employs local perturbations to interpolate point samples and is applicable to any smooth implicitly-defined reflecting surface that is equipped with a ray-intersection procedure. After ray tracing a sparse set of reflection paths with respect to a given vantage point and static reflecting surfaces, the algorithm rapidly approximates reflections of arbitrary points in 3-space by expressing them as perturbations of nearby points with known reflections. The reflection of each new point is approximated to second-order accuracy using the Taylor expansions of one or more nearby reflection paths. After preprocessing, the approach is fast and accurate enough to compute specular reflections of tessellated objects in arbitrary curved surfaces at interactive rat
Domino System Administration, 2 edition
Authors: Rob Kirkland, Dorothy Burke
Venue:  (2003)

:Need a concise, practical explanation about the new features of Domino, and how to make some of the advanced stuff really work? You need answers and solutions from someone who's been in the trenches. You want information from someone like you, who has worked with the product for years, and understands what it is you need to know. Domino System Administration from New Riders is the answer-the first book on Domino that attacks the technology at the professional level, with practical, hands-on assistance to get Domino 5 running in your organization.
An Optimized Dependence Convex Hull Partitioning Technique to Maximize Parallelism of Nested Loops with Non-Uniform Dependences
Authors: Der-Lin Pean, Guan-Joe Lai, Cheng Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

There are many methods existing for nested loop partitioning; however, most of them perform poorly when partitioning loops with non-uniform dependences. This paper proposes a generalized and optimized loop partitioning mechanism to exploit parallelism from nested loops with non-uniform dependences. Our approach based on the dependence convex theory will divide the loop into variable size partitions. Furthermore, the proposed algorithm partitions a nested loop by using the copy-renaming and the optimized partitioning techniques to minimize the number of parallel regions of the iteration space, outperforming the other previous partition mechanisms of nested loops with nonuniform dependences.
Fast merging and sorting on a partitioned optical passive stars network
Authors: Amitava Datta, Subbiah Soundaralakshmi
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

We present fast algorithms for merging and sorting of data on a multiprocessor system connected through a Partitioned Optical Passive Stars (POPS) network. In a POPS(d,g) network there are n = dg processors and they are divided into g groups of d processors each. There is an optical passive star (OPS) coupler between every pair of groups. Each OPS Coupler can receive an optical signal from any one of its source nodes and broadcast the signal to all the destination nodes. The time needed to perform this receive and broadcast is referred to as a slot and the complexity of an algorithm using the POPS network is measured in terms of number of slots it uses. Our sorting algorithm is more efficient compared to a simulated hypercube sorting algorithm on the POPS.
Optimization in Identification of Logical-Probabilistic Risk Models
Authors: A. V. Rybakov, E. D. Solozhentsev
Venue: Automation and Remote Control (2003)

Identification of logical-probabilistic risk models with groups of incompatible events is investigated by the random search method. The integral multi-extremal multi-parametric aim function of the optimization problem in investigated as a function of the number of optimizations, maximal and minimal amplitudes of increments of parameters, initial value of the aim function, choice of identical or different amplitudes of increments for different parameters, and risk distribution. An effective method for finding the global extremum in identifying a logical-probabilistic risk model within reasonable computation time is developed.
A Distributed Network Connectivity Algorithm
Authors: Elias Procópio Duarte Jr., Andréa Weber
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The Distributed Network Connectivity algorithm allows every node in a general topology network to determine which portions of the network are reachable and unreachable. The algorithm consist of three phases: test, dissemination, and connectivity computation. During the testing phase each link is tested by one of the adjacent nodes at alternating testing intervals. Upon the detection of a new unresponsive link, the tester starts the dissemination phase, in which a distributed breadth-first tree is employed to inform the other connected nodes about the event. At any time, any working node may run the third phase, in which a graph connectivity algorithm shows the network connectivity. We prove bounds on the worst case latency of the algorithm. Simulation results of the dissemination of one event are presented for a number of network topologies, and compared to other algorithms.
Flash MX Web Video Creativity
Authors: Murat Bodur, Hoss Gifford, Neal Boyd, Sorenson Media
Venue:  (2003)

:The Flash MX video object is a wondrous thing, but 90% of people seem to be happy keeping it constrained in a small, square window. Why? Video can be anything that you want it to be, and then some. The experiments in this book will take you through simple video manipulation, kaleidoscopes, emulating TV effects, 360-degree displays, animating vectors over film, dynamic masking, fake blue-screening, blur and focus, combining video with the Comms Server, and much more.But it's not just for fun. As the world turns broadband, video becomes a more and more obvious choice for content delivery. This is where the web goes another stage further than passive TV though, Flash allows video to be truly interactive and grab viewer imagination. In this fickle world, no-one's going to sit still for very long to watch videos play straight across their desktop. So, now's the time to get inspired by some of the hottest designers around, and see what is possible when it comes to adding a twist of creativity to the mix. This book is about learning key skills without realizing it, and producing fantastic results. All of the assets and FLAs needed to recreate the effects are on the CD that ships with the book.
Logics of Programs
Authors: Dexter Kozen, Jerzy Tiuryn
Venue:  (1989)

None Available
Analyzing Internal-Switching Induced Simultaneous Switching Noise
Authors: Li Yang, J. S. Yuan
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The internal-switching induced simultaneousswitching noise (SSN) is studied in the paper. Unlikeground bounce caused by driving off-chip loading, bothpower-rail and ground-rail wire/pin impedances areimportant in evaluating internal SSN, and the doublenegative feedback mechanism should be accounted for.Based on the lumped-model analysis and taking intoaccount the parasitic effects and velocity-saturation effectof MOS transistors, a novel analytical model is developedwhich includes both switching and non-switching gates.The proposed model is employed to analyze on-chipdecoupling capacitance, wire/pin inductance effect andloading effect analytically. Good agreements with SPICEsimulations are obtained for submicron technology.
Monopoly and Oligopoly Led by an Invisible Hand
Authors: Tamotsu Onozaki, Tatsuo Yanagita
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

A simple virtual market economy is simulated, and the emergence of monopoly or oligopoly as a result of competition is shown.which traditional microeconomics fails to explain because it essentially lacks a dynamical structure.The model contains many consumers and producers, who are boundedly rational in thesense that they face the information limit and cannot calculate the optimum consumption orproduction.Therefore, they behave habitually or adaptively.Only a single commodity isproduced and purchased, but there is the product differentiation that is described in the formof a consumer's habituation.A consumer has her favorite product and she always comparesits price with a price of another product.She purchases her favorite commodities unless itsprice is too higher than another's.A producer produces and sets a price on commodities so as to chase higher profit, not to maximize them.This profit-chasing behavior is described by the aid of the hill-climbing method: a producer revises his production and price to the directionwhere profit becomes higher.Monopoly or oligopoly emerges according to two key parameters, i.e., the robustness of consumer's habit and the inertia of producer's revision.