• 제목/요약/키워드: time-space partition

검색결과 58건 처리시간 0.022초

Rotationally Invariant Space-Time Trellis Codes with 4-D Rectangular Constellations for High Data Rate Wireless Communications

  • Sterian, Corneliu Eugen D.;Wang, Cheng-Xiang;Johnsen, Ragnar;Patzold, Matthias
    • Journal of Communications and Networks
    • /
    • 제6권3호
    • /
    • pp.258-268
    • /
    • 2004
  • We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

SAF: 디스크 탐색 시간 향상을 위한 파일 시스템 내 스왑 공간 할당 기법 (SAF: A Scheme of Swap Space Allocation in File Systems to Reduce Disk Seek Time)

  • 안우현;김보곤;김병규;오재원
    • 한국정보통신학회논문지
    • /
    • 제15권6호
    • /
    • pp.1289-1300
    • /
    • 2011
  • 최근 고성능 컴퓨터에서 메모리 사용량이 매우 큰 프로그램과 파일 접근을 많이 하는 프로그램을 동시에 실행하고 있다. 많은 메모리의 사용은 디스크의 스왑 공간에 대해 디스크 접근을 빈번히 발생시키고, 파일 접근은 디스크의 파일 시스템 파티션으로 디스크 접근을 야기한다. 이런 두 종류의 프로그램을 동시에 실행하면 스왑 공간과 파일 시스템 파티션 간에 디스크 탐색이 빈번히 발생할 수 있다. 이런 문제를 해결하기 위해 본 논문은 SAF 기법을 제안한다. 이 기법은 파일 시스템 파티션에 새롭게 여러 개의 스왑 공간을 배치하고, 이들 공간에 페이지-아웃되는 페이지들을 저장한다. 즉, 페이지들은 가장 최근에 접근한 파일의 디스크 위치에 근접한 스왑 공간에 저장된다. 이 스왑 공간이 기존의 스왑 공간에 비해 최근 접근된 파일의 위치로부터 가까운 거리에 있기 때문에 파일 접근 후 발생하는 디스크 탐색의 시간을 크게 줄일 수 있다. 성능 검증을 위해 BSD기반의 FreeBSD 6.2 운영체제에 SAF를 구현하였고, 5개의 벤치마크를 실행하여 성능을 측정하였다. 성능 측정 결과 SAF는 FreeBSD에 비해 벤치마크의 실행 시간을 약 14%∼42% 감소시켰다.

열린 학습을 위한 초등학교 학습공간 개선에 관한 연구-재래식 교실의 리노베이션 계획을 중심으로- (A Study for Improving the Learning Space of Elementary School for Open Study-Mainly around Renovation Plans for Conventional Classes-)

  • 박효철
    • 한국실내디자인학회논문집
    • /
    • 제12호
    • /
    • pp.33-39
    • /
    • 1997
  • The educational system of Korean elementary schools switches eventually from that of cramming to open study emphasizing student's autonomy and attaching importance to their individuality. Therefore, the purpose of this study is to establish renovational course for conventional classes to practise open education proper to Korean situations at a minimum of expense and time. And the consequence of this study can be summarized as follows : 1) To prepare for various learning activities, a multipurpose space that can be shared by three or four classes is required. 2) Partitions that have divided the existing spaces of unit study must be removed and substituted to a movable partition to make the class variable according to the form of study.

  • PDF

Prefix Cuttings for Packet Classification with Fast Updates

  • Han, Weitao;Yi, Peng;Tian, Le
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1442-1462
    • /
    • 2014
  • Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.

이동 객체의 이동성을 고려한 공간 분할 색인 기법 (A Space Partitioning Based Indexing Scheme Considering, the Mobility of Moving Objects)

  • 복경수;유재수
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제33권5호
    • /
    • pp.495-512
    • /
    • 2006
  • 최근 다양한 응용 분야에서 이동 객체의 현재 위치를 기반으로 미래 위치를 검색하기 위한 필요성이 증가되고 있다. 이와 함께, 대용량의 이동 객체를 빠르게 검색하기 위한 색인 구조의 필요성이 증가되고 있다. 기존에 제안된 색인 구조들은 이동 객체의 위치를 검색하는 과정에서 불필요한 노드의 확장을 유발시켜 검색 성능이 저하되는 문제점이 있다. 이러한 문제점을 해결하기 위해 본 논문에서는 객체의 이동성을 고려한 공간 분할 방식의 색인 구조를 제안한다. 제안하는 색인 구조는 노드의 오버플로우를 처리하기 위해 형제 노드와 병합 분할을 수행하고 형제 노드와 병합을 수행하여 오버플로우를 처리할 수 없을 경우에는 이동성을 고려하여 분할을 수행한다. 제안하는 색인 구조는 분할된 영역들 사이에 겹침 영역이 발생하지 않으며 속도, 이동 객체가 노드의 영역을 벗어나는 시간, 노드의 갱신 시간과 같은 파라미터를 고려하여 분할 위치를 판별한다. 중간 노드에서는 공간 분할 방식의 색인 구조에서 발생하는 연속 분할을 방지하기 위한 분할 위치를 판별한다. 제안하는 색인 구조의 우수성을 입증하기 위해 이동 객체에 대한 검색 성능을 비교 분석한다. 성능 평가 결과 제안하는 색인 구조는 현재 위치 검색에 대해서는 $17%{\sim}264%$ 그리고 미래 위치 검색에 대해서는 $107%{\sim}19l%$ 성능 향상을 나타낸다.

