ppxscal/embedding_network huggingface dataset:
Hades: A Middleware Support for Distributed Safety-Critical Real-Time Applications
Authors: Emmanuelle Anceaume, Gilbert Cabillic, Pascal Chevochot, Isabelle Puaut
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Most distributed safety-critical real-time systems designed in the past have been specialized to meet the particular requirements of the application domain to which they were targeted. This approach led to specific, inflexible, dedicated and non-reusable solutions, often based on specialized hardware. This paper presents an overview of Hades, which provides a set of flexible tools built on top of off-the-shelf hardware, and designed to help in the construction of a panel of distributed safety-critical real-time applications. In order for Hades to support the execution of the widest range of applications, we have followed a rigorous methodology based on (i) the separation of services dedicated to a specific application domain (scheduling policy) from services providing a range of robustness properties common to a large spectrum of application domains (e.g. task dispatching, fault detection, clock synchronization, monitoring); (ii) the provision of a precise cost information induced by all these services in order to increase the accuracy of the application feasibility test.
Advanced J2EE Platform Development: Applying Integration Tier Patterns
Authors: Torbjorn Dahlen, Thorbiorn Fritzon
Venue:  (2003)

A proven Java(TM)-based approach to standardizing and streamlining legacy migrationThis book focuses on the key challenges developers face when using the Java 2 platform Enterprise Edition (J2EE) to encapsulate legacy applications for delivery in a multi-tier Internet environment. Leading Sun architects Torbjoern Dahlen and Thorbioern Fritzon show how to standardize encapsulation using an integration tier that shields the J2EE elements of an application from the properties and demands of its legacy elements. Using this approach, enterprises can promote reuse, accelerate legacy migration projects, and make the most of their COBOL/mainframe and Java expertise. Above all, they can take portability beyond hardware and operating systems, systematically migrating virtually any legacy system without extensive redesign or reprogramming. Presents a pragmatic approach to domain modeling for legacy application migration Promotes reuse and portability through a standardized, fine-grained domain object model Shows how to streamline the transformation of domain models to working systems Introduces a proven, pattern-based J2EE application architecture for Internet-enabling legacy systems Includes superior algorithms for object queries, data cleansing and merging, and artificial XA supportAdvanced J2EE Platform Development presents detailed examples and sample code, including a start-to-finish case study that demonstrates integration between three different legacy systems.
Distributed knowledge-base: adaptive multi-agents approach
Authors: J. S. Mertoguno, Wei Lin
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper studies an approach of using multi-agents theory to construct an adaptive knowledge based system. To represent the knowledge, frame base (graph) knowledge representation has been chosen. The driving force of this study is the intention of having a distributed (possibly across the net) adaptive knowledge base. The challenge of developing an adaptive knowledge base depends on how to evolve the knowledge (adaptivity) and how to control the evolution (maintain the quality of the knowledge). In this paper the manifestation of both the issues discussed on our model is addressed.
Illustrator 10: Mastering Artistic Design
Authors: Sae Nan Jung, Sae Nun Jung
Venue:  (2002)

:Written for the professional designer, this reference teaches users the advanced techniques and applications of Adobe Illustrator 10. Through the use of stunning artistic examples and step-by-step explanations of 13 projects, designers will learn how to use the new features of the updated software. These tools include the symbols tool, which creates and updates repeating elements, and liquefy tools to transform image design objects. Included is a CD-ROM containing original artwork and source files.Author Biography: Hyun Sook Seo and Sae Nan Chong are project managers at Howcom.
Information landscaping: information mapping, charting, querying and reporting techniques for total quality knowledge management
Authors: Bor-sheng Tsai
Venue: Information Processing and Management: an International Journal (2003)

