ppxscal/embedding_network huggingface dataset:
Constrained interpolation with rational cubics
Authors: D. S. Meek, B. H. Ong, D. J. Walton
Venue: Computer Aided Geometric Design (2003)

For a given set of ordered points lying on one side of a polyline, the problem of constructing a planar interpolating G2 curve to these planar data which lies on the same side of the polyline as the data is considered. An existing method addresses this problem using rational cubics with multiple lines as constraints and where all the data points lie strictly on one side of these lines. The method presented here extends that method to allow a polyline as a more general constraint where all the data points need not lie on one side of the infinite line through each of its edges. It also allows data points to lie on the constraint polyline. The interpolating curve is shape preserving in the sense that it has the minimal number of inflections consistent with the data.
LTF-C: architecture, training algorithm and applications of new neural classifier
Authors: Marcin Wojnarski
Venue: Fundamenta Informaticae (2002)

This paper presents a new model of an artificial neural network solving classification problems, called Local Transfer Function Classifier (LTF-C). Its architecture is very similar to this of the Radial Basis Function neural network (RBF), however it utilizes an entirely different learning algorithm. This algorithm is composed of four main parts: changing positions of reception fields, changing their sizes, insertion of new hidden neurons and removal of unnecessary ones during the training.The paper presents also results of LTF-C application to three real-life tasks: handwritten digit recognition, credit approval and cancer diagnosis. LTF-C was able to solve each of these problems with better accuracy than most popular classification systems. Moreover, LTF-C was relatively small and fast.
Vectorization of Multiple Small Matrix Problems
Authors: Nikos Pitsianis, Charles V Loan
Venue:  (1994)

Multiple independent matrix problems of very small size appear in a variety of different fields. In this work, we study the implementation of elementary linear algebra subroutines so as to best use vectorizing compilers and vector hardware for multiple small problem instances. We cheek the performance improvement over the single-instance optimized codes on different vector supercomputers. We also describe how to automate the transformation of a singleinstance linear algebra solver into a multiple instance solver
ISIS DOCUMENTATION: RELEASE 1
Authors: Kenneth P. Birman, Thomas A. Joseph, Frank B. Schmuck
Venue:  (1987)

NOT AVAILABLE
Revolutionary Final Cut Pro 3 Upgrade, 1 edition
Authors: Diannah Morgan
Venue:  (2002)

:This book is for you if you're already familiar with Final Cut Pro and need to get going with the sophisticated new features in Final Cut Pro 3. It focuses on what's new and doesn't go over old ground. So no more wasting time on books where only a fraction of the content is for you. Additional support materials available from the publishers website. Please note. If you're completely new to Final Cut Pro then you need a different book. Revolutionary Final Cut Pro 3 from friends of ED DVision is the book you need. Not just an introduction to the software, it's a comprehensive primer in the fundamental techniques of digital video production. Author Biography: Diannah Morgan has been working in and around multimedia for the past decade. She began programming some of the first multimedia applications that used video back in 1992 for AND Communications. Since then she has successfully moved between game programming at Activision to Internet programming for Quarterdeck Office systems and then consulted for some years. She first explored technical writing while on contract at Veritest, an independent quality assurance and hardware compatibility-testing lab. Several years ago Diannah formed a corporation with long time friend and photographer, Robert Gould, called FI Studios, Inc. dedicated to digital video production and post. Diannah has been using Final Cut Pro since version 1.0 in 1999. She is also proficient in Photoshop and After Effects and other visual effects software. She regularly attends both MGLA (Motion Graphics Los Angeles) and LAFCPUG (Los Angeles Final Cut Pro Users Group). She is also a member of IFPWest (Independent Feature Projects West). The first time Diannah saw Final Cut Pro it was love at first sight - she just sat down and started editing as if she'd been working with the program all her life. She fell in love with editing and motion graphics and hasn't looked back since. Diannah has cut an independent feature film, music videos, industrials, documentaries, travel logs, testimonials and demo reels, but her real love is documentaries. Diannah has also had the opportunity to teach Final Cut Pro at Video Symphony in Burbank, California. Last year Diannah was approached by Friends Of Ed to contribute to a book on Final Cut Pro, called Revolutionary Final Cut Pro 2: Digital Film Making. It was so much fun she couldn't wait to write another. Also, look for her product reviews in DV Magazine. Diannah is a strong advocate of Final Cut Pro and is always ready to demystify and educate people on how they can take advantage of this fine application. "Every project presents it's own unique challenges, and I like that." - Diannah Morgan.
On rank functions for heaps
Authors: R. M. Green
Venue: Journal of Combinatorial Theory Series A (2003)

Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in Coxeter groups.
Eve Online: The Second Genesis: Prima's Official Strategy Guide
Authors: Eric Mylonas
Venue:  (2003)

