• Korean Security Journal
• /
• no.25
• /
• pp.63-87
• /
• 2010

Our society nowadays sees the increase in damage from crime on lives and properties by leaps and bounds in line with the economic take-off, and as a result, the raise of individual income. When considering such a hike in crime, it is desirable that the police framework be enhanced. However, thanks to the failure to correspond to this, it could be safely said that a good portion of accountability was shifted to the private security industry in regard to security for the people. Accordingly, the request for escort security business is on the increase regarding expansion and improvement about this industrial sector. As such, it is necessary to get the related system rearranged for authority on the part of escort guards, who are directly exposed to numerous crimes. On top of this, dispersion is required for the escort security businesses centralized in the metropolitan area. It is also necessary for the security guard system to be strengthened and disintegrated into details so that the escort security services are available to people in more safe and easily manners than ever before. When the qualification regime is operated based on this refreshed system, the efficient escort security work would be realized. The dichotomy into act on Special Security Guard and act on Security Business should be dealt with once again for integration as an issue on the front burner in the academic area, and through which the escort security market could be fit for the globalization as well. This paper would provide the solution that leads to more professional and efficient results from comprehension of progress situations in reality by starting from the concept on private security to the analysis of the conditions in this industrial sector.

• Ocean and Polar Research
• /
• v.39 no.1
• /
• pp.13-21
• /
• 2017

Temporal changes in the number of zooplankton species are important information for understanding basic characteristics and species diversity in marine ecosystems. The aim of the present study was to estimate the optimal monitoring frequency (OMF) to guarantee and predict the minimum number of species occurrences for studies concerning marine ecosystems. The OMF is estimated using the temporal number of zooplankton species through bi-weekly monitoring of zooplankton species data according to operational taxonomic units in the Tongyoung coastal sea. The optimal model comprises two terms, a constant (optimal mean) and a cosine function with a one-year period. The confidence interval (CI) range of the model with monitoring frequency was estimated using a bootstrap method. The CI range was used as a reference to estimate the optimal monitoring frequency. In general, the minimum monitoring frequency (numbers per year) directly depends on the target (acceptable) estimation error. When the acceptable error (range of the CI) increases, the monitoring frequency decreases because the large acceptable error signals a rough estimation. If the acceptable error (unit: number value) of the number of the zooplankton species is set to 3, the minimum monitoring frequency (times per year) is 24. The residual distribution of the model followed a normal distribution. This model can be applied for the estimation of the minimal monitoring frequency that satisfies the target error bounds, as this model provides an estimation of the error of the zooplankton species numbers with monitoring frequencies.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1183-1193
• /
• 2010

The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.289-307
• /
• 2010

The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the signal. In this regard, it generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence-termed as the worst-case coherence and the average coherence-among the columns of a design matrix. It utilizes these two measures of coherence to provide an in-depth analysis of a simple, model-order agnostic one-step thresholding (OST) algorithm for model selection and proves that OST is feasible for exact as well as partial model selection as long as the design matrix obeys an easily verifiable property, which is termed as the coherence property. One of the key insights offered by the ensuing analysis in this regard is that OST can successfully carry out model selection even when methods based on convex optimization such as the lasso fail due to the rank deficiency of the submatrices of the design matrix. In addition, the paper establishes that if the design matrix has reasonably small worst-case and average coherence then OST performs near-optimally when either (i) the energy of any nonzero entry of the signal is close to the average signal energy per nonzero entry or (ii) the signal-to-noise ratio in the measurement system is not too high. Finally, two other key contributions of the paper are that (i) it provides bounds on the average coherence of Gaussian matrices and Gabor frames, and (ii) it extends the results on model selection using OST to low-complexity, model-order agnostic recovery of sparse signals with arbitrary nonzero entries. In particular, this part of the analysis in the paper implies that an Alltop Gabor frame together with OST can successfully carry out model selection and recovery of sparse signals irrespective of the phases of the nonzero entries even if the number of nonzero entries scales almost linearly with the number of rows of the Alltop Gabor frame.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.12
• /
• pp.226-231
• /
• 2016

Binomial trees are used to price barrier options. Since barrier options are path dependent, option values of each node are calculated from binomial trees using backward induction. We use generalized Catalan numbers to determine the number of cases not reaching a barrier. We will generalize Catalan numbers by imposing upper and lower bounds. Reaching a barrier in binomial trees is determined by the difference between the number of up states and down states. If we count the cases that the differences between the up states and down states remain in a specific range, the probability of not reaching a barrier is obtained at a final node of the tree. With probabilities and option values at the final nodes of the tree, option prices are computable by discounting the expected option value at expiry. Without calculating option values in the middle nodes of binomial trees, option prices are computable only with final option values. We can obtain a probability distribution of exercising an option at expiry. Generalized Catalan numbers are expected to be applicable in many other areas.

• Korean Chemical Engineering Research
• /
• v.46 no.3
• /
• pp.585-597
• /
• 2008