Information landscaping--an integration of information mapping, charting, querying and reporting techniques--has been developed to enable the construction of a total quality knowledge management system focusing on a particular subject information field. The techniques apply five major parameters of the Fuzzy commonality model (FCM) including unionization, quantity, continuity or stability, changeability, and critical probability, to construct a series of information maps (infomaps) and a set of chronological-statistical charts (infocharts). The infomaps and infocharts are used as the blueprints and navigation agents for building and developing a web-based subject experts depository and query-report system. Focusing on the subject experts/expertise, this system enables a researcher to expedite a query search through infomaps (qualitative reference) and infocharts (quantitative reference). The entropy measurement and the entropy constant (the square root of the average entropy measure) are calculated to compare with the critical probability of the FCM. This leads to the finding of a set of regression straight lines and the establishment of an information oscillogram. The tropics (upper limit, middle range, lower limit), and the potential/ solstitial population and its growth rate within a subject information domain during a particular time period can be determined. They can effectively and efficiently guide librarians and information professionals towards the construction and the continuous development of an electronic collection. The cultivation of a virtual learning and referencing environment can also be created by utilizing this data.
An Automatic Image - Gathering System for the World-Wide Web by Integration of Keywords and Image Features
Authors: Keiji Yanai
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Due to the recent explosive progress of WWW (World Web), we can easily access a Large number of images from WWW.However, methods to utilize WWW as a largeImage database have not been established yet.In this paper, we propose an Automatic image gathering system from WWW employing both keywords and imageFeatures, which as called Image Collector.By exploiting some existing keyword-basedSearch engines and selecting images their image features, the system obtains more than one hundred images related to query keywords in about give minutes.
Popularity-Aware Greedy Dual-Size Web Proxy Caching Algorithms
Authors: Shudong Jin, Azer Bestavros
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Web caching aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather, other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an on-line fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies.Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches. This trend points to the need for proxy cache replacement algorithms that directly capture popularity information.In this paper, we (1) present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy, (2) propose a novel cache replacement policy that uses such information to generalize the well-known Greedy Dual-Size algorithm, and (3) show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics.
GoLive 6 Magic
Authors: Paul Vachier, Rob Keniger, Jay Bain, Caleb John Clark, Gregory Knab
Venue:  (2002)

:Explore the power, functionality, and flexibility of GoLive through many customizable projects in GoLive 6 Magic. An impressive array of contributors present 14 projects designed to show intermediate to advanced users the flexibility and power of GoLive. Each project is 10 to 15 pages in length and provides timesaving tips, tricks, and real-world solutions in a graphically appealing manner. Any project, tip, or technique in this book can be customized to fit your own needs. The CD includes all of the files necessary to complete the projects as well as demo versions of related software.
On-line Maintenance with On-the-fly Software Replacement
Authors: Steffen Hauptmann, Josef Wasel
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

At Philips Research Laboratories Aachen we have found a way to reconfigure software in embedded systems like, for example, switches or set top boxes. The goal of the reconfiguration is to repair software faults and to update software functionality. This should be done on-the-fly without decreasing the system's availability which means during the on-going operation of the system. The developed approach is based on available distributed operating system technology (Chorus) and on a widely used family of programming languages (C/C++). It does neither require changes in the operating system nor in the development system. All needed adaptations are done in the application. However, it was our goal to keep the development of the application functionality separated from the creation of the replaceability. An application is in large parts made replaceable through some systematic changes which can be done automatically. Some additional effort is still needed. This paper describes the mechanisms developed for that purpose. As a reconfiguration unit we have chosen a Chorus actor which is kind of a multi-threaded process. We describe how to make such a process replaceable. Finally, we give some performance figures to show the efficiency of the implemented algorithms.
On the Stability of Software Clustering Algorithms
Authors: Vassilios Tzerpos, Richard C. Holt
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

A crucial step in understanding a large legacy software system is to decompose it into meaningful subsystems, which can be separately studied. This decomposition can be done either manually or automatically by a software-clustering algorithm (SCA). Similar versions of a software system can be expected to have similar decompositions. We say an SCA is stable if small changes in its input (the software system) produce small changes in its output (the decomposition). This paper defines stability formally, explains why it is an essential property for an SCA, and gives experimental results from evaluating the stability of various decomposition algorithms suggested in the literature.
On asymptotic behaviour of the difference equation XN+1= &#x0026;#x03B1; + XN-1P/XNP
Authors: H. M. El-Owaidy, A. M. Ahmed, M. S. Mousa
Venue: The Korean Journal of Computational Applied Mathematics (2003)

