• Title/Summary/Keyword: Graph operation

Search Result 172, Processing Time 0.04 seconds

Computing Reliability Cluster-based in Wireless Distributed Sensor Networks (클러스터 기반의 무선 분산 센서 네트워크에서의 터미널 간 신뢰도 평가)

  • Lee, Jun-Hyuk;Oh, Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.6 no.4
    • /
    • pp.297-306
    • /
    • 2006
  • In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

  • PDF

ON THE NUMBER OF SEMISTAR OPERATIONS OF SOME CLASSES OF PRUFER DOMAINS

  • Mimouni, Abdeslam
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.6
    • /
    • pp.1485-1495
    • /
    • 2019
  • The purpose of this paper is to compute the number of semistar operations of certain classes of finite dimensional $Pr{\ddot{u}}fer$ domains. We prove that ${\mid}SStar(R){\mid}={\mid}Star(R){\mid}+{\mid}Spec(R){\mid}+ {\mid}Idem(R){\mid}$ where Idem(R) is the set of all nonzero idempotent prime ideals of R if and only if R is a $Pr{\ddot{u}}fer$ domain with Y -graph spectrum, that is, R is a $Pr{\ddot{u}}fer$ domain with exactly two maximal ideals M and N and $Spec(R)=\{(0){\varsubsetneq}P_1{\varsubsetneq}{\cdots}{\varsubsetneq}P_{n-1}{\varsubsetneq}M,N{\mid}P_{n-1}{\varsubsetneq}N\}$. We also characterize non-local $Pr{\ddot{u}}fer$ domains R such that ${\mid}SStar(R){\mid}=7$, respectively ${\mid}SStar(R){\mid}=14$.

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

  • Song, Nae Young;Han, Hyuck;Yeom, Heon Young
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.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%.

A Study on the File Allocation in Distributed Computer Systems (분산 컴퓨터 시스템에서 파일 할당에 관한 연구)

  • 홍진표;임재택
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.4
    • /
    • pp.571-579
    • /
    • 1990
  • A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

  • PDF

Understanding Governor Droop of Turbine-Generator through Graph and Proportional Expression (터빈-발전기 Governor Droop의 그래프와 비례식을 통한 특성 고찰)

  • Lee, Sang-Joong
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.27 no.5
    • /
    • pp.33-38
    • /
    • 2013
  • This paper presents a simpler calculation of the generator load sharing according to the change of system frequency and the droop setting of turbine-generator governor. The author firstly draws a graph based on the generator operation at rated MW output and normal frequency, and secondly, builds a proportional expression using the graph in order to obtain the solution in a simpler way rather than using conventional mathematical calculation, to provide the readers with an easier understanding of the droop setting of turbine-generator governor.

Crack detection in concrete slabs by graph-based anomalies calculation

  • Sun, Weifang;Zhou, Yuqing;Xiang, Jiawei;Chen, Binqiang;Feng, Wei
    • Smart Structures and Systems
    • /
    • v.29 no.3
    • /
    • pp.421-431
    • /
    • 2022
  • Concrete slab cracks monitoring of modern high-speed railway is important for safety and reliability of train operation, to prevent catastrophic failure, and to reduce maintenance costs. This paper proposes a curvature filtering improved crack detection method in concrete slabs of high-speed railway via graph-based anomalies calculation. Firstly, large curvature information contained in the images is extracted for the crack identification based on an improved curvature filtering method. Secondly, a graph-based model is developed for the image sub-blocks anomalies calculation where the baseline of the sub-blocks is acquired by crack-free samples. Once the anomaly is large than the acquired baseline, the sub-block is considered as crack-contained block. The experimental results indicate that the proposed method performs better than convolutional neural network method even under different curvature structures and illumination conditions. This work therefore provides a useful tool for concrete slabs crack detection and is broadly applicable to variety of infrastructure systems.

