ppxscal/embedding_network huggingface dataset:
An Algorithm for Detecting Termination of Distributed Computation in Arbitrary Network Topologies within Linear Time
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

To determine if a distributed process has terminated is very important. Several algorithms have been proposed for this purpose since early 1980s. Unfortunately, most of these algorithms assume a logical ring structure on network topology. Thinking that in order to form a logical ring, one may need either include some channels in a logical ring for more than once or physically add some extra channels to a network if the network itself does not physically form a ring, it is obvious to see that these algorithms may increase network expenses.This paper proposed a two-phase algorithm which does not require a logical ring topology, thus eliminating both multiple use of some channels in a logical ring and introduction of extra channels to a network. The algorithm can be finished in O(D+M) time in the worst case, here D denotes the distance of the network, M denotes the number of computation messages occurring during the execution of the algorithm. The message complexity of this algorithm for each successful detection is O(E+M), here E denotes the number of edges in the network.
Modeling a faster data warehouse
Authors: J. H. Hanson, M. J. Willshire
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

One key area involved in implementing the data warehouse is the transfer of information from the Source Databases (SDBs) into the data warehouse and making it available to the user. In looking at the overall intent of the data warehouse as a repository for vast amounts of diverse information, changes made to the SDBs, can be critical to the correctness of the query responses provided by the warehouse. The paper presents an alternative to the state of the art data warehouse environment by providing an auxiliary structure to accept these updates and store them until the data warehouse has available cycle time to incorporate the new data and update the necessary views. Using the Integrated Definition (IDEF) modeling process, we have created models of both the state of the art and alternative data warehouse structures to validate our design and performance characteristics.
Avionics software problem occurrence rates
Authors: M. L. Shooman
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

This paper discusses a feasibility study which developed estimates of the occurrence rate for significant avionics software problems. Two FAA databases, airworthiness directives (ADs) and service difficulty reports (SDRs) were used. A study of the AD database for large aircraft (1984-1994) revealed 33 avionics ADs, 13 of which were software related. Estimates were made of the operational hours for the fleet of commercial aircraft with computer avionics and the number of problem occurrences. Minimum, maximum and average occurrence rates were established. The average occurrence rate for the 6 resulting data sets was 0.15 per million operating hours. The nonoccurrence of ADs for the remaining avionics was "bounded on the average"; yielding less than 0.02 occurrences/per million hrs. The significant problem occurrence rate for the TCAS system (collision avoidance) software has motivated others to apply proof of correctness techniques to the specification and design of this software (Craigen et al., 1994).
Application of focus + context to UML
Authors: Benjamin Musial, Timothy Jacobs
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

UML class diagrams of complex software systems are frequently very large, making it difficult to gain a detailed understanding of the underlying software components within the context of the overall software system. To overcome this limitation, we apply focus + context visualization techniques to an interactive UML browser. We display software components at varying levels of detail according to a dynamic degree of interest function. We then lay out the diagram components to maximize space efficiency while emphasizing the relationships between components. Preliminary results of our work are presented here.
The HOCA Operating System Specifications
Authors: Ozalp Babaoglu, Fred B. Schneider
Venue:  (1983)

NO SUPPLIED
Microsoft Office Access 2003 Step by Step
Venue:  (2003)

Teach yourself how to use the data management power of the latest version of Microsoft Access-one step at a time! Learn exactly the skills you need for Access 2003 through self-paced, easy-to-follow lessons and hands-on practice files. 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
Individual Differences and Navigation in Hypermedia
Authors: Kristina Hook, Marie Sjolinder, Nils Dahlback
Venue:  (1996)

This study derives from two important observations. First, that navigation in hypermedia is a difficult task, and second, that individual cognitive differences play a role in how well users are able to efficiently use computer systems. We found that of the cognitive abilities tested in our study, only spatial ability could be related to the time spent in completing a set of tasks in a large, hypermedia, information structure. We furthermore found that it was only certain aspects of spatial ability which were related to the ability navigate in hypermedia, namely those related to solving spatial problems mentally rather than solving spatial problems in the physical world.
On Inventory Control Models with a Convex Cost Function
Authors: P. S. Knopov, E. N. Derieva, S. S. Demchenko
Venue: Cybernetics and Systems Analysis (2003)

