Browsing by Author "Chen, DJ"

Now showing 1 - 20 of 36

A component-based visual scenario construction language for electronic book
(2000)
Koong, CS
;
Tyan, JS
;
Chuang, SF
;
Chen, DJ
;
資訊工程學系
Multimedia electronic boob play an important role in now day as the demand of creative education becoming a major trend in elementary, schools. Although the textual scripting languages can describe powerful scenario, users must be skilled with programming ability in older to create multimedia electronic books. For common users such as elementary school teachers, it may not be an easy job for them to produce multimedia electronic book. Thus, innovative ways to create multimedia electronic book must be quested. In this paper; we propose a visual scenario construction language for electronic books. Using the proposed visual construction approach, one can create animated pictures or motion pictures and use it to describe a presentation scenario instead of writing a large mass of textual program. Based on the proposed approach, an interactive multimedia electronic book can be produced relatively easy compared with the use of traditional approaches.
A generalisation of consecutive k-out-of-n : G systems
(2000-06-01)
Lin, MS
;
Chang, MS
;
Chen, DJ
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k*/n:G systems, is studied. A Con/k*/n:G system has n ordered components and is good if and only if ki good consecutive components that originate at component i are all good, where k(i) is a function of i. Theorem 1 gives an O(n) time equation to compute the reliability of a linear system and Theorem 2 gives an O(n(2)) time equation for a circular system. A distributed computing system with a linear (ring) topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.
A generic software framework for the software system architecture design and implementation of handset devices
(2005)
Liu, PC
;
Tsai, MJ
;
Chen, DJ
;
資訊工程學系
;
Department of Computer Science
The traditional approach to develop user interface for handset devices has limited flexibility on the UI requirement changes. Once the UI requirement changed, programmers have to change their handcrafted application once again. This change may occur repeatedly until the UI requirement under consideration is satisfied. Visual-Based Software Construction Methodology has been developed This methodology helps programmers to develop the user interface for handset devices, and allows programmers to migrate their program to new platform quickly. Based on this methodology, we quest for a generic software framework to incorporate the proposed methodology for developing user interface to alleviate the problems mentioned above. From our study, there are some similarities exist among user interface and software framework in different handset devices. In this paper, we propose a generic software framework for the system architecture design of handset devices. Specifically, the software framework generated based on the genetic software framework will be much easier for maintenance and management compared Kith the traditional approach. In addition, the software framework hat is instantiated from the generic software framework can be incorporated into the visual requirement authoring system for user interface development. Finally, we design and construct a simulator to demonstrate the applicability and usefulness of the software framework generated by the proposed generic software framework.
A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems
(1997-11-01)
Chen, DJ
;
Chen, RS
;
Huang, TH
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
The reliability of Distributed Computing Systems (DCS) in terms of Distributed Program Reliability (DPR) and Distributed System Reliability (DSR) has been studied intensively. Current reliability algorithms available for the analysis of DPR and DSR include MFST, FARE, FST, and FST-SPR. This paper presents a reliability algorithm, called HRFST, that eliminates the need to search a spanning tree during each subgraph generation. The HRFST algorithm reduces both the number of subgraphs (or trees) generated and the actual execution time required for analysis of DPR and DSR. Examination of several sample cases shows that the HRFST algorithm is more efficient than the FST-SPR algorithm.
A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems
(1997-11-01)
Chen, DJ
;
Chen, RS
;
Huang, TH
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
The reliability of Distributed Computing Systems (DCS) in terms of Distributed Program Reliability (DPR) and Distributed System Reliability (DSR) has been studied intensively. Current reliability algorithms available for the analysis of DPR and DSR include MFST, FARE, FST, and FST-SPR. This paper presents a reliability algorithm, called HRFST, that eliminates the need to search a spanning tree during each subgraph generation. The HRFST algorithm reduces both the number of subgraphs (or trees) generated and the actual execution time required for analysis of DPR and DSR. Examination of several sample cases shows that the HRFST algorithm is more efficient than the FST-SPR algorithm.
A probability model for reconstructing secret sharing under the internet environment
(1999-06-01)
Lee, CY
;
Yeh, YS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
Internet technologies have ushered in a new era for computer-related communications. Use of the Internet for commercial applications and resource sharing has accelerated in recent years as well. Owing to such developments, Internet security has become a critical issue for both academic and commercial sectors. Several studies have focused on areas involving network security such as authentication, privacy, and integrity. In some applications, an important message can be divided into pieces and allocated at several different sites over the Internet for security access concern. For example, an important map that can be used to access a military base, a vital key that can be used to give a military order or command. To access such an important message, one must reconstruct the divided pieces from different sites under the given Internet environment. In this paper, we present a novel probability model for reconstructing secret sharing under the Internet. Also, how to assign the divided shares into different sites over the Internet is studied. Also proposed herein are algorithms to perform shares assignment and to evaluate the probability of reconstructing the divided pieces into the original secret. Illustrative examples and simulation results demonstrate the feasibility of the proposed approach. (C) 1999 Elsevier Science Inc. All rights reserved.
A share assignment method to maximize the probability of secret sharing reconstruction under the Internet
(1998)
Lee, CY
;
Yeh, YS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
The use of Internet for various business applications and resource sharing has grown tremendously over the last few years. In some applications, an important document may be required to be divided into pieces and be allocated in different locations over the Internet for security access concern. For example, an important map that can be used to access a military base, an important key that can be used to give a military order or command. To access such an important document, one must reconstruct the divided pieces from different locations. In this paper, a probability model for reconstructing the secret sharing under the Internet is proposed. Also, how to assign the divided shares into different locations is studied. Particularly, algorithms to perform share assignment and to reconstruct the divided pieces into the original secret are proposed.
A share assignment method to maximize the probability of secret sharing reconstruction under the Internet
(2000-02-01)
Lee, CY
;
Yeh, YS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
The use of Internet for various business applications and resource sharing has grown tremendously over the last few years. Internet security has become an important issue for both academic and industrial sectors. Much related network security research has been conducted such as user authentication, data confidentiality, and data integrity. In some applications, a critical document can be divided into pieces and allocated in different locations over the Internet for security access concern. To access such an important document, one must reconstruct the divided pieces from different locations under the given Internet environment. In this paper, a probability model for reconstructing secret sharing and algorithms to perform share assignment are presented. Also, an evaluation algorithm to measure the probability of secret sharing reconstruction is proposed. Illustrative examples and simulation results are provided to demonstrate the applicability of our method.
A visual authoring system for animated multimedia homepage
(2000)
Chuang, SF
;
Koong, CS
;
Tyan, JS
;
Chen, DJ
;
資訊工程學系
The WWW has become a powerful media for knowledge displacement and acquisitions for Internet users. For Internet content providers, Homepage is the common way to let users to know were the contents are placed. Currently, there are many Homepage design tools available Express, Flash, HotDog,... to name a few. While making an animated multimedia Homepage, most of these design tools have to use their extended programming features such as achieve this goal. For general users, especially for the non-computer professional users, to write java program to make an animated multimedia Homepage is not an easy job. In this paper a visual authoring system for general users to make an animated multimedia Homepage is proposal. Based on this tool, users can create an animated any program ol code. The proposed authoring tool has been technology transferred to the Best Wise International Computing Cooperation for product development. Examples shown in this paper ar-e created based on the WebFace Maker: (A product of the Best Wise International Computing Co.) which is a product developed using the proposed technology.
An efficient file transmission algorithm for distributed computing systems
(1996)
Chen, DJ
;
Chang, PY
;
Lee, YW
;
交大名義發表
;
資訊工程學系
In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and their locations are transparent to the executed program, it becomes system's responsibility to select a proper file server such that data can be transmitted in an effective way. In this paper, we consider the scenario that a particular program needs several data files simultaneously for its execution. Each datafile may has replicas across the network. The problem is how to find a collection of file servers and the routing paths such that the data transmission time is minimum. An exhaustive approach could of course find the optimal solution. However if pays for high computation price. We thus proposes a heuristic method. Results obtained from the proposed method are encouraging.
An efficient multipath routing for distributed computing systems with data replication
(1999-11-01)
Chen, DJ
;
Chang, PY
;
資訊工程學系
;
Department of Computer Science
In distributed computing environments, executing a program often requires the access of remote data files. An efficient data routing scheme is thus important for time-critical applications. To ensure a prior desired communication quality, we present a connection-oriented routing scheme, the multipath routing, which allows multiple routes to be established between the source and the destination. Based on the multipath routing scheme, the problem of finding a collection of routing paths for an application to minimize its data transmission time is addressed. Such a problem becomes a complex combinatorial one when the application accesses multiple replicated data sources. Since finding an optimal solution is computationally infeasible in practice, we thus propose a heuristic method to get a sub-optimal solution. (C) 1999 Elsevier Science Inc. All rights reserved.
An expert system for object-oriented program testing
(1998)
Chen, WC
;
Chen, DJ
;
Chen, DTK
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
Data abstraction, information hiding, inheritance, and dynamic binding are four basic elements used in designing object-oriented (OO) programs. These four mechanisms enable programmer to write OO programs for easy to be extended, easy to be reused, and easy to be maintained. Software implemented by OO methodologies had been shown to be able to increase software quality and productivity [5]. However, the quality and reliability of the software cannot be guaranteed along without an appropriate software testing approach. Traditional testing approaches cannot be applied directly for the testing of OO programs due to the OO characteristics used in OO programs. In this paper we propose and implement an expert system for the testing of OO programs. The proposed testing framework contains a system model and OO testing strategies. Rules used to represent these proposed testing strategies are discussed and formulated. Exampling tested programs are provided to demonstrate the applicability of the proposed approach.
An expert-system technique for object-oriented program testing
(1999-02-01)
Chen, WC
;
Chen, DJ
;
Chung, CG
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
Data abstraction, information hiding, inheritance, and dynamic binding are four basic elements used in designing object-oriented (OO) programs. These four mechanisms enable programmers to write object-oriented programs that are easily extended, reused and maintained. Software implemented by OO methodologies has increased software quality and productivity.(1) However, this cannot be guaranteed without an appropriate software testing approach. Traditional testing approaches cannot be applied directly to the testing of OO programs due to the OO characteristics used in these programs. OO program testing strategies and methods are proposed continually, but fewer OO testing tools with flexibility are discussed.
Distributed-program reliability analysis: Complexity and efficient algorithms
(1999-03-01)
Lin, MS
;
Chang, MS
;
Chen, DJ
;
資訊工程學系
;
Department of Computer Science
This paper investigates the problem of distributed-program reliability in various classes of distributed computing systems. This problem is computationally intractable for arbitrary distributed computing systems, even when it is restricted to the class of star distributed computing systems. One solvable case for star distributed computing systems is identified, in which data files are distributed with respective to a consecutive property; a polynomial-time algorithm is developed for this case. A linear-time algorithm is developed to test whether or not an arbitrary star distributed computing system has this consecutive file distribution property. Efficient algorithms may still be sought for computing lower & upper bounds on the distributed program reliability for arbitrary distributed computing systems.
Dynamic Java program corpus analysis - Part 1: The analyzer
(2001-05-01)
Hwang, CC
;
Chen, DJ
;
Huang, SK
;
Lin, MS
;
交大名義發表
Program corpus analysis is important in the optimization of runtime systems. Conventional linguistic analysis is static in nature and cannot reflect dynamic behaviors revealed by versatile object-oriented programming languages. We propose a pattern-based runtime profiler in this article. Unlike a conventional profiler or runtime visualization tools, representative program corpora accumulated and benchmarked not only shows monolithic functions that introduce excessive runtime overhead, hut also reflect their correlated code patterns, We propose a pattern-based analysis to address a program runtime bottleneck in a sequence of method invocations. It will reveal more semantic meanings in performance bottleneck rendered by object-oriented programming systems.
Dynamic Java program corpus analysis - Part 2: The control pattern analysis
(2001-06-01)
Hwang, CC
;
Chen, DJ
;
Huang, SK
;
Lin, MS
;
交大名義發表
Code patterns are statically recurring structures specific to a programming language, Control patterns are dynamically recurring structures invoked during program execution time, We have proposed a runtime profiler based on control patterns and demonstrate that all runtime traces can be represented by these patterns, A transformed form can be fed into a data-mining(1,2) analyzer(3) to find out if the recurring structures represent runtime behaviors.
Efficient algorithms for reliability analysis of distributed computing systems
(1999-07-01)
Lin, MS
;
Chang, MS
;
Chen, DJ
;
資訊工程學系
;
Department of Computer Science
A distributed computing system is modeled as a collection of resources (e.g. processing elements, data tiles and programs) interconnected via an arbitrary communication network and controlled by a distributed operating system, The distributed program reliability in a distributed computing system is the probability of successful execution of a program running on multiple processing elements and needs to retrieve data files from other processing elements. This reliability varies according to (1) the topology of the distributed computing system, (2) the reliability of the communication edges, (3) the data files and programs distribution among processing elements and (4) the data files required to execute a program. In addition, computing the reliability of distributed computing systems is #P-complete even when the distributed computing system is restricted to a series-parallel, a 2-tree, a tree, or a star structure. This paper presents efficient algorithms for computing the reliability of a distributed program running on other restricted classes of networks. (C) 1999 Elsevier Science Inc. All rights reserved.
File allocation algorithms to minimize data transmission time in distributed computing systems
(2001-07-01)
Chang, PY
;
Chen, DJ
;
Kavi, KM
;
資訊工程學系
;
Department of Computer Science
This work addresses a files allocation problem (FAP) in distributed computing systems. This FAP attempts to minimize the expected data transfer time for a specific program that must access several data files from non-perfect computer sites. We assume that communication capacity can be reserved; hence, the data transmission behavior is modeled as a many-to-one multi-commodity flow problem. A new critical-cut method is proposed to solve this reduced multi-commodity flow problem. Based on this method, two algorithms which use branch-and-bound are proposed for this FAR The proposed algorithms are able to allocate data files having single copies or multiple replicated copies. Simulation results are presented to demonstrate the performance of the algorithms.
Integration of Reusable Software Components and frameworks into a visual software construction approach
(2000-11-01)
Chen, DJ
;
Koong, CS
;
Chen, WC
;
Huang, SK
;
van Diepen, NWP
Software reuse is an effective means of improving software productivity and software quality. Reusable Software Components (RSCs) are the basic building components for software programs constructed using the software reuse approach. The object-oriented approach is used to design and implement our RSCs. Our laboratory has already implemented more than 300 reusable software components, including design-level frameworks in various application domains and approximately 200,000 lines of code in our library. These components and frameworks have been accumulated in the course of designing and implementing strategy-based game systems, multimedia authoring systems (2-D and 3-D), multimedia playback systems, and other application systems. Multimedia software plays an important role in the software industry. In contrast to traditional software, multimedia software provides users with visual and audio effects through their interfaces and can more accurately model the real world. A media component may contain various elements, such as text descriptions, voice narration, and animation sequences, which more closely present the subject to be modeled. Such a reusable media component is commonly referred to as a Multimedia Reusable Component(MRC). Using RSCs, frameworks, and MRCs, our laboratory has successfully designed and implemented a commercial product called DIY Magic Cartoon World for use in making subject-based cartoons. The RSCs and frameworks can be visualized as icons for a visual programming model. Reuse-in-large practice is, therefore, achieved using visual programming techniques based on these visualized components. In this study, we introduce design principles and implementation techniques for our RSCs, frameworks, and MRCs. RSCs, frameworks, and MRCs are integrated into a visual software construction approach. More specifically, the design concept and implementation of an approachfor visual software construction are described. In addition to discussing the advantages of the proposed construction approach, this work also presents examples which illustrate how the visual programming environment is used.
Media allocation methods to improve multimedia query and access reliability
(1997)
Chen, DJ
;
Lee, CY
;
Huang, HC
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
Distributed Multimedia Database Systems (DMDB) have pained in popularity for today's database system design due la their fault-tolerance resource-sharing capacity and reliable performance. Reliability performance is an important issue in DMDB design. The reliability of a DMDB depends on the reliability of its communication links and nodes as well as the distribution of its resources, such as various media. The distribution of media is an important factor that affect the multimedia query and access reliability (MQAR)). The reliability-oriented media assignment problem is to find a media distribution such that the MQAR is maximal, fn this paper, we attempt to develop a reliability model and algorithms to achieve reliability-oriented media allocation.