ppxscal/embedding_network huggingface dataset:
Object Technology
Authors: I. Ushakov, D. Coleman, L. da Costa
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This panel discusses the impact OT has made and is making on traditional software development methodologies. The scope of the panel is defined by, but not limited to, the following areas: - Object-Oriented (OO) Modeling and Design; - OO Architectures and Frameworks; - Distributed objects and web technology; - Roadmap to OT adoption, - Transition to OT; - OT and Standardization.The goal of this panel session is to study the aforementioned topics, define research areas and state-of-the-art in more detail, and to identify open problems.1. OT and software development. OO Analysis and UML are currently combined with various requirements analysis techniques, e.g., goal-oriented analysis, user centered work modeling, user interaction scenarios and business modeling. While a domain model and use-case model describe a system as a black box, a logical architecture (analysis model) describes what the system's structure [2, 3]. Layered object architecture facilitates better design of software components.2. OO Architectures and Frameworks. Some major impacts of OT on software development practice are definition and usage of OO frameworks and design patterns to facilitate reuse of code and design. Software architecture is a conceptual model defining system components, their interfaces and how they interact between each other. Frameworks provide services and mechanisms for a set of components and can define structural relationships between components. Components vary in granularity and have value within specified environments. OMG Business Object Component Architecture serves as an architectural template for defining domain- and technology-specific architectures and frameworks.3. OT and Web Technology. Internet middleware architecture adopted a concept of "object Web", i.e., universal connectivity, heterogeneous distributed environments, and cross platform interoperation of both infrastructure and applications. Three major drivers: CORBA, DCOM and Enterprise JavaBeans.4. OT adoption. A successful OT adoption is normally based on a plan that includes: resources, scope, management, process, technology and training.5. OT and Standardization. UML is a standard modeling language for OO Analysis and Design. It has been widely recognized and is currently used in many areas. An OO software development process (SDP) is harder to standardize. A Unified Rational Approach which can serve as a framework for definition of OO SDP specifics to a particular project or software development environment. CORBA standards specify many services that can be used in a consistent manner across platforms. More work has to be done to standardize components.
B-ternary Logic Based Asynchronous Micropipeline
Authors: Yasunori Nagata, D. Michael Miller, Masao Mukaidono
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

In this paper, a B-ternary logic based asynchronous pipeline is presented. The pipeline processes binary data elastically. It has high speed operation potential in spite of having an idle phase, because the stages of the pipeline operate concurrently. The mechanism for correct pipeline behavior and the designed circuits are provided.
Systematic development of complex web-based user interfaces
Authors: Henrik Behrens, Thorsten Ritter, Hans-Werner Six
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Software components realising the graphical user interface (GUI) of a highly interactive system or the user interface of a Web application form an essential part of the entire implementation and significantly affect the effectiveness and maintainability of the software system. In this paper, we propose a software engineering based approach for the development of complex Web-based user interfaces (Web-UIs). The method comprises two basic tasks. The first task gathers and models the UI requirements. The second task maps the UI requirements model into a Web-UI software architecture. To this end, we propose DAWID (DIWA-based Web User Interface Development), an approach that adapts the DIWA framework for GUI development to Web-UIs. Since DIWA consequently applies fundamental software engineering (SE) principles and its adaption to Web-UIs requires only minimal changes, the resulting DAWlD architectxtre also stays fully compliant with the SE principles.
Tolerating Malicious Gossip
Authors: Yaron M. Minsky, Fred B. Schneider
Venue:  (2001)

A new class of gossip protocols is presented to diffuse updates securely. The protocols rely on annotating updates with the path along which they travel. To avoid a combinatorial explosion in the number of such annotated updates, rules are employed to choose which updates to keep. Different sets of rules lead to different protocols. Results of simulated executions of a collection of such protocols are described---the protocols would appear to be practical, even in large networks.
Excel 2002 All-in-One Desk Reference for Dummies
Authors: Greg Harvey
Venue:  (2002)

