• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.732-743
• /
• 2008

In H.264/AVC, 4$\times$4 block transform is used for intra and inter prediction instead of 8$\times$8 block transform. Using small block size coding, H.264/AVC obtains high temporal prediction efficiency, however, it has limitation in utilizing spatial redundancy. Motivated on these points, we propose a multi-dimensional transform which achieves both the accuracy of temporal prediction as well as effective use of spatial redundancy. From preliminary experiments, the proposed multi-dimensional transform achieves higher energy compaction than 2-D DCT used in H.264. We designed an integer-based transform and quantization coder for multi-dimensional coder. Moreover, several additional methods for multi-dimensional coder are proposed, which are cube forming, scan order, mode decision and updating parameters. The Context-based Adaptive Variable-Length Coding (CAVLC) used in H.264 was employed for the entropy coder. Simulation results show that the performance of the multi-dimensional codec appears similar to that of H.264 in lower bit rates although the rate-distortion curves of the multi-dimensional DCT measured by entropy and the number of non-zero coefficients show remarkably higher performance than those of H.264/AVC. This implies that more efficient entropy coder optimized to the statistics of multi-dimensional DCT coefficients and rate-distortion operation are needed to take full advantage of the multi-dimensional DCT. There remains many issues and future works about multi-dimensional coder to improve coding efficiency over H.264/AVC.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.669-676
• /
• 2013

Let $a$ and $b$ be two even integers with $2{\leq}a<b$, and let k be a nonnegative integer. Let G be a graph of order $n$ with $n{\geq}\frac{(a+b-1)(a+b-2)+bk-2}{b}$. A graph G is called an ($a,b,k$)-critical graph if after deleting any $k$ vertices of G the remaining graph of G has an [$a,b$]-factor. In this paper, it is proved that G is an ($a,b,k$)-critical graph if $${\mid}N_G(X){\mid}&gt;\frac{(a-1)n+{\mid}X{\mid}+bk-2}{a+b-1}$$ for every non-empty independent subset X of V (G), and $${\delta}(G)>\frac{(a-1)n+a+b+bk-3}{a+b-1}$$. Furthermore, it is shown that the result in this paper is best possible in some sense.

• Environmental Sciences Bulletin of The Korean Environmental Sciences Society
• /
• v.3 no.2
• /
• pp.81-89
• /
• 1999

This study estimates the correlation dimensions of the land-sea breeze phenomenon, that has a clear diurnal cycle, in order to gain a more detailed understanding of this phenomenon. The data adopted include north-south wind velocity component(v) and temperature(T) time series that were observed at Kimhae Airport and Inje University over a period of 5 days, from the 4th to the 8th of August, 1994. The embedding phase space of the time series were reconstructed from 2 to 14 dimensions, and the correlation dimensions of the attractors were then estimated. The results show that the land-sea breeze phenomenon exhibits a deterministic chaos with non-integer correlation dimension values between 2 and 3. Accordingly, 3 is the minimum number of independent variables required to model the dynamics of the landsea breeze phenomenon in the Kimhae area. Since the saturated embedding dimension, when the correlation dimension remains unchanged, is larger for the wind velocity v-component than for temperature, this indicates that wind velocity is susceptible to topology.

• Industrial Engineering and Management Systems
• /
• v.14 no.3
• /
• pp.299-311
• /
• 2015

Nowadays, the distribution centres aim to reduce costs by reducing inventory and timely shipment. Cross docking is a logistics strategy in which products delivered to a distribution centre by inbound trucks are directly unloaded and transferred to outbound trucks with minimum warehouse storage. Moreover, on-time delivery in a distribution network becomes very crucial especially when several distribution centres and customers are involved. Therefore, an efficient truck scheduling is needed to synchronize the delivery throughout the network in order to satisfy all stake-holders. This paper presents a mathematical model of a mixed integer programming for door assignment and truck scheduling in a multiple inbound and outbound doors cross docking problem according to Just-In-Time concept. The objective is to find the schedule of transhipment operations to simultaneously minimize the total earliness and total tardiness of trucks. Then, a multi-objective differential evolution (MODE) is proposed with an encoding scheme and four decoding strategies, called ITSH, ITDD, OTSH and OTDD, to find a Pareto frontier for the multi-door cross docking problems. The performances of MODE are evaluated using 15 generated instances. The numerical experiments demonstrate that the proposed algorithm is capable of finding a set of diverse and high quality non-dominated solutions.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.3
• /
• pp.237-244
• /
• 2023

