ppxscal/embedding_network huggingface dataset:
A unified media presentation method for multimedia information networks
Authors: Y. Shibata, N. Seta, M. Katsumoto
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Hypermedia systems are very important as platforms in the future multimedia information network services. In order to provide more flexible and sophisticated multimedia presentation, it is desirable to simply and efficiently transmit various media data from the databases distributed over network and present them on the user station depending on scenario so as to semantically integrate into multimedia information objects. In this paper, a new hypermedia system which is based on object-oriented structure to perform two different temporal synchronization methods, "lip synchronization" and "scene synchronization" is introduced. Lip synchronization method performs, fine-grained temporal synchronization between continuous media, such as audio and video. On the other hand in scene synchronization, coarse-grained temporal relation between continuous media and discrete media, such as image, graphics or text is maintained depending on the presentation scenario. Furthermore, several media which are semantically related to each other are unified into a Media Group (MG) to simplify its media treatment. The MGs and their involved processing functions are encapsulated into a Media Object (MO) and easily controlled by message passing procedure. In this paper, implementation of the hypermedia model which performs scene synchronization function between discrete and continuous media in the MOs depending on the presentation scenario, and context switching function between each media presentation is precisely described. Finally "Electric Museum" as a prototype application of hypermedia systems is introduced to evaluate the suggested synchronization mechanism.
A Simple Simulator for Multicomputer Routing Networks
Authors: Michael J. Pertel
Venue:  (1992)

This report describes a concise program for simulating multicomputer routing networks [1]. The simulator is written in less than 200 lines of C code, and a complete listing is provided. Despite being terse, the simulator is exact, fast, and requires little memory.
Comparison between PVM on RHODOS and Unix
Authors: Justin Rough, Andrzej Goscinski
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

This report presents the architecture, services and performance results obtained from the implementation of the PVM parallel processing tool supported by either the Unix operating system and the RHODOS distributed operating system. It is shown that the provision of several advanced services in RHODOS allow the implementation of PVM to be greatly simplified, and significant speed-ups to applications can be achieved. These services allow the dynamic establishment of a virtual machine by removing heavily loaded and adding idle/lightly loaded workstations, place processes on workstations to optimise static allocation, instantiate processes using group process creation and balance load dynamically using process migration. The performance study shows that the processing time of PVM applications executed on the RHODOS virtual machine is much shorter than those achieved on the Unix virtual machine.
Behind the Curtain at LEO: A Personal Reminiscence
Authors: David Tresman Caminer
Venue: IEEE Annals of the History of Computing (2003)

This reminiscence recalls the environment in which LEO came to be built, the personalities involved, the major problems that were encountered, and the circumstances that led to the disappearance of the brand at the time when it was achieving its greatest successes. From first to last, LEO's active life span was only 20 years.
The origins of mimicry rings
Authors: Daniel W. Franks, Jason Noble
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Mutualistic Müllerian mimicry and parasitic Batesian mimicry can co-exist in mimicry rings, i.e., mimetic relationships between multiple species. Theory suggests that all Müllerian mimics in an ecosystem should converge into one large ring. Potentially, the presence of Batesian mimics will encourage convergence. It has been suggested that rare species should seek out common species as models. Mimicry rings have not previously been modelled; we present an evolutionary simulation to investigate the above questions. Complete convergence is not observed although Batesian mimicry is shown to be important factor in the origin of mimicry rings.
Mobile Approach Support System for Future Machine Tools
Authors: Rainer Daude, Manfred Weck
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

To address the most critical problem areas of skilled workers at machine tools with suitable interaction devices, a mobile approach support system is being developed. This system consists of a head-mounted display (HMD), a speech processing unit, a wearable PC as the command unit for these components, and a control pendant with force-feedback control elements. The whole system communicates with the numerical control of the machine tool via a wireless, IrDA-compatible infrared transmission. In an usability study, the majority of the participants approved the HMD as well as the force-feedback technology as innovative components of future human-machine- interfaces.
Bluetooth Profiles: The Definitive Guide
Authors: Dean A. Gratton
Venue:  (2002)

