• Korean Institute of Interior Design Journal
• /
• v.20 no.1
• /
• pp.128-137
• /
• 2011

This study aims to examine each space characteristics of unit plans for brand apartments. Through construction companies' web-sites and real estate web-sites, all the apartment unit plans with $66m^2{\sim}164m^2$ unit among the brand apartments were analyzed. On the analysis of the apartment unit plans($66m^2{\sim}164m^2$) provided by top 8 construction companies from March 2004 to December 2008. The remarkable changes compared to existing apartments include an increase in the number of bays; front side allocation of bedrooms beside the main bedroom; installation of a vestibule, a dressing room, and a powder room; installation of built-in closets in bedrooms beside the main bedroom; and installation of a receipt spot on the sidewall in the balcony. Besides, as for minor opinions there were opinions of front side allocation of kitchen/dining room, back side allocation of the main bedroom, and installation of dressing room in bedrooms beside the main bedroom. Therefore, construction companies should pay attention to research result about the unit area ranges of apartment unit plans, and reflect it positively to develop apartment unit plans to satisfy consumers.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.130-135
• /
• 2001

When a networked virtual reality system handles composite media audio and video as well as three dimensional computer graphics, the quality of the virtual space is greatly affected by the current available network, and end system resources. Even if the network can preserve a certain amount of resources, the required resources change dynamically according to the user\`s navigation of a large virtual space, and then it may decrease the quality of the virtual space. In this paper, a method for resource allocation is proposed and the proposed system copes with the deterioration of quality of virtual spaces in case that the starvation of system resources occurs. The experimental results show that the proposed method is efficient.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.442-450
• /
• 2005

One of the important tactical problems for the efficient operation of container terminals is to determine the usage of storage space There are two different strategies for stacking containers; mixing strategy. in which outbound containers and inbound containers are mixed in the same block. and segregating strategy, in which outbound containers and inbound containers are stacked in blocks different from each other. The performance of space allocation strategies also depends on the types of handling equipment in the yard and the number of handling equipment allocated to each block. A simulation model is developed considering various handling characteristics of yard cranes. Performances of various space and equipment allocation strategies are evaluated by using the simulation model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.55-67
• /
• 2005

Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and mapping. In this paper we present an iterative two-step exploration methodology for bus-based on-chip communication architecture and memory allocation, assuming that memory traces from the processing elements are given from the mapping stage. The proposed method uses a static performance estimation technique to reduce the large design space drastically and quickly, and applies a trace-driven simulation technique to the reduced set of design candidates for accurate Performance estimation. Since local memory traffics as well as shared memory traffics are involved in bus contention, memory allocation is considered as an important axis of the design space in our technique. The viability and efficiency of the proposed methodology arc validated by two real -life examples, 4-channel digital video recorder (DVR) and an equalizer for OFDM DVB-T receiver.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.626-633
• /
• 2006

The wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Sensor operating systems that run on tiny sensor nodes are the key to the performance of the distributed computing environment for the wireless sensor networks. Therefore, sensor operating systems should be able to operate efficiently in terms of energy consumption and resource management. In this paper, we present an efficient memory allocation scheme to improve the time and space efficiency of memory management for the sensor operating systems. Our experimental results show that the proposed scheme performs efficiently in both time and space compared with existing memory allocation mechanisms.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.63-70
• /
• 2004

Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation.. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look for solutions, use tabu search to optimize them, and design optimized the berth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocation.

• Journal of the Korean Institute of Educational Facilities
• /
• v.21 no.3
• /
• pp.3-10
• /
• 2014

A study of facility securement and space utilization at national universities in Korea was conducted in order to help develop an efficient model for space management at national universities going forward. For the study, 36 national universities were asked to submit answers to a questionnaire on usage of campus facilities in 2013. We then analyzed the results of space management for the 27 universities that participated in the questionnaire in each of the past three years (2011-2013). Lastly, we conducted an awareness test on the space utilization policies and space management for these universities. The results are as follows. First, the aggregate average score for space utilization over the past three years is 74.06. The annual average score increased year-over-year and then decreased; it was 69.44 in 2011, 80.68 in 2012, and 72.05 in 2013. A decline in the sense of responsibility of universities to effectively manage space appears to be a factor in the decrease. Second, with 53% of respondents in agreement, treatment of campus area as private space appears to be the biggest hurdle for efficient space management. As such, a plan to foster a more communal view of campus facility area is required. Third, resistance from constituents to existing guidelines for space allocation on campuses appears to be limited (78.1% of respondents answered the guidelines currently in place were average, satisfactory, or very satisfactory). We believe this result points to a mutual understanding forming amongst constituents regarding guidelines on space allocation on campus.results of satisfaction research: the users are generally satisfied with education and student.

• Journal of Korean Port Research
• /
• v.11 no.2
• /
• pp.191-202
• /
• 1997

As the suitability of berth allocation will ultimately have a significant influence on the performance of a berth, a great deal of attention should be given to berth allocation. Generally, a berth allocation problem has conflicting factors between servers and users. In addition, there is uncertainty in great extent caused by various factors such as departure delay, inclement weather on route, poor handling equipment, a lack of storage space, and other factors contribute to the uncertainty of arrival and berthing time. Thus, it is necessary to establish berth allocation planning which reflects the positions of interested parties and the ambiguity of parameters. For this, a berth allocation problem is formulated by fuzzy 0-1 integer programming introducing the concept of maximum Position Shift(MPS). But, the above approach has limitations in terms of computational time and computer memory when the size of problem is increased. It also has limitations with respect to the integration of other sub-systems such as ship planning system and yard planning system. For solving such problem, this paper focuses particularly on developing an efficient heuristic algorithm as a new technique of getting an effective solution. And also the suggested algorithm is verified through the illustrative examples and empirical appalicaton to BCTOC.

• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.31-48
• /
• 2023

The popularization of smart devices and subsequent optimization of their sensing capacity has resulted in a novel mobile crowdsensing (MCS) pattern, which employs smart devices as sensing nodes by recruiting users to develop a sensing network for multiple-task performance. This technique has garnered much scholarly interest in terms of sensing range, cost, and integration. The MCS is prevalent in various fields, including environmental monitoring, noise monitoring, and road monitoring. A complete MCS life cycle entails task allocation, data collection, and data aggregation. Regardless, specific drawbacks remain unresolved in this study despite extensive research on this life cycle. This article mainly summarizes single-task, multi-task allocation, and space-time multi-task allocation at the task allocation stage. Meanwhile, the quality, safety, and efficiency of data collection are discussed at the data collection stage. Edge computing, which provides a novel development idea to derive data from the MCS system, is also highlighted. Furthermore, data aggregation security and quality are summarized at the data aggregation stage. The novel development of multi-modal data aggregation is also outlined following the diversity of data obtained from MCS. Overall, this article summarizes the three aspects of the MCS life cycle, analyzes the issues underlying this study, and offers developmental directions for future scholars' reference.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.6
• /
• pp.1638-1658
• /
• 2024

As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite association-based resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks.