• Communications for Statistical Applications and Methods
• /
• v.22 no.6
• /
• pp.575-587
• /
• 2015

The development in data collection techniques results in high dimensional data sets, where discrimination is an important and commonly encountered problem that are crucial to resolve when high dimensional data is heterogeneous (non-common variance covariance structure for classes). An example of this is to classify microbial habitat preferences based on codon/bi-codon usage. Habitat preference is important to study for evolutionary genetic relationships and may help industry produce specific enzymes. Most classification procedures assume homogeneity (common variance covariance structure for all classes), which is not guaranteed in most high dimensional data sets. We have introduced regularized elimination in partial least square coupled with QDA (rePLS-QDA) for the parsimonious variable selection and classification of high dimensional heterogeneous data sets based on recently introduced regularized elimination for variable selection in partial least square (rePLS) and heterogeneous classification procedure quadratic discriminant analysis (QDA). A comparison of proposed and existing methods is conducted over the simulated data set; in addition, the proposed procedure is implemented to classify microbial habitat preferences by their codon/bi-codon usage. Five bacterial habitats (Aquatic, Host Associated, Multiple, Specialized and Terrestrial) are modeled. The classification accuracy of each habitat is satisfactory and ranges from 89.1% to 100% on test data. Interesting codon/bi-codons usage, their mutual interactions influential for respective habitat preference are identified. The proposed method also produced results that concurred with known biological characteristics that will help researchers better understand divergence of species.

• Journal of the Korean Society of Safety
• /
• v.32 no.4
• /
• pp.1-6
• /
• 2017

Functionally Graded Materials (FGM) as advanced heterogeneous composite materials have a higher performance than a conventional composite or bimaterial composite under some severe environments. As a heterogeneous material, FGM is commonly used in spacecraft, defense, nuclear and automotive industries due to its excellent properties. The purposes of this study are to evaluate the stress distribution and crack behaviors by the multiscale simulation. FGM contains two or more than two materials that the composition is structured continuously. Two types of FGM model are suggested, which are created by arbitrary prediction of the volume fraction and the exponential function. Aluminum as the metal matrix constituent and silicon carbide as the ceramic particle constituent are structured gradually by two types and the three point bending test also estimated. Moreover, two kinds of crack location were introduced in order to get the influences of material property distribution on the stress intensity factor. From the results we found that the stress intensity factors are increased in the case from softer to stiffer material, while vice versa.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.360-366
• /
• 2011

In this paper, we investigate the problem of power allocation in a heterogeneous network that is composed of a pair of cognitive users (CUs) and an infrastructure-based primary network. Since CUs have only limited effective spectrum-sensing ability and primary users (PUs) are not active all the time in all locations and licensed bands, we set up a new multi-area model to characterize the heterogeneous network. A novel combined interference-avoidance policy corresponding to different PU-appearance situations is introduced to protect the primary network from unacceptable disturbance and to increase the spectrum secondary-reuse efficiency. We use dual decomposition to transform the original power allocation problem into a two-layer optimization problem. We propose a low-complexity joint power-optimizing method to maximize the transmission rate between CUs, taking into account both the individual power-transmission constraints and the combined interference power constraint of the PUs. Numerical results show that for various values of the system parameters, the proposed joint optimization method with combined PU protection is significantly better than the opportunistic spectrum access mode and other heuristic approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2243-2257
• /
• 2019

A heterogeneous cellular network (HCN) is useful to increase the spectral and energy efficiency of wireless networks and to reduce the traffic load from the macro cell. The performance of the secondary user equipment (SUE) is affected by interference from the eNodeB (eNB) in a macro cell. To decrease the interference between the macro cell and the small cell, allocating resources properly is essential to an HCN. This study considers the scenario of a software-defined heterogeneous cellular network and performs the resource allocation process. First, we show the system model of HCN and formulate the optimization problem. The optimization problem is a complex process including power and frequency resource allocation, which imposes an extremely high complexity to the HCN. Therefore, a hierarchical resource allocation scheme is proposed, which including subchannel selection and a particle swarm optimization (PSO)-based power allocation algorithm. Simulation results show that the proposed hierarchical scheme is effective in improving the system capacity and energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4742-4770
• /
• 2019

Cloud computing provides a broad range of services like operating systems, hardware, software and resources. Availability of these services encourages data owners to outsource their intensive computations and massive data to the cloud. However, considering the untrusted nature of cloud server, it is essential to encrypt the data before outsourcing it to the cloud. Unfortunately, this leads to a challenge when it comes to providing search functionality for encrypted data located in the cloud. To address this challenge, this paper presents a public key encryption with equality test for heterogeneous systems (PKE-ET-HS). The PKE-ET-HS scheme simulates certificateless public encryption with equality test (CLE-ET) with the identity-based encryption with equality test (IBE-ET). This scheme provides the authorized cloud server the right to actuate the equivalence of two messages having their encryptions performed under heterogeneous systems. Basing on the random oracle model, we construct the security of our proposed scheme under the bilinear Diffie-Hellman (BDH) assumption. Eventually, we evaluate the size of storage, computation complexities, and properties with other related works and illustrations indicate good performance from our scheme.

• Smart Media Journal
• /
• v.11 no.3
• /
• pp.18-25
• /
• 2022

Neuromorphic computing generally shows significantly better power, area, and speed performance than neural network computation using CPU and GPU. These characteristics are suitable for resource-constrained IoT environments where energy consumption is important. However, there is a problem in that it is necessary to modify the source code for environment setting and application operation according to heterogeneous IoT devices that support neuromorphic computing. To solve these problems, NAAL was proposed and implemented in this paper. NAAL provides functions necessary for IoT device control and neuromorphic architecture abstraction and inference model operation in various heterogeneous IoT device environments based on common APIs of NAAL. NAAL has the advantage of enabling additional support for new heterogeneous IoT devices and neuromorphic architectures and computing devices in the future.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 2001.11a
• /
• pp.69-76
• /
• 2001

The coal gasification process of a slurry feed type, entrained-flow coal gasifier was numerically predicted in this paper. By divding the complicated coal gasification process into several simplified stages suh as slurry evaporation, coal devolitilisation and two-phase reactions coupled with turbulent flow and two-phase heat transfer, a comprehensive numerical model was constructed to simulate the coal gasification process. The k-$\varepsilon$turbulence model was used for the gas phase flow while the Random-trajectory model was applied to describe the behavior of the coal slurry particles. The unreacted-core shrinking model and modified Eddy Break-Up(EBU) model were used to simulate the heterogeneous and homogeneous reactions, respectively. The simulation results obtained the detailed informations about the flow field, temperature inside the gasifier. Meanwhile, the simulation results were compared with the experimental data as function of $O_2$/coal ratio. It illustrated that the calculated carbon conversions agreed with the measured ones and that the measurd quality of the atngas was better than the calculated one when the $O_2$/coal ratio increases. The result was related with the total heat loss through the gasifier and uncertain kinetics for the heterogeneous reactions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.200-207
• /
• 2001

In this paper, we propose an HMM(Hidden Markov modeJ)-MLP(Multi-layer perceptron) hybrid model for recognizing legal words on the English bank check. We adopt an explicit segmentation-based word level architecture to implement an HMM engine with nonscaled and non-normalized symbol vectors. We also introduce an MLP for implicit segmentation-based word recognition. The final recognition model consists of a hybrid combination of the HMM and MLP with a new hybrid probability measure. The main contributions of this model are a novel design of the segmentation-based variable length HMMs and an efficient method of combining two heterogeneous recognition engines. ExperimenLs have been conducted using the legal word database of CENPARMI with encouraging results.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.