• 대한교통학회지
• /
• 제27권6호
• /
• pp.129-137
• /
• 2009

첨단교통체계의 기술발전과 교통 분석의 수준이 상세해짐에 따라 동적 교통 분석에 대한 필요성이 증가하고 있다. 기존의 정적인 분석이 하루 평균 개념의 통행특성과 네트워크 상태를 묘사한 반면, 동적 분석에서는 시간흐름에 따른 네트워크의 상태를 분석한다. 본 논문에서는 교통시스템 동적 분석의 필요성을 인식하여, 고속도로망을 대상으로 FTMS 자료를 활용한 분석 방법론을 개발하였다. 개별 차량의 실제 통행기록 자료인 TCS 자료를 이용하여 전국 고속도로망을 대상으로 동적 기종점 통행량을 구축하였으며, 시뮬레이션 연산시간 문제 해결을 위해 분석범위를 설정한 Subarea 분석을 활용하였다. 이를 위해 전국 고속도로망을 대상으로 구축된 시간대별 기종점 통행량을 Subarea 기종점 통행량으로 전환하기 위한 방법론을 개발하였다. 구축된 모형의 적용을 위해 시나리오 분석을 실시하였으며, 이를 통해 각각의 시나리오에 대하여 기존의 단편적인 효과분석과 달리 하루 중 시간대별 교통여건에 따른 네트워크 상태분석을 수행하였다. 본 연구는 동적 교통 분석의 초기 시도라는 점과 실제 기종점 자료인 FTMS 자료를 활용한 분석이라는 점에서 의미를 가지며, 현재 교통 분석의 큰 흐름인 동적 교통 분석의 필요성을 부각시키고자 한다. 향후 고속도로뿐만이 아닌 기타 도로를 포함한 모형 구축이 필요하며, Hybrid 모형 및 프로그램 개발을 통해 궁극적인 목표인 실시간동적 분석 모형 개발을 위한 연산시간 문제 해결이 필요할 것이다.

• 한국인지과학회:학술대회논문집
• /
• 한국인지과학회 2000년도 춘계 학술대회
• /
• pp.322-328
• /
• 2000

This study discusses cognition as a computable mapping in cognitive system and relates G del's Incompleteness Theorems to the computability of cognition from a metamathematical perspective. Understanding cognition as a from of computation requires not only Turing machine models but also neural network models. In previous studies of computation by cognitive systems, it is remarkable to note how little serious attention has been given to the issue of computation by neural networks with respect to G del's Incompleteness Theorems. To address this problem, first, we introduce a definition of cognition and cognitive science. Second, we deal with G del's view of computability, incompleteness and speed-up theorems, and then we interpret G del's disjunction on the mind and the machine. Third, we discuss cognition as a Turing computable function and its relation to G del's incompleteness. Finally, we investigate cognition as a neural computable function and its relation to G del's incompleteness. The results show that a second-order representing system can be implemented by a finite recurrent neural network. Hence one cannot prove the consistency of such neural networks in terms of first-order theories. Neural computability, theoretically, is beyond the computational incompleteness of Turing machines. If cognition is a neural computable function, then G del's incompleteness result does not limit the compytational capability of cognition in humans or in artifacts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권3호
• /
• pp.874-890
• /
• 2021

With the widespread deployment of the fifth-generation (5G) communication networks, various real-time applications are rapidly increasing and generating massive traffic on backhaul network environments. In this scenario, network congestion will occur when the communication and computation resources exceed the maximum available capacity, which severely degrades the network performance. To alleviate this problem, this paper proposed an intelligent resource allocation (IRA) to integrate with the extant resource adjustment (ERA) approach mainly based on the convergence of support vector machine (SVM) algorithm, software-defined networking (SDN), and mobile edge computing (MEC) paradigms. The proposed scheme acquires predictable schedules to adapt the downlink (DL) transmission towards off-peak hour intervals as a predominant priority. Accordingly, the peak hour bandwidth resources for serving real-time uplink (UL) transmission enlarge its capacity for a variety of mission-critical applications. Furthermore, to advance and boost gateway computation resources, MEC servers are implemented and integrated with the proposed scheme in this study. In the conclusive simulation results, the performance evaluation analyzes and compares the proposed scheme with the conventional approach over a variety of QoS metrics including network delay, jitter, packet drop ratio, packet delivery ratio, and throughput.

• Journal of Computing Science and Engineering
• /
• 제9권3호
• /
• pp.155-162
• /
• 2015

