ppxscal/embedding_network huggingface dataset:
Virtual Vintage
Authors: Linda Lindroth, Deborah Newell Tornello
Venue:  (2002)

:Vintage clothing has never been more chic, with everyone from celebrity trendsetters to style-conscious professionals searching for wearable treasures from the past. Virtual Vintage is the first and only guide that helps both the novice and the fashion connoisseur evaluate and confidently participate in the thriving vintage marketplace that exists online. No other book explains how to get it, sell it, fix it, or wear it with flair. Authors Linda Lindroth and Deborah Newell Tornello equip readers from head to toe with more than 100 chic sitesrated and evaluated instructions on contacting sellers  smart strategies for bidding in online auctions advice about evaluating the size, quality, and colors of a garment tips for cleaning and repairing vintage items Whether you're looking for a 1960s Rudi Gernreich knit, Gucci hipster trousers, a Claire McCardell for Townley shirtwaist, or a Chanel suit in pink wool with black patent-leather trim, Virtual Vintage will help you build a unique and sensational wardrobe.From the Trade Paperback edition.
Flash for Film and Video
Authors: Paley
Venue:  (2003)

:You might not know this, but with a little ingenuity you can use Macromedia Flash to create high-quality, low-cost animated films or to easily add animated titles and motion graphics to your film and video projects. While most books covering Macromedia Flash MX focus on how to use the program for the Web, Flash for Film and Video sets itself apart by targeting animators and film and video editors looking for an alternative to expensive, complicated professional animation software. You won't learn about HTML, ActionScripting, or other topics of interest to Web designers; you will, however, get detailed explanations of video standards and formats, animating to sound, and using Flash in combination with Apple Final Cut Pro, Adobe After Effects, Photoshop, and other graphics software. You'll also get tips and tutorials on squeezing the most out of Flash artistically with instructions on inking digitally in Flash, inking and painting in Photoshop, creating traditional animation looks in Flash, and more. Plus, a companion CD-ROM includes inspirational video clips created using the techniques in this book so you can see just what you can do with Flash. Whether you use it as a start-to-finish filmmaking tutorial or simply keep it handy as a valuable desk reference, this unique guide to Flash has information you won't find anywhere else. 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
Synchronization of finite automata: contributions to an old problem
Authors: Arto Salomaa
Venue: The essence of computation: complexity, analysis, transformation (2002)

In spite of its simple formulation, the problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the general framework of a composition theory for functions over a finite domain N with n elements. The notion of depth introduced in this connection is a good indication of the complexity of a given function, namely, the complexity with respect to the length of composition sequences in terms of functions belonging to a basic set. Our results show that the depth may vary considerably with the target function. We also establish criteria about the reachability of some target functions, notably constants. Properties of n such as primality or being a power of 2 turn out to be important, independently of the semantic interpretation. Most of the questions about depth, as well as about the comparison of different notions of depth, remain open. Our results show that the study of functions of several variables may shed light also to the case where all functions considered are unary.
Evaluating Using Animation to Improve Understanding of Sequence Diagrams
Authors: Elizabeth Burd, Dawn Overy, Ady Wheetman
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