The aim of this study was to find an analytic solution to the problem of determining the optimal capacity (lot-size) of a batch-storage network to meet demand for a finished product in a system undergoing random failures of operating time and/or batch material. The superstructure of the plant considered here consists of a network of serially and/or parallel interlinked batch processes and storage units. The production processes transform a set of feedstock materials into another set of products with constant conversion factors. The final product demand flow is susceptible to short-term random variations in the cycle time and batch size as well as long-term variations in the average trend. Some of the production processes have random variations in product quantity. The spoiled materials are treated through regeneration or waste disposal processes. All other processes have random variations only in the cycle time. The objective function of the optimization is minimizing the total cost, which is composed of setup and inventory holding costs as well as the capital costs of constructing processes and storage units. A novel production and inventory analysis, the PSW (Periodic Square Wave) model, provides a judicious graphical method to find the upper and lower bounds of random flows. The advantage of this model is that it provides a set of simple analytic solutions while also maintaining a realistic description of the random material flows between processes and storage units; as a consequence of these analytic solutions, the computation burden is significantly reduced.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.374-384
• /
• 2012

Utilizing artificial noise (AN) is a good means to guarantee security against eavesdropping in a multi-inputmulti-output system, where the AN is designed to lie in the null space of the legitimate receiver's channel direction information (CDI). However, imperfect CDI will lead to noise leakage at the legitimate receiver and cause significant loss in the achievable secrecy rate. In this paper, we consider a delayed feedback system, and investigate the impact of delayed CDI on security by using a transmit beamforming and AN scheme. By exploiting the Gauss-Markov fading spectrum to model the feedback delay, we derive a closed-form expression of the upper bound on the secrecy rate loss, where $N_t$ = 2. For a moderate number of antennas where $N_t$ > 2, two special cases, based on the first-order statistics of the noise leakage and large number theory, are explored to approximate the respective upper bounds. In addition, to maintain a constant signal-to-interferenceplus-noise ratio degradation, we analyze the corresponding delay constraint. Furthermore, based on the obtained closed-form expression of the lower bound on the achievable secrecy rate, we investigate an optimal power allocation strategy between the information signal and the AN. The analytical and numerical results obtained based on first-order statistics can be regarded as a good approximation of the capacity that can be achieved at the legitimate receiver with a certain number of antennas, $N_t$. In addition, for a given delay, we show that optimal power allocation is not sensitive to the number of antennas in a high signal-to-noise ratio regime. The simulation results further indicate that the achievable secrecy rate with optimal power allocation can be improved significantly as compared to that with fixed power allocation. In addition, as the delay increases, the ratio of power allocated to the AN should be decreased to reduce the secrecy rate degradation.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.73-85
• /
• 2000

The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.88-102
• /
• 2006

In multimedia information retrieval, multimedia data are represented as vectors in high dimensional space. To search these vectors effectively, a variety of indexing methods have been proposed. However, the performance of these indexing methods degrades dramatically with increasing dimensionality, which is known as the dimensionality curse. To resolve the dimensionality curse, dimensionality reduction methods have been proposed. They map feature vectors in high dimensional space into the ones in low dimensional space before indexing the data. This paper proposes a method for dimensionality reduction based on a function approximating the Euclidean distance, which makes use of the norm and angle components of a vector. First, we identify the causes of the errors in angle estimation for approximating the Euclidean distance, and discuss basic directions to reduce those errors. Then, we propose a novel method for dimensionality reduction that composes a set of subvectors from a feature vector and maintains only the norm and the estimated angle for every subvector. The selection of a good reference vector is important for accurate estimation of the angle component. We present criteria for being a good reference vector, and propose a method that chooses a good reference vector by using Levenberg-Marquardt algorithm. Also, we define a novel distance function, and formally prove that the distance function lower-bounds the Euclidean distance. This implies that our approach does not incur any false dismissals in reducing the dimensionality effectively. Finally, we verify the superiority of the proposed method via performance evaluation with extensive experiments.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.10
• /
• pp.1139-1146
• /
• 2012

An alternative approach for topology optimization of steady incompressible Navier-Stokes flow problems is presented by using P1 nonconforming finite elements. This study is the extended research of the earlier application of P1 nonconforming elements to topology optimization of Stokes problems. The advantages of the P1 nonconforming elements for topology optimization of incompressible materials based on locking-free property and linear shape functions are investigated if they are also valid in fluid equations with the inertia term. Compared with a mixed finite element formulation, the number of degrees of freedom of P1 nonconforming elements is reduced by using the discrete divergence-free property; the continuity equation of incompressible flow can be imposed by using the penalty method into the momentum equation. The effect of penalty parameters on the solution accuracy and proper bounds will be investigated. While nodes of most quadrilateral nonconforming elements are located at the midpoints of element edges and higher order shape functions are used, the present P1 nonconforming elements have P1, {1, x, y}, shape functions and vertex-wisely defined degrees of freedom. So its implentation is as simple as in the standard bilinear conforming elements. The effectiveness of the proposed formulation is verified by showing examples with various Reynolds numbers.