ppxscal/embedding_network huggingface dataset:
Adobe Photoshop Elements 2.0 Idea Kit
Authors: Lisa Matthews
Venue:  (2002)

:With the arrival of Photoshop Elements came a number of books aimed at helping the digital photo enthusiast get the most out of the Adobe's slimmer Photoshop cousin. Adobe Photoshop Elements Idea Kit adds a unique twist to the melange: It steps readers through the processes of creating special effects and fixing problems in digital images and then hones in on how to use those images to easily create a variety of professional-looking projects. Hobbyists who want to make the most out of their snapshots to create a postcard, flyer, or personal Web page, as well as business users who need to create slide presentations, a customized Web gallery, or custom CD and video covers will find that Adobe Photoshop Elements Idea Kit is their newest best friend. Working templates of each project are included on the CD-ROM, making it easy to produce polished finished projects. The book begins by stepping readers through the basics of image correction, including how to color images by hand and add borders, and then moves on to basic layout strategies for a number of projects: using photographs in newsletters, creating flyers, posters, postcards, and more. The latter part of the book focuses on more complex layout projects such as slide presentations, Web pages and banners, and more. For anyone who wants or needs to produce creative digital-image projects without reinventing the wheel. 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
Integrating Task and Data Parallelism
Authors: Berna Massingill
Venue:  (1993)

Many models of concurrency and concurrent programming have been proposed; most can be categorized as either task-parallel (based on functional decomposition) or data-parallel (based on data decomposition). Task-parallel models are most effective for expressing irregular computations; data-parallel models are most effective for expressing regular computations. Some computations, however, exhibit both regular and irregular aspects. For such computations, a better programming model is one that integrates task and data parallelism. This report describes one model of integrating task and data parallelism, some problem classes for which it is effective, and a prototype implementation.
Problems and Deficiencies of UML as a Requirements Specification Language
Authors: Martin Glinz
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

In recent years, UML has become a standard language for modeling software requirements and design. In this paper, we investigate the suitability of UML as a semiformal requirements specification language. Using the Teleservices and Remote Medical Care (TRMCS) case study as an example, we identify and demonstrate various problems and deficiencies of UML, particularly concerning use case models and system decomposition. We also investigate whether and how the deficiencies can be overcome and how potential alternatives could look.
DRS: A Fault Tolerant Network Routing System for Mission Critical Distributed Applications
Authors: A. Chowdhury, O. Frieder, D. Grossman, E. Burger
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We present a novel proactive routing algorithm that consistently searches for failures via frequent ICMP echo requests. Our algorithm differs from its predecessors in that it is proactive instead of reactive by looking for failures before they affect message transmissions. When a failure is detected, an alternative route is identified and used. A leading telecommunications company currently deploys our algorithm. In production use, the net result has improved availability by a 13% increase.
Using TILCO for Specifying Real-Time Systems
Authors: Riccardo Mattolini, Paolo Nesi
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The Temporal Interval Logic with Compositional Operators (TILCO) has been especially designed for the specification and validation of real-time systems. TILCO extends the classical temporal logics based on the operators eventually, and henceforth by using time intervals in order to allow the specification of both qualitative and quantitative temporal relationships. The use of time intervals also supports an abstract and synthetic style for specifying real-time systems. The validation of TILCO specifications are supported by means of property proving; direct execution of specifications and model-checking of system histories are also possible. Therefore, TILCO model can be considered as a dual approach. This paper describes TILCO and shows with an example its application for the specification and validation of real-time systems. Highlights about the TILCO axiomatization and the tools available for proving properties of specifications and for specifications execution are given.
On extracting static semantics
Authors: John Hannan
Venue: The essence of computation: complexity, analysis, transformation (2002)

We examine the problem of automatically extracting a static semantics from a language's semantic definition. Traditional approaches require manual construction of static and dynamic semantics, followed by a proof that the two are consistent. As languages become more complex, the static analyses also become more complex, and consistency proofs have typically been challenging. We need to find techniques for automatically constructing static analyses that are provably correct. We study the issues of developing such techniques and propose avenues of research in this area. We find that significant advances are required before realizing the practical extraction of static semantics from language definitions.
Finding Convex Sets in Convex Position
Authors: Geza Toth
Venue:  (1998)

