• Title/Summary/Keyword: Graph-based

Search Result 1,788, Processing Time 0.03 seconds

Improvement of Sedimentation Rate in the Settling Basin by Labyrinth Weir (래버린스 위어를 이용한 침사지 내 침전효율 개선)

  • Cho, Hun Sik;Yeo, Chang Geon;Im, Janghyuk;Lee, Seung Oh
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.3B
    • /
    • pp.153-159
    • /
    • 2012
  • In this study, we proposed modified settling basins transformed by substituting the downstream sill for low head weirs such as generic labyrinth weir and inclined crest labyrinth weir worked as internal baffles. Laboratory experiments were carried out to understand hydraulic characteristics inside of the settling basin to improve the efficiency of sedimentation rate. For a quantitative analysis, we suggested the headwater ratio($H_t/P$), the magnification ratio(L/W) and the inflow rate per total crest length($q_L$) as primary analysis indexes for sedimentation efficiency. Six different types of settling basin were used for labscaled pilot tests by distinguishing with internal structures. Based on results, the variation of headwater ratio with the change of magnification ratio would highly affect the deposition efficiency(%) and it was improved under specific condition that repeating arrange number(N) of labyrinth weir was between 2 and 4. Also, the regression analysis showed that initial condition and shape for improving sedimentation efficiency were plotted on the graph for both $q_L{\geq}3.5cm^2/s$ and $L/W{\leq}3.5$. It would be expected that the geometrically optimized labyrinth settling basin could be designed with proper deposition efficiency for inflow rates of influent and required area of settling basin utilizing the proposed analysis index in this study.

A study on the using pattern analysis of four-digit personal identification numbers - A university case (네 자리 숫자 비밀번호 사용 형태 분석 연구 -A대학 사례연구)

  • Moon, Soog-Kyung
    • Journal of Digital Convergence
    • /
    • v.10 no.10
    • /
    • pp.529-538
    • /
    • 2012
  • This study analyzed a variety of different kinds of usage patterns of four-digit personal identification numbers(PINs) based on the data collected from students attending at A-university in 2011. According to the analysis, the 4 digit PINs '1234' was being used most frequently which is similar to the findings of the study by the Daniel Amitay research. In addition, almost 50 percent of the students were using the four-digit PINs closely related to their personal information, and more than 10 percent of them were using it only by the reason of easiness to remember or convenience to use. Number '0' was the most frequently used, and girl students used it more than boys did. According to the result of analysis of four-digit PINs, it was found that number '1' was the most frequently used in the first and the third position. It was also found that number '2' and number '4' were the most frequently used in the second and the forth position respectively. Among students who had used number 3 in third position, around 63.6 percent of those students were using number 4 in the forth position in their PINs which showed highest frequency from analysis of double-digits connected together in each position. The analysis of PINs were represented by the polygonal (type) graph with that X-axis showed from first to forth position and Y-axis showed number had been used at each position. Among many polygonal graphs, the form showed an N-type which was called in type 1 took the first place by 35 percent.

Design Graphs for Asphalt Concrete Track with Wide Sleepers Using Performance Parameters (성능요소를 반영한 광폭 침목형 아스팔트콘크리트 궤도 설계그래프)

  • Lee, SeongHyeok;Lim, Yujin;Song, Geunwoo;Cho, Hojin
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.3
    • /
    • pp.331-340
    • /
    • 2016
  • Wheel load, design velocity, traffic amount (MGT), stiffness and thickness of sub-layers of asphalt concrete track are selected as performance design parameters in this study. A pseudo-static wheel load computed considering the dynamic amplification factor (DAF) based on the design velocity of the KTX was applied to the top of asphalt concrete track for full three dimensional structural analysis using the ABAQUS program. Tensile strains at the bottom of the asphalt concrete layer and vertical strains at the top of the subgrade were computed from the structural FEA with different combinations of performance parameter values for one asphalt concrete track section. Utilizing the computed structural analysis results such as the tensile strains and the vertical strains, it was possible to develop design graphs to investigate proper track sections for different combination of the performance parameters including wheel load, design velocity, traffic amount(MGT), stiffness and thickness of asphalt concrete layers for any given design life. By analyzing the proposed design graphs for asphalt concrete track, it was possible to propose simple design tables that can be used by engineers for the effective and fast design of track.

