• Title/Summary/Keyword: data partition

Search Result 415, Processing Time 0.035 seconds

Design and Performance Analysis of the SPW Method for PAPR Reduction in OFDM System (OFDM 시스템에서 PAPR 처감을 위한 SPW 방식의 설계와 성능 분석)

  • 이재은;유흥균;정영호;함영권
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.7
    • /
    • pp.677-684
    • /
    • 2003
  • This paper addresses the subblock phase weighting(SPW) method to reduce the PAPR in OFDM system. This method divides the input block of OFDM signal into many subblocks and lower the peak power by weighting the phase of each subblocks properly. SPW method can be realized by only one IFFT. PAPR reduction performance is novelly examined when the adjacent, interleaved and random subblock partitioning schemes are used in the SPW system. The random subblock partition scheme has the most effective. More subblocks can effectively reduce the PAPR, but there is a problem that the processing time of iteration is increased. We propose a new weighting factor combination of the complementary sequence characteristic with threshold technique. OFDM data can be recovered by the inserted side information of weighting factor in the feed forward type. Also, BER performance of this SPW system is analyzed when error happens in the side information.

Design of Optimized Pattern Recognizer by Means of Fuzzy Neural Networks Based on Individual Input Space (개별 입력 공간 기반 퍼지 뉴럴 네트워크에 의한 최적화된 패턴 인식기 설계)

  • Park, Keon-Jun;Kim, Yong-Kab;Kim, Byun-Gon;Hoang, Geun-Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.181-189
    • /
    • 2013
  • In this paper, we introduce the fuzzy neural network based on the individual input space to design the pattern recognizer. The proposed networks configure the network by individually dividing each input space. The premise part of the networks is independently composed of the fuzzy partition of individual input spaces and the consequence part of the networks is represented by polynomial functions. The learning of fuzzy neural networks is realized by adjusting connection weights of the neurons in the consequent part of the fuzzy rules and it follows a back-propagation algorithm. In addition, in order to optimize the parameters of the proposed network, we use real-coded genetic algorithms. Finally, we design the optimized pattern recognizer using the experimental data for pattern recognition.