Let ${\cal F}$ denote a family of pairwise disjoint convex sets in the plane. ${\cal F}$ is said to be in {\em convex position}, if none of its members is contained in the convex hull of the union of the others. For any fixed $k\geq 5$, we give a linear upper bound on $P_k(n)$, the maximum size of a family ${\cal F}$ with the property that any $k$ members of ${\cal F}$ are in convex position, but no $n$ are.
Constrained methods for Neural Networks and Computer Graphics
Authors: John Platt
Venue:  (1989)

Both computer graphics and neural networks are related, in that they model natural phenomena. Physically-based models are used by computer graphics researchers to create realistic, natural animation, and neural models are used by neural network researchers to create new algorithms or new circuits. To exploit successfully these graphical and neural models, engineers want models that fulfill designer-specified goals. These goals are converted into mathematical constraints. This thesis presents constraint methods for computer graphics and neural networks. The mathematical constraint methods modify the differential equations that govern the neural or physically-based models. The constraints methods gradually enforce the constraints exactly. This thesis also describes applications of constrained models to real problems. The first half of this thesis discusses constrained neural networks. The desired models and goals are often converted into constrained optimization problems. These optimization problems are solved using first-orderdifferential equations. There are a series of constraint methods which are applicable to optimization using differential equations: the Penalty Method adds extra terms to the optimization function which penalize violations of constraints, the Differential Multiplier Method adds subsidiary differential equations which estimate Lagrange multipliers to fulfill the constraints gradually and exactly, Rate-Controlled Constraints compute extra terms for the differential equation that force the system to fulfill the constraints exponentially. The applications of constrained neural networks include the creation of constrained circuits, error-correcting codes, symmetric edge detection for computer vision, and heuristics for the traveling salesman problem. The second half of this thesis discusses constrained computer graphics models. In computer graphics, the desired models and goals become constrained mechanical systems, which are typically simulated with second-order differential equations. The Penalty Method adds springs to the mechanical system to penalize violations of the constraints. Rate-Controlled Constraints add forces and impulses to the mechanical system to fulfill the constraints with critically damped motion. Constrained computer graphics models can be used to make deformable physically-based models follow the directives of a animator.
Index Fund Portfolio Selection by Using GA
Authors: Yasuhiro Orito, Genji Yamazaki
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

It is well known that an index fund portfolio is useful for the risk hedge of investmentThe portfolio consists of M-company (called brand) stocks and its price as a function oftime traces the stock price index in the market From a practical viewpoint it is desiredthat M-company is smaller and the correlation between the portfolio price and stock priceindex included in the portfolio is higher.The correlation is called the contribution rate inthis paper Suppose that there are some portfolio that the contribution rate are greater thana fixed level.Then we select the portfolio that minimizes its own risk in the portfolio.Themain purpose of this paper is to find such a portfolio by using genetic algorithm (called GA).We present some numeric al examples that demonstrate the usefulness of GA.We show that GA works well for finding such portfolios
The complexity of planning with partially-observable Markov decision processes
Authors: Martin Mundhenk
Venue:  (2000)

This work surveys results on the complexity of planning under uncertainty. The planning model considered is the partially-observable Markov decision process. The general planning problems are, given such a process, (a) to calculate its performance under a given control policy, (b) to find an optimal or approximate optimal control policy, and (c) to decide whether a good policy exists. The complexity of this and related problems depend on a variety of factors, including the observability of the process state, the compactness of the process representation, the type of policy, or even the number of actions relative to the number of states. In most cases, the problem can be shown to be complete for some known complexity class. The skeleton of this survey are results from Littman, Goldsmith and Mundhenk (Journal of Artificial Intelligence Research 1998), Mundhenk (Mathematics of Operations Research 2000), Mundhenk, Goldsmith, Lusena and Allender (Journal of the ACM 2000), and Lusena, Goldsmith and Mundhenk (University of KY CS TR). But there are also some news.
Comparison Theorems for Weak Splittings of Bounded Operators
Authors: Ivo Marek, B D Szyld
Venue:  (1989)

Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wo\''{z}nicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons.
List Ranking and List Scan on the CRAY C-90
Authors: Margaret Reid-Miller, Guy E. Blelloch
Venue:  (1994)

