• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• 방송공학회논문지
• /
• 제14권3호
• /
• pp.280-287
• /
• 2009

IPTV(Internet Protocol Television)기술은 통신과 방송의 새로운 융합 기술로 다양한 양방향 TV 서비스를 제공한다. 이러한 서비스를 제공받기 위해서는 TV에 연결된 셋톱박스 (STB, Set-Top Box)와 정당한 가입자의 스마트카드 간의 상호 인증이 이루어져야 한다. 본 논문에서는 한 조직 내에서 직위나 부서 등과 같은 특성(속성) 값들에 따라, IPTV 서비스를 이용할 수 있도록 하는 속성기반 인증 기법을 제안하고, 제안하는 기법이 안전함을 보인다. 제안하는 기법에서 사용자는 자신의 아이디, 패스워드와 스마트카드를 이용하여 인증 메시지를 생성하는데, 이 때 자신에게 속한 다양한 속성을 이용할 수 있기 때문에 가입자는 한 번의 등록으로 속성에 따라 다양한 서비스를 제공받을 수 있다는 장점이 있다. 우리가 아는 한도 내에서는, 본 논문에서 제안하는 기법이 IPTV 환경이 조성된 어떤 조직에도 적용할 수 있는 최초의 속성인증 기법이다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제29권3호
• /
• pp.237-251
• /
• 2020

Purpose The research was studied the hierarchical Hangul emotion index by organizing all the emotions which SNS users are thinking. As a preliminary study by the researcher, the English-based Plutchick (1980)'s emotional standard was reinterpreted in Korean, and a hashtag with implicit meaning on SNS was studied. To build a multidimensional emotion dictionary and classify three-dimensional emotions, an emotion seed was selected for the composition of seven emotion sets, and an emotion word dictionary was constructed by collecting SNS hashtags derived from each emotion seed. We also want to explore the priority of each Hangul emotion index. Design/methodology/approach In the process of transforming the matrix through the vector process of words constituting the sentence, weights were extracted using TF-IDF (Term Frequency Inverse Document Frequency), and the dimension reduction technique of the matrix in the emotion set was NMF (Nonnegative Matrix Factorization) algorithm. The emotional dimension was solved by using the characteristic value of the emotional word. The cosine distance algorithm was used to measure the distance between vectors by measuring the similarity of emotion words in the emotion set. Findings Customer needs analysis is a force to read changes in emotions, and Korean emotion word research is the customer's needs. In addition, the ranking of the emotion words within the emotion set will be a special criterion for reading the depth of the emotion. The sentiment index study of this research believes that by providing companies with effective information for emotional marketing, new business opportunities will be expanded and valued. In addition, if the emotion dictionary is eventually connected to the emotional DNA of the product, it will be possible to define the "emotional DNA", which is a set of emotions that the product should have.

• Journal of Advanced Marine Engineering and Technology
• /
• 제38권3호
• /
• pp.253-261
• /
• 2014

본 연구에서는 스퍼 유성기어시스템 2단, 헬리컬기어 시스템 1단으로 구성되어 있고, 메인 축과 증속기가 플랜지 결합되어 있는 동력분기식 2.5MW 풍력발전기에 대해 진동해석을 수행하였다. 유성기어시스템, 헬리컬기어시스템, 메인 축 등은 MASTA 상용프로그램으로 모델링하고, 기어박스 케이스, 토크암, 유성캐리어, 플랜지 등은 유한요소법으로 모델링하였으며, 부분구조합성법으로 조합하여 진동해석을 수행하였다. 2.5MW 동력분기식 풍력발전기 기어트레인의 고유진동 특성 해석을 수행하였고, 블레이드 풍하중에 의한 가진, 질량불평형, 축 어긋남 등에 발생하는 가진원에 대해 위험속도 분석을 하였다.

• Journal of Biosystems Engineering
• /
• 제33권6호
• /
• pp.438-445
• /
• 2008

The purpose of this study was to develop a measurement model based on PLS (Partial least square) method for blood pressures. Measurement system for blood pressure signals consisted of pressure sensor, va interface and embedded module. A mercury sphygmomanometer was connected with the measurement system through 3-way stopcock and used as reference of blood pressures. The blood pressure signals of 20 subjects were measured and tests were repeated 5 times per each subject. Total of 100 data were divided into a calibration set and a prediction set. The PLS models were developed to determine the systolic and the diastolic blood pressures. The PLS models were evaluated by the standard methods of the British Hypertension Society (BHS) protocol and the American Association for the Advancement of Medical Instrumentation (AAMI). The results of the PLS models were compared with those of MAA (maximum amplitude algorithm). The measured blood pressures with PLS method were highly correlated to those with a mercury sphygmomanometer in the systolic ($R^2=0.85$) and the diastolic blood pressure ($R^2=0.84$). The results showed that the PLS models were the effective tools for blood pressure measurements with high accuracy, and satisfied the standards of the BHS protocol and the AAMI.

• Restorative Dentistry and Endodontics
• /
• 제37권3호
• /
• pp.142-148
• /
• 2012

Objectives: We analyzed gene-expression profiles after 14 day odontogenic induction of human dental pulp cells (DPCs) using a DNA microarray and sought candidate genes possibly associated with mineralization. Materials and Methods: Induced human dental pulp cells were obtained by culturing DPCs in odontogenic induction medium (OM) for 14 day. Cells exposed to normal culture medium were used as controls. Total RNA was extracted from cells and analyzed by microarray analysis and the key results were confirmed selectively by reverse-transcriptase polymerase chain reaction (RT-PCR). We also performed a gene set enrichment analysis (GSEA) of the microarray data. Results: Six hundred and five genes among the 47,320 probes on the BeadChip differed by a factor of more than two-fold in the induced cells. Of these, 217 genes were upregulated, and 388 were down-regulated. GSEA revealed that in the induced cells, genes implicated in Apoptosis and Signaling by wingless MMTV integration (Wnt) were significantly upregulated. Conclusions: Genes implicated in Apoptosis and Signaling by Wnt are highly connected to the differentiation of dental pulp cells into odontoblast.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2011년도 제42회 하계학술대회
• /
• pp.280-281
• /
• 2011

Special Protection Scheme(SPS) that operates scenarios about faults beyond the normally protective action is wide system protection technology for the purpose of wide areas protection. Therefore, the SPS focuses on the improvement of the power supply capability by protecting the system rather than protecting the system equipments. Since the SPS requires emergency operation, the operation schedule is set up in advance by analyzing various scenarios. Since the SPS's action scheme uses generator tripping and is a classical method it is presently the most powerful one. However, as the setting of SPS is set to the most severe disturbance, the scheme tends to trip more generators than required to prevent fault propagation. It is highly likely that tripping generator units to prevent fault propagation would result in difficulty of system management and possibility of load shedding. Accordingly, it is desirable that generators are connected to the system within the range that ensures system stability and intelligent SPS is currently under development to solve the problem being stated. In this paper, as a part of developing the intelligent SPS, application of the fast-valving and braking resistor scheme to the generators is being proposed and analysed to reduce the number of tripped generators.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.629-634
• /
• 1995

The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is formed by a set of robot joint angles derived fromm robot inverse kinematics. The joint space that is made of the joint angle set, forms a Configuration space (Cspace). Obstacles in the robot workcell are also transformed and mapped into the Cspace, which makes Cobstacles in the Cspace. (The Cobstacles represented in the Cspace is actually the configurations of the robot causing collision.) Secondly, a connected graph, a kind of roadmap, is constructed from the free configurations in the 3 dimensional Cspace, where the configurations are randomly sampled form the free Cspace. Thirdly, robot paths are optimally in order to minimize of the sum of joint angle movements. A path searching algorithm based on A is employed in determining the paths. Finally, the whole procedures for the CFPP method are illustrated with a 3 axis articulated robot. The main characteristics of the method are; 1) it deals with CFPP for an articulated robot in a 3-dimensional workcell, 2) it guarantees finding a collision free path, if such a path exists, 3) it provides distance optimization in terms of joint angle movements. The whole procedures are implemented by C on an IBM compatible 486 PC. GL (Graphic Library) on an IRIS CAD workstation is utilized to produce fine graphic outputs.

• 한국컴퓨터정보학회논문지
• /
• 제21권3호
• /
• pp.1-8
• /
• 2016

The printed circuit board (PCB) can be used only 2 layers of front and back. Therefore, the wiring line segments are located in 2 layers without crossing each other. In this case, the line segment can be appear in both layers and this line segment is to resolve the crossing problem go through the via. The via minimization problem (VMP) has minimum number of via in layout design problem. The VMP is classified by NP-complete because of the polynomial time algorithm to solve the optimal solution has been unknown yet. This paper suggests polynomial time algorithm that can be solve the optimal solution of VMP. This algorithm transforms n-line segments into vertices, and p-crossing into edges of a graph. Then this graph is partitioned into 3-coloring sets of each vertex in each set independent each other. For 3-coloring sets $C_i$, (i=1,2,3), the $C_1$ is assigned to front F, $C_2$ is back B, and $C_3$ is B-F and connected with via. For the various experimental data, though this algorithm can be require O(np) polynomial time, we obtain the optimal solution for all of data.

• 호남수학학술지
• /
• 제36권4호
• /
• pp.913-919
• /
• 2014

We investigate the relationships between the space X and the hyperspaces concerning admissibility and connectedness im kleinen. The following results are obtained: Let X be a Hausdorff continuum, and let A, $B{\in}C(X)$ with $A{\subset}B$. (1) If X is c.i.k. at A, then X is c.i.k. at B if and only if B is admissible. (2) If A is admissible and C(X) is c.i.k. at A, then for each open set U containing A there is a continuum K and a neighborhood V of A such that $V{\subset}IntK{\subset}K{\subset}U$. (3) If for each open subset U of X containing A, there is a continuum B in C(X) such that $A{\subset}B{\subset}U$ and X is c.i.k. at B, then X is c.i.k. at A. (4) If X is not c.i.k. at a point x of X, then there is an open set U containing x and there is a sequence $\{S_i\}^{\infty}_{i=1}$ of components of $\bar{U}$ such that $S_i{\longrightarrow}S$ where S is a nondegenerate continuum containing the point x and $S_i{\cap}S={\emptyset}$ for each i = 1, 2, ${\cdots}$.