ppxscal/embedding_network huggingface dataset:
Poser 4 Pro Pack F/X and Design
Authors: Richard Schrand
Venue:  (2002)

:Poser 4 Pro Pack f/x and Design takes readers deep inside one of the hottest programs for humanoid figure animation. The insider tips and tricks are revealed! This book takes the reader from using the controls to pose their characters and modify animations down to the knuckles on the model's fingers; as well as, exporting models and animation in Shockwave format to full-figure animation, prop animation, and creation of banner ads. The book features special Python scripting techniques so that designers can specify advanced joint parameters to gravity effects used in animations including making hair appear to be blowing in the wind and other gravitational effects of clothing and props. A CD-ROM is also included containing original models, animation files, special Python Scripts, and trial versions of Poser and other programs which work in conjunction with this must have character animation program.
Triangle Mesh Compression for Fast Rendering
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Modern GIS(Geographic Information System) application programs and simulation systems have to handle huge size of rendering data. Currently three dimensional rendering hardwares are facing a memory bus bandwidth bottleneck problem at graphics pipeline. One general solution for this problem is to compress the static three dimensional geometry using a pre-processing phase.In this paper, we present a new mesh compression/decompression algorithm for this application. Our compression algorithm decomposes a triangle mesh into a set of triangle strips and vertex chains. After decomposition, we encode vertex connectivity with entropy encoding. Our algorithm provides 32% improved compression ratio over existing ``Generalized Triangle Mesh(GTM)'' compression and supports parallel decompression. We also proposed parallelogram prediction method for vertex coordinate compression.Our experiments visualized some terrain data with our algorithm on Open Inventor and Java3D environments.
An Emerging International Standard for Software Process Assessment
Authors: D. Kitson
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

In June 1993, an international effort was chartered by ISO/IEC JTCI to develop a standard for software process assessment. An important goal of this effort is to harmonize existing process assessment approaches. One of the risks in fielding such an international standard is that the appearance of a new and potentially incongruous approach to assessment and improvement could undermine or demotivate continued investment in process improvement by the software acquisition and software supplier communities. If the prospective standard can provide an integrating framework while still advancing the state of practice in software process assessment, it will be a very significant and positive accomplishment. This paper describes the current state of this standardization effort and discusses challenges which must be overcome.
The Inherent Cost of Achieving Causal Consistency
Authors: Carol M. Critchlow
Venue:  (1992)

We consider the problem of distinguishing causally-consistent global states in asynchronous distributed systems. Such states are fundamental to asynchronous systems, because they correspond to possible simultaneous global states; their detection arises in a variety of distributed applications, including global checkpointing, deadlock detection, termination detection and broadcasting. A consistent-cut protocol is a protocol which in every run will designate for each processor a state, in such a way that these states together form a consistent cut. We analyze the cost of achieving causal consistency in terms of the extent to which a consistent-cut protocol delays events of the underlying system, and the message-complexity required by any such protocol. We refer to the delaying action of a protocol as inhibition. We consider a spectrum of protocol capabilities based on the type of inhibition that occurs: we distinguish local versus global inhibition and prove fundamental relationships between these concepts and the ability to determine causally-consistent states. A protocol using local inhibition may cause the delay of some of a processor''s events until that processor has performed some number of local actions; a protocol using global inhibition may force the delay of some of a processor''s events until that procesor has received some communication from other processors. Based on a variety of system and protocol characteristics, including the ability to locally or globally inhibit particular types of events, we give several impossibility results and examine some existing protocols. We are then able to present a thirty-six-case summary of protocols and impossibility results for the determination of causally-consistent states as a function of those characteristics. In particular, we demonstrate that local inhibition is necessary and sufficient to solve this problem for general FIFO systems, while global send inhibition is necessary and sufficient for general non-FIFO systems. Regarding message complexity, we demonstrate that a globally inhibitory consistent-cut protocol requires $O (N)$ messages where $N$ is the number of processors in the system. This is true whether the protocol is designed to work for FIFO or non-FIFO systems; the exact lower bounds, however, differ in the two cases. We also prove that a consistent-cut protocol which uses local inhibition only requires $O$ ($N^{2}$) messages, or, more precisely, $O$ ($\vert \cal C \vert$), where $\cal C$ is the channel set of the system. This latter result illustrates a trade-off between the message complexity of a consistent-cut protocol and the degree of inhibition which it requires.
Enterprise networking, modeling and simulation: status and prospects for the Middle-East
Authors: H. Akhtar
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This paper describes AT&T's efforts in the area of networking with specific reference to modeling and simulation for the design of enterprise networks especially with upcoming ATM/BISDN technologies. A brief review of the tools researched and evaluated by AT&T is conducted followed by a detailed simulation example using ATM in LAN/WAN design. This is followed by a discussion of how this experience could be utilized internationally in the developing nations with specific reference to the Middle-East. This paper is supplemented with a separate tutorial on simulation and modeling in general and simulation tool usage in particular using OPNET. This is one of the leading tools that is now being widely used along with other tools within different business units at AT&T to develop professional services including enterprise networking, telecom and LAN/WAN architecture studies, network management and network operations support systems.
A Scalable Substructuring Method by Lagrange Multipliers for Plate Bending Problems
Authors: J. Mandel, R. Tezaur, C. Farhat
Venue:  (1996)

