Publications (11)4.34 Total impact
-
Article: A physician order category-based clinical guideline comparison system.
[show abstract] [hide abstract]
ABSTRACT: Today, in order to provide high-quality medical services and to extend resources and reduce costs, many large hospitals have adopted clinical guidelines as a structured way to manage medical activities. However, customization of clinical guidelines in order to treat a large number of patients is a major challenge. In this paper, we present a physician order category-based clinical guideline comparison system. The system uses a preprocessor software to convert the clinical guidelines from a Microsoft Word document into XML format, and it can also compare clinical guidelines over the conceptual view such as the physician order category. The system has already been used to compare the HCC surgical clinical guidelines of Taiwan and Mongolia-resulting in some differences being found, for which possible causes were discussed. Therefore, it can be seen that our research provides a practical and convenient way in which to compare clinical guidelines based on physician order category-thereby saving time and enabling physicians to quickly resolve discrepancies and make necessary adjustments to clinical guidelines.Journal of Medical Systems 03/2012; 36(6):3741-53. · 1.13 Impact Factor -
Article: Redactable signatures for signed CDA Documents.
[show abstract] [hide abstract]
ABSTRACT: The Clinical Document Architecture, introduced by Health Level Seven, is a XML-based standard intending to specify the encoding, structure, and semantics of clinical documents for exchange. Since the clinical document is in XML form, its authenticity and integrity could be guaranteed by the use of the XML signature published by W3C. While a clinical document wants to conceal some personal or private information, the document needs to be redacted. It makes the signed signature of the original clinical document not be verified. The redactable signature is thus proposed to enable verification for the redacted document. Only a little research does the implementation of the redactable signature, and there still not exists an appropriate scheme for the clinical document. This paper will investigate the existing web-technologies and find a compact and applicable model to implement a suitable redactable signature for the clinical document viewer.Journal of Medical Systems 12/2010; 36(3):1795-808. · 1.13 Impact Factor -
Article: A secure authentication scheme for telecare medicine information systems.
[show abstract] [hide abstract]
ABSTRACT: The telecare medicine information system enables or supports health-care delivery services. In recent years, the increased availability of lower-cost telecommunications systems and custom made physiological monitoring devices for patients have made it possible to bring the advantages of telemedicine directly into the patient's home. These systems are moving towards an environment where automated patient medical records and electronically interconnected telecare facilities are prevalent. A secure authentication scheme will thus be needed to safeguard data integrity, confidentiality, and availability. Many schemes based on cryptography have been proposed for the goals. However, much of the schemes are vulnerable to various attacks, and are neither efficient, nor user friendly. Specially, in terms of efficiency, some schemes need the exponential computation resulting in high time cost. Therefore, we propose a novel authentication scheme that is added the pre-computing idea within the communication process to avoid the time-consuming exponential computations. Finally, it is shown to be more secure and practical for telecare medicine environments.Journal of Medical Systems 10/2010; 36(3):1529-35. · 1.13 Impact Factor -
Article: An idle listening-aware energy efficient scheme for the DCF of 802.11n
[show abstract] [hide abstract]
ABSTRACT: 802.11 wireless local area network (WLAN) technology is now common in power sensitive devices like smart phones and personal digital assistants (PDAs). However, the energy efficiency of such devices will be very low, especially for next generation WLAN technology. The reasons for this include the existence of a large number of active stations, short data time and ultra high physical layer (PHY) data rate, which are the characteristics of next generation WLAN technology. This poor energy efficiency will be due to the fact that the device will consume a lot of idle-listening energy during the Distributed InterFrame Space (DIFS) and back-off time, and that the energy consumed for idle listening is similar to the energy consumed while receiving data. In this article, we propose an intelligent scheme for reducing the energy consumed in idle listening. Our analysis and simulation programs show that our scheme can lengthen the battery endurance due to the shortening in idle-listening time effectively especially when the number of active stations is large. An important characteristic of our scheme is that it is fully compatible with legacy Distributed Coordinated Function (DCF), and there will be no throughput reduction if this power saving scheme is applied to the DCF of 802.11. We also propose an accurate power consumption model in the MAC layer which to the best of our knowledge has not been presented in any earlier research.IEEE Transactions on Consumer Electronics 06/2009; · 0.94 Impact Factor -
Conference Proceeding: Efficient Group Key Management Protocol with One-Way Key Derivation
[show abstract] [hide abstract]
ABSTRACT: The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models. Key trees are ideal for a group of users to efficiently and securely share a common secret key, the group key, which can encrypt transmitted data, or other session keys that protect group communication. An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations. The server does not have to send new keys to those members who can derive the keys by themselves, and the total number of encrypted keys transmitted per rekeying operation becomes fewer. It is shown that the technique can be applied to both synchronous and asynchronous rekeying operations. The proposed protocol outperforms the other group key management protocols from our analysis and simulation, and is suitable for practical systems.Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on; 12/2005 -
Conference Proceeding: Optimizing centralized secure group communications with binary key tree recomposition
[show abstract] [hide abstract]
ABSTRACT: The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models, In this paper, we propose an approach to reduce the path length of a binary key tree managed by a centralized group key server by recomposing it, such that subsequent group operations can benefit from fewer auxiliary key updates, fewer encryptions, and less multicast bandwidth. The server can recompose the key tree in a join or a leave operation without the use of additional auxiliary keys or encryptions. An optimal composition algorithm is presented. It is shown in our analysis that the algorithm is effective to reduce the path length of a binary key tree in join operations and leave operations.Advanced Information Networking and Applications, 2004. AINA 2004. 18th International Conference on; 02/2004 -
Article: Register Allocation Via Dynamically Updated Information.
J. Inf. Sci. Eng. 01/1992; 8:393-413. -
Conference Proceeding: Optimization on instruction reorganization
[show abstract] [hide abstract]
ABSTRACT: A pipelined processor increases its performance by partitioning an instruction into several separate operation steps. Several instructions can be executed in the pipeline in different pipe stages at the same time. Because of the overlapped execution of instructions, the result of an instruction may be used before it is available. One way to solve this problem is to schedule instructions at compiler time, thus the codes generated will be free from interlocks. The scheduling algorithm presented by T. Gross (1983) and J. Hennessy and T. Gross (1983) had significantly reduced the pipeline interlocks. With some modifications to distinguish the conflict condition, the algorithm does better at the same costMicroprogramming and Microarchitecture. Micro 23. Proceedings of the 23rd Annual Workshop and Symposium., Workshop on; 12/1990 -
Conference Proceeding: MARS-a RISC-based architecture for LISP
[show abstract] [hide abstract]
ABSTRACT: A RISC (reduced instruction set computer)-based chip set architecture for LISP is presented which contains an instruction fetch unit (IFU) and three processing units: integer processing unit (IPU), floating-point processing unit (FPU), and list processing unit (LPU). The IFU feeds instructions to the processing units and provides the branch handle mechanism to reduce branch penalty; the IPU is optimized for integer operations, string manipulation, operand address calculations, and some cooperation affairs for constructing a multiprocessor architecture; the FPU handles the floating point data type, which conforms to IEEE standard 754; and the LPU handles LISP runtime environment, dynamic type checking, and fast list access. In this architecture, the critical path of complex register file access and ALU (arithmetic and logic unit) operation is distributed into LPU and IPU, and the tracing of a list can be done quickly by the nondelayed car or cdr instructions of LPU. In addition, by using a new branch control mechanism (called branch peephole), this architecture can achieve almost-zero-delay branch and super-zero-delay jump. Performance simulation shows that this architecture would be about 4.1 times faster than SPUR and about 2.2 times faster than MIPS-XTools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on; 11/1989 -
Conference Proceeding: MARS-Multiprocessor architecture reconciling symbolic with numerical processing-a CPU ensemble with zero-delay branch/jump
[show abstract] [hide abstract]
ABSTRACT: The design of CPU (central processing unit) chips for the MARS project is described. They are the IFU (instruction fetch unit), IPU (integer processing unit), and LPU (list processing unit). The IFU is devised to interleave instruction fetch and execution, and thus to achieve coordinated execution among datapath chips. The IPU is the main computing engine for integer operations and operand address calculation. By using dual-instruction buffers, a reserved phase for branch/jump target fetch, and instruction decode peeping, the architecture can support almost-zero-delay branching and super-zero-delay jump. The LPU handles a Lisp runtime environment, dynamic type checking, and fast list access. In this architecture, the critical path of complex register file access and ALU operation is distributed over the LPU and IPU, and list tracing can be executed quickly by the nondelayed car or cdr instructionsVLSI Technology, Systems and Applications, 1989. Proceedings of Technical Papers. 1989 International Symposium on; 06/1989 -
Article: Secure and efficient group key management with shared key derivation
[show abstract] [hide abstract]
ABSTRACT: In many network applications, including distant learning, audio webcasting, video streaming, and online gaming, often a source has to send data to many receivers. IP multicasts and application-layer multicasts provide efficient and scalable one-to-many or many-to-many communications. A common secret key, the group key, shared by multiple users can be used to secure the information transmitted in the multicast communication channel. In this paper, a new group key management protocol is proposed to reduce the communication and computation overhead of group key rekeying caused by membership changes. With shared key derivation, new keys derivable by members themselves do not have to be encrypted or delivered by the server, and the performance of synchronous and asynchronous rekeying operations, including single join, single leave, and batch update, is thus improved. The proposed protocol is shown to be secure and immune to collusion attacks, and it outperforms the other comparable protocols from our analysis and simulation. The protocol is particularly efficient with binary key trees and asynchronous rekeying, and it can be tuned to meet different rekeying delay or key size requirements.Computer Standards & Interfaces.
Top co-authors
Top Journals
Institutions
-
1989–2004
-
National Taiwan University
- Department of Electrical Engineering
Taipei, Taipei, Taiwan
-
