ppxscal/embedding_network huggingface dataset:
Bounded-distortion piecewise mesh parameterization
Authors: Olga Sorkine, Daniel Cohen-Or, Rony Goldenthal, Dani Lischinski
Venue: Proceedings of the conference on Visualization '02 (2002)

Many computer graphics operations, such as texture mapping, 3D painting, remeshing, mesh compression, and digital geometry processing, require finding a low-distortion parameterization for irregular connectivity triangulations of arbitrary genus 2-manifolds. This paper presents a simple and fast method for computing parameterizations with strictly bounded distortion. The new method operates by flattening the mesh onto a region of the 2D plane. To comply with the distortion bound, the mesh is automatically cut and partitioned on-the-fly. The method guarantees avoiding global and local self-intersections, while attempting to minimize the total length of the introduced seams.To our knowledge, this is the first method to compute the mesh partitioning and the parameterization simultaneously and entirely automatically, while providing guaranteed distortion bounds. Our results on a variety of objects demonstrate that the method is fast enough to work with large complex irregular meshes in interactive applications.
Status Report: Requirements Engineering
Authors: Pei Hsia, Alan Davis, David Kung
Venue: IEEE Software (1993)

It is argued that, in general, requirements engineering produces one large document, written in a natural language, that few people bother to read. Projects that do read and follow the document often build systems that do not satisfy needs. The reasons for the current state of the practice are listed. Research areas that have significant payoff potential, including improving natural-language specifications, rapid prototyping and requirements animation, requirements clustering, requirements-based testing, computer-aided requirements engineering, requirements reuse, research into methods, knowledge engineering, formal methods, and a unified framework, are outlined.
The PhotoShop Plug-INS Book: Category Listings, Instructions and Examples, 1st edition
Authors: Daniel Gray
Venue:  (1997)

:Ventanas The Photoshop Plug-ins Book provides readers with a comprehensive reference for reviewing and using all Photoshop plug-ins.Each plug-in is presented in a consistent template for easy access and comparison. Icons identify special tips and tricks. Before and after figures show readers how to use color effects filters.The plug-ins discussed in The Photoshop Plug-Ins Book are as follows: Optimizing Images for Print (scanPrepPro, Extensis Intellihance).Streamlining Workflow (Chromatica, Alaras Apatura, Extensis PhotoTools). Creative Filters (Kais Power Tools, XaosTools, Human Software Squizz).3D (XaosTools TypeCaster, HoloDozo).Shareware (india ink, PhotoGIF, feather-gif, retro-scan, frosty, vitriol).Features all the best Photoshop plug-ins how to find and use them.Presents plug-ins by category for easy and quick reference.Contains tips, tricks and advice for making the most of each plug-in addressed.Demos and shareware versions of the most popular commercial plug-insAdobe Plug-in JDKsAccess to Ventanas online community of Photoshop professionals
The Scrum Software Development Process for Small Teams
Authors: Linda Rising, Norman S. Janoff
Venue: IEEE Software (2000)

In today's software development environment, requirements often change during the product development life cycle to meet shifting business demands, creating endless headaches for development teams. These authors from AG Communications Systems discuss their experience in implementing the Scrum software development process to address these concerns. In experimenting with the Scrum software development process, they have found that small teams can be flexible and adaptable in defining and applying an appropriate variant of Scrum.
Tracing the Thermal Behavior of ICs
Authors: Vladimir Székely, Márta Rencz, Bernard Courtois
Venue: IEEE Design Test (1998)

Scaling down of ICs and the increased packaging densities resulted in increased concern about thermal issues during the design of ICs and their packages. In this paper the advances in the thermal design, measuring and testing methods of ICs are discussed. After presenting the state-of-the-art in the thermal and electro-thermal simulation and measurement methods the idea and methodological questions of the Design for Thermal Testability (DfTT) are discussed. Thermal characterization problems of IC packages are reviewed shortly.
Fault Detection in Multiprocessor Systems and Array Processors
Authors: Tatyana D. Roziner, Mark G. Karpovsky, Claudio Moraga
Venue: IEEE Transactions on Computers (1995)

Off-line testing of large multiprocessor networks or VLSI chips with many outputs requires a large volume of memory for reference data storage. Space compaction combined with time compression of test responses can essentially reduce an overhead required for testing and diagnosis. In this paper, we discuss the problem of optimal design for space compressors (compactors), to minimize the number of observation points for detection of single faulty components in multiprocessor networks. A space compactor is assumed to be followed by a time compressor, to detect a fault not necessarily manifesting itself for a single test pattern.We formulate the rules of design for a space compaction matrix for the topology of the circuit-under-test (CUT) modeled by an arbitrary acyclic graph. Tree arrays and Fourier transform networks are considered as examples. The lower and upper bounds on the number of space compactor outputs are obtained, and optimal space compaction matrices are determined for above mentioned CUT topologies. Simple procedures for design of off-line testing devices with built-in self-testing are presented. Estimations on a complexity of proposed designs are given.
Automatically Identifying Reusable OO Legacy Code
Authors: Letha H. Etzkorn, Carl G. Davis
Venue: Computer (1997)