An inventory model, used to control a one-type product stock with an A-convex cost function is analyzed. The replenishment amount is taken as a control parameter. Strategies that are optimal in the sense of an average expected cost and a total revalued cost with a revaluation coefficient &beta; are found and examined.
Type Reconstruction in the Presence of Polymorphic Recursion and Recursive Types
Authors: Said Jahama
Venue:  (1993)

Abstract We establish the equivalence of type reconstruction with polymorphic recursion and recursive types is equivalent to regular semi-unification which proves the undecidability of the corresponding type reconstruction problem. We also establish the equivalence of type reconstruction with polymorphic recursion and positive recursive types to a special case of regular semi-unification which we call positive regular semi-unification. The decidability of positive regular semi-unification is an open problem.
Evolution in Open Source Software: A Case Study
Authors: Michael W. Godfrey, Qiang Tu
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Most studies of software evolution have been performed on systems developed within a single company using traditional management techniques. With the widespread availability of several large software systems that have been developed using an ¿open source¿ development approach, we now have a chance to examine these systems in detail, and see if their evolutionary narratives are significantly different from commercially developed systems. This paper summarizes our preliminary investigations into the evolution of the best known open source system: the Linux operating system kernel. Because Linux is large (over two million lines of code in the most recent version) and because its development model is not as tightly planned and managed as most industrial software processes, we had expected to find that Linux was growing more slowly as it got bigger and more complex. Instead, we have found that Linux has been growing at a super-linear rate for several years. In this paper, we explore the evolution of the Linux kernel both at the system level and within the major subsystems, and we discuss why we think Linux continues to exhibit such strong growth.
Typability and Type Checking in the Second-Order Lambda-Calculus Are Equivalent and Undecidable
Authors: J. B. Wells
Venue:  (1993)

Abstract We consider the problems of typability and type checking in the Girard/Reynolds second-order polymorphic typed lambda calculus, for which we use the short name ``System F'''' and which we use in the ``Curry style'''' where types are assigned to pure lambda terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained ``embarrassing open problems'''' for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing lambda terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call ``constants for free'''', for both the lambda-K and lambda-I calculi.
Premiere 6.5 for Windows and Macintosh: Visual Quickstart Guide
Authors: Anthony Bolante
Venue:  (2002)

:Whether you're new to Adobe Premiere or you're a loyal old-timer who just upgraded, you'll want to get up-to-speed on all of the program's powerful new features fast. Premiere 6.5 for Windows and Macintosh: Visual QuickStart Guide is now revised to show you how to capture, edit, and output digital video using Premiere's new tools and interface enhancements. If you're an experienced Premiere user, you can simply hit the index and skip right to the new features that you want to learn about. All of you new users, however, will probably want to start from the beginning of this task-based reference and follow along with the straightforward step-by-step how-tos that will have you editing full-length videos complete with titles, transitions, and special effects in record time.
Standards for Software Reliability Engineering
Authors: N. Schneidewind
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This tutorial will use the "ANWAIAA Recommended Practice for Software Reliability" as a baseline, with updates from recent SRE developments. The recommended practice defines a generic procedure for applying Software Reliability Engineering (SRE), recommends model selection criteria, recommends an initial model set, describes a data base architecture to support SRE, and describes available tools. Knowing how to develop a software reliability process and how to predict software reliability is of high interest in all areas of the computer industry. 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
Applicazione Php/MySql per la gestione del personale MSC:: 68T35 Languages and software systems (knowledge-based systems, expert systems, etc.)
Authors: Alessandro Agostini
Venue:  (2000)

