ppxscal/embedding_network huggingface dataset:
Using views to maintain Petri-net-based process models
Authors: D. Avrilionis, P.-Y. Cunin
Venue: Proceedings of the International Conference on Software Maintenance (1995)

A software process model is a complex entity describing activities, products and quality aspects of the "real" software-production process. The ever-changing nature of the software process imposes a continuous control of its evolution; maintenance should adapt the process model to accurately reflect the state of the real process. Presently, process model maintainers have to make evolve these complex models under time pressure and with very little assistance. In this paper we present a preliminary approach for improving maintainability of Petri-net-based process models using the concept of view. A view can be seen as the sub-model capturing the perception a participant has about the process. We show how views can structure a model as a set of more abstract modules which are easy to make evolve. After evolution, views can be composed using a set of formally defined operators to obtain a new process model in an automatic way. Our study is applied to the Process Weaver modelling language. After a short presentation of the Process Weaver formalism, we illustrate view definition with an example of a review process model. View evolution and view composition are also introduced through a scenario of process model change based on the above example.
An evolutionary approach to time-constrained routing problems
Authors: Cees H.M. Kemenade, Joost N. Kok
Venue:  (1995)

Routing problems are an important class of planning problems. Usually there are many different constraints and optimization criteria involved, and it is difficult to find general methods for solving routing problems. We propose an evolutionary solver for such planning problems. An instance of this solver has been tested on a specific routing problem with time constraints. The performance of this evolutionary solver is compared to a biased random solver and a biased hillclimber solver. Results show that the evolutionary solver performs significantly better than the other two solvers.
An Introduction to Computational Biochemistry
Authors: C. Stan Tsai
Venue:  (2003)

:The application of computational tools is rapidly becoming a standard component of molecular biology and biochemistry curricula at both the undergraduate and graduate levels. Researchers in biochemistry are required to understand, at a minimum, the basic concepts of data management and analysis using computer programs.An Introduction to Computational Biochemistry is a comprehensive text ideal for providing a solid introduction to biochemical principles and the skills required for applying computational tools to practical problems in biochemistry.Written for end users as opposed to programmers, the text can be used at an entry level to teach students biochemical principles as well as the specific uses of application programs for the acquisition, analysis, and management of biochemical data with computers. Each chapter contains problem sets as well as an introduction, a review of biological concepts, discussion of the programming techniques and applications, and key references. Some features of the text are:* Provides detailed coverage of biochemical structures, enzyme reactions, metabolic simulation, genomic and proteomic analyses, and molecular modeling* Demonstrates the broad applications and versatility of computers for use in solving biochemical problems* Includes a handy appendix of software suppliers* Follows a topical organization of core biochemistry textbooks for use as an essential supplement* Reviews the fundamental biochemical principlesAn Introduction to Computational Biochemistry promises to be an indispensable text for undergraduates, graduate students, researchers, and instructors in biochemistry, molecular biology, and biotechnology. 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 Platform for Making Network Community Support Systems in a Cooperative Distributed Architecture
Authors: Sen Yoshida, Takeshi Ohguro, Koji Kamei, Kaname Funakoshi, Kazuhiro Kuwabara
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

There are an increasing number of applications that support communications in network communities. As the architecture of these applications, cooperative distributed agents are suitable for adapting to dynamic changes in community organizations. We are developing a platform named Shine as a common base for implementing network community applications in a cooperative distributed architecture. This paper describes the platform's significance, requirements, and design policy. We also show an example of building a network community support system on top of the platform.
An Efficient Strategy to Support Continuous Retrieval with Dynamic Bandwidths
Authors: Chien-I Lee, Ye-In Chang, Wei-Pang Yang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

To efficiently support continuous retrieval for continuous media many approaches based on the striping strategy that is implemented on a multi-disk drive have been proposed. However, the striping Moreover, the aggregate bandwidth of the multi-disk drive is determined when the object is striped. Furthermore, for some applications, such as self-learning systems, users may quickly browse some familiar objects while they will slowly scan some unfamiliar objects. Therefore, in this paper, we propose an efficient approach to supporting continuous retrieval with dynamic required bandwidths without reorganizing the completely striped object. From the performance study, we observe that the number of subobjects that must be moved is proportional to the initial required bandwidth and the current required bandwidth.
Investigation to Make Best Use of LSF with High Efficiency
Authors: Fumie Costen, John Brooke, Mike Pettipher
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Network of commodity workstations offers an effective platform for large scale parallel processing. The effectiveness of such systems can be greatly improved by efficient cluster management software. In this paper, we focus upon the widely used Load Sharing Facility(LSF), and investigate its ability to run both parallel and serial simulations and increase the through-put of jobs. The experiment shows that LSF does a good job in terms of balancing the load for serial jobs and avoiding the machines with high processor utilization rates. Using the result of the experiment, we created a useful diagnostic tool for assessing the impact of load balancing software.
Parallel Algorithms for Integer Sorting
Authors: A R Wagner, Yijie Han
Venue:  (1986)

