• Journal of Ecology and Environment
• /
• 제47권4호
• /
• pp.261-263
• /
• 2023

• 전기학회논문지
• /
• 제56권7호
• /
• pp.1315-1320
• /
• 2007

In this paper, we introduce a new fuzzy model called fuzzy combined polynomial neural networks, which are based on the representative fuzzy model named polynomial fuzzy model. In the design procedure of the proposed fuzzy model, the coefficients on consequent parts are estimated by using not general least square estimation algorithm that is a sort of global learning algorithm but weighted least square estimation algorithm, a sort of local learning algorithm. We are able to adopt various type of structures as the consequent part of fuzzy model when using a local learning algorithm. Among various structures, we select Polynomial Neural Networks which have nonlinear characteristic and the final result of which is a complex mathematical polynomial. The approximation ability of the proposed model can be improved using Polynomial Neural Networks as the consequent part.

• 반도체디스플레이기술학회지
• /
• 제22권2호
• /
• pp.128-132
• /
• 2023

Recently, with the development of deep learning technology, research on pedestrian attribute recognition technology using deep neural networks has been actively conducted. Existing pedestrian attribute recognition techniques can be obtained in such a way as global-based, regional-area-based, visual attention-based, sequential prediction-based, and newly designed loss function-based, depending on how pedestrian attributes are detected. It is known that the performance of these pedestrian attribute recognition technologies varies greatly depending on the type of backbone network that constitutes the deep neural networks model. Therefore, in this paper, several backbone networks are applied to the baseline pedestrian attribute recognition model and the performance changes of the model are analyzed. In this paper, the analysis is conducted using Resnet34, Resnet50, Resnet101, Swin-tiny, and Swinv2-tiny, which are representative backbone networks used in the fields of image classification, object detection, etc. Furthermore, this paper analyzes the change in time complexity when inferencing each backbone network using a CPU and a GPU.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.161-169
• /
• 2002

Ad hoc wireless networks involving large populations of scattered communication nodes will play a key role in the development of low power, high capacity, interactive, multimedia communication networks. Such networks must support arbitrary network connections and provide coverage anywhere and anytime. This paper partitions such arbitrarily connected network architectures into three distinct groups, identifies the associated dual network architectures and counts the number of network architectures assuming there exist N network nodes. Connectivity between network nodes is characterized as a random event. Defining the link availability P as the probability that two arbitrary network nodes in an ad hoc network are directly connected, the network connection probability $ \integral_n$(p) that any two network nodes will be directly or indirectly connected is derived. The network connection probability $ \integral_n$(p) is evaluated and graphically demonstrated as a function of p and N. It is shown that ad hoc wireless networks containing a large number of network nodes possesses the same network connectivity performance as does a fixed network, i.e., for p>0, $lim_{N\to\infty} Integral_n(p)$ = 1. Furthermore, by cooperating with fixed networks, the ad hoc network connection probability is used to derive the global network connection probability for hybrid networks. These probabilities serve to characterize network connectivity performance for users of wireless ad hoc and hybrid networks, e.g., IEEE 802.11, IEEE 802.15, IEEE 1394-95, ETSI BRAN HIPERLAN, Bluetooth, wireless ATM and the world wide web (WWW).

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 추계학술대회
• /
• pp.966-969
• /
• 2012

본 연구는 네트워크상에 분산된 데이터들의 이질적인 문제를 해결하고, 효율적인 데이터 통합을 위한 Topic Maps MetaData Registry(TMDR)기반의 쿼리 변환 기법을 제시한다. TMDR은 분산 데이터를 통합하기 위해 글로벌 스키마를 제공하여 각 로컬 데이터에서 발생하는 정보들 사이의 이질성 문제를 쿼리 변환 기법으로 해결한다. 이 기법은 eXtended Meta Data Registry(XMDR)의 Meta Schema Ontology(MSO)와 Topic Maps에서 연관 관계를 분석하여 로컬의 접근 정보를 관리하는 Meta Location(ML)의 정보를 통해 분산되어 있는 로컬 데이터들을 통합 접근할 수 있도록 한다. 처리방법은 TMDR을 이용하여 전역처리를 위한 글로벌 쿼리를 생성하고, 생성된 글로벌 쿼리는 로컬 스키마로 분해되어 네트워크를 통해 분산되어 있는 시스템들을 접근하도록 함으로써, 통합 접근이 가능하게 한다. 우리는 이를 위해 글로벌 쿼리를 로컬에 적응적인 쿼리로 변환하는 방안을 제안한다.

• 한국통신학회논문지
• /
• 제32권5B호
• /
• pp.295-303
• /
• 2007

An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권7호
• /
• pp.1802-1814
• /
• 2012

In order to guide users to select the most optimal access network in heterogeneous wireless networks, a network selection algorithm is proposed which is designed based on multi-objective discrete particle swarm optimization (Multi-Objective Discrete Particle Swarm Optimization, MODPSO). The proposed algorithm keeps fast convergence speed and strong adaptability features of the particle swarm optimization. In addition, it updates an elite set to achieve multi-objective decision-making. Meanwhile, a mutation operator is adopted to make the algorithm converge to the global optimal. Simulation results show that compared to the single-objective algorithm, the proposed algorithm can obtain the optimal combination performance and take into account both the network state and the user preferences.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.235-236
• /
• 2006

IEEE 802.16 networks support mobile stations (MSs) to access broadband wireless networks while moving at a vehicular speed. However, IEEE 802.16 networks do not provide link layer native multicast capability because of point-to-multipoint connection characteristic. Due to this feature, it is not easy to adopt protocols or applications which need native link layer multicast capability. In order to solve the multicast support problem, we use the built-in LAN emulation feature of IEEE 802.16 which is based on Convergence Sublayer (CS). Our proposed operational procedures support not only the delivery of link local scope multicast packets, but also the delivery of non-link local scope multicast packets such as site local or global scope multicast packets. We also present the method of forming multicast Connection Identifier (CID) which is used to transport IP packets over IEEE 802.16 networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5323-5343
• /
• 2018

Mobile applications and social networks tend to enhance the need for high-quality content access. To address the rapid growing demand for data services in mobile networks, it is necessary to develop efficient content caching and distribution techniques, aiming at significantly reduction of redundant content transmission and thus improve content delivery efficiency. In this article, we develop optimal cooperative content cache and distribution policy, where a geographical cluster model is designed for content retrieval across the collaborative small cell base stations (SBSs) and replacement of cache framework. Furthermore, we divide the SBS storage space into two equal parts: the first is local, the other is global content cache. We propose an algorithm to minimize the content caching delay, transmission cost and backhaul bottleneck at the edge of networks. Simulation results indicates that the proposed neighbor SBSs cooperative caching scheme brings a substantial improvement regarding content availability and cache storage capacity at the edge of networks in comparison with the current conventional cache placement approaches.

• ETRI Journal
• /
• 제44권6호
• /
• pp.915-924
• /
• 2022

In this paper, we present a two-stage scalable channel estimator (TSCE), a deep learning (DL)-based scalable, and robust channel estimator for wireless cellular networks, which is made up of two DL networks to efficiently support different resource allocation sizes and reference signal configurations. Both networks use the transformer, one of cutting-edge neural network architecture, as a backbone for accurate estimation. For computation-efficient global feature extractions, we propose using window and window averaging-based self-attentions. Our results show that TSCE learns wireless propagation channels correctly and outperforms both traditional estimators and baseline DL-based estimators. Additionally, scalability and robustness evaluations are performed, revealing that TSCE is more robust in various environments than the baseline DL-based estimators.