ppxscal/embedding_network huggingface dataset:
Net Mode: Web Fashion Now
Authors: Laird Borrelli
Venue:  (2002)

:The Internet provides an ideal and ever-expanding medium for high fashion. Unlike so many other products, casualties of recent e-commerce, fashion's primary appeal is fantastical rather than material. It depends on promotion, aspiration, and desire, and the Internet provides full access to pictures and techniques that create fashion's fantasy.Laird Borrelli identifies the sites that are most effective for the established designers, but also those that make an immediate impact from a small or previously nonexistent base. Illustrated with exciting visual sequences throughout, Net Mode crystallizes a complex subject into three main themes:  Fashion Image: Designer sites, from Dior to Lacroix, generate desire through fantasy. Among the most beautifully designed sites on the Web, they often make heavy use of Java and Flash technology, as well as being audio- and video-enhanced.  Fashion Sale: The emphasis here is on cyberboutiques, ranging from Colette in Paris to Something in London, each a stylish Internet reflection of the strengths of their bricks-and-mortar business.  Fashion Talk: Elle, Vogue, and other print magazines have taken up the Internet, but entrepreneurial publishers are also using low-cost sites to establish new ways of communicating fashionhigh speed, picture heavy, with abundant, frequently updated visual information. This lively and beautifully designed survey provides vital and informative analysis for anyone in the fashion world, anyone interested in fashion, or anyone involvedcommercially or creativelywith the Internet. 550 color illustrations.Author Biography: Laird Borrelli is a New York-based fashion analyst and historian whose most recent book, Fashion Illustration Now, has already been published in five languages. 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
A Silicon-Based Yiel Gain Evaluation Methodology for Embedded-SRAMs with Different Redundancy Scenarios
Authors: E. Rondey, Y. Tellier, S. Borri
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Yield improvement is an essential issue for modern high-volume manufacturing CMOS processes. Process yield is particularly low for area-critical design , such as embedded memories. The use of redundancy structures which replace faulty memory location with good ones, has a direct impact on the final chip yield. This paper describes an experimental methodology employed to evaluate the yield gain associated with different redundancy approaches and show how this method can be applied to determine the optimal redundancyconfiguration which maximizes the number of good dies per wafer, depending on the embedded memory requirements of a specific product.
A Brief Introduction to Quasi-Newton Methods
Authors: John E. Dennis,  Jr.
Venue:  (1977)

NO SUPPLIED
Layout-Aware Analog System Synthesis Based on Symbolic Layout Description and Combined Block Parameter Exploration, Placement and Global Routing
Authors: Hua Tang, Hui Zhang, Alex Doboli
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper presents a new methodology for layout-aware synthesisof analog systems. The methodology combines block parameter exploration, block placement and global interconnect routing whilemaintaining an accurate perspective on the layout parasitics. Anoriginal system representation (called Layout Constraint Graphs -LCG) as developed for synthesis. The paper discusses how blockparameter exploration, placement and global routing are expressedin terms of the LCG graph. AC and transient performances of eachexplored solution are obtained using SPICE simulations. Experiments show the generality of the synthesis methodology by providing results for several applications including filters and converters.
A Formal Account of Notational Definition
Authors: Timothy G. Griffin
Venue:  (1988)

In the course of developing a mathematical theory or proof it is a common practice to introduce new notation to represent notation that is previously understood. This paper presents a formal account that is intended to model the practice of introducing and using notational (abbreviative) definitions. The aim of this work is a pragmatic one: to provide a framework useful in the design and implementation of secure proof system interfaces which accommodate, as much as possible, conventional mathematical practice. A typed $\lambda$-calculus is used to represent expressions of a given object language. A new type of equation, called a $\Delta$-equation, is introduced to model conventional definitional equations.
Programming Language Translation
Authors: Lili Qiu
Venue:  (1999)