:Excel may be the greatest data management tool since the spiral notebook, but why should you care about the tricks it can do if you don't know what it can do for you? This friendly guide shows you all the ways Excel can simplify your life, with easy-to-find, plain-English instructions for using every cool feature.
An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems
Authors: Eugene Gendelman, Lubomir F. Bic, Michael B. Dillencourt
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper proposes a new approach to rollback-recovery for mobile agent systems, and describes its implementation in the MESSENGERS mobile agents system. The used checkpointing method allows the implementation of a space and time efficient, user-transparent rollback-recovery in heterogeneous distributed environments. Together with an efficient non-blocking system snapshot algorithm, this checkpointing method is an attractive choice for implementing a rollback-recovery mechanism in a mobile agent system, because it exploits features specific to such systems during the recovery. This paper also presents an optimization technique, called concurrent checkpointing that increases the effectiveness of the proposed rollback-recovery mechanism.
Using Graph-Grammar Parsing for Automatic Graph Drawing
Authors: C. L. McCreary, C. L. Combs, D. H. Gill
Venue:  (1994)

Directed graphs, or digraphs, are an excellent means of conveying the structure and operation of many types of systems. They are capable of representing not only the overall structure of such a system, but also the smallest details in a simple and effective way. However, drawing digraphs by hand can be tedious and time consuming, especially if the number of vertices and arcs is large. These facts reveal the need for an automated system capable of converting a textual description of a digraph into a well organized and readable drawing of the graph. This report describes CG (Clan-based Graph Drawing Tool), which takes a textual description of an arbitrary graph and produces a visual representation of it.
Notes on convergence of geometric mean for fuzzy numbers
Authors: Dug Hun Hong
Venue: The Korean Journal of Computational Applied Mathematics (2003)

In this paper, we give some sufficient conditions for convergence of geometric mean for T-related fuzzy numbers where T is an Archimedean t-norm under some mild restrictions. These results generalize earlier results of Hong and Lee [Fuzzy Sets and Systems 116 (2000) 263-267].
ARCA Dictionary Schema Document
Authors: Alberto Catoni, Sabrina Giuliano, Mario Loffredo, Oreste Signore
Venue:  (1996)

This report presents the detailed description of the Dictionary component of the ARCA Target system. In particular, the document makes clear how the Z39.50 V3 Explain facility is implemented by using the Dictionary information. EMAIL:: O.Signore@cnuce.cnr.it
Optimal Scheduling of Secondary Content for Aggregation in Video-on-Demand Systems
Authors: Prithwish Basu, Ashok Narayanan, Wang Ke, Tom Little, Azer Bestavros
Venue:  (1999)

Abstract Dynamic service aggregation techniques can exploit skewed access popularity patterns to reduce the costs of building interactive VoD systems. These schemes seek to cluster and merge users into single streams by bridging the temporal skew between them, thus improving server and network utilization. Rate adaptation and secondary content insertion are two such schemes. In this paper, we present and evaluate an optimal scheduling algorithm for inserting secondary content in this scenario. The algorithm runs in polynomial time, and is optimal with respect to the total bandwidth usage over the merging interval. We present constraints on content insertion which make the overall QoS of the delivered stream acceptable, and show how our algorithm can satisfy these constraints. We report simulation results which quantify the excellent gains due to content insertion. We discuss dynamic scenarios with user arrivals and interactions, and show that content insertion reduces the channel bandwidth requirement to almost half. We also discuss differentiated service techniques, such as N-VoD and premium no-advertisement service, and show how our algorithm can support these as well. (This report is cross listed as BU ECE Department Technical Report: TR-12-16-98)
Correctness of Dynamic Knowledge
Authors: Christine Pierret-Golbreich
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The work concerns a framework for the formal specification and verification of the dynamic knowledge of knowledge-based systems. At a conceptual level, a system is specified in terms of problems, problem-solving processes, knowledge. An important question is to determine if a process is applicable to solve a problem. In this paper we present how problems and problem-solving processes are specified by abstract data types and we introduce a formalization of the relationships between them. We show how it can be formally proved that a process is correct with respect to a given problem.
Adjusted Network Flow for the Shelf-Space Allocation Problem
Authors: Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zhang
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operational realities and to seek solutions with realistic test data. This model is linked to the multidimensional knapsack problem. We first solve a simplified version of the problem to achieve maximum profit by transforming it into a network flow problem. Then, with simple adaptations we solve the general shelf space allocation problem with the help of the network flow model. The approach is simple and direct while experimental results improve on recentfindings significantly and are very close to the optimal.
Letter to the editor: on the maximum modulus of weighted polynomials in the plane, a theorem of Rakhmanov, Mhaskar and Saff revisited
Authors: S. B. Damelin
Venue: Journal of Computational and Applied Mathematics (2003)

