Browsing by Author "Wu, IC"

Now showing 1 - 18 of 18

A web data extraction description language and its implementation
(2005)
Wu, IC
;
Su, JY
;
Chen, TB
;
資訊工程學系
;
Department of Computer Science
A data extraction model, named the browser-oriented data extraction (BODE) model, was proposed in [14] to extract web contents with script functions. In this model, the system built on top of browsers accesses pages by simulating users' operations on browsers. Based on this model, this paper defines a scripting language, named the BODED (Browser-Oriented Data Extraction Description) language, which instructs the system how to do data extraction. This paper propose. a technique, called indirect browser replication to implement a BODE system, and also optimize the performance of this technique.
An efficient distributed online algorithm to detect strong conjunctive predicates
(2002-11-01)
Chen, LB
;
Wu, IC
;
資訊工程學系
;
Department of Computer Science
Detecting strong conjunctive predicates is a fundamental problem in debugging and testing distributed programs. A strong conjunctive predicate is a logical statement to represent the desired event of the system. Therefore, if the predicate is not true, an error may occur because the desired event does not happen. Recently, several reported detection algorithms reveal the problem of unbounded state queue growth since the system may generate a huge amount of execution states in a very short time. In order to solve this problem, this paper introduces the notion of removable states which can be disregarded in the sense that detection results still remain correct. A fully distributed algorithm is developed in this paper to perform the detection in an online manner. Based on the notion of removable states, the time complexity of the detection algorithm is improved as the number of states to be evaluated is reduced.
An efficient incremental algorithm for identifying consistent checkpoint
(1998)
Chen, LB
;
Wu, IC
;
資訊工程學系
;
Department of Computer Science
In a distributed system, identifying consistent check points is essential for error recovery and debugging. In this paper, me design an efficient incremental algorithm capable of identifying all the consistent and removable checkpoints each time a new checkpoint is reported. By doing so, the required memory space can be minimized by removing those removables. While minimizing the memory space, the algorithm requires only O(p(2)M) time in total, where p is the number of processes and M is the number of checkpoints.
An event-driven framework for inter-user communication applications
(2006-07-01)
Hsu, CC
;
Wu, IC
;
資訊工程學系
;
Department of Computer Science
This paper presents an event-driven framework for inter-user communication applications, such as Internet gaming or chatting, that require frequent communication among users. This paper addresses two major blocking problems for event-driven programming for inter-user communication applications, namely output blocking and request blocking. For the former, an output buffering mechanism is presented to solve this problem. For the latter, a service requesting mechanism with helper processes is presented to solve this problem. The above two mechanisms are incorporated into the framework presented in this paper to facilitate application development. In practice, this framework has been applied to online game development. (C) 2005 Elsevier B.V. All rights reserved.
Connect6
(2005-12-01)
Wu, IC
;
Huang, DY
;
Chang, HC
;
資訊工程學系
;
Department of Computer Science
This note introduces the game Connect6, a member of the family of the k-in-a-row games, and investigates some related issues. We analyze the fairness of Connect6 and show that Connect6 is potentially fair. Then we describe other characteristics of Connect6, e.g., the high game-tree and state-space complexities. Thereafter we present some threat-based winning strategies for Connect6 players or programs. Finally, the note describes the current developments of Connect6 and lists five new challenges.
Detection of summative global predicates
(2003-05-01)
Chen, LB
;
Wu, IC
;
資訊工程學系
;
Department of Computer Science
In many distributed systems, tokens are fundamental tools to manage resources shared by processes. Thus, monitoring tokens has become a significant problem in developing the distributed programs. This paper formulates the problems of monitoring tokens in terms of detecting the special global predicates, called summative global predicates. In this paper, several algorithms to detect various summative global predicates are developed and their time complexities are discussed.
Detection of summative global predicates
(1997)
Chen, LB
;
Wu, IC
;
資訊工程學系
;
Department of Computer Science
In distributed programs, we usually keep some global predicates from being satisfied to make it easy to run the programs correctly. A common type of global predicates are: the total number of certain tokens in the whole distributed system is always the same or in specific ranges, In this paper; we call this summative predicates, classified into the following four: (1) at some global state of the system, N not equal K, (2) N < K (or N less than or equal to K), (3) N > K (or N greater than or equal to K), and (4) N = K, where N is the fetal number of tokens and ii is a constant. This paper investigates the methods of detecting various summative global predicates, The first class of summative predicates are trivial to detect by simply checking each message, For the second class of summative predicates, Groselj [6] and Garg [2] solved the problem by reducing the problem to a maximum network pou: problem. In this paper, we propose an elegant technique, called normalization, to allow the second and third classes of summative predicates to be solved by also reducing the problem to a maximum network pou: problem. For the fourth floss of summative! predicates, we prove that it is an NP-complete problem.
Integrating SET and EDI for secure healthcare commerce
(2001-11-01)
Liu, DR
;
Wu, IC
;
Hsieh, ST
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
Different from conventional online goods purchases, healthcare commerce, such as purchasing prescription drugs. involves transaction steps of insurance coverage inquiries which are required to determine insurance coverage and payments. Without efficient processing of online insurance coverage inquiries, the online healthcare commerce cannot be carried out successfully. This work proposes a novel secure healthcare commerce protocol that incorporates the insurance coverage inquiries into the transaction steps of online purchases. The proposed protocol is designed based on the Secure Electronic Transaction (SET) and healthcare Electronic Data Interchange (EDI). Efficient ASC X12N interactive EDI messages are adopted to facilitate online real-time interactions of insurance coverage inquiries. The results have shown that the process of healthcare commerce is streamlined by integrating secure online purchases and online EDI interactions. (C) 2001 Elsevier Science B.V. All rights reserved.
K-support system: Knowledge support for disseminating and sharing task-relevant knowledge
(2004)
Wu, IC
;
Liu, DR
;
Yang, KS
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
In task-based business environments, an important issue in deploying Knowledge Management Systems (KMS) is providing task-relevant information to fuflll the information needs of knowledge workers. This work develops a Knowledge Support (K-Support) system providing a collaborative task-based workplace to facilitate knowledge retrieval and sharing among peer-groups. In the developed system, an adaptive task-based profiling approach is proposed to model worker's information needs (profiles), while a fuzzy analytical method is proposed to identify peer-groups with similar task-interests based on workers' profiles. The K-Support system is grounded in a research institute to effectively stimulate task-based knowledge retrieval and sharing.
On detection of bounded global predicates
(1998-01-01)
Wu, IC
;
Chen, LB
;
資訊工程學系
;
Department of Computer Science
Distributed programs often follow some bounded global predicates, for example, the total number of certain tokens is always the same or bounded in a range. In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range, Recently, Chase and Garg proposed an efficient method to derive the minimum global snapshot by reducing this problem to a maximum network flow problem. A restriction of this method is that all message values (e.g,, the token number in messages) must be zero and all process state values (e.g,, the token number in processes) must be non-negative. In this paper, we propose an elegant technique, called normalization. By using this technique, we can remove the above restriction and also derive the minimum and maximum global snapshots at the same time.
On detection of bounded global predicates
(1998-01-01)
Wu, IC
;
Chen, LB
;
資訊工程學系
;
Department of Computer Science
Distributed programs often follow some bounded global predicates, for example, the total number of certain tokens is always the same or bounded in a range. In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range, Recently, Chase and Garg proposed an efficient method to derive the minimum global snapshot by reducing this problem to a maximum network flow problem. A restriction of this method is that all message values (e.g,, the token number in messages) must be zero and all process state values (e.g,, the token number in processes) must be non-negative. In this paper, we propose an elegant technique, called normalization. By using this technique, we can remove the above restriction and also derive the minimum and maximum global snapshots at the same time.
On the complexity of the minimum and maximum global snapshot problems
(1997)
Chen, LB
;
Wu, IC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
Deriving the minimum and maximum global snapshots Is very useful for some error detection problems in distributed programs. Several researchers, e.g., Groselj, Chen and Wu, have shown that the minimum and maximum global snapshot problems are linear-time reducible to the maximum constant-ratio net work flow (MCNF) problem, here defined as the well-known maximum network flow problem with m = Theta(n), where m is the number of edges and n is the number of vertices in the given flow network. In this paper we show in a reverse way that the MCNF problem is also linear-time reducible to these global snapshot problems. Thus, we can conclude that the global snapshot problems are ''as difficult as'' the MCNF problem in terms of time complexity.
On the time complexity of minimum and maximum global snapshot problems
(1998-08-17)
Chen, LB
;
Wu, IC
;
資訊工程學系
;
Department of Computer Science
Deriving the minimum and maximum global snapshots is very useful for some error detection problems in distributed programs. Several researchers, e.g., Groselj, Chen and Wu, have shown that the minimum and maximum global snapshot problems are linear-time reducible to the maximum constant-ratio network flow (MCNF) problem, here defined as the well-known maximum network flow problem with m = Theta(n), where m is the number of edges and n is the number of vertices in the given flow network. In this paper we show in a reverse way that the MCNF problem is also linear-time reducible to these global snapshot problems. Thus, we can conclude that the global snapshot problems are "as difficult as" the MCNF problem in terms of time complexity. (C) 1998 Elsevier Science B.V. All rights reserved.
Optimization and quality measurement for the layer 2 compression scheme of MPEG audio coding
(1997)
Hsu, CH
;
Wu, IC
;
Kao, LY
;
Ueng, JF
;
資訊工程學系
The layer 2 compression scheme of MPEG audio coding is a very common audio coding standard for CD quality audio (music). However, its encoding process requires a large amount of computations fn this paper, we propose some optimization techniques to make the encoding program much faster while allowing to impair the audio qualify a little. In order to measure how much qualify loss, we define criteria to quantify the quality toss rate of an encoded audio stream. From the definition, we can say that the encoder encoding streams with a quality toss rate equivalently wastes a number of bits, if the encoder that completely conforms to the layer 2 standard can save the same number of bib while keeping the same quality loss rate. In our experiments, we optimize the layer 2 compression programs such that audio streams can be encoded real time on Pentium Pro 180 with only 0.0003% quality loss and equivalently 1.5% bits wasted and on Pentium 180 with only 0.0009% quality loss and equivalently 4% bits wasted.
Task-based K-Support system: disseminating and sharing task-relevant knowledge
(2005-08-01)
Liu, DR
;
Wu, IC
;
Yang, KS
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
In task-based business environments, effective knowledge management relies on providing task-relevant information to fulfill the information needs of knowledge workers. This work proposes an adaptive task-based profiling approach to model workers' task needs, namely information needs (profiles) on tasks. Meanwhile, a fuzzy analytical method is proposed to identify peer-groups with similar task needs based on workers' profiles. Accordingly, a Knowledge Support (X-Support) system is developed to provide a collaborative task-based workplace facilitating knowledge retrieval and sharing among peer-groups. The proposed X-Support system is grounded in a research institute to stimulate task-based knowledge retrieval and sharing. Experimental results show that the proposed system can support task-relevant knowledge effectively. (C) 2005 Elsevier Ltd. All rights reserved.
Task-stage knowledge support: Coupling user information needs with stage identification
(2005)
Wu, IC
;
Liu, DR
;
Chen, WH
;
資訊管理與財務金融系註：原資管所+財金所
;
Department of Information Management and Finance
Effective knowledge support in knowledge-intensive environments can place great demands on information filtering (IF) strategies. An IF system that relies on traditional information retrieval technology and user models (e.g., user profiles) is regarded as an effective approach for supporting long-term information needs. To provide a more effective knowledge support, we propose a task-stage knowledge support model that incorporates the advantages of the traditional IF model with the characteristics of each task-stage. A correlation analysis method is proposed to determine a worker's task-stage (e.g., pre-focus, focus formulation, and post-focus task stages), and an ontology-based topic discovery method is proposed to examine the variety of a worker's information needs for specific topics. Consequently, the knowledge support is achieved by coupling user information needs with task-stage identification.
The design and performance analysis for the multimedia function unit of the NSC-98 CPU
(1997)
Ueng, JF
;
Wu, IC
;
Kuo, YH
;
Kao, LY
;
Chen, CL
Leveraging Taiwan's hardware technologies, National Science Council in Taiwan proposed a project to design an advanced CPU, called NSC-98, compatible to the Intel MMX architecture. This paper discusses the design of multimedia extension, called MFU (Multimedia Function Unit), in this CPU. The MFU has the following two special features. (1) Support three more instructions for permutation operations, parallel distance operations, and parallel average operations; (2) implement two MFU subunits: one without the parallel multiplier and the other without the parallel shifter and converter (for permutation). This paper also does performance analysis by estimating the performances of the MFU with and without these features on some chosen multimedia benchmarks. These performance analysis results can justify our MFU design.
The model and systems for play-on-table games
(2004-11-01)
Wu, IC
;
Hsu, CC
;
資訊工程學系
;
Department of Computer Science
Most traditional board and card games, such as Chess, Chinese Chess, Go, Chinese Mahjong, Hearts, Bridge, etc., share the same playing model: Players play around tables using physical objects such as cards and may hold objects in their own private areas, e.g., players hold cards in their own hands in Bridge. In this paper, this model is called the play-on-table (POT) game model and these games following the model are called POT games. The research of this paper is summarized as follows. First. formalize the definition of the POT game model. Second, present some game systems to allow players to design and play new POT games. Third. prove that these game systems are general for all POT games. Finally. in order to demonstrate the theory, practically implement one of the general game systems that allows players to design and play new POT games in a what-you-see-is-what-you-get (WYSIWYG) manner.