Although object-oriented code may be inherently more reusable than functionally oriented code, most object-oriented legacy systems were not designed with reuse in mind. OO code, due to the very aspects that make it desirable, tends to suffer from a wide scattering of the code that performs even a fairly simple task. It is considered to be good object-oriented programming style to write small member functions, which results in an OO system consisting of a large number of small modules. Through inheritance, a class may inherit one or more classes, each with its own associated methods, but few defined locally. These aspects of object-oriented code underline the need for good, semantically based tools to aid in the understanding, and thus the reuse, of object-oriented code. The Patricia (Program Analysis Tool for Reuse) system, developed at the University of Alabama in Huntsville, identifies reusable components in OO code. To understand a program, Patricia uses a unique heuristic approach, deriving information from the linguistic aspects of comments and identifiers and from other nonlinguistic aspects of OO code, such as class hierarchy.
R-MINI: An Iterative Approach for Generating Minimal Rules from Examples
Authors: Se June Hong
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Generating classification rules or decision trees from examples has been a subject of intense study in the pattern recognition community, the statistics community, and the machine-learning community of the artificial intelligence area. We pursue a point of view that minimality of rules is important, perhaps above all other considerations (biases) that come into play in generating rules. We present a new minimal rule-generation algorithm called R-MINI (Rule-MINI) that is an adaptation of a well-established heuristic-switching-function-minimization technique, MINI. The main mechanism that reduces the number of rules is repeated application of generalization and specialization operations to the rule set while maintaining completeness and consistency. R-MINI results on some benchmark cases are also presented.
Designing Embedded Internet Devices
Authors: Dan Eisenreich, Brian DeMuth
Venue:  (2002)

:Embedded internet and internet appliances are the focus of great attention in the computing industry, as they are seen as the future of computing. The design of such devices presents many technical challenges. This book is the first guide available that describes how to design internet access and communications capabilities into embedded systems. It takes an integrated hardware/software approach using the Java programming language and industry-standard microcontrollers. Numerous illustrations and code examples enliven the text. This book shows how to build various sensors and control devices that connect to the TINI interfaces, explains how to write programs that control them in Java, and then ties them all together in practical applications. Included is a discussion on how these technologies work, where to get detailed specifications, and ideas for the reader to pursue beyond the book. The accompanying CDROM includes Java source code for all the applications described in the book, as well as an electronic version of the text. KEY FEATURES: * The first guide to designing internet access and communications capabilities into embedded systems* Takes an integrated hardware/software approach using the Java programming language and industry-standardAuthor Biography: Brian DeMuth also works for the U.S. Dept. of Defense where he is responsible for integrated circuit product development. He has developed and taught several in-house courses on microelectronics and hardware development. He is proficient in numerous computer languages, including C, Java, and assembly language. He holds both the B.S. and M.S. degrees in electrical engineering.Dan Eisenreich currently works at the U.S. Department of Defense developing hardware and software for equipment automation, semiconductor device modeling, and semiconductor manufacturing. He has implemented engineering data web servers and automated tools for updating and distributing information on the intranet/Internet. He holds B.S. in mechanical engineering and M.S. in computer science degrees.
Performance Evaluation of an Efficient Multiple Copy Update Algorithm
Authors: T. V. Lakshman, D. Ghosal
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

A well-known algorithm for updating multiple copies is the Thomas majority consensus algorithm. This algorithm, before performing an update, needs to obtain permission from a majority of the nodes in the system. We study the response-time behavior of a symmetric (each node seeks permission from the same number of other nodes and each node receives requests for update permission from the same number of other nodes) distributed update-synchronization algorithm where nodes need to obtain permission from only O(/spl radic/N) (N being the number of database copies) other nodes before performing an update. The algorithm we use is an adaptation of Maekawa's O(/spl radic/N) distributed mutual exclusion algorithm to multiple-copy update-synchronization. This increase in the efficiency of the update-synchronization algorithm enhances performance in two ways. First, the reduction in transaction service time reduces the response time. Second, for a given arrival rate of transactions, the decrease in response time reduces the number of waiting transactions in the system. This reduces the probability of conflict between transactions. To capture the interaction between the probability of conflict and the transaction response time, we define a new measure called the conflict response-time product. Based on the solution of a queueing model we show that optimizing this measure yields a different and more appropriate choice of system parameters than simply minimizing the mean transaction response time.
A Syntactic Theory of Dynamic Binding
Authors: Luc Moreau
Venue: Higher-Order and Symbolic Computation (1998)