Let Σ ⊆ C be a closed set of positive capacity at each point in Σ and w Σ → [0, ∞) a continuous, weight with |z|w(z) → 0, |z| → ∞, z ∈ Σ if Σ is unbounded. Assume further that the set where w is positive is of positive capacity. A classical theorem, obtained independently by Rakhmanov and Mhaskar and Saff says that if Sw, denotes the support of the equilibrium measure for w, then ||Pnwn|| Σ = ||Pnwn|| Sw for any polynomial Pn with deg Pn ≤ n. This does not rule out the possibility that |Pnwn| may attain a maximum outside Sw. We prove that if in addition, Σ is regular with respect to the Dirichlet problem on C and if it coincides with its outer boundary, then all points where |Pnwn| attain their maxima must lie in Sw. The case when Σ ⊆ R consists of a finite union of finite or infinite intervals is due to Lorentz, von Golitschek and Makovoz, Counter examples are given to show that our requirements on Σ cannot in general be relaxed.
Analysis of the components of discretization error in non-linear structural problems
Authors: A. Hernández, Ch. Pinto, E. Amezua, H. Fernandes
Venue: Finite Elements in Analysis and Design (2003)

The present paper considers the reliability of finite-element analysis where non-linear planar structural problems (large strains and plasticity) are concerned. Error estimators of the flux-projection type, based on strain power density, are used. A study of the various components of error discretization is made as a function of parameters such as load step or the number of degrees of freedom of the finite-element model. Two numerical examples are selected so that certain properties of these estimators are demonstrated. Conclusions of practical use can be drawn from the results expressed in tables and charts.
Further Investigation into the Use of CBR and Stepwise Regression to Predict Development Effort for Web Hypermedia Applications
Authors: Emilia Mendes, Nile Mosley
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

To date studies using CBR for Web hypermedia effort prediction have not applied adaptation rules to adjust effort according to a given criterion. In addition, when applyingn-fold cross-validation, their analysis has been limited to a maximum of three training sets, which according to recent studies, may lead to untrustworthy results.This paper has therefore two objectives. The first is to further investigate the use of CBR for Web hypermedia effort prediction by comparing the prediction accuracy of eight CBR techniques, of which three have previously been compared. The second objective is to compare the prediction accuracy of the best CBR technique against stepwise regression, using a twenty-fold cross-validation. All prediction accuracies were measured using MeanMagnitude of Relative Error (MMRE), Median Magnitude of Relative Error, Prediction at level l (l=25%), and boxplots of the residuals.One dataset was used in the estimation process and, according to all measures of prediction accuracy, stepwise regression showed the best prediction accuracy.
On the Relation of Refinement Between Algorithms
Authors: Robert L. Constable
Venue:  (1973)

We define a class of tree schemata and a notion of refinement between trees (finite or infinite). These concepts allow us to talk about different ``ways to program an algorithm'''' and the ``structure'''' of an algorithm. We obtain as a special case certain concepts such as ``approximation'''', ``convergence'''' and ``fixed point semantics'''' recently employed by Scott to describe the semantics of flow diagrams. We concentrate in this paper on relating our concepts to Scott''s.
An Architecture for Post-Development Configuration Management in a Wide-Area Network
Authors: Richard S. Hall, Dennis Heimbigner, Andre van der Hoek, Alexander L. Wolf
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Few tools exist to address the post-development activities of configuring, releasing, installing, updating, reconfiguring, and even de-installing a software system. Certainly there is no unified approach for all of these activities, and none that can take full advantage of a wide-area network. The Software Dock represents an architecture for supporting post-development activities in such a setting. It is designed as a system of loosely-coupled, cooperating, distributed components that are bound together by a wide-area messaging and event system. In this paper we describe the Software Dock architecture and discuss the use of a prototype in deploying a complex system.
Distributed Bandwidth Broker for QoS Multicast Traffic
Authors: Elena Pagani, Gian Paolo Rossi
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

The Differentiated Services model is the emerging standard to provide Quality-of-Service (QoS) support for the multimedia applications in the future Internet. This model involves bandwidth brokeragents to perform the admission control and network configuration functionalities. A great deal of efforts has been recently devoted to investigate viable approaches to the implementation of mechanisms that automatically perform the bandwidth broker functions. Yet, no standard policy has been so far proposed.In this paper, we propose a distributed measurement-based protocol that performs admission control functionalities for multicast traffic in diff-serv networks. The protocol supports dynamic changes of the multicast group membership, it operates on-demand and it supports the Premium Service. We prove that the proposed protocol performs an effective and efficient admission control function.
Detecting program modules with low testability
Authors: T. M. Khoshgoftaar, R. M. Szabo, J. M. Voas
Venue: Proceedings of the International Conference on Software Maintenance (1995)

We model the relationship between static software product measures and a dynamic quality measure, testability. To our knowledge, this is the first time a dynamic quality measure has been modeled using static software product measures. We first give an overview of testability analysis and discriminant modeling. Using static software product measures collected from a real time avionics software system, we develop two discriminant models and classify the component program modules as having low or high testability. The independent variables are principal components derived from the observed software product measures. One model is used to evaluate the quality of fit and one is used to assess classification performance. We show that for this study, the quality of fit and classification performance of the discriminant modeling methodology are excellent and yield a potentially useful insight into the relationship between static software measures and testability.
Formal Specification of CORBA Services using Object-Z
Authors: Detlef Kreuz
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

Open component architectures, such as CORBA, allow software systems to be composed of independent components. The behavior of components is described with a mixture of an interface definition language (IDL) and informal prose. This may lead to ambiguous descriptions.This paper proposes an abstract specification of components using the formal specification language Object-Z. The usage of Object-Z enables system designers and programmers to create, understand and maintain specifications of complex interfaces and their interaction. In connection with tool support, the proposed method is integrated into design methods for practical purposes. It give practitioners a better understanding of the design process and fosters the usefulness of formal methods.
Removing the obstacles to network technology adoption
Authors: H. Meleis
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The obstacles to adopting new network technologies that enable new applications and services are reviewed and discussed. Technologies such as client-server and interconnection mechanisms enable the realization of new applications which are "nice to have." Making these new technologies as easy as possible to exploit and use is a key in adopting them. Obstacles such as cost and complexity of managing the changes have been proven to be two of the barriers to adopting these technologies. Additionally, ignoring the importance of the legacy systems and their associated applications services, and infrastructures as well as introducing a set of new technologies which may not work well with the older systems impedes the acceptance of these new technologies. A set of migration technologies and strategies must be developed to remove the obstacles and to accelerate the adoption of these new network technologies.
Pragmatic Type Interoperability
Authors: Sébastien Baehni, Patrick Th. Eugster, Rachid Guerraoui, Philippe Altherr
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Providing type interoperability consists in ensuring that,even if written by different programmers, possibly in differentlanguages and running on different platforms, typesthat are supposed to represent the same software moduleare indeed treated as one single type. This form of interoperabilityis crucial in modern distributed programming.We present a pragmatic approach to deal with type interoperabilityin a dynamic and distributed environment.Our approach is based on an optimistic transport protocol,specific serialization mechanisms and a set of implicittype conformance rules. We experiment the approach overthe .NET platform which we indirectly evaluate.
Interoperability for mobile agents by incarnation agents
Authors: Tetsuo Hasegawa, Kenta Cho, Fumihiro Kumeno, Shin Nakajima, Akihiko Ohsuga, Shinichi Honiden
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Many different kinds of mobile agent platforms have been developed. However, migration to a different type of mobile agent platform is actually impossible. As a solution to this problem, we propose an interoperability concept using incarnation agents. This concept realizes logical mobility between different kinds of agent platforms. The incarnation agent extracts an agent's procedures and status, compiles them into an agent platform-independent format, and then re-compiles them to the target agent platform format, thus enabling the process to continue. The incarnation agent also has autonomy for interoperability. It manages complex migration for interoperability so that the agent's procedures can be described in a simple mobile model. Moreover, the incarnation agent modifies the agent's procedures so that they are applicable to the facilities of the target agent platform. Feasibility experiments using interoperability middleware have been conducted as a basis for realizing incarnation agents.
Mechanized Support for Stepwise Refinement
Authors: Jan L. A. Van de Snepsscheut
Venue:  (1994)

No abstract available. 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
Algebraic Specification of a Communication Scheduler
Authors: Joseph Mathai, Abha Moitra
Venue:  (1984)

A distributed programming language normally incorporates one mechanism by which processes communicate with each other. This mechanism can be used to transfer information or to synchronize the flow of control in the program. Different communication mechanisms have been proposed for different languages. In this paper, we provide a common framework in which these mechanisms can be examined independently of the languages in which they may be embedded. Operationally, this framework is a communication scheduler: formally, it is specified algebraically as a data type. A number of different communication mechanisms, such as synchronous and asynchronous message passing, broadcasts and remote procedure calls, are modelled and, as an illustration of how global properties can be analysed, we consider the problem of deadlock detection.