In this paper, we investigate local stability, oscillation and boundeness character of positive solutions of the difference equation xn+1=α+xn-1p/xnp,n=0,1,... under specified conditions.
Effect of operators on straight line complexity
Authors: D. Boneh, R. J. Lipton
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

This paper concerns lower bounds on the straight line complexity of multi-variate polynomials. We obtain a conditional result showing that certain explicit linear operators must greatly increase the complexity of some polynomials. We do so by showing that if these operators roughly preserve the complexity of all polynomials then, co-NP is in AM. We show that certain explicit operators must vastly increase the straight line complexity of certain polynomials.
Learning from Inconsistency
Authors: Steve Easterbrook
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

This position paper argues that inconsistencies that occur during the development of a software specification offer an excellent way of learning more about the development process. We base this argument on our work on inconsistency management. Much attention has been devoted recently to the need to allow inconsistencies to occur during software development, to facilitate flexible development strategies, especially for collaborative work. Recent work has concentrated on reasoning in the presence of inconsistency, tracing inconsistencies with "pollution markers", and supporting resolution. We argue here that one of the most important aspects of inconsistency is the learning opportunity it provides. We are therefore concerned with how to capture this learning outcome so that its significance is not lost. We present a small example of how apprentice software engineers learn from their mistakes, and outline how an inconsistency management tool could support this learning. We then argue that the approach can be used more generally as part of continuous process improvement.
Neural Network System for Measurement of Movement Plasma Parameters in Electrodynamic Railgun
Authors: Evgeny V. Kirievskij
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Use neural networks is offered for system for measurement of a plasma movement parameters in the channel of an electrodynamic accelerator («railgun»).The algorithm of functioning such system is based on application of the Method of the Coordinate Function (MCF) offered by the author.It is shown, that as against known measuring systems the offered structure on base neural networks allows to raise measurement accuracy of instant speed and position (coordinate) of plasma in the channel of the electrodynamic accelerator.Results of researches were received with use of the computing experiment on mathematical model and computing program "MMVS" offered by the author. 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
Modeling pathological patterns of spoken natural language by using SPNs
Authors: B. Roy, D. Kavraki, N. Bourbakis
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper deals with the modeling of spoken natural language (NL) to detect schizophrenic patterns. The modeling and analysis of the spoken NL is based on its formal representation by using stochastic Petri nets (SPNs) and the synthesis of the SPN forms for the appropriate interpretations and the detection of schizophrenic patterns, if any.
Performance Study of Token-Passing Protocol for Traffic Multiplicity in Optical Networks
Authors: S. Selvakennedy, A. K. Ramani
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper extended a mathematical technique to model the behavior of token-passing protocol in a star-coupled wavelength-division multiplexing (WDM) optical network for traffic multiplicity, based on a semi-Markov process. This analytical model is able to predict the results accurately. It is found that the proposed static priority scheme performs reasonably well in relatively stable and predictable network load. The performance of lower priority traffic can be improved by employing bigger buffer space.
Macromedia Fireworks MX for Windows and Macintosh: Visual QuickStart Guide, 2 edition
Authors: Sandee Cohen
Venue:  (2002)

:This is the fourth update to Peachpit's Visual QuickStart Guide to Macromedia Fireworks, a tool that creates both raster and vector-based graphics for the Web. Fireworks is more than a drawing and effects tool, it's also capable of generating buttons, image maps, simple animations, and their underlying code. Additionally, if you use other Macromedia Web tools, such as Dreamweaver or Flash, Fireworks can be used "roundtrip" with them when editing and updating your Web pages. This edition will cover the newest features in Fireworks, in addition to the clear, step-by-step instructions on how to use all the existing graphics and text features in the program.
Hierarchical Modeling for Reliability and Performance Measures
Authors: Malathi Veeraraghavan, Kishor Trivedi
Venue:  (1988)

