• East Asian mathematical journal
• /
• 제26권2호
• /
• pp.219-232
• /
• 2010

The main purpose of this work is to suggest a new approach to teaching general topology to undergraduate students. First, we change the order of contents. Usually, we introduce definitions, examples, theorems, and problems in this order. But, showing familiar examples of some concept of topology prior to the definition of one is the best method so far as I know from teaching experience of topology, which students feel very hard because of its abstractness. For more efficiency, mathematics-clubs each consisting of three or four students in topology course are established. This makes students very positive in topology class.

• 한국정보처리학회논문지
• /
• 제7권6호
• /
• pp.1778-1784
• /
• 2000

We consider the weighted shortest path updating problem, that is, the problem to reconstruct the weighted shortest paths in response to topology change of the network. This appear proposes a distributed algorithms that reconstructs the weighted shortest paths after several processors and links are added and deleted. its message complexity and ideal-time complexity are O(p$^2$+q+n') and O(p$^2$+q+n') respectively, where n' is the number of processors in the network after the topology change, q is the number of added links, and p is the total number of processors in he biconnected components (of the network before the topology change) including the deleted links or added links.

• 전자공학회논문지
• /
• 제50권12호
• /
• pp.98-106
• /
• 2013

에너지 수확 모바일 센서 망에서 센서 노드간의 듀티-사이클 동기화는 매우 중요한 의미를 갖는다. 제한된 에너지를 효율적으로 사용하여 협력해야 하기 때문에 각 노드의 듀티-사이클이 서로 유사하게 동작되어야 한다. 이때 망을 구성하는 노드분포는 노드간의 연결뿐만 아니라 동기화에 의한 노드의 활동 시간, 그리고 망의 수명에 영향을 준다. 본 논문에서는 자기-동기화 듀티-사이클 기법을 적용한 에너지 수확 모바일 센서 망에서 망의 토폴로지를 변화시킨다. 단순 랜덤 토폴로지 망보다는 망이 담당하는 영역과 노드 밀집도에 따라서 노드의 분포를 균일하게 유지하는 알고리즘을 제시한다. 제시된 토폴로지 변환 알고리즘을 위하여 유체 흐름과 군집 분산 모델을 적용하고 에이전트 기반 모델링을 이용하여 성능분석을 시행한다. 또한 제안된 알고리즘을 자기-동기화 듀티-사이클 기반 모바일 센서 망에 적용하여 노드 간 동기화 특성이 강화되고 에너지 소비 편차의 감소를 확인한다.

• 전기학회논문지
• /
• 제58권10호
• /
• pp.1936-1941
• /
• 2009

This paper deals with a new methodology for topology optimization in which the topology of the design domain may change during the shape optimization process. To achieve this, the concept of the topological gradient is introduced to compute the sensitivity of an objective function when a small hole is drilled in the domain. Based on shape and topological sensitivity values, the shape and topology of the design domain may be simultaneously changed during design iterations if necessary. To verify the advantages and also to facilitate understanding of the method itself, two electrostatic design problems have been tested by using 2D finite element analysis: the first is the inverse problem of a simple dielectric model and the second is the rotor design of a MEMS actuator.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1996년도 봄 학술발표회 논문집
• /
• pp.182-189
• /
• 1996

The focus of this study is on the problem of the design of structure of undetermined topology. This problem has been regarded as being the most challenging of structural optimization problems, because of the difficulty of allowing topology to change. Conventional approaches break down when element sizes approach to zero, due to stiffness matrix singularity. In this study, a novel nonlinear Programming formulation of the topology Problem is developed and examined. Its main feature is the ability to account for topology variation through zero element sizes. Stiffness matrix singularity is avoided by embedding the equilibrium equations as equality constraints in the optimization problem. Although the formulation is general, two dimensional plane elasticity examples are presented. The design problem is to find minimum weight of a plane structure of fixed geometry but variable topology, subject to constraints on stress and displacement. Variables are thicknesses of finite elements, and are permitted to assume zero sizes. The examples demonstrate that the formulation is effective for finding at least a locally minimal weight.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 춘계학술대회논문집
• /
• pp.1168-1173
• /
• 2001

Compressors are the main source of noise of refrigerators and air-conditioning unit. Recent studies on the sound propagation of rotary compressors showed that the accumulator is a significant source of noise generation. This paper describes a design change of a rotary compressor for noise reduction using topology optimization. Topology optimization has been developed and used to find the most effective structural configuration in the early stage of design procedures. FE model of the rotary compressor composed of all the components is built for the topology optimization. Topology optimization results show that the empirical design for the present structure fail to constrain some resonance modes and a new component is required.

• 대한기계학회논문집A
• /
• 제28권4호
• /
• pp.370-377
• /
• 2004

The density approach and the homogenization design method are representative methods in topology optimization problems. In the topology optimization in magnetic fields, those methods are applied based on the results of the applications In elastic fields. In this study, the density method is modified considering the concept of the homogenization design method. Also, the results of the topology optimization in magnetic fields by the modified density method as well as the homogenization method are compared especially focusing the change of the penalization parameter in the density approach. The effect of the definition of the design domain such as global/local design domain is also discussed.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집C
• /
• pp.392-397
• /
• 2001

Topology optimization is applied to determine the layout of a structure whose eigenfrequency coincides with a specified frequency. The topology optimization problem is formulated to minimize the difference between the structural frequency and a given frequency using the homogenization method and the modified optimality criteria method. It turns out that the value of a weighting factor in the updating scheme plays an important role to achieve both a suitable speed and a stable convergence of an algorithm. Unlike a constant weighting factor in previous works, it is suggested that a weight factor is varied during the iteration to control the amount of the frequency change. To substantiate the proposed approach two-dimensional structural design problems are presented and the resulted topology layouts for the specified eigenfrequency are compared to layouts for maximizing the corresponding eigenfrequency.

• Journal of Information Technology Applications and Management
• /
• 제11권2호
• /
• pp.205-214
• /
• 2004

Internet evolves into the huge network with new nodes inserted or deleted depending on specific situations. A new model of network topology is needed in order to analyze time-varying Internet more realistically and effectively. In this study the non-monotony models are proposed which can describe topological changes of Internet such as node insertion and deletion, and can be used for predicting its future topology. Simulation is performed to analyze the topology generated by our model. Simulation results show that our proposed model conform the power law of realistic Internet better than conventional ones. The non-monotony model can be utilized for designing Internet protocols and networks with better security.

• 한국정보처리학회논문지
• /
• 제7권5호
• /
• pp.1370-1376
• /
• 2000

너비 우선 선정 트리기 이미 구성되어 있는 비동기식 네트워크상에서 네트워크 형상이 빈힐 경우 이로인해 구성되어 있던 너비 우선 선정 트리를 갱신해야 하는 경우가 발생한다. 본 논문에서는 이러한 경우 너비 우선 신장 트리를 효율적으로 갱신하는 메시지 복잡도와 이상시간 복잡도 모두 O($p\sqrt{q}$.q.a.n')인 분산 알고리즘을 제안한다. 여기서, a는 추가 링크의 수, n'는 네트워크의 토폴로지가 변한후의 네트워크상에 존재하는 노드수를 각각 나타낸다. 그리고 p는 삭제 또는 추가 링크를 가진 이중결합요소에 속하는 전체 노드 수를 나타내며, q는 삭제 또는 추가 링크를 가진 이중 결합요소에 속하는 전체 링크수를 나타낸다.