• 제목/요약/키워드: Graph500

검색결과 38건 처리시간 0.027초

Optimization of Graph Processing based on In-Storage Processing (스토리지 내 프로세싱 방식을 사용한 그래프 프로세싱의 최적화 방법)

  • Song, Nae Young;Han, Hyuck;Yeom, Heon Young
    • KIISE Transactions on Computing Practices
    • /
    • 제23권8호
    • /
    • pp.473-480
    • /
    • 2017
  • In recent years, semiconductor-based storage devices such as flash memory (SSDs) have been developed to high performance. In addition, a trend has been observed of optimally utilizing resources such as the central processing unit (CPU) and memory of the internal controller in the storage device according to the needs of the application. This concept is called In-Storage Processing (ISP). In a storage device equipped with the ISP function, it is possible to process part of the operation executed on the host system, thus reducing the load on the host. Moreover, since the data is processed in the storage device, the data transferred to the host are reduced. In this paper, we propose a method to optimize graph query processing by utilizing these ISP functions, and show that the optimized graph processing method improves the performance of the graph 500 benchmark by up to 20%.

THE BASES OF PRIMITIVE NON-POWERFUL COMPLETE SIGNED GRAPHS

  • Song, Byung Chul;Kim, Byeong Moon
    • Korean Journal of Mathematics
    • /
    • 제22권3호
    • /
    • pp.491-500
    • /
    • 2014
  • The base of a signed digraph S is the minimum number k such that for any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. Let K be a signed complete graph of order n, which is a signed digraph obtained by assigning +1 or -1 to each arc of the n-th order complete graph $K_n$ considered as a digraph. In this paper we show that for $n{\geq}3$ the base of a primitive non-powerful signed complete graph K of order n is 2, 3 or 4.

An Attack Graph Model for Dynamic Network Environment (동적 네트워크 환경에 적용 가능한 Attack Graph 모델 연구)

  • Moon, Joo Yeon;Kim, Taekyu;Kim, Insung;Kim, Huy Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제28권2호
    • /
    • pp.485-500
    • /
    • 2018
  • As the size of the system and network environment grows and the network structure and the system configuration change frequently, network administrators have difficulty managing the status manually and identifying real-time changes. In this paper, we suggest a system that scans dynamic network information in real time, scores vulnerability of network devices, generates all potential attack paths, and visualizes them using attack graph. We implemented the proposed algorithm based attack graph; and we demonstrated that it can be applicable in MTD concept based defense system by simulating on dynamic virtual network environment with SDN.

ICFGO : UI Concealing and Dummy Flow Insertion Method for Inter-Procedural Control Flow Graph Obfuscation (ICFGO : Inter-Procedural Control Flow Graph 난독화를 위한 UI 은닉 및 Dummy Flow 삽입 기법)

  • Shim, Hyunseok;Jung, Souhwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • 제30권3호
    • /
    • pp.493-501
    • /
    • 2020
  • For the obfuscation of Flow Analysis on the Android operating system, the size of the Flow Graph can be large enough to make analysis difficult. To this end, a library in the form of aar was implemented so that it could be inserted into the application in the form of an external library. The library is designed to have up to five child nodes from the entry point in the dummy code, and for each depth has 2n+1 numbers of methods from 100 to 900 for each node, so it consists of a total of 2,500 entry points. In addition, entry points consist of a total of 150 views in XML, each of which is connected via asynchronous interface. Thus, the process of creating a Inter-procedural Control Flow Graph has a maximum of 14,175E+11 additional cases. As a result of applying this to application, the Inter Procedure Control Flow Analysis too generates an average of 10,931 edges and 3,015 nodes with an average graph size increase of 36.64%. In addition, in the APK analyzing process showed that up to average 76.33MB of overhead, but only 0.88MB of execution overhead in the user's ART environment.

The Study on Elementary Male and Female Students' Abilities to Construct and Interpret Graphs Based on Their Spatial Abilities and Science Process Skills (초등학교 남.녀 학생들의 공간 능력 및 과학 탐구 능력에 따른 그래프 작성 및 해석 능력에 관한 연구)

  • Jeon, Bok-Hee;Lee, Hyeong Cheol
    • Journal of Korean Elementary Science Education
    • /
    • 제31권4호
    • /
    • pp.490-500
    • /
    • 2012
  • This study was to examine elementary male and female students' spatial abilities, science process skills, and graph construction and interpretation abilities in order to understand the effect that their spatial abilities and science process skills would have on their graph abilities. To conduct this study, total 12 classes of 435 pupils, 6 classes each from grades 5 and 6 in elementary schools were selected for subjects. The number of male student was 207 and that of female one was 228 of them. And previous test papers of spatial abilities, of science process abilities, and of graph abilities were retouched and updated for reuse in new tests. The results of this study are briefed as follows: Firstly, when spatial abilities for male and female group were compared, female group showed a little higher rate of correct answering than male, but not providing statistically significant gap. Secondly, the science process skill tests revealed basic process skills of both groups were more excellent than their integrated process skills, while female group was found to have more correct answers than male, all of which were proving statistical distinction. Thirdly, of graphing skills for two groups, the graph interpretation skills turned out to be better than the graph construction skills, with female group scoring higher than male and with meaningful difference. Fourthly, both between spatial abilities and graph abilities, and between science process skills and graph abilities, static correlations existed with statistical meaning. In other words, those with higher spatial abilities or science process skills were to do better in constructing and interpreting graphs.

