• Title/Summary/Keyword: Hard K-means

Search Result 236, Processing Time 0.027 seconds

Stereotactic Mesencephalotomy for Cancer - Related Facial Pain

  • Kim, Deok-Ryeong;Lee, Sang-Won;Son, Byung-Chul
    • Journal of Korean Neurosurgical Society
    • /
    • v.56 no.1
    • /
    • pp.71-74
    • /
    • 2014
  • Cancer-related facial pain refractory to pharmacologic management or nondestructive means is a major indication for destructive pain surgery. Stereotactic mesencephalotomy can be a valuable procedure in the management of cancer pain involving the upper extremities or the face, with the assistance of magnetic resonance imaging (MRI) and electrophysiologic mapping. A 72-year-old man presented with a 3-year history of intractable left-sided facial pain. When pharmacologic and nondestructive measures failed to provide pain alleviation, he was reexamined and diagnosed with inoperable hard palate cancer with intracranial extension. During the concurrent chemoradiation treatment, his cancer-related facial pain was aggravated and became medically intractable. After careful consideration, MRI-based stereotactic mesencephalotomy was performed at a point 5 mm behind the posterior commissure, 6 mm lateral to and 5 mm below the intercommissural plane using a 2-mm electrode, with the temperature of the electrode raised to $80^{\circ}C$ for 60 seconds. Up until now, the pain has been relatively well-controlled by intermittent intraventricular morphine injection and oral opioids, with the pain level remaining at visual analogue scale 4 or 5. Stereotactic mesencephalotomy with the use of high-resolution MRI and electrophysiologic localization is a valuable procedure in patients with cancer-related facial pain.

A Study on the Resolver Interface using a Rotor Position Detector Method with DFT (DFT에 의한 회전자 위치 검출 방법을 사용한 레졸버 인터페이스에 관한 연구)

  • Hwang, Lark-Hoon;Na, Seung-Kwon;Choi, Gi-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.10
    • /
    • pp.4550-4560
    • /
    • 2011
  • Generally, a optical encoder is used to detect velocity for controling the electronic motor, the resolver is used when it is hard structurally to adjust encoder to electronic motor. so, the resolver has weakness in price in compare with encoder, but in case of controling the position of a magnetic polar, the resolver has stead detecting the absolute position of a rotator. This study is about the digital programing velocity detector which uses a minimum hardware : filter for detecting the revolve speed and rotor position of the motor by means of the resolver.

A Study for Developing Process of a Bus Body Structure for the Rollover Safety (전복 안전성 향상을 위한 고속 버스 차체 개발 프로세스에 관한 연구)

  • Park, Jae-Woo;Park, Jong-Chan;Yoo, Seung-Won
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.18 no.2
    • /
    • pp.31-38
    • /
    • 2010
  • Bus manufacturers have tested and studied the dynamic collapse behavior of a bus body structure in rollover since UN ECE established ECE Regulation 66 to provide the requirement for the strength of bus structure. In spite of the costly cycles of practical tests, however, it is still a hard task to meet the rollover regulation by means of local reinforcements in the bus structure. Therefore it is necessary to develop a well designed strategy for the rollover strength implemented in the early stage of vehicle development. In this study, the suitable development method for each design stage from a component to complete body structure was considered to make a well-established development process of a bus body structure for rollover safety. For the efficient approach of the concept design stage, a numerical model based on the plastic hinge theory was used instead of detailed shell models. After setting up the concept design for the component size and geometry, the shell model was used to confirm and optimize the whole structure composition. The process developed in this study was practically used as an effective method to predict the rollover behavior of a new bus body structure.

Transmission Network Expansion Planning for the Penetration of Renewable Energy Sources - Determining an Optimal Installed Capacity of Renewable Energy Sources

  • Kim, Sung-Yul;Shin, Je-Seok;Kim, Jin-O
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.4
    • /
    • pp.1163-1170
    • /
    • 2014
  • Due to global environmental regulations and policies with rapid advancement of renewable energy technologies, the development type of renewable energy sources (RES) in power systems is expanding from small-scale distributed generation to large-scale grid-connected systems. In the near future, it is expected that RES achieves grid parity which means the equilibrium point where the power cost of RES is equal to the power costs of conventional generators. However, although RES would achieve the grid parity, the cost related with development of large-scale RES is still a big burden. Furthermore, it is hard to determine a suitable capacity of RES because of their output characteristics affected by locations and weather effects. Therefore, to determine an optimal capacity for RES becomes an important decision-making problem. This study proposes a method for determining an optimal installed capacity of RES from the business viewpoint of an independent power plant (IPP). In order to verify the proposed method, we have performed case studies on real power system in Incheon and Shiheung areas, South Korea.

