• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

• Journal of Korea Spatial Information System Society
• /
• v.3 no.1 s.5
• /
• pp.49-62
• /
• 2001

Recently, component-based software has become main trends in designing and developing computer software products. This component-based software has advantage of the interoperability on distributed computing environment and the reusability of pre-developed components. Also, GIS is designed and implemented with this component-based methodology, called Open GIS Component. OGC(OpenGIS Consortium) have announced various implementation and design specification and topic in GIS. In GIS, Spatial analysis functions like network analysis, TIN analysis are very important function and basically, estimate system functionality and performance using this analysis methods. The simple feature geometry specification is announced by OGC to increase the full interoperability of various spatial data. This specification includes just geometry spatial data model. However, in GIS which manages spatial data, not only geometric data but also topological data and various analysis functions have been used. The performance of GIS depends on how this geometric and topological data is managed well and how various spatial analyses are executed efficiently. So it requires integrated spatial data model between geometry and topology and extended data model of topology for spatial analysis, in case network analysis and TIN analysis in open GIS component. In this paper, we design analysis component like network analysis component and TIN analysis component. To manage topological information for spatial analysis in open GIS component, we design extended data model of simple feature geometry for spatial analysis. In addition to, we design the overall system architecture of open GIS component contained this topology model for spatial analysis.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.1-12
• /
• 2003

Recently, many researches into distributed processing on Internet, and multimedia data processing have been performed. Rapid and convenient multimedia services supplied with high quality and high speed are to be needed. In this paper, we design and implement clip-based video retrieval system on the Web enviroment in real-time. Our system consists of the content-based indexing system supporting convenient services for video content providers, and the Web-based retrieval system in order to make it easy and various information retrieval for users in the Web. Three important methods are used in the content-based indexing system, key frame extracting method by dividing video data, clip file creation method by clustering related information, and video database construction method by using clip unit. In Web-based retrieval system, retrieval method ny using a key word, two dimension browsing method of key frame, and real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time retrieval for video clips on Web environment and provides the multimedia service in stability. The proposed methods show a usefulness of video content providing, and provide an easy method for serching intented video content.

• Archives of design research
• /
• v.11 no.1
• /
• pp.161-172
• /
• 1998

The evolution of computing environments caused various dharges in our society. The change cj instruction media is one of these effects. WWW using network techndogy is regarded as a pov.powerful tool for rerrote instruction. The methods of utilizing network technologies in design instrudion and design process rould be diversified comparing with those of other general instruction. Computer graphics has been regarded as a very use!u design tool for its accuracy and rapidty. Network can help us to do creative work using cornplter graphics. The merits of this technology are sharing resources and rraking it easy to roIlaborate. Recent cxxnputer graphics instruction has some defects in oontents and methods. The oontents have a weak relationship with other industrial design subjects. From above, the purpose of this thesis is to use computer graphics and netv.urk technology for supporting basic design instruction. Virtual gallery using WWW can be a cyberspare v.tlere the evaluation of results and the exchange of information take plare. This tool makes it easier to oomrunicate and oollaborate with dassmates. A casestudy-Composition with basic objectswas exea.rted by individual for distributed asynchronous rmde. The results of this thesis are summarized for four factors. Rrst, it was easy to transform idea. Serond, student-oriented working was performed. Third, interaction among students was activated. Fourth, not only final results, but also midterm results was oonsidered for evaluation. These methods also have problems as rerent instruction methods, but it rould be used as a instruction tool to compensate for existing instruction methods.

• Water for future
• /
• v.21 no.4
• /
• pp.399-406
• /
• 1988

Presented in this paper is a brief summary of the basic theory and observation from a laboratory investigation aimed at determining flow characteristics and ice jam topography in a sinuous channel, and in a single-bend channel. The sinuous channel comprised thirteen $90^{\circ}$ bends and was of comparatively small s\aspect ratio. The single-bend channel was a $180^{\circ}$ bend, which was an order of magnitude large in width as well as aspect ratios than the sinuous channel. The simulated ices were polyethylene and polypropylene beads and block. The streamwise velocities near the bottom were larger than that of surface in sinuous channel and forming ice jam in sinuous channel, this phenoumena were found strongly. Jams were generally thicker along the inner bank of bends. The path of maximum-streamwise velocity was displaced towards approachs side of the inner bank of bends. Radial variation of jam thickness was to be regular by increasing size of ice fragments. The rate of jam head progression around outer bank of the single bend was faster than that of inner bank and its velocity was roughly steady. With increasing Froude number, jm thickness became less uniformly distributed; being generally thicker along the inner bank and near the jam's toe. Two-layer model might be adaptable for the computing the streamwise velocity in shallow river bends. Two cells of secondary flow cound be expected in ice covered-river bends.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.6
• /
• pp.60-68
• /
• 2015

Recent proliferation of advanced technologies such as wireless communication, mobile, sensor technology and so on has caused significant changes in a traffic environment. Human beings, in particular drivers, as well as roads and vehicles were advanced on information, intelligence and automation thanks to those advanced technologies; Intelligent Transport Systems (ITS) and autonomous vehicles are the results of changes in a traffic environment. This study proposed considerations when designing a simulation model for future transportation environments, which are difficult to predict the change by means of advanced technologies. First of all, approximability, flexibility and scalability were defined as a macroscopic concept for a simulation model design. For actual similarity, calibration is one of the most important steps in simulation, and Physical layer and MAC layer should be considered for the implementation of the communication characteristics. Interface, such as API, for inserting the additional models of future traffic environments should be considered. A flexible design based on compatibility is more important rather than a massive structure with inherent many functions. Distributed computing with optimized H/W and S/W together is required for experimental scale. The results of this study are expected to be used to the design of future traffic simulation.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.263-272
• /
• 2009

For implementing the ubiquitous computing environments with smart home infrastructures, various research on the home network have been performed by several research institutes and companies. Due to the various home network middleware that are developed recently, the standardization of the home network middleware is being delayed and it calls for the middleware bridge which solves the interoperability problem among the heterogeneous middlewares. Now the research on the scheme for interoperability and the development of the various bridges are in progress, such as one-to-one bridge supporting interoperability between two middlewares and one-to-many bridge supporting interoperability among the multi-middlewares. However, existing systems and schemes does not consider the dynamic extensibility and performance that is particularly needed in the smart home environments. The middleware bridge should provide bridge extensibility with zero-configuration for non-expert users. It should also provide the load balancing scheme for efficient and proper traffic distribution. In this paper, we propose a Multi-Middleware Bridge(MMB) for dynamic extensibility and load balancing in home network environments. MMB provides bridge scalability and load balancing through the distributed system structure. We also verify the features such as interoperability, bridge extensibility, and the performance of the load balancing algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.10
• /
• pp.1277-1286
• /
• 2018

In this paper, we provide flexible scalability of computing resources in cloud environment and Apache Hadoop based cloud environment for analysis of public medical information big data. In fact, it includes the ability to quickly and flexibly extend storage, memory, and other resources in a situation where log data accumulates or grows over time. In addition, when real-time analysis of accumulated unstructured log data is required, the system adopts Hadoop-based analysis module to overcome the processing limit of existing analysis tools. Therefore, it provides a function to perform parallel distributed processing of a large amount of log data quickly and reliably. Perform frequency analysis and chi-square test for big data analysis. In addition, multivariate logistic regression analysis of significance level 0.05 and multivariate logistic regression analysis of meaningful variables (p<0.05) were performed. Multivariate logistic regression analysis was performed for each model 3.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.631-640
• /
• 2003

Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.