ppxscal/embedding_network huggingface dataset:
Collaborative and Interactive Room Design on the Web
Authors: H. Wang, X. Xie, Z. Huang
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Abstract Design on the Web raises challenging questions concerning how users interact with objects, applications, and other users. In this work, we propose a collaborative and interactive client-server design framework and implement a room design system for our study. We have integrated technologies used in distributed computation (Java and CORBA) and computer graphics (VRML). It divides the design process into three tiers. First, collaborative and interactive design, viewing, and publishing. Second, scene generation. Third, scene database management. Our system can be applied in Electronic Commerce to improve the existing systems by allowing customers to select furniture and to visualize the whole furnished room in 3-D.
Reference dependence in cumulative prospect theory
Authors: Ulrich Schmidt
Venue: Journal of Mathematical Psychology (2003)

A central feature of (cumulative) prospect theory is reference dependence, i.e. the value function depends on gains and losses relative to a status quo and not on final wealth positions as in expected utility theory. Until now, all theoretical work on prospect theory only considered a fixed status quo. In this case, however, reference dependence and the dependence of the value function on final wealth positions are equivalent concepts, at least if the status quo is known. In order to identify the difference between both concepts, an axiomatization of cumulative prospect theory is developed which allows for a variable status quo. In this framework a preference condition can be formulated which discriminates between reference dependence and the dependence on final wealth positons. Furthermore, this framework allows one to analyze in which way the shape of the value and weighting functions change with increasing status quo. With respect to this question several hypotheses are defined and charaterized in terms of preference conditions.
Summary evaluation and text categorization
Authors: Khurshid Ahmad, Bogdan Vrusias, Paulo C F de Oliveira
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

In general terms the evaluation of a summary depends on how close it is to the chief points in the source text. This begets the question as to what are the chief points in the source text and how is this information used in itself in identifying the source text. This is crucially important when we discuss automatic evaluation of summaries. So the question of main points is the source text. Typically, this would be around a nucleus of keywords. However, the salience, the frequency, and the relationship of the text with other texts in the collection (of these keywords is perhaps) are important. Text categorisation using neural networks explicates these points well and also has a practical impact.
DVD Demystified, 3 edition
Authors: Jim Taylor
Venue:  (2003)

:This brand new, comprehensive edition of the best-selling guide to DVD technology is a must-read for DVD hardware/software developers, A/V publishers, IT/MIS professionals, and video/audio professionals. Includes a new chapter on DVD production, and completely new DVD-ROM demo material. Covers the use of DVD with computers -- plus rewritable DVD, DVD audio, DIVX, and other new technologies.
The Role of Meta-Objects and Self-Description in an Engineering Data Warehouse
Authors: R McClatchey, Z Kovacs, F Estrella, J-M Le Goff, L Varga, M Zsenei
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

As enterprises, data and functions become increasingly complex and distributed the need for information systems to be both customizable and interoperable also increases. Large scale engineering and scientific projects demand flexibility in order to evolve over time and to interact with external systems (both newly designed and legacy in nature) while retaining a degree of conceptual simplicity.The design of such systems is heavily dependent on the flexibility and accessibility of the data model describing the enterprise's repository. The model must provide interoperability and reusability so that a range of applications can access the enterprise data. Making the repository self-describing, based on 'meta-object' structures, ensures that knowledge about the repository structure is available for applications to interrogate and to navigate around for the extraction of application-specific data. In this paper, a large application is described which uses a meta-object based repository to capture engineering data in a large data warehouse. It shows that adopting a meta-modeling approach to repository design provides support for interoperability and a sufficiently flexible environment in which system evolution and reusability can be handled.
Effects of Chromosome Migration on a Parallel and Distributed Genetic Algorithm
Authors: T. Matsumura, M. Nakamura, D. Miyazata, J. Okech, K. Onaga
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper we propose a parallel and distributed genetic algorithms (PDGA) on fixed network topology multiprocessor systems in which each processor element carries out genetic operations on its own chromosome set and communicates with only the neighbors (we say chromosome migration). We execute the proposed method to investigate effects of chromosome migration on the multiprocessor systems with ring, torus, and hypercube topology for benchmark problem instances. From the results, we find that the ring topology is more suitable for our proposed parallel and distributed execution since it avoids immature convergence for its topological feature. We show its effectiveness by experimental evaluation.
The twenty-fourth fermat number is composite
Authors: Richard E. Crandall, Ernst W. Mayer, Jason S. Papadopoulos
Venue: Mathematics of Computation (2003)