We present a new Lagrange multiplier based domain decomposition method for solving iteratively systems of equations arising from the finite element discretization of plate bending problems. The proposed method id essentially an extension of the FETI substructuring algorithm to the biharmonic equation. The main idea is to enforce continuity of the transversal displacement field at the subdomain crosspoints throughout the preconditioned conjugate gradient iterations. The resulting method is proved to have a condition number that does not grow with the number of subdomains, and grows at most polylogarithmically with the number of elements per subdomain. These optimal properties hold for numerous plate bending elements that are used in practice including the HCT, DKT, and a class of non-locking elements for the Reissner-Mindlin plate models. Computational experiments are reported ans shown to confirm the theoretical optimal convergence properties of the new domain decomposition method. Computational efficiency is also demonstrated with the numerical solution in 45 iterations and 105 seconds on a 64-processor IBM SP2 of a plate bending problem with almost on million degrees of freedom.
Introduction to E-Commerce
Authors: Efraim Turban, Carl Cohen, Irving M. Copi, David R. King
Venue:  (2003)

:Offering both real-world and theoretical perspectives, this book features exceptionally comprehensive yet manageable coverage of a broad spectrum of E-commerce essentials from a global point of view. Extremely user-friendly and practical, it features vignettes, application cases, and real-world cases in each chapter. Market Mechanisms. Products and Services. Market Research and Advertisement. Company-Centric. Exchanges and Collaboration. E-Government, B2E. M-Commerce. Infrastructure and Application Developments. Privacy, Legal and Security. Payments and Order Fulfillment. Strategy, Going global, and Internet Communities. For anyone interested in e-commerce. Ideal for busy executives.
User-Defined Visual Languages for Querying Data
Authors: Isabel F. Cruz
Venue:  (1993)

DOODLE is the first language to be proposed for querying object-oriented databases with user-defined visual languages. A DOODLE program defines a visual language in a by-example fashion. In this paper we continue the preliminary expos\''{e} on DOODLE (SIGMOD''92). We refine the language and provide complex examples that illustrate the extensive capabilities of DOODLE in a variety of applications. The contributions of DOODLE to other areas of computer science, such as constraint languages and graph drawing, are also outlined. DOODLE explores the limits of declarative languages by making data and its manipulation visual, while staying within the bounds of the formal database field. The formal basis of DOODLE motivates the study of visual expressiveness and points to further research.
An Optimal Strategy for Anonymous Communication Protocols
Authors: Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communication systems have been realized over the recent years. The effectiveness of these systems relies greatly on the way messages are routed among the participants. (We call this the route selection strategy.) In this paper, we describe how to select routes so as to maximize the ability of the anonymous communication systems to protect anonymity. To measure this ability, we define a metric (anonymity degree), and we design and evaluate an optimal route selection strategythat maximizes the anonymity degree of a system. Our analytical and experimental data shows that the anonymity degree may not always monotonically increase as the lengthof communication paths increase. We also found that variable path-length strategies perform better than fixed-length strategies.
The Domination and Competition Graphs of a Tournament
Authors: David C. Fisher, J. R Lundgren, Sarah K. Merz, K. B Reid
Venue:  (1995)