The last decade has seen a rapid growth in the use of mobile devices all over the world. With an increasing use of mobile devices, mobile applications are becoming more diverse and complex, demanding more computational resources. However, mobile devices are typically resource-limited (i.e., a slower-speed CPU, a smaller memory) due to a variety of reasons. Mobile users will be capable of running applications with heavy computation if they can offload some of their computations to other places, such as a desktop or server machines. However, mobile users are typically subject to dynamically changing network environments, particularly, due to user mobility. This makes it hard to choose good offloading decisions in mobile environments. In general, users' mobility can provide some hints for upcoming changes to network environments. Motivated by this, we propose a mobility model of each individual user taking advantage of the regularity of his/her mobility pattern, and develop an offloading decision-making technique based on the mobility model. We evaluate our technique through trace-based simulation with real log data traces from 14 Android users. Our evaluation results show that the proposed technique can help boost the performance of mobile devices in terms of response time and energy consumption, when users are highly mobile.

• 인터넷정보학회논문지
• /
• 제19권2호
• /
• pp.33-41
• /
• 2018

In recent years, technology is rapidly changing to support new service consumption and distribution models in multimedia service systems and hybrid delivery of media services is a key factor for enabling next generation multimedia services. This phenomenon can lead to rapidly increasing network traffic and ultimately has a direct and aggravating effect on the user's quality of service (QOS). To address the issue, we propose a novel system architecture to provide smart hybrid media services efficiently. The architecture is designed to apply the software-defined networking (SDN) method, detect changes in traffic, and combine the data, including user data, service features, and computation node status, to provide a service schedule that is suitable for the current state. To this end, the proposed architecture is based on 2-level scheduling, where Level-1 scheduling is responsible for the best network path and a computation node for processing the user request, whereas Level-2 scheduling deals with individual service requests that arrived at the computation node. This paper describes the overall concept of the architecture, as well as the functions of each component. In addition, this paper describes potential scenarios that demonstrate how this architecture could provide services more efficiently than current media-service architectures.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2018년도 추계학술대회
• /
• pp.62-65
• /
• 2018

This paper comes out with the study on sensing data collection strategy in a Software-Defined Mobile Edge vehicular networking. The two cooperative data dissemination are Direct Vehicular cloud mode and edge cell trajectory prediction decision mode. In direct vehicular cloud, the vehicle observe its neighboring vehicles and sets up vehicular cloud for cooperative sensing data collection, the data collection output can be transmitted from vehicles participating in the cooperative sensing data collection computation to the vehicle on which the sensing data collection request originate through V2V communication. The vehicle on which computation originate will reassemble the computation out-put and send to the closest RSU. The SDMEVN (Software Defined Mobile Edge Vehicular Network) Controller determines how much effort the sensing data collection request requires and calculates the number of RSUs required to support coverage of one RSU to the other. We set up a simulation scenario based on realistic traffic and communication features and demonstrate the scalability of the proposed solution.

• ETRI Journal
• /
• 제40권1호
• /
• pp.61-71
• /
• 2018

In this study, we developed hybrid control algorithms in smart base stations (SBSs) along with devised communication, caching, and computing techniques. In the proposed scheme, SBSs are equipped with computing power and data storage to collectively offload the computation from mobile user equipment and to cache the data from clouds. To combine in a refined manner the communication, caching, and computing algorithms, game theory is adopted to characterize competitive and cooperative interactions. The main contribution of our proposed scheme is to illuminate the ultimate synergy behind a fully integrated approach, while providing excellent adaptability and flexibility to satisfy the different performance requirements. Simulation results demonstrate that the proposed approach can outperform existing schemes by approximately 5% to 15% in terms of bandwidth utilization, access delay, and system throughput.

• International Journal of Computer Science & Network Security
• /
• 제23권6호
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권5호
• /
• pp.1463-1478
• /
• 2012

Based on the theory of local-world network, the composition self-similarity (CSS) of network traffic is presented for the first time in this paper for the study of DoS detection. We propose the concept of composition distribution graph and design the relative operations. The $(R/S)^d$ algorithm is designed for calculating the Hurst parameter. Based on composition distribution graph and Kullback Leibler (KL) divergence, we propose the composition self-similarity anomaly detection (CSSD) method for the detection of DoS attacks. We evaluate the effectiveness of the proposed method. Compared to other entropy based anomaly detection methods, our method is more accurate and with higher sensitivity in the detection of DoS attacks.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 추계학술대회 논문집 학회본부
• /
• pp.135-139
• /
• 1988

This paper presents a new algorithm using power flow solution which is given by the polar form Newton-Raphson method in a transient stability analysis. The computation time to solve network equations can be much saved by a decoupled power flow method. In addition, the time is much saved in performing a approximate stability analysis by linearizing the differential equations and using a voltage and angle sensitivity matrix given in network equations.