• Journal of the military operations research society of Korea
• /
• v.10 no.2
• /
• pp.75-83
• /
• 1984

Consider an m machine flow shop with blocking. The processing time of job j,j=1,..., n on each one of the m machines is equal to the same random variable $X_j$ and is distributed according to $F_i$. We assume that the processing times are stochastically ordered, i.e., $F_{1_{-st}}{<}F_{2_{st}}{<}cdots_{-st}{<}F_n$. We show that the sequence 1,3,5,...,n-1,n,n-2,...,6,4,2 when n is even and sequence 1,3,5,...,n-2,n,n-1 ... 6,4,2 when n is odd minimizes the expected makespan and that the sequence 1,...,n minimizes the expected flow time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.146-149
• /
• 1995

A new method for grouping of relevant and equivalent inputs of a logical circuit was proposed by the authors by making use of pseudorandom M-sequence correlation. The authors show in this paper that it is possible to estimate the input grouping from a part of correlation functions when we admit small percentage of error, whereas it is impossible to reduce the data necessary to estimate the grouping by use of the truth table method. For example in case of 30-input logic circuit, the number of correlation functions necessary to calculate can be reducible from 1.07 * 10$^{9}$ to 465.

• 전기의세계
• /
• v.18 no.1
• /
• pp.15-23
• /
• 1969

A lot of recent researches have shown that a Pseudo Random Binary Signal is a quite effective test signal to measure the impulse response of a plant. Generally speaking, however, such a response itself is not satisfactory to determine the appropriate control parameters or control inputs. Here, the author intends to estimate the unknown parameters of the First Order Plant with Dead Time by means of correlation method using M-sequence signal. The time constant T and the dead time L of the plant are eatimated with one tracking loop by automatically adjusting delay time .tau. of M-sequence signal according to variations of T and L. In this paper, a three level M-sequence signal is used as a test signal in order to avoid troublesome operations to calculate partial derivatives of a given performance index with respect to the parameters which are usually required in the Model Method. Several experiments with analogue computer using low pass filters as averaging circuits showed good results as expected.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.195-196
• /
• 2006

Frame synchronization is an critical factor for an effective operation of OFDM (orthogonal frequency division multiplexing) based communication systems. In this paper, we present and analyze an efficient frame synchronization method based on m-sequence for OFDM-based mobile multimedia communication systems. The cyclic extension preceding OFDM frames is of decisive importance for this method. The m-sequence is added directly to cyclic extension signal in the time domain. By utilizing the autocorrelation characteristics of m-sequence, efficient frame synchronization can be achieved. And we also consider frequency offset estimation simultaneously. The proposed frame synchronization method can be applied to the OFDM-based mobile multimedia communication systems.

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.657-668
• /
• 2022

In the present paper we introduce and study Euler sequence spaces of fractional difference and backward difference operators. We make an effort to prove that these spaces are BK-spaces and linearly isomorphic. Further, Schauder basis for Euler fractional difference sequence spaces $e^{\varsigma}_{0,p}({\Delta}^{(\tilde{\beta})},\;{\nabla}^m)$ and $e^{\varsigma}_{c,p}({\Delta}^{(\tilde{\beta})},\;{\nabla}^m)$ are also elaborate. In addition to this, we determine the 𝛼-, 𝛽- and 𝛾- duals of these spaces.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1379-1410
• /
• 2017

Kang and Ko introduced a skew-symmetrizable matrix to describe a structure theorem for complete intersections of grade 4. Let $R=k[w_0,\;w_1,\;w_2,\;{\ldots},\;w_m]$ be the polynomial ring over an algebraically closed field k with indetermiantes $w_l$ and deg $w_l=1$, and $I_i$ a homogeneous perfect ideal of grade 3 with type $t_i$ defined by a skew-symmetrizable matrix $G_i(1{\leq}t_i{\leq}4)$. We show that for m = 2 the Hilbert function of the zero dimensional standard k-algebra $R/I_i$ is determined by CI-sequences and a Gorenstein sequence. As an application of this result we show that for i = 1, 2, 3 and for m = 3 a Gorenstein sequence $h(R/H_i)=(1,\;4,\;h_2,\;{\ldots},\;h_s)$ is unimodal, where $H_i$ is the sum of homogeneous perfect ideals $I_i$ and $J_i$ which are geometrically linked by a homogeneous regular sequence z in $I_i{\cap}J_i$.

