• 대한방사선방어학회:학술대회논문집
• /
• 2011.04a
• /
• pp.182-183
• /
• 2011

• The KIPS Transactions:PartA
• /
• v.17A no.4
• /
• pp.167-172
• /
• 2010

This paper proposes a set of runtime test models for priority queues and shows the runtime test results based on the proposed test models for the representative priority queues: the traditional heap, post-order heap, and pairing heap. Among these heaps, the traditional heap is the worst in time complexity analyzed. But, according to our experimental results based on the test models proposed, it is shown that the slowest one is the pairing heap that utilizes pointers and the fastest one is the traditional heap. For the two implicit heaps, these results are in contrary to the fact that the post-order heap is better than the traditional heap in time complexity analyzed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1320-1326
• /
• 2017

Recently, IoT has been studying a lightweight protocol to satisfy device communication in a limited network environment. MQTT is a typical lightweight protocol. It supports small fixed headers to minimize overhead, and adopts publish/subscribe structure to guarantee real-time performance. However, MQTT does not support prioritization of important data and can not provide QoS in a specific IoT service. In this paper, we propose a message processing method to consider the priority of various IoT services in MQTT. In the proposed method, the priority flag is added to the fixed header of the MQTT in the node to transmit the message, and the broker confirms the priority of the corresponding message and processes it preferentially. Through experiment and evaluation, we confirmed the reduction of end-to-end delay between nodes according to priority.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1162-1171
• /
• 1998

This paper presents a data structure that implements a mergable double-ended priority queue : namely an improved relaxed min-max-pair heap. By means of this new data structure, we suggest a parallel algorithm to merge priority queues organized in two relaxed heaps of different sizes, n and k, respectively. This new data-structure eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [9]. As a result, employing max($2^{i-1}$,[(m+1/4)]) processors, this algorithm requires O(log(log(n/k))${\times}$log(n)) time. Also, on the MarPar machine, this method achieves a 35.205-fold speedup with 64 processors to merge 8 million data items which consist of two relaxed min-max heaps of different sizes.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.3
• /
• pp.87-96
• /
• 2007

Recently construction environment is being professionalized. oversized and diversified. Due to fluctuation of construction environment, the demand for the project of steel structure is ieased gradually and steel construction is needed the efficient quality management. The construction of steel structure which required a variety of sub-contractors, the progress of works and technologies are comprehensive of various risks and uncertain factors. But currently the construction of steel structure is conducted the risk management by perception and experience of constructors. Therefore, the analyzing factors of the risk and establishing the device are able to manage the quality management efficiently. In this study, we have conducted the interview of experts, polls and through the Analysis Hierarchy Process (AHP) for the scientific and systematic risk management. This paper will propose a plan for systematization of the construction of the steel structure.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.16 no.4 s.44
• /
• pp.357-369
• /
• 1992

The purpose of this study was to clarify the relationship between the Ideal Beauty of Body and the Form of Dress, and to analyze its historical perspectives. First of all, the concept of the Ideal Beauty of Body, the definition of Dress Form, and the method and system to clarify Dress Form were depicted. Based on this frame work, the Form of Dress related to the Ideal Beauty of Body was described historically. For this purpose, documentary research were conducted and representative photography and paintings were used. The analysis was limited to the female one-Piece dress from Ancient Egypt, Greece, Rome, Byzantine, Gothic, Renaissance, Baroque, Rococo, Naoclassicism, and to Romanticism. The results were as follows: 1. The Ideal Beauty of Body was found to be different throughout history and to be intimate- ly linked with fashionable dress. 2. The Form of Dress consisted of four basic components: The form of body itself, the form of clothing itself, the method of wearing, and the relationship between body and clothing. 3. The standards for classification of body form were body structure, body type, body proportion, posture, and movement. Clothing form was generally classified into flat type (unstructured type) and three dementional type (structured type); flat type was subclassified into draped type and tunic type. The method of wearing was classified into attached type, tying-up type, wrap·around type, pull-over type, open type and plastistic type. The relationship between body and clothing after wearing was generally classified into body priority type and clothing priority type. The clothing priority type was further divided into body exaggeration type and body concealment type; Body exaggeration type was further divided into upward type, downward type, forward type, backward type, right type and constriction type. 4. The pursuit of venus coelestis, metaphysical body part, ectomorphic body type, flat type clothing, body priority type; the pursuit of Venus Naturalis, physical body part, endomorphic body type, three dementional type clothing, clothing priority type proved to be closely related respectively by the historical study on the Ideal Beauty of Body and the Form of Dress.

