• ETRI Journal
• /
• v.40 no.6
• /
• pp.699-713
• /
• 2018

Orthogonal frequency division multiplexing (OFDM) has been the overwhelmingly prevalent choice for high-data-rate systems due to its superior advantages compared with other modulation techniques. In contrast, a high peak-to-average-power ratio (PAPR) is considered the fundamental obstacle in OFDM systems since it drives the system to suffer from in-band distortion and out-of-band radiation. The partial transmit sequence (PTS) technique is viewed as one of several strategies that have been suggested to diminish the high PAPR trend. The PTS relies upon dividing an input data sequence into a number of subblocks. Hence, three common types of the subblock segmentation methods have been adopted - interleaving (IL-PTS), adjacent (Ad-PTS), and pseudorandom (PR-PTS). In this study, a new type of subblock division scheme is proposed to improve the PAPR reduction capacity with a low computational complexity. The results indicate that the proposed scheme can enhance the PAPR reduction performance better than the IL-PTS and Ad-PTS schemes. Additionally, the computational complexity of the proposed scheme is lower than that of the PR-PTS and Ad-PTS schemes.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.513-528
• /
• 1997

A sort sequence $S_n$ is a sequence of all unordered pairs of indices in $I_n\;=\;{1,\;2,v...,\;n}$. With a sort sequence Sn we assicuate a sorting algorithm ($AS_n$) to sort input set $X\;=\;{x_1,\;x_2,\;...,\;x_n}$ as follows. An execution of the algorithm performs pairwise comparisons of elements in the input set X as defined by the sort sequence $S_n$, except that the comparisons whose outcomes can be inferred from the outcomes of the previous comparisons are not performed. Let $X(S_n)$ denote the acverage number of comparisons required by the algorithm $AS_n$ assuming all input orderings are equally likely. Let $X^{\ast}(n)\;and\;X^{\circ}(n)$ denote the minimum and maximum value respectively of $X(S_n)$ over all sort sequences $S_n$. Exact determination of $X^{\ast}(n),\;X^{\circ}(n)$ and associated extremal sort sequenes seems difficult. Here, we obtain bounds on $X^{\ast}(n)\;and\;X^{\circ}(n)$.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.71-85
• /
• 2001

This paper considers a cost model for a U-shaped manufacturing cell formation which incorporates a required number of machines and various material flows together under multi-part multi-cell environment. The model is required to satisfy both the specified operation sequence of each part and the total part demand volume, which are considered to derive material handling cost in U-shaped flow line cells. In the model several cost-incurring factors including set-up for batch change-over, processing time for operations of each part, and machine failures are also considered in association with processing load and capacity of each cell. Moreover, a heuristic for a good machine layout in each cell is newly proposed based on the material handling cost of each alternative sequence layout. These all are put together to present an efficient heuristic for the U-shaped independent-cell formation problem, numerical problems are solved to illustrate the algorithm.

• International Journal of Contents
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2016

To manipulate large video contents, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-wise user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm that extracts key frames using color histograms and matches the video sequences using edge features. To effectively match video sequences with a low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with real sequence show that the proposed video sequence matching algorithm using edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1188-1190
• /
• 1987

Recently, new fast transform (such as discrete Hartley Transform) have been proposed which are best suited for the computation of real sequence. Two approaches using Fourier or Hartley transform are first compared. This paper is treated real sequence, compared number of addition of cyclic convolution with using the FFT and FHT the convolution technique is defined as a separating system impulse response to the given input and output of the system.

• Advances in concrete construction
• /
• v.4 no.3
• /
• pp.173-194
• /
• 2016

This paper consists in a study of a new contructive sequence of road viaducts with Movable Scaffolding System (MSS) using numerical tools based on finite element method (FEM). Traditional and new sequences are being used in Spain to build viaducts with MSS. The new sequence permits an easier construction of one span per week but implies some other issues related to the need of two prestressing stages per span. In order to improve the efficiency of the new sequence by reducing the number of prestressing stages per span, two solutions are suggested in this study. Results show that the best solution is to introduce the 100% of the prestressing force at the self-supporting core in order to improve the road viaduct construction with movable scaffolding system by reducing execution time without increasing economic costs.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.1017-1025
• /
• 2011

In this paper, we survey various notions and results related to statistical convergence of a sequence of fuzzy numbers, in which statistical convergence for fuzzy numbers was first introduced by Nuray and Savas in 1995. We will go over boundedness, convergence of sequences of fuzzy numbers, statistically convergence and statistically Cauchy sequences of fuzzy numbers, statistical limit and cluster point for sequences of fuzzy numbers, statistical mono-tonicity and boundedness of a sequence of fuzzy numbers and finally statistical limit inferior and limit inferior for the statistically bounded sequences of fuzzy numbers.

• Proceedings of the KSMRM Conference
• /
• 2003.10a
• /
• pp.22-22
• /
• 2003

The purpose of this study was to compare the detection rate of brain metastasis according to size of nodule between 1.5T and 3.0T MRI 대상 및 방법： We reviewed 44 patients with primary tumors and clinical symptoms suggesting brain metastasis. After administration of double dose gadolinium-DTPA, MR imaging was performed with 3D SPGR sequence by 3.0T MRI and then with T1 SE sequence by 1.5T MRI. Consequently, comparison was done in 1.5T T1 SE sequence and 3.0T 3D SPGR sequence. With use of the signal intensity (SI) measurements in the metastatic nodules and adjacent tissue, metastatic nodule-to-adjacent tissue SI ratio were calculated. In each patient, the number of metastatic lesions detected in 1.5T and 3.0T, and their size were assessed qualitatively by three blinded readers.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.237-241
• /
• 2002

In this paper, we describe how to represent hand witten decimal digits by a sequence of one to five fuzzy sets. Each fuzzy set represents an arc segment of the digit and is a Cartesian product of four fuzzy sets; the first is fur the arc length of the segment, the second is for the arc direction, the third is fur the arc shape, and the fourth is a crisp number indicating whether it has a junction point and if it has an end point of a stroke. We show that an arbitrary pair of these sequences representing two different digits is mutually disjoint. We also show that various forms of a digit written in different styles can be represented by the same sequence of fuzzy sets and hence the deviations due to different writers can be modeled by using these fuzzy sets.

• Journal of Industrial Technology
• /
• v.25 no.A
• /
• pp.163-173
• /
• 2005

Recent sequential pattern mining algorithms mine all of the frequent sequences satisfying a minimum support threshold in a large database. However, when a frequent sequence becomes very long, such mining will generate an explosive number of frequent sequence, which is prohibitively expensive in time. In this paper, we proposed a novel sequential pattern algorithm using only closed frequent sequences which are small subset of very large frequent sequences. Our algorithm extends the sequence by depth-first search strategy with effective pruning. Using bitmap representation of underlying databases, we can obtain a closed frequent sequence considerably faster than the currently reported methods.