• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.182-191
• /
• 2004

In this paper, performances of different ultra-wideband (UWB) modulation schemes in the presence of timing jitter are evaluated and compared. Static and Rayleigh fading channels are considered. For fading channels, Oat and dispersive channels are assumed. First, bit error rate (BER) performances for each case are derived for a fixed value of timing jitter. Later, a uniform distribution of jitter is assumed to evaluate the performance of the system, and the theoretical results are verified by computer simulations. Finger estimation error is treated as timing jitter and an appropriate model is generated. Furthermore, a worst case distribution that provides an upper bound on the system performance is presented and compared with other distributions. Effects of timing jitter on systems employing different pulse shapes are analyzed to show the dependency of UWB performance on pulse shape. Although our analysis assumes uniform timing jitter, our framework can be used to evaluate the BER performance for any given probability distribution function of the jitter.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.1-7
• /
• 2016

Most of the previous proxy re-encryption schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, they cannot guarantee its security under quantum analysis, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. In the paper, we propose the first proxy re-encryption scheme based on the hard worst-case lattice problems. Our scheme has many useful properties as follows: Unidirectional, collusion-resistant, noninteractive, proxy invisible, key optimal, and nontransitive.We also provided the formal security proof of the proposed scheme in the random oracle model.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2242-2244
• /
• 2003

This paper considers a networked control system (NCS) that consists of an inverted cart pendulum, a digital controller, and a controller area network (CAN) in which the actuator and sensors of the pendulum are connected to form a closed-loop system. The worst-case message response time (WCMRT) in the CAN is analyzed and the analysis results are applied to the target control system. For the case where the control system cannot satisfy the WCMRT condition and therefore time delays are inevitable, the Luck and Ray method is used to compensate the network-induced time delays. Simulations are carried out to show the feasibility of the proposed scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.111-123
• /
• 2009

We present an efficient algorithm for computing the Hausdorff distance between two 2D convex polygons. Two convex polygons are bounded by k-DOPs and the regions of interest are traced using the orientational and hierarchical properties of k-DOP. The algorithm runs in a logarithmic time in the average case, and the worst case time complexity is linear.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4595-4610
• /
• 2020

In the practical communication environment, the accurate channel state information (CSI) is difficult to obtain, which will cause the mismatch of resource and degrade the system performance. In this paper, to account for the channel uncertainties, a robust power allocation scheme for a downlink Non-orthogonal multiple access (NOMA) heterogeneous network (HetNet) is designed to maximize energy efficiency (EE), which can ensure the quality of service (QoS) of users. We conduct the robust optimization model based on worse-case method, in which the channel gains belong to certain ellipsoid sets. To solve the non-convex non-liner optimization, we transform the optimization problem via Dinkelbach method and sequential convex programming, and the power allocation of small cell users (SCUs) is achieved by Lagrange dual approach. Finally, we analysis the convergence performance of proposed scheme. The simulation results demonstrate that the proposed algorithm can improve total EE of SCUs, and has a fast convergence performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.100-104
• /
• 1993

In Part 1, we derived robust stability conditions for an LTI interconnected to time-varying nonlinear perturbations belonging to several classes of nonlinearities. These conditions were presented in terms of positive definite solutions to LMI. In this paper we address a problem of synthesizing feedback controllers for linear time-invariant systems under structured time-varying uncertainties, combined with a worst-case H$_{2}$ performance. This problem is introduced in [7, 8, 15, 35] in case of time-invariant uncertainties, where the necessary conditions involve highly coupled linear and nonlinear matrix equations. Such coupled equations are in general difficult to solve. A convex optimization approach will be employed in this synthesis problem in order to avoid solving highly coupled nonlinear matrix equations that commonly arises in multiobjective synthesis problem. Using LMI formulation, this convex optimization problem can in turn be cast as generalized eigenvalue minimization problem, where an attractive algorithm based on the method of centers has been recently introduced to find its solution [30, 361. In the present paper we will restrict our discussion to state feedback case with Popov multipliers. A more general case of output feedback and other types of multipliers will be addressed in a future paper.

• Journal of the Korean Society of Radiology
• /
• v.15 no.5
• /
• pp.675-681
• /
• 2021

Recently, the Ministry of Education stipulates in the distance class operation regulations that student lecture evaluations for distance learning subjects should be conducted at least twice per semester and the results should be disclosed to students. Therefore, the lecture evaluation of D college was compared with the first semester of 2020 and the first semester of 2021. As for the multiple-choice evaluation result of the distance learning mid-course evaluation, the overall average of the mid-course evaluation of the distance class in the first semester of 2020 increased from 4.1819 to 4.4000 in the mid-course evaluation in the first semester of 2021.In the case of the first semester of 2020, due to Corona 19, all non-face-to-face classes were held, but in the first semester of 2021, face-to-face classes increased. The overall satisfaction level rose from 4.18 points in the first semester of 2020 to 4.39 points in the first semester of 2021. The screen composition, sound and picture quality, playback time, face appearance, lecture material provision, and frequency of use of the top 3% and bottom 3% also increased. Despite the changes caused by the LMS replacement, which was a concern, student attendance, assignments, and test submission rates also increased compared to the previous year. The null hypothesis that 'the difference between the two scores is the same' is the null hypothesis because the probability of significance is 0.000 and less than 0.05 in the case of the best 3% of the test result of the test result of the mid-course evaluation of distance classes in the first semester of 2020 and the evaluation of the intermediate lectures in the first semester of 2021. As this was rejected, it can be seen that the best score for the 2021 school year has significantly increased compared to the first semester of 2020. Also, in the case of Worst 3% or less, the significance probability is 0.000, which is less than 0.05, so the null hypothesis that 'the difference between the two scores is the same' was rejected, indicating that the Worst score for the 2021 school year was significantly higher than that for the first semester of 2020.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.19-43
• /
• 2005

This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.163-167
• /
• 2008

In this study, the 1/35 reduced-scale model experiment were conducted to investigate designed ventilation effect on the smoke movement at rescue station fire in railway tunnel. A model tunnel with 2 mm thick, 10 m long, 0.19 m high and 0.26 m was made by using Froude number scaling law. The cross-passages installing escape door at the center were connected between incident tunnel and rescue tunnel. The n-heptane pool fires with heat release rate 698.97W were used as fire source. The fire source was located at the center and portal of incident tunnel as worst case. A operating ventilation system extracted smoke amount of 0.015 cms(cubic meters per second). The smoke temperature and CO gas concentration in cross-passage were measured to verify designed ventilation system. The result showed that, at center fire case without ventilation, smoke did not propagate to rescues station. In portal fire case, smoke spreaded to rescues station without ventilation. But smoke did not propagated to rescues station with designed ventilation.