종합병원 병동부 피난환경 개선에 관한 연구 (A Study on the Improvement of the Evacuation in Ward of the General Hospital)

  • 김우석;채철균
    • 한국실내디자인학회논문집
    • /
    • 제15권5호
    • /
    • pp.202-208
    • /
    • 2006
  • The purpose of this study is to suggest architectural planning guideline for the improvement of the evacuation environment in a ward. To suggest of guideline, the problem of irrational domestic criteria is searched according to compare National fire code (NFPA101, Life safety code) with Korea building law. This study includes stairs, corridors and exit door etc. but excludes fire facilities. To verify effectiveness of suggested guideline, egress simulation is run that based on databases according to literature survey. The results of this study could be summarized as follow: Suggested guidelines are subdivision(fire partition), evacuation by elevator, secure useful waiting space of elevator hall and smokeproof enclosures, the corridor is divided by fire or smoke barriers corridor from hazardous room, only wheeled items are arranged in corridors of a ward story. The result of computer simulation for suggested guidelines verify that egress time can be decreased 20% or above.

Building a Fuzzy Model with Transparent Membership Functions through Constrained Evolutionary Optimization

  • Kim, Min-Soeng;Kim, Chang-Hyun;Lee, Ju-Jang
    • International Journal of Control, Automation, and Systems
    • /
    • 제2권3호
    • /
    • pp.298-309
    • /
    • 2004
  • In this paper, a new evolutionary scheme to design a TSK fuzzy model from relevant data is proposed. The identification of the antecedent rule parameters is performed via the evolutionary algorithm with the unique fitness function and the various evolutionary operators, while the identification of the consequent parameters is done using the least square method. The occurrence of the multiple overlapping membership functions, which is a typical feature of unconstrained optimization, is resolved with the help of the proposed fitness function. The proposed algorithm can generate a fuzzy model with transparent membership functions. Through simulations on various problems, the proposed algorithm found a TSK fuzzy model with better accuracy than those found in previous works with transparent partition of input space.

Optimization of Layout Design in an AS/RS for Maximizing its Throughput Rate

  • Yang, M.H.
    • 대한산업공학회지
    • /
    • 제18권2호
    • /
    • pp.109-121
    • /
    • 1992
  • In this paper, we address a layout design problem for determining a K-class-based dedicated storage layout in an automated storage retrieval system. K-class-based dedicated storage employs K zones in which lots from a class of products are stored randomly. Zones form a partition of storage locations. Our objective function is to minimize the expected single command travel time, which is expressed as a set function of space requirements for zones, average demand rates from classes, and one-way travel times from the pickup/deposit station to locations. We construct a heuristic algorithm based on analytical results and a local search method, the methodology deveolped can be used with easily-available data by warehouse planners to improve the throughput capacity of a conventional warehouse as well as an AS/RS.

  • PDF

A TIME-INDEPENDENT CONDITIONAL FOURIER-FEYNMAN TRANSFORM AND CONVOLUTION PRODUCT ON AN ANALOGUE OF WIENER SPACE

  • Cho, Dong Hyun
    • 호남수학학술지
    • /
    • 제35권2호
    • /
    • pp.179-200
    • /
    • 2013
  • Let $C[0,t]$ denote the function space of all real-valued continuous paths on $[0,t]$. Define $X_n:C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ by $Xn(x)=(x(t_0),x(t_1),{\cdots},x(t_n))$, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n$ < $t$ is a partition of $[0,t]$. In the present paper, using a simple formula for the conditional expectation given the conditioning function $X_n$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions which have the form $$f((v_1,x),{\cdots},(v_r,x))\;for\;x{\in}C[0,t]$$, where {$v_1,{\cdots},v_r$} is an orthonormal subset of $L_2[0,t]$ and $f{\in}L_p(\mathbb{R}^r)$. We then investigate several relationships between the conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions.

데이터 전처리를 이용한 다중 모델 퍼지 예측기의 설계 및 응용 (Design of Multiple Model Fuzzy Predictors using Data Preprocessing and its Application)

  • 방영근;이철희
    • 전기학회논문지
    • /
    • 제58권1호
    • /
    • pp.173-180
    • /
    • 2009
  • It is difficult to predict non-stationary or chaotic time series which includes the drift and/or the non-linearity as well as uncertainty. To solve it, we propose an effective prediction method which adopts data preprocessing and multiple model TS fuzzy predictors combined with model selection mechanism. In data preprocessing procedure, the candidates of the optimal difference interval are determined based on the correlation analysis, and corresponding difference data sets are generated in order to use them as predictor input instead of the original ones because the difference data can stabilize the statistical characteristics of those time series and better reveals their implicit properties. Then, TS fuzzy predictors are constructed for multiple model bank, where k-means clustering algorithm is used for fuzzy partition of input space, and the least squares method is applied to parameter identification of fuzzy rules. Among the predictors in the model bank, the one which best minimizes the performance index is selected, and it is used for prediction thereafter. Finally, the error compensation procedure based on correlation analysis is added to improve the prediction accuracy. Some computer simulations are performed to verify the effectiveness of the proposed method.