bluuebunny/crossref_metadata_2025 huggingface dataset:
EVOLUTIONAL ENTANGLEMENT IN NONEQUILIBRIUM PROCESSES
Authors: YUKALOV V. I.
Published: February 2003

Entanglement in nonequilibrium systems is considered. A general definition for entanglement measure is introduced, which can be applied for characterizing the level of entanglement produced by arbitrary operators. Applying this definition to reduced density matrices makes it possible to measure the entanglement in nonequilibrium as well as in equilibrium statistical systems. An example of a multimode Bose–Einstein condensate is discussed.
THE WIDTH RATIO OF TWO BARRIERS IN RESONANT TUNNELING
Authors: OHMUKAI MASATO
Published: February 2003

Numerical calculations by a transfer matrix method have been performed to obtain the transmission coefficient of rectangular double barrier structures. The dependence of the well width, barrier width and the barrier height was systematically investigated. When the width ratio of the two barriers was varied on condition that a total width was fixed, the transmission coefficient at a resonance is varied while that at a valley region is not. It is concluded that the resonant tunneling is characterized by two parameters: total width and the width ratio. Our results clarify the transition of transmission spectrum from a single barrier to a double barrier structure.
AN INCREMENTAL OBJECT-ORIENTED MIGRATION STRATEGY FOR RPG LEGACY SYSTEMS
Authors: CANFORA GERARDO , DE LUCIA ANDREA , DI LUCCA GIUSEPPE A.
Published: February 2003

We present a strategy for incrementally migrating legacy systems to object-oriented platforms. The migration process consists of six sequential phases and encompasses reverse engineering and reengineering activities. The aim of reverse engineering is to decompose programs into components implementing the user interface and components implementing application domain objects. The identification of objects is centred around persistent data stores and exploits object-oriented design metrics. Wrapping is the core of the reengineering activities. It makes new systems able to exploit existing resources, thus allowing an incremental and selective replacement of the identified objects. The migration strategy has been defined and experimented within the project ERCOLE (Encapsulation, Reengineering and Coexistence of Object with Legacy) on legacy systems developed in RPG for the IBM AS/400 environment.
A FRAMEWORK FOR OBJECT-ORIENTED REVERSE ENGINEERING OF LEGACY INFORMATION SYSTEMS
Authors: KÖLSCH ULRIKE , LASCHEWSKI JÜRGEN
Published: February 2003

There is every indication that an object-oriented view of an information system is a solid foundation for understanding its legacy organization, for relating it to the environment in which it is embedded and for guiding its reengineering. In this paper we present a framework based upon the formal object-oriented specification language TROLL, which provides an object-oriented view of legacy information systems. The aim is to combine existing methods and keep results in a common and suitable description base which provides the appropriate form for deriving object specifications from the legacy IS. We usethe language TROLL not only as description language, but also as a framework to support the maintenance engineers in their reverse engineering tasks by giving hints about what to do next to complete the object specifications. The result of the approach is a formal object-oriented specification of the legacy IS that is suitable both for developing a new IS or for reengineering the legacy system.
USING THE WEB FOR SOFTWARE ANNOTATIONS
Authors: RAJLICH VÁCLAV , VARADARAJAN SRIKANT
Published: February 2003

The purpose of software redocumention is to recover comprehension of software and to record it for future use. This paper describes Partitioned Annotations of Software (PAS), where comprehension is recorded in hypertext and browsed by web browsers. The annotations for each code component are partitioned in order to keep different explanations separate, leverage the advantages of hypertext, and better support the processes of program comprehension. The paper describes a tool that parses code and generates PAS skeletons. The paper also describes a process of incremental redocumentation where comprehension of software is recorded incrementally during normal maintenance. The experience with PAS in an industrial project is summarized.
AN APPROACH TO AUTOMATED BUILDING OF SOFTWARE SYSTEM CONFIGURATIONS
Authors: BIELIKOVÁ MÁRIA , NÁVRAT PAVOL
Published: February 2003

In the paper, we concentrate on a method for building a software system configuration. We build configurations by defining the system's model first. We have introduced a model of a software system such as an AND/OR-type graph with two kinds of nodes: families and variants. Models serve as useful abstractions simplifying the process of configuration building. Being essentially a graph search, it is inevitable to have a method for selecting a proper version. To a software engineer our approach offers a framework for specifying various heuristics describing which versions are preferred. In our method, the search is further reduced by employing the concepts of generic and bound configurations and by dividing it into several fundamental steps.
PROTOCOL SPECIFICATION DESIGN USING AN OBJECT-BASED PETRI NET FORMALISM
Authors: SLIVA VLADIMIR P. , MURATA TADAO , SHATZ SOL M.
Published: February 2003

This paper presents a method for modeling of communication protocols using G-Nets — an object-based Petri net formalism. Our approach focuses on specification of one entity in one node at one time, with the analysis that allows consideration of other layers and nodes in addition to module analysis. We extend G-Nets by the notion of timers, which aids the construction of protocol software models. Our method prevents some types of potential deadlocks and livelocks from being introduced into the produced net models. We present certain net synthesis rules to prevent some potential design errors by including error cases in the model. Thus, our node (site) interplay modeling includes cases in which a message may arrive corrupted or can be lost entirely before it would get to its destination node. Also, since our models have deadlock-preserving skeletons, the verification of global deadlock non-existence can be performed on the less complex skeleton rather than on the full G-Net model. Our analysis method discovers some deadlocks plus other unacceptable markings, which do not allow restoration of the initial state. Finding potential livelocks or overspecification is also a part of the analysis.
AN AUTOMATED TOOL (IDAF) TO MANIPULATE INTERACTION DIAGRAMS AND FRAGMENTATIONS FOR MULTI-AGENT SYSTEMS
Authors: LOW CHI KEEN , RÖNNQUIST RALPH , CHEN TSONG YUEH
Published: February 2003

Interaction diagrams are used in multi-agent systems to graphically describe agent computation threads and communications while fragmentations are the algebraic representations of interaction diagrams. The IDAF (Interaction Diagrams And Fragmentations) tool suite has been developed based on the formalism of interaction diagrams and fragmentations. The tool suite consists of ValidatoR, FormatteR, TranslatoR, GrapheR and TesteR. This paper describes the usage of the tool suite and demonstrates it in two different multi-agent systems.
ANALYTICAL PARTITION OF SOFTWARE COMPONENTS FOR EVOLVABLE AND RELIABLE MEMS DESIGN TOOLS
Authors: HOOVER CAROL L. , KHOSLA PRADEEP K.
Published: February 2003

Transforming software requirements into a software design involves the iterative partition of a solution into software components. The process is human-intensive and does not guarantee that design objectives such as reusability, evolvability, and reliable performance are satisfied. The costly process of designing, building, and modifying high-assurance systems motivates the need for precise methods and tools to generate designs whose corresponding implementations are reusable, evolvable, and reliable. This paper demonstrates an analytical approach for partitioning basic elements of a software solution into reusable and evolvable software components. First, we briefly overview the role of partitioning in current design methods and explain why computer-aided design (CAD) tools to automate the design of microelectromechanical systems (MEMS) are high-assurance applications. Then we present our approach and apply it to the design of CAD software to layout an optimized design of a MEMS accelerometer to be used in the navigational units of aircraft. Lastly, we discuss the implications of our approach and future research directions.
A FIREWALLING SCHEME FOR SECURING MPOA-BASED ENTERPRISE NETWORKS
Authors: XU JUN , SINGHAL MUKESH
Published: February 2003

A well-known security problem with MPOA is that cut-through connections generally bypasses firewall routers if there are any. None of the previously proposed approaches solved the problem properly. In this paper, we propose a novel firewalling scheme for MPOA that nicely fixes the security hole. Our firewalling scheme has three outstanding advantages that make it ideal for securing MPOA-based enterprise networks. First, based on our novel concept of "logical chokepoints", our firewalling scheme does not require the existence of physical chokepoints inside the network. Second, the scheme is nicely embedded into the MPOA protocol so that its cost, performance overhead, and protocol complexity are reduced to a minimum. Third, the scheme is centrally administered so that it scales well to very large networks.
THE DESIGN AND IMPLEMENTATION OF A CUSTOMIZABLE FAULT TOLERANCE FRAMEWORK
Authors: YEN I-LING , AHMED IFTIKHAR , JAGANNATH RAMANUJAM , KUNDU SREEPARNA
Published: February 2003

While there have been significant advances in fault tolerance research, the effort has focused on the design of individual fault-tolerant systems or methodologies. Recently, some research has been initiated to develop techniques that can provide a spectrum of fault tolerance capabilities. In this paper, we present the design of a fault tolerance framework that can support a wide range of applications with various fault tolerance requirements, various criticality levels, and various system models. The framework is designed to be parameterizable so that the user can configure it to obtain the desired features. Also, the framework is designed to be an off-the-shelf component such that application programs can be integrated within it easily to obtain the fault-tolerant version of the application system.

A specialized N-modular redundancy (SNMR) scheme has been developed to serve as the primary approach for achieving efficient and cost-effective fault tolerance for the framework. In most cases, the SNMR scheme yields better performance and lower cost in providing fault tolerance as compared with conventional NMR schemes. It also enhances the scalability and customizability of the general replication method.

This paper discusses the main issues in the design and implementation of the SNMR framework, including the major concept of the SNMR framework, various SNMR algorithms that tolerate various types of faults, an object-oriented overall system design and the interface protocol class hierarchy. The interface protocol class hierarchy provides a nice paradigm for the implementation of customizable, highly reusable, and easily extensible SNMR framework.
AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS
Authors: SAHAY AVINAS , TSAI JEFFREY J. P. , SISTLA A. PRASAD
Published: February 2003