List ranking and list scan are two primitive operations used in many parallel algorithms that use list, trees, and graph data structures. But vectorizing and parallelizing list ranking is a challenge because it is highly communication intensive and dynamic. In addition, the serial algorithm is very simple and has very small constants. In order to compete a parallel algorithm must also be simple and have small constants. A parallel algorithm due to Wyllie is such an algorithm, but it is not work efficient --- its performance degrades for longer and longer linked lists. In contrast, work efficient PRAM algorithms developed to date have very large constants. We introduce a new fully vectorized and parallelized algorithm that both is work efficient and has small constants. However, it does not achieve O(log n) running time. But we contend that work efficiency and small constants is more important, given that vector and multiprocessor machines are used for problems that are much larger than the number of processors and, therefore, the O(log n) time is never achieved in practice. In particular, to the best of our knowledge our implementation of list ranking and list scan on the C@c(RAY) C-90 is the fastest implementation to date. In addition, it is the first implementation of which we are aware that outperforms fast workstations. The success of our algorithm is due to its relatively large grain size and simplicity of the inner loops, and the success of the implementation is due to pipelining reads and writes through vectorization to hide latency, minimizing load balancing by deriving equations for predicting and optimizing performance, and avoiding conditional tests except when load balancing.
Development Peculiarities of Learning Process Monitoring Based on New Information Technologies
Authors: Tatyana G. Kalashnikova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In this paper the approach for solving of learning process support problem by using distance technologies is proposed. The development peculiarities of learning process monitoring and its application in computer-aided learning system are considered.
Extension of hereditary classes with substitutions
Authors: Igor Zverovich
Venue: Discrete Applied Mathematics (2003)

Let G and H be graphs. A substitution of H in G instead of a vertex ν ∈ V(G) is the graph G(ν → H), which consists of disjoint union of H and G - ν with the additional edge-set {xy: x ∈ V(H), y ∈ NG(ν)}.For a hereditary class of graphs P, the substitutional closure of P is defined as the class P* consisting of all graphs which can be obtained from graphs in P by repeated substitutions.Let P be an arbitrary hereditary class for which a characterization in terms of forbidden induced subgraphs is known. We propose a method of constructing forbidden induced subgraphs for P*.
Determining Logical Dependency in a Decision Procedure for Equality
Authors: Dean B. Krafft, Alan J. Demers
Venue:  (1981)

Several existing program verification and automated prooff systems make use of similar decision procedures for equality ([Krafft 1978], [Nelson and Oppen 1977] and [Downey, Sethi and Tarjan 1980]). The general method used by these algorithms has been named congruence closure. Given two expressions on uninterpreted function symbols, a congruence closure algorithm determines whether the expressions can be deduced to be equal from a set of previously asserted equalities. The existing congruence closure algorithms do not provide any indication of which previously asserted equalities were required in the deduction. In this paper, we describe an extension to one version of congruence closure. When two expressions are equal, the new algorithm can provide a certificate of their equality: a list of prevviously asserted equalities from which the queried equality can be deduced. This list is minimal, in the sense that if any equality iss removed from the list, the queried equality can no longer be deduced. The running time to produce the certificate is almost-linear in the size of the list.
The Computing Capacity of Three-Input Multiple-Valued One-Threshold Perceptrons
Authors: Alioune Ngom, Ivan Stojmenovic, Ratko To"ic
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, an exact and general formula is derived for the number of linear partitions of a given subset V subset R3. V can be a multiset and its points can be in any possible configuration. Based on the formula, we obtain a fast algorithm for computing the capacity of three-input k-valued one-threshold perceptrons, for k geq 2.
An Approach for Generating Executable Distributed Applications from Reusable Software Architectures
Authors: H. Gomaa, G. A. Farrukh
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper a reuse-oriented perspective is taken to designing and implementing configurable distributed applications. An application domain is defined as a family of systems that have some features in common and others that differentiate them. During doman modeling, reusable specifications, architectures and component types are developed, which capture the similarities and variations of the family of systems that compose the application domain. Target systems are generated by tailoring the reusable specifications and architectures given the requirements of the target system, and configuring a target system based on the tailored architecture. The paper describes an approach for generating and configuring distributed applications from the domain model and a library of predefined component types.
Applying Logic Neural Networks to Hand-Written Character Recognition Tasks
Authors: G. Tambouratzis
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The subject of this article is the implementation of a Hand-written character recognition task using neural networks. Two logic neural networks - the WISARD [2] and the SOLNN [6] - are compared on the basis of their classification accuracy. The results obtained are compared to these of other researchers, to objectively assess the success of the neural networks in classifying the dataset. 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
On the Triangulation of Convex Polygons Presenting T-Vertices
Authors: Paolo Cignoni, Claudio Montani, Roberto Scopigno
Venue:  (1996)

