• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.302-305
• /
• 2003

3GPP RLC protocol specification adopted an error control scheme based on selective repeat ARQ. In the 3GPP ARQ, distinctive windows are provided at transmitting and receiving stations so that those stations are prohibited to send or receive data PDU's out of window. An increase in window size enhances delay performance. Such an increase, however, raises the occupancy at re-ordering buffer, which results in a long re-ordering time. Aiming at suppressing the occupancy at re-ordering buffer, we propose partial go back N scheme in this paper In the partial go back N scheme, the receiving station regards all data PDU's between the first (lowest sequence numbered) error-detected PDU and last (highest sequence numbered) error-detected PDU. By the employment of the partial go back N scheme, the occupancy at the re-ordering buffer is apparently reduced, while the delay and throughput performance may be degraded due to the remaining properties of go back N. We thus consider peak occupancy of re-ordering buffer, mean sojourn time at re-ordering buffer, mean delay time, and maximum throughput as measures to evaluate tile proposed scheme and investigate such performance by using a simulation method. From numerical examples, we observe a trade-off among performance measures and conclude that the partial go back N scheme is able to effectively reduce the occupancy of re-ordering buffer.

• The Korean Journal of Ceramics
• /
• v.2 no.3
• /
• pp.157-161
• /
• 1996

Cry structures of $Na_xWO_3$ (0.5$\leq$x$\leq$1.0) were investigated. Transmission electron microscopy (TEM) studies indicate that there is an ordering of sodium ions when x=0.75. The direction of ordering is [110] and the wavelength of ordering is twice of the interplanar distance of (110) plane. It has been confirmed that a superlattice containing eight $Na_{0.75}WO_3$ is the unit cell of ordered structure. In this unit cell, Na sites at (000) and ($\frac{2}{1}\frac{2}{1}\frac{2}{1}$) are vacant. The ordered phase was preserved after the annealing at $600^{\circ}C$ in the air. In reduced $Na_xWO_3$ with x=0.5 and 1.0, extra phases were found with the partially ordered perovskite phase. After annealing at $600^{\circ}C$, theses phases transformed to the phases found in calcined specimens.

• Journal of the Korean Ceramic Society
• /
• v.37 no.5
• /
• pp.491-496
• /
• 2000

Single phae Pb(Mg1/3Nb2/3)O3-based solid solutions, the Mg2+ of which are replaced by 20mol% of Ni2+, Zn2+, Cd2+, and the Pb2+ of which are replaced by 0∼20 mol% of La3+, were synthesized and their ordering structures of B-site cations were investigated by XRD and TEM. The B'-site cations (Mg2+, Ni2+, Zn2+, Cd2+) are disordered while these B'-site cations and the B"-site cations (Nb5+) are nonstoichiometrically 1:1 ordered within the ordered nano-domains dispersed in the Nb5+-rich disordered matrix. The charge imbalance between the B'-rich ordered nano-domains and the B"-rich disordered matrix are compensated by the doping of electron donor such as La3+, which enhances the degree of nonstoichiometric 1:1 ordering. For a given La3+ content, the degree of nonstoichiometric 1:1 ordering increases as the average ionic size difference between the B'-and B"-site cations increases, Ni2+

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.10
• /
• pp.615-619
• /
• 2005

Token coherence protocol has many good reasons against snooping/directory-based protocol in terms of latency, bandwidth, and complexity. Token counting easily maintains correctness of the protocol without global ordering of request which is basis of other dominant cache coherence protocols. But this lack of global ordering causes starvation which is not happening in snooping/directory-based protocols. Token coherence protocol solves this problem by providing an emergency mechanism called persistent request. It enforces other processors in the competition (or accessing same shared memory block, to give up their tokens to feed a starving processor. However, as the number of processors grows in a system, the frequency of starvation occurrence increases. In other words, the situation where persistent request occurs becomes too frequent to be emergent. As the frequency of persistent requests increases, not only the cost of each persistent matters since it is based on broadcasting to all processors, but also the increased traffic of persistent requests will saturate the bandwidth of multiprocessor interconnection network. This paper proposes a new request mechanism that defines order of requests to reduce occurrence of persistent requests. This ordering mechanism has been designed to be decentralized since centralized mechanism in both snooping-based protocol and directory-based protocol is one of primary reasons why token coherence protocol has advantage in terms of latency and bandwidth against these two dominant Protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.494-507
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in 8 ${\times}$ 8 MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi's scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In 4 ${\times}$ 4 MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.02a
• /
• pp.204-204
• /
• 2012

Peierls instability and spin ordering of zigzag graphene nanoribbons (GNR) created on a fully hydrogenated graphene (graphane) are investigated as a function of their width using first-principles density-functional calculations within the generalized-gradient approximation. For the width containing a single zigzag C chain (N=1), we find the presence of a Peierls instability with a bond alternated structure. However, for width greater than N=1, the Peierls distortion is weakened or disappears because of the incommensurate feature of Fermi surface nesting due to the interaction of C chains. Instead, there exists the antiferromagnetic (AFM) spin ordering in which the edge states are ferromagnetically ordered but the two ferromagnetic (FM) edges are antiferromagnetically coupled with each other, showing that electron-lattice coupling and spin ordering in GNR are delicately competing at an extremely thin width of N=2. It is found that, as the width of GNR increases, the energy gain arising from spin ordering is enhanced, but the energy difference between the AFM and FM (where two edge states are ferromagnetically coupled with each other) orderings decreases.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.330-343
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in $8{\times}8$ MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi’s scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In $4{\times}4$ MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• Korea Trade Review
• /
• v.44 no.6
• /
• pp.151-168
• /
• 2019

This study aims to investigate the determinants that can influence customer satisfaction and loyalty. Compared to some of the determinants that have been investigated by other scholars before, this study also includes a new approach to mobile food-ordering that has only appeared within the Chinese fast-food industry in recent years. It is very important to test if the convenience of mobile ordering services can influence customer satisfaction, as more and more customers are using mobile apps to order food, especially in the 4th Industrial Revolution Era. Research data mostly was collected from customers who visited one of five famous Western fast-food restaurants (KFC, McDonald's, Pizza Hut, Subway, and Burger King) in China. The results show that not only price, service quality, food quality, and the physical environment can significantly affect customer satisfaction but also the convenience of mobile ordering services, a new determinant accompanied by the fast development of IoT technology.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.313-327
• /
• 1995

This paper deals with ordering policies for a multi-echelon distribution system. The system we are concerned consists of one Central Distribution Center(CDC) and N nonidentical Regional Distribution Centers(RDCs) which have different demand rates, minimum filtrates, leadtimes, etc. We develop an algorithm for determining the optimal ordering policies of the CDC and the RDCs under the constraints of minimum filtrates of RDCs and maximum allowable delay of CDC.