Dynamic binding, which traditionally has always been associated with Lisp, is still semantically obscure to many. Even though most programming languages favour lexical scope, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in formal semantics. This article presents a syntactic theory that enables the programmer to perform equational reasoning on programs using dynamic binding. The theory is proved to be sound and complete with respect to derivations allowed on programs in &ldquo;dynamic-environment passing style&rdquo;. From this theory, we derive a sequential evaluation function in a context-rewriting system. Then, we further refine the evaluation function in two popular implementation strategies: deep binding and shallow binding with value cells. Afterwards, following the saying that deep binding is suitable for parallel evaluation, we present the parallel evaluation function of a future-based functional language extended with constructs for dynamic binding. Finally, we exhibit the power and usefulness of dynamic binding in two different ways. First, we prove that dynamic binding adds expressiveness to a purely functional language. Second, we show that dynamic binding is an essential notion in semantics that can be used to define exceptions.
Evolutionary modelling of software systems: its application to agent-based and hypermedia systems
Authors: M. J. Rodríguez-Fortiz, P. Paderewski-Rodríguez, L. Garcia-Cabrera, J. Parets-Llorca
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Evolution of software systems can be conceived from the Theory of Systems as a maturation process in which the developer have an active participation. This paper presents a two levels architecture: system and Meta-system. The developer interacts with the high level, Meta-system, for evolving the structure of the software system defined in the first level in which the user works. This architecture can be used to model the structure, functioning and evolution of any kind of software systems. In concrete, as the paper describes, it is applied to agents-based systems and hypermedia systems in a satisfactory way.
Rapid Prototyping: Lessons Learned
Authors: V. Scott Gordon, James M. Bieman
Venue: IEEE Software (1995)

Opinions on rapid prototyping as a practical development tool vary widely, with conventional wisdom seeing it more as a research topic than a workable method. The authors counter this notion with results from 39 case studies, most of which have used this approach successfully.
A New Method for the Computation of the Error Probability ofDifferentially Detected Modulation Formats in Mobile Radio Channels &ndash;The Case of Minimum Shift Keying
Authors: Andreas F. Molisch
Venue: Wireless Personal Communications: An International Journal (1999)

We show a new approach to analytically compute the error probability BER in mobile radio channels. The method is applicable to a variety of differentially detected modulation formats; here we use minimum shift keying (MSK) as an example. We include the following effects: (i) fading and (ii) time dispersion of the mobile radio channel (iii) noise, and (iv) filtering both of the data sequence and the received signal. Sampling is at a fixed but arbitrary instant. We develop a new mathematical formalism, which we call the two-path equivalent-matrix (TPEM) method. In this method, we reduce the general channel (including noise) exactly to a two-path fading channel without noise, whose BER can be easily computed. With this method, we can find analytically the BER for both filtered and unfiltered (G)MSK if the BER is small; for large BER a single well-behaved integral must be solved numerically. Asymptotic equations for unfiltered MSK and small BERs are also given. To a first approximation, the BER is 0.5&middot; [(S/T)&sup2;+1/SNR] for pure MSK, where S/T is the delay spread normalized to the bit duration and SNR is the signal-to-noise ratio. The BER is increased by less than 50% for Gaussian filtering of the data sequence and receiver filtering with a time-bandwidth product larger than 0.3.
Efficient Queries over Web Views
Authors: Giansalvatore Mecca, Alberto O. Mendelzon, Paolo Merialdo
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Large Web sites are becoming repositories of structured information that can benefit from being viewed and queried as relational databases. However, querying these views efficiently requires new techniques. Data usually resides at a remote site and is organized as a set of related HTML documents, with network access being a primary cost factor in query evaluation. This cost can be reduced by exploiting the redundancy often found in site design. We use a simple data model, a subset of the Araneus data model, to describe the structure of a Web site. We augment the model with link and inclusion constraints that capture the redundancies in the site. We map relational views of a site to a navigational algebra and show how to use the constraints to rewrite algebraic expressions, reducing the number of network accesses. We show that similar techniques can be used to maintain materialized views over sets of HTML pages.
Picture Similarity Retrieval Using the 2D Projection Interval Representation
Authors: Mohammad Nabil, Anne H. H. Ngu, John Shepherd
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Spatial relationships are important ingredients for expressing constraints in retrieval systems for pictorial or multimedia databases. We have proposed a unified representation for spatial relationships, 2D Projection Interval Relationships (2D-PIR), that integrates both directional and topological relationships. In this paper we develop techniques for similarity retrieval based on the 2D-PIR representation, including a method for dealing with rotated and reflected images.
Delay performance of data traffic in a cellular wireless ATM network
Authors: T. C. Wong, J. W. Mark, K. C. Chua, B. Kannan, Y. H. Chew
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