Personnell management is simple with norma PC Desktop software tools, but is more complicate if there are many different data source to unify. We have resolved this problem with a relational database system on a open source operating system platform.
On bandwidth and storage tradeoffs in multimedia distribution networks
Authors: F. Schaffa, J.-P. Nussbaumer
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Multimedia distribution on demand will impose extremely severe bandwidth requirements on the distribution network and will require the use of very high capacity video servers. In the context of archival programs playout (typical video-on-demand applications), the information source can potentially be stored at any level in the distribution network. Part of the information may even be duplicated. Of course, there is a tradeoff between the bandwidth required to transport the programs to the users and the storage server capabilities of the overall deployment. The paper presents an analytical study of this tradeoff considering different mechanisms aimed at reducing the overall bandwidth and/or storage server costs. A model of the distribution network is established. A cost function is proposed to capture the different parameters and allow comparison of the possible strategies. Results provide good insight into the problem, and are used to discuss the proper placement of storage in a distribution network.
Dynamic Load-Balancing via a Genetic Algorithm
Authors: William A. Greene
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

We produce a GA scheduling routine, which with often relatively low cost finds well-balanced schedules. Incoming tasks (of varying durations) accumulate, then are periodically scheduled, in small batches, to the available processors. Two important priorities for our scheduling work are that loads on the processors are well balanced, and that scheduling per se remains cheap in comparison to the actual productive work of the processors. We also include experimental results, exploring a variety of distributions of task durations, which show that our scheduler consistently produces well-balanced schedules, and quite often does so at relatively low cost.
Space Bounded Computations: Review And New Separation Results
Authors: Juris Hartmanis, Desh Ranjan
Venue:  (1989)

In this paper, we review the key results about space bounded complexity classes, discuss the central open problems and outline the relevant proof techniques. We show that, for a slightly modified Turing machine model, the low level deterministic and nondeterministic space bounded complexity classes are different. Furthermore, for this computation model, we show that Savitch and Immerman-Szelepcsenyi theorems do not hold in the range lg lg $n$ to lg $n$. We also discuss some other computation models to bring out and clarify the importance of space constructability and establish some results about these models. We conclude by enumerating a few open problems which arise out of the discussion.
Correction Networks
Authors: M. Kik, M. Piotrow, M. Kutylowski
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

We consider the problem of sorting sequences obtained from a sorted sequence of n keys by changing the values of at most \mathkeys at some unknown positions. Since even for \matha lower bound \mathon the number of parallel comparison steps applies, any comparator network solving this problem cannot be asymptotically faster than the AKS sorting network.We design a comparator network which sorts the sequences considered for a large range of \math, has a simple architecture and achieves a runtime \math, for a small constant c. We present such networks of depth \mathwith a small constant hidden behind the big "Oh". In particular, for \maththe networks are of depth \math.
An Architecture for Video Content Filtering in Consumer Domain
Authors: Nevenka Dimitrova, Herman Elenbaas, Thomas McGee, Eugene Leyvi, Lalitha Agnihotri
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The transition from analog to digital video enables the consumer access to an enormous amount of high quality video material. In this paper, we describe architecture of a video content filtering system through video analysis and abstraction. We explain the algorithms for video characterization, their performance and practical considerations for including them in the architecture for video filtering. The algorithms and the architecture for abstracted video representation can be used in a variety of consumer domain applications, such as a personalized news retrieval system, home video library or commercial skipping.
Maintainability measurements on industrial source code maintenance activities
Authors: T. Pearse, P. Oman
Venue: Proceedings of the International Conference on Software Maintenance (1995)

It is clear that the burden of software maintenance increases proportionately with our inventory of software systems. Our inventory is increasing because we now recognize existing code as reusable assets rather than liabilities. With this recognition comes an understanding of the importance of evaluating code quality and maintainability. We show how maintainability metrics can be used to gauge the effect of perfective and adaptive maintenance on large industrial software systems. In a series of four studies we measure the maintainability of the source code before and after a prescribed maintenance activity. These measurements permit us to analyze the effect of the maintenance activities as well as evaluating the model's sensitivity to code change.
Hyperoperations on {0, 1, 2} Based on Min, Max, and Universal Literal Operations
Authors: Noboru Takagi, Kyoichi Nakashima
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper will discuss functions with hyperstructure basedon Min, Max, and Universal Literal operations on {0, 1, 2}.These three types of operations will be expanded into operationson the set P3 of non-empty subsets of {0, 1, 2}. Then,the paper will define a special type of compositions, calledformulas, and will show a necessary and sufficient conditionfor a function on P3 to be expressed by a formula.
Implementing Highly-Available WWW Servers Based on Passive Object Replication
Authors: Roberto Baldoni, Simona Bonamoneta, Carlo Marchetti
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