We present an incremental algorithm for model checking the real-time systems against the requirements specified in the real-time extension of modal mu-calculus. Using this algorithm, we avoid the repeated construction and analysis of the whole state-space during the course of evolution of the system from time to time. We use a finite representation of the system, like most other algorithms on real-time systems. We construct and update a graph (called TSG) that is derived from the region graph and the formula. This allows us to halt the construction of this graph when enough nodes have been explored to determine the truth of the formula. TSG is minimal in the sense of partitioning the infinite state space into regions and it expresses a relation on the set of regions of the partition. We use the structure of the formula to derive this partition. When a change is applied to the timed automaton of the system, we find a new partition from the current partition and the TSG with minimum cost.
USING CLASSIFICATION TREES FOR SOFTWARE QUALITY MODELS: LESSONS LEARNED
Authors: KHOSHGOFTAAR TAGHI M. , ALLEN EDWARD B. , NAIK ARCHANA , JONES WENDELL D. , HUDEPOHL JOHN P.
Published: February 2003

High software reliability is an important attribute of high-assurance systems. Software quality models yield timely predictions of quality indicators on a module-by-module basis, enabling one to focus on finding faults early in development. This paper introduces the Classification And Regression Trees (CART) a algorithm to practitioners in high-assurance systems engineering. This paper presents practical lessons learned on building classification trees for software quality modeling, including an innovative way to control the balance between misclassification rates. A case study of a very large telecommunications system used CART to build software quality models. The models predicted whether or not modules would have faults discovered by customers, based on various sets of software product and process metrics as independent variables. We found that a model based on two software product metrics had comparable accuracy to a model based on forty product and process metrics.
SPECIFYING AND VERIFYING TEMPORAL BEHAVIOR OF HIGH ASSURANCE SYSTEMS USING REACHABILITY TREE LOGIC
Authors: YANG STEPHEN J. H. , CHU WILLIAM , LEE JONATHAN
Published: February 2003

This paper presents our reachability tree logic (RTL) and its integration with time Petri nets to specify and verify the temporal behavior of high assurance systems. The specification phase begins with a system modeling to model system requirements into a time Petri net N and construct a reachability tree RT of N. We then use RTL to specify the desired temporal behavior as formula F. The verification phase uses a model-checking algorithm to check whether RT can satisfy F, that is to find firing sequences to satisfy F. If F is not satisfied, we then modify N into N′ and obtain a RT′ of the modified N′. The modification (refinement) continues until the modified RT′ can satisfy F. In addition, we will demonstrate how to reduce the complexity of model-checking by using our RTL-based algorithm. We have implemented a specification and verification toolkit called NCUPN (National Central University Petri Nets toolkit) using Java. NCUPN is now available on the Internet via
REAL-TIME OBJECT-ORIENTED DISTRIBUTED SOFTWARE ENGINEERING AND THE TMO SCHEME
Authors: KIM K. H. (KANE)
Published: February 2003