A signal generation simulator is an economical and useful solution in Global Navigation Satellite System (GNSS) receiver design and testing. A software-defined radio approach is widely used both in receivers and simulators, and its flexible structure to adopt to new signals is ideally suited to the testing of a receiver and signal processing algorithm in the signal design phase of a new satellite-based navigation system before the deployment of satellites in space. The generation of highly accurate delayed sampled codes is essential for generating signals in the simulator, where its sampling rate should be chosen to satisfy constraints such as Nyquist criteria and integer and non-commensurate properties in order not to cause any distortion of original signals. A high sampling rate increases the accuracy of code delay, but decreases the computational efficiency as well, and vice versa. Therefore, the selected sampling rate should be as low as possible while maintaining a certain level of code delay accuracy. This paper presents the lower limits of the sampling rate for GNSS signal generation simulators. In the simulation, two distinct code generation methods depending on the sampling position are evaluated in terms of accuracy versus computational efficiency to show the lower limit of the sampling rate for several GNSS signals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3204-3217
• /
• 2023

In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.233-240
• /
• 2012

The implementation of business process management (BPM) systems in large number of business organizations transforms BPM system into such a level of maturity and tends to collect large repositories of business process (BP) models. This issue encourages BP flexibility that leads to a large number of process variants derived from the same model, but differing in structure, to be stored in the large repositories of BP models. Therefore, the repositories may include thousands of activities and related business objects with variation of requirements and quality of service. It is a common practice to customize processes from reference processes or templates in order to reduce the time and effort required to design and deploy processes on all levels. In order to address redundancy and underutilization problems, a generic process model, called as reference BP, is absolutely necessary to cover the best of process variants. This study aims to develop multiple-objective business process genetic algorithm (MOBPGA) to find a set of non-dominated (Pareto) solutions of business reference model to enhance conventional approach which considered only a single objective on creating BP reference model by using proximity score measurement. A mixed-integer linear program is constructed to evaluate performance of the proposed MOBPGA on small-scale problems by using standard measures for multiple-objective techniques. The results will show the viability of applying MOBPGA in terms of simultaneously maximizing proximity score measurement, minimizing total duration, and total costs of the selected reference model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.637-637
• /
• 1997

In this paper, format conversion filters are proposed, which have advantages in hardware implementation compared to the ones proposed in MPEG-4 Video Verification Model. since each coefficients of the proposed filters is constrained to have less than two non-zero digits in minimal signed digit representation, multiplication of input and the coefficient can be implemented by a single adder. As a result, the proposed filters have advantages in hardware complexity and speed, compared to the filters which are usually implemented by integer multiplier or carry save adders. Six kinds of filters are proposed in MPEG-4 Video Verification Model for size conversion of 2:1, 4:1, 5:3 and 5:6. We design 5 filters for the same purpose and compare the performance. The remaining one is very simple to implement. For comparing the filtering performance, we first compare the results of sine wave frequency conversion as an indirect but meaningful comparison. Second. We compute the PSNR of the images obtained from the proposed filters and the ones proposed by MPEG, with reference to the images obtained by using double precision arithmetic and high order filter. The results show that the performance of the proposed filters is almost the same as that of the filters proposed by MPEG. In conclusion, the peroformance of the proposed filters is comparable to that of the ones in MPEG-4, while requiring lower hardware complexity and providing high operating speed.