The problem of sorting $n$ integers in the range $\{1,2,...,m \} (m \geq n)$ is considered. Two shared memory parallel algorithms are presented for the problem. We assume that the number of processors available is $p \leq n/2$. Let $0 > \epsilon \leq 1$. The first algorithm has time complexity $O( \frac {n} {\epsilon p} \frac {log m} {log \frac {n} {p}}) (m \geq n)$ with $O(n ^ \epsilon p + n)$ space requirement. The second algorithm combines the range reduction technique due to Kirkpatrick and Reisch with a group prefix computation technique. It has time complexity $O( \frac {n~ logn ~(1+log _ {2/(2- \epsilon )} log _ n m)} {p~ log \frac {n} {p}})$ with $O(m ^ {\epsilon /2} p+n)$ space requirement. These algorithms show improvement on the time complexity over previous parallel integer sorting algorithms, although they require more space.
System integration of WAP and SMS for home network system
Authors: Chi-Hsiang Wu, Rong-Hong Jan
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper proposes a Home Network System (HNS) architecture integrated with Wireless Application Protocol and Short Message Service to support the connectivity between home and Internet/Global System for Mobile Communication (GSM) networks. The HNS architecture includes an HNS gateway and three home network subsystems, i.e., home appliance, security and messaging subsystems. The main objective of the integrated system is to remotely monitor and control the devices in the HNS via laptop computer or a GSM mobile terminal. In addition to responding to remote queries, the managed devices (e.g., home appliances or burglar alarm system) can actively send alerting messages to a mobile terminal when an abnormal state occurs. Through the HNS gateway, the monitoring and control information is diffused to the Internet/GSM network. An implementation of the HNS system is described in this paper as an illustration of the feasibility of the proposed architecture.
Unfolding of Programs with Nondeterminism
Authors: Bjorn Lisper
Venue:  (1994)

In LIsper: "Total Unfolding: Theory and Applications" some results were proved regarding properties of unfolding of purely functional programs. Especially, a theorem was shown that relates the termination of symbolic evaluation of a "less instantiated" term relative to the termination of a "more instantiated" term. An application is partial evaluation, where unfolding of function definitions is frequently performed to enable further simplifications of the resulting specialized program. The unfolding must then be kept under control to ensure that the partial evaluation terminates. In this paper, we extend the termination result from purely functional programs programs with nondeterministic operations. We give an operational semantics where the behaviour of operators is defined through rewrite rules: nondeterminism then occurs when the resulting term rewriting system is nonconfluent. For the confluent part, the previous termination results carry over. It is, however, not guaranteed in general that the resulting unfolded program has the same semantics as the original program. We give conditions on the rewrite rules that guarantee that both versions have the same semantics, and we show that they apply to a nontrivial class of nondeterministic languages.
Metrics for effective information visualization
Authors: R. Brath
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

Metrics for information visualization will help designers create and evaluate 3D information visualizations. Based on experience from 60+ 3D information visualizations, the metrics we propose are: number of data points and data density; number of dimensions and cognitive overhead; occlusion percentage; and reference context and percentage of identifiable points.
New Methods for Lossless Image Compression Using Arithmetic Coding
Authors: Paul G. Howard, Jeffrey S Vitter
Venue:  (1991)

We give a new paradigm for lossless image compression, with four modular components: pixel sequence, prediction, error modeling, and coding. We present two new methods (called MLP and PPPM) for lossless compression, both involving linear prediction, modeling prediction errors by estimating the variance of a Laplace distribution, and coding using arithmetic coding applied to precomputed distributions. The MLP method is both progressive and parallelizable. We give results showing that our methods perform significantly better than other currently used methods for lossless compression of high-resolution images, including the proposed JPEG standard. We express our results both in terms of the compression ratio and in terms of a useful new measure of compression efficiency, which we call {\em compression gain.}
Itanium Architecture for Programmers: Understanding 64-Bit Processors and Epic Principles
Authors: James S. Evan, Gregory L. Trimper
Venue:  (2003)

:Step-by-step guide to assembly language for the 64-bit Itanium processors, with extensive examplesDetails of Explicitly Parallel Instruction Computing (EPIC): Instruction set, addressing, register stack engine, predication, I/O, procedure calls, floating-point operations, and moreLearn how to comprehend and optimize open source, Intel, and HP-UX compiler outputUnderstand the full power of 64-bit Itanium EPIC processorsItanium&reg; Architecture for Programmers is a comprehensive introduction to the breakthrough capabilities of the new 64-bit Itanium architecture. Using standard command-line tools and extensive examples, the authors illuminate the Itanium design within the broader context of contemporary computer architecture via a step-by-step investigation of Itanium assembly language. Coverage includes:The potential of Explicitly Parallel Instruction Computing (EPIC)Itanium instruction formats and addressing modesInnovations such as the register stack engine (RSE) and extensive predicationProcedure calls and procedure-calling mechanismsFloating-point operationsI/O techniques, from simple debugging to the use of filesOptimization of output from open source, Intel, and HP-UX compilersAn essential resource for both computing professionals and students of architecture or assembly language, Itanium Architecture for Programmers includes extensive printed and Web-based references, plus many numeric, essay, and programming exercises for each chapter.
Mixed-width instruction sets
Authors: Arvind Krishnaswamy, Rajiv Gupta
Venue: Communications of the ACM (2003)

Encoding a program's computations to reduce memory and power consumption without sacrificing performance.
The discipline of Internet forensics
Authors: Hal Berghel
Venue: Communications of the ACM (2003)

A well-defined field of study and practice has evolved as a result of network hacker activity.
Learning Mastercam
Authors: James Valentino
Venue:  (2003)

:As a very effective learning guide to Mastercam MILL, this unique book presents a thorough introduction to the most powerful and popular software tool for creating and verifying CNC part programs. Mastercam MILL software provides programmers with a full array of easy to use features, including: automatic calculation of toolpath coordinates, determination of speeds and feeds, animation of the machining process, working off-line without tying up the CNC machine, and post-processing the part program. The Book's Distinctive Features Student-friendly graphical displays are emphasized in lieu of long text and definitions. Includes an overview of the process of generating a word address program. Examples provide step-by-step instructions with graphical displays. Eliminates cross-referencing by featuring all explanations on the same page as the example. Contains exercises at the end of each chapter. Features a process plan for many machining exercises to indicate the machining operations to be performed and the tools to be used. The enclosed CD contains a student version of Mastercam-MILL. The CD also contains the same examples used in the text so students can practice select exercises.
Flow Control Techniques for Multicasting in Gigabit Networks
Authors: X. Chen, Louise E. Moser, P. M. Melliar-Smith
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Communication protocol designers are facing new challenges due to the development of high-speed networks and to the increasing demands of network applications. Gigabit networks pose a challenge to flow control techniques developed for traditional acknowledgment-based, and typically packet-switched, lower-speed networks. Network applications such as distributed databases, groupware and distributed multimedia, all of which require multicasting, have rendered insufficient existing point-to-point flow control methodologies. We examine the problem of flow control for multicasting in gigabit networks. Instead of feedback or rate adaptation techniques, we employ more active flow control mechanisms that use traffic information in protocol control frames. These techniques are very effective for the totally ordered multicast protocol we have developed for the QuickRing gigabit local-area network.
CASTING: A Formally Based Software Test Generation Method
Authors: Lionel van Aertryck, Marc Benveniste, Daniel Le Métayer
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

In this paper, we present CASTING, a Computer Assisted Software Test engineering method. The method, supported by a prototype tool, generates realistic software test suites in a formal and semi-automatic way. Based on a two-layer modular architecture, CASTING is not tied to any particular style of input. Initially designed to engineer functional test suites from formal specifications, CASTING can easily be instantiated to accept other formal description levels, seamlessly supporting the main industrial testing techniques, ranging from functional testing to structural testing. A simple process scheduler specification is used in this paper to illustrate the interaction facilities of CASTING and to provide a sample of the resulting test suites.
Generalized Prolate Spheroidal Wavefunctions Associated to a Particular Space-Limited 2D Band-Pass Operator
Authors: Emanuele Salerno
Venue:  (1998)

In this report, we analyze the eigenspace of a space-limited 2D band-pass operator whose transfer function is concentrated in an annular sector of the Fourier plane. This can be viewed as a linear imaging operator for a compact-support object function. The eigenspace analysis is useful to evaluate the performance of some image processing methods based on the compact-support constraint, such as the Gerchberg and the Landweber methods. The case analyzed here is more general than the ones considered in previous works, where a complete annular transfer function was assumed. For a fixed relative bandwidth, the eigenpairs of the operator are presented as functions of the angular aperture of the annular sector. EMAIL:: salerno@iei.pi.cnr.it
Finding Location Using Omnidirectional Video On A Wearable Computing Platform
Authors: Wasinee Rungsarityotin, Thad E. Starner
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

