• Title/Summary/Keyword: searching system

Search Result 1,951, Processing Time 0.035 seconds

A Data Taxonomy Methodology based on Their Origin (데이터 본질 기반의 데이터 분류 방법론)

  • Choi, Mi-Young;Moon, Chang-Joo;Baik, Doo-Kwon;Kwon, Ju-Hum;Lee, Young-Moo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.2
    • /
    • pp.163-176
    • /
    • 2010
  • The representative method to efficiently manage the organization's data is to avoid data duplication through the promotion of sharing and reusing existing data. The systematic structuring of existing data and efficient searching should be supported in order to promote the sharing and reusing of data. Without regard for these points, the data for the system development would be duplicated, which would deteriorate the quality of the data. Data taxonomy provides some methods that can enable the needed data elements to be searched quickly with a systematic order of managing data. This paper proposes that the Origin data taxonomy method can best maximize data sharing, reusing, and consolidation, and it can be used for Meta Data Registry (MDR) and Semantic Web efficiently. The Origin data taxonomy method constructs the data taxonomy structure built upon the intrinsic nature of data, so it can classify the data with independence from business classification. Also, it shows a deployment method for data elements used in various areas according to the Origin data taxonomy structure with a data taxonomic procedure that supports the proposed taxonomy. Based on this case study, the proposed data taxonomy and taxonomic procedure can be applied to real world data efficiently.

Improving Haskell GC-Tuning Time Using Divide-and-Conquer (분할 정복법을 이용한 Haskell GC 조정 시간 개선)

  • An, Hyungjun;Kim, Hwamok;Liu, Xiao;Kim, Yeoneo;Byun, Sugwoo;Woo, Gyun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.9
    • /
    • pp.377-384
    • /
    • 2017
  • The performance improvement of a single core processor has reached its limit since the circuit density cannot be increased any longer due to overheating. Therefore, the multicore and manycore architectures have emerged as viable approaches and parallel programming becomes more important. Haskell, a purely functional language, is getting popular in this situation since it naturally supports parallel programming owing to its beneficial features including the implicit parallelism in evaluating expressions and the monadic tools supporting parallel constructs. However, the performance of Haskell parallel programs is strongly influenced by the performance of the run-time system including the garbage collector. Though a memory profiling tool namely GC-tune has been suggested, we need a more systematic way to use this tool. Since GC-tune finds the optimal memory size by executing the target program with all the different possible GC options, the GC-tuning time takes too long. This paper suggests a basic divide-and-conquer method to reduce the number of GC-tune executions by reducing the search area by one-quarter for every searching step. Applying this method to two parallel programs, a maximally independent set and a K-means programs, the memory tuning time is reduced by 7.78 times with accuracy 98% on average.

A Study on International Comparison and Analysis of Health Education Contents in Elementary Schools(based on Korea, USA, and Japan) (초등학교 보건교육내용의 국제비교분석(한국, 미국, 일본을 중심으로))

  • Lee, Soon-Young;Park, Young-Soo
    • The Journal of Korean Society for School & Community Health Education
    • /
    • v.2 no.2
    • /
    • pp.57-78
    • /
    • 2001
  • The purpose of this study is to analyze hygiene education contents of elementary schools in Korea, USA, Japan and compare this and to provide with basic material present improvement method when hygiene education contents of elementary schools in Korea are organized. For this purpose the problems as following are selected centering on the hygiene education contents of the 7th education process in Korea and Japan and the hygiene text of public school in California, USA. First, this study tries to analyze the composition classified by 12 guidance contents each grade of hygiene education contents of elementary schools in Korea, USA, and Japan. Second, this study tries to analyze the composition classified by fields(physical, mental, social) of hygiene education contents of elementary schools in Korea, USA, and japan. As a result of the analysis and comparison on the matters stated above, the conclusion as following was gotten. First, as a result of searching the hygiene education contents system of elementary schools in Korea, USA, and Japan classified by 12 guidance contents each grade, the subjects which have good contents composition classified by class step by step were safe life and disease prevention. And the subjects such as growth development and health, physical fitness, drug use and health were weak and the parts such as consumer health and the careers concerned with are not dealt in the present education process of Korea at all. Second, as a result of analyzing the composition classified by fields of hygiene education contents of elementary schools in Korea, USA, Japan, all the three countries put great on physical part. And there are 57 units about mental part in USA, 27 units in Japan, only 17 units in Korea. And this fact reveals that there was lack of understanding about the need of mental part in Korea. This study tries to suggest improvement method as following through the study results stated above. First, as it is grasped in the analysis classified by guidance part of hygiene education contents, community and environment preservation, physical aptitude and stress management are to be emphasized more strongly and about the parts like consumer health and the persons concerned with hygiene new education programs as contents satisfying the need of age are to be inserted or complemented Second, because the hygiene education contents in Korea are still lack in comparing contents of mental parts compared with those of the two countries, the contents proper to the level and the requirement of learners to each grade are to be developed and complemented. Third, hygiene education units which were reduced in the 7th curriculum in Korea are lack compared with those in the two countries. Therefore, it is necessary that teachers should recognize the need of hygiene education so that the hygiene education can be separated and be taught out regularly.

  • PDF

