• Wind and Structures
• /
• v.34 no.3
• /
• pp.259-274
• /
• 2022

The present paper is focused on analyzing a set of Computational Fluid Dynamics (CFD) simulation data on reducing orthogonal peak base moment coefficients on a high-rise rectangular building with wings. The study adopts an aerodynamic optimization procedure (AOP) composed of CFD, artificial neural network (ANN), and genetic algorithm (G.A.). A parametric study is primarily accomplished by altering the wing positions with 3D transient CFD analysis using k - ε turbulence models. The CFD technique is validated by taking up a wind tunnel test. The required design parameters are obtained at each design point and used for training ANN. The trained ANN models are used as surrogates to conduct optimization studies using G.A. Two single-objective optimizations are performed to minimize the peak base moment coefficients in the individual directions. An additional multiobjective optimization is implemented with the motivation of diminishing the two orthogonal peak base moments concurrently. Pareto-optimal solutions specifying the preferred building shapes are offered.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.405-412
• /
• 2014

Due to the popularity of mobile phones, Peer-to-Peer (P2P) content sharing in mobile phones is highly desirable, especially in a mobile data connection. In addition, there has been an increasing demand for content sharing applications for P2P communication in Android-based smartphones as ubiquitous mobile devices. However, due to wireless network limits, unstable characteristic and restricted storage space, mobile users confront challenges in establishing connections and sharing video frames with other users. To solve this issue, we propose an architectural design and implementation of key frame sharing application that uses Chord, a distributed lookup protocol to establish a content sharing platform for mobile devices, combined with the Chord SDK based on Android. Our proposed system enables users easily to share key information on video data in real-time over a wireless network without manual processing of devices which join or leave the group and cost associated with the 3G/4G network.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.391-399
• /
• 2005

In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graph $G=(V_1 {\cup}{V_2},\;E,\;{\omega})$ outputs the enumeration of all bipartite matchings of given cardinality v and cost c.

• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.4
• /
• pp.170-179
• /
• 1993

In this study, self-organized neural network is used to solve the vorrespondence problem of the axial stereo image. Edge points are extracted from a pair of stereo images and then the edge points of rear image are assined to the output nodes of neural network. In the matching process, the two input nodes of neural networks are supplied with the coordi- nates of the edge point selected randomly from the front image. This input data activate optimal output node and its neighbor nodes whose coordinates are thought to be correspondence point for the present input data, and then their weights are allowed to updated. After several iterations of updating, the weights whose coordinates represent rear edge point are converged to the coordinates of the correspondence points in the front image. Because of the feature map properties of self-organized neural network, noise-free and smoothed depth data can be achieved.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.797-798
• /
• 2008

Visual quality of video telephony over 3G networks is not satisfactory due to limited bandwidths. Therefore, it is worthwhile to enhance subjective visual quality based on ROI coding. In this paper, we propose a rate-control algorithm for video telephony with ROI based H.264|AVC coding. The QP values are increasingly assigned in non-ROI away from the ROI so that graceful degradation of visual quality can be achieved, which is more visually pleasant.

• Electronics and Telecommunications Trends
• /
• v.31 no.6
• /
• pp.88-96
• /
• 2016

5G RAN은 4G가 진화된 무선기술(evolved E-UTRA)과 5G 무선기술(New Radio, NR)을 모두 지원하는 새로운 무선액세스 네트워크(New RAN)이며, 코어 네트워크 (EPC and NGC)과 접속되어 5G 시스템(NextGen System)을 구성한다. 본고에서는 5G RAN(Radio Access Network,)을 대상으로, RAN 시설 배치 시나리오, RAN과 CN 간 기능 분배 및 인터페이스, 프런트-홀 네트워크의 전송 용량 및 지연, New RAN과 E-UTRA 간 모빌리티 시나리오 등에 대한 표준 이슈를 살펴본다. 마지막 절에선 RAN의 네트워크 슬라이싱 지원 방안으로 상위레벨 개념의 구조와 절차를 정리한다. 본 문서는 3GPP RAN3 그룹의 기술보고서(TR 38.801)와 SA2 기술보고서(TR 23.799)를 바탕으로 작성되었다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.33-40
• /
• 2008

Streaming video has become a popular form of transferring media over the wired/wireless network. TCP-friendly rate control (TFRC) is used as a streaming media transport protocol. Using the TCP congestion response function and current network conditions, TFRC adjusts its sending rate to yield the maximum TCP-friendly throughput. Since TFRC was designed for applications that would prefer to maintain a slowly-changing sending rate, it is less responsive to changes in handover between wireless heterogeneous networks such as 3G network, WLAN, and so on. This paper shows a new TFRC method for vertical handover over wireless heterogeneous network. The proposed TFRC method has features of low quality interruption and fast rate adaptation to a new target network. The simulation results show that the proposed one provides better QoS and throughput support than the traditional TFRC scheme during vertical handover.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.93-103
• /
• 2007

Networking environments are exposed to outside attacks and privacy threats. Due to broadcast nature of radio transmissions, wireless devices experience more vulnerable situations than those of wired network devices. This paper assumes that a wireless device has two network interfaces, one for accessing internet using 3G services, and the other for constructing an ad hoc network. To deal with privacy threats, this paper introduces an approach in which wireless devices form a special ad hoc network in order to exchange data using anonymous communications. One or more intermediate peers should be involved in the construction of an anonymous path. The proposed anonymous communication mechanism discourages traffic analysis and improves user privacy. According to simulation results, the anonymous connection in an ad hoc network prefers the intermediate peer(s) which is located near the source and/or the destination peer, rather than randomly-selected peers.

• Journal of Communications and Networks
• /
• v.4 no.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).