:Build reliable, interoperable Bluetooth productsright now! Practical guidance for building reliable, interoperable Bluetooth products Covers usage models, profile principles, user expectations and dependencies Details every foundation profile and key application, from cordless telephony to file transfer Introduces emerging profiles for personal area networking, imaging, printing and automotive applications Shows how to build your own new profilesBluetooth Profiles are the key to delivering interoperable products that work reliably, "right out of the box." Now, leading Bluetooth expert Dean Anthony Gratton brings the Bluetooth Profiles to life, showing you exactly how to use them to build winning user-centered products. Gratton takes you "under the hood" of every significant Bluetooth Profile, from Bluetooth's essential Foundation Profiles to powerful emerging profiles for personal area networking, automotive applications and imaging. Drawing on his extensive experience with Bluetooth development, Gratton also offers practical guidance for creating innovative new profiles of your own. Accessible, authoritative coverage of usage models, profile principles, user expectations and dependencies Presents practical introductions to GAP, SDAP, OBEX and SPPthe Foundation Profiles that underlie most of Bluetooth's application development Covers all core Bluetooth application profiles: cordless telephony, intercom, headset, dial-up networking, fax, LAN access, object push, file transfer and synchronisation Previews new profiles for imaging, printing, extended services discand much more Contains a concise "macro-level" review of current Bluetooth protocol stacks and development kits Includes a detailed Bluetooth glossary and reference section 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
On reducing the sensitivity of software reliability to variations in the operational profile
Authors: B. Cukic, F. B. Bastani
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

In the statistical sampling method, as in any other statistical approaches for measuring software reliability, the inputs to the program are chosen according to the estimated probability with which they occur in field use, forming the operational profile. However, in practice it is very difficult to accurately assess the operational distribution of input points. Furthermore, a variety of factors can cause the operational distribution to change during field use making the estimation even more difficult. Musa (1993) has suggested that reducing the size of the input domain simplifies the task of determining operational profiles. We present a class of techniques that reduce the dimensionality of input domains and describe their application. These techniques do not limit the functionality or change the input-output behavior of the program. An additional benefit of these techniques is the insensitivity of the reliability estimate to variations in the operational profile of variables eliminated from the input domain.
On-Line Handwriting Recognition Using Character Bigram Match Vectors
Authors: Adnan El-Nasan, Michael Perrone
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper describes an adaptive, partial-word-level, writer-dependent, handwriting recognition system that utilizes the character n-gram statistics of the English language. The system exploits the linguistic property that very few pairs of English words share exactly the same setof character bigrams. This property is used to bring linguistic context to the recognition stage. The recognition is based on, estimating the probability of bigram co-occurrences between words. Preliminary experiments using naive features and limited training sets show that the system can recognize over 60% of words it has never seen before in handwritten form. The system has only few trainable parameters. In addition, incremental training is computationally inexpensive.
Structuring utterance records of requirements elicitation meetings based on speech act theory
Authors: M. Saeki, K. Matsumura, J. Shimoda, H. Kaiya
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

This paper discusses a technique to structure utterance records of the meetings for requirements elicitation based on speech act theory. To elicit requirements to the system to be developed, the customers and the developers often have a series of face-to-face meetings. Utterances in verbal conversation made during the meetings include not only declarative information but also speech acts such as "commitment", "supporting a solution", "explaining a rationale" and so on. Extracting this information leads to clarifying customers' intent, decision rationale, and what problems have not been solved yet and remain unsolved in requirements elicitation phase. The point is how we extract speech acts from utterances and hold structurally them so as to use them afterwards. Our emphasis is on specific words (called keywords) included in utterances. These keywords can suggest what topics are discussed in the utterances and which speech acts the utterances have. Our technique has been assessed by experimental case studies and we have their good applicability to actual meetings for requirements elicitation.
VTRACE and Communication Performance Analysis
Authors: Peng Dai, Thomas W. Doeppner,  Jr.
Venue:  (1995)

As the requirements for communication performance grow and the vast variation and improvement in hardware components increase, the various functionally different software layers have been increasingly responsible for performance degradation. In this paper, we explore the use of VTRACE, a tracing facility provided in Solaris, as a general methodology in communication per formance analysis and also present performance data for an experimental version of Sun''s Solaris Operating System.
Software Architecture Analysis Based on Statechart Semantics
Authors: Marcio S. Dias, Marlon E. R. Vieira
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

