• Title/Summary/Keyword: Information Merging

Search Result 557, Processing Time 0.028 seconds

SOA-based Integrated U-City Service Architecture (SOA 기반의 U-City 서비스 통합 아키텍처)

  • Lee, Kang-Pyo;Lim, Young-Seok;Ahn, Jae-Min;Yoo, Jin-Soo;Kim, Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.257-262
    • /
    • 2010
  • SOA (Service-Oriented Architecture), which has become very popular recently, is a new paradigm for software development and application. In this paper, we propose an integrated architecture which is able to effectively manage and control a variety of services for U-City projects focusing on the importance of service integration. SOA has a number of important features such as loose coupling, standard bases, and distributed computing, all of which are the essential elements for merging and providing various services in U-City projects. We exploit the ESB (Enterprise Service Bus) for reflecting those features, which is a core module linking mutually heterogeneous components so that the communication of services can be implemented. In this paper, we discuss the necessity of SOA in U-City services and a possible scenario and method for the implementation. Finally, we propose an integrated architecture for the U-City Integration and Management Center.

Synthesis of Asynchronous Circuits from Free-Choice Signal Transition Graphs with Timing Constraints (시간 제한 조건을 가진 자유 선택 신호 전이 그래프로부터 비동기 회로의 합성)

  • Jeong, Seong-Tae;Jeong, Seok-Tae
    • The KIPS Transactions:PartA
    • /
    • v.9A no.1
    • /
    • pp.61-74
    • /
    • 2002
  • This paper presents a method which synthesizes asynchronous circuits from free-choice Signal Transition Graphs (STGs) with timing constraints. The proposed method synthesizes asynchronous circuits by analyzing: the relations between signal transitions directly from the STGs without generating state graphs. The synthesis procedure decomposes a free-choice STG into deterministic STGs which do not have choice behavior. Then, a timing analysis extracts the timed concurrency and tamed causality relations between any two signal transitions for each deterministic STG. The synthesis procedure synthesizes circuits for each deterministic STG and synthesizes the final circuit by merging the circuits for each deterministic STG. The experimental results show that our method achieves significant reductions in synthesis time for the circuits which have a large state space, and generates circuits that have nearly the same area as compared to previous methods.

Content-based Image Retrieval using Feature Extraction in Wavelet Transform Domain (웨이브릿 변환 영역에서 특징추출을 이용한 내용기반 영상 검색)

  • 최인호;이상훈
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.4
    • /
    • pp.415-425
    • /
    • 2002
  • In this paper, we present a content-based image retrieval method which is based on the feature extraction in the wavelet transform domain. In order to overcome the drawbacks of the feature vector making up methods which use the global wavelet coefficients in subbands, we utilize the energy value of wavelet coefficients, and the shape-based retrieval of objects is processed by moment which is invariant in translation, scaling, rotation of the objects The proposed methods reduce feature vector size, and make progress performance of classification retrieval which provides fast retrievals times. To offer the abilities of region-based image retrieval, we discussed the image segmentation method which can reduce the effect of an irregular light sources. The image segmentation method uses a region-merging, and candidate regions which are merged were selected by the energy values of high frequency bands in discrete wavelet transform. The region-based image retrieval is executed by using the segmented region information, and the images are retrieved by a color, texture, shape feature vector.

  • PDF

Extraction of a Central Object in a Color Image Based on Significant Colors (특이 칼라에 기반한 칼라 영상에서의 중심 객체 추출)

  • SungYoung Kim;Eunkyung Lim;MinHwan Kim
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.648-657
    • /
    • 2004
  • A method of extracting central objects in color images without any prior-knowledge is proposed in this paper, which uses basically information of significant color distribution. A central object in an image is defined as a set of regions that lie around center of the image and have significant color distribution against the other surround (or background) regions. Significant colors in an image are first defined as the colors that are distributed more densely around center of the image than near borders. Then core object regions (CORs) are selected as the regions a lot of pixels of which have the significant colors. Finally, the adjacent regions to the CORs are iteratively merged if they are similar to the CORs but not to the background regions in color distribution. The merging result is accepted as the central object that may include differently color-characterized regions and/or two or more objects of interest. Usefulness of the significant colors in extracting the central object was verified through experiments on several kinds of test images. We expect that central objects shall be used usefully in image retrieval applications.

  • PDF

Background Subtraction Algorithm Based on Multiple Interval Pixel Sampling (다중 구간 샘플링에 기반한 배경제거 알고리즘)

  • Lee, Dongeun;Choi, Young Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.27-34
    • /
    • 2013
  • Background subtraction is one of the key techniques for automatic video content analysis, especially in the tasks of visual detection and tracking of moving object. In this paper, we present a new sample-based technique for background extraction that provides background image as well as background model. To handle both high-frequency and low-frequency events at the same time, multiple interval background models are adopted. The main innovation concerns the use of a confidence factor to select the best model from the multiple interval background models. To our knowledge, it is the first time that a confidence factor is used for merging several background models in the field of background extraction. Experimental results revealed that our approach based on multiple interval sampling works well in complicated situations containing various speed moving objects with environmental changes.

Parallelization of Genome Sequence Data Pre-Processing on Big Data and HPC Framework (빅데이터 및 고성능컴퓨팅 프레임워크를 활용한 유전체 데이터 전처리 과정의 병렬화)

  • Byun, Eun-Kyu;Kwak, Jae-Hyuck;Mun, Jihyeob
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.10
    • /
    • pp.231-238
    • /
    • 2019
  • Analyzing next-generation genome sequencing data in a conventional way using single server may take several tens of hours depending on the data size. However, in order to cope with emergency situations where the results need to be known within a few hours, it is required to improve the performance of a single genome analysis. In this paper, we propose a parallelized method for pre-processing genome sequence data which can reduce the analysis time by utilizing the big data technology and the highperformance computing cluster which is connected to the high-speed network and shares the parallel file system. For the reliability of analytical data, we have chosen a strategy to parallelize the existing analytical tools and algorithms to the new environment. Parallelized processing, data distribution, and parallel merging techniques have been developed and performance improvements have been confirmed through experiments.

Securitization and the Merger of Great Power Management and Global Governance: The Ebola Crisis

  • Cui, Shunji;Buzan, Barry
    • Analyses & Alternatives
    • /
    • v.3 no.1
    • /
    • pp.29-61
    • /
    • 2019
  • Within the discipline of International Relations (IR), the literatures on global governance (GG) and great power management (GPM) at best ignore each other, and at worst treat the other as a rival or enemy. On the one hand, the GPM literature, like both realism in all its forms, and neoliberalism, takes for granted the ongoing, disproportionate influence of the great powers in the management of the international system/society, and does not look much beyond that. On the other hand, the GG literature emphasizes the roles of smaller states, non-state actors and intergovernmental organizations (IGOs), and tends to see great powers more as part of the problem than as part of the solution. This paper argues that the rise to prominence of a non-traditional security agenda, and particularly of human security, has triggered a de facto merger of GPM and GG that the IR literature usually treated as separate and often opposed theories. We use the Ebola crisis of 2014-15 to show how an issue framed as human security brought about a multi-actor response that combined the key elements of GPM and GG. The security framing overrode many of the usual inhibitions between great powers and non-state actors in humanitarian crises, including even the involvement of great power military forces. Through examining broadly the way in which the Ebola crisis is tackled, we argue that in an age of growing human security challenges, GPM and GG are necessarily and fruitfully merging. The role of great powers in this new human security environment is moving away from the simple means and ends of traditional GPM. Now, great powers require the ability to cooperate and coordinate with multiple-level actors to make the GG/GPM nexus more effective and sustainable. In doing so they can both provide crucial resources quickly, and earn respect and status as responsible great powers. IGOs provide legitimation and coordination to the GPM/GG package, and non-state actors (NSAs) provide information, specialist knowledge and personnel, and links into public engagement. In this way, the unique features of the Ebola crisis provide a model for how the merger of GPM and GG might be taken forward on other shared-fate threats facing global international society.

  • PDF