Semantic-based Automatic Open API Composition Algorithm for Easier-to-use Mashups (Easier-to-use 매쉬업을 위한 시맨틱 기반 자동 Open API 조합 알고리즘)

  • Lee, Yong Ju
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.5
    • /
    • pp.359-368
    • /
    • 2013
  • Mashup is a web application that combines several different sources to create new services using Open APIs(Application Program Interfaces). Although the mashup has become very popular over the last few years, there are several challenging issues when combining a large number of APIs into the mashup, especially when composite APIs are manually integrated by mashup developers. This paper proposes a novel algorithm for automatic Open API composition. The proposed algorithm consists of constructing an operation connecting graph and searching composition candidates. We construct an operation connecting graph which is based on the semantic similarity between the inputs and the outputs of Open APIs. We generate directed acyclic graphs (DAGs) that can produce the output satisfying the desired goal. In order to produce the DAGs efficiently, we rapidly filter out APIs that are not useful for the composition. The algorithm is evaluated using a collection of REST and SOAP APIs extracted from ProgrammableWeb.com.

A Study on the Development of Computer Assisted Instruction for the Middle School Mathematics Education - Focused on the graph of quadratic function - (중학교 수학과 CAI 프로그램 개발 연구 -이차함수의 그래프를 중심으로-)

  • 장세민
    • Journal of the Korean School Mathematics Society
    • /
    • v.1 no.1
    • /
    • pp.151-163
    • /
    • 1998
  • In mathematics education, teaching-learning activity can be divided largely into the understanding the mathematical concepts, derivation of principles and laws, acquirement of the mathematical abilities. We utilize various media, teaching tools, audio-visual materials, manufacturing materials for understanding mathematical concepts. But sometimes we cannot define or explain correctly the concepts as well as the derivation of principles and laws by these materials. In order to solve the problem we can use the computer. In this paper, character and movement state of various quadratic function graph types can be used. Using the computers is more visible than other educational instruments like blackboards, O.H.Ps., etc. Then, students understand the mathematical concepts and the correct quadratic function graph correctly. Consquently more effective teaching-learning activity can be done. Usage of computers is the best method for improving the mathematical abilities because computers have functions of the immediate reaction, operation, reference and deduction. One of the important characters of mathematics is accuracy, so we use computers for improving mathematical abilities. This paper is about the program focused on the part of "the quadratic function graph", which exists in mathematical curriculum the middle school. When this program is used for students, it is expected the following educational effect. 1, Students will have positive thought by arousing interests of learning because this program is composed of pictures, animations with effectiveness of sound. 2. This program will cause students to form the mathematical concepts correctly. 3. By visualizing the process of drawing the quadratic function graph, students understand the quadratic function graph structually. 4. Through the feedback, the recognition ability of the trigonometric function can be improved. 5. It is possible to change the teacher-centered instruction into the student-centered instruction. For the purpose of increasing the efficiencies and qualities of mathmatics education, we have to seek the various learning-teaching methods. But considering that no computer can replace the teacher′s role, tearchers have to use the CIA program carefully.

  • PDF

An Inquiry on the Understanding Process of Discrete Mathematics using TI-92 Calculator - Matrix and Graph- (TI-92 계산기를 활용한 이산수학의 이해과정 탐구-「행렬과 그래프」단원을 중심으로-)

  • Kang , Yun-Soo;Lee, Bo-Ra
    • Journal of the Korean School Mathematics Society
    • /
    • v.7 no.2
    • /
    • pp.81-97
    • /
    • 2004
  • This paper is a study on the understanding process of「Matrix and Graph」on discrete mathematics using TI-92 calculator. For this purpose, we investigated the understanding process of two middle school students learning the concepts of matrix and graph using TI-92 calculator. In this process, we collected qualitative data using recorder and video camera. Then we categorized these data as follows: students' attitude related to using technology, understanding process of meaning, expression and operation of matrix and graph, mathematical communication, etc. From this, we have the following conclusions: First, students inquired out the meaning and role of matrix by themselves using calculator. We could see that calculator can do the role of good learning partner to them. Second, students realized their own mistakes when they used calculator on the process of learning matrix. So we found that calculator could form the self-leading learning circumstance on learning matrix. Third, calculators reinforce the mathematical communication in learning matrix and graph. That is, calculator could be a good mediator to reinforce mathematical communication between teacher and students, among students on learning matrix and graph.

  • PDF