• Title/Summary/Keyword: number operations

Search Result 2,081, Processing Time 0.03 seconds

Parallel Computation For The Edit Distance Based On The Four-Russians' Algorithm (4-러시안 알고리즘 기반의 편집거리 병렬계산)

  • Kim, Young Ho;Jeong, Ju-Hui;Kang, Dae Woong;Sim, Jeong Seop
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.67-74
    • /
    • 2013
  • Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

A study on Fire Case and Countermeasure of Tourist Hotel (관광호텔의 화재손해 위험관리방안 - 화재발생현황과 대형화재사례 분석 중심)

  • Han, Sukman;Son, Jung Hyoun;Kim, Jong Won
    • Journal of the Society of Disaster Information
    • /
    • v.8 no.4
    • /
    • pp.362-375
    • /
    • 2012
  • Tourist hotels are equipped with facilities such as accommodation and restaurants, exercise, recreation. Unspecified guests, visitors and management of tourist hotels are very vulnerable on the casualties and property losses due to fire peril exist. In this study, we analysis that the fire statistics status of tourist hotels from 2001 to 2010. And the 15 cases of a large hotel fire are reviewed. The total number of fires on hotel are consist of a hotel rooms fire(33.2%), a restaurant kitchen fire(11.8%). And the major causes of the fire are an electrical fire (40.8%), a cigarette fire (14.5%) and a hot-work fire (9.2%). In case study, the fire wall defect and combustible materials are major fire loss causes for 10year. Each tourist hotels are needed a development of suitable fire risk management and a field operations. A hotel is required an active fire risk management on a preventive inspection, an education and training, and a preventive maintenance. It is necessary that a fire wall maintenance to prevent of the spread of a fire and a sprinkler installation of whole area to protect fire. And it is very important an emergency response for evacuation of guest, and operate emergency procedures on a fire or emergency situation.

Side Channel Analysis with Low Complexity in the Diffusion Layer of Block Cipher Algorithm SEED (SEED 블록 암호 알고리즘 확산계층에서 낮은 복잡도를 갖는 부채널 분석)

  • Won, Yoo-Seung;Park, Aesun;Han, Dong-Guk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.5
    • /
    • pp.993-1000
    • /
    • 2017
  • When the availability of embedded device is considered, combined countermeasure such as first-order masking and hiding countermeasures is quite attractive because the security and efficiency can be provided at the same time. Especially, combined countermeasure can be applied to the confusion and diffusion layers of the first and last rounds in order to provide the efficiency. Also, the middle rounds only employs first-order masking countermeasure or no countermeasure. In this paper, we suggest a novel side channel analysis with low complexity in the output of diffusion layer. In general, the attack target cannot be set to the output of diffusion layer owing to the high complexity. When the diffusion layer of block cipher is composed of AND operations, we show that the attack complexity can be reduced. Here, we consider that the main algorithm is SEED. Then, the attack complexity with $2^{32}$ can be reduced by $2^{16}$ according to the fact that the correlation between the combination of S-box outputs and that of the outputs of diffusion layer. Moreover, compared to the fact that the main target is the output of S-box in general, we demonstrate that the required number of traces can be reduced by 43~98% in terms of simulated traces. Additionally, we show that only 8,000 traces are enough to retrieve the correct key by suggested scheme, although it fails to reveal the correct key when performing the general approach on 100,000 traces in realistic device.

