• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1680-1691
• /
• 2009

To improve the quality of healthcare and build up the health delivery system, electronic health record system is important for healthcare institutions providing health services. However, the systems currently operated in domestic healthcare institutions use independent software interface with distributed environment for data search and process. Therefore, it raises an additional expense to buy or develop each interface module when there is a link to new system and the problem of complexity. To solve these problems, this study implemented the service oriented architecture basis for home nursing service and carried out an assessment. The study defined the process modeling and business requirements based on the scenario of service and drew 17 suitable services based on five verification items for service design. To draw the final service, seven services were selected by service litmus test (SLT). The study found that, by the improvement of business process for healthcare service support department, SOA based information system has an effect of time reduction of patient processing time. In conclusion, to enable the hospital information system to cope with various demands of healthcare consumers, it is necessary to consider the application of SOA technology which has excellent interoperability, reusability and maintenance.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1530-1538
• /
• 2009

KISTI-ACOMS ver. 2.0 has been distributed to more than 340 academic societies and used by more than 130 academic societies for 4 years since 2005 and still is desired for use by lots of other academic societies. But contrary to the desire and requests for system upgrades of academic societies, ACOMS has not been improved for last 3 years and some academic societies began to use domestic or foreign similar pay online peer review systems. In this paper, a new integrated portal service system is suggested in order to attempt national production cost-saving and quality improvement of academic information by creating and collecting high quality scientific and technologic academic information inexpensively. We come up with methodology of integration and utilization of a personal academic activity portal system interoperable with other services of KISTI, an open citation reference database automatically constructed by authors' activity and a journal evaluation system based on impact factor.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1163-1176
• /
• 2005

The Web is the largest distributed information space but, the individual's capacity to read and digest contents is essentially fixed. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent K-Pagesets. We extend a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. We add a WebPR(A) algorithm into a family of WebPR algorithms, and propose a new winWebPR(T) algorithm introducing a window concept on WebPR(T). Including two extended algorithms, our experimentation with two real data sets, including LadyAsiana and KBS media server site, clearly validates that our method outperforms conventional methods.

• Journal of Digital Convergence
• /
• v.12 no.10
• /
• pp.253-258
• /
• 2014

Recently, the development of cloud computing technology is developed as soon as smartphones is increases, and increased that users want to receive big data service. Hadoop framework of the big data service is provided to hadoop file system and hadoop mapreduce supported by data-intensive distributed applications. But, smpartphone service using hadoop system is a very vulnerable state to data authentication. In this paper, we propose a initial authentication protocol of hadoop system assisted by smartphone service. Proposed protocol is combine symmetric key cryptography techniques with ECC algorithm in order to support the secure multiple data processing systems. In particular, the proposed protocol to access the system by the user Hadoop when processing data, the initial authentication key and the symmetric key instead of the elliptic curve by using the public key-based security is improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.916-937
• /
• 2023

Most of the existing Distributed Denial-of-Service mitigation schemes in Software-Defined Networking are only implemented in the network domain managed by a single controller. In fact, the zombies for attackers to launch large-scale DDoS attacks are actually not in the same network domain. Therefore, abnormal traffic of DDoS attack will affect multiple paths and network domains. A single defense method is difficult to deal with large-scale DDoS attacks. The cooperative defense of multiple domains becomes an important means to effectively solve cross-domain DDoS attacks. We propose an efficient multi-domain DDoS cooperative defense mechanism by integrating blockchain and SDN architecture. It includes attack traceability, inter-domain information sharing and attack mitigation. In order to reduce the length of the marking path and shorten the traceability time, we propose an AS-level packet traceability method called ASPM. We propose an information sharing method across multiple domains based on blockchain and smart contract. It effectively solves the impact of DDoS illegal traffic on multiple domains. According to the traceability results, we designed a DDoS attack mitigation method by replacing the ACL list with the IP address black/gray list. The experimental results show that our ASPM traceability method requires less data packets, high traceability precision and low overhead. And blockchain-based inter-domain sharing scheme has low cost, high scalability and high security. Attack mitigation measures can prevent illegal data flow in a timely and efficient manner.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.3 no.2
• /
• pp.61-72
• /
• 2000

The maturation of the Web technology has reshaped the ways in which data are accessed, disseminated, and shared. Thanks to its popularity along with the advance of spatial information technology, four major changes have been further made in traditional geographic information systems (GIS) in relation to access to data, distribution of data, access to GIS functionality, and visualization of multimedia data. Although access to and dissemination of spatial data over the Web has in recent years been addressed in the literature, little research effort has addressed the issue of access to and processing of GIS analysis functions over the Web. This research explores the potential use of Web-based GIS in improving accessibility to distributed spatial data and spatial modeling tools. A prototype Web-based GIS developed in this study focuses on Web-based location-allocation modeling for spatial decision support, and employs a hybrid approach that uses the Arc/Info software as a GIS server and CGM viewer as a client-side plug-in. This research shows that Web-based GIS is a useful vehicle in conducting spatial modeling in the particular user community. In addition, this study represents the possibility of Web-based GIS in developing open spatial decision supporting systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2599-2613
• /
• 2015

Multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes, as it di-vides long codes into substrings and builds multiple hash tables. However, MIH is based on the dataset codes uniform distribution assumption, and will lose efficiency in dealing with non-uniformly distributed codes. Besides, there are lots of results sharing the same Hamming distance to a query, which makes the distance measure ambiguous. In this paper, we propose a data-oriented multi-index hashing method (DOMIH). We first compute the covariance ma-trix of bits and learn adaptive projection vector for each binary substring. Instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are near uniformly distributed. Then with covariance matrix, we propose a ranking method for the binary codes. By assigning different bit-level weights to different bits, the returned bina-ry codes are ranked at a finer-grained binary code level. Experiments conducted on reference large scale datasets show that compared to MIH the time performance of DOMIH can be improved by 36.9%-87.4%, and the search accuracy can be improved by 22.2%. To pinpoint the potential of DOMIH, we further use near-duplicate image retrieval as examples to show the applications and the good performance of our method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.195-204
• /
• 2010

Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.466-475
• /
• 2008

Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the transcoding load estimation algorithm is proposed for load balance on the distributed transcoding environments. The proposed algorithm estimates transcoding time from transcoding server information, movie information and target transcoding bit-rate. The estimated transcoding time is proved based on experiments.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.