GA-Based Optimal Design for Vibration Control of Adjacent Structures with Linear Viscous Damping System (선형 점성 감쇠기가 장착된 인접구조물의 진동제어를 위한 유전자 알고리즘 기반 최적설계)

  • Ok, Seung-Yong;Kim, Dong-Seok;Koh, Hyun-Moo;Park, Kwan-Soon
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.11 no.1 s.53
    • /
    • pp.11-19
    • /
    • 2007
  • This paper proposes an optimal design method of distribution and capacities of linear viscous dampers for vibration control of two adjacent buildings. The previous researches have dealt with suboptimal design problem under the assumption that linear viscous dampers are distributed uniformly or proportionally to the sensitivity of the modal damping ratio according to floors, whereas this study deals with global optimization problem in which the damping capacities of each floor are independently selected as design parameters. For this purpose, genetic algorithm to effectively search multiple design variables in large searching domains is adopted and objective function leading to the global optimal solutions is established through the comparison of several optimal design values obtained from different objective functions with control performance and damping capacity. The effectiveness of the proposed method is investigated by comparing the control performance and total damping capacity designed by the proposed method with those of the previous method. In addition, the time history analyses are performed by using three historical earthquakes with different frequency contents, and the simulation results demonstrate that the proposed method is an effective seismic design method for the vibration control of the adjacent structures.

A Study on Integrated Binding Service Strategy Based on Name/property in Wide-Area Object Computing Environments (광역 객체 컴퓨팅 환경에서 이름/속성기반의 통합 바이딩 서비스 방안)

  • Jeong, Chang-Won;Oh, Sung-Kwun;Joo, Su-Chong
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.241-248
    • /
    • 2002
  • With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