• Journal of Life Science
• /
• v.10 no.4
• /
• pp.422-430
• /
• 2000

In order to search for the effects of Shine-Dalgarno (SD) sequence and nucleotide sequence of spacer region (SD-ATG) on bGH expression, oligonucleotides containing random SD sequences and a spacer region were chemically synthesized. The distance between SD region and initiation codon (ATG) was fixed to 9 nucleotides in length. The expression vectors have been constructed using pT7-1 vector containing a T7 promoter. Positive clones were screened with colony hybridization and named pT7A or pT7B plasmid series. The selected clones were confirmed by DNA sequencing and finally, 19 clones having various SD combinations were obtained. When bovine growth hormone was induced by IPTG in E. coli BL21(DE3), all cells harboring these plasmids produced a detectable level of bGH in western blot analysis. However, various SD sequences did not affect on bGH expression, indicating that the sequences of SD and the spacer region did not sufficiently destabilize mRNA secondary structure of bGH gene. Therefore, these results indicate that the disruption of mRNA secondary structure might be a major factor for regulating bGH expression in the translational initiation process.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.181-186
• /
• 2008

Wireless data transmission is vulnerable to attackers and hackers. Recently, the fast development of wireless communication systems seamlessly increase the demand for security in this area. Moreover, error correction is especially important because various kinds of interferences among wireless devices. In order to solve two above problems, we propose to apply MCC (M-sequence Convolutional Code) in the system which is able to protect information and correct errors. The proposed system can obtain higher secure property by randomly changing the output connections by the proposed M-sequence. Performance of the system is analyzed according to BER (Bit Error Rate) and secure levels. The simulation results revealed that we can get the coding gain of 0.1 dB over conventional convolution coding technique. The proposed algorithm is installed in physical layer and easily implemented. Another advantage of our proposed (M-sequence and convolutional code) is that it can be applied to CDMA (Code Division Multiple Access) communication system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.816-829
• /
• 2003

In this paper, we evaluate the performance of PN (Pseudo Noise) code based time hopping sequences for M-ary UWB (Ultra Wide Band) multiple access systems using the equicorrelated signal sets. In particular, we consider two different types of M-ary UWB systems in UWB indoor wireless multipath channels: The first type of the systems (System #1) has identical symbol transmission rate regardless of the number of symbols M since the length of signal pulse train is fixed while M increases, and the second type of the systems (System #2) has the same bit transmission rate regardless of M since the length of signal pulse train is extended according to the increase of M. We compare the proposed systems with those using the ideal random time hopping sequence in terms of the symbol error rate performance. Simulation results show that the PN code based time hopping sequence achieves quite good performance which is favorably comparable to that of the ideal random sequence. Moreover, as M increases, we observe that System #2 shows better robustness against multiple access interference than System # 1.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1566-1573
• /
• 2021

Rendezvous is a process that assists nodes in a Cognitive Radio Networks (CRNs) to discover each other. In CRNs where a common control channel is unknown and a number of channels are given, it is important how two nodes find each other in a known search region. In this paper, I have proposed and analyzed a channel hopping sequence using Sidel'nikov sequence by which each node visits an available number of channels. I analyze the expected time to-rendezvous (TTR) mathematically. I also verify the Rendezvous performance of proposed sequence in the view of TTR under 2 user environment compared with JS algorithm and GOS algorithm. The Rendezvous performance of proposed sequence is much better than GOS algorithm and similar with JS algorithm. But when M is much smaller than p, the performance of proposed sequence is better than JS algorithm.