• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.494-498
• /
• 1996

Three fuzzy input space partitoining methods, which are grid, tree, and scatter method, are mainly used until now. These partition methods represent good performance in the modeling of the linear system and nonlinear system with independent modeling variables. But in the case of the nonlinear system with the coupled modeling variables, there should be many fuzzy rules for acquiring the exact fuzzy model. In this paper, it shows that the fuzzy model is acquired using transformed modeling vector by linear transformation of the modeling vector.

• 전자공학회논문지C
• /
• 제35C권3호
• /
• pp.16-23
• /
• 1998

In this paper, we present a fast and efficient Iterative Improvement Partitioning(IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. The IIP algorithms are very widely used in VLSI circuit partition due to their time efficiency. As the performance of these algorithms depends on choices of moving cell, various methods have been proposed. Specially, Cluster-Removal algorithm by S. Dutt significantly improved partition quality. We indicate the weakness of previous algorithms wjere they used a uniform method for choice of cells during for choice of cells during the improvement. To solve the problem, we propose a new IIP technique that selects the method for choice of cells according to the improvement status and present hybrid bucket structures for easy implementation. The time complexity of proposed algorithm is the same with FM method and the experimental results on ACM/SIGDA benchmark circuits show improvment up to 33-44%, 45%-50% and 10-12% in cutsize over FM, LA-3 and CLIP respectively. Also with less CUP tiem, it outperforms Paraboli and MELO represented constructive-partition methods by about 12% and 24%, respectively.

• 한국정보처리학회논문지
• /
• 제5권8호
• /
• pp.1985-1996
• /
• 1998

본 논문에서는 행렬 또는 벡터 곱셈을 선형 프로세서나 VLIW 시뮬레이터로 분할 및 배치하는 알고리즘을 제안한다. 먼저 입력 행렬이나 벡터를 임의 크기의 프로세서 배열에 배치하는 기법에 대해 논의하고, 문제 크기를 프로세서 배열 크기로 분할하는 알고리즘을 보인다. 이 알고리즘을 VLIW 시뮬레이터 상에서 실행하고 알고리즘의 효율성을 보이도록한다. 그 결과 우리가 설계한 VLIW 시뮬레이터 상에서의 수행이 선형 프로세서 상에서 보다 병렬화 성능이 향상됨을 알 수 있었다.

• 정보보호학회논문지
• /
• 제21권3호
• /
• pp.3-9
• /
• 2011

본 논문에서는 현재 IEEE 802.11i에서 암호화/메시지 인증 표준으로 제안되고 있는 AES-CCM의 효율적인 병렬처리 방법을 제안한다. 특히, 데이터 종속성이 존재하는 메시지 인증 계산을 병렬처리 하기 위해서는 프로세서간 동기화가 필요한데, 멀티코어 프로세서에서는 동기화 구현을 어떻게 하였는지에 따라 매우 다양한 동기화 성능을 제공하고 있다. 본 논문에서는 AES-CCM의 계산 특성과 멀티코어 프로세서의 동기화 성능을 고려하여 전체 수행시간이 최소화될 수 있는 병렬 처리 방법을 비교 분석한다.

• 융합신호처리학회논문지
• /
• 제4권1호
• /
• pp.36-40
• /
• 2003

EZW(Embedded Zerotree Wavelet) 알고리즘이 소개된 이래 일련의 내장형 웨이브렛 코딩 방법들이 제안되어 져왔다. 이들의 하나의 공통된 특징은 EZW 알고리즘의 기본 아이디어를 근간으로 한다는 점이다. 특히 SPIHT(Set Partitioning in Hierarchy Trees) 알고리즘은 이들 중의 하나로서 산술 코더를 사용하지 않더라도 EZW와 같거나 혹은 더 나은 성능을 제공할 수 있기 때문에 널리 알려져 왔다. 이러한 SPIHT 알고리즘은 계산적으로 단순하면서도 뛰어난 수치적, 시각적 결과를 제공한다. 그러나 SPIHT 알고리즘의 처리 시간복잡도(time complexity)에 대한 평가는 상대적인 비교를 통해 효과적임을 실험적으로 확인한 것에 불과하고 지금까지 엄밀한 시간복잡도 해석이 행하여지지 않았다. 본 연구에서는 SPIHT 알고리즘의 처리 시간복잡도를 해석하고 한 비트평면 처리에 대한 최악의 경우(worst case) 시간복잡도가 O(nlog$_2$n)임을 증명한다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권6호
• /
• pp.808-816
• /
• 2016

As the number of CPU/GPU cores and IPs in SOC increases and applications require explosive memory bandwidth, simultaneously achieving good throughput and fairness in the memory system among interfering applications is very challenging. Recent works proposed priority-based thread scheduling and channel partitioning to improve throughput and fairness. However, combining these different approaches leads to performance and fairness degradation. In this paper, we analyze the problems incurred when combining priority-based scheduling and channel partitioning and propose dynamic priority thread scheduling and adaptive channel partitioning method. In addition, we propose dynamic address mapping to further optimize the proposed scheme. Combining proposed methods could enhance weighted speedup and fairness for memory intensive applications by 4.2% and 10.2% over TCM or by 19.7% and 19.9% over FR-FCFS on average whereas the proposed scheme requires space less than TCM by 8%.

• Asian Pacific Journal of Cancer Prevention
• /
• 제16권13호
• /
• pp.5401-5406
• /
• 2015

Background: Brain metastases are the most common intra-cranial neoplasms. The incidence is on a rise due to advanced imaging techniques. Aims: The objective of the study was to analyse the clinical and demographic profile of patients with brain metastases from primary solid tumors. Materials and Methods: This is a retrospective single institutional study covering 130 consecutive patients with brain metastases from January 2007 to August 2014. Results: Some 64.6% of the patients were females. The majority were in the sixth decade of life. The site of the primary tumor was the lungs in 50.8% of the cases. The overall median time from the diagnosis of the primary malignancy to detection of brain metastases was 21.4 months. Survival was found to be significantly improved in patients with solitary brain lesions when compared to patients with multiple brain metastases, and in patients undergoing surgical excision with or without cranial irradiation when compared to whole brain irradiation alone. The majority of the cases belonged to the recursive partitioning analysis class II group. Whole brain radiation therapy was delivered to 79% of the patients. Conclusions: Most of the patients with brain metastases in the study belonged to recursive partitioning analysis classes II or III, and hence had poor prognosis. Most of the patients in the Indian context either do not satisfy the indications for surgical excision or are incapable of bearing the high cost associated with stereotactic radiosurgery. Treatment should be tailored on an individual basis to all these patients.

• 한국통신학회논문지
• /
• 제37권8B호
• /
• pp.677-686
• /
• 2012

In the presence of a high power cellular network, picocells are added to a Macro-cell layout aiming to enhance total system throughput from cell-splitting. While because of the different transmission power between macrocell and picocell, and co-channel interference challenges between the existing macrocell and the new low power node-picocell, these problems result in no substantive improvement to total system effective throughput. Some works have investigated on these problems. Pico Cell Range Expansion (CRE) technique tries to employ some methods (such as adding a bias for Pico cell RSRP) to drive to offload some UEs to camp on picocells. In this work, we propose two solution schemes (including cell selection method, channel allocation and serving process) and combine new adaptive frequency partitioning reuse scheme to improve the total system throughput. In the simulation, we evaluate the performances of heterogeneous networks for downlink transmission in terms of channel utilization per cell (pico and macro), call blocking probability, outage probability and effective throughput. The simulation results show that the call blocking probability and outage probability are reduced remarkably and the throughput is increased effectively.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2020년도 학술발표회
• /
• pp.115-115
• /
• 2020

Water network partitioning (WNP) is an initiative technique to divide the original water distribution network (WDN) into several sub-networks with only sparse connections between them called, District Metered Areas (DMAs). Operating and managing (O&M) WDN through DMAs is bringing many advantages, such as quantification and detection of water leakage, uniform pressure management, isolation from chemical contamination. The research of WNP recently has been highlighted by applying different methods for dividing a network into a specified number of DMAs. However, it is an open question on how to determine the optimal number of DMAs for a given network. In this study, we present a method to divide an original WDN into DMAs (called Clustering) based on community structure algorithm for auto-creation of suitable DMAs. To that aim, many hydraulic properties are taken into consideration to form the appropriate DMAs, in which each DMA is controlled as uniform as possible in terms of pressure, elevation, and water demand. In a second phase, called Sectorization, the flow meters and control valves are optimally placed to divide the DMAs, while minimizing the pressure reduction. To comprehensively evaluate the WNP performance and determine optimal number of DMAs for given WDN, we apply the framework of multiple-criteria decision analysis. The proposed method is demonstrated using a real-life benchmark network and obtained permissible results. The approach is a decision-support scheme for water utilities to make optimal decisions when designing the DMAs of their WDNs.

• KIEAE Journal
• /
• 제11권6호
• /
• pp.95-100
• /
• 2011

Although Space Syntax is a well-known technique for spatial analysis, debates have taken place among some researchers because the Space Syntax discards geometric information as both shapes and sizes of spaces, and hence may cause some inconsistencies. Therefore, this study aims at developing methods to recognize and manage spatial shapes for more precise space syntax analysis. To reach this goal, this study employed both a graph theory and binary spatial partitioning (BSP) tree to recognize and manage spatial information. As a result, spatial shapes and sizes could be recognized by checking loops in graph converted from spatial shapes of built environment. Each spatial shape could be managed sequentially by BSP tree with hierarchical structure. Through such recognition and management processes, convex maps composed of the fattest and fewest convex spaces could be drawn. In conclusion, we hope that the methods developed here will be useful for urban planning to find appropriate purposes of spaces to satisfy the sustainability of built environment on the basis of the spatial and social relationships in urban spaces.