A Multiobjective Genetic Algorithm for Static Scheduling of Real-time Tasks (다목적 유전 알고리즘을 이용한 실시간 태스크의 정적 스케줄링 기법)

  • 오재원;김희천;우치수
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.3
    • /
    • pp.293-307
    • /
    • 2004
  • We consider the problem of scheduling tasks of a precedence constrained task graph, where each task has its execution time and deadline, onto a set of identical processors in a way that simultaneously minimizes the number of processors required and the total tardiness of tasks. Most existing approaches tend to focus on the minimization of the total tardiness of tasks. In another methods, solutions to this problem are usually computed by combining the two objectives into a simple criterion to be optimized. In this paper, the minimization is carried out using a multiobjective genetic algorithm (GA) that independently considers both criteria by using a vector-valued cost function. We present various GA components that are well suited to the problem of task scheduling, such as a non-trivial encoding strategy. a domination-based selection operator, and a heuristic crossover operator We also provide three local improvement heuristics that facilitate the fast convergence of GA's. The experimental results showed that when compared to five methods used previously, such as list-scheduling algorithms and a specific genetic algorithm, the Performance of our algorithm was comparable or better for 178 out of 180 randomly generated task graphs.

Mining Frequent Trajectory Patterns in RFID Data Streams (RFID 데이터 스트림에서 이동궤적 패턴의 탐사)

  • Seo, Sung-Bo;Lee, Yong-Mi;Lee, Jun-Wook;Nam, Kwang-Woo;Ryu, Keun-Ho;Park, Jin-Soo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.1
    • /
    • pp.127-136
    • /
    • 2009
  • This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

  • PDF

Study on the Increase of Egg Weight and Early Selection based on Part Record in Layer (산란종계의 란중 증대성과 조기 선발에 관한 연구)

  • Park, Y.H.;Ohh, B. K.
    • Korean Journal of Poultry Science
    • /
    • v.10 no.2
    • /
    • pp.75-81
    • /
    • 1983
  • The records on 787 white Leghorn hens from two different strains, A and K were wed in this study to find out the pattern of increase in egg weight with age and the optimum age of early selection for maximizing the genetic gain. The pattern of increase in egg weight with age in two lines which was expressed on graph showed that the amount of increase was larger in the early part of the laying year and it decreased gradually. Regression equations suggested that egg weight increased linearly with age at the rate of 0.46 gram per week for line A and 0.83 gram for line K. And in the regression analyses of each period mean egg weight on annual mean egg weight, the coefficients of EW 30 that is mean egg weight from 29 weeks of age to 32 weeks of age were 0.86 for line A, 0.88 for line K, and those were the highest figures among the all regression coefficients of each mean egg weight on annual mean egg weight. In estimating the relative selection efficiency of each period mean egg weight on annual mean egg weight in EW 46, selection on EW 34 for line A and on EW 30 for line K was the most efficient for improving egg weight. These results suggested that one periods from 29 weeks of age to 36 weeks of age could be used for the best predictable time for improving annual mean egg weight.

  • PDF