In this paper, we present a framework for a navigation system in an indoor environment using only omnidirectional video. Within a Bayesian framework we seek the appropriate place and image from the training data to describe what we currently see and infer a location. The posterior distribution over the state space conditioned on image similarity is typically not Gaussian. The distribution is represented using sampling and the location is predicted and verified over time using the Condensation algorithm. The system does not require complicated feature detection, but uses a simple metric between two images. Even with low-resolution input, the system may achieve accurate results with respect to the training data when given favorable initial conditions.
Technical overview of the Renaissance Octobus system
Authors: Randall Gibson, Paul Anderson
Venue: ACM SIGARCH Computer Architecture News (1979)

With the recent availability of inexpensive micro-computers, a technique for effectively sharing the still costly peripherals is needed. This paper summarizes the OCTOBUS, a multi-processor microcomputer architecture and system designed to meet this requirement. The current implementation is based on DEC's LSI-11 microcomputer.
A "Coming and Going" Approach to Specification Construction: A Scenario
Authors: N. Levy, J. Souquieres
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

The construction of a specification or a program is rarely done in one single step and in a linear way. ``Coming and Going'' among the different components of the specification are often performed, i.e., the specification needs to be frequently revisited. This paper illustrates this approach on the production cell case study by means of a scenario of development. It shows what could be automated and indicates which kind of help could be proposed to the specifier.
On TC^0, AC^0, and Arithmetic Circuits
Authors: Manindra Agrawal, Eric Allender, Samir Datta
Venue:  (1997)

Continuing a line of investigation that has studied the function classes #P, #SAC^1, #L, and #NC^1, we study the class of functions #AC^0. One way to define #AC^0 is as the class of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. In contrast to the preceding function classes, for which we know no nontrivial lower bounds, lower bounds for #AC^0 follow easily from established circuit lower bounds. One of our main results is a characterization of TC^0 in terms of #AC^0: A language A is in TC^0 if and only if there is a #AC^0 function f and a number k such that x is in A iff f(x) = 2^|x|^k. Using the naming conventions of this area of research, this yields: TC^0 = PAC^0 = C=AC^0 Another restatement of this characterization is that TC^0 can be simulated by constant-depth arithmetic circuits, with a single threshold gate. We hope that perhaps this characterization of TC^0 in terms of AC^0 circuits might provide a new avenue of attack for proving lower bounds. Our characterization differs markedly from earlier characterizations of TC^0 in terms of arithmetic circuits over finite fields. Using our model of arithmetic circuits, computation over finite fields yields ACC. We also prove a number of closure properties and normal forms for #AC^0.
Challenges and Experiences in Managing Major Software Evolution Endeavours Such as Euro Conversion or Y2000 Compliance
Authors: Rene R. Klosch, Wolfgang Eixelsberger
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The Year 2000 issue and the introduction of the Euro cause substantial software maintenance challenges. The importance of those events for the survival of organizations and the degree of impact on organization's existing software systems require the application of a mixture of already well known but also additional approaches and techniques. In this paper we are going to point out the major issues and possible approaches for their solution based on our experiences and observations from several industrial projects.
A Buffer Merging Technique for Reducing Memory Requirements of Synchronous Dataflow Specifications
Authors: Praveen K. Murthy, Shuvra S. Bhattacharyya
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem during software synthesis from SDF specifications is the minimization of the memory used by the target code. We develop a powerful formal technique called buffer merging that attempts to overlay buffers in the SDF graph systematically in order to drastically reduce data buffering requirements. We give a polynomial-time algorithm based on this formalism, and show that code synthesized using this technique results in more than a 60% reduction of the buffering memory consumption compared to existing techniques.
Data partition based reliability modeling
Authors: J. Tian, J. Palma
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

The paper presents an approach to software reliability modeling using data partitions derived from tree based models. We use these data sensitive partitions to group data into clusters with similar failure intensities. The series of data clusters associated with different time segments forms a piecewise linear model for the assessment and short term prediction of reliability. Long term prediction can be provided by the dual model that uses these grouped data as input fitted to some failure count variations of the traditional software reliability growth models. These partition based reliability models can be used effectively to measure and predict the reliability of software systems and can be readily integrated into our strategy of reliability assessment and improvement using tree based modeling.