• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.1-9
• /
• 2008

In this paper, a simple and efficient three cell based clustered-cell coordination is proposed with well hewn zero-forcing beamforming (ZF-BF) with a semi-orthogonal user selection (SUS) as transmission and scheduling scheme. For a modified Wyner's channel model with two classes of user groups for a hexagonal cellular system, the upper bound of asymptotic sum rate scaling of ZF-BF in a proposed coordination is shown to be proportional to the number of transmit antennas and double logarithms of the number of users. The numerical results verify the efficiency of the proposed cell coordination. It is also numerically shown that ZF-BF with the SUS in CCCT actually achieves the upper bound of asymptotic sum rate sum rate scaling.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.10 no.4
• /
• pp.309-314
• /
• 2005

We performed a basic experiment for the rapid, on-line, real-time measurement of hepatitis B surface antigen using a surface plasmon resonance biosensor. We immobilized anti­HBsAg (hepatitis B surface antigen) polyclonal antibody, as a ligand, to the dextran layer on a CM5 chip surface that had previously been activated by N-hydroxysuccinimide. A sample solution containing HBsAg was fed through a microfluidic channel, and the reflecting angle change due to the mass increase from the binding was detected. The binding characteristics between HBsAg and its polyclonal antibody followed the typical monolayer adsorption isotherm. When the entire immobilized antibody had interacted, no additional, non-specific binding occurred, suggesting the immunoreaction was very specific. The bound antigen per unit mass of the antibody was independent of the immobilized ligand density. No significant steric hindrance was observed at an immobilization density of approximately $17.6 ng/mm^2$. The relationship between the HBsAg concentration in the sample solution and the antigen bound to the ligand was linear up to ca. $40{\mu}g$/mL. This linearity was much higher than that of the ELISA method. It appeared the anti­gen-antibody binding increased as the immobilized ligand density increased. In summary, this study showed the potential of this SPR biosensor-based method as a rapid, simple and multi­sample on-line assay. Once properly validated, it may serve as a more efficient method for HBsAg quantification for replacing the ELISA.

• Journal of Advanced Navigation Technology
• /
• v.23 no.6
• /
• pp.577-583
• /
• 2019

A dynamic system is called positive if any trajectory of the system starting from non-negative initial states remains forever non-negative for non-negative controls. In this paper, we consider the new stability condition for the positive time-varying linear discrete interval systems with time-varying delay and unstructured uncertainty. The delay time is considered as time-varying within certain interval having minimum and maximum values and the system is subjected to nonlinear unstructured uncertainty which only gives information on uncertainty magnitude. The proposed stability condition is an improvement of the previous results which can be applied only to time-invariant systems or had no consideration of uncertainty, and they can be expressed in the form of a very simple inequality. The stability conditions are derived using the Lyapunov stability theory and have many advantages over previous results using the upper solution bound of the Lyapunov equation. Through numerical example, the proposed stability conditions are proven to be effective and can include the existing results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.4
• /
• pp.348-359
• /
• 1989

The multitree pattern recognition algorithm proposed by [1] and [2] is modified in order to improve its performance. The basic idea of the multitree pattern classification algorithm is that the binary dceision tree used to classify an unknow pattern is constructed for each feature and that at each stage, classification rule decides whether to classify the unknown pattern or to extract the feature value according to the feature ordet. So the feature ordering needed in the calssification procedure is simple and the number of features used in the classification procedure is small compared with other classification algorithms. Thus the algorithm can be easily applied to real pattern recognition problems even when the number of features and that of the classes are very large. In this paper, the wighting factor assignment scheme in the decision procedure is modified and various classification rules are proposed by means of the weighting factor. And the branch and bound method is applied to feature subset selection and feature ordering. Several experimental results show that the performance of the multitree pattern classification algorithm is improved by the proposed scheme.

• Journal of the Korean Geotechnical Society
• /
• v.20 no.1
• /
• pp.121-129
• /
• 2004

In this study, a slope stability chart for assessing stability of homogeneous simple soil slopes is proposed. Most existing slope stability charts are based on limit equilibrium method, which is not rigorous in mechanical standpoint. Meanwhile, limit analysis based on the principle of virtual work and the bound theorems of plasticity is suitable for evaluating the stability of geotechnical structures such as slope due to its simplicity in computation and mechanical rigor. Numerical limit analysis taking advantage of finite elements and linear programming can consider various slope conditions and, in addition, find the optimum stability solution with effeciency. In this study, a numerical limit analysis program in terms of effective stress is developed and a mechanically rigorous slope stability chart is proposed by performing stability analyses for various slope conditions. Pore pressure ratio, commonly used in stability charts, is applied to consider the effects of pore pressure for effective stress analysis. As a result of comparison between proposed stability chart and Spencer's stability chart, it was found that Spencer's chart solutions are biased to lower bound which means conservative in design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.422-428
• /
• 2011

In this paper, we introduce system and channel modeling for an underwater ad hoc acoustic network with n regularly located nodes， and then analyze capacity scaling laws based on the model. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize in attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks having unit node density. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal for all the operating regimes expressed as functions of the attenuation parameter.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.9
• /
• pp.739-748
• /
• 2021

This paper discusses the prediction and validation of design loads of satellite components using modal mass acceleration curve (Modal MAC). To calculate the acceleration upper bound of the satellite components subjected to the launch environment by the Modal MAC, the parameters of SpaceX Falcon 9 launch vehicle were used, and the acceleration upper bound curve in the modal domain was derived. After that, the maximum acceleration loads applied to the satellite components were predicted by combining Modal MAC with the spacecraft interface loads of the satellite/launch vehicle and modal information of the satellite. In addition, the accuracy of the Modal MAC was validated through comparison with the results of the coupled loads analysis using a simple satellite and launch vehicle model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.23-32
• /
• 2020

Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.57-78
• /
• 2005

The vehicle routing problem (VRP) is to determine a set of feasible vehicle routes, one for each vehicle, such that each customer is visited exactly once and the total distance travelled by the vehicles is minimized. A feasible route is defined as a simple circuit including the depot such that the total demand of the customers in the route does not exceed the vehicle capacity. While there have been significant advances recently in exact solution methodology, the VRP is not a well solved problem. We find most approaches still relying on the branch and bound method. These approaches employ various methodologies to compute a lower bound on the optimal value. We introduce a new modelling approach, termed route-splitting, for the VRP that allows us to address problems whose size is beyond the current computational range of set-partitioning models. The route-splitting model splits each vehicle route into segments, and results in more tractable subproblems. Lifting much of the burden of solving combinatorially hard subproblems, the route-splitting approach puts more weight on the LP master problem, Recent breakthroughs in solving LP problems (Nemhauser, 1994) bode well for our approach. Lower bounds are computed on five symmetric VRPs with up to 199 customers, and eight asymmetric VRPs with up to 70 customers. while it is said that the exact methods developed for asymmetric instances have in general a poor performance when applied to symmetric ones (Toth and Vigo, 2002), the route splitting approach shows a competent performance of 93.5% on average in the symmetric VRPs. For the asymmetric ones, the approach comes up with lower bounds of 97.6% on average. The route-splitting model can deal with asymmetric cost matrices and non-identical vehicles. Given the ability of the route-splitting model to address a wider range of applications and its good performance on asymmetric instances, we find the model promising and valuable for further research.