We have shown by machine proof that F24 = 2224 + 1 is composite. The rigorous Pépin primality test was performed using independently developed programs running simultaneously on two different, physically separated processors. Each program employed a floating-point, FFT-based discrete weighted transform (DWT) to effect multiplication modulo F24. The final, respective Pépin residues obtained by these two machines were in complete agreement. Using intermediate residues stored periodically during one of the floating-point runs, a separate algorithm for pure-integer negacyclic convolution verified the result in a "wavefront" paradigm, by running simultaneously on numerous additional machines, to effect piecewise verification of a saturating set of deterministic links for the Pépin chain. We deposited a final Pépin residue for possible use by future investigators in the event that a proper factor of F24 should be discovered; herein we report the more compact, traditional Selfridge-Hurwitz residues. For the sake of completeness, we also generated a Pépin residue for F23, and via the Suyama test determined that the known cofactor of this number is composite.
Design of an agent-based middleware for job matchmaking in teleworking community
Authors: Kenji Sugawara, Yang Yu, Brian Ragsdale, Hideki Hara, Tetsuo Kinoshita
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we proposed an agent-based middleware for Job Matchmaking in a teleworking community. We built an agent-based model of organizing distributed teleworkers for big projects and designed a multi-agent system that performs job matchmaking. The matchmaking agent can also carry out negotiation tasks to make a better match. The matchmaking agents use teleworkers' heuristics acquired dynamically through user interface agents to search for suitable working relationships among many participants in a teleworking community, who are also represented by agents.
Event-Based Performance Analysis
Authors: Steven P. Reiss
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Understanding performance and related issues in a complex system requires analyzing where and why the program spends its resources. In a reactive system such as a interactive application or a server, it is important for understanding that one be able to associate resourceusage with the events, be they user actions or client requests, that triggered the corresponding execution. As part of our software visualization and analysis efforts we have developed a system that lets the programmer define what is meant by an event and then to track the resources used in processing that event through the system. The resultant data is currently used to produce visualizations of event-based resource utilization.
A Parallel Pipelined Renderer for Time-Varying Volume Data
Authors: Tzi-cker Chiueh, Kwan-Liu Ma
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Time-varying volume data take large storage space and visualizing them requires reading large files continuously or periodically throughout the course of the visualization process. Instead of using all the processors to collectively render one volume at a time, a pipelined rendering process is proposed by partitioning processors into groups to render multiple volumes concurrently. In this way, the overall rendering time may be greatly minimized because the pipelined rendering tasks are overlapped with the I/O required to load each volume into a group of processors; moreover, parallelization overhead may be reduced as a result of partitioning the processors. We modify an existing parallel volume renderer to exploit various levels of rendering parallelism and to study how the partitioning of processors may lead to optimum rendering performance. We find that two factors affecting the overall execution time are resource utilization efficiency and pipeline startup latency. The optimal partitioning configuration is the one that balances these two factors. Tests on Intel Paragon computers show that in general the optimal partitionings do exist for a given rendering task and result in 40-50% saving in overall rendering time.
The LAMS-DLC ARQ Protocol
Authors: Christopher Ward, Cheong H. Choi
Venue:  (1991)

In this paper we introduce a new data link control protocol appropriate for a low earth orbit (LEO) satellite network. The principle characteristics of an LEO satellite network are high error rates, long propagation delay, and high mobility. Although this area is traditionally dominated by forward error correction (FEC) we present a reliable protocol suited to this environment and derive the throughput for it given a finite buffer model. In our target network environment, reliability constraints may be relaxed provided that the protocol provides zero packet loss capability. The proposed scheme (called LAMS-DLC) provides a datagram service at the link level based on a Negative Acknowledgement ARQ scheme to accomplish error recovery. In LAMS-DLC the receiver sends commands for the following reasons only: to enable the sender to release buffer space held for previously transferred information frames (I-Frames); and to identify when the sender has failed. Commands are sent by the receiver so long as the link is active. The performance of the protocol is compared with the popular ARQ protocol HDLC. We show that LAMS-DLC performs better than the selective repeat HDLC and offers certain advantages in satellite networks.
Towards a comparison of evolutionary creativity in biological and cultural evolution
Authors: Andre Skusa, Mark A. Bedau
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Bedau and Packard have defined evolutionary activity statistics that illuminate the adaptive evolutionary creativity of biological evolution. The statistics enable us to visualize adaptive evolutionary dynamics and to measure the intensity and extent of adaptive evolution, and can be used to define qualitatively different kinds of evolving systems. Here we describe how to apply evolutionary activity statistics to systems undergoing cultural rather than biological evolution, and we report preliminary results of implementing this method in technological evolution as reflected in patent record data. Measuring evolutionary activity in patent records provides a clear picture of the major adaptive phenomena at work in the evolution of technology. It also enables the quantitative and empirical comparison of the adaptive evolutionary dynamics of biological and cultural evolution.
Multi-objectivity for brain-behavior evolution of a physically-embodied organism
Authors: Jason Teo, Hussein A. Abbass
Venue: Proceedings of the eighth international conference on Artificial life (2002)

