• Title/Summary/Keyword: software algorithms

Search Result 1,093, Processing Time 0.035 seconds

Impact Monitoring of Composite Structures using Fiber Bragg Grating Sensors (광섬유 브래그 격자 센서를 이용한 복합재 구조물의 충격 모니터링 기법 연구)

  • Jang, Byeong-Wook;Park, Sang-Oh;Lee, Yeon-Gwan;Kim, Chun-Gon;Park, Chan-Yik;Lee, Bong-Wan
    • Composites Research
    • /
    • v.24 no.1
    • /
    • pp.24-30
    • /
    • 2011
  • Low-velocity impact can cause various damages which are mostly hidden inside the laminates or occur in the opposite side. Thus, these damages cannot be easily detected by visual inspection or conventional NDT systems. And if they occurred between the scheduled NDT periods, the possibilities of extensive damages or structural failure can be higher. Due to these reasons, the built-in NDT systems such as real-time impact monitoring system are required in the near future. In this paper, we studied the impact monitoring system consist of impact location detection and damage assessment techniques for composite flat and stiffened panel. In order to acquire the impact-induced acoustic signals, four multiplexed FBG sensors and high-speed FBG interrogator were used. And for development of the impact and damage occurrence detections, the neural networks and wavelet transforms were adopted. Finally, these algorithms were embodied using MATLAB and LabVIEW software for the user-friendly interface.

Feasibility Study of Case-Finding for Breast Cancer by Community Health Workers in Rural Bangladesh

  • Chowdhury, Touhidul Imran;Love, Richard Reed;Chowdhury, Mohammad Touhidul Imran;Artif, Abu Saeem;Ahsan, Hasib;Mamun, Anwarul;Khanam, Tahmina;Woods, James;Salim, Reza
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.17
    • /
    • pp.7853-7857
    • /
    • 2015
  • Background: Mortality from breast cancer is high in low- and middle-income countries, in part because most patients have advanced stage disease when first diagnosed. Case-finding may be one approach to changing this situation. Materials and Methods: We conducted a pilot study to explore the feasibility of population-based case finding for breast cancer by community health workers (CHWs) using different data collection methods and approaches to management of women found to have breast abnormalities. After training 8 CHWs in breast problem recognition, manual paper data collection and operation of a cell-phone software platform for reporting demographic, history and physical finding information, these CHWs visited 3150 women >age 18 and over they could find-- from 2356 households in 8 villages in rural Bangladesh. By 4 random assignments of villages, data were collected manually (Group 1), or with the cell-phone program alone (Group 2) or with management algorithms (Groups 3 and 4), and women adjudged to have a serious breast problem were shown a motivational video (Group 3), or navigated/accompanied to a breast problem center for evaluation (Group 4). Results: Only three visited women refused evaluation. The manual data acquisition group (1) had missing data in 80% of cases, and took an average of 5 minutes longer to acquire, versus no missing data in the cell phone-reporting groups (2,3 and 4). One woman was identified with stage III breast cancer, and was appropriately treated. Conclusions: Among very poor rural Bangladeshi women, there was very limited reluctance to undergo breast evaluation. The estimated rarity of clinical breast cancer is supported by these population-based findings. The feasibility and efficient use of mobile technology in this setting is supported. Successor studies may most appropriately be trials focusing on improving the suggested benefits of motivation and navigation, on increasing the numbers of cases found, and on stage of disease at diagnosis as the primary endpoint.

Algorithm for Bus Priority Signals based on Urban Traffic Information System(UTIS) (도시교통정보시스템(UTIS) 기반 버스우선신호 알고리즘 개발)

  • Lee, Bong-Keun;Lee, Choul-Ki;Yun, Il-Soo;Kim, Young-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.2
    • /
    • pp.21-28
    • /
    • 2012
  • The continuous deployment of Urban Traffic Information System (UTIS) in Korea has increased the need for developing more practical applications utilizing the standard functions of UTIS facilities installed on urban arterials beyond its basic applications like gathering traffic data and providing traffic information. The UTIS-based bus signal priority may be one of UTIS-based applications meeting such demands. However, the studies on BSP have not been sufficient for actual field deployment in terms of theories and algorithms so that there have been few actual installations on real urban arterials. Thus, this study was aimed at developing a UTIS-based bus priority signal system and evaluating its effectiveness through a field study. To this end, this study presents the system development processes by dividing the UTIS-based bus priority signal system into hardware and software. In addition, the positive effectiveness of the UTIS-based bus priority signal system was verified through a field application test which was conducted at Gyeonggi Global Trade High School intersection.

Implementation of a QoS routing path control based on KREONET OpenFlow Network Test-bed (KREONET OpenFlow 네트워크 테스트베드 기반의 QoS 라우팅 경로 제어 구현)

  • Kim, Seung-Ju;Min, Seok-Hong;Kim, Byung-Chul;Lee, Jae-Yong;Hong, Won-Taek
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.35-46
    • /
    • 2011
  • Future Internet should support more efficient mobility management, flexible traffic engineering and various emerging new services. So, lots of traffic engineering techniques have been suggested and developed, but it's impossible to apply them on the current running commercial Internet. To overcome this problem, OpenFlow protocol was proposed as a technique to control network equipments using network controller with various networking applications. It is a software defined network, so researchers can verify their own traffic engineering techniques by applying them on the controller. In addition, for high-speed packet processing in the OpenFlow network, programmable NetFPGA card with four 1G-interfaces and commercial Procurve OpenFlow switches can be used. In this paper, we implement an OpenFlow test-bed using hardware-accelerated NetFPGA cards and Procurve switches on the KREONET, and implement CSPF (Constraint-based Shortest Path First) algorithm, which is one of popular QoS routing algorithms, and apply it on the large-scale testbed to verify performance and efficiency of multimedia traffic engineering scheme in Future Internet.

The implementation of Korean adult's optimal formant setting by Praat scripting (성인 포먼트 측정에서의 최적 세팅 구현: Praat software와 관련하여)

  • Park, Jiyeon;Seong, Cheoljae
    • Phonetics and Speech Sciences
    • /
    • v.11 no.4
    • /
    • pp.97-108
    • /
    • 2019
  • An automated Praat script was implemented to measure optimal formant frequencies for adults. Optimal formant analysis could be interpreted to show that the deviation of formant frequency that resulted from the two variously combined setting parameters (maximum formant and number of formants) was minimal. To increase the reliability of formant analysis, LPC order should be set differently, based on the gender or vowel type. Praat recommends 5,000 Hz and 5,500 Hz as maximum formant settings and, at the same time, recommends 5 as the number of formants for males and females. However, verification is needed to determine whether these recommended settings are valid for Korean vowels. Statistical analysis showed that formant frequencies significantly varied across the adapted scripts, especially with respect to the data on females. Formant plots and statistical results showed that linear_script and qtone_script are much more reliable in formant measurements. Among four kinds of scripts, the linear and qtone_scripts proved to be more stable and reliable. While the linear_script was designed to have a linearly increased formant step in for-loop, the increment of formant step in the qtone_script was arranged by quarter tone scale (base frequency×common ratio ($\sqrt[24]{2}$)). When looking at the tendency of the formant setting drawn by the two referred algorithms in the context of front vowel [i, e], the maximum formant was set higher; and the number of formants set at a lower value than recommended by Praat. The back vowel [o, u], on the contrary, has a lower maximum formant and a higher number of formants than the standard setting.

An elastic distributed parallel Hadoop system for bigdata platform and distributed inference engines (동적 분산병렬 하둡시스템 및 분산추론기에 응용한 서버가상화 빅데이터 플랫폼)

  • Song, Dong Ho;Shin, Ji Ae;In, Yean Jin;Lee, Wan Gon;Lee, Kang Se
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.5
    • /
    • pp.1129-1139
    • /
    • 2015
  • Inference process generates additional triples from knowledge represented in RDF triples of semantic web technology. Tens of million of triples as an initial big data and the additionally inferred triples become a knowledge base for applications such as QA(question&answer) system. The inference engine requires more computing resources to process the triples generated while inferencing. The additional computing resources supplied by underlying resource pool in cloud computing can shorten the execution time. This paper addresses an algorithm to allocate the number of computing nodes "elastically" at runtime on Hadoop, depending on the size of knowledge data fed. The model proposed in this paper is composed of the layered architecture: the top layer for applications, the middle layer for distributed parallel inference engine to process the triples, and lower layer for elastic Hadoop and server visualization. System algorithms and test data are analyzed and discussed in this paper. The model hast the benefit that rich legacy Hadoop applications can be run faster on this system without any modification.

Implementation and Experimentation of StyleJigsaw for Programming Beginners (프로그래밍 초보자를 위한 스타일직소의 구현과 실험)

  • Lee, Yun-Jung;Jung, In-Joon;Woo, Gyun
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.2
    • /
    • pp.19-31
    • /
    • 2013
  • Since the high readable source codes help us to understand and modify the program, it is much easy to maintain them. The readability of source code is not only affected by the complexity of algorithms such as control structures but also affected by the coding styles such as naming and indentation. Although various coding standards have been presented for promoting the readability of source codes, it has been usually lost or ignored in a programming course. One of the reasons is that the coding standard is not a hard-and-false rule since it does not contribute to the performance of software. In this paper, we propose a simple automatic system, namely StyleJigsaw, which checks the style of the source codes written by C/C++ or Java. In this system, the coding style score is calculated and visualized as a jigsaw puzzle. To measure the educational effectiveness of StyleJigsaw, several experiments have been conducted on a class students in C++ programming course. According to the experimental results, the coding style score increased about 8.0 points(10.9%) on average using StyleJigsaw. Further, according to a questionnaire survey targeting the students who attended the programming course, about 88.5% of the students responded that StyleJigsaw was of help to learn the coding standards. We expect that the StyleJigsaw can be effectively used to encourage the students to obey the coding standards, resulting in high readable programs.

A Sentence Reduction Method using Part-of-Speech Information and Templates (품사 정보와 템플릿을 이용한 문장 축소 방법)

  • Lee, Seung-Soo;Yeom, Ki-Won;Park, Ji-Hyung;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.5
    • /
    • pp.313-324
    • /
    • 2008
  • A sentence reduction is the information compression process which removes extraneous words and phrases and retains basic meaning of the original sentence. Most researches in the sentence reduction have required a large number of lexical and syntactic resources and focused on extracting or removing extraneous constituents such as words, phrases and clauses of the sentence via the complicated parsing process. However, these researches have some problems. First, the lexical resource which can be obtained in loaming data is very limited. Second, it is difficult to reduce the sentence to languages that have no method for reliable syntactic parsing because of an ambiguity and exceptional expression of the sentence. In order to solve these problems, we propose the sentence reduction method which uses templates and POS(part of speech) information without a parsing process. In our proposed method, we create a new sentence using both Sentence Reduction Templates that decide the reduction sentence form and Grammatical POS-based Reduction Rules that compose the grammatical sentence structure. In addition, We use Viterbi algorithms at HMM(Hidden Markov Models) to avoid the exponential calculation problem which occurs under applying to Sentence Reduction Templates. Finally, our experiments show that the proposed method achieves acceptable results in comparison to the previous sentence reduction methods.

Customizable Global Job Scheduler for Computational Grid (계산 그리드를 위한 커스터마이즈 가능한 글로벌 작업 스케줄러)

  • Hwang Sun-Tae;Heo Dae-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.370-379
    • /
    • 2006
  • Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

OPTIMAL TRAJECTORY CORRECTION MANEUVER DESIGN USING THE B-PLANE TARGETING METHOD FOR FUTURE KOREAN MARS MISSIONS (B-평면 조준법을 이용한 화성 탐사선의 궤적 보정을 위한 최적의 기동 설계)

  • Song, Young-Joo;Park, Eun-Seo;Yoo, Sung-Moon;Park, Sang-Young;Choi, Kyu-Hong;Yoon, Jae-Cheol;Yim, Jo-Ryeong;Choi, Joon-Min;Kim, Byung-Kyo
    • Journal of Astronomy and Space Sciences
    • /
    • v.22 no.4
    • /
    • pp.451-462
    • /
    • 2005
  • Optimal Trajectory Correction Maneuver (TCM) design algorithm has been developed using the B-plane targeting method for future Korean Mars missions. For every-mission phase, trajectory informations can also be obtained using this developed algorithms which are essential to design optimal TCM strategy. The information were computed under minimum requiring perturbations to design Mars missions. Spacecraft can not be reached at designed aim point because of unexpected trajectory errors, caused by many perturbations and errors due to operating impulsive maneuvers during the cruising phase of missions. To maintain spacecraft's appropriate trajectory and deliver it to the designed aim point, B-plane targeting techniques are needed. A software NPSOL is used to solve this optimization problem, with the performance index of minimizing total amount of TCM's magnitude. And also executing time of maneuvers on be controlled for the user defined maneuver number $(1\~5)$ of TCMs. The constraints, the Mars arrival B-plane boundary conditions, are formulated for the problem. Results of this work show the ability to design and analyze overall Mars missions, from the Earth launch phase to Mars arrival phase including capture orbit status for future Korean Mars missions