• Macromolecular Research
• /
• v.11 no.5
• /
• pp.393-397
• /
• 2003

By applying a configurational-bias Gibbs ensemble Monte Carlo algorithm, priority simulation results regarding the conformation of non-dilute polyelectrolytes in solvents are obtained. Solutions of freely-jointed chains are considered, and a new method termed strandwise configurational-bias sampling is developed so as to effectively overcome a difficulty on the transfer of polymer chains. The structure factors of polyelectrolytes in the bulk as well as in the confined space are estimated with variations of the polymer charge density.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.70-80
• /
• 1999

In this paper, a new hierarchical image segmentation algorithm based on human visual system(HVS) characteristic is proposed which can efficiently reduce and control transmission information quantity without the degradation of the subjective and objective image quality. It consists of image segmentation based on mathematical morphology and region merging considering HVS characteristic for the pairs of two adjacent regions at each level of the hierarchy. Image segmentation is composed of 3-level hierarchical structure. In the region merging structure of each level, we extract the pairs of two adjacent regions which human vision can't discriminate, and then merge them. The proposed region merging method extracts pairs of two neighbor regions to be merged and performs region merging according to merging priority based on HVS characteristics. The merging priority for each adjacent pair is determined by the proposed merging priority function(MPF). First of all, the highest priority pair is merged. The information control factor is used to regulate the transmission information at each level. The proposed segmentation algorithm can efficiently improve bottleneck problem caused by excessive contour information at region-based very low bit rate coding. And it shows that it is more flexible structure than that of conventional method. In experimental results, though PSNR and the subjective image quality by the proposed algorithm is similar to that of conventional method, the contour information quantity to be transmitted is reduced considerably. Therefore it is an efficient image segmentation algorithm for region-based very low bit rate coding.

• Journal of the Korean Applied Science and Technology
• /
• v.37 no.5
• /
• pp.1409-1417
• /
• 2020

The purpose is to increase the likelihood of physical education students for employment in public institutions by examining the priority for hiring sports-related public institutions. The subject of the study was purposeful sampling of a total of 11 persons including 4 sports professors, 3 NCS experts in sports field, 2 judges from public sports institutions, and 2 personnel in charge of hiring public institutions. Through this process, from January 3 to March 12, 2020, the importance of priority was analyzed using hierarchical structure analysis using the main factors of NCS vocational basic competency. All data are coded so that statistical processing can be performed. Using SPSS/PC (ver. 21.0) for Windows, the hierarchical structure analysis was used for frequency analysis and priority determination. First, communication skills (.231), organizational comprehension skills (.177), resource management skills (.128), interpersonal skills (.110), vocational ethics (.082), problems in the major areas of recruitment of sports-related public institutions Solving ability (.061), information ability (.056), mathematical ability (.054), self-development ability (.052), and description ability (.049) were analyzed in order. Second, in terms of evaluation items, communication is communication skills (.442), mathematical skills are basic computation skills (.512), problem solving skills are thinking skills (.722), self-development skills are self-management skills (.587), Resource management ability was analyzed in order of time management ability (.531), interpersonal relationship ability as teamwork ability (.382), information ability in computer use ability (.677), technical ability in technology understanding ability (.599).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.31-39
• /
• 1982

This paper presents an efficient algorithm both in computation speed and storage requirement by exploring the special structure of problems involving multiple objective goals. The algorithm developed here is limited to the problems with multiple, compensatory objectives, however it can be extended to‘traditional’preemptive priority goat programming problems. Computational results are included.