A Field Survey on Facility Management and Anglers' Requirements at Recreational Sea-fishing Parks (바다낚시공원 시설운영 및 낚시인 요구사항 조사 연구)

  • Kang, Young-Hun;Hong, Sung-Ki;Lee, Han-Seok
    • Journal of Navigation and Port Research
    • /
    • v.39 no.6
    • /
    • pp.529-538
    • /
    • 2015
  • This paper was intended to empirically identify problems with recreational sea fishing park facilities installed to help reinvigorate local economy of fishing villages in order to mitigate shortage of fishing facilities amid an increase in sea fishers and spur evolution of sea fishing into a marine leisure activity, on which basis this researcher presented direction for facility planning which is deemed necessary to map out the plan for sea fishing parks, along with measures designed to improve sea fishing park facilities. To analyze the problems related to sea fishing park facilities, we conducted a survey on facility operations involving 9 sea fishing parks and 2 sea ranches and had an investigative interview with facility manager. Moreover, a survey was conducted of fishers in 25 sea fishing places, including sea fishing park, fishing experience village, etc., in order to investigate their demand for facilities. The results of survey suggested that there was a significant demand for expansion of amenities such as safety facilities, toilets, lounge facilities, etc., which can accommodate the increase in the number of people fishing with family. Furthermore, the results showed that there was a huge demand for introduction of facilities aiding leisure activities in addition to facilities for fishing activities including education facilities such as fishing site at the corner exclusive for beginners, experiential facilities, camping site, seaside park, promenade, etc. Thus, sea fishing park should be the complex leisure space with a focus on fishing activities and requires facility configuration and facility planning suited to activity requirements within fishing park.

XML Schema Evolution Approach Assuring the Automatic Propagation to XML Documents (XML 문서에 자동 전파하는 XML 스키마 변경 접근법)

  • Ra, Young-Gook
    • The KIPS Transactions:PartD
    • /
    • v.13D no.5 s.108
    • /
    • pp.641-650
    • /
    • 2006
  • XML has the characteristics of self-describing and uses DTD or XML schema in order to constraint its structure. Even though the XML schema is only at the stage of recommendation yet, it will be prevalently used because DTD is not itself XML and has the limitation on the expression power. The structure defined by the XML schema as well as the data of the XML documents can vary due to complex reasons. Those reasons are errors in the XML schema design, new requirements due to new applications, etc. Thus, we propose XML schema evolution operators that are extracted from the analysis of the XML schema updates. These schema evolution operators enable the XML schema updates that would have been impossible without supporting tools if there are a large number of XML documents complying the U schema. In addition, these operators includes the function of automatically finding the update place in the XML documents which are registered to the XSE system, and maintaining the XML documents valid to the XML schema rather than merely well-formed. This paper is the first attempt to update XML schemas of the XML documents and provides the comprehensive set of schema updating operations. Our work is necessary for the XML application development and maintenance in that it helps to update the structure of the XML documents as well as the data in the easy and precise manner.

Surgical Complications in Heart Transplant Recipients - A Single Center Experience - (심장이식후에 발생한 외과적 합병증 - 단일 센터 경험 -)

  • Park, Kook-Yang;Park, Chul-Hyun;Jeon, Yang-Bin;Choi, Chang-Hyu;Lee, Jae-Ik
    • Journal of Chest Surgery
    • /
    • v.42 no.6
    • /
    • pp.719-724
    • /
    • 2009
  • Background: As the patients who undergo heart transplantation have achieved better survival in recent years, growing number of recipients are at a risk for experiencing surgical complications in addition to rejection and infection. In this paper, we report on our experience with the surgical complications that occurred in heart transplant recipients. Material and Method: From April 1994 to September 2003, 37 heart transplantations were performed at our center by a single surgeon. The indications for transplantation were dilated cardiomyopathy, ischemic cardiomyopathy, valvular cardiomyopathy and familial hypertrophic cardiomyopathy. Result: Twenty postoperative complications required surgeries in 15 patients (41%). The types of operations required were; redo-sternotomy for bleeding (5), pericardiostomy for effusion (4), implantation of a permanent pacemaker (1), right lower lobe lobectomy for aspergilloma (1), removal of urinary stone (1), cholecystectomy for gall bladder stone (1), drainage of a perianal abscess (1), paranasal sinus drainage (1), total hip replacement (1), partial gingivectomy due to gingival hypertrophy (1), urethrostomy (1), herniated intervertebral disc operation (1) and total hysterectomy for myoma uteri (1). The locations of the complications were mediastinal in 10 (27%) cases and extramediastihalin 10 (27%) cases. Conclusion: The relatively high incidence of extrathoracic complications associated with heart transplantation emphasizes the importance of a multidisciplinary approach to the improve long-term survival when managing those complex patients.

Analysis of Elderly Drivers' Accident Models Considering Operations and Physical Characteristics (고령운전자 운전 및 신체특성을 반영한 교통사고 분석 연구)

  • Lim, Sam Jin;Park, Jun Tae;Kim, Young Il;Kim, Tae Ho
    • Journal of Korean Society of Transportation
    • /
    • v.30 no.6
    • /
    • pp.37-46
    • /
    • 2012
  • The number of traffic accidents caused by elderly drivers over the age of 65 has surged over the past ten years from 37,000 to 274,000 cases. The proportion of elderly drivers' accidents has jumped 3.1 times from 1.2% to 3.7% out of all traffic accidents, and traffic safety organizations are pursuing diverse measures to address the situation. Above all, connecting safety measures with an in-depth research on behavioral and physical characteristics of elderly drivers will prove vital. This study conducted an empirical research linking the driving characteristics and traffic accidents by elderly drivers based on the Driving Aptitude Test items and traffic accident data, which enabled the measurement of behavioral characteristics of elderly drivers. In developing the Influence Model, we applied the zero-inflated Poisson (ZIP) regression model and selected an accident prediction model based on the Bayesian Influence in regards to the ZIP regression model and the zero-inflated negative binomial (ZINB) regression model. According to the results of the AAE analysis, the ZIP regression model was more appropriate and it was found that three variables? prediction of velocity, diversion, and cognitive ability? had a relation of influence with traffic accidents caused by elderly drivers.

Parallel Range Query processing on R-tree with Graphics Processing Units (GPU를 이용한 R-tree에서의 범위 질의의 병렬 처리)

  • Yu, Bo-Seon;Kim, Hyun-Duk;Choi, Won-Ik;Kwon, Dong-Seop
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.669-680
    • /
    • 2011
  • R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

A Use-case based Component Mining Approach for the Modernization of Legacy Systems (레거시 시스템을 현대화하기 위한 유스케이스 기반의 컴포넌트 추출 방법)

  • Kim, Hyeon-Soo;Chae, Heung-Seok;Kim, Chul-Hong
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.601-611
    • /
    • 2005
  • Due to not only proven stability and reliability but a significant investment and years of accumulated -experience and knowledge, legacy systems have supported the core business applications of a number of organizations over many years. While the emergence of Web-based e-business environments requires externalizing core business processes to the Web. This is a competitive advantage in the new economy. Consequently, organizations now need to mine the business value buried in the legacy systems for reuse in new e-business applications. In this paper we suggest a systematic approach to mining components that perform specific business services and that consist of the legacy system's assets to be leveraged on the modem platform. The proposed activities are divided into several tasks. First, use cases that realize the business processes are captured. Secondly, a design model is constructed for each identified use case in order to integrate the use cases with the similar functionalities. Thirdly, we identify component candidates from the design model and then adjust the component candidates by considering common elements among the candidate components. And also business components are divided into three more fine-grained components to deploy them onto J2EE/EJB environments. finally, we define the interfaces of components which provide functionalities of the components as operations.

An Information System Building to Improve the Food and Nutrition Services in Hospitals (병원 급식 및 영양 서비스를 개선하기 위한 정보시스템 구축)

  • 이재선;신해웅;김성태
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.1
    • /
    • pp.9-18
    • /
    • 2002
  • Under the quickly changing health care environment in our society competitions among hospitals are getting harder and accordingly the hospital authorities do their best efforts to renovate their hospital management and let directors of food and nutrition services in hospital be seeking the drastic changes in their clinic-support operations. To attain this end it is essential to build an information system in food and nutrition services in hospital for practicing those operational changes efficiently. By building an information system we can totally manage a number of information about hospital food and nutrition services. This kind of information system can not only relieve dieticians and food-service workers from their repetitively routine jobs, but also connect with hospital management information systems organically. Resultantly productivity in this service area can be improved and the efficiency of hospital management will be increased. And accordingly the competitive advantage of the hospital can be greater than ever and that brings patients' and hospital employees' satisfaction. I would like to name this kind of information system for hospital food and nutrition services "TASTY", abbreviated from "Time-based Advanced Service Technology for Yong-Dong Severance Hospital, Nutrition Department" There are one basic information management area and five business management areas in TASTY. Five specific business areas are divided by menu, procurement, clinical nutrition service, production(including distribution and meal service), and financial management.inancial management.

  • PDF