• Journal of Korea Multimedia Society
• /
• v.17 no.6
• /
• pp.671-680
• /
• 2014

Recently, with the remarkable increase of social network services, it is necessary to extract interesting information from lots of data about various individual opinions and preferences on SNS(Social Network Service). The sentiment information can be applied to various fields of society such as politics, public opinions, economics, personal services and entertainments. To extract sentiment information, it is necessary to use processing techniques that store a large amount of SNS data, extract meaningful data from them, and search the sentiment information. This paper proposes an efficient method to extract sentiment information from various unstructured big data on social networks using HDFS(Hadoop Distributed File System) platform and MapReduce functions. In experiments, the proposed method collects and stacks data steadily as the number of data is increased. When the proposed functions are applied to sentiment analysis, the system keeps load balancing and the analysis results are very close to the results of manual work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1302-1320
• /
• 2015

In cloud, everything can be provided as a service wherein a large number of users submit their jobs and wait for their services. hus, scheduling plays major role for providing the resources efficiently to the submitted jobs. The brainwave of the proposed ork is to improve user satisfaction, to balance the load efficiently and to bolster the resource utilization. Hence, this paper roposes an Adaptive Multilevel Scheduling System (AMSS) which will process the jobs in a multileveled fashion. The first level ontains Preprocessing Jobs with Multi-Criteria (PJMC) which will preprocess the jobs to elevate the user satisfaction and to itigate the jobs violation. In the second level, a Deadline Based Dynamic Priority Scheduler (DBDPS) is proposed which will ynamically prioritize the jobs for evading starvation. At the third level, Contest Mapping Jobs with Virtual Machine (CMJVM) is roposed that will map the job to suitable Virtual Machine (VM). In the last level, VM Scheduler is introduced in the two-tier VM rchitecture that will efficiently schedule the jobs and increase the resource utilization. These contributions will mitigate job iolations, avoid starvation, increase throughput and maximize resource utilization. Experimental results show that the performance f AMSS is better than other algorithms.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.7
• /
• pp.642-649
• /
• 2012

This paper deals with a copper die casting induction motor which has several advantages of motor performance. The developed motor is used as spindle motor in machining center. The dynamic characteristic analysis of rotor is dealt with for precision machining. The critical speed of rotor considering rotation and gyroscopic effect should be above operating speed, 18,000 rpm, and have a 201 % sufficient separation margin. Also, the 3-D unbalance vibration response analysis is performed and enabled the prediction of the expected vibration amplitude by unbalance in high speed. The unbalance vibration responses of each position on the rotor are satisfied with allowable vibration displacement of API 611 standard according to balancing G grade(G 0.4, G 2.5, G 6.3). Copper die casting high speed induction motor is successfully developed and verified by experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.10 no.5
• /
• pp.281-296
• /
• 2015

This paper describes a novel disaster evacuation system using embedded systems such as smart devices for crisis and emergency management. In indoor environments deployed with the Bluetooth Low Energy(BLE) beacons, smart devices detect their indoor positions from beacon messages and interact with Map Server(MS) and Route Server(RS) in the Internet over the LTE and/or Wi-Fi functions. The MS and RS generate an optimal path to the nearest emergency exit based on a novel graph generation method for less route computation, called the Disaster Evacuation Graph(DEG), for each smart device. The DEG also enables efficient processing of some constraints in the computation of route, such as load balancing in situation of different capacities of paths or exits. All data interfaces among three system components, the MS, RS, smart devices, have been defined for modular implementation of our disaster evacuation system. Our experimental system has been deployed and tested in our building thoroughly and gives a good evidence that the modular design of the system and a novel approach to compute emergency route based on the DEG is competitive and viable.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.135-139
• /
• 2007

Recently Data Centric Storage (DCS) schemes are variously studied for several applications (e.g. natural environment investigation, military application systems and environmental changes monitoring). In DCS scheme, data is stored at nodes within the network by name. There are several drawbacks in the existing schemes. The first is the inefficiency of the range query processing on not considered the locality of store point. the second is the non-homogeneity of store load of each sensors in case of the sensor distribution density is non-uniformed. In this paper, we propose a novel data centric storage scheme with the sensor distribution density which satisfied with the locality of data store location. This scheme divides whole sensor network area using grid and distributes the density bit map witch consist of the sensor density information of each cell. sensors use the density bit map for storing and searching the data. We evaluate our scheme with existing schemes. As a result, we show improved load balancing and more efficient range query processing than existing schemes in environment which sensors are distributed non-uniform.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.13-20
• /
• 2017

A message processor is server software that receives various message formats from clients, creates the corresponding threads to process them, and lastly delivers the results to the destination. Considering that each function of an SEDA-based message processor has its own characteristics such as CPU-bound or IO-bound, this paper proposes a thread-mapping strategy called "FC-TM" (function-characteristic aware thread mapping) that schedules the threads to the cores based on the function characteristics in multi-core environments. This paper assumes that message-processor functions are static in the sense that they are pre-defined when the message processor is built; therefore, we profile each function in advance and map each thread to a core using the information in order to maximize the throughput. The benchmarking results show that the throughput increased by up to a maximum of 72 % compared with the previous studies when the ratio of the IO-bound functions to the CPU-bound functions exceeds a certain percentage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.501-509
• /
• 2011

In this paper, we offer a new strategic Portfolio Model for national IT R&D project selection in Korea. A risk and return (R-R) Portfolio Model was developed using an objectively quantified index on the two axes of risk and return, in order to select a strategic project and allocate resources in compliance with a national IT R&D strategy. We strategize using the R-R Portfolio Model to solve the non-strategy and subjectivity problems of the existing national R&D project selection Model. We also use the quantified evaluation index of the IT technology road map (TRM) and the technology level Survey (TLS) for the subjectivity of project selection, and try to discover the weights using the analytic hierarchy process (AHP). In addition, we intend to maximize the chance for a successful national IT R&D project, by selecting a strategic Portfolio project and balancing the allocation of resources effectively and objectively.

• Journal of Korea Game Society
• /
• v.13 no.2
• /
• pp.39-48
• /
• 2013

In MMORPGs(Massively Multi-player Online Role-Playing Games) a large number of players actively interact with one another in a virtual world. Therefore MMORGs must be able to quickly process real-time access requests and process requests from numerous gaming users. A key challenge is that the workload of the game server increases as the number of gaming users increases. To address this workload problem, many developers apply with distributed server architectures which use dynamic map partitioning and load balancing according to the server function. Therefore most MMORPG servers partition a virtual world into zones and each zone runs on multiple game servers. These methods cause of players frequently move between game servers, which imposes high overhead for data updates. In this paper, we propose a new architecture that apply with an arithmetic server dedicated to data operation. This architecture enables the existing game servers to process more access and job requests by reducing the load. Through mathematical modeling and experimental results, we show that our scheme yields higher efficiency than the existing ones.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.9
• /
• pp.223-228
• /
• 2016

Nowadays users of Virtual Environment are want to play with thousands of players in an evolving virtual world at the same time over the internet. So, the load of this kind of Virtual Environments is heavier than that of any other precedents. One of load balancing methods is map-partition to divide the load of entire system which is vulnerable to delay message between clients and servers. In this paper, we propose a Migration Agent application server architecture using to help migration of player character between field servers and to reduce response time between clients and field servers. Migration Agent is reduce Player Character's responds time as Cache Server, if Player Character move to another Field Server, Player Character need the synchronization process in the DBMS approach, to minimize response time by reducing the period for cross - Player Character Field Server to perform the role. Field Server by placing them in form of a stack existing form of grid, for load concentrated on a specific server.