• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.911-917
• /
• 2017

There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.

• Journal of Information Technology Applications and Management
• /
• v.13 no.2
• /
• pp.87-97
• /
• 2006

Due to limited radio resource, an effective paging strategy is essential for improving the utility of radio channels. In current mobile communication networks, when a mobile-terminated call occurs, the network locates the mobile by paging all cells within the location area simultaneously. In this study, we introduces paging strategies that can page some cells or only one cell within the location area to reduce paging cost on radio channels using paging agents. We propose another new paging strategy that can page only one cell within the location area and may have better performance. We also compare the performance of our proposed paging strategy with the performance of the current simultaneous paging strategy and some new paging strategies using paging agents. This paper suggests the most effective paging strategy using mathematical models. The result of this research will be used to select a proper paging strategy in the mobile communication networks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.2
• /
• pp.27-36
• /
• 1986

This paper deals with four types of multiple unit simultaneous auctions such as the discriminating. uniform-price, lowest accepted-price, and progressive auctions. These auctions have been studied by Vickrey, Ortega-Reichert, Herris and Raviv and so forth. In this paper, their studies are extended to the case with a reserve price and an entry fee, and then the equilibrium bidding strategy are presented. Further, those are analyzed with respect to the change of a reserve price, an entry fee, and the number of bidders and objects.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.493-496
• /
• 2004

An effective paging strategy is essential for improving the utility of radio channels. This paper proposes a two-step paging strategy which involves using base station paging agents to page a single cell at each paging. An analytical model is used to evaluate the performance of the proposed strategy. The proposed strategy is compared with the traditional simultaneous paging strategy and a recent proposal using the base station paging agents. The numerical results showed that the proposed strategy proficiently reduces paging cost on radio channels compared with other paging strategies.

• ETRI Journal
• /
• v.25 no.1
• /
• pp.55-58
• /
• 2003

We propose a new paging strategy to reduce paging cost by adding paging agents at base stations. When a mobile-terminated call occurs, the base stations look up the paging agents to determine if terminal paging is actually to be made. An analytical model based on a Markov chain is used to evaluate the performance of the proposed strategy. The numerical results show that the proposed strategy significantly reduces the paging cost compared with the simultaneous paging strategy.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.31-39
• /
• 2015

In this paper, we study the bargaining strategy of a distributor who sells vertically differentiated, i.e. high and low brand products. We derive and analyze the equilibrium solutions for both simultaneous and sequential bargaining games among the distributor, the high brand product manufacturer and the low brand product manufacturer. The result shows that the optimal bargaining strategy for the distributor heavily depends on the relative quality and price level of the low brand product comparing to those of the high brand product. It is also shown that, for more bargaining profit, the distributor has strong motivation to prefer a low brand product which has lower quality level per unit price.

• BMB Reports
• /
• v.49 no.9
• /
• pp.455-456
• /
• 2016

Mutations of APC and KRAS are frequently observed in human colorectal cancers (CRCs) and the Wnt/β-catenin and Ras pathways are consequently activated in a significant proportion of CRC patients. Mutations in these two genes are also known to synergistically induce progression of CRCs. Through a series of studies, we have demonstrated that inhibition of the Wnt/β-catenin signaling pathway negatively regulates Ras stability, therefore, Ras abundance is increased together with β-catenin in both mice and human CRCs harboring adenomatous polyposis coli (APC) mutations. In a recent study, we identified KY1220, a small molecule that simultaneously degrades β-catenin and Ras by inhibition of the Wnt/β-catenin pathway, and obtained its derivative KYA1797K, which has improved activity and solubility. We found that KYA1797K binds the RGS domain of axin and enhances the binding affinity of β-catenin or Ras with the β-catenin destruction complex components, leading to simultaneous destabilization of β-catenin and Ras via GSK3β activation. By using both in vitro and in vivo studies, we showed that KYA1797K suppressed the growth of CRCs harboring APC and KRAS mutations through destabilization of β-catenin and Ras. Therefore, our findings indicate that the simultaneous destabilization of β-catenin and Ras via targeting axin may serve as an effective strategy for inhibition of CRCs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.4
• /
• pp.145-153
• /
• 2014

In this paper, we study the bargaining strategy of a manufacturer who sells a product through the online and offline distribution channels. To do this, we derive and analyze the equilibrium solutions for both simultaneous and sequential bargaining games. The result shows that the optimal bargaining strategy heavily depends on the size of the online distribution channel's loyal customers and the difference between the retail prices of the online and the offline distribution channels. It is also shown that, in some cases, the online distribution channel has incentive to downsize its loyal customers and its retail price for a better bargaining outcome.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.1084-1087
• /
• 2000

This paper presents a new approach to evaluate the maximum number of simultaneous switching gates of a given combinational circuit. The new approach is based on an iterative method proposed by Sinogi et al. and applies a simulated annealing strategy to search jot a new solution. The experimental evaluation using ISCAS’85 benchmark circuits shows that the proposed approach has attained an excellent improvement compared with other rotated methods including the iterative method.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.699-704
• /
• 2000

The present paper deals with a multiobjective optimization method based on the co-evolutionary genetic strategy. The co-evolutionary strategy carries out the multiobjective optimization in such way that it optimizes individual objective function as compared with each generation's value while there are more than two genetic evolutions at the same time. In this study, the designs that are out of the given constraint map compared with other objective function value are excepted by the penalty. The proposed multiobjective genetic algorithms are distinguished from other optimization methods because it seeks for the optimized value through the simultaneous search without the help of the single-objective values which have to be obtained in advance of the multiobjective designs. The proposed strategy easily applied to well-developed genetic algorithms since it doesn't need any further formulation for the multiobjective optimization. The paper describes the co-evolutionary strategy and compares design results on the simple structural optimization problem.