Bin Packing Algorithm for Equitable Partitioning Problem with Skill Levels (기량수준 동등분할 문제의 상자 채우기 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.209-214
    • /
    • 2020
  • The equitable partitioning problem(EPP) is classified as [0/1] binary skill existence or nonexistence and integer skill levels such as [1,2,3,4,5]. There is well-known a polynomial-time optimal solution finding algorithm for binary skill EPP. On the other hand, tabu search a kind of metaheuristic has apply to integer skill level EPP is due to unknown polynomial-time algorithm for it and this problem is NP-hard. This paper suggests heuristic greedy algorithm with polynomial-time to find the optimal solution for integer skill level EPP. This algorithm descending sorts of skill level frequency for each field and decides the lower bound(LB) that more than the number of group, packing for each group bins first, than the students with less than LB allocates to each bin additionally. As a result of experimental data, this algorithm shows performance improvement than the result of tabu search.

Anthropometry for clothing construction and cluster analysis ( I ) (피복구성학적 인체계측과 집낙구조분석 ( I ))

  • Kim Ku Ja
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.10 no.3
    • /
    • pp.37-48
    • /
    • 1986
  • The purpose of this study was to analyze 'the natural groupings' of subjects in order to classify highly similar somatotype for clothing construction. The sample for the study was drawn randomly out of senior high school boys in Seoul urban area. The sample size was 425 boys between age 16 and 18. Cluster analysis was more concerned with finding the hierarchical structure of subjects by three dimensional distance of stature. bust girth and sleeve length. The groups forming a partition can be subdivided into 5 and 6 sets by the hierarchical tree of the given subjects. Ward's Minimum Variance Method was applied after extraction of distance matrix by the Standardized Euclidean Distance. All of the above data was analyzed by the computer installed at Korea Advanced Institute of Science and Technology. The major findings, take for instance, of 16 age group can be summarized as follows. The results of cluster analysis of this study: 1. Cluster 1 (32 persons means $18.29\%$ of the total) is characterized with smaller bust girth than that of cluster 5, but stature and sleeve length of the cluster 1 are the largest group. 2. Cluster 2 (18 Persons means $10.29\%$ of the total) is characterized with the group of the smallest stature and sleeve length, but bust girth larger than that of cluster 3. 3. Cluster 3(35persons means $20\%$ of the total) is classified with the smallest group of all the stature, bust girth and sleeve length. 4. Cluster 4(60 persons means $34.29\%$ of the total) is grouped with the same value of sleeve length with the mean value of 16 age group, but the stature and bust girth is smaller than the mean value of this age group. 5. Cluster 5(30 persons means $17.14\%$ of the total) is characterized with smaller stature than that of cluster 1, and with larger bust girth than that of cluster 1, but with the same value of the sleeve length with the mean value of the 16 age group.

  • PDF

Design and Evaluation of Flexible Thread Partitioning System (융통성 있는 스레드 분할 시스템 설계와 평가)

  • Jo, Sun-Moon
    • Journal of Internet Computing and Services
    • /
    • v.8 no.3
    • /
    • pp.75-83
    • /
    • 2007
  • Multithreaded model is an effective parallel system in that it can reduce the long memory reference latency time and solve the synchronization problems. When compiling the non-strict functional programs for the multithreaded parallel machine, the most important thing is to find an set of sequentially executable instructions and to partitions them into threads. The existing partitioning algorithm partitions the condition of conditional expression, true expression and false expression into the basic blocks and apply local partitioning to these basic blocks. We can do the better partitioning if we modify the definition of the thread and allow the branching within the thread. The branching within the thread do not reduce the parallelism, do not increase the number of synchronization and do not violate the basic rule of the thread partitioning. On the contrary, it can lengthen the thread and reduce the number of synchronization. In the paper, we enhance the method of the partition of threads by combining the three basic blocks into one of two blocks.

  • PDF

Parallel Spatial Join Method Using Efficient Spatial Relation Partition In Distributed Spatial Database Systems (분산 공간 DBMS에서의 효율적인 공간 릴레이션 분할 기법을 이용한 병렬 공간 죠인 기법)

  • Ko, Ju-Il;Lee, Hwan-Jae;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.4 no.1 s.7
    • /
    • pp.39-46
    • /
    • 2002
  • In distributed spatial database systems, users nay issue a query that joins two relations stored at different sites. The sheer volume and complexity of spatial data bring out expensive CPU and I/O costs during the spatial join processing. This paper shows a new spatial join method which joins two spatial relation in a parallel way. Firstly, the initial join operation is divided into two distinct ones by partitioning one of two participating relations based on the region. This two join operations are assigned to each sites and executed simultaneously. Finally, each intermediate result sets from the two join operations are merged to an ultimate result set. This method reduces the number of spatial objects participating in the spatial operations. It also reduces the scope and the number of scanning spatial indices. And it does not materialize the temporary results by implementing the join algebra operators using the iterator. The performance test shows that this join method can lead to efficient use in terms of buffer and disk by narrowing down the joining region and decreasing the number of spatial objects.

  • PDF

Energy Efficiency and Nutrient Deposition in Early-Weaned Pigs, according to Fat Sources Containing Different Acidic Series

  • Bosi, P.;Jung, H.J.;Han, In K.;Cacciavillani, J.A.;Casini, L.;Mattuzzi, S.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.13 no.7
    • /
    • pp.995-1002
    • /
    • 2000
  • To evaluate energy efficiency and partition of nutrients, 32 piglets were weaned at 14 d of age and individually fed diets containing 15% fat from coconut oil (CO, medium chain saturated), high oleate sunflower oil (HOSO, n-9 series), soybean oil (SO, n-6 series), or linseed oil plus fish oil, (LF, n-3 series). After 4 weeks, the subjects were sacrificed to evaluate empty body composition and apparent ileal digestibility with the slaughter method. No statistical effect of dietary fat sources on growth was observed. The digestibility of fat from the coconut oil diet was higher than fats from the diets containing high levels of unsaturated fatty acids. The efficiency of use of metabolizable energy for growth averaged 63% and was not affected by the diet. Dietary fat composition was reflected strongly in backfat. Total body neutral and polar fatty acids were influenced too. For the whole body phospholipid fraction the ratio of n-6 to n-3 and the double bond index were 4.3, 5.8, 7.2, 0.78 and 69, 87, 89, 87 for CO, HOSO, SO, and LF respectively. These results show that for the coconut oil diet the degree of unsaturation of phospholipids in the body was lower and that, in the other diets, it did not differ, but double bond index was maintained with different n-6 to n-3 ratios in carcass fat. On the whole the data on body fat composition indicate that the dietary fat tended to be deposited in similar quantity in the body, whatever was the dietary fatty acid profile.

In vitro and in vivo pharmacokinetic characterization of LMT-28 as a novel small molecular interleukin-6 inhibitor

  • Ahn, Sung-Hoon;Heo, Tae-Hwe;Jun, Hyun-Sik;Choi, Yongseok
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.33 no.4
    • /
    • pp.670-677
    • /
    • 2020
  • Objective: Interleukin-6 (IL-6) is a T cell-derived B cell stimulating factor which plays an important role in inflammatory diseases. In this study, the pharmacokinetic properties of LMT-28 including physicochemical property, in vitro liver microsomal stability and an in vivo pharmacokinetic study using BALB/c mice were characterized. Methods: LMT-28 has been synthesized and is being developed as a novel therapeutic IL-6 inhibitor. The physicochemical properties and in vitro pharmacokinetic profiles such as liver microsomal stability and Madin-Darby canine kidney (MDCK) cell permeability assay were examined. For in vivo pharmacokinetic studies, pharmacokinetic parameters using BALB/c mice were calculated. Results: The logarithm of the partition coefficient value (LogP; 3.65) and the apparent permeability coefficient values (Papp; 9.7×10-6 cm/s) showed that LMT-28 possesses a moderate-high cell permeability property across MDCK cell monolayers. The plasma protein binding rate of LMT-28 was 92.4% and mostly bound to serum albumin. The metabolic half-life (t1/2) values of LMT-28 were 15.3 min for rat and 21.9 min for human at the concentration 1 μM. The area under the plasma drug concentration-time curve and Cmax after oral administration (5 mg/kg) of LMT-28 were 302±209 h·ng/mL and 137±100 ng/mL, respectively. Conclusion: These data suggest that LMT-28 may have good physicochemical and pharmacokinetic properties and may be a novel oral drug candidate as the first synthetic IL-6 inhibitor to ameliorate mammalian inflammation.

Adaptive Rate-Distortion Optimized Multiple Loop Filtering Algorithm (적응적 율-왜곡 최적 다중 루프 필터 기법)

  • Hong, Soon-Gi;Choe, Yoon-Sik;Kim, Yong-Goo
    • Journal of Broadcast Engineering
    • /
    • v.15 no.5
    • /
    • pp.617-630
    • /
    • 2010
  • At 37th VCEG meeting in Jan. 2009, Toshiba proposed Quadtree-based Adaptive Loop Filter (QALF). The basic concept of QALF is to apply Wiener filter to decoded image after the conventional deblocking filter and to represent the filter on/off flag data for each basic filtering unit in a more efficient way of quadtree structure. QALF could enhance the compression performance of around more than 9%, but the structure of one filter for a decoded frame leaves room for further improvement in the sense that optimal filter for one region of a frame could quite different from the optimal filter for other parts of a picture. This paper proposes multiple adaptive loop filters for better utilization of local characteristics of decoded frame to optimize the region-based Wiener filters. Additional filters, proposed in this paper, cover separate spatial area of each decoded frame according to the performance of previously designed filter(s) to provide the flexibility of rate-distortion based selection of the number of filters.

FUZZY LOGIC KNOWLEDGE SYSTEMS AND ARTIFICIAL NEURAL NETWORKS IN MEDICINE AND BIOLOGY

  • Sanchez, Elie
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.1 no.1
    • /
    • pp.9-25
    • /
    • 1991
  • This tutorial paper has been written for biologists, physicians or beginners in fuzzy sets theory and applications. This field is introduced in the framework of medical diagnosis problems. The paper describes and illustrates with practical examples, a general methodology of special interest in the processing of borderline cases, that allows a graded assignment of diagnoses to patients. A pattern of medical knowledge consists of a tableau with linguistic entries or of fuzzy propositions. Relationships between symptoms and diagnoses are interpreted as labels of fuzzy sets. It is shown how possibility measures (soft matching) can be used and combined to derive diagnoses after measurements on collected data. The concepts and methods are illustrated in a biomedical application on inflammatory protein variations. In the case of poor diagnostic classifications, it is introduced appropriate ponderations, acting on the characterizations of proteins, in order to decrease their relative influence. As a consequence, when pattern matching is achieved, the final ranking of inflammatory syndromes assigned to a given patient might change to better fit the actual classification. Defuzzification of results (i.e. diagnostic groups assigned to patients) is performed as a non fuzzy sets partition issued from a "separating power", and not as the center of gravity method commonly employed in fuzzy control. It is then introduced a model of fuzzy connectionist expert system, in which an artificial neural network is designed to build the knowledge base of an expert system, from training examples (this model can also be used for specifications of rules in fuzzy logic control). Two types of weights are associated with the connections: primary linguistic weights, interpreted as labels of fuzzy sets, and secondary numerical weights. Cell activation is computed through MIN-MAX fuzzy equations of the weights. Learning consists in finding the (numerical) weights and the network topology. This feed forward network is described and illustrated in the same biomedical domain as in the first part.

  • PDF