• Title/Summary/Keyword: information mapping

Search Result 3,156, Processing Time 0.031 seconds

Object Modeling for Mapping from XML Document and Query to UML Class Diagram based on XML-GDM (XML-GDM을 기반으로 한 UML 클래스 다이어그램으로 사상을 위한 XML문서와 질의의 객체 모델링)

  • Park, Dae-Hyun;Kim, Yong-Sung
    • The KIPS Transactions:PartD
    • /
    • v.17D no.2
    • /
    • pp.129-146
    • /
    • 2010
  • Nowadays, XML has been favored by many companies internally and externally as a means of sharing and distributing data. there are many researches and systems for modeling and storing XML documents by an object-oriented method as for the method of saving and managing web-based multimedia document more easily. The representative tool for the object-oriented modeling of XML documents is UML (Unified Modeling Language). UML at the beginning was used as the integrated methodology for software development, but now it is used more frequently as the modeling language of various objects. Currently, UML supports various diagrams for object-oriented analysis and design like class diagram and is widely used as a tool of creating various database schema and object-oriented codes from them. This paper proposes an Efficinet Query Modelling of XML-GL using the UML class diagram and OCL for searching XML document which its application scope is widely extended due to the increased use of WWW and its flexible and open nature. In order to accomplish this, we propose the modeling rules and algorithm that map XML-GL. which has the modeling function for XML document and DTD and the graphical query function about that. In order to describe precisely about the constraint of model component, it is defined by OCL (Object Constraint Language). By using proposed technique creates a query for the XML document of holding various properties of object-oriented model by modeling the XML-GL query from XML document, XML DTD, and XML query while using the class diagram of UML. By converting, saving and managing XML document visually into the object-oriented graphic data model, user can prepare the base that can express the search and query on XML document intuitively and visually. As compared to existing XML-based query languages, it has various object-oriented characteristics and uses the UML notation that is widely used as object modeling tool. Hence, user can construct graphical and intuitive queries on XML-based web document without learning a new query language. By using the same modeling tool, UML class diagram on XML document content, query syntax and semantics, it allows consistently performing all the processes such as searching and saving XML document from/to object-oriented database.

Mobbing-Value Algorithm based on User Profile in Online Social Network (온라인 소셜 네트워크에서 사용자 프로파일 기반의 모빙지수(Mobbing-Value) 알고리즘)

  • Kim, Guk-Jin;Park, Gun-Woo;Lee, Sang-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.6
    • /
    • pp.851-858
    • /
    • 2009
  • Mobbing is not restricted to problem of young people but the bigger recent problem occurs in workspaces. According to reports of ILO and domestic case mobbing in the workplace is increasing more and more numerically from 9.1%('03) to 30.7%('08). These mobbing brings personal and social losses. The proposed algorithm makes it possible to grasp not only current mobbing victims but also potential mobbing victims through user profile and contribute to efficient personnel management. This paper extracts user profile related to mobbing, in a way of selecting seven factors and fifty attributes that are related to this matter. Next, expressing extracting factors as '1' if they are related me or not '0'. And apply similarity function to attributes summation included in factors to calculate similarity between the users. Third, calculate optimizing weight choosing factors included attributes by applying neural network algorithm of SPSS Clementine and through this summation Mobbing-Value(MV) can be calculated . Finally by mapping MV of online social network users to G2 mobbing propensity classification model(4 Groups; Ideal Group of the online social network, Bullies, Aggressive victims, Victims) which is designed in this paper, can grasp mobbing propensity of users, which will contribute to efficient personnel management.

Registration Technique of Partial 3D Point Clouds Acquired from a Multi-view Camera for Indoor Scene Reconstruction (실내환경 복원을 위한 다시점 카메라로 획득된 부분적 3차원 점군의 정합 기법)

  • Kim Sehwan;Woo Woontack
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.3 s.303
    • /
    • pp.39-52
    • /
    • 2005
  • In this paper, a registration method is presented to register partial 3D point clouds, acquired from a multi-view camera, for 3D reconstruction of an indoor environment. In general, conventional registration methods require a high computational complexity and much time for registration. Moreover, these methods are not robust for 3D point cloud which has comparatively low precision. To overcome these drawbacks, a projection-based registration method is proposed. First, depth images are refined based on temporal property by excluding 3D points with a large variation, and spatial property by filling up holes referring neighboring 3D points. Second, 3D point clouds acquired from two views are projected onto the same image plane, and two-step integer mapping is applied to enable modified KLT (Kanade-Lucas-Tomasi) to find correspondences. Then, fine registration is carried out through minimizing distance errors based on adaptive search range. Finally, we calculate a final color referring colors of corresponding points and reconstruct an indoor environment by applying the above procedure to consecutive scenes. The proposed method not only reduces computational complexity by searching for correspondences on a 2D image plane, but also enables effective registration even for 3D points which have low precision. Furthermore, only a few color and depth images are needed to reconstruct an indoor environment.

