• Annals of Clinical Neurophysiology
• /
• v.22 no.2
• /
• pp.82-91
• /
• 2020

Electroencephalography (EEG) produces time-series data of neural oscillations in the brain, and is one of the most commonly used methods for investigating both normal brain functions and brain disorders. Quantitative EEG analysis enables identification of frequencies and brain activity that are activated or impaired. With studies on the structural and functional networks of the brain, the concept of the brain as a complex network has been fundamental to understand normal brain functions and the pathophysiology of various neurological disorders. Functional connectivity is a measure of neural synchrony in the brain network that refers to the statistical interdependency between neural oscillations over time. In this review, we first discuss the basic methods of EEG analysis, including preprocessing, spectral analysis, and functional-connectivity and graph-theory measures. We then review previous EEG studies of brain network characterization in several neurological disorders, including epilepsy, Alzheimer's disease, dementia with Lewy bodies, and idiopathic rapid eye movement sleep behavior disorder. Identifying the EEG-based network characteristics might improve the understanding of disease processes and aid the development of novel therapeutic approaches for various neurological disorders.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.311-315
• /
• 1987

In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.141-156
• /
• 2010

Despite all attempts to prevent fraud, it continues to be a major threat to industry and government. Traditionally, organizations have focused on fraud prevention rather than detection, to combat fraud. In this paper we present a role mining inspired approach to represent user behaviour in Enterprise Resource Planning (ERP) systems, primarily aimed at detecting opportunities to commit fraud or potentially suspicious activities. We have adapted an approach which uses set theory to create transaction profiles based on analysis of user activity records. Based on these transaction profiles, we propose a set of (1) anomaly types to detect potentially suspicious user behaviour, and (2) scenarios to identify inadequate segregation of duties in an ERP environment. In addition, we present two algorithms to construct a directed acyclic graph to represent relationships between transaction profiles. Experiments were conducted using a real dataset obtained from a teaching environment and a demonstration dataset, both using SAP R/3, presently the predominant ERP system. The results of this empirical research demonstrate the effectiveness of the proposed approach.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1258-1263
• /
• 1999

본 논문에서는 CRCW(Concurrent Read Concurrent Write)와 CREW(Concurrent Read Exclusive Write) PRAM(Parallel Random Access Machine) 모델에서 무방향성 그래프 G=(V, E)의 극대 매칭을 구하기 위해 간결한 랜덤 병렬 알고리즘을 제안한다. CRCW PRAM 모델에서 m개의 선을 가진 그래프에 대해, 제안된 매칭 알고리즘은 m개의 프로세서 상에서 {{{{ OMICRON (log m)의 기대 수행 시간을 가진다. 또한 CRCW 알고리즘을 CREW PRAM 모델에서 구현한 CREW 알고리즘은 OMICRON (log^2 m)의 기대 수행 시간을 가지지만,OMICRON (m/logm) 개의 프로세서만을 가지고 수행될 수 있다.Abstract This paper presents simple randomized parallel algorithms for finding a maximal matching in an undirected graph G=(V, E) for the CRCW and CREW PRAM models. The algorithm for the CRCW model has {{{{ OMICRON (log m) expected running time using m processors, where m is the number of edges in G We also show that the CRCW algorithm can be implemented on a CREW PRAM. The CREW algorithm runs in {{{{ OMICRON (log^2 m) expected time, but it requires only OMICRON (m / log m) processors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.40-51
• /
• 2009

A paired many-to-many k-disjoint path cover (paired k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants G($cd^m$,d) with $d{\geq}3$ and tori, and show that provided the number of faulty elements (vertices and/or edges) is f or less, every nonbipartite recursive circulant and torus of degree $\delta$ has a paired k-DPC for any f and $k{\geq}1$ with $f+2k{\leq}{\delta}-1$.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.393-398
• /
• 2005

In interconnection networks, a Hamiltonian path has been utilized in many applications such as the implementation of linear array and multicasting. In this paper, we consider the Hamiltonian properties of mesh networks which are used as the topology of parallel machines. If a network is strongly Hamiltonian laceable, the network has the longest path joining arbitrary two nodes. We show that a two-dimensional mesh M(m, n) is strongly Hamiltonian laceabie, if $m{\geq}4,\;n{\geq}4(m{\geq}3,\;n{\geq}3\;respectively)$, and the number of nodes is even(odd respectively). A mesh is a spanning subgraph of many interconnection networks such as tori, hypercubes, k-ary n-cubes, and recursive circulants. Thus, our result can be applied to discover the fault-hamiltonicity of such networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.426-431
• /
• 2005

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.9-23
• /
• 1999

병렬 그래프 감축 모델에 있어서 투기적 연산(speculative evaluation)모델은 병렬성을 증가시키지만 불필요한 연산으로 인해 자원을 낭비할 수 있다. 투기적 태스크가 람다 연산식을 WHNF(Weak Head Normal Form)로 감축할 때, 대치과정은 그래프를 증가시킬 수 있고, 많은 복사과정을 요구할 수 있다. 이러한 투기적 태스크는 나중에 불필요한 연산이 될 수있고 이 경우 이러한 투기적 태스크에서 발생한 다른 모든 투기적 태스크들을 종료해야 하는 부담이 있다. 또한 불필요하게 된 복사과정으로 인한 기억 공간을 재사용이 가능한 상태로 만들어 주어야 한다. 본 논문은 WHNF 또는 HNF 로 감축할 대 발생할수 있는 불필요한 대치과정으로 인한 오버헤드를 줄이기 위해 대치과정이 지연된 람다 연산식 형태 (DSF : Deferred Substitution Form)를 제안한다. 이 형태는 대치과정을 필수적 태스크(mandatory task)가 수행될 때 까지 지연시키기 위한 람다 연산식 형태이다. 대치과정이 지연된 람다 연산식 형태로의 감축을 수행하는 투기적 태스크에서 , 대치과정이 존재하지 않기 때문에 그래프의 크기가 증가하지 않고 또한 복사과정을 요구하지 않는다. 따라서 연산식에 대한 대치과정이 지연된 람다 연산식 형태로의 감축이 불필요하게 된 경우 부담이 줄어들게 된다. 아울러 병렬성을 증가시키기 위한 연산모델을 제안한다.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.11
• /
• pp.24-34
• /
• 2019

An automotive automatic transmission is a popular power-transmitting device in passenger vehicles, as it provides various speed ratios for diverse driving conditions with easy manipulation and smooth gear shifting. The transmission is mainly composed of input and output shafts, planetary gear sets, brakes/clutches, and housing, and it yields multiple forward gears and one reverse gear by actuating the shifting devices of the brakes and clutches. In developing a new transmission, kinematic configurations of a transmission, which presents a brief structure and actuation schemes for speed ratios, need to be checked to determine if the structure can be assembled in a layout. It is impossible for a transmission concept having any interference in connecting main components to be developed further in the design process, since connection interference leads to failure of a layout design in the 2-D plane. In this research, an analysis of the assemblability of a front-wheel drive automatic transmission is carried out on an example concept design by applying the vertex addition algorithm based on graph theory.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.253-259
• /
• 2019

The wedding seating problem(WSP) is to finding a minimum loss of guest relations(sit together preference) with restricted seats of a table for complex guest relation network. The WSP is NP-hard because of the algorithm that can be find the optimal solution within polynomial-time is unknown yet. Therefore we can't solve the WSP not computer-assisted programming but by hand. This paper suggests min-cut rule theory that the two guests with maximum preference can't separate in other two tables because this is not obtains minimum loss of preference. As a result of various experimental, this algorithm obtains proper seating chart meet to the seats of a table constraints.