A technique to triangulate planar convex polygons presenting T{vertices is described. Simple strip or fan tessellation of a polygon with T{vertices can result in zero{area triangles and compromise the rendering process. Our technique splits such a polygon into one triangle strip and, at most, one triangle fan. The utility is particularly useful in multiresolution or adaptive representation of polygonal surfaces and surfaces'' simplication. EMAIL:: r.scopigno@cnuce.cnr.it
An operational semantics for ZCCS
Authors: A. J. Galloway, W. J. Stoddart
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

G. Bruns (1995) has proposed a version of value-passing CCS in which an agent language, based on that proposed by Milner, is augmented with a rich data language. The data language can be used to describe sets, tuples and sequences etc. constructed from integer, Boolean and string constants. Z is a widely used formal specification language in which sets, tuples and sequences can be described, but also additional constructs such as free types and bindings. In addition, Z has a rich structuring mechanism-its schema calculus. Z is frequently used to specify the operations of a system on its state, and has a refinement calculus and formal semantics. This article introduces ZCCS, a version of value-passing CCS in which the data language used to describe the action/agent parameters and conditions is Z. We introduce the style and syntax of ZCCS and illuminate this with a small example. In addition, we present an operational semantics for ZCCS.
The TREC-like evaluation of music IR systems
Authors: J. Stephen Downie
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This poster reports upon the ongoing efforts being made to establish TREC-like and other comprehensive evaluation paradigms within the Music IR (MIR) and Music Digital Library (MDL) research communities. The proposed research tasks are based upon expert opinion garnered from members of the Information Retrieval (IR), MDL and MIR communities with regard to the construction and implementation of scientifically valid evaluation frameworks.
Dome: Distributed Object Migration Environment
Authors: Adam Beguelin, Erik Seligman, Michael Starkey
Venue:  (1994)

Dome is an object based parallel programming environment for heterogeneous distributed networks of machines. This paper gives a brief overview of Dome. We show that Dome programs are easy to write. A description of the load balancing performed in Dome is presented along with performance measurements on a cluster of DEC Alpha workstations connected by a DEC Gigaswitch. A Dome program is compared with a sequential version and one written in PVM. We also present an overview of architecture independent checkpoint and restart in Dome.
Enabling Reuse with a Configuration Language
Authors: Jacqueline Floch, Bjorn Gulla
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Organized reuse of software components have been employed for several decades in Garex, a Norwegian company producing customized voice communication control switch systems. Through a process encouraging reuse a large number of highly parameterized components have been crafted. However, the current manual approach to instantiating and connecting components is very complex and time consuming, and increasing parts of the development costs are spent on this task. Through participation in the PROTEUS project some practical work has been undertaken to assess the use of a configuration language to support system instantiation and evolution. The configuration language allows describing components and systems, their properties and potential variability. By using the powerful intensional mechanisms for system binding and generation provided by the language and its supporting tool set, concise high-level description for system instantiation are achieved.
Transport state handoff in mobile cellular networks
Authors: K. Brown, R. Gopalakrishnan, S. Singh
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We consider the problem of transport state handoff in mobile networks. The problem is motivated by the observation that an efficient way to implement transport connections, where one end is mobile, is to split these connections in two at a node close to the mobile. In such an environment we need to ensure that transport state can be handed off to a new intermediate node if the mobile roams to a location far away from the location where the connection(s) were opened. Our handoff protocols are efficient and we show that they work correctly despite any sequence of moves made by the mobile.