• Journal of Korea Multimedia Society
• /
• v.3 no.5
• /
• pp.479-494
• /
• 2000

Although the proliferation of real-time multimedia services over the Internet might indicate its successfulness in dealing with heterogeneous environments, it is obvious, on the other hand, that the internet now has to cope with a flood of multimedia data which consumes most of network communication channels due to a great deal of video or audio streams. Therefore, for the purpose of an efficient and appropriate utilization of network resources, it requires to develop and deploy a new scalable transmission technique n consideration of respective network environment and individual clients computing power. Also, we can eliminate the waste effects of storage device and data transmission overhead in that the same video stream duplicated according to QoS. The purpose of this paper is to develop a technology that can adjust the amount of data transmitted as an MPEG video stream according to its given communication bandwidth, and technique that can reflect dynamic bandwidth while playing a video stream. For this purpose, we introduce a media scalable media decomposer working on server side, and a scalable media composer working o n a client side, and then propose a scalable transmission method and a media sender and a media receiver in consideration of dynamic QoS. Those methods proposed her can facilitate an effective use of network resources, and provide multimedia MPEG video services in real-time with respect to individual client computing environment.

• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1165-1174
• /
• 2011

In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.3
• /
• pp.469-477
• /
• 2017

Cloud computing is an IT resource providing technology to various users by using virtualization technology. Newly updated spatial information may not be used by other organizations since management authorities are dispersed for Korean public spatial information. Further, the national budget is wasted since each organization independently implements renewable GIS analysis function. These problems can be solved by applying cloud service. However, research related to the application of cloud service to Korea spatial information system has been proposed in the technology development direction, and no detailed development plan has been proposed. In this paper, we deal with the establishment of a technology development plan for national spatial information infrastructure cloud service. First, we deduct the implication to derive the technology development goals by analyzing the political and technical environment. Second, technology and critical technology elements are derived to achieve the goals of the specialist's analysis based on the evaluation elements. As a result, thirteen critical technology elements are derived. Finally, thirty-one research activities, which comprise the critical technology elements, are defined. Critical technology elements and research activities derived in this research will be used for the generation of a technology development road-map.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.208-213
• /
• 2016

In the fourth industrial revolution, customization is becoming a conversation topic in various domains. Industry 4.0 applies cyber-physical systems (CPS), the Internet of Things (IoT), and cloud computing to manufacturing businesses. One of the main phrases in Industry 4.0 is mass customization. Optimized products or services are developed and provided through customization. Therefore, the competitiveness of a product can be enhanced, and satisfaction is improved. In particular, as IoT technology spreads, customization is an essential aspect of smooth service connections between various devices or things. Customized services in mobile applications are assembled and operate in various mobile devices in the mobile environment. Therefore, this paper proposes a method for improving customized cloud server-based mobile architectures, processes, and metrics, and for measuring the performance improvement of the customized architectures operating in various mobile devices based on the Android or IOS platforms. We reduce the total time required for customization in half as a result of applying the proposed customized architectures, processes, and metrics in various devices.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.81-92
• /
• 2011

There has been a number of attempts to apply 3D CAD data created in the design stage of product life cycle to various applications of the other stages in related industries. But, 3D CAD data requires a large amount of computing resources for data processing, and it is not suitable for post applications such as distributed collaboration, marketing tool, or Interactive Electronic Technical Manual because of the design information security problem and the license cost. Therefore, various lightweight visualization formats and application systems have been suggested to overcome these problems. However, most of these lightweight formats are dependent on the companies or organizations which suggested them and cannot be shared with each other. In addition, product structure information is not represented along with the product geometric information. In this paper, we define a dataset called prod-X3D(Enhanced X3D Dataset for Web-based Visualization of 3D CAD Product Model) based on the international standard graphic format, X3D, which can represent the structure information as well as the geometry information of a product, and propose a translation method from 3D CAD data to an prod-X3D.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Information Systems Review
• /
• v.8 no.2
• /
• pp.29-49
• /
• 2006

The introduction of the Digital Economy has formed a new market producing and trading information. Depending on the current contexts, each user evaluates identical information differently. It is difficult, even though important, to create and deliver the information customized to individual users by using some factors as time, location, and their personal characteristics. Information value, therefore, could be influenced by the capability of information systems to delivery useful information based on individual contexts to the right user immediately at the right time. From this point of view, we argue mobile systems which are able to be aware of individual contexts and deliver contextual information in real time can improve information value easily than other systems can. This research presents the results of an empirical test about antecedents to mobile advertising value. Though context relevance doesn't influence directly mobile advertising value, it plays an important role enhancing information usefulness which has great influence on mobile advertising value. Moreover, to supply information connected with users' context overcomes the effect of irritation. Lastly, entertainment can improve mobile advertising value as satisfying user's hedonic desire beyond the information source supporting decision making.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.1
• /
• pp.63-76
• /
• 2001

As reusability becomes recognized more importantly, with the introduction of ObjectOriented Programming Languages, developers not only want to reduce development duration, but also to develop a proper system robustly and safely by renovating the Hot Spot in order to reuse the existing framework. When we perform these works, we need the development environment which is the Rapid Application Development tool, and the RAD tools provide us with the convenient development environment. The need of RAD tools is recognized by every Object-Oriented programmer, and many business enterprises are developing them. In this paper, we will present a design and implementation of module-based modeler as a method for developing technique to constmct user-driven Intranet environment for the generation of the program based on the framework. The framework modeler used Java language that is independent on platform, and applied the technique of OMT editor that provides the UML notation partially. Additionally, The modeler also includes the notations that are not supported in OMT editor. In addition to this characteristic, it is structured to develop system consistently with applying the Agent pattern, which is a design pattern suggested by ourselves, to send messages occurred between various Views. The existing MVC(Model-View-Controller) architecture does not have this function. Thus, this tool has a flexibility when user's requirements are changed, or functions are extended.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.154-159
• /
• 2015

Over the past few years, user needs in the smartphone application market have been shifted from diversity toward intelligence. Here, we propose a novel cognitive agent that plans the daily routines of users using the lifelog data collected by the smart phones of individuals. The proposed method first employs DPGMM (Dirichlet Process Gaussian Mixture Model) to automatically extract the users' POI (Point of Interest) from the lifelog data. After extraction, the POI and other meaningful features such as GPS, the user's activity label extracted from the log data is then used to learn the patterns of the user's daily routine by POMDP (Partially Observable Markov Decision Process). To determine the significant patterns within the user's time dependent patterns, collaboration was made with the SNS application Foursquare to record the locations visited by the user and the activities that the user had performed. The method was evaluated by predicting the daily routine of seven users with 3300 feedback data. Experimental results showed that daily routine scheduling can be established after seven days of lifelogged data and feedback data have been collected, demonstrating the potential of the new method of place-time-activity coupled daily routine planning systems in the intelligence application market.