This paper describes an experiment whereby the benefit of using animation to improve thecomprehensibility of UML sequence diagrams is assessed. The paper hypothesizes that through animation the control flow of sequence diagram will become more evident. The development a system that seeks to enable stakeholders to better interpret UML modeling behaviour is described. This system aims to provide dynamic visualization through the use ofanimation techniques. A study to evaluate the extent to which the animation of a diagram can aid its interpretation is then described. The results of the study show that the animation system did improve the comprehensibility of the sequence diagram control flow thus improving the comprehensibility when compared to the comprehensibility of a traditional static representation. Finally, this paper discusses the reasoning for these results.
New DFM Approach Abstracts AltPSM Lithography Requirements for sub-100nm IC Design Domains
Authors: Pradiptya Ghosh, Chung-shin Kang, Michael Sanie, David Pinto
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Since the semiconductor industry hit the 0.18-microngeneration, device feature sizes have become increasinglysmaller than the wavelength of light used by availableoptical-lithography equipment. In this subwavelengtharena, manufacturing requirements must be handled upfront in the IC design stage-while changes can still bemade-to enhance quality and yield. This paper definesthe components needed to get clean alternating phase-shiftingmasks (altPSM) that ensure the manufacturabilityof subwavelength circuit designs. The authors present anew design for manufacturability (DFM) approach,creating an abstract set of rules that can be used toadvantage in various IC CAD tool domains, especially for100nm and below design rules. A new methodology andalgorithm are presented that can quickly and easilyintegrate altPSM into existing and future tools earlier inthe IC design flow. Finally, experimental results showhow the methodology and algorithm is used to debugprocess-aware designs and make them altPSM-compliant.
Describing interactions between MSC components: the MSC connectors
Authors: Peter Graubmann
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The description of the interactions between components play a prominent role in today's compositional system development strategies. In particular, system family engineering focuses on the description and evolution of interfaces. The communication between the parts of a system, (that is, its components) follows interaction patterns that are expressed in the component-oriented world as software connectors. Message sequence charts (MSCs) are well suited to provide the adequate descriptions for both components and connectors. However, a few new language constructs are required to achieve an adequate description of the component communication. The syntax of these constructs is presented here, together with a brief discussion of their semantics. The interaction of MSC components via an MSC connector is defined by matching the component and connector interface descriptions, based upon a partitioning of the component environment. MSC connectors may be considered as a high-level message construct for the refinement of the communication behaviour, a construct which is still missing in the MSC language. The concepts, originally derived from system family and component oriented software engineering, turn out to be useful as well for interaction abstractions between the smaller MSC language constructs such as operator expressions or plain instances, thus providing a uniform approach to the abstraction of communication features in the MSC language.
Automatic Software Generation in the OORHS Distributed Computing Framework
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Software generation in the OORHS (object-oriented reciprocative hypercomputing system) is user-transparent. It addresses the issue of ease of use by minimizing the number of steps leading to a programming solution. The OORHS requires from the user only a highlevel APPL program, which is, in effect, a specification. For every APPL program, the system automatically performs all the necessary distributed computing steps. The precompiler, based on the object-oriented paradigm, instantiates the encapsulated program objects embedded in an APPL program. These program objects are distributed at the source level. They are compiled and then executed at the allocated sites. This unique approach, known as local compilation, eliminates the need to store the compilers used by other machines locally. It enhances the compatibility between the compiled program and the host processor. The precompiler generates a program objects dictionary for every APPL program. The contents in the dictionary facilitate program visualization.
The Stability of Classifications of Binary Attribute Data
Authors: D. M. Jackson
Venue:  (1970)

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
Single and bulk updates in stratified trees: an amortized and worst-case analysis
Authors: Eljas Soisalon-Soininen, Peter Widmayer
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Stratified trees form a family of classes of search trees of special interest because of their generality: they include symmetric binary B-trees, half-balanced trees, and red-black trees, among others. Moreover, stratified trees can be used as a basis for relaxed rebalancing in a very elegant way. The purpose of this paper is to study the rebalancing cost of stratified trees after update operations. The operations considered are the usual insert and delete operations and also bulk insertion, in which a number of keys are inserted into the same place in the tree. Our results indicate that when insertions, deletions, and bulk insertions are applied in an arbitrary order, the amortized rebalancing cost for single insertions and deletions is constant, and for bulk insertions O(logm), where m is the size of the bulk. The latter is also a bound on the structural changes due to a bulk insertion in the worst case.
Online Collaborative Learning: Theory and Practice
Authors: Tim S. Roberts
Venue:  (2003)

Online Collaborative Learning: Theory and Practice provides a resource for researchers and practitioners in the area of online collaborative learning (also known as CSCL, computer-supported collaborative learning), particularly those working within a tertiary education environment. It includes articles of relevance to those interested in both theory and practice in this area. It attempts to answer such important current questions as: how can groups with shared goals work collaboratively using the new technologies? What problems can be expected, and what are the benefits? In what ways does online group work differ from face-to-face group work? And what implications are there for both educators and students seeking to work in this area?
Developing multimodal intelligent affective interfaces for tele-home health care
Authors: C. Lisetti, F. Nasoz, C. LeRouge, O. Ozyer, K. Alvarez
Venue: International Journal of Human-Computer Studies (2003)

