• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.40-47
• /
• 2001

In reverse engineering, existing products are digitized fur the computer modeling. Using the digitized data, surfaces are modeled for new products. However, in the digitizing process measuring errors or deviations can be happened often in practice. Thus, it is important to adjust such errors or deviations during the computer modeling. To adjust the errors, fairing of the modeled surfaces is performed. In this paper, we present a surface fairing algorithm based on various fairness metrics. Fairness metrics can be discrete. We adopt discrete metrics for fairing given 3D point set. The fairness metrics include discrete principal curvatures. In this paper, automatic fairing process is proposed for fairing given 3D point sets for surfaces. The process uses various fairness criteria so that it is adequate to adopt designers'intents.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3753-3771
• /
• 2016

Increasingly, numerous and various Internet-capable devices are connected in end user networks, such as a home network. Most devices use the combination of TCP and 802.11 DCF as a system platform, but whereas some devices such as a streaming video persistently generate traffic, others such as a motion sensor do so only intermittently with lots of pauses. This study addresses the issue of performance in this heterogeneous traffic wireless LAN environment from the perspective of fairness. First, instantaneous fairness is introduced as a notion to indicate how immediately and how closely a user obtains its fair share, and a new time-based metric is defined as an index. Second, extensive simulation experiments have been made with TCP Reno, Vegas, and Westwood to determine how each TCP congestion control corresponds to the instantaneous fairness. Overall, TCP Vegas yields the best instantaneous fairness because it keeps the queue length shorter than the other TCPs. In the simulations, about 60% of a fair share of the effective user bandwidth is immediately usable in any circumstance. Finally, we introduce two simple strategies for adjusting TCP congestion controls to enhance instantaneous fairness and validate them through simulation experiments.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.87-102
• /
• 1998

Given a sequence of cross-sectional curves, the skinning method generates a freeform surface that interpolates the given curves in that sequence. This thesis presents a construction method of a B-spline skinning surface that is fair and satisfies volume constraints. The fairness metric is based on the parametric energy functional of a surface. The degrees of freedom in surface control are closely related lo control points in the skinning direction. The algorithm fur finding a skinning surface consists of two step. In the first step, an initial fair surface is generated without volume constraints and one coordinate of each control point is fixed. In the second step, a final surface that meets all constraints is constucted by rearranging the other coordinates of each control point that defines the initial surface A variational Lagrange optimization method produces a system of nonlinear equations, which can be solved numerically. Moreover, the reparametrization of given sectional curves is important for the construction of a reasonable skinning surface. This thesis also presents an intuitive metric for reparametrization and gives some examples that are optimized with respect to that metric.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.520-527
• /
• 2013

In this paper, a joint cell grouping and user association technique proposed for a semi-dynamic grouped network MIMO in a clustered heterogeneous cellular network (HCN). With the conventional macro BSs, small cells are being overlaid to increase a spectral efficiency per area and these small cells are expected to be concentrated to support exponentially increasing data traffic in hot spot areas. The main culprits of performance degradation in the clustered HCN are interference and load imbalance. The proposed scheme jointly handles them to maximize a proportional-fair metric. It is shown that the proposed technique can largely improve user average rate and proportional fairness among users than any other conventional schemes in the clustered HCN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.106-115
• /
• 2003

Diverse multimedia services will be deployed at hand on 3G-and-beyond multi-service CDMA systems in order to satisfy different quality of service (QoS) according to traffic types. In order to use appropriate resources efficiently the call admission control (CAC) as a major resource control mechanism needs to be used to take care of efficient utilization of limited resources. In this paper, we propose a QoS-aware CAC (QCAC) that is enabled to provide service fairness and service differentiation in accordance with priority order and that applies the different thresholds in received power considering different QoS requirements such as different bit error rates (BER) when adopting total received power as the ceil load estimation. The proposed QCAC calculates the different thresholds of the different traffic types based on different required BER applies it for admission policy, and can get service fairness and differentiation in terms of call dropping probability as a main performance metric. The QCAC is aware of the QoS requirement per traffic type and allows admission discrimination according to traffic types in order to minimize the probability of QoS violation. Also the CAC needs to consider the resource allocation schemes such as complete sharing (CS), complete partitioning (CP), and priority sharing(PS) in order to provide fairness and service differentiation among traffic types. Among them, PS is closely related with the proposed QCAC having differently calculated threshold per each traffic type according to traffic priority orders.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.127-138
• /
• 1999

