• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2154-2172
• /
• 2013

A centralized cognitive radio (CR) network is proposed and its system capacity is studied. The CR network is designed with power control and multi-user scheduling schemes to support best-effort traffics under peak interference power constraints. We provide an analytical framework to quantify its system capacity, taking into account various key factors such as interference constraints, density of primary users, cell radius, the number of CR users, and propagations effects. Furthermore, closed-form formulas are derived for its capacities when only path loss is considered in the channel model. Semi-analytical expressions for the capacities are also given when more realistic channel models that include path loss, shadowing, and small-scale fading are used. The accuracy of the proposed analytical framework is validated by Monte Carlo simulations. Illustrated with a practical example, the provided analytical framework is shown to be useful for the strategic planning of centralized CR networks.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.142-159
• /
• 1999

To assign the soldiers in the adequate positions I military is almost as important as managing officers because they compose the main part of military structure and equipment operators. The current Military Occupational Specialty(MOS) assignment system lacks the capability to optimize the use of recruit's potential. We suggest an MOS assignment method for enlisted recruits using the Analytic Hierarchy Process(AHP) method, this method systematically provides a method of calculation of composite relative weights of decision elements to be considered during MOS assignment and a method of quantification for personal quality of new recruits. The quantified value of personal quality, Mission Performance Capability(MPC), in this study means the mission performance capability when a personnel is assigned to a certain MOS. This paper develops a multiple objectives MOS assignment model for enlisted recruits. It uses MPC of personnels, calculated with AHP method and consensus method, as parameters. The goal constraints are assurance of filling requirement, minimization of the number of unassigned personnel to MOS, capability satisfaction of education facility and support facility, assurance of desired MPC value level for MOS assignment, and maximization of total MPC. The objective function is to terminalization of the negative or positive deviation for the above goal constraints.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2120-2132
• /
• 1997

A layout automation system for analog integrated circuits is proposed. The implemented system performs full-custom analog layout under the analog layout constraints. In order to overcome the demerits of conventional analog layout systems, parameterized module library is proposed. The system can support complex analog layout modules, resulting in a maximum expandability of the system. Moreover, modified dynamic multi-path algorithm is developed by enhancing the conventional Dijkstra algorithm. Several benchmark circuits such as comparator, op amp, and filter was tested by the system. Layout results compared to OPASYN show well-merging layout and interdigitized layout module.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3662-3674
• /
• 1999