In this paper we model three aspects of fault-tolerant multiprocessor systems and study their influence on both performance and reliability measures in a combined way. These include concurrency, contention and fault-tolerance. Hierarchical modeling allows complex systems to be analyzed easily by splitting the overall model into layers. SHARPE is a powerful tool which allows the use of eight different model types that can be hierarchically combined to obtain a solution for some measure of the whole system. SHARPE also allows general distributions and hence instead of assuming exponentially distributed random variables, we can model more realistic cases. Examples presented here are small for ease of explanation; however, larger problems have also been solved within this framework. This paper thus lays the ground work for modeling existing systems with real data using these techniques.
Segmentation of Salient Closed Contours from Real Images
Authors: Shyjan Mahamud, Karvel K. Thornber, Lance R. Williams
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real edge images. The measure also incorporates the Gestalt principles of proximity and smooth continuity that previous methods have exploited. Unlike previous measures, we incorporate contour closure by finding the eigen-solution associated with a stochastic process that models the distribution of contours passing through edges in the scene. The segmentation algorithm utilizes the saliency measure to identify multiple closed contours by finding strongly- connected components on an induced graph. The determination of strongly connected components is a direct consequence of the property of closure. We report for the first time, results on large real images for which segmentation takes an average of about 10 secs per object on a general-purpose workstation. The segmentation is made efficient for such large images by exploiting the inherent symmetry in the task.
Discrete Equations and Software Reliability Growth Models
Authors: Daisuke Satoh, Shigeru Yamada
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

We propose a criterion to determine a more approprite software reliability growth model in the early development phase.The criterion with a discrete software reliability growth model determines the absolute worth of a model because the discrete software reliability growth model perfectly reproduces the parameter estimates when the data are used as an exact solution of the equation.The values of the proposed criterion of a discrete software reliability growth model are smaller than those of another software reliability growth model in all periods during the test phase with actual data sets. The discrete software reliability growth models are described with difference equations which have exact solutions.The models yield accurate parameter estimates in spite of a small amount of input data in an actual software testing. Therefore, the criterion and discrete software reliability growth models enable us to predict in the early development phase when software can be released.
The First Aysnchronous Microprocessor: The Test Results
Authors: Alain J. Martin, Steven M. Burns, T. K. Lee, Drazen Borkovic, Pieter J. Hazewindus
Venue:  (1989)

No abstract available.
Determination of Placement of a Body-Attached Mouse as a Pointing Input Device for Wearable Computers
Authors: Bruce Thomas, Karen Grimmer, Dan Makovec, Joanne Zucco, Bernard Gunther
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We investigated the effects of placement of computer input devices on a user's body for the control of a wearable computer. This study involved 25 subjects performing selection tasks with a Touch pad mouse while wearing a wearable computer on their back and using a head mounted display. The each subject performed the tasks in 27 different combinations of four posture (sitting, kneeling, standing, and prone) and seven different placements of the Touch pad mouse on the subject's body (forearm, thigh by 2, torso by 2, and upper arm by 2). We measured the time and error rate to complete the selection of a circular target. The results for the effects due to posture showed there were similar time effects for sitting, standing, and kneeling. When examining the effects due to mouse position, the front of the thigh was shown to be the best position of the mouse. When the posturing and mouse position conditions were combined, the results indicated the thigh front mouse position would most appropriate for sitting kneeling, and standing postures, and the forearm mouse position is to be used for the prone position.
Randomized Graph Drawing with Heavy-Duty Preprocessing
Authors: David Harel, Meir Sardas
Venue:  (1995)

We present a graph drawing system for general undirected graphs with straight-line edges. It carries out a rather complex set of preprocessing steps, designed to produce a topologically good, but not necessarily nice-looking layout, which is then subjected to downhill-only version of Davidson and Harel''s simulated annealing beautification algorithm. The intermediate layout is planar for planar graphs and attempts to come close to planar for non-planar graphs. The system''s results are better and faster than what the annealing approach is able to achieve on its own.
Root for all on the SE Linux play machine
Authors: Russell Coker
Venue: Linux Journal (2003)

Set visitors loose as root and see what they break--can SE Linux alone keep the system safe? 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