:Your Guide to the Eve Online Galaxy ·Crucial descriptions of the races and starships ·Details on hot mining spots, dangerous locations, trade routes, and more ·Breakdowns of skills and careers ·Tips and tricks to keep your ship flying faster than light ·Learn to navigate your fleet to interstellar success
Minimal Forbidden Graphs for L(2,1)-Colorings
Authors: Fishburn Peter C., Roberts Fred S.
Venue:  (2000)

The span $\lambda(G)$ of a graph G is the smallest k for which G''s vertices can be L(2,1)-colored, i.e., colored with integers in {0,1,...,k} so that adjacent vertices'' colors differ by as least two, and colors of vertices at distance two differ. We study minimal forbidden graphs, graphs with the property that every proper subgraph has smaller span. Fixing the maximum degree, we observe that the first nontrivial case involves minimal forbidden graphs of maximum degree 3 and span 5. We present examples to illustrate the variety of graphs with this property and in particular provide several infinite families of such graphs.
Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Thesis)
Authors: Barry F. Schaudt
Venue:  (1992)

Voronoi diagrams and variants of Voronoi diagrams have been used for many years to model crystal growth. If the boundary of the growing crystals are circular and all the crystals start at the same time and have the same constant growth rate, then the Voronoi diagram is used to model the growth. If the crystals start at different times, the additively weighted Voronoi diagram is used to model the crystal growth. In this thesis, I propose a new type of Voronoi diagram called the multiplicatively weighted crystal growth Voronoi diagram, that can be used to model crystal growth when the crystals have different constant growth rates. In this new model, the distance from a site to a point in its region is measured along a shortest path lying entirely within the region. In the multiplicatively weighted crystal growth Voronoi diagram, a growing crystal (or region) may "wrap around" another site''s region. When a region wraps around, distances from the site are in part measured along the boundary of the two regions, treating one of the regions as an obstacle, rather than along a straight line that passes through the region. The worst case size of the multiplicatively weighted crystal growth Voronoi, diagram is 0(n 2). To construct the diagram, techniques from numerical analysis are used to approximate and to intersect curves described by a system of first order differential equations. Numerical methods to approximated a curve construct a polygonal approximation of the curve. One step of the numerical methods constructs an edge of the polygonal approximation. In the new Voronoi diagram, a step may require 0(n ) constant time operations. Let S be the number of steps required by the numerical method used just to draw the diagram. In the worst case, the algorithm presented in this thesis requires O (n 3) intersection calculations plus O (nS lg S ) time using O (n 3 + S ) space. A variant of this algorithm requires O (n 3) intersection calculations plus O (nS 2 + n 2S ) time using O (n 2) space. Also presented are some variants of the new Voronoi diagram. One of these variants uses a convex polygon distance function. The multiplicatively weighted crystal growth Voronoi diagram using a convex polygon distance function does not require numerical methods to construct.
Analysis of a software product line architecture: an experience report
Authors: Robyn R. Lutz, Gerald C. Gannod
Venue: Journal of Systems and Software (2003)

This paper describes experiences with the architectural specification and tool-assisted architectural analysis of a mission-critical, high-performance software product line. The approach used defines a "good" product line architecture in terms of those quality attributes required by the particular product line under development. Architectures are analyzed against several criteria by both manual and tool-supported methods. The approach described in this paper provides a structured analysis of an existing product line architecture using (1) architecture recovery and specification, (2) architecture evaluation, and (3) model checking of behavior to determine the level of robustness and fault tolerance at the architectural level that are required for all systems in the product line. Results of an application to a software product line of spaceborne telescopes are used to explain the approach and describe lessons learned.
Operational anomalies as a cause of safety-critical requirements evolution
Authors: Robyn R. Lutz, Ines Carmen Mikulski
Venue: Journal of Systems and Software (2003)