This paper addresses some design issues for establishing the optimal number of spare units in array systems manufactured using fault-tolerant multichip modules(MCM's) for massively parallel computing(MPC). We propose a new quantitative approach to an optimal cost-effective MCM system design under yield and reliability constraints. In the proposed approach, we analyze the effect of residual redundancy on operational reliability of fault-tolerant MCM's. In particular, the issues of imperfect support circuitry, chip assembly yield and array topology are investigated. Extensive parametric results for the analysis are provided to show that our scheme can be applied to design ways using MCM's for MPC applications more efficiently, subject to yield and reliability constraints.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.966-968
• /
• 2009

In IEEE 802.16 system, it is important to allocate resources appropriately in order to the efficient utilization of resources among a variety of real-time and non real-time packets. although a lot of the real-time and non real-time packet scheduling schemes in OFDMA system have been proposed, it need to be modified to apply to IEEE 802.16 system. Since IEEE 802.16 supports five kinds of service classes, it is important to take QoS constraints of these classes into consideration. In this paper, we propose a efficient scheduling scheme to support various services by considering the QoS constraints of each classes.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.4
• /
• pp.425-433
• /
• 2022

This paper studies the method of delivering munitions using both drones and UGVs that are developing along with the 4th Industrial Revolution. While drones are more mobile than UGVs, their loading capacity is small, and UGVs have relatively less mobility than drones, but their loading capacity is better. Therefore, by simultaneously operating these two delivery means, each other's shortcomings may be compensated. In addition, on actual battlefields, time constraints are an important factor in delivering munitions. Therefore, assuming an actual battlefield environment with a time limit, we establish delivery routes that minimize delivery time by operating both drones and UGVs with different capacities and speeds. If the delivery is not completed within the time limit, penalties are imposed. We devised the hybrid genetic algorithm to find solutions to the proposed model, and as results of the experiment, we showed the algorithm we presented solved the actual size problems in a short time.

• Tribology and Lubricants
• /
• v.39 no.3
• /
• pp.94-101
• /
• 2023

Automotive wheel bearings are a critical component of vehicles that support their weight and facilitate rotation. Life and stiffness are significant performance characteristics of wheel bearings. Designing wheel bearings involves finding optimal design variables that satisfy both performances. CO₂ emission reduction and fuel efficiency regulations attribute to the recent increase in design requirements for lightweight and compact automotive parts while maintaining performance. However, achieving a design that maintains performance while reducing weight poses challenges, as performance and weight are generally inversely proportional. In this study, we perform design optimization of automotive wheel bearings considering life and stiffness. We develop a program that calculates the basic rated life and modified rated life based on international standards for evaluating the life of wheel bearings. We develop a regression equation using regression analysis to address the time-consuming stiffness analysis during repetitive analysis. We perform ANOVA and main effect analyses to understand the statistical characteristics of the developed regression equation. Furthermore, we verify its reliability by comparing the predicted and test results. We perform design optimization using the developed life prediction program, stiffness regression equation and weight regression equation. We select bearing specifications and geometry as design variables, weight as the cost function, and life and stiffness as constraints. Through design optimization, we investigate the influence of design variables on the cost function and constraints by comparing the initial and optimal design values.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.125-132
• /
• 2014

Since frequent pattern mining was proposed in order to search for hidden, useful pattern information from large-scale databases, various types of mining approaches and applications have been researched. Especially, frequent graph pattern mining was suggested to effectively deal with recent data that have been complicated continually, and a variety of efficient graph mining algorithms have been studied. Graph patterns obtained from graph databases have their own importance and characteristics different from one another according to the elements composing them and their lengths. However, traditional frequent graph pattern mining approaches have the limitations that do not consider such problems. That is, the existing methods consider only one minimum support threshold regardless of the lengths of graph patterns extracted from their mining operations and do not use any of the patterns' weight factors; therefore, a large number of actually useless graph patterns may be generated. Small graph patterns with a few vertices and edges tend to be interesting when their weighted supports are relatively high, while large ones with many elements can be useful even if their weighted supports are relatively low. For this reason, we propose a weight-based frequent graph pattern mining algorithm considering length-decreasing support constraints. Comprehensive experimental results provided in this paper show that the proposed method guarantees more outstanding performance compared to a state-of-the-art graph mining algorithm in terms of pattern generation, runtime, and memory usage.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.631-637
• /
• 2005

This paper presents a stiffness analysis method for a low-DOF parallel manipulator, which takes into account of elastic deformations of joints and links. A low-DOF parallel manipulator is defined as a spatial parallel manipulator which has less than six degrees of freedom. Differently from the case of a 6-DOF parallel manipulator, the serial chains in a low-DOF parallel manipulator are subject to constraint forces as well as actuation forces. The reaction forces due to actuations and constraints in each limb can be determined by making use of the theory of reciprocal screws. It is shown that the stiffness model of an F-DOF parallel manipulator consists of F springs related to the reciprocal screws of actuations and 6-F springs related to the reciprocal screws of constraints, which connect the moving platform to the fixed base in parallel. The $6{times}6$ stiffness matrix is derived, which is the sum of the stiffness matrices of actuations and constraints. The six spring constants can be precisely determined by modeling the compliance of joints and links in a serial chain as follows; the link can be considered as an Euler beam and the stiffness matrix of rotational or prismatic joint can be modeled as a $6{times}6$ diagonal matrix, where one diagonal element about the rotation axis or along the sliding direction is zero. By summing the elastic deformations in joints and links, the compliance matrix of a serial chain is obtained. Finally, applying the reciprocal screws to the compliance matrix of a serial chain, the compliance values of springs can be determined. As an example of explaining the procedure, the stiffness of the Tricept parallel manipulator has been analyzed.