For reverse engineering, curves and surfaces are modeled for new products by interpolating the digitized data points. But there are many measuring or deviation errors. Therefore, it is important to handle errors during the curve or surface modeling. If the errors are ignored, designer could get undesirable results. For this reason, fairing procedure with the aesthetics criteria is necessary in computer modeling. This paper presents methods of 3D NURBS curve fairing. The techniques are based on automatic repositioning of the digitized dat points or the NURBS curve control points by a constrained nonlinear optimization algorithm. The objective function is derived variously by derived curved. Constraints are distance measures between the original and the modified digitized data points. Changes I curve shape are analyzed by illustrations of curve shapes, and continuous plotting of curvature and torsion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.332-340
• /
• 2010

In this paper, we deal with multi-user diversity scheduling methods that transmit simultaneously signals from multiple users using superposition coding multiplexing. These methods can make various scheduling methods be obtained, according to strategies for user selection priority from the first user to the first-following users, strategies for per-user power allocation, and resulting combining strategies. For the first user selection, we consider three strategies such as 1) higher priority for a user with a better channel state, 2) following the proportional fair scheduling (PFS) priority, 3) higher priority for a user with a lower average serving rate. For selection of the first-following users, we consider the identical strategies for the first user selection. However, in the second strategy, we can decide user priorities according to the original PFS ordering, or only once an additional user for power allocation according to the PFS criterion by considering a residual power and inter-user interference. In the strategies for power allocation, we consider two strategies as follows. In the first strategy, it allocates a power to provide a permissible per-user maximum rate. In the second strategy, it allocates a power to provide a required per-user minimum rate, and then it reallocates the residual power to respective users with a rate greater than the required minimum and less than the permissible maximum. We consider three directions for scheduling such as maximizing the sum rate, maximizing the fairness, and maximizing the sum rate while maintaining the PFS fairness. We select the max CIR, max-min fair, and PF scheduling methods as their corresponding reference methods [1 and references therein], and then we choose candidate scheduling methods which performances are similar to or better than those of the corresponding reference methods in terms of the sum rate or the fairness while being better than their corresponding performances in terms of the alternative metric (fairness or sum rate). Through computer simulations, we evaluate the sum rate and Jain’s fairness index (JFI) performances of various scheduling methods according to the number of users.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.197-207
• /
• 2006

When the latency of a flow in a fair packet scheduler, which is determined by its rate, violates its required delay bound, the scheduler should reduce the latency with even raising the rate being reserved for the flow. The excessively reserved rate win enforce some outgoing link bandwidth be lost. This loss can not be, unfortunately, evaluated by the three metrics of latency, fairness and implementation complexity used in previous works. This paper is aimed to first introduce the metric of bandwidth utilization to investigate the bandwidth loss in a scheduler and then evaluate the timestamp based schedulers in terms of the bandwidth and payload utilizations. The results show that the bandwidth utilization increases with loosing the required delay bound and, in particular, schedulers with the latency property of WFQ have much better payload utilization by up to 50% than that in the SCFQ one.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.169-180
• /
• 2009

With fixed sinks, the network stability could be improved while the network life time could be decreased by the rapid energy dissipation around the fixed sink because of the concentrated network traffic from sensor nodes to the fixed sink in wireless sensor network. To address this problem, mobile sinks, which decentralize the network traffic, has received a lot of attention from many researchers recently. Since a mobile sink has a limited period to communicate with each sensor nodes, it is necessary for a scheduling algorithm to provide the fairness of data collection from each sensor nodes. In the paper, we propose the new scheduling algorithm, ASF(Availability based Scheduling scheme for Fair data collection), for the fair data collection by a mobile in the sensor networks. The ASF takes account of the distance between each sensor nodes and the mobile sink as scheduling metric, as well as the amount of collected data from each sensor nodes. Experiment results shows that the ASF improves the fairness of data collection among the sensor nodes, comparing to existing algorithm.