This paper reports the results of a small study of requirements changes to the onboard software of seven spacecraft subsequent to launch. Only those requirement changes that resulted from operational (i.e., post-launch) anomalies were of interest here, since the goal was to better understand the relationship between critical anomalies during operations and how safety-critical requirements evolve. The results of the study were surprising in that anomaly-driven requirements changes during operations were rarely due to previous requirements having been incorrect. Instead, changes involved new requirements either (1) for the software to handle rare but high-consequence events or (2) for the software itself to compensate for hardware failures or limitations. The prevalence of new requirements as a result of post-launch anomalies suggests a need for increased requirements-engineering support of maintenance activities in these systems. The results also confirm both the difficulty and the benefits of pursuing requirements completeness, especially in terms of fault tolerance, during development of critical systems.
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
Authors: Andrei Krokhin, Andrei Bulatov, Peter Jeavons
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Many computational problems arising in artificial intelligence,computer science and elsewhere can be representedas constraint satisfaction and optimization problems. In thisshort survey we discuss an approach that is related to thealgebraic component of multiple-valued logic and that hasproved to be very succesful in studying the complexity ofconstraint satisfaction.
Dynamic train-track-bridge interaction on example of the boyne viaduct
Authors: M. Majka, M. Hartnett, C. Bowe, D. O'Dwyer
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper describes the formulation, application and validation of a numerical model used by authors to simulate the dynamic interaction between a train, rail track and bridge. The model was developed to investigate the influence of dynamics effects on the vertical displacements of the Boyne Viaduct, Drogheda, Ireland. Separate models were formulated for bridge, rail track and rolling stock. The spatial lattice structure of the Boyne Viaduct was modelled as an assemblage of three-dimensional beam finite elements. The finite difference method was applied to model the rail track because of its ease of implementation. The two-dimensional rolling stock model consists of lumped masses, springs and dampers and is capable of simulating vertical motions of trains traversing bridges.Contact between wheels and rails was modelled using the Hertzian springs. These springs allow the forces transmitted from the rolling stock to the track to be calculated as a function of time and rail penetration. The connections between track and bridge models are represented by spring elements with stiffness equivalent to sleepers stiffness.The direct time stepping Runge-Kutta method was applied to numerical integration of the system's equations of motion. The method was chosen because of its good accuracy and because it allows the vibrations of particular bridge member to be found.The numerical model was tested on the Boyne Viaduct. The testing involved calculation of vertical displacements, velocities and accelerations of the bridge nodes. In order to validate the model developed by the authors similar to model of the test case was generated using the commercial FEM package ANSYS. Inherent ANSYS contact elements were used to represent wheel-rail contact phenomenon. The full transient dynamic analysis was carried out to establish structure response to a moving train model.Results from both packages were compared and discussed, in particular the discrepancies between these results were considered. Selected results from authors' numerical model were presented.
Deadlock-free software architectures for COM/DCOM applications
Authors: Paola Inverardi, Massimo Tivoli
Venue: Journal of Systems and Software (2003)

Many software projects are based on the integration of independently designed software components that are acquired on the market rather than developed within the project itself. Sometimes interoperability and composition mechanisms provided by component based integration frameworks cannot solve the problem of binary component integration in an automatic way. In this paper we present a technique to allow connectors synthesis for deadlock-free component based architectures [IEEE Proceedings of the 16th ASE, 2001] in the context of COM/DCOM applications. This work also provides guidelines to implement an automatic tool that derives the implementation of routing deadlock-free policies within the connector from the dynamic behavior specification of the COM components. Deadlock is then prevented by inserting the synthesized connector within the system via COM composition mechanisms while letting the system COM servers unmodified. We present a successful application of this technique on the (COM version of the) problem known as "The dining philosophers".
Comparison of the Hopfield scheme to the hybrid of Lagrange and transformation approaches for solving the traveling salesman problem
Authors: K. M. Lau, S. M. Chan, L. Xu
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

A novel scheme, the hybrid of Lagrange and transformation approaches (Hybrid LT), was proposed by Xu (1994) to solve a combinatorial optimization problem. It separates the constraints into linear-constant-sum constraints and binary constraints. The linear-constant-sum constraints are treated by the Lagrange approach while the binary constraints are transformed into penalty or barrier functions. This paper compares the performance of the Hopfield net and the Hybrid LT based on computer simulations in solving the traveling salesman problem (TSP). The experimental results show that the Hybrid LT is superior to the Hopfield net for greater speed of convergence, higher rate of finding valid solutions and shorter paths found.
Multimedia Wireless Networks: Technologies, Standards and QoS
Authors: Aura Ganz, Zvi Ganz, Kitti Wongthavarawat
Venue:  (2003)