In this paper, we present a pareto multi-objective approach for evolving the behavior and brain (an artificial neural network (ANN)) of embodied artificial creatures. We will attempt to simultaneously minimize the network size while maximizing horizontal locomotion. A variety of network sizes and behaviors were generated by the pareto approach. The best networks exhibited a higher level of sensory-motor coordination and the creature was able to maintain the walking behavior under different environmental setups.
Implementation method of high speed protocol as transport library
Authors: Y. Miyake, T. Kato, K. Suzuki
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Along with the rapid progress of optical technologies, the transmission speed of LANs and public networks has been increased significantly. As a result, it has become possible for computers distributed geographically to communicate with each other with high throughput. However, the current protocols such as TCP/IP have some problems, especially the performance through long distance and wide bandwidth networks. Therefore, new protocols with new data transfer algorithms are required. In this paper, we describe an implementation of a high speed transport protocol by a user level library which interfaces to UDP/IP. This method uses only functions commonly provided by UNIX operating systems, and therefore, allows a new protocol to be developed easily and to be ported to other UNIX workstations easily. Our library called the transport library realizes the coordination of buffer managements in the application and the library, and low overhead and prompt handling of receive and timer interrupts in order to achieve high performance. Our implementation results show 32 Mbits/sec over an ATM network whose effective transmission speed is 36 Mbits/sec, regardless of the propagation delay from 0 to 200 msec. These values of throughput are better than those of the in-kernel TCP programs
Integration of High-End and Low-End Animation Tools: A Case Study of the Production Pathway for the Chicago Bulls Broadcast Animation
Authors: Carlos R. Morales
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The broadcast animation division of High Voltage Software was contracted by the Chicago Bulls Organization to complete an animated opening to be shown at the United Center and on television before each home game. A team of animators and compositors developed a production pathway based on the use of motion capture data to coordinate the use of high-end NURBS based animation and lower-end polygonal based animation tools, and compositing software. 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 REPRESENTATION FOR THE TURBULENT MASS FLUX CONTRIBUTION TO REYNOLDS-STRESS AND TWO-EQUATION CLOSURES FOR COMPRESSIBLE TURBULENCE
Authors: J. R. Ristorcelli
Venue:  (1993)

The turbulent mass flux, or equivalently the fluctuating Favre velocity mean, appears in the first and second moment equations of compressible k-varepsilon and Reynolds stress closures. Mathematically it is the difference between the unweighted and density-weighted averages of the velocity field and is therefore a measure of the effects of compressibility through variations in density. It appears to be fundamental to an inhomogeneous compressible turbulence, in which it characterizes the effects of the mean density gradients, in the same way the anisotropy tensor characterizes the effects of the mean velocity gradients. An evolution equation for the turbulent mass flux is derived. A truncation of this equation produces an algebraic expression for the mass flux. The mass flux is found to be proportional to the mean density gradients with a tensor eddy-viscosity that depends on both the mean deformation and the Reynolds stresses. The model is tested in a wall bounded DNS at Mach 4.5 with notable results.
How Much for Just the Spider?: Strategic Web Site Marketing for Small-Budget Businesses
Authors: Bobette Kyle
Venue:  (2002)

