• 호남수학학술지
• /
• 제33권1호
• /
• pp.11-17
• /
• 2011

We study some properties of quasi-topological spaces. Also we introduce the concept of Q-continuity and investigate several types of quasi-topology on an SGNS.

• 환경영향평가
• /
• 제14권6호
• /
• pp.377-385
• /
• 2005

The Eurasian otter(Lutra lutra) is listed as No. 330 in natural monument. To manage and conserve habitat for otters, it is critical to understand which habitat components are important for otters. The objectives of this study were to analyze otter habitat characteristics in accordance with land-cover map. We investigated otter spraints and sprainting site in Geoje Island from January to December, 2004. with GPS coordinates. The analysis of otter habitat use pattern was used by Arcview ver. 3.2 with 1: 25,000 Topology Map and field data. Otter habitat use was strongly related to sites in riparian vegetation riparian(dam or river) structures. In this study, Gucheon was a site with high coverage of riparian vegetation and unconfined channels, thus recording higher number of spraint densities than those of Yeonchocheon. Yeonchocheon was under construction at lower stream areas so that otter habitat use was limited. This study suggests that securing suitable forests and riparian vegetation zone is essential for conservation of otters.

• 한국통신학회논문지
• /
• 제31권6B호
• /
• pp.534-543
• /
• 2006

무선 애드 혹/센서 네트워크에서 제안된 일반적인 클러스터링 기반의 계층적 토폴로지 관리 기법들은 빈번한 토폴로지 변화에 따라 자주 클러스터링을 재구성하게 되고 네트워크 관리에 필요한 오버헤드가 증가하게 된다. 본 논문에서는 이러한 재클러스터링 문제와 부하 분산을 위하여 동적 예비 클러스터 헤드 기법을 사용하는 멀티 흡클러스터링 알고리즘을 제안한다. 제안하는 기법은 이동성과 전원 레벨로 구성된 가중치 맵을 사용하여 예비 클러스터 헤드를 선출하고 멀티 홉 클러스터를 구성한다. 클러스터 헤드는 이러한 가중치 맵과 임계값을 사용하여 헤드의 역할을 예비 클러스터 헤드에게 넘겨주게 된다. 실험결과, 제안하는 알고리즘이 네트워크의 오버헤드를 줄이고 부하 분산을 제공하며, 토폴로지 변화에 무관하게 적절한 클러스터와 멤버를 관리할 수 있음을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.42.6-42
• /
• 2002

Kohonen's self organizing feature map (SOFM) converts arbitrary dimensional patterns into one or two dimensional arrays of nodes. Among the many competitive learning algorithms, SOFM proposed by Kohonen is considered to be powerful in the sense that it not only clusters the input pattern adaptively but also organize the output node topologically. SOFM is usually used for a preprocessor or cluster. It can perform dimensional reduction of input patterns and obtain a topology-preserving map that preserves neighborhood relations of the input patterns. The traditional SOFM algorithm[1] is a competitive learning neural network that maps inputs to discrete points that are called nodes on a lattice...

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권5호
• /
• pp.1708-1734
• /
• 2022

In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

• 대한수학회지
• /
• 제42권1호
• /
• pp.129-134
• /
• 2005

Lpt X be a reduced Stein space and L a holomorphic line bundle on X. L is spanned by its global sections and the associated holomorphic map $h_L\;:\;X{\to}P(H^0(X, L)^{\ast})$ is an embedding. Choose any locally convex vector topology ${\tau}\;on\;H^0(X, L)^{\ast}$ stronger than the weak-topology. Here we prove that $h_L(X)$ is sequentially closed in $P(H^0(X, L)^{\ast})$ and arithmetically Cohen -Macaulay. i.e. for all integers $k{\ge}1$ the restriction map ${\rho}_k\;:\;H^0(P(H^0(X, L)^{\ast}),\;O_{P(H^0(X, L)^{\ast})}(k)){\to}H^0(h_L(X),O_{hL_(X)}(k)){\cong}H^0(X, L^{\otimes{k}})$ is surjective.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.153.5-153
• /
• 2001

This paper presents a simple modeling system that constructs 3D models from an indoor cylindrical environment map using all of the available geometry of the interior structure such as vertical and horizontal lines and parallel and perpendicular planes. The indoor scene abstract model is created through this system and the navigation through the process of 3D reconstruction. This system first automatically detects the vanishing points in a cylindrical environment map from parallel lines and planes, and determines the indoor scene topology previously defined using this information. The determined topology enables he user intervention UI simply construct a 3D model by using the photogrammetry. The modeling system can be ...

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.157-162
• /
• 2007

A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, in this regard, an inner-front creation algorithm is proposed. in which the sizes. shapes. positions, and number of new inner-fronts during the optimization process can be globally and consistently identified by considering both the value of a given criterion for inner-front creation and the occupied volume (area) of material domain. To facilitate the inner-front creation process, the inner-front creation map which corresponds to the discrete valued criterion of inner-front creation is applied to the level set function. In order to regularize the design domain during the optimization process, the edge smoothing is carried out by solving the edge smoothing partial differential equation (PDE). Updating the level set function during the optimization process, in the present work, the least-squares finite element method (LSFEM) is employed. As demonstrative examples for the flexibility and usefulness of the proposed method. the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

• 통합자연과학논문집
• /
• 제10권2호
• /
• pp.115-118
• /
• 2017

We study a notion of $\mathcal{A}$-frequent hypercyclicity of linear maps between the Banach algebras consisting of operators on a separable infinite dimensional Banach space. We prove a sufficient condition for a linear map to satisfy the $\mathcal{A}$-frequent hypercyclicity in the strong operator topology.

• 천문학회보
• /
• 제22권
• /
• pp.35.2-35.2
• /
• 1997