Vertices x and y dominate a tournament T if for all vertices z \neq x,y, either x beats x or y beats z. Let dom(T) be the graph on the vertices of T with edges between Pairs of vertices that dominate T. We show dom(T) is either an odd cycle with possible pendant vertices or a forest of caterpillars. Since dom(T) is the complement of the competition graph of the tournament formed by reversing the arcs of T, complementary results are obtained for the competition graph of a tournament.
Towards Physically-Correct Specifications of Embedded Real-Time Systems
Authors: Azer Bestavros
Venue:  (1994)

Abstract Predictability (the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements) is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications. The backbone of our methodology is a formalism that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Unrealistic systems (possessing properties such as clairvoyance, caprice, infinite capacity, or perfect timing) cannot even be specified. We argue that this ``ounce of prevention'''' at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems -- not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed.
Normalisation Due to Process Dependencies
Authors: Stefan Stanczyk
Venue:  (1997)

Classical normalisation removes structural anomalies that may occur in relations. These anomalies are defined by analysing various forms of predicates involving the attributes of the relations and by considering the implications of sequentially performed updating processes. The extension suggested in this paper takes into account the implications of performing update processes not necessarily sequentially and incorporates them into the normalisation process appropriately.
A Hessenberg-Schur Method for the Problem AX + XB = C
Authors: Gene H. Golub, Stephen Nash, Charles Van Loan
Venue:  (1978)

ONe of the most effective methods for solving the matrix equation AX + XB = C is the Bartels-Stewart algorithm. Key to this technique is the orthogonal reduction of A and B to triangular form using the QR algorithm for eigenvalues. A new method is proposed which differs from the Bartels-Stewart algorithm in that A is only reduced to Hessenberg form. The resulting algorithm is between 30 and 70 percent faster depending upon the dimensions of the matrices A and B. The stability of the new method is demonstrated through a roundoff error analysis and supported by numerical tests. Fianlly, it is shown how the techniques described can be applied and generalized to other matrix equation problems.
Function Approximation Using Robust Wavelet Neural Networks
Authors: Sheng-Tun Li, Shu-Ching Chen
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Wavelet neural networks (WNN) have recently attracted great interest, because of their advantages over radial basis function networks (RBFN) as they are universal approximators but achieve faster convergence and are capable of dealing with the so-called "curse of dimensionality." In addition, WNN are generalized RBFN. However, the generalization performance of WNN trained by least-squares approach deteriorates when outliers are present. In this paper, we propose a robust wavelet neural network based on the theory of robust regression for dealing with outliers in the framework of function approximation. By adaptively adjusting the number of training data involved during training, the efficiency loss in the presence of Gaussian noise is accommodated. Simulation results are demonstrated to validate the generalization ability and efficiency of the proposed network.
Implementation of Multiple-Output Functions Using PQMDDs
Authors: Yukihiro Iguchi, Tsutomu Sasao, Munehiro Matsuura
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A sequential realization of multiple-output logic functions is presented. A conventional sequential realization is based on SBDDs (Shared reduced ordered Binary Decision Diagrams). In this paper, we propose PQMDD (Paged Quasi-reduced ordered Multi-valued Decision Diagram) as a new data structure. A function is represented by a PQMDD, and stored in memory. Dedicated control circuits traverse the PQMDD in parallel. We represent multiple-output function for benchmark functions by SBDDs and PQMDDs and compare the size of memory and computation time.
Quality-controlled compression of sets of images
Authors: M. Livny, V. Ratnakar
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

We propose the QCLICS algorithm for quality-controlled JPEG compression of image sets. Lossy compression of images results in a tradeoff between compression and quality: the greater the compression, the poorer the resulting image quality. Quality-controlled compression has two goals: meeting any desired compression/quality specification accurately and optimizing the compression-quality tradeoff. When a large set of images is to be compressed into a limited amount of disk space, it is desirable to optimize the compression-quality tradeoff for individual images as well as across images. This is an important issue in multimedia CD-ROM production, where hundreds or thousands of digital images need to be compressed to fit in the available space. The QCLICS algorithm uses the RD-OPT algorithm (Ratnakar and Livny, 1995) for optimizing JPEG quantization tables for individual images, and uses a dynamic programming strategy to apportion the target compression/quality to the individual images. The complexity overhead of optimizing across the images is minimal, while significant gains in compression/quality are obtained. QCLICS offer flexibility in choosing the image quality metric and allows various constraints to be placed on compression/quality for individual images. We present performance results for several sets of images. These images were taken from various scientific sources at the University of Wisconsin-Madison, such as microscopy images of cells, crystals, brains, and spacecraft images of Venus.
Ercim Technical Reference Digital Library Administration Service
Authors: Antonella Andreoni, Carlo Carlesi, Pasquale Pagano, Serena Pisani
Venue:  (1999)

The ERCIM Technical Reference Digital Library (ETRDL) provides the access to a distributed collection of grey literature (technical reports, theses, workshop proceedings, pre-prints, etc.) in the areas of Computer Sciences and Applied Mathematics produced by members of the ERCIM Consortium. The ETRDL service currently allows public access through Internet to the technical reports produced by seven ERCIM organisations. ETRDL functionality regards searching and browsing ERCIM collections to retrieval existing documents, submitting new documents in a specific collection and administer the ERCIM collections via a Web user interface. The aim of this document is to present an user guide for the information administrator that need to manage the ETRDL collections by checking the correctness of incoming document, physically inserting new documents in the ETRDL repositories, rejecting incorrect documents, withdrawing documents that have been published. EMAIL:: pagano@iei.pi.cnr.it
Formal Connectors
Authors: Robert Allen, David Garlan
Venue:  (1994)

As software systems become more complex the overall system structure --- or software architecture --- becomes a central design problem. An important step towards an engineering discipline of software is a formal basis for describing and analyzing these designs. In this paper we present a theory for one aspect of architectural description: the interactions between components. The key idea is to define architectural connectors as explicit semantic entities. These are specified as a collection of protocols that characterize each of the participant roles in an interaction and how these roles interact. We illustrate how this scheme can be used to define a variety of common architectural connectors. We further provide a formal semantics and show how this leads to a system in which architectural compatibility can be checked in a way analogous to type checking in programming languages.
A call model for multimedia multiuser communication platform
Authors: Seungchul Park, Yanghee Choi
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Multimedia multiuser applications such as computer supported cooperative working, desktop multimedia conferencing, and distance education require more complex and structured communication services from the underlying communication platform than conventional applications. The call model of the communication platform defines how the underlying basic data transport objects can be structured to support more complex communication services, and how the structured objects can be managed in a consistent manner by the applications. In this paper, we present a new call model for multimedia multiuser communication platform, based on the analysis of communication requirements for diverse applications. Our call model provides better structuring capability than the existing call models, and the communication platform based on the call model will support present and future complex multimedia multiuser applications more efficiently. Detailed call control operations are also presented in this paper
Beyond HTML Goodies
Venue:  (2002)

:You built your site with HTML Goodies. You enhanced your site with JavaScript Goodies. You refined your site with Web Site Design Goodies. Now, take the next step with Joe Burns as he leaves the basics behind and presents you with the behind-the-scenes techniques with Beyond HTML Goodies. Let Joe show you how easy it can be to add simple administrative forms and tasks to your site that the users might never even see -- but will help you a million times over. Find out ways to make your forms more usable and easy to follow. Learn how server-side includes make monitoring your site a snap. Finally, figure out how different browsers affect your site and how to fix it so they don't. And best of all, each "goody" in the book has a working example on the HTML Goodies Web site, so you can see how something works before you put it on your own site! 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
An Experience on CORBA Component Deployment
Authors: Maria Claudia B. Barros, Edmundo R. M. Madeira, Irineu Sotoma
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The component technologies have been more and more developed and used to speed up the development of (distributed) applications. OMG has developed a model for CORBA component, which briefly describes the deployment of CORBA component without many details. This paper presents and discusses some implementation aspects and experimental results obtained by using an extended deployment model for CORBA Components previously proposed by the authors.
Efficiently Using Invariant Theory and Grouping Information for Model-Based Matching
Authors: Peter C. Wayner
Venue:  (1990)

This paper presents a method for efficiently maintaining and searching a database of three-dimensional models so they can be reliable recognized from arbitrary two-dimensional projections in the presence of noise and occlusion. The core of the process is the topologically-defined network of invariants which breaks three-dimensional models down into small, local groups of features and indexes these groups using translation, rotation, scaling, and orthographic projection invariant functions. The network encodes the geometrical relationships between these groups so that grouping information can be used to increase the speed of matching.