• Title/Summary/Keyword: Local Solution

Search Result 1,347, Processing Time 0.028 seconds

Distributed Time Division Piconet Coexistence Using Local Time Offset Exchange (로컬 오프셋을 이용한 분산 시간 분리 피코넷 충돌회피 방법론)

  • Park, Yongsuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1447-1453
    • /
    • 2014
  • Wireless Body Area Networks (WBAN), standardized as IEEE 802.15.6, enable digital devices on/around the human body to communicate with one another. WBAN is essentially a person's piconet consisting of a master (mobile) device and several slave devices, which follows his/her mobility pattern, and hence, occasionally collides with another piconet as people meet or pass by. As such, a mechanism to detect collision and avoid interference is needed for intra-piconet communications. In this paper, we focus on this notorious problem of piconet collision and propose Distributed Time Division Piconet Coexistence (DTDPC) using local time offset exchange as a simple, attractive solution. The proposed DTDPC provides different level of services for various applications. Besides our simulation results have shown that the proposed solution outperforms the conventional CSMA protocols.

Coalitonal Game Theoretic Power Control for Delay-Constrained Wireless Sensor Networks (지연제약 무선 센서 네트워크를 위한 협력게임 기법에 기반한 전송 파워 제어 기법)

  • Byun, Sang-Seon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.107-110
    • /
    • 2015
  • In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

  • PDF

Distribution System Reconfiguration Using the PC Cluster based Parallel Adaptive Evolutionary Algorithm

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho;Hwang Gi-Hyun;Yoon Yoo-Soo
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.269-279
    • /
    • 2005
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

Experimental Study for Construction of Mouth Care in Chemotherapy Patients (화학요법을 받는 암환자의 구강간호전략을 위한 연구)

  • 변영순;김애경
    • Journal of Korean Academy of Nursing
    • /
    • v.26 no.2
    • /
    • pp.428-442
    • /
    • 1996
  • Stomatitis is a common toxicity associated with the administration of certain cancer chemotherapeutic agents used in the treatment of malignant tumors. It represents one of the most distressing side effects of cancer chemotherapy and can interfere with the patient's ability to eat, be the cause of much pain and discomfort, and require the use of potent analgesics. The situation also creates favorable conditions for local infection which may lead to septicemia. Several authors have identified the need to establish protocols for the control and treatment of the oral discomfort associated with oral mucositis as a result of chemotherapy. Thus this study attempted to development of oral care protocol for chemotherapy patients. The effects of the mouth care using sterile normal saline, nystatine solution on oral stomatitis were investigated in 30 patients on chemotherapy. The subsect were divided into three groups : control group : not gargling experimental group A : normal saline gargling (4 times a day) experimental group B : nystatine solution gargling(4 times a day) The Oral Assessment Guide (OAG) was used to assess oral status three times(once in the prechemotherapy period, on 5th, 10th day of post chemotherapy) Oral culture was used to assess oral infection on 5th day of postchemotherapy. Data was analyzed on SAS program which used repeated ANOVA, t-test, X/sup²test. The results are as follows : 1. The incidence of stomatitis was higher in the control group and experimental group A than in experimental group B.(X/sup²=0.002 P=0.001). The grade of stomatitis(mean of total score) for patients in the experimental group B were significantly lower than in the experimental group A F=1.96 P=0.0024). In incidence of tongue change, control group, experimental group B were significantly higher than experimental group B(F=6.84 P=0.0039). In control group and experimental group A. oral infection due to pathogenic bacteria were identified. In conclusion, mouth care with nystatine solution four times a day could reduce the incidence of stomatitis and secondary oral infection due to stomatitis. Thus active mouth care protocol which used to nystatine solution gargling need to prevention of stomatitis in chemotherapy patients.

  • PDF

Shear-induced structure and dynamics of hydrophobically modified hydroxy ethyl cellulose (hmHEC) in the presence of SDS

  • Tirtaatmadija, Viyada;Cooper-white, Justin J.;Gason, Samuel J.
    • Korea-Australia Rheology Journal
    • /
    • v.14 no.4
    • /
    • pp.189-201
    • /
    • 2002
  • The interaction between hydrophobically modified hydroxyethyl cellulose (hmHEC), containing approximately 1 wt% side-alkyl chains of $C_{16}$, and an anionic sodium dodecyl sulphate (SDS) surfactant was investigated. For a semi-dilute solution of 0.5 wt% hmHEC, the previously observed behaviour of a maximum in solution viscosity at intermediate SDS concentrations, followed by a drop at higher SDS concentrations, until above the cmc of surfactant when the solution resembles that of the unsubstituted polymer, was confirmed. Additionally, a two-phase region containing a hydrogel phase and a water-like supernatant was found at low SDS concentrations up to 0.2 wt%, a concentration which is akin to the critical association concentration, cac, of SDS in the presence of hmHEC. Above this concentration, SDS molecules bind strongly to form mixed micellar aggregates with the polymer alkyl side-chains, thus strengthening the network junctions, resulting in the observed increase in viscosity and elastic modulus of the solution. The shear behaviour of this polymer-surfactant complex during steady and step stress experiments was examined In great detail. Between SDS concentrations of 0.2 and 0.25 wt%, the shear viscosity of the hmHEC-polymer complex network undergoes shear-induced thickening, followed by a two-stage shear-induced fracture or break-up of the network. The thickening is thought to be due to structural rearrangement, causing the network of flexible polymers to expand, enabling some polymer hydrophobic groups to be converted from intra- to inter-chain associations. At higher applied stress, a partial local break-up of the network occurs, while at even higher stress, above the critical or network yield stress, a complete fracture of the network into small microgel-like units, Is believed to occur. This second network rupture is progressive with time of shear and no steady state in viscosity was observed even after 300 s. The structure which was reformed after the cessation of shear is found to be significantly different from the original state.

Co-Evolutionary Model for Solving the GA-Hard Problems (GA-Hard 문제를 풀기 위한 공진화 모델)

  • Lee Dong-Wook;Sim Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.3
    • /
    • pp.375-381
    • /
    • 2005
  • Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.

Combined Artificial Bee Colony for Data Clustering (융합 인공벌군집 데이터 클러스터링 방법)

  • Kang, Bum-Su;Kim, Sung-Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.203-210
    • /
    • 2017
  • Data clustering is one of the most difficult and challenging problems and can be formally considered as a particular kind of NP-hard grouping problems. The K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, it has high possibility to trap in local optimum and high variation of solutions with different initials for the large data set. Therefore, we need study efficient computational intelligence method to find the global optimal solution in data clustering problem within limited computational time. The objective of this paper is to propose a combined artificial bee colony (CABC) with K-means for initialization and finalization to find optimal solution that is effective on data clustering optimization problem. The artificial bee colony (ABC) is an algorithm motivated by the intelligent behavior exhibited by honeybees when searching for food. The performance of ABC is better than or similar to other population-based algorithms with the added advantage of employing fewer control parameters. Our proposed CABC method is able to provide near optimal solution within reasonable time to balance the converged and diversified searches. In this paper, the experiment and analysis of clustering problems demonstrate that CABC is a competitive approach comparing to previous partitioning approaches in satisfactory results with respect to solution quality. We validate the performance of CABC using Iris, Wine, Glass, Vowel, and Cloud UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KABCK (K-means+ABC+K-means) is better than ABCK (ABC+K-means), KABC (K-means+ABC), ABC, and K-means in our simulations.

A simple finite element formulation for large deflection analysis of nonprismatic slender beams

  • AL-Sadder, Samir Z.;Othman, Ra'ad A.;Shatnawi, Anis S.
    • Structural Engineering and Mechanics
    • /
    • v.24 no.6
    • /
    • pp.647-664
    • /
    • 2006
  • In this study, an improved finite element formulation with a scheme of solution for the large deflection analysis of inextensible prismatic and nonprismatic slender beams is developed. For this purpose, a three-noded Lagrangian beam-element with two dependent degrees of freedom per node (i.e., the vertical displacement, y, and the actual slope, $dy/ds=sin{\theta}$, where s is the curved coordinate along the deflected beam) is used to derive the element stiffness matrix. The element stiffness matrix in the global xy-coordinate system is achieved by means of coordinate transformation of a highly nonlinear ($6{\times}6$) element matrix in the local sy-coordinate. Because of bending with large curvature, highly nonlinear expressions are developed within the global stiffness matrix. To achieve the solution after specifying the proper loading and boundary conditions, an iterative quasi-linearization technique with successive corrections are employed considering these nonlinear expressions to remain constant during all iterations of the solution. In order to verify the validity and the accuracy of this study, the vertical and the horizontal displacements of prismatic and nonprismatic beams subjected to various cases of loading and boundary conditions are evaluated and compared with analytic solutions and numerical results by available references and the results by ADINA, and excellent agreements were achieved. The main advantage of the present technique is that the solution is directly obtained, i.e., non-incremental approach, using few iterations (3 to 6 iterations) and without the need to split the stiffness matrix into elastic and geometric matrices.

Improvement Approach on the Plant Layout Based on Tabu Search (Tabu 탐색 기법을 활용한 개선적 공장 설비배치)

  • Kim, Chae-Bogk
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.6 no.6
    • /
    • pp.469-477
    • /
    • 2016
  • This study develops an approach to assign numbers of facilities (rectangular shape) in a given plant and compares the test results by proposed approach with those by approaches in the literature. An improvement approach is proposed to minimize material handling cost given initial layout. Like popular heuristic approaches, the developed heuristic approach employs interchange routine to improve material handling cost in current layout. Horizontal interchange and vertical interchange procedures are applied to obtain better solution. Also, it is possible to rotate facility layout when the sizes of both facilities are same. However, the proposed approach generates good solutions without shape distortion. That means the shape of facilities remains rectangle in the final solution. In addition, the improve approach can find global optimal solution from local optimal solution by applying Tabu search technique. Based on 25 test problems in the literature, we obtained better solutions than other facility layout approaches in the literature when there are many facilities.

Analysis and Solution of Contracting out of Public Libraries in Korea (공공도서관 위탁경영의 분석과 해법)

  • Yoon, Hee-Yoon
    • Journal of Korean Library and Information Science Society
    • /
    • v.39 no.3
    • /
    • pp.3-26
    • /
    • 2008
  • In most countries the public library run as a public institution and a symbolic icon for a democratic society. Therefore public library's publicity is absolutely essential value and profit should not be made on their maintenance. More recently, as the government's budget spending increase, however, many local governments contract out to manage an entire library or new library system. Three main reasons could be identified. Firstly, alternative solutions for maintenance were supposed to save money. Secondly, contracting out provides an opportunity to improve the quality of service delivery. Thirdly, central government and some local authorities had very strong ideological reasons for contracting out of the public libraries. However, nothing proved that alternative maintenance had caused lower cost and better services in Korea. In this paper, the reasoning of a move from the traditional form of public library governance is discussed, as well as the advantages and disadvantages contracting out of the public libraries, and suggested various practical solutions in Korea.

  • PDF