Real-time (RT) object-oriented (OO) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approaches proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach to RT OO distributed computing which the author and his collaborators have been establishing in recent years will be reviewed in more detail. The approach named the TMO (Time-triggered Message-triggered Object) structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of complex real-time computing systems (RTCS's). The TMO scheme is intended to facilitate the pursuit of a new paradigm in designing RTCS's which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable RTCS's for safety-critical applications. The TMO structuring scheme is a syntactically simple but semantically powerful extension of the conventional object structuring approaches and as such, its support tools can be based on various well-established OO programming languages such as C++ and JAVA and on ubiquitous commercial RT operating system kernels. The scheme enables a great reduction of the designer's efforts in guaranteeing timely service capabilities of application systems. Also, the scheme is applicable to structuring of not only complex distributed RTCS's but also application environment descriptors/simulators and requirement specifications.
SOORLS: A SOFTWARE REUSE APPROACH ON THE WEB
Authors: LEE SUNG-KOO , URBAN JOSEPH E.
Published: February 2003

The Summary-based Object-Oriented Reuse Library System (SOORLS) was developed to support both librarians who manage databases of object-oriented reusable components, and software developers who intend to use these components to develop software on the Web. This paper presents the library management functions implemented by SOORLS, with focus on a software reuse approach based on the summary contents of the library. The cluster-based classification scheme proposed in this paper alleviates the labor-intensity domain analysis problem often attributed to traditional facet-based classification schemes. We then concentrate on the facilities offered by SOORLS' tools, as well as its Web-based architecture, which allows distributed access to reusable components on servers from a variety of platforms.
REUSABLE KNOWLEDGE-BASED COMPONENTS FOR BUILDING SOFTWARE APPLICATIONS: A KNOWLEDGE MODELLING APPROACH
Authors: MOLINA MARTÍN , SIERRA JOSÉ L. , CUENA JOSÉ
Published: February 2003

In computer science, different types of reusable components for building software applications were proposed as a direct consequence of the emergence of new software programming paradigms. The success of these components for building applications depends on factors such as the flexibility in their combination or the facility for their selection in centralised or distributed environments such as internet. In this article, we propose a general type of reusable component, called primitive of representation, inspired by a knowledge-based approach that can promote reusability. The proposal can be understood as a generalisation of existing partial solutions that is applicable to both software and knowledge engineering for the development of hybrid applications that integrate conventional and knowledge based techniques. The article presents the structure and use of the component and describes our recent experience in the development of real-world applications based on this approach.
KNOWLEDGE AND EXPERIENCE REUSE THROUGH COMMUNICATION AMONG COMPETENT (PEER) AGENTS
Authors: MARTÍN FRANCISCO J. , PLAZA ENRIC , ARCOS JOSEP LLUÍS
Published: February 2003

This article addresses an extension of the knowledge modeling approaches, namely to multi-agent systems where communication and coordination are necessary. We propose the notion of competent agent and define the basic capabilities of these agents for the extension to be effective. An agent is competent when it is capable of reasoning about its own competence and that of the other agents with which it cooperates in a given domain. In our framework, an agent has competence models of itself and of its acquaintances from which it can decide, for a specific problem to be solved, the type of cooperative activity it can request and from which agent. In this paper we focus on societies of peer agents, i.e. agents that are able to solve the same type of task but that may have different degrees of competence for specific problem ranges.
ADVANCED CONCEPTUAL CLUSTERING AND ASSOCIATED QUERYING FACILITIES IN OBJECT-ORIENTED DATABASES
Authors: FUNG CHI-WAI , LI QING
Published: February 2003

Conventional object-oriented database (OODB) systems follow a class-based approach to model real world entities and their relationships, which imposes several difficulties when more advanced "dynamic functions" are needed by the applications. One of such dynamic functions is conceptual clustering — the ability to dynamically group a set of existing objects together as a higher-level abstract object (called a "cluster"). The conceptual clustering model (CCM) that we have defined is an extension to current object-oriented models, which facilitates the modeling of dynamic, evolving, and/or ad hoc object clusters through a well-devised clustering mechanism that incorporates "roles". This paper presents the advanced features of CCM, along with its associated query language facilities devised for supporting general definition and access of clusters (and roles). An experimental prototype of the CCM has been constructed on top of a persistent object storage manager, running on a Sun4 workstation.
A FRAME MODEL APPROACH FOR EXPERT AND DATABASE SYSTEM INTEGRATION
Authors: FONG JOSEPH , HUANG SHI-MING
Published: February 2003

Expert systems (ES) and database systems (DBS) are major components of information systems and important assets to companies. The development of these systems represent users' knowledge in the application systems. As computer technologies evolve, and as users requirements change, there is a need to upgrade these system to meet the new application requirements. To preserve the knowledge of the existing information systems, a methodology for integrating ES and DBS into an expert database system (EDS) is proposed. The integrated EDS is a knowledge based system (KBS) which derives and stores knowledge in a frame model consisting of a class header, attributes, methods and constraints. It extracts the ES rules and DBS data for an application into coupling classes at run time only. The attributes of the coupling classes are matched with synonyms in a synonym table which resolves their naming and semantic conflicts with user assistance in knowledge acquisition. The resultant EDS is a KBS ready for application development.
VISUAL PROGRAMMING FOR MESSAGE-PASSING SYSTEMS
Authors: STANKOVIC NENAD , ZHANG KANG
Published: February 2003

The attractiveness of visual programming stems in large part from the direct interaction with program elements as if they were real objects, since people deal better with concrete objects than with the abstract. This paper describes a new graph based software visualization tool for parallel message-passing programming named Visper that combines the levels of abstraction at which message-passing parallel programs are expressed and makes use of compositional programming. Central to the tool is the Process Communication Graph that correlates both the control and data flow graphs into a single graph formalism, without a need for complex textual annotation. The graph can express static and runtime communication and replication structures, as found in Message Passing Interface (MPI) and Parallel Virtual Machine (PVM). It also forms the basis for visualizing parallel debugging and performance.
VISUAL SPECIFICATION AND MONITORING OF SOFTWARE AGENTS IN DECENTRALIZED PROCESS-CENTRED ENVIRONMENTS
Authors: GRUNDY JOHN
Published: February 2003

Distributed, cooperating software agents are useful in many problem domains, such as task automation and work coordination in process-centered environments. We describe a visual language for specifying such software agents, which uses the composition of event-based software components. These specifications may contain interfaces to remotely executing agents, and agents may be run locally or on distributed machines using a decentralized software architecture. As facilities to configure and monitor the state and activities of such distributed, cooperating software agents is essential, we provide primarily visual capabilities to achieve this. Our static and dynamic software agent visualization techniques have been used on several projects where distributed information processing, system interfacing, work coordination and task automation are required. We illustrate our visualization techniques with examples from these domains.
GENERATION OF OBJECT-ORIENTED SOFTWARE PROCESS USING MILESTONES
Authors: HANAKAWA NORIKO , IIDA HAJIMU , MATSUMOTO KEN-ICHI , TORII KOJI
Published: February 2003

One of the major problems in object-oriented software projects is the lack of management's ability to comprehend and control the development progress of a project. This is because traditional phases of software development are not appropriate for object-oriented development. The project manager's "road map" is likely to be different with different phases, different milestones, and different checkpoints.

This paper proposes a new framework which gives us a guideline for generating software process with relevant milestones for object-oriented development methods. The framework provides algorithms for identifying development phases and baseline products based on relationships among activities and products of the development method. In addition, the framework defines a software process model to manage a development progress in which milestones are established at the end of each phase in order to check the baseline product and establish goals for the following phase. Results of the application of the proposed framework show that the framework can generate a software process customized for well-known object-oriented development methods in a systematic way.
GRAMMATICAL INFERENCE FOR THE AUTOMATIC GENERATION OF VISUAL LANGUAGES
Authors: FERRUCCI FILOMENA , VITIELLO GIULIANA
Published: February 2003

In this paper we address the problem of the automatic generation of visual languages from a sample set of visual sentences. We present an improvement of the inference module of the VLG system which was originally conceived for the generation of iconic languages [11]. With this extension any kind of visual languages, like diagrams and forms, can be considered. To this aim, we present an inference algorithm for the class of Boundary SR grammars. These grammars are a subclass of the SR grammars with the interesting property of confluence, which extends the concept of context-freeness to the case of nonlinear grammars. Moreover, in spite of the simplicity and naturalness of the formalism, the generative power of this class is sufficient to specify interesting visual languages.

The inference algorithm exploits an elegant characterization of Boundary SR languages in terms of tree and string languages. More precisely, we show that a visual language is a Boundary SR language if and only if it can be defined as a regular tree language and a set of properly associated string languages. Based on this result, the problem of identifying structural properties in a diagrammatic visual sentence is brought back to the detection of structural properties in tree and string languages.

The main advantage coming from the use of a grammatical inference technique in visual language specification is that the designer only needs to specify a set of visual sentences that he/she feels to sufficiently exemplify the intended target language.
MINING FOR PROGRAM STRUCTURE
Authors: MILLER RENÉE J. , GUJARATHI ASHISH
Published: February 2003

We present a new mining algorithm for discovering program structure built on a warehouse of program-analysis data. We make use of statement definition-use data along with variable typing information to learn about the structure of legacy code. Using concept analysis, we develop an interactive knowledge discovery framework into which different types of analysis data can be integrated. This work is the first in a series of data warehousing experiments that is designed to tap the wealth of information hidden in existing program-analysis data.
AUTOMATICALLY EXPLORING HYPOTHESES ABOUT FAULT PREDICTION: A COMPARATIVE STUDY OF INDUCTIVE LOGIC PROGRAMMING METHODS
Authors: COHEN WILLIAM W. , DEVANBU PREMKUMAR T.
Published: February 2003

We evaluate a class of learning algorithms known as inductive logic programming (ILP) methods on the task of predicting fault density in C++ classes. Using these methods, a large space of possible hypotheses is searched in an automated fashion; further, the hypotheses are based directly on an abstract logical representation of the software, eliminating the need to manually propose numerical metrics that predict fault density. We compare two ILP systems, FOIL and FLIPPER, and conclude that FLIPPER generally outperforms FOIL on this problem. We analyze the reasons for the differing performance of these two systems, and based on the analysis, propose two extensions to FLIPPER: a user-directed bias towards easy-to-evaluate clauses, and an extension that allows FLIPPER to learn "counting clauses". Counting clauses augment logic programs with a variation of the "number restrictions" used in description logics, and significantly improve performance on this problem when prior knowledge is used. We also evaluate the use of ILP techniques for automatic generation of Boolean indicators and numeric metrics from the calling tree representation.
DATA MINING FOR PREDICTORS OF SOFTWARE QUALITY
Authors: KHOSHGOFTAAR TAGHI M. , ALLEN EDWARD B. , JONES WENDELL D. , HUDEPOHL JOHN P.
Published: February 2003

"Knowledge discovery in data bases" (KDD) for software engineering is a process for finding useful information in the large volumes of data that are a byproduct of software development, such as data bases for configuration management and for problem reporting. This paper presents guidelines for extracting innovative process metrics from these commonly available data bases. This paper also adapts the Classification And Regression Trees algorithm, CART, to the KDD process for software engineering data. To our knowledge, this algorithm has not been used previously for empirical software quality modeling. In particular, we present an innovative way to control the balance between misclassification rates. A KDD case study of a very large legacy telecommunications software system found that variables derived from source code, configuration management transactions, and problem reporting transactions can be useful predictors of software quality. The KDD process discovered that for this software development environment, out of forty software attributes, only a few of the predictor variables were significant. This resulted in a model that predicts whether modules are likely to have faults discovered by customers. Software developers need such predictions early in development to target software enhancement techniques to the modules that need improvement the most.
AN INVESTIGATION ON THE USE OF MACHINE LEARNED MODELS FOR ESTIMATING SOFTWARE CORRECTABILITY
Authors: DE ALMEIDA MAURICIO A. , LOUNIS HAKIM , MELO WALCELIO L.
Published: February 2003

In this paper we present the results of an empirical study in which we have investigated Machine Learning (ML) algorithms with regard to their capabilities to accurately assess the correctability of faulty software components. Three different families algorithms have been analyzed: divide and conquer (top down induction decision tree), covering, and inductive logic programming (ILP). We have used (1) fault data collected on corrective maintenance activities for the Generalized Support Software reuse asset library located at the Flight Dynamics Division of NASA's GSFC and (2) product measures extracted directly from the faulty components of this library. In our data set, the software quality models generated by both C4.5-rules (a divide and conquer algorithm) and FOIL (an inductive logic programming one) presented the best results from the point of view of model accuracy.
EMPIRICAL INVESTIGATION OF INNOVATION DIFFUSION IN A SOFTWARE PROCESS
Authors: TORTORELLA MARIA , VISAGGIO GIUSEPPE
Published: February 2003

This paper describes an explorative experimentation on the behaviour of developers using a predefined process versus that of those using self-defined ones. The results of the experimentation indicate that it is more advantageous, in terms of minimization of defects and execution effort, to require the developers to tailor the processes they will use rather than to ask them to use a predefined process. Moreover, assistance by the innovation promoter favours the transfer of experience from the organization to the individuals. Finally, quality goals, the availability of suitable tools and specialized training can motivate the use of innovative technologies the organization intends to adopt, even when the developers self-define the processes for their introduction.
MAINTAINING SHARED WORKSPACES CONSISTENCY DURING SOFTWARE DEVELOPMENT
Authors: SKAF HALA , CHAROY FRANCOIS , GODART CLAUDE
Published: February 2003

The development of large software is always done by teams of people working together and struggling to produce quality software within their budget. Each person in these teams generally knows his job and wants to do it, without being bothered by other people. However, when people work towards a common goal they have to exchange data and create dependencies between each other regarding these data. If these people have to follow a process, cooperating and synchronizing with co-workers and trying to reach one's own goal becomes too difficult to manage. This may lead to frustration, lower productivity and reluctancy to follow the predefined process. This is why some support is needed to avoid common mistakes that occur when people exchange data. In this paper, a hybrid approach to support cooperation is presented. The originality of this approach is the ability to enforce general properties on cooperative interactions while using the semantic of applications to fit particular situations or requirements. This paper gives a brief idea about the general enforced properties on activity interactions. It describes in detail the semantic rules that control activity results, the impacts of the cooperation on these rules and how both dimensions interact.
ADDING FORM TO REAL-TIME SYSTEM SPECIFICATION AND SIMULATION
Authors: LEE JI Y. , KANG KYO C. , KIM GERARD J. , KIM HYE J.
Published: February 2003

Specification and validation of a real-time system are often based on making simplistic predictions and assumptions about relevant behavior of the external environment and the controlled device interacting with it. However, in many cases, real-time systems physically interact with other external objects in a complex manner in a dynamically changing world and thus, their form (e.g. physical properties such as shape, mass, material, and configuration) can play a critical role in producing a correct specification and obtaining realistic simulation output.

We present ASADAL/PROTO, a specification and simulation tool for real-time systems, that takes form into account in addition to the function and behavior handled by ASADAL/SIM, its predecessor. Simulation of the control system specification runs in conjunction with the environmental simulation, and the resulting interactive behavior of the controlled system is observed visually for analysis. Our vision is to incrementally model, simulate and analyze all three views (behavior, function, and form) of real-time system specification for its increased level of confidence at early prototyping stage.
A PROCESS MODEL APPLICABLE TO SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING
Authors: ACUÑA SILVIA T. , LOPEZ MARTA , JURISTO NATALIA , MORENO ANA
Published: February 2003

Software engineering (SE) and knowledge engineering (KE) develop software systems using different construction process models. Because of the growing complexity of the problems to be solved by computers, the conventional systems (CS) and knowledge-based systems (KBS) software process is at present passing through a period of integration. In this paper, we propose a software process model applicable to both CS and KBS. The model designed is declarative, that is, it indicates what is done to build a software system. Its goal is to provide software and knowledge engineers with a techno-conceptual tool to develop systems comprising both traditional and knowledge-based software.
ENGINEERING VIA DISCOURSE: CONTENT STRUCTURE AS AN ESSENTIAL COMPONENT FOR MULTIMEDIA DOCUMENTS
Authors: MORRIS STEPHEN J. , FINKELSTEIN ANTHONY C. W.
Published: February 2003

Practical problems of multimedia document production require software engineers to provide an effective framework for inter-professional work. This paper distinguishes between abstract and physical media and hence provides the basis for definitions of multiple media and multimedia and the context for reviewing content structures proven in other disciplines. Such structures can act as a guide for production and the notion of the navigable discourse structure provides the essential means for testing content design. Combining these structures in a discourse driven process model and production method facilitates both the design of content and the development of associated software in an ordered and integrated manner, thus avoiding the pitfalls of ad hoc approaches. Investigation and testing of these concepts was effected via two case studies involving the production of two multimedia demonstrations of software engineering tools.
SITUATION-DEPENDENT METAPHOR FOR PERSONAL MULTIMEDIA INFORMATION
Authors: HEWAGAMAGE K. PRIYANTHA , HIRAKAWA MASAHITO , ICHIKAWA TADAO
Published: February 2003

Recently available low-cost personal computers and mechanisms to produce digital data have caused a staggering increase in the amount of multimedia data acquired by the user. Hence, the user's personal information space that consists of a large collection of files, may distribute over a number of computers. Situation-dependent metaphor methodology, described in this paper, provides a novel approach to managing such a collection with respect to the context of user's interactions with data. By considering the mobile computing environment, the physical location, time periods and activities are primarily used in modeling the situation metaphor. Sensors and software agents are used in capturing contextual factors automatically. Situation Space describes the theoretical foundation for the situation metaphor based information organization. We also presents our prototype engineered model, Situated Information Filing and Filtering (SIFF), to demonstrate the situation-dependent data management. The SIFF provides the framework for organizing the personal information and developing applications that require contextual information.
DESIGNING HYPERMEDIA APPLICATIONS WITH OBJECTS AND PATTERNS
Authors: ROSSI GUSTAVO , SCHWABE DANIEL , LYARDET FERNANDO
Published: February 2003

In this paper we present a software engineering approach for building hypermedia applications. Our approach combines the use of an object-oriented method with a system of design patterns for navigational and interface design.

We first present the core activities in the Object-Oriented Hypermedia Design Method (OOHDM), namely conceptual design navigation design, abstract interface design and implementation, describing the modeling constructs we use to build high-level, abstract navigational and interface structures. Next we give the rationale for using design patterns in the process of building high quality hypermedia applications, and present some simple patterns solving recurrent design problems. We finally discuss some further issues.
SPECIFICATION OF MULTIMEDIA SOFTWARE SYSTEMS USING AN OBJECT ORIENTED ARCHITECTURE DESCRIPTION LANGUAGE
Authors: XU KUANG , TSAI JEFFREY J. P.
Published: February 2003

Despite the growing importance of multimedia applications, we still know relatively little about how to specify, design, and maintain this class of complex applications in a systematic manner. The concept of software architecture has recently emerged as a way to improve our ability to effectively construct and maintain large-scale complex software systems. Under this new paradigm, software engineers are able to do evolutionary design of complex systems through architecture specification, design rationale capture, architecture validation and verification, and architecture transformation. Several architecture description languages (ADLs), such as Wright, Rapide, UniCon, ACME, etc. have been proposed to support the architecture development under this new software paradigm. Although current ADLs more or less support certain features of object-oriented design approach, few of them are purely based on object-oriented paradigm. In this paper, we present an architecture description language — OOADL (Object-Oriented Architecture Description Language) to facilitate the architecture specification of multimedia software systems. This language takes object-oriented paradigm as its backbone, and provides formal semantics for modeling architectures of software systems. It also aims at other goals such as, support for hierarchical refinement, support for reuse of architecture styles, support for analysis, and support for exception handling. We also introduce the default architecture style which brings the features of extensibility and re-usability into the language. Finally, we use OOADL to construct part of the architecture framework of a multimedia system to illustrate the usage and modeling capability of OOADL.
INDUSTRY PRACTICES IN PROJECT MANAGEMENT FOR MULTIMEDIA INFORMATION SYSTEMS
Authors: MACDONELL STEPHEN G. , FLETCHER TIM , WONG B. L. WILLIAM
Published: February 2003

This paper describes ongoing research directed at formulating a set of appropriate measures for assessing and ultimately predicting effort requirements for multimedia systems development. Whilst significant advances have been made in the determination of measures for both transaction-based and process-intensive systems, very little work has been undertaken in relation to measures for multimedia systems. A small preliminary empirical study is reviewed as a precursor to a more exploratory investigation of the factors that are considered by industry to be influential in determining development effort. This work incorporates the development and use of a goal-based framework to assist the measure selection process from a literature basis, followed by an industry questionnaire. The results provide a number of preliminary but nevertheless useful insights into contemporary project management practices with respect to multimedia systems.
A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
Authors: KAKOULIS KONSTANTINOS G. , TOLLIS IOANNIS G.
Published: February 2003

The automatic placement of text or symbol labels corresponding to graphical features is critical in several application areas such as cartography, geographical information systems, and graph drawing. In this paper we present a general framework for solving the problem of assigning text or symbol labels to a set of graphical features in two dimensional drawings or maps. Our approach does not favor the labeling of one type of graphical feature (such as a node, edge, or area) over another. Additionally, the labels are allowed to have arbitrary size and orientation. We also present a fast and simple technique, based on the general framework, for assigning labels to edges of graph drawings. We have implemented our techniques and have performed extensive experimentation on hierarchical and orthogonal drawings of graphs. The resulting label assignments are very practical and indicate the effectiveness of our approach.
SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS
Authors: COHEN JONATHAN , MANOCHA DINESH , OLANO MARC
Published: February 2003

We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original model has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local orthogonal projections to the plane as well as for the selection of a new vertex position resulting from the edge collapse operation. The algorithm computes guaranteed error bounds on surface deviation and produces an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70, 000 triangles, a textured lion model consisting of 49 parts and 86, 000 triangles, a textured, wrinkled torus consisting of 79, 000 triangles, a dragon model consisting of 871, 000 triangles, a Buddha model consisting of 1,000,000 triangles, and an armadillo model consisting of 2, 000, 000 triangles.
THE LÉVY LAPLACIAN ACTING ON POISSON NOISE FUNCTIONALS
Authors: SAITÔ KIMIAKI , TSOI ALLANUS H.
Published: February 2003

In this paper we shall discuss the Lévy Laplacian acting on the space of Poisson noise functionals. We give eigenfunctions of the Laplacian and extend the operator to a self-adjoint operator densely defined on some Hilbert space.
A CONTINUITY PROPERTY OF QUANTUM DYNAMICAL ENTROPY
Authors: FANNES M. , TUYLS P.
Published: February 2003

In this paper, we are mainly concerned with the computation of the dynamical entropy for the noncommutative toral automorphisms and the noncommutative shifts on a spin chain. The entropy that we consider is based on coarse-grained models of the system. In contrast to the classical situation, successive observations of a quantum system can generate entropy by themselves. We pay special attention to the delicate problem of delimiting a natural class of models for computing the entropy.
ASYMPTOTICS OF INFINITE-DIMENSIONAL INTEGRALS WITH RESPECT TO SMOOTH MEASURES I
Authors: ALBEVERIO S. , STEBLOVSKAYA V.
Published: February 2003

This is the first part of a work on Laplace method for the asymptotics of integrals with respect to smooth measures and a large parameter developed in infinite dimensions. Here the case of finitely many (nondegenerate) minimum points is studied in details. Applications to large parameters behavior of expectations with respect to probability measures occurring in the study of systems of statistical mechanics and quantum field theory are mentioned.
EXTREMAL DECISION RULES IN QUANTUM HYPOTHESIS TESTING
Authors: PARTHASARATHY K. R.
Published: February 2003

We present a complete description of the extreme points of the convex set of all decision rules in testing multiple hypotheses concerning a quantum system whose states are described by density matrices in a finite-dimensional Hilbert space. Holevo's equations for an optimal decision are derived by methods of elementary calculus and a simple example is given in order to illustrate the nonuniqueness of optimal decision rules.
SELF-INTERSECTION LOCAL TIME FOR ${\mathcal S}' ({\mathbb R}^d)$-WIENER PROCESSES AND RELATED ORNSTEIN–UHLENBECK PROCESSES
Authors: BOJDECKI TOMASZ , GOROSTIZA LUIS G.
Published: February 2003

Existence and continuity results are obtained for self-intersection local time of [Formula: see text]-valued Ornstein–Uhlenbeck processes [Formula: see text], where X0 is Gaussian, Wt is an [Formula: see text]-Wiener process (independent of X0), and T't is the adjoint of a semigroup Tt on [Formula: see text]. Two types of covariance kernels for X0 and for W are considered: square tempered kernels and homogeneous random field kernels. The case where Tt corresponds to the spherically symmetric α-stable process in ℝd, α∈(0,2], is treated in detail. The method consists in proving first results for self-intersection local times of the ingredient processes: Wt, T't X0 and [Formula: see text], from which the results for Xt are derived. As a by-product, a class of non-finite tempered measures on ℝd whose Fourier transforms are functions is identified. The tools are mostly analytical.