By Topic

Computer Software and Applications Conference, 1998. COMPSAC '98. Proceedings. The Twenty-Second Annual International

Date 21-21 Aug. 1998

Filter Results

Displaying Results 1 - 25 of 103
  • Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241)

    Save to Project icon | Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (445 KB)  
    Freely Available from IEEE
  • Panel Discussion On Real-time Systems

    Page(s): 338 - 342
    Save to Project icon | Request Permissions | PDF file iconPDF (77 KB)  
    Freely Available from IEEE
  • Panel On Software Component Architectures

    Page(s): 596
    Save to Project icon | Request Permissions | PDF file iconPDF (6 KB)  
    Freely Available from IEEE
  • Author index

    Page(s): 649 - 651
    Save to Project icon | Request Permissions | PDF file iconPDF (322 KB)  
    Freely Available from IEEE
  • M-base: enduser-initiative application development based on message flow and componentware

    Page(s): 112 - 120
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (96 KB)  

    An explosive increase in end user computing on distributed systems requires that end users develop application software by themselves. One solution is given as a formula of “a domain model≡a computation model.” This formula implies that one task in a domain model of cooperative work corresponds to one object in a computation model based on an object oriented model. The application development environment, M-base, supports this formula for cooperative systems such as groupware and workflow systems. At the first stage, the system behavior at a macro level is expressed by using a modeling and simulation tool for constructing a message driven model while focusing on message flow and componentware. At the second stage, a source program in a script language is generated automatically from the message driven model. Furthermore, if necessary, static structure and detailed specifications of objects are expressed in the script language. Communication among objects is performed by a set of messages instead of a message, for implementation of flexible workflow View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented software specification in programming language design and implementation

    Page(s): 387 - 392
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (48 KB)  

    An object-oriented formal specification workbench is proposed for defining the syntax and semantics of programming languages, using which the formal properties of different languages can be elaborated and analyzed. Our specification approach is an object-oriented representation, structured around a denotational semantics methodology which abstracts out various common details so that formal syntax and semantics can be defined elegantly. Specific details can be inherited and specialized in defining the semantics of various programming languages, and the reusability and modifiability of many programming language features can be manifested across language paradigms. Furthermore, prototype implementations for these languages may be automatically developed from the formal specifications, providing a mechanism for compiler/interpreter reuse at the specification level View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing the effort of building object-oriented visualizations

    Page(s): 568 - 573
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (60 KB)  

    The construction of visualization systems is a difficult task. The management of large quantities of data and the support of dynamic exploration processes are some of the main causes of this difficulty. However, current approaches are far away from the system designer needs. Automatic construction systems, toolkits and dataflow based systems do not considerate all quality aspects such as flexibility, extensibility, modularity, reusability and generality. The design of a software architecture for construction of visualization systems, called Telescope, is described. This architecture allows building of visualization applications in different domains, as exemplified by the several developed applications. Also, it allows the incorporation of new tasks, algorithms and data types, and the specification of presentations in a declarative way. The development of applications using Telescope is described, along with a system developed with it, WarVis, for visualizing information about military conflicts View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Early measurement and improvement of software quality

    Page(s): 196 - 201
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (144 KB)  

    The paper combines relevant research in software reliability engineering and software measurement to develop an integrated approach for the early measurement and improvement of software quality. Recent research in these areas is extended 1) to select appropriate software measures based on. A formal model, 2) to construct tree-based reliability models for early problem identification and quality improvement, and 3) to develop tools to support industrial applications. Initial results applying this approach to several IBM products demonstrated the applicability and effectiveness of this approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Challenges in data management for the United States Department of Defense (DoD) command, control, communications, computers, and intelligence (C4I) systems

    Page(s): 622 - 629
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (64 KB)  

    This paper explores challenges facing data administrators, database engineers, and knowledge-base developers in the management of information in the United States (U.S.) Department of Defense (DoD), particularly in the information systems utilized to support Command, Control, Communications, Computers, and Intelligence (C4I). These information systems include operational tactical systems, decision-support systems, modeling and simulation systems, and non-tactical business systems, all of which can affect the design, operation, interoperation, and application of C4I systems. Specific topics include issues in integration and interoperability, joint standards, data access, data aggregation, information-system component reuse and legacy systems. Broad technological trends, as well as the use of specific developing technologies will be discussed in light of how they may enable the U.S. DoD to meet the present and future data-management challenges View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimistic method for updating information in distributed collaborative work

    Page(s): 400 - 405
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB)  

    Proposes a new method for updating information in distributed collaborative work. The effective performance of collaborative work distributed among several locations requires that information be replicated and freely updated in each distributed server. This is difficult to achieve with existing information-sharing methods such as the WWW and workflow. Our optimistic lock control method enables the direct updating of replicated information in any server while maintaining consistency among all the servers. A server failure is not critical to other servers because there is no master server. This method differs from the traditional master-slave method in which updates are performed in a specific master server. This paper also addresses the dynamic deployment of a new server. Our method is being used on a trial basis for an international software development project between Japan and India View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining execution histories for understanding the execution of business processes

    Page(s): 528 - 533
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (336 KB)  

    As database and workflow technologies are used to manage business processes, decision-makers of enterprises must query the execution of business processes to understand and refine these processes for expected throughput and quality. Introducing the representation of business processes in the database schema allows the execution histories of business processes to be maintained in the database for supporting queries on how business processes are executed. In this work, we incorporate finite state machines into the entity-relationship (ER) model for representing business processes in the database schema. Analytical systems can be developed in the proposed representation to assist decision-makers in observing the business processes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On analyzing the errors in a selectivity estimation method using a multidimensional file structure

    Page(s): 48 - 54
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1428 KB)  

    In this paper, we discuss the errors in selectivity estimation using the multilevel grid file (MLGF), a multidimensional file structure. We first analyze the cause of the estimation errors, and then investigate five factors affecting the accuracy of estimation: (1) the data distribution in a region, (2) the number of records stored in the MLGF, (3) the page size, (4) the query region size, and (5) the level of the MLGF directory. Next, we present through extensive experiments the tendency of estimation errors when the value for each factor changes. The results show that the errors decrease when (1) the distribution of records in a region becomes closer to the uniform one, (2) the number of records in the MLGF increases, (3) the page size decreases, (4) the query region size increases, and (5) the level of the MLGF directory containing data distribution information becomes lower. We define the granule ratio, the core formula representing the basic relationship between the estimation error and the above five factors, and finally examine the change of estimation errors in relation with the change of the granule ratio through experiments. The results indicate that with a specific value for the granule ratio, errors tend to be similar regardless of different values for the five factors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of design patterns for the self-development of a Java preprocessor

    Page(s): 330 - 335
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (192 KB)  

    An application of design patterns in the domain of language processing is presented. The target of the paper is a Java preprocessor which enables one, not only to add new features to the Java language but also to rewrite existing Java programs. Making use of several design patterns, including Reflection Architectural Pattern, we successfully create a framework for language processing in Java. In particular we design and implement a core language extension of Java so that self development and maintenance of the framework are possible. Several applications of the Java preprocessor and the framework are described, which include enumeration type definition, method tracer, and generic type definition mechanism View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rule base verification using Petri nets

    Page(s): 476 - 481
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1212 KB)  

    We propose a Petri net formalism for the verification of rule based systems. Typical structural errors in a rule based system are redundancy, inconsistency, incompleteness, and circularity. Since our verification is based on Petri nets and their incidence matrix, we need to transform rules into a Petri net first, then derive an incidence matrix from the net. In order to allow a rule based system to be immune from the above described structural errors, we have observed that for all columns in the matrix, all positive entries must be above all negative entries; and for all rows in the matrix, all positive entries must be to the right of all negative entries. If this is not the case, the rule based system may commit errors. Based on this concept, we have developed a tool consisting of the following four phases: rule normalization, rule ordering, rule-to-Petri-net transformation, and rule verification. In phase one, we normalize the rules into Horn clauses. We rearrange the ordering of these normalized rules in phase two, then transform the reordered rules into a Petri net and its corresponding incidence matrix in phase three. In phase four, we perform the rule verification based on the incidence matrix View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of action history view mechanisms for hypermedia systems

    Page(s): 412 - 420
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (136 KB)  

    For computer-supported cooperative work (CSCW), it is very important to understand the activities of users in a group. To support this understanding, we propose a mechanism called an “action history view” which shows the past actions of a user to other users for the purpose of letting them know what he/she has done, without revealing secret or useless information. The mechanism is coordinated among users who are distributed in terms of time. In this paper, the concept of the action history view mechanism is applied to hypermedia systems based on an object-oriented model to support users in viewing or reviewing past presentations in a short amount of time in hiding specified actions which it is not appropriate to show to other users. The generation of views is executed by removing a series of actions that correspond with the component to be hidden. The system also has a function for supporting users to select actions interactively while the user is viewing the replay. To qualify those kinds of views, the actions performed in a presentation are recorded in an action history stream, which consists of multiple logs. Finally, the application and implementation of a prototype of the action history view mechanism to a distance education system based on hypermedia is described View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software architectural modeling of the CORBA Object Transaction Service

    Page(s): 240 - 245
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (44 KB)  

    The OMG's Object Transaction Service (OTS) is an important CORBAService that provides transaction processing facilities on top of object request broker technology. With the OTS, specific interfaces and interaction models are introduced that intrinsically impact the design of single components and of component configurations that are to participate in transactional computation. We argue to record impacts as introduced by the OTS as distinct abstractions of design, and propose a software architectural approach to software system representation. We present a pattern-like connector abstraction for one processing model of the OTS, and discuss its use for modeling CORBA applications that interface the OTS. Using our concepts of connector and component abstractions, a vocabulary of design can be established, and design rationales for introducing component features can be well recorded, supporting continuous development of ORB-based systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application development process-a pipeline framework

    Page(s): 4 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (44 KB)  

    Application development process involves a set of activities to produce an application. Multiple dependencies among multiple activities can affect the development time of the overall application. These activities can be represented as process phases such as analysis, design, implementation, testing and so on. While some development approaches treat each phase to start after completion of the previous phase; others attempt to start a phase before completion of the previous phase. However, there is no clear methodology to follow to start the phases of development at the earliest possible time. We propose a framework for the application development process, where communication, dependency, and relative time between phases are important factors. The methodology proposed to start the activities of application development transforms the development process into a pipeline structure View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database access with HTML and Java-a comparison based on practical experiences

    Page(s): 588 - 593
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (76 KB)  

    We use HTML and Java to enable relational databases for the World Wide Web and provide a comparison between both techniques based on practical experiences. We introduce a novel design and implementation technique for database backed Web applications based on a state machine model. The key idea is to create a design language to describe the user interface layout, the functionality and the database transactions in a homogenous way. The implementation of such a system is then composed from several parts with potentially different techniques, for example either a pure HTML interface with all its functionality at the server side or a Java applet with more functionality at the client side. The goal is to generate the different implementations automatically from the design language. With this development framework the design and implementation of various database backed Web applications will be easier, faster and less error prone View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code synthesis based on object-oriented design models and formal specifications

    Page(s): 393 - 398
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (212 KB)  

    Presents an approach to synthesizing functional and robust code from object-oriented design models and Z data and operation specifications. The approach used is based on an integrated notation of the Unified Modeling Language (UML) and a slightly extended Z notation to include object-oriented concepts and structures. Our approach generates fully functional code which can be compiled and executed without modifications. The information from object-oriented analysis and design models along with the formal specifications are combined, analyzed and translated into an intermediate representation from which code can be generated. A research prototype has been developed to demonstrate the feasibility and the effectiveness of our approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modular Java API for object-oriented databases

    Page(s): 55 - 60
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (44 KB)  

    The object-oriented programming language Java is an ideal companion to an object-oriented database system. This paper describes our approach to provide a seamless application programmer interface. It is based on a modular architecture with components for database engines, a communications protocol and a JAVA API facilitator. The open architecture is flexible, scalable and distributed in nature View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation reuse and inheritance in distributed component systems

    Page(s): 496 - 501
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (40 KB)  

    Software components are elemental units of software that can be realised within distributed, object oriented architectures such as CORBA or DCOM. The paper describes special aspects of reuse in such componentware architectures and discusses possible mechanisms for implementation reuse. It introduces the concept of Component Adapters-software components mapping requests of client components to appropriate implementations provided by server components. These support the realisation of implementation inheritance at object level (dynamic inheritance). A management architecture is described which supports dynamic inheritance. This includes managing and maintaining a system wide “object schema” for inter component inheritance relationships View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer simulation of the inverse problem of electrocardiography

    Page(s): 563 - 567
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (168 KB)  

    The determination problem of the electrostatics sources carrier given on different sets potentials is numerically solved. The results of experiments with computer models are shown. On the basis of the obtained results the new approach for solving the inverse problem of electrocardiography is suggested View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range-based bitmap indexing for high cardinality attributes with skew

    Page(s): 61 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB)  

    Bitmap indexing, though effective for low cardinality attributes, can be rather costly in storage overhead for high cardinality attributes. Range-based bitmap (RBM) indexing can be used to reduce this storage overhead. The attribute values are partitioned into ranges and a bitmap vector is used to represent a range. With RBM, however, the number of records assigned to different ranges can be highly uneven, resulting in non-uniform search times for different queries. We present and evaluate a dynamic bucket expansion and contraction (DBEC) approach to simultaneously constructing range-based bitmap indexes for multiple high-cardinality attributes. Simulations are conducted to evaluate this DBEC approach. Both synthetic and real data are used in the simulations. The results show that (1) with highly skewed data, DBEC performs quite well compared with a simple approach and (2) DBEC compares favorably with the optimal approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.