Development of a Data Structure for Effective Monitoring of Power Plant Start-up Sequences (화력 발전소의 기동 시퀀스 진행 모니터링을 위한 자료구조 개발)

  • Lee, Seung-Chul;Han, Seung-Woo;Kim, Seung-Jin
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • 제23권12호
    • /
    • pp.224-232
    • /
    • 2009
  • Power plant start-up is a complicate process involving hundreds of operations that should be performed either automatically or manually. Several major operations should be proceeded in parallel and each major operation is again broken down into detailed operations that must be carried out in a strict sequence. Even though most of the operations are automated, still substantial portions of the operations are carried out manually and the operational status should be monitored by the crew members, which are quite stressful tasks to be performed in real time. In this paper, a data structure called an Event Sequence Monitoring Graph(ESMG) is proposed for monitoring a sequence of events involved in the power plant start-up process. The ESMG is currently being applied to a thermal power plant with a rated output of 500MW. An application example is shown with the boiler feed water pump system start-up process, which exhibits a good potential for future applications.

Large Scale Protein Side-chain Packing Based on Maximum Edge-weight Clique Finding Algorithm

  • K.C., Dukka Bahadur;Brown, J.B.;Tomita, Etsuji;Suzuki, Jun'ichi;Akutsu, Tatsuya
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
    • /
    • pp.228-233
    • /
    • 2005
  • The protein side-chain packing problem (SCPP) is known to be NP-complete. Various graph theoretic based side-chain packing algorithms have been proposed. However as the size of the protein becomes larger, the sampling space increases exponentially. Hence, one approach to cope with the time complexity is to decompose the graph of the protein into smaller subgraphs. Some existing approaches decompose the graph into biconnected components at an articulation point (resulting in an at-most 21-residue subgraph) or solve the SCPP by tree decomposition (4-, 5-residue subgraph). In this regard, we had also presented a deterministic based approach called as SPWCQ using the notion of maximum edge weight clique in which we reduce SCPP to a graph and then obtain the maximum edge-weight clique of the obtained graph. This algorithm performs well for a protein of less than 500 residues. However, it fails to produce a feasible solution for larger proteins because of the size of the search space. In this paper, we present a new heuristic approach for the side-chain packing problem based on the maximum edge-weight clique finding algorithm that enables us to compute the side-chain packing of much larger proteins. Our new approach can compute side-chain packing of a protein of 874 residues with an RMSD of 1.423${\AA}$.

  • PDF

Analysis of Children's Constructing and Interpreting of a Line Graph in Science (초등학생들의 과학 선 그래프 작성 및 해석 과정 분석)

  • Yang, Su Jin;Jang, Myoung-Duk
    • Journal of Korean Elementary Science Education
    • /
    • 제31권3호
    • /
    • pp.321-333
    • /
    • 2012
  • The purpose of this study was to examine elementary school students' characteristics and difficulties in drawing and interpreting a line graph, and to present educational implications. Twenty five students(4th grader: 6, 5th grader: 9, and 6th grader: 10) at an elementary school participated in this study. We used a student's task which was about graphing on a given data table and interpreting his/her graph. The data table was on heating 200mL and 500mL of water and measuring their temperature at regular time intervals. We collected multiple source of data, and data analyzed based on the sub-variables of TOGS. The some results of this study are as follows: First, five children (20.0%), especially two of 10 sixth graders (20.0%), could not construct a line graph about a given data table. Second, twenty students (80.0%) had the ability on 'Scaling axes' and on 'Assigning variables to the axes', however, only a student understood why the time is on the longitudinal axis and the temperature is on the vertical axis. Third, in the case of 'Plotting points', twelve children (48.0%) could drew two graphs on a coordinate. Fourth, in the case of 'Selecting the corresponding value for Y (or X)', twenty student had little difficulty. on 'Describing the relationship between variables', seventeen students (68.0%) understood the relationship between time and temperature of water, and the relationship between temperature and amount of water. Finally, eleven students (44%) had the ability on 'Interrelating and extrapolation graphs.' Educational implications are also presented in this paper.

Dense Neural Network Graph-based Point Cloud classification (밀집한 신경망 그래프 기반점운의 분류)

  • El Khazari, Ahmed;lee, Hyo Jong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2019년도 춘계학술발표대회
    • /
    • pp.498-500
    • /
    • 2019
  • Point cloud is a flexible set of points that can provide a scalable geometric representation which can be applied in different computer graphic task. We propose a method based on EdgeConv and densely connected layers to aggregate the features for better classification. Our proposed approach shows significant performance improvement compared to the state-of-the-art deep neural network-based approaches.

Development of Calibration Model for Firmness Evaluation of Apple Fruit using Near-infrared Reflectance Spectroscopy (사과 경도의 비파괴측정을 위한 검량식 개발 및 정확도 향상을 위한 연구)

  • 손미령;조래광
    • Food Science and Preservation
    • /
    • 제6권1호
    • /
    • pp.29-36
    • /
    • 1999
  • Using Fuji apple fruits cultivated in Kyungpook prefecture, the calibration model for firmness evaluation of fruits by near infrared(NIR) reflectance spectroscopy was developed, and the various influence factors such as instrument variety, measuring method, sample group, apple peel and selection of firmness point were investigated. Spectra of sample were recorded in wavelength range of 1100∼2500nm using NIR spectrometer (InfraAlyzer 500), and data were analyzed by stepwise multiple linear regression of IDAS program. The accuracy of calibration model was the highest when using sample group with wide range, and the firmness mean values obtained in graph by texture analyser(TA) were used as standard data. Chemometrics models were developed using a calibration set of 324 samples and an independent validation set of 216 samples to evaluate the predictive ability of the models. The correlation coefficients and standard error of prediction were 0.84 and 0.094kg, respectively. Using developed calibration model, it was possible to monitor the firmness change of fruits during storage frequently. Time, which was reached to firmness high value in graph by TA, is possible to use as new parameter for freshness of fruit surface during storage.

  • PDF