A Study on the PAPR Reduction Using Phase Rotation Method Applying Metaheuristic Algorithm (Metaheuristic 알고리즘을 적용한 위상회전 기법에 의한 PAPR 감소에 관한 연구)

  • Yoo, Sun-Yong;Park, Bee-Ho;Kim, Wan-Tae;Cho, Sung-Joon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.26-35
    • /
    • 2009
  • OFDM (Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OFDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PAPR(Peak-to-Average Power Ratio). Phase rotation method can reduce the PAPR without nonlinear distortion by multiplying phase weighting factors. But computational complexity of searching phase weighting factors is increased exponentially with the number of subblocks and considered phase factor. Therefore, a new method, which can reduce computational complexity and detect phase weighting factors efficiently, should be developed. In this paper, a modeling process is introduced, which apply metaheuristic algerian in phase rotation method and optimize in PTS (Particle Swarm Optimization) scheme. Proposed algorithm can solve the computational complexity and guarantee to reduce PAPR We analyzed the efficiency of the PAPR reduction through a simulation when we applied the proposed method to telecommunication systems.

Implementation of the ZigBee-based Homenetwork security system using neighbor detection and ACL (이웃탐지와 ACL을 이용한 ZigBee 기반의 홈네트워크 보안 시스템 구현)

  • Park, Hyun-Moon;Park, Soo-Hyun;Seo, Hae-Moon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.1
    • /
    • pp.35-45
    • /
    • 2009
  • In an open environment such as Home Network, ZigBee Cluster comprising a plurality of Ato-cells is required to provide intense security over the movement of collected, measured data. Against this setting, various security issues are currently under discussion concerning master key control policies, Access Control List (ACL), and device sources, which all involve authentication between ZigBee devices. A variety of authentication methods including Hash Chain Method, token-key method, and public key infrastructure, have been previously studied, and some of them have been reflected in standard methods. In this context, this paper aims to explore whether a new method for searching for neighboring devices in order to detect device replications and Sybil attacks can be applied and extended to the field of security. The neighbor detection applied method is a method of authentication in which ACL information of new devices and that of neighbor devices are included and compared, using information on peripheral devices. Accordingly, this new method is designed to implement detection of malicious device attacks such as Sybil attacks and device replications as well as prevention of hacking. In addition, in reference to ITU-T SG17 and ZigBee Pro, the home network equipment, configured to classify the labels and rules into four categories including user's access rights, time, date, and day, is implemented. In closing, the results demonstrates that the proposed method performs significantly well compared to other existing methods in detecting malicious devices in terms of success rate and time taken.

Accuracy Enhancement using Network Based GPS Carrier Phase Differential Positioning (네트워크 기반의 GPS 반송파 상대측위 정확도 향상)

  • Lee, Yong-Wook;Bae, Kyoung-Ho
    • Spatial Information Research
    • /
    • v.15 no.2
    • /
    • pp.111-121
    • /
    • 2007
  • The GPS positioning offer 3D position using code and carrier phase measurements, but the user can obtain the precise accuracy positioning using carrier phase in Real Time Kinematic(RTK). The main problem, which RTK have to overcome, is the necessary to have a reference station(RS) when using RTK should be generally no more than 10km on average, which is significantly different from DGPS, where distances to RS can exceed several hundred kilometers. The accuracy of today's RTK is limited by the distance dependent errors from orbit, ionosphere and troposphere as well as station dependent influences like multipath and antenna phase center variations. For these reasons, the author proposes Network based GPS Carrier Phase Differential Positioning using Multiple RS which is detached from user receiver about 30km. An important part of the proposed system is algorithm and software development, named DAUNet. The main process is corrections computation, corrections interpolation and searching for the integer ambiguity. Corrections computation of satellite by satellite and epoch by epoch at each reference station are calculated by a Functional model and Stochastic model based on a linear combination algorithm and corrections interpolation at user receiver are used by area correction parameters. As results, the users can obtain the cm-level positioning.

  • PDF

A Real-time Point-to-Point Shortest Path Search Algorithm Based on Traveling Time (주행시간 기반 실시간 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.131-140
    • /
    • 2012
  • The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

An ROI Coding Technique of JPEG2000 Image Including Some Arbitrary ROI (임의의 ROI를 포함하는 JPEG2000 이미지의 ROI 코딩 기법)

  • Hong, Seok-Won;Kim, Sang-Bok;Seo, Yeong-Geon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.11
    • /
    • pp.31-39
    • /
    • 2010
  • In some image processing system or the users who want to see a specific region of image simply, if a part of the image has higher quality than other regions, it would be a nice service. Specifically in mobile environments, preferential service was needed, as the screen size is small. So, JPEG2000 supplies this function. But this doesn't support the process to extract specific regions or service and does the functions to add some techniques. It is called by ROI(Region-of-Interest). In this paper, we use images including human faces, which are processed most preferentially and compressed with high quality. Before an image is served to the users, it is compressed and saved. Here, the face parts are compressed with higher quality than the background which are relatively with lower quality. This technique can offer better service with preferential transferring of the faces, too. Besides, whole regions of the image are compressed with same quality and after searching the faces, they can be preferentially transferred. In this paper, we use a face extraction approach based on neural network and the preferential processing with EBCOT of JPEG2000. For experimentation, we use images having several human faces and evaluate objectively and subjectively, and proved that this approach is a nice one.