Accounting for a patient's emotional state is integral in medical care. Tele-health research attests to the challenge clinicians must overcome in assessing patient emotional state when modalities are limited (J. Adv. Nurs. 36(5) 668). The extra effort involved in addressing this challenge requires attention, skill, and time. Large caseloads may not afford tele-home health-care (tele-HHC) clinicians the time and focus necessary to accurately assess emotional states and trends. Unstructured interviews with experienced tele-HHC providers support the introduction of objective indicators of patients' emotional status in a useful form to enhance patient care. We discuss our contribution to addressing this challenge, which involves building user models not only of the physical characteristics of users--in our case patients--but also models of their emotions. We explain our research in progress on Affective Computing for tele-HHC applications, which includes: developing a system architecture for monitoring and responding to human multimodal affect and emotions via multimedia and empathetic avatars; mapping of physiological signals to emotions and synthesizing the patient's affective information for the health-care provider. Our results using a wireless non-invasive wearable computer to collect physiological signals and mapping these to emotional states show the feasibility of our approach, for which we lastly discuss the future research issues that we have identified.
Minimizing Unconstrained Fuzzy Functions
Authors: K. D Jamison, Weldon A. Lodwick
Venue:  (1996)

In this paper we introduce a definition for a fuzzy function as a possibility distribution over the set of all functions with certain properties. We then examine some of the implications of this definition. In particular, we show that the image of a fuzzy functions is a fuzzy vector (as defined herein). We also show that the set of values at which a real valued fuzzy function achieves its minimum is a fuzzy number and if the fuzzy function is convex, in a particular sense, then the set of vectors for which the function achieves the minimum values is connected. Lastly we discuss minimization of an unconstrained fuzzy function and how one might proceed to defuzzify the solution.
A Transparent Light-Weight Group Service
Authors: Lu Rodrigues, Katherine Guo, Antonio Sargento, Robbert van Renesse, Brad Glade, Paulo Ver\''{\i}ssimo, Ken Birman
Venue:  (1996)

Virtual synchrony, also known as view synchrony, has proven to be a powerful paradigm to build distributed applications. Informally, virtual synchrony provides to each process group membership information in the form of {\em views} and guarantees that all processes that install a given view have delivered the same set of messages from the previous view. Implementations of virtual synchrony usually require the use of failure detectors and failure recovery protocols. There is a range of applications that require the use of a large number of groups with the same membership. In such applications, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps user groups into instances of a virtually synchronous implementation is called a Light-Weight Group Service. This paper proposes a new design for the Light-Weight Group Service protocols that circumvents some of the limitations of previous approaches. As a test case, the new protocols were implemented in the Horus system, although the underlying principles can be applied to other architectures as well. The paper also presents performance results from this implementation.
Parallel Computing - Advances and Current Issues: Proceedings of the International Conference, Parco 2001
Authors: Gerhard R. Joubert, M. Vanneschi, F. J. Peters, A. Murli
Venue:  (2002)

:The near future will see the increased use of parallel computing technologies at all levels of mainstream computing. Computer hardware increasingly employs parallel techniques to improve computing power for the solution of large scale and computer intensive applications. Cluster and grid technologies make possible high speed computing facilities at vastly reduced costs.These developments can be expected to result in the extended use of all types of parallel computers in virtually all areas of human endeavour. Computer intensive problems in emerging areas such as financial modelling, data mining and multimedia systems, in addition to traditional application areas of parallel computing such as scientific computing and simulation, will lead to further progress. Parallel computing as a field of scientific research and development has already become one of the fundamental computing technologies.This book gives an overview of new developments in parallel computing at the start of the 21st century, as well as a perspective on future developments.
Generating neural networks through the induction of threshold logic unit trees
Authors: M. Sahami
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