Distributions of HLA Microsatellite Markers and the Linkage Disequilibria between HLA and Microsatellites in Koreans (한국인에서 HLA 유전자 부위 내 Microsatellite 표지자의 분포와 HLA 대립유전자의 유전적 연관성)

  • Jang, Jung-Pil;Choi, Eun-Jeong;Yoon, Ho-Yeul;Choi, Hee-Baeg;Kim, Hee-Je;Cho, Byung-Sik;Min, Woo-Sung;Lee, Jong-Wook;Kim, Chun-Choo;Kim, Tai-Gyu
    • IMMUNE NETWORK
    • /
    • v.7 no.3
    • /
    • pp.149-157
    • /
    • 2007
  • Background: The microsatellites within human leukocyte antigen (HLA) region show considerable polymorphism and strong linkage disequilibrium (LD) with HLA alleles. These microsatellites have been used for genetic analysis including disease mapping to understand susceptibility to autoimmune and infectious diseases. Also, use of microsatellites has recently been proposed as an approach for identifying non-HLA markers within the HLA region that could function as transplantation determinants and for the selection of potential donors for transplantation. Methods: To analyse the frequency of five microsatellites in the Korean population, genotyping for polymorphisms at five microsatellites markers (BAT2, MIB, DQCAR, D6S105 and TNFd) within HLA region was performed on 143 healthy Korean controls. Results: The most frequent genotype shown in healthy Korean controls were BAT2 8 (153 bp, 42.7%), MIB 1 (326 bp, 40.6%), DQCAR 3 (188 bp, 38.5%), D6S105 7 (126 bp, 58.0%) and TNFd 3 (128 bp, 58.0%). And common two-loci haplotypes were found as MIB 1-HLA-B*62 (HF: 10.6%), MIB 6-HLA-B*44 (HF: 7.8%), DQCAR 3-HLA-DRB1*13 (HF: 8.5%), TNFd 5-HLA-B*62 (HF: 7.8%) and D6S105 7-HLA-A*02 (HF: 16.2%). Conclusion: These data might provide useful information on the microsatellites markers with HLA region in Korean population and be helpful in further defining the clinical impact of these microsatellites.

Diode laser surgery in the treatment of oral proliferative verrucous leukoplakia associated with HPV-16 infection

  • Bombeccari, Gian Paolo;Garagiola, Umberto;Candotto, Valentina;Pallotti, Francesco;Carinci, Francesco;Gianni, Aldo Bruno;Spadari, Francesco
    • Maxillofacial Plastic and Reconstructive Surgery
    • /
    • v.40
    • /
    • pp.16.1-16.5
    • /
    • 2018
  • Background: Proliferative verrucous leukoplakia (PVL) is an oral potentially malignant disorder, characterized by multifocal expression, progressive clinical evolution, and a high rate of malignant transformation. Evidence-based information regarding optimal PVL management is lacking, due to the paucity of data. The present report describes a case of PVL associated with HPV-16 infection and epithelial dysplasia treated by diode laser surgery, and the outcome of disease clinical remission over a 2-year follow-up period. Case report: A 61-year-old Caucasian male with oral verrucous hyperkeratosis presented for diagnosis. The lesions were localized on the maxillary gingiva and palatal alveolar ridge. Multiple biopsy specimens have been taken by mapping the keratotic lesion area. Microscopic examination was compatible with a diagnosis of PVL with focal mild dysplasia, localized in the right maxillary gingiva. Polymerase chain reaction (PCR) was done for human papillomavirus (HPV) detection which revealed presence of HPV DNA, and the genotype revealed HPV 16 in the sample. The PVL in the right gingival area was treated on an outpatient basis by excision with a diode laser. This approach resulted in good clinical response and decreased morbidity over a 2-year follow-up period. Conclusions: This case illustrates the benefit of a conservative approach by diode laser treatment than wide surgical excision for management of the PVL lesions associated with mild dysplasia and HPV-16 infection.