High assurance architecture-based and component-based software development relies fundamentally on the quality of the components of which a system is composed and their configuration. Analysis over those components and their integration as a system plays a key role in the software development process. This paper describes an approach to develop and assess architecture and component-based systems based on specifying software architecture augmented by statecharts representing component behavioral specifications. The approach is applied for the C2 style, associated ADL, and is supported within a quality-focused environment, called Argus-I, which assists specification-based analysis and testing at both the component and architecture levels.
Special Edition Using Solaris 9
Authors: Ganesh Govindaswamy, Tanuj Jain, Radhika Girisan
Venue:  (2002)

:Special Edition Using Solaris 9 is intended to be a one-stop, in-depth reference guide to Solaris 9, a UNIX operating system by Sun Microsystems. It focuses on the reader gaining real-life exposure to the functions of the operating system. This book avoids jargon, and emphasizes brevity and clarity. It also covers key features of Solaris 9 such as NIS/NIS+, Solstice DiskSuie, Solstice AdminSuite, WebFS, JumpStart, and WebStart.
Optimal mobile location tracking by multilayered model strategy
Authors: Junping Sun, H. C. Lee
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

We developed a multilayered model for the purposes such as mobility management, mobile activity modeling, and optimal paging and mobile location tracking. A bottleneck in the forward control channel (FOCC) is caused due to constraints such as the limited bandwidth and number of radio frequency channels, and inefficiency of conventional mobile paging methods in mobile telecommunication systems. In order to minimize the paging cost and to maximize utilization of the bandwidth in the FOCC, we develop a new paging schema, based on the multilayered model, with the optimal partition of paging zones. By using the refined mobile's probability pattern stored in a statistical profile, we employ the genetic algorithm and the probabilistic cost function to generate the optimal partition of paging zones such that the paging cost to locate a mobile station as well as the bandwidth consumption in the FOCC is minimized.
The WearBoy: A Platform for Low-Cost Public Wearable Devices
Authors: Peter Ljungstrand, Staffan Björk, Jennica Falk
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We introduce the WearBoy - a wearable, modified Nintendo GameBoy - as a platform for exploring public wearable devices. We have minimized the size of a Color GameBoy circuit board to enable users to comfortably wear it, making the device not much larger than the actual screen. Technical properties of the WearBoy are discussed, along with two applications using the platform.
Using Clustering to Support the Migration from Static to Dynamic Web Pages
Authors: Filippo Ricca, Paolo Tonella
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Web sites of the first generation consist typically of a set of purely static Web pages. Content and presentation are not separated, and a same page structure is replicated everytime a similar organization of the information is devised. Such a practice poses several problems to the evolution of these sites. It is not easy to update the content, and each time the HTML structure is modified, the same changes have to be propagated to all replications.In this paper, an approach is proposed for the identification of the Web pages that are more amenable to be migrated into a dynamic version, in that they share a similar structure, filled in with a content organized according to a common scheme. Clustering is used for this purpose: a common template is extracted from the pages in the same cluster, and the variable information of the pages matching the template is migrated to a database. A server side program extracts the requested information from the data base, and generates dynamically the HTMLpages to be displayed in the browser.
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
Authors: B. Llanas, M. Fernandez De Sevilla, V. Feliu
Venue: Journal of Global Optimization (2003)

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.
Exposure to Deadlock for Communicating Processes is Hard to Detect
Authors: Thomas Raeuchle, Sam Toueg
Venue:  (1983)

It is shown that the applicability of global state analysis as a tool for proving correctness of communication protocols is rather limited. Brand, et al. showed that reachability of global deadlock states for protocols with unbounded FIFO channels is undecidable. It is shown, that the same is true for unbounded non-FIFO channels. For bounded FIFO channels the problem is shown to be PSPACE-hard. Protocols with bounded non-FIFO channels are shown to be analyzable in polynomial time.
Adobe Photoshop Elements 2.0: A Visual Introduction to Digital Imaging, 2 edition
Authors: Phillip Andrews
Venue:  (2003)