This paper investigates the generation of neural networks through the induction of binary trees of threshold logic units (TLUs). Initially, we describe the framework for our tree construction algorithm and show how it helps to bridge the gap between pure connectionist (neural network) and symbolic (decision tree) paradigms. We also show how the trees of threshold units that we induce can be transformed into an isomorphic neural network topology. Several methods for learning the linear discriminant functions at each node of the tree structure are examined and shown to produce accuracy results that are comparable to classical information theoretic methods for constructing decision trees (which use single feature tests at each node), but produce trees that are smaller and thus easier to understand. Moreover, our results also show that it is possible to simultaneously learn both the topology and weight settings of a neural network simply using the training data set that we are initially given.
The Block Jacobi Method for Computing the Singular Value Decomposition
Authors: Charles Van Loan
Venue:  (1985)

Jacobi techniques for computing the symmetric eigenvalue and singular value decompositions have achieved recent prominence because of interest in parallel computation. They are ideally suited for certain multiprocessor systems having processors that are connected in nearest neighbor fashion. If the processors are reasonably powerful and have significant local memory, then block Jacobi procedures are attractive because they render a more favorable computation to communication ratio. This paper examines some of the practical details associated with two block Jacobi methods for the singular value decomposition. The methods differ in how the 2-by-2 subproblems are solved.
Coalition formation in proportionally fair divisible auctions
Authors: Rajiv T. Maheswaran, Tamer Baçar
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

One method for agents to improve their performance is to form coalitions with other agents. One reason why this might occur is because different agents could have been created by the same owner so an incentive to cooperate naturally exists. Competing agents can also choose to coordinate their actions when there is a mutually beneficial result. The emergence and effects of cooperation depend on the structure of the game being played. In this paper, we study a proportionally fair divisible auction to manage agents bidding for service from network and computational resources. We first show that cooperation is a dominant strategy against any fixed level of competition. We then investigate whether collusion can undermine a noncooperative equilibrium solution, i.e. allow an agent priced out of the noncooperative game to enter the game by teaming with other agents. We are able to show that agents not receiving service after a bid equilibrium is reached cannot obtain service by forming coalitions. However, cooperation does allow the possibility that agents with positive allocations can improve their performance. To know whether or not to cooperate with another agent, one must devise a way of assigning a value to every coalition. In classical cooperative game theory, the value of a team is the total utility of the team under the worst case response of all other agents, as a coalition is viewed as a threat by the remaining agents. We show that this analysis is not appropriate in our case. The formation of a coalition under a proportionally fair divisible auction improves the performance of those outside the coalition. This then creates an incentive structure where team play is encouraged.
Information fusion in biometrics
Authors: Arun Ross, Anil Jain
Venue: Pattern Recognition Letters (2003)

User verification systems that use a single biometric indicator often have to contend with noisy sensor data, restricted degrees of freedom, non-universality of the biometric trait and unacceptable error rates. Attempting to improve the performance of individual matchers in such situations may not prove to be effective because of these inherent problems. Multibiometric systems seek to alleviate some of these drawbacks by providing multiple evidences of the same identity. These systems help achieve an increase in performance that may not be possible using a single biometric indicator. Further, multibiometric systems provide anti-spoofing measures by making it difficult for an intruder to spoof multiple biometric traits simultaneously. However, an effective fusion scheme is necessary to combine the information presented by multiple domain experts. This paper addresses the problem of information fusion in biometric verification systems by combining information at the matching score level. Experimental results on combining three biometric modalities (face, fingerprint and hand geometry) are presented.
User's View of the Internet
Authors: Harry Bruce
Venue:  (2002)

:The User's View of the Internet provides the first comprehensive analysis of public access to the Internet. It considers the evolution of the Internet through the lens of use and usings. It will appeal to Internet stakeholders who need to know more about the impact of the network on their audience, market, clients, users, or constituencies. These stakeholders include business, government, Internet service providers, digital service/product developers, librarians, media and publishing professionals, educators, academics, and students.