An Improved Cat Swarm Optimization Algorithm Based on Opposition-Based Learning and Cauchy Operator for Clustering

  • Kumar, Yugal;Sahoo, Gadadhar
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.1000-1013
    • /
    • 2017
  • Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new meta-heuristic algorithm that has been applied to solve various optimization problems and it provides better results in comparison to other similar types of algorithms. However, this algorithm suffers from diversity and local optima problems. To overcome these problems, we are proposing an improved version of the CSO algorithm by using opposition-based learning and the Cauchy mutation operator. We applied the opposition-based learning method to enhance the diversity of the CSO algorithm and we used the Cauchy mutation operator to prevent the CSO algorithm from trapping in local optima. The performance of our proposed algorithm was tested with several artificial and real datasets and compared with existing methods like K-means, particle swarm optimization, and CSO. The experimental results show the applicability of our proposed method.

QoS Aware Energy Allocation Policy for Renewable Energy Powered Cellular Networks

  • Li, Qiao;Wei, Yifei;Song, Mei;Yu, F. Richard
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4848-4863
    • /
    • 2016
  • The explosive wireless data service requirement accompanied with carbon dioxide emission and consumption of traditional energy has put pressure on both industria and academia. Wireless networks powered with the uneven and intermittent generated renewable energy have been widely researched and lead to a new research paradigm called green communication. In this paper, we comprehensively consider the total generated renewable energy, QoS requirement and channel quality, then propose a utility based renewable energy allocation policy. The utility here means the satisfaction degree of users with a certain amount allocated renewable energy. The energy allocation problem is formulated as a constraint optimization problem and a heuristic algorithm with low complexity is derived to solve the raised problem. Numerical results show that the renewable energy allocation policy is applicable not only to soft QoS, but also to hard QoS and best effort QoS. When the renewable energy is very scarce, only users with good channel quality can achieve allocated energy.

Rule-Based Fuzzy-Neural Networks Using the Identification Algorithm of the GA Hybrid Scheme

  • Park, Ho-Sung;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.1
    • /
    • pp.101-110
    • /
    • 2003
  • This paper introduces an identification method for nonlinear models in the form of rule-based Fuzzy-Neural Networks (FNN). In this study, the development of the rule-based fuzzy neural networks focuses on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The FNN modeling and identification environment realizes parameter identification through synergistic usage of clustering techniques, genetic optimization and a complex search method. We use a HCM (Hard C-Means) clustering algorithm to determine initial apexes of the membership functions of the information granules used in this fuzzy model. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are then adjusted using the identification algorithm of a GA hybrid scheme. The proposed GA hybrid scheme effectively combines the GA with the improved com-plex method to guarantee both global optimization and local convergence. An aggregate objective function (performance index) with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. According to the selection and adjustment of the weighting factor of this objective function, we reveal how to design a model having sound approximation and generalization abilities. The proposed model is experimented with using several time series data (gas furnace, sewage treatment process, and NOx emission process data from gas turbine power plants).

A Study on the Type and Symbolism of Yopae in the Ere of the Three Kingdoms - Mainly Classifying the Type of the Big Yopae - (삼국시대(三國時代) 요패(腰佩)의 형식(形式) 및 그 상징성(象徵性)에 대한 연구(硏究) - 대형요패(大形腰佩)의 형식분류(形式分類)를 중심(中心)으로 -)

The Development of Mobile Applications to Attract Customers in a Continuous Rewards (연속적인 리워드로 고객을 유치하는 모바일 어플리케이션의 개발)

  • Lim, JinSeop;Shim, Jeachang
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.5
    • /
    • pp.948-956
    • /
    • 2016
  • Many franchise stores are in the surrounding. These stores offer many membership services. But, small traders do not provide much customer management service. For example, non-franchised cafes provide the services through paper coupons. However, most of paper coupons are available only in one store that issued the coupon. Besides, these coupons are in stamp format. Due to the absence of customers' management service, it is hard for small traders to attract customers compared to the franchise. Therefore, in this paper, We had implemented a mobile application, and applied to new customer management service in order to increase the price competitiveness of small traders. This service issues electronic coupon through a mobile app. customers can receive a relatively large amount of discount, and a deadline of coupons are short. When customers use coupons, new coupons are issued at the same time. This structure can be powerful means to lead customers' frequent visit. Small traders can gain a lot of regular customers by using this service.

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

  • Chung, Jibok;Choi, Byungcheon
    • Journal of Distribution Science
    • /
    • v.15 no.7
    • /
    • pp.35-41
    • /
    • 2017
  • Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.