:If you are just starting to work with digital images and have chosen Adobe Photoshop Elements as your manipulation package, then this best-selling guide is the one for you. You can create professional quality images for print, the Web and email with this innovative package. Special emphasis is placed on how to create a home page without having to learn HTML via the Web Photo Gallery, and how to prepare images step-by-step, both for your website and for printing via high-quality ink jet printers. Real life examples, fully updated to cover all the new Elements 2.0 features, show you how to put each technique into practice. Full color, high quality illustrations show you what you can achieve. The associated website gives you all the tools you need to fine tune your skills. Images featured in the book are provided online so you can try out each technique as you read. Printable lesson plans for teachers are also included on the website, along with useful links and updates so you have all you need at your fingertips to get the best out of Elements. Philip Andrews is a photographer, author and lecturer at the Queensland School of Printing and Graphic Arts, Australia. He is also a beta tester for both Photoshop and Photoshop Elements and he's a regular contributor to several magazines including Amateur Photographer, Australian Photography and Better Photography and is also senior contributing editor for Better Digital and contributing editor for What Digital Camera.
Autonomy and Community
Authors: Kinji Mori
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

Since Autonomous ecentralized Systems have been proposed in 1977 and published [1 ], their technologies and applications in control and information fields have progressed and some of their technologies are approved as the de-facto standards of ODVA (Open DeviceNet Vendor association), OMG (Object Management Group), etc. Recently the ADS have been accelerated more under the unpredictable recent markets for the worldwide huge but service-oriented autonomous community for specific local-majority users, and for the complex and changing system management [2 ]. In these systems, the ADS new paradigm is required to satisfy the heterogeneous requirements for the various autonomous systems under the evolving and to assure these systems operation.
Mobile Host Internetworking Using IP Loose Source Routing
Authors: David B. Johnson
Venue:  (1993)

Internetworking protocols such as IP currently do not allow "mobile hosts" to interoperate easily or conveniently with other hosts on the network. A host''s IP address encodes the network number to which the host is connected, which prevents IP datagrams from reaching the host when it moves to a new location and connects to the Internet within a different network. This paper presents a new protocol for allowing mobile hosts to transparently interoperate in the Internet using IP. The protocol is designed to make use of existing facilities of the IP protocol architecture where possible, in order to minimize any changes necessary to existing protocol software. The protocol takes advantage of the standard IP loose source routing option for routing datagrams correctly to mobile hosts, while allowing the hosts to retain their normal "home" IP address even when connected to a foreign network. The protocol is simple and scales well to large numbers of mobile hosts. It requires fewer changes to existing software and adds less overhead to the network than previous IP mobile host internetworking protocols.
Boosting the Performance of NOW-Based Shared Memory Multiprocessors Through Directory Hints
Authors: Hung-Chang Hsiao, Chung-Ta King
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Directory hints help a node in a NOW-based shared memory multiprocessor to keep track where valid copies of a memory block may reside. With this information, the node can fetch the block directly from those nodes on a read miss. In this way the number of network transactions to serve the miss may be reduced and the expensive directory lookup operation may be removed from the critical path.In this paper, we discuss the issues involved in implementing the directory hint scheme on a NOW-based shared memory multiprocessor and examine one such implementation, which employs a small and fast cache to store the hints. Our simulation results show that the directory hint scheme can effectively reduce the read stall time. Also its performance is very competitive compared with a more expensive implementation which uses a large level-three cache.A drawback of the scheme is that it will introduce extra network traffic. We believe that the state-of-the-art interconnection networks, such as those built upon the SGI Spider [11] and the Intel Cavallino [6] chips, provide the opportunity to make the directory hint scheme feasible even with the slower network such as the one built by Myrinet switches [10].
Independent multiresolution component analysis and matching pursuit
Authors: E. Capobianco
Venue:  (2001)

We show that decomposing a class of signals with overcomplete dictionaries of functions and combining multiresolution and independent component analysis allow for feature detection in complex non-stationary high frequency time series. Computational learning techniques are then designed through the Matching Pursuit algorithm, whose performance is monitored so to extract relevant information about the structure of the volatility function. We refer to wavelet and cosine packet dictionaries due to the fact that with intra-daily time series some features of the underlying stochastic processes may remain undetected when standard volatility models are applied to the observed data. Independent component analysis results are particularly encouraging and suggest a better compromise between time and frequency resolutions, and thus a more efficient and accurate Matching Pursuit performance. 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