Group Key Management Scheme for Access Control with Reactive Approach (접근 제어를 위한 반응적 방식의 그룹키 관리 기법)

  • Kim, Hee-Youl;Lee, Youn-Ho;Park, Yong-Su;Yoon, Hyun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.589-598
    • /
    • 2007
  • In the group communication which has multiple data streams and various access privileges, it is necessary to provide group access control. The group members having the same access privilege are classified into one class, and the classes form a hierarchy based on the access relations. Then each class is assigned to a secret key. In the previous schemes, a single logical key graph is constructed from the hierarchy and each member always holds all secret keys of the classes he can access in the proactive manner. Thus, higher-privileged members hold more keys then lower-privileged members. However, if the hierarchy is large, each member manages too many keys and the size of multicast message in rekeying increases in proportion to the size of the hierarchy. Moreover, most of the members access a small portion of multiple data streams simultaneously. Therefore, it is redundant to receive rekeying message and update the keys in which he is not currently interested. In this paper, we present a new key management scheme that takes a reactive approach in which each member obtains the key of a data stream only when he wants to access the stream. Each member holds and updates only the key of the class he belongs. If he wants to get the key of other class, he derives it from his key and the public parameter. Proposed scheme considerable reduces the costs for rekeying, especially in the group where access relations are very complex and the hierarchy is large. Moreover, the scheme has another advantage that it easily reflects the change of access relations.

Machine Learning Based Automated Source, Sink Categorization for Hybrid Approach of Privacy Leak Detection (머신러닝 기반의 자동화된 소스 싱크 분류 및 하이브리드 분석을 통한 개인정보 유출 탐지 방법)

  • Shim, Hyunseok;Jung, Souhwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.4
    • /
    • pp.657-667
    • /
    • 2020
  • The Android framework allows apps to take full advantage of personal information through granting single permission, and does not determine whether the data being leaked is actual personal information. To solve these problems, we propose a tool with static/dynamic analysis. The tool analyzes the Source and Sink used by the target app, to provide users with information on what personal information it used. To achieve this, we extracted the Source and Sink through Control Flow Graph and make sure that it leaks the user's privacy when there is a Source-to-Sink flow. We also used the sensitive permission information provided by Google to obtain information from the sensitive API corresponding to Source and Sink. Finally, our dynamic analysis tool runs the app and hooks information from each sensitive API. In the hooked data, we got information about whether user's personal information is leaked through this app, and delivered to user. In this process, an automated Source/Sink classification model was applied to collect latest Source/Sink information, and the we categorized latest release version of Android(9.0) with 88.5% accuracy. We evaluated our tool on 2,802 APKs, and found 850 APKs that leak personal information.

The SAR Chart Viewer design and Implementation in mobile web (모바일 웹에서의 SAR Chart Viewer 설계 및 구현)

  • Lim, Il-Kwon;Kim, Young-Hyuk;Lee, Jae-Gwang;Lee, Jae-Pil;Jang, Haeng-Jin;Lee, Jae-Kwang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.9
    • /
    • pp.2097-2104
    • /
    • 2013
  • Scientific and technological research data is increasing exponentially and, Kisti(Korea Institute of Science and Technology Information) built and supported GSDC(Global Science experimental Data hub Center) depending on the needs processing large data computing and storage devices. Mobile web standards-based the MUPS was built for global community and services of gsdc to spreading mobile devices rapidly. And for analyze Operational status and system resources of GSDC at n this paper researched and implemented system resource monitor method of gsdc to mobile web environment, in this paper researched and implemented system resource monitor method of gsdc to mobile web environment. Research support system of GSDC operated by scientific linux. Sysstat resource monitoring tools create a daily report through sar(system analysis report), after sadc(system activity data collector) collected system resource utilization information. In this paper, sar reports designed and implemented in mobile web to can visualize in a mobile environment. We do not depend specific OS by implementation of the mobile web. So we are available in variety mobile OS. And through provided visual graph, this system can monitor easily and more conveniently then the existing system.

Finding Rectilinear(L1), Link Metric, and Combined Shortest Paths with an Intelligent Search Method (지능형 최단 경로, 최소 꺾임 경로 및 혼합형 최단 경로 찾기)

  • Im, Jun-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.43-54
    • /
    • 1996
  • This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m+eloge+NlogN) and O(eloge+NlogN) time, respectively, and O(e+N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

  • PDF