Multiple Camera Based Imaging System with Wide-view and High Resolution and Real-time Image Registration Algorithm (다중 카메라 기반 대영역 고해상도 영상획득 시스템과 실시간 영상 정합 알고리즘)

  • Lee, Seung-Hyun;Kim, Min-Young
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.4
    • /
    • pp.10-16
    • /
    • 2012
  • For high speed visual inspection in semiconductor industries, it is essential to acquire two-dimensional images on regions of interests with a large field of view (FOV) and a high resolution simultaneously. In this paper, an imaging system is newly proposed to achieve high quality image in terms of precision and FOV, which is composed of single lens, a beam splitter, two camera sensors, and stereo image grabbing board. For simultaneously acquired object images from two camera sensors, Zhang's camera calibration method is applied to calibrate each camera first of all. Secondly, to find a mathematical mapping function between two images acquired from different view cameras, the matching matrix from multiview camera geometry is calculated based on their image homography. Through the image homography, two images are finally registered to secure a large inspection FOV. Here the inspection system of using multiple images from multiple cameras need very fast processing unit for real-time image matching. For this purpose, parallel processing hardware and software are utilized, such as Compute Unified Device Architecture (CUDA). As a result, we can obtain a matched image from two separated images in real-time. Finally, the acquired homography is evaluated in term of accuracy through a series of experiments, and the obtained results shows the effectiveness of the proposed system and method.

Flexible Intelligent Exit Sign Management of Cloud-Connected Buildings

  • Lee, Minwoo;Mariappan, Vinayagam;Lee, Junghoon;Cho, Juphil;Cha, Jaesang
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.58-63
    • /
    • 2017
  • Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.

Grieving among Adolescent Survivors of Childhood Cancer: A Situational Analysis (청소년 소아암 생존자의 슬픔: 상황분석)

  • Jin, Juhye
    • Child Health Nursing Research
    • /
    • v.20 no.1
    • /
    • pp.49-57
    • /
    • 2014
  • Purpose: The purpose of this qualitative study was to explore how adolescent survivors of childhood cancer grieve the death of cancer peers. Methods: Data were obtained from Korean adolescents with cancer between the ages of 13 and 18 (N=12) through semi-structured interviews (face-to-face, telephone, and Internet chatting), observations of the social dynamics of participants in self-help groups, and retrieval of personal Web journals. Based on the grounded theory methodology, data collection and analysis were conducted simultaneously, and constant comparative methods were used. Clarke's situational analysis was adopted, and this paper focused on presenting "how to" and "what we can learn" from this analytic strategy. Results: Mapping examples were visualized using of three modes of maps. Adolescent cancer survivors coped with reminders of the "darkness" that ultimately featured their overall grief. Additionally, adolescents' encounters and avoidance of grief were triggered by introspection and interactions with family and friends. Conclusion: Situational analysis provided an efficient way to analyze the experiences of adolescent survivors of childhood cancer by systematizing possible information within the relational social contexts of the research phenomenon.

A Table Parametric Method for Automatic Generation of Parametric CAD Models in a Mold Base e-Catalog System (몰드베이스 전자 카탈로그 시스템의 파라메트릭 CAD 모델 자동 생성을 위한 테이블 파라메트릭 방법)

  • Mun, Du-Hwan;Kim, Heung-Ki;Jang, Kwang-Sub;Cho, Jun-Myun;Kim, Jun-Hwan;Han, Soon-Hung
    • The Journal of Society for e-Business Studies
    • /
    • v.9 no.4
    • /
    • pp.117-136
    • /
    • 2004
  • As the time-to-market gets more important for competitiveness of an enterprise in manufacturing industry, it becomes important to shorten the development cycle of a product. Reuse of existing design models and e-Catalog for components are required for faster product development. To achieve this goal, an electric catalog must provide parametric CAD models since parametric information is indispensable for configuration design. There are difficulties in building up a parametric library of all the necessary combination using a CAD system, since we have too many combinations of components for a product. For example, there are at least 80 million combinations of components on one page of paper catalog of a mold base. To solve this problem, we propose the method of table parametric for the automatic generation of parametric CAD models. Any combination of mold base can be generated by mapping between a classification system of an electric catalog and the design parameters set of the table parametric. We propose how to select parametric models and to construct the design parameters set.

  • PDF

AS B-tree: A study on the enhancement of the insertion performance of B-tree on SSD (AS B-트리: SSD를 사용한 B-트리에서 삽입 성능 향상에 관한 연구)

  • Kim, Sung-Ho;Roh, Hong-Chan;Lee, Dae-Wook;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.18D no.3
    • /
    • pp.157-168
    • /
    • 2011
  • Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.