:Integrating QoS in wireless multimedia network designDelivering QoS in WLANs, WPANs, WMANs, cellular, and satellite networksCovers every leading current and emerging wireless network standardIntegrate QoS into virtually any multimedia wireless networkFrom entertainment to telephony, emerging wireless systems will make possible a new generation of wireless multimedia applications. To satisfy users, network designers and developers must integrate end-to-end Quality of Service (QoS) support throughout all their underlying networks: WANs, WLANs, WPANs, and "last-mile" WLL or satellite distribution systems. However, wireless network standards typically focus on signaling, leaving crucial QoS issues to implementers. Multimedia Wireless Networks is the first book to help network professionals systematically address QoS in today's most important wireless networks -- and tomorrow's. Why users' wireless multimedia performance requirements will require extensive QoS supportThe fundamentals of QoS -- and how they drive network designWLAN standards from the multimedia network designer's viewpoint: IEEE 802.11, HiperLAN, and HomeRFWireless MANs: introducing the new 802.16 WirelessMAN standardIntegrating QoS into IEEE 802.15 and Bluetooth wireless personal area networksQoS in current and emerging cellular and satellite networks
Programming by Induction
Authors: David Gries
Venue:  (1971)

A technique for creating programs, called programming by induction, is described. The term is used because of the similarity between programming by induction and proving a theorem by induction. 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
Metric Estimation via a Fuzzy Grade-of-Membership Model Applied to Analysis of Business Opportunities
Authors: Bryan G. Talbot, Bruce B. Whitehead, Lisa M. Talbot
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper describes a technique for estimating business opportunity metrics from mixed numeric and categorical type databases by using a fuzzy Grade-of-Membership clusteringmodel. The technique is applied to the problem of opportunity analysis for business decision-making. We propose two metrics called unfamiliarity and follow-on importance. Real business contract data are used to demonstrate the technique. This general approach could be adapted to many other applications where a decision agent needs to assess the value of items from a set of opportunities with respect to a reference set representing its business.
A Formal Description of the Transportation Problem
Authors: Thomas Dean, Lloyd G. Greenwald
Venue:  (1992)

In this paper we provide a compact, formal description for an important class of problems involving the deployment of diverse equipment (e.g planes, ships, trucks) to transport cargo (e.g. personnel and material) throughout large geographical areas for private, government, and military purposes. The problem is particularly interesting for its combination of static and dynamic sources of complexity, and the fact that it allows and in some cases strongly encourages distributed solutions. The merit of this formalization is shown by its application to both understanding the complexities in existing restricted transportation problems and creating new natural restrictions on the general problem. Starting from the general formulation we are able to isolate the static and dynamic sources of complexity in transportation problems and relate them to existing research in computer science and operations research. In addition, we describe techniques for constructing algorithms for the transportation problem with provable performance guarantees.
Symoblic/Numeric Techniques in Modeling and Simulation
Authors: Richard Zippel
Venue:  (1991)

Modeling and simulating collections of physical objects which are subject to a wide variety of physical forces and interactions is exceedingly difficult. The construction of a single simulator capable of dealing with all possible physical processes is completely impractical and, it seems to us, wrong-headed. Instead, we propose to build custom simulators for single, particular collections of physical objects and where pre-specified physical phenomena are involved. For such an approach to be practical, an environment needs to be provided that facilitates the quick construction of these simulators. In this paper we describe the essential features of such an environment and describe in some detail how a general implementation of the weight residual method, one of the more general classes of numerical integration techniques, can be used.
A false-name-proof double auction protocol for arbitrary evaluation values
Authors: Yuko Sakurai, Makoto Yokoo
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We develop a new false-name-proof double auction protocol called the Generalized Threshold Price Double auction (GTPD) protocol. False-name-proofness generalizes strategy-proofness by incorporating the possibility of false-name bids, e.g., bids submitted using multiple e-mail addresses. An existing protocol called TPD protocol is false-name-proof but can handle only the cases where marginal utilities of each agent always decrease, while our new GTPD protocol can handle arbitrary evaluation values. When marginal utilities can increase, some bids cannot be divided into a single unit (e.g., an all-or-nothing bid). Due to the existence of such indivisible bids, meeting supply/demand becomes difficult. Furthermore, a seller/buyer can submit a false-name-bid by pretending to be a potential buyer/seller to manipulate allocations and payments.In the GTPD protocol, the auctioneer is required to absorb the supply-demand imbalance up to a given upper-bound. Also, the GTPD incorporate a new false-name-proof one-sided auction protocol that is guaranteed to sell/buy a certain number of units. Simulation results show that when the threshold price is set appropriately, this protocol can obtain a good social surplus, and the number of absorbed units is much smaller than the given upper-bound.