Joint Reasoning of Real-time Visual Risk Zone Identification and Numeric Checking for Construction Safety Management

  • Ali, Ahmed Khairadeen;Khan, Numan;Lee, Do Yeop;Park, Chansik
    • International conference on construction engineering and project management
    • /
    • 2020.12a
    • /
    • pp.313-322
    • /
    • 2020
  • The recognition of the risk hazards is a vital step to effectively prevent accidents on a construction site. The advanced development in computer vision systems and the availability of the large visual database related to construction site made it possible to take quick action in the event of human error and disaster situations that may occur during management supervision. Therefore, it is necessary to analyze the risk factors that need to be managed at the construction site and review appropriate and effective technical methods for each risk factor. This research focuses on analyzing Occupational Safety and Health Agency (OSHA) related to risk zone identification rules that can be adopted by the image recognition technology and classify their risk factors depending on the effective technical method. Therefore, this research developed a pattern-oriented classification of OSHA rules that can employ a large scale of safety hazard recognition. This research uses joint reasoning of risk zone Identification and numeric input by utilizing a stereo camera integrated with an image detection algorithm such as (YOLOv3) and Pyramid Stereo Matching Network (PSMNet). The research result identifies risk zones and raises alarm if a target object enters this zone. It also determines numerical information of a target, which recognizes the length, spacing, and angle of the target. Applying image detection joint logic algorithms might leverage the speed and accuracy of hazard detection due to merging more than one factor to prevent accidents in the job site.

  • PDF

Analysis of the effect on Road Network with Communication Failure Rate of C-ITS Information System for Rear-end Collision Avoidance (C-ITS 차량 추돌방지 지원 시스템의 통신 부하를 고려한 도로네트워크 영향 분석)

  • Kim, Jun-Yong;Kim, Jin-Tae
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.5
    • /
    • pp.71-82
    • /
    • 2016
  • Information System for rear-end collision avoidance is a unit service of C-ITS pilot project. Road environment that the number of vehicles at the same driving high-speed has a possibility that the communication delay or failure caused by heavy load of vehicle to vehicle communication. In this study, effects of the road network about a communication failure rate of information system for rear-end collision avoidance was analyzed quantitatively with micro traffic simulation. The simulation was carried out in situation that crash of two vehicles are occurred at merging area with speed limit 80km/h and information of collision is prvoided to the rear vehicle. From simulation results, it can confirm the trend of the increasing 14% of potential conflict according to 10% increasing of the communication failure rate. C-ITS service has a goal of increasing safety. The coommunication failure rate increases due to heavy load of vehicle causes a fatal result in road safety administrator position. For the success of C-ITS project, a communication system developers side should perform the effort to reduce the communication failure rate.

A Study on the Coordinate-based Intersection ID Composition System Using Space Filling Curves (공간 채움 곡선을 활용한 좌표 기반의 교차로 ID 구성 체계에 관한 연구)

  • Lee, Eun il;Park, Soo hong;Kim, Duck ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.6
    • /
    • pp.124-136
    • /
    • 2019
  • Autonomous driving at intersections requires assistance by exchanging traffic information between traffic objects due to the intersection of various vehicles and complicated driving environment. For this reason, traffic information exchange between adjacent intersections is required, but the node ID representing the intersection in the Korean standard node link system have limitations in updating intersections and identifying location information of intersections through IDs due to the configuration system including serial numbers. In this paper, we designed a coordinate-based intersection ID configuration system created by processing and merging two-dimensional coordinates of intersections to include location information in the intersection ID. In order to verify the applicability of the proposed intersection ID, we applied a new intersection ID to domestic intersections and confirmed that there are no duplicate values. Coordinate-based intersection ID reduces data size by 60% compared to existing node ID, and enables spatial queries such as searching for nearby intersections and extracting intersections in specific areas in the form of boxes without GIS tools. Therefore, coordinate-based intersection ID is expected to be more scalable and utilized than existing node ID.