As programming languages become more and more diversified, there is an increasing demand to translate programs written in one high-level language into another. Such translation can help us more effectively reuse the existing code, especially when automating translation is possible. However due to many subtle distinctions between different languages, usually only a subset of translation can be automated. The first half of the paper describes the details of automating most of the translation from C to C++, as well as the difficulties encountered. The second half of the paper talks about the experience of manually porting Java programs to C++, and identifies some of the issues and challenges in automating this translation process. Through the discussions, it is evident that translation is heavily language specific. Comprehensive knowledge about the languages and their subtle distinctions is essential. On the other hand, designing tools to allow high level specification of translation rules and effectively incorporate human interaction is a generic approach to any language translation problem, which is an interesting research problem to explore.
Chip-Level Substrate Noise Analysis with Network Reduction by Fundamental Matrix Computation
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Fundamental matrix (F-matrix) based substrate mesh reduction technique is incorporated in a chip-level substrate noise simulation methodology. A system-level equivalent circuit model of a 0.6-µm CMOS substrate noise evaluation chip demonstrates simulation errors of less than 15% by comparing it with 100-ps 100-µV substrate noise wave-form measurements.
Software quality measurement and modeling, maturity, control and improvement
Authors: R. Gulezian
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The goal of the paper is to provide a measurement structure needed for the improvement of software quality by uniting the Rome Laboratory Software Quality Framework, a reconstructed concept of measurement based maturity, statistical analysis, data quality and requisite information structures. The structure involves both standards of practice and standards of performance relating to product and process, and the need for extended forms of analysis for them to be developed. Such a structure is essential if software quality is to be assessed and improved in a timely manner.
(B)-Geometries and flocks of hyperbolic quadrics
Authors: Nicola Durante, Alessandro Siciliano
Venue: Journal of Combinatorial Theory Series A (2003)

We give a characteristic-free proof of the classification theorem for flocks of hyperbolic quadrics of PG(3, q).
Making Real-time Reactive Systems Reliable
Authors: Keith Marzullo, Mark D. Wood
Venue:  (1990)

No Abstract is Available.
DEPICT: Documents Evaluated as Pictures. Visualizing information using context vectors and self-organizing maps
Authors: D. A. Rushall, M. R. Ilgen
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

HNC Software, Inc. has developed a system called DEPICT for visualizing the information content of large textual corpora. The system is built around two separate neural network methodologies: context vectors and self-organizing maps. Context vectors (CVs) are high dimensional information representations that encode the semantic content of the textual entities they represent. Self-organizing maps (SOMs) are capable of transforming an input, high dimensional signal space into a much lower (usually two or three) dimensional output space useful for visualization. Neither process requires human intervention, nor an external knowledge base. Together, these neural network techniques can be utilized to automatically identify the relevant information themes present in a corpus, and present those themes to the user in a intuitive visual form.
A Modal Logic for Reasoning about Beliefs, Desires and Intentions of Complex Agents in a Distributed Environment.
Authors: Philippe Balbiani, Amal El Fallah-Seghrouchni
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

This paper presents a modal logic for reasoning about beliefs, desires and intentions of rational agents in a distributed environment. Considering complex agents of the form: compound agent, distributed agent, aggregated agent and introspective agent, it studies the interactions between their mental attitudes and completely axiomatize the modal logic as well as several of its extensions.
Design of Multivalued Circuits using Genetic Algorithms
Authors: Wenjun Wang, Claudio Moraga
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

This paper describes an evolutionary algorithm for the design of good multivalued logic (MVL) circuits based on genetic algorithms. A method for deriving low-cost realizations, based on the table-cost technique is presented. A new cost-table is also proposed that results in better realizations than that obtained in the past. With genetic lgorithms the desidn of MVL circuits can be handled as an optimization problem.
Manhattan Channel Routing is NP-complete Under Truly Restricted Settings
Authors: Martin Middendorf
Venue:  (1996)

Settling an open problem that is over ten years old, we show that Manhattan channel routing---with doglegs allowed---is NP-complete when all nets have two terminals. This result fills the gap left by Szymanski, who showed the NP-completeness for nets with four terminals. Answering a question posed by Schmalenbach and Greenberg, Jaja, and Krishnamurty, we prove that the problem remains NP-complete if in addition the nets are single-sided and the density of the bottom nets is at most one. Moreover, we show that Manhattan channel routing is NP-complete if the bottom boundary is irregular and there are only 2-terminal top nets. All of our results also hold for the restricted Manhattan model where doglegs are not allowed.
Master-Key Cryptosystems
Authors: Matt Blaze, Joan Feigenbaum, F. T. Leighton
Venue:  (1996)

We initiate the study of a new class of secret-key cryptosystems, called "master-key cryptosystems," in which an authorized third party possesses a "master key" that allows efficient recovery of the cleartext without knowledge of the session key. One motivation for this study is that master-key cryptosystems could provide a less cumbersome alternative to "key escrow" in situations in which third-party access is required. We demonstrate that designing a master-key cryptosystem with acceptable performance is roughly equivalent to designing a public-key cryptosystem in which encryption is much faster than is possible with current public-key techniques.
Standard ML Weak Polymorphism Can Be Sound
Authors: John Greiner
Venue:  (1993)

Adding ML-style references to a Hindley-Milner polymorphic type system is troublesome because such a system is unsound with naive polymorphic generalization of reference types. Tofte introduced a distinction between imperative and applicative type variables, such that applicative type variables are never in reference types, that provides a simple static analysis of which type variables may be polymorphically generalized. MacQueen''s weak type variables generalize imperative type variables with a counter called a strength. The finer distinction allows a more accurate analysis of when a reference may be created, and thus which type variables may be generalized. Unfortunately, weak polymorphism has been presented only as part of the implementation of the SML/NJ compiler, not as a formal type system. As a result, it is not well understood, as its more subtle points are not well known. Furthermore, while versions of the implementation have repeatedly been shown unsound, the concept has not been proven sound or unsound. We present several formal systems of weak polymorphism, show their connection to the SML/NJ implementation, and show the soundness of most of these systems.
Human-Computer Interaction (HCI) Specialization Track Masters of Software Engineering (MSE) Program
Authors: Carol L. Hoover
Venue:  (1995)

There is an increasing demand for software to implement human-computer interfaces. Software engineers who develop these interfaces need an understanding of the interactions between the human, the available computer technology, and human tasks. They should also understand empirical methods used to evaluate the usability of existing human-computer interfaces. The Human-Computer Interaction Specialization Track, which is an option within the Masters of Software Engineering (MSE) Program at Carnegie Mellon University, enables graduate software engineering students to obtain knowledge and skills related to the design, implementation, and evaluation of interactive computing systems. Students can acquire hands-on experience in the design of computer technology to support individual users as well as group interactions. The track is flexible in that it allows students to choose their own set of track courses from a list of approved HCI courses. This report describes the track rationale and requirements and presents educational guidelines to help students select courses. The report includes a list of approved courses and brief course synopses. The report is based on the author''s work in developing specialization tracks for the MSE program. The author started this work during the spring of 1993.
Time-lined TCP for the TCP-friendly delivery of streaming media
Authors: B. Mukherjee, T. Brecht
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

This paper introduces time-lined TCP (TLTCP). TLTCP is a protocol designed to provide TCP-friendly delivery of time-sensitive data to applications that are loss-tolerant, such as streaming media players. Previous work on unicast delivery, of streaming media over the Internet proposes using UDP and performs congestion control at the user level by regulating the application's sending rate. TLTCP, on the other hand is intended to be implemented at the transport level, and is based on TCP with modifications to support time-lines. Instead of treating all data as a byte stream TLTCP allows the application to associate data with deadlines. TLTCP sends data in a similar fashion to TCP with the deadline for a section of data has elapsed; at which point the now obsolete data is discarded in favor of new data. As a result, TLTCP supports TCP-friendly delivery of streaming media by retaining much of TCP's congestion control functionality. We describe an API for TLTCP that involves augmenting the recvmsg and sendmsg socket calls. We also describe how streaming media applications that use various encoding schemes like MPEG-1 can associate data with deadlines and use TLTCP's API. We use simulations to examine the behavior of TLTCP under a wide range of networks and workloads. We find that it indeed performs time-lined data delivery and under most circumstances the bandwidth is shared equally, among completing TLTCP and TCP flows. Moreover those scenarios under which TLTCP appears to be unfriendly are those under which TCP flows competing only with other TCP flows do not share bandwidth equitably.
Characterization and performance evaluation for proportional delay differentiated services
Authors: M. K. H. Leung, J. C. Lui, D. K. Y. Yau
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

We consider a proportional delay model for Internet differentiated services. Under this model, an ISP can control the "spacing" of waiting times between different classes of traffic. Specifically, the ISP tries to ensure that the average waiting time of class i traffic relative to that of class i-1 traffic is consistently a specifiable ratio. If the ratio is less than one, the ISP can legitimately charge users of class i traffic a higher tariff rate (compared to the rate for class i-1 traffic), since class i users consistently enjoy better performance than class i-1 users. We use time-dependent priority scheduling to realize the proportional delay model. We formally characterize the feasible regions in which given delay ratios can be achieved. Moreover a set of scheduling parameters for obtaining the desired delay ratios can be determined by an efficient control algorithm. Experiments are carried out to illustrate the short-term, medium-term and long-term relative waiting time performances for different service classes.
On the Power of Arrays In Universal Languages
Authors: Donald B. Johnson
Venue:  (1973)

A language with arrays but with no conditional statement is shown to be universal under ``simulation'''', a relation on programs frequently encountered in the practical computing world. Any r.e. set can be enumerated by a program (in this language) whose flow chart is a single loop which contains no alternate execution paths normally thought necessary for computation in general. A related result is shown for any general program, thus characterizing selection in arrays as at least as powerful as conditional branching in programs. These results are related to important results in schemata. 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
Evaluating Distributed Checkpointing Protocol
Authors: Adnan Agbaria, Ari Freund, Roy Friedman
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper presents an objective measure, called overheadratio, for evaluating distributed checkpointing protocols.This measure extends previous evaluation schemes byincorporating several additional parameters that are inherentin distributed environments. In particular, we take intoaccount the rollback propagation of the protocol, which impactsthe length of the recovery process, and therefore theexpected program run-time in executions that involve failuresand recoveries. The paper also analyzes several knownprotocols and compares their overhead ratio.
Background synaptic activity as a switch between dynamical states in a network
Authors: Emilio Salinas
Venue: Neural Computation (2003)

A bright red light may trigger a sudden motor action in a driver crossing an intersection: stepping at once on the brakes. The same red light, however, may be entirely inconsequential if it appears, say, inside a movie theater. Clearly, context determines whether a particular stimulus will trigger a motor response, but what is the neural correlate of this? How does the nervous system enable or disable whole networks so that they are responsive or not to a given sensory signal? Using theoretical models and computer simulations, I show that networks of neurons have a built-in capacity to switch between two types of dynamic state: one in which activity is low and approximately equal for all units, and another in which different activity distributions are possible and may even change dynamically. This property allows whole circuits to be turned on or off by weak, unstructured inputs. These results are illustrated using networks of integrate-and-fire neurons with diverse architectures. In agreement with the analytic calculations, a uniform background input may determine whether a random network has one or two stable firing levels; it may give rise to randomly alternating firing episodes in a circuit with reciprocal inhibition; and it may regulate the capacity of a center-surround circuit to produce either self-sustained activity or traveling waves. Thus, the functional properties of a network may be drastically modified by a simple, weak signal. This mechanism works as long as the network is able to exhibit stable firing states, or attractors.
Combining document representations for known-item search
Authors: Paul Ogilvie, Jamie Callan
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper investigates the pre-conditions for successful combination of document representations formed from structural markup for the task of known-item search. As this task is very similar to work in meta-search and data fusion, we adapt several hypotheses from those research areas and investigate them in this context. To investigate these hypotheses, we present a mixture-based language model and also examine many of the current meta-search algorithms. We find that compatible output from systems is important for successful combination of document representations. We also demonstrate that combining low performing document representations can improve performance, but not consistently. We find that the techniques best suited for this task are robust to the inclusion of poorly performing document representations. We also explore the role of variance of results across systems and its impact on the performance of fusion, with the surprising result that the correct documents have higher variance across document representations than highly ranking incorrect documents.
Enhancement and real-time analysis of an adaptive impulsive noise removal method
Authors: H. Kong, L. Guan
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper presents the enhancement and real-time processing features of an adaptive filter for the removal of impulse noise in TV picture transmission. The basic method, which was tested on synthetic data, is first enhanced to deal with real TV pictures suffering impulse noise. Then the suitability of the method in term of real-time processing is investigated. A numerical example shows that the proposed method provides high quality solutions in much shorter time than the traditional median-type filters.
On polynomial-time approximation algorithms for the variable length scheduling problem
Authors: Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
Venue: Theoretical Computer Science (2003)

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1,k2, denoted VLSP(k1,k2). In the current paper, we first discuss an error in the analysis of one of the approximation algorithms described in (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582), where an approximation algorithm for VLSP(k1,k2), k1 < k2, was presented and it was claimed that the algorithm achieves the approximation ratio of 1 + (k1(k2-k1))/k2. In this paper we give a problem instance for which the same algorithm obtains the approximation ratio ≈ k2/k1. We then present two simple approximation algorithms, one for the case k1 = 1 with an approximation ratio of 2, and one for the case k1 > 1 with an approximation ratio of 2 + (k2/2k1). This corrects the result claimed in (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582).