From the Book:As Vice President of Marketing for a small, cookie business my challenge was to develop and launch the companys Web site. The Web site had to be an integral part of our marketing plan. A search for Web site marketing books cited titles that ranged from multi-level marketing, strategic marketing, and direct sales. These titles all addressed companies with substantial marketing departments and supportive budgets. I had only a Brand Manager and myself to produce all of the companys marketing, research, package design, and product development. We couldnt put the business on hold while we spent months developing a Web site marketing plan. I also could not afford to outsource my Web site marketing. So, I muddled through. I recently renewed my search for Web site marketing books. There was still need for a comprehensive, cut-to-the-chase planning/resource guide written for a business on a limited budget. I decided to write the book myself. I spent months surfing, reading, and researching. I applied my 10 years of business and marketing experience to what I had learned. The result  after more than a year of research and writing - is a set of directions and tools. This book will guide you through your Web site marketing plan creation and implementation. I trust you find it useful. 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
SomeCast: A Paradigm for Real-Time Adaptive Reliable Multicast
Authors: Jaehee Yoon, Azer Bestavros, Ibrahim Matta
Venue:  (1999)

Abstract SomeCast is a novel paradigm for the reliable multicast of real-time data to a large set of receivers over the Internet. SomeCast is receiver-initiated and thus scalable in the number of receivers, the diverse characteristics of paths between senders and receivers (e.g. maximum bandwidth and round-trip-time), and the dynamic conditions of such paths (e.g. congestion-induced delays and losses). SomeCast enables receivers to dynamically adjust the rate at which they receive multicast information to enable the satisfaction of real-time QoS constraints (e.g. rate, deadlines, or jitter). This is done by enabling a receiver to join SOME number of concurrent multiCAST sessions, whereby each session delivers a portion of an encoding of the real-time data. By adjusting the number of such sessions dynamically, client-specific QoS constraints can be met independently. The SomeCast paradigm can be thought of as a generalization of the AnyCast (e.g. Dynamic Server Selection) and ManyCast (e.g. Digital Fountain) paradigms, which have been proposed in the literature to address issues of scalability of UniCast and MultiCast environments, respectively. In this paper we overview the SomeCast paradigm, describe an instance of a SomeCast protocol, and present simulation results that quantify the significant advantages gained from adopting such a protocol for the reliable multicast of data to a diverse set of receivers subject to real-time QoS constraints.
Solving a Media Mapping Problem in a Hierarchical Server Network with Parallel Simulated Annealing
Authors: Xiaobo Zhou, Reinhard Lüling, Li Xie
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Advances in storage and high-speed broadband communication network technologies are making it feasible to design and implement distributed scalable Video-on-Demand server networks. In this paper, a hierarchical structure for a server network is proposed to support a metropolitan TV-Anytime service. A key issue, how to map the media assets onto such a hierarchical server network, is addressed in this paper. The definition and heuristic methods for the solution of this new combinatorial optimization problem are presented. The mapping problem studied here addresses the management of media assets considering communication bandwidth limitation and access pattern. The methods presented in this paper are based on parallel simulated annealing and are verified by the use of a set of benchmark instances. The results show that the methods provide a near to optimal performance in terms of the Quality of Service (QoS).
The interaction between the V protocol and the Q.293I protocol for the interactive video network
Authors: M. J. McPheters, H. T. Nguyen, M. T. Midani
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

There are many examples of interactive visual and multimedia applications including Movies on Demand, video conferencing, etc., which are emerging in trials and eventually in full service networks. Technology and standards are being developed for these services and networks. DSM-CC (Digital Storage Media Command and Control), a sub-group of MPEG, is one such standard. AT&T has been active in the DSM-CC sub-group, submitting its V Protocol in cooperation with other companies. The V Protocol is a message based session layer protocol with a defined set of procedures for establishing sessions and releasing sessions/resources across the Interactive Video Network (IVN) which could include an ATM network. We discuss the interaction between the V Protocol and the ATM Q.2931 network layer protocol to set up sessions over the IVN that require ATM switched virtual circuit connections. The ATM Q.2931, connection is treated as one of many possible resources for a given session. By having a clear separation between a session and its resources, the V Protocol is capable of supporting dynamic resource allocation in a distributed server environment
Using Haptic Vector Fields for Animation Motion Control
Authors: Bruce R Donald, Frederick Henle
Venue:  (1999)

We are exploring techniques for animation authoring and editing using a haptic force-feedback device. In our system, a family of animations is encoded by a bundle of trajectories. This bundle in turn defines a time-varying, higher-order vector field on a configuration space for the animation. A haptic input device provides a low-dimensional parameterization of the resulting dynamical system, and the haptic force feedback permits browsing and editing of the space of animations, by allowing the user to experience the vector field as physical forces.