• 제목/요약/키워드: Dynamic Network

검색결과 3,200건 처리시간 0.026초

복합배수관망에 있어서 선형 및 비선형 해석기법의 적용 (Application of Linear and Nonlinear Analysis Technique on the Complex Water Distributing System)

  • 고수현;최윤영;안승섭
    • 한국농공학회지
    • /
    • 제43권4호
    • /
    • pp.69-78
    • /
    • 2001
  • In this study optimal analysis of pipe network was performed using linear and non linear analysis method for complex real pipe network system of Mungyeong water purification field system which consists of 70 nodes and 86 elements. From the examination result of total flow which is distributed to each pipe, it is found that KYPIPE2 Model supplies less amount than NLAM. It is known that dynamic water level and pressure head of KYPIPE2 Model and NLAM are nearly in accordance with each other from each method of the pipe network analyses, and appeared that both methods of analysis shows high reliable result since the distribution of dynamic water level for every node is the short range of EL. 205.0m~EL. 210.0m besides the pressed dynamic water level. The analysis results of pressure in the methods of pipe network analysis for KYPIPE2 Model and NLAM are similar and it is satisfactory result that the pressure distributions of the tab water design criterion of 5.0kgf/cm$^2$ besides the small part of highland.

  • PDF

Parallel Multi-task Cascade Convolution Neural Network Optimization Algorithm for Real-time Dynamic Face Recognition

  • Jiang, Bin;Ren, Qiang;Dai, Fei;Zhou, Tian;Gui, Guan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권10호
    • /
    • pp.4117-4135
    • /
    • 2020
  • Due to the angle of view, illumination and scene diversity, real-time dynamic face detection and recognition is no small difficulty in those unrestricted environments. In this study, we used the intrinsic correlation between detection and calibration, using a multi-task cascaded convolutional neural network(MTCNN) to improve the efficiency of face recognition, and the output of each core network is mapped in parallel to a compact Euclidean space, where distance represents the similarity of facial features, so that the target face can be identified as quickly as possible, without waiting for all network iteration calculations to complete the recognition results. And after the angle of the target face and the illumination change, the correlation between the recognition results can be well obtained. In the actual application scenario, we use a multi-camera real-time monitoring system to perform face matching and recognition using successive frames acquired from different angles. The effectiveness of the method was verified by several real-time monitoring experiments, and good results were obtained.

Whole learning algorithm of the neural network for modeling nonlinear and dynamic behavior of RC members

  • Satoh, Kayo;Yoshikawa, Nobuhiro;Nakano, Yoshiaki;Yang, Won-Jik
    • Structural Engineering and Mechanics
    • /
    • 제12권5호
    • /
    • pp.527-540
    • /
    • 2001
  • A new sort of learning algorithm named whole learning algorithm is proposed to simulate the nonlinear and dynamic behavior of RC members for the estimation of structural integrity. A mathematical technique to solve the multi-objective optimization problem is applied for the learning of the feedforward neural network, which is formulated so as to minimize the Euclidean norm of the error vector defined as the difference between the outputs and the target values for all the learning data sets. The change of the outputs is approximated in the first-order with respect to the amount of weight modification of the network. The governing equation for weight modification to make the error vector null is constituted with the consideration of the approximated outputs for all the learning data sets. The solution is neatly determined by means of the Moore-Penrose generalized inverse after summarization of the governing equation into the linear simultaneous equations with a rectangular matrix of coefficients. The learning efficiency of the proposed algorithm from the viewpoint of computational cost is verified in three types of problems to learn the truth table for exclusive or, the stress-strain relationship described by the Ramberg-Osgood model and the nonlinear and dynamic behavior of RC members observed under an earthquake.

CAN기반 실시간 시스템을 위한 확장된 EDS 알고리즘 개발 (Development of an Extended EDS Algorithm for CAN-based Real-Time System)

  • 이병훈;김대원;김홍렬
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 D
    • /
    • pp.2369-2373
    • /
    • 2001
  • Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

  • PDF

EPON망에서 차등 CoS 제공을 위한 주기적 폴링 기반의 동적 대역 할당 방법 (Cyclic Polling-Based Dynamic Bandwidth Allocation for Differentiated Classes of Service in Ethernet Passive Optical Networks)

  • 최수일
    • 한국통신학회논문지
    • /
    • 제28권7B호
    • /
    • pp.620-627
    • /
    • 2003
  • EPON망은 중앙 기지국과 가입자들 사이에 광 액세스 라인을 저렴하게 제공할 수 있는 액세스 망 기술로 떠오르고 있다. 동적 대역 할당은 상향 채널의 효율적인 활용을 위해 ONU간 통계적 다중화를 제공한다. 본 논문에서는 EPON망에서 차등 CoS를 제공하기 위해 주기적 폴링을 기반으로 한 동적 대역 할당 방법을 제안한다. 더불어, Interleaved 폴링 방식에 기반한 동적 대역 할당 방안은 상향 트래픽 로드가 적은 경우 하향 채널의 용량을 대폭 감소시키는 단점을 가지고 있음을 보인다. 실제적인 시뮬레이션 결과를 얻기 위해 self-similarity와 long-range dependence 특성을 갖는 트래픽을 이용하였다. EPON망의 성능은 ONU에 제공되는 다양한 로드별로 분석하였으며, 특히 차등 CoS 특성 분석을 위해 등급별 패킷의 지연 특성을 분석하였다.

SARIMA 모델을 기반으로 한 선로 이용률의 동적 임계값 학습 기법 (Learning Algorithm of Dynamic Threshold in Line Utilization based SARIMA model)

  • 조강홍;안성진;정진욱
    • 정보처리학회논문지C
    • /
    • 제9C권6호
    • /
    • pp.841-846
    • /
    • 2002
  • 이 논문에서는 네트워크의 QoS에 가장 큰 영향을 미치는 네트워크 선로 이용률의과거 데이터를 기반으로 단기간 예측과 계절성(seasonality) 예측에 적합한 계절자기회귀이동평균(SARIMA : seasonal ARIMA) 모형을 적용하여 네트워크 특성을 고려한 동적인 임계값을 학습하는 알고리즘을 제시하였다. 이 기법을 통해 선로 이용률의 임계값은 네트워크환경과 시간에 따라 동적으로 변경되며, 확률을 근거로 그 신뢰성을 제공할 수 있다. 또한,실제 환경을 통하여 제시한 모델의 적합성 여부를 평가하였으며, 알고리즘의 성능을 실험하였다. 네트워크 관리자들은 이 알고리즘을 통하여 고정 임계값이 가지는 단점을 극복할 수있을 것이며, 관리 행위의 효율성을 높일 수 있을 것이다.

MANET에서 상황인식 기반의 UoC Architecture 구현 (Implementation of a Context-awareness based UoC Architecture for MANET)

  • 두경민;이강환
    • 한국정보통신학회논문지
    • /
    • 제12권6호
    • /
    • pp.1128-1133
    • /
    • 2008
  • 상황인식(Context-aware)은 인간-컴퓨터 상호작용의 단점을 극복하기 위한 방법으로써 많은 주목을 받고 있다. 본 논문에서는 UoC(Ubiquitous system on Chip)로 구현될 수 있는 상황인식 시스템 구조를 제안한다. 본 논문은 유비쿼터스 컴퓨팅 시스템을 구현하기 위해 CRS(Context Recognition Switch)와 DOS(Dynamic and Optimal Standard)의 개념을 포함한 Pre-processor, HPSP(High Performance Signal Processor), Network Topology Processor의 부분으로 구성된 UoC Architecture를 제안한다. 또한, IEEE 802.15.4 WPAN(Wireless Personal Area Network) Standard에 의해 구현된 UoC를 보여준다. 제안된 상황인식 기반의 UoC Architecture는 주거 환경에서 컨텍스트를 인식하여 사용자를 지원하는 지능형 이동 로봇 등에 적용될 수 있을 것이다.

소셜네트워크게임에서 광고비와 고객 유형 변수간 동적 상호관계 (Dynamic Interactive Relationships among Advertising Cost and Customer Types of Social Network Game)

  • 이희태
    • 유통과학연구
    • /
    • 제14권4호
    • /
    • pp.47-53
    • /
    • 2016
  • Purpose - The objective of this study is to investigate the dynamic relationships among Advertising Cost (AD), Newly Registered Users(NRU), and Buying Users(BU) of Social Network Game(SNG). SNG is getting pervasive mainly due to the rapid growth of mobile game and Social Network Service(SNS). It would be helpful for marketing researchers interested in SNG and related practitioners to understand the changes in AD, NRU, and BU with time as well as the effects on one another in mutual and dynamic way. Research Design, Data, and Methodology - Necessary data were collected from Social Network Game(SNG) company. AD, NRU, and BU are endogenous variables, but new event such as launching (event) and holidays(holiday) are exogenous dummy variables. Vector Auto regression (VAR) model is generally used to examine and capture the dynamic relationships among endogenous variables. VAR model can easily capture dynamic and endogenous relationships among time-series variables. Vector Auto regression with Exogenous variables(VARX) is a model in which exogenous variables are added to VAR. To investigate this study, VARX is applied. Result - By estimating the VARX model, the author finds that the past periods' NRU affect negatively and significantly the present AD, and past periods' BU have a positive and significant impact on the increase of AD. In addition, the author shows that the past periods' AD and BU have a positive and significant effect on the increase of NRU, and the past periods' AD affect positively and significantly BU. While the impact of AD on NRU happens after 3 or 4 days (carryover effect), that of AD on BU comes about within just 1 or 2 days (immediate effect). The effect of BU on NRU can be considered as word of mouth (WOM effect). Therefore, SNG companies can obtain not only the growth of revenue but also the increase of NRU by increasing BU. Through those results, the author can also find that there are significant interactions between endogenous variables. Conclusion - This study intends to investigate endogenous and dynamic relationships between AD, NRU, and BU. They also give managerial implications to practitioners for SNS and SNG firms. Through this study, it is found that there exist significant interactions and dynamic relationships between those three endogenous variables. The results of this study can have meaningful implications for practitioners and researchers of SNG. This research is unique in that it deals with "actual" field data and intend to find "actual" relationships among variables unlike other related existing studies which intend to investigate psychological factors affecting the intention of game usage and the intention of purchasing game items. This study is also meaningful by showing that the increase of BU can be a good strategy for "killing birds with one stone" (i.e., revenue growth and NRU increase). Although there are some limitations related with future research topics, this research contributes to the current research on SNG marketing in the above mentioned ways.

예측적 다중계층 동적배분모형의 구축 및 알고리즘 개발 (The Development of Predictive Multiclass Dynamic Traffic Assignment Model and Algorithm)

  • 강진구;박진희;이영인;원제무;류시균
    • 대한교통학회지
    • /
    • 제22권5호
    • /
    • pp.123-137
    • /
    • 2004
  • 시간에 따라 변화하는 네트워크 상황을 반영하는 통행배분 연구가 활발히 진행되고 있다. 이러한 연구의 배경에는 통행배분 모델이 도로망 계획이라고 하는 하드웨어 분야의 계획에만 그치지 않고 교통관리나 제어라고 하는 소프트웨어 분야의 계획에도 활용하고자 하는 사회적 필요성의 증가 때문이다. 또한, 통행배분 모형의 이론과 현실 사이의 괴리를 줄이고자 하는 차원에서 연구되고 있는 모형으로 다중계층 통행배분 모형이 있다. 이 모형은 다중 운전자 계층과 다차종 계층으로 구분되며 이중에서 동적모형과 결합될 수 있는 보다 현실성 있는 분야는 다차종 분야이다. 이러한 배경에서 본 연구의 목적은 이 두 분야를 결합한 다차종 동적 통행배분 모형을 구축하고자 한다. 이것은 동적 이용자 균형 배분 모형이 현재 이슈화 되고 있는 첨단교통체계(ITS)의 이론적 지주가 되고 있으며 따라서 이러한 동적모형을 다중계층 모형과 결합시킴으로써 보다 현실성 있는 동적 모형이 구축될 수 있을 것으로 기대되기 때문이다. 그렇지만 다수의 차종을 고려하게 되는 경우 기존의 동적 배분 모형의 구축을 위하여 필요한 FIFO가 위반된다. 이것은 FIFO 제약 조건하에 구축되는 기존의 동적 배분 모델링 방법으로는 다차종 동적모형의 구축이 불가능함을 의미한다. 따라서 본 연구에서는 FIFO 제약조건을 완화 시킬 수 있는 동적 네트워크의 모형을 구축하였으며 동시에 기존의 네트워크 부화 기법의 하나인 시뮬래이션 기법을 수정하여 본 연구의 모형에 적용될 수 있도록 고안하였다. 또한 해법(알고리즘) 분야오 기존의 최단경로 산정 알고리즘을 수정한 시간종속적인 최단경로 알고리즘과, 기존의 MSA를 수정한 알고리즘도 구축하였다. 이렇게 구축된 모형과 알고리즘을 격자형 격자형 네트워크에 적용하여 동적이용자 균형해를 산정하여 구축된 알고리즘의 수렴성을 검증하였다.

동적 소셜네트워크 구조 변수를 적용한 가상 재화 구매 모형 연구 (Study of Virtual Goods Purchase Model Applying Dynamic Social Network Structure Variables)

  • 이희태;배정호
    • 유통과학연구
    • /
    • 제17권3호
    • /
    • pp.85-95
    • /
    • 2019
  • Purpose - The existing marketing studies using Social Network Analysis have assumed that network structure variables are time-invariant. However, a node's network position can fluctuate considerably over time and the node's network structure can be changed dynamically. Hence, if such a dynamic structural network characteristics are not specified for virtual goods purchase model, estimated parameters can be biased. In this paper, by comparing a time-invariant network structure specification model(base model) and time-varying network specification model(proposed model), the authors intend to prove whether the proposed model is superior to the base model. In addition, the authors also intend to investigate whether coefficients of network structure variables are random over time. Research design, data, and methodology - The data of this study are obtained from a Korean social network provider. The authors construct a monthly panel data by calculating the raw data. To fit the panel data, the authors derive random effects panel tobit model and multi-level mixed effects model. Results - First, the proposed model is better than that of the base model in terms of performance. Second, except for constraint, multi-level mixed effects models with random coefficient of every network structure variable(in-degree, out-degree, in-closeness centrality, out-closeness centrality, clustering coefficient) perform better than not random coefficient specification model. Conclusion - The size and importance of virtual goods market has been dramatically increasing. Notwithstanding such a strategic importance of virtual goods, there is little research on social influential factors which impact the intention of virtual good purchase. Even studies which investigated social influence factors have assumed that social network structure variables are time-invariant. However, the authors show that network structure variables are time-variant and coefficients of network structure variables are random over time. Thus, virtual goods purchase model with dynamic network structure variables performs better than that with static network structure model. Hence, if marketing practitioners intend to use social influences to sell virtual goods in social media, they had better consider time-varying social influences of network members. In addition, this study can be also differentiated from other related researches using survey data in that this study deals with actual field data.