In this paper we investigate issues related to building highly-available World Wide Web (WWW) servers on workstation clusters. We present a novel architecture that includes a dynamic Domain Name System (DNS) and a WWW server based on passive object replication. This architecture allows to reduce the service down-time of a WWW server without impacting on the Hyper Text Transfer Protocol (HTTP) protocol (and thus on the WWW client software).We implement this architecture in our department and we show some experimental results that analyze, given a batch of HTTP requests, the average response time to a request and the average time of WWW service unavailability due to object crashes.
A Two-Aspect Approach for a Clearer Behavior Model
Authors: Chokri Mraidha, Sébastien Gérard, François Terrier, Judith Benzakki
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Moving from code-oriented to model-oriented development facilitates significantly management of increasingly complex software. As explained in [1] clear separation of concerns during application development can drastically increase maintainability,reusability and complexity management. Although existing UML-based approaches for real-time systems development do help speed up software development, they still result in models that are hard to maintain and reuse. This drawback is mainly due to a failure to apply the principles of separating concerns. This paper presents an UML-based method using Aspect Principles and dedicated to the development of real-time embedded systems. It focuses mainly on how suitable separation of concerns may ease reusability and maintainability. Specifically, it depicts how application behavior can be clearly modeled applying separation of control and computation aspects of behavior in UML.
Application-specific constraints for multimedia presentation generation
Authors: J. P.T.M. Geurts, J. R. Ossenbruggen, Lynda Hardman
Venue:  (2001)

A multimedia presentation can be viewed as a collection of multimedia items (such as image, text, video and audio), along with detailed information that describes the spatial and temporal placement of the items as part of the presentation. Manual multimedia authoring involves explicitly stating the placement of each media item in the spatial and temporal dimensions. The drawback of this approach is that resulting presentations are hard to adapt to different target platforms, network resources, and user preferences. An approach to solving this problem is to abstract from the low-level presentation details, for example by specifying the high-level semantic relations between the media items. The presentation itself can then be generated from the semantic relations along with a generic set of transformation rules, specifying how each semantic relation can be conveyed using multimedia constructs. These constructs may differ depending on the target platform, current network conditions or user preferences. We are thus able to automatically adapt the presentation to a wide variety of different circumstances while ensuring that the underlying message of the presentation remains the same. This approach requires an execution environment in which transformation rules, resulting in a set of constraints, are derived from a given semantic description. The resulting set of constraints can then be solved to create a final multimedia presentation. The paper describes the design and implementation of such a system. It explains the advantages of using constraint logic programming to realize the implementation of both the transformation rules and the constraints system. It also demonstrates the need for two different types of constraints. Quantitative constraints are needed to verify whether the final form presentation meets all the numeric constraints that are required by the environment. Qualitative constraints are needed to facilitate high-level reasoning and presentation encoding. While the quantitative constraints can be handled by off-the-shelf constraint solvers, the qualitative constraints needed are specific to the multimedia domain and need to be defined explicitly.
Create!: The No Nonsense Guide to Photoshop Elements 2, 1 edition
Authors: Katy Bodenmiller
Venue:  (2002)

:No Nonsense Guides are here. With a plainspoken approach, these books are inexpensive starters that are light on idle chat and heavy on practical advice. They're lean and mean and stripped down to fighting weight, so you'll get from point A to point Z with instruction that's short and sweet, clear and concise. So, crack the cover and unleash enough useful information and helpful pointers to transform you into a first-rate Photoshop Elements 2 user. 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