The delay performance for self-similar data traffic over a prioritized Time Division Multiple Access with Dynamic Reservation (TDMA/DR) MAC protocol in a wireless ATM setting is evaluated using simulation and approximate analysis. An approximate analysis of heavy-tailed ON/OFF data traffic yields very accurate mean delay and delay distribution of the data traffic in the traffic range up to 70% of the total channel capacity. The reasonableness of the approximate analysis is verified by simulation. The aggregate of the heavy-tailed ON/OFF sources, with Pareto-distributed ON and OFF periods, forms a self-similar data traffic. In the computer simulation, we consider three service classes representing real-time voice, real-time Variable Bit Rate (VBR) Markov Modulated Poisson Process (MMPP) video and data traffic. Numerical results indicate that the delay performance for heavy-tailed ON/OFF data traffic is well within the delay tolerance under light to medium loads.
Hardware and Software Symbiosis Helps Smart Card Evolution
Authors: Jean-Francois Dhem, Nathalie Feyt
Venue: IEEE Micro (2001)

Complementary hardware and software have contributed to the success of smart cards. New chips and operating systems will further enhance performance and security.
A Secure Fault-Tolerant Conference-Key Agreement Protocol
Authors: W. G. Tzeng
Venue: IEEE Transactions on Computers (2002)

When a group of people want to communicate securely over an open network, they run a conference-key protocol to establish a common conference key K such that all their communications thereafter are encrypted with the key K. In this paper, we propose a provably secure fault-tolerant conference-key agreement protocol under the authenticated broadcast channel model. We show that a passive adversary gets zero knowledge about the conference key established by the honest participants under the assumption of a variant Diffie-Hellman decision problem. We also show that the honest participants can agree on a common conference key no matter how many participants are malicious. Furthermore, we show that even if the broadcast channel is not authenticated, our protocol is secure against impersonators under the random oracle model.
Extraction and Applications of Statistical Relationships in Relational Databases
Authors: Wen-Chi Hou
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In this paper, we discuss modeling and extraction of statistical relationships among attributes. Different methods are used for extraction of different types of relationships. A complete methodology for extraction is developed by integrating widely accepted statistical methods. Statistical relationships manifest embedded relationships in data and thus lend themselves naturally to estimating unknown attribute values and detecting unlikely values. We will carefully examine these applications and evaluate the usefulness of statistical relationships in these applications using a real-life database.
Understanding and improving operating system effects in control flow prediction
Authors: Tao Li, Lizy Kurian John, Anand Sivasubramaniam, N. Vijaykrishnan, Juan Rubio
Venue: ACM SIGPLAN Notices (2002)

Many modern applications result in a significant operating system (OS) component. The OS component has several implications including affecting the control flow transfer in the execution environment. This paper focuses on understanding the operating system effects on control flow transfer and prediction, and designing architectural support to alleviate the bottlenecks. We characterize the control flow transfer of several emerging applications on a commercial operating system. We find that the exception-driven, intermittent invocation of OS code and the user/OS branch history interference increase the misprediction in both user and kernel code.We propose two simple OS-aware control flow prediction techniques to alleviate the destructive impact of user/OS branch interference. The first one consists of capturing separate branch correlation information for user and kernel code. The second one involves using separate branch prediction tables for user and kernel code. We study the improvement contributed by the OS-aware prediction to various branch predictors ranging from simple Gshare to more elegant Agree, Multi-Hybrid and Bi-Mode predictors. On 32K entries predictors, incorporating OS-aware techniques yields up to 34%, 23%, 27% and 9% prediction accuracy improvement in Gshare, Multi-Hybrid, Agree and Bi-Mode predictors, resulting in up to 8% execution speedup.
Temporal Entity-Relationship Models-A Survey
Authors: Heidi Gregersen, Christian S. Jensen
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

The Entity-Relationship (ER) model, using varying notations and with some semantic variations, is enjoying a remarkable, and increasing, popularity in both the research community¿the computer science curriculum¿and in industry. In step with the increasing diffusion of relational platforms, ER modeling is growing in popularity. It has been widely recognized that temporal aspects of database schemas are prevalent and difficult to model using the ER model. As a result, how to enable the ER model to properly capture time-varying information has, for a decade and a half, been an active area in the database-research community. This has led to the proposal of close to a dozen temporally enhanced ER models. This paper surveys all temporally enhanced ER models known to the authors. It is the first paper to provide a comprehensive overview of temporal ER modeling and it, thus, meets a need for consolidating and providing easy access to the research in temporal ER modeling. In the presentation of each model, the paper examines how the time-varying information is captured in the model and presents the new concepts and modeling constructs of the model. A total of 19 different design properties for temporally enhanced ER models are defined, and each model is characterized according the these properties.