• Title/Summary/Keyword: Network Partition

Search Result 156, Processing Time 0.415 seconds

Context-Adaptive Intra Prediction Model Training and Its Coding Performance Analysis (문맥적응적 화면내 예측 모델 학습 및 부호화 성능분석)

  • Moon, Gihwa;Park, Dohyeon;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.27 no.3
    • /
    • pp.332-340
    • /
    • 2022
  • Recently, with the development of deep learning and artificial neural network technologies, research on the application of neural network has been actively conducted in the field of video coding. In particular, deep learning-based intra prediction is being studied as a way to overcome the performance limitations of the existing intra prediction techniques. This paper presents a method of context-adaptive neural network-based intra prediction model training and its coding performance analysis. In other words, in this paper, we implement and train a known intra prediction model based on convolutional neural network (CNN) that predicts a current block using contextual information from reference blocks. Then, we integrate the trained model into HM16.19 as an additional intra prediction mode and evaluate the coding performance of the trained model. Experimental results show that the trained model gives 0.28% BD-rate bit saving over HEVC in All Intra (AI) coding mode. In addition, the coding performance change of training considering block partition is also presented.

Optimal Graph Partitioning by Boltzmann Machine (Boltzmann Machine을 이용한 그래프의 최적분할)

  • Lee, Jong-Hee;Kim, Jin-Ho;Park, Heung-Moon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.7
    • /
    • pp.1025-1032
    • /
    • 1990
  • We proposed a neural network energy function for the optimal graph partitioning and its optimization method using Boltzmann Machine. We composed a Boltzmann Machine with the proposed neural network energy function, and the simulation results show that we can obtain an optimal solution with the energy function parameters of A=50, B=5, c=14 and D=10, at the Boltzmann Machine parameters of To=80 and \ulcorner0.07 for a 6-node 3-partition problem. As a result, the proposed energy function and optimization parameters are proved to be feasible for the optimal graph partitioning.

  • PDF

A Study on The Performance Analysis of Partition Multistage Interconnection Network (분할된 다단상호접속망의 성능 분석에 관한 연구)

  • 김영선;최진규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.6
    • /
    • pp.675-685
    • /
    • 1989
  • The interconnection network is an integral part of parallel processing system. The multistage interconnection networks(MINs) have been the objects of intense research in recent years. In this paper, simulation techniques for circuit switchign MIN are extended to allow the performance evaluation of partitioned ADM/IADM network. Based on simulation data, the relationship between the netwrok performance, the partitioning scheme employed, and the conflict resolution strategies used within the network is enumerated. It is shown that IADM network coupled with the use of the hold strategy produces the best network operation in terms of RST (Request Service Time).

  • PDF

A Study of Logical Network Partition and Behavior-based Detection System Using FTS (FTS를 이용한 논리적 망 분리와 행위기반 탐지 시스템에 관한 연구)

  • Kim, MinSu;Shin, SangIl;Ahn, ChungJoon;Kim, Kuinam J.
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.109-115
    • /
    • 2013
  • Security threats through e-mail service, a representative tool to convey information on the internet, are on the sharp rise. The security threats are made in the path where malicious codes are inserted into documents files attached and infect users' systems by taking advantage of the weak points of relevant application programs. Therefore, to block infection of camouflaged malicious codes in the course of file transfer, this work proposed an integrity-checking and behavior-based detection system using File Transfer System (FTS), logical network partition, and conducted a comparison analysis with the conventional security techniques.

TG-SPSR: A Systematic Targeted Password Attacking Model

  • Zhang, Mengli;Zhang, Qihui;Liu, Wenfen;Hu, Xuexian;Wei, Jianghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2674-2697
    • /
    • 2019
  • Identity authentication is a crucial line of defense for network security, and passwords are still the mainstream of identity authentication. So far trawling password attacking has been extensively studied, but the research related with personal information is always sporadic. Probabilistic context-free grammar (PCFG) and Markov chain-based models perform greatly well in trawling guessing. In this paper we propose a systematic targeted attacking model based on structure partition and string reorganization by migrating the above two models to targeted attacking, denoted as TG-SPSR. In structure partition phase, besides dividing passwords to basic structure similar to PCFG, we additionally define a trajectory-based keyboard pattern in the basic grammar and introduce index bits to accurately characterize the position of special characters. Moreover, we also construct a BiLSTM recurrent neural network classifier to characterize the behavior of password reuse and modification after defining nine kinds of modification rules. Extensive experimental results indicate that in online attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 275%, and respectively outperforms its foremost counterparts, Personal-PCFG, TarGuess-I, by about 70% and 19%; In offline attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 90%, outperforms Personal-PCFG and TarGuess-I by 85% and 30%, respectively.

Multi-Objective Pareto Optimization of Parallel Synthesis of Embedded Computer Systems

  • Drabowski, Mieczyslaw
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.304-310
    • /
    • 2021
  • The paper presents problems of optimization of the synthesis of embedded systems, in particular Pareto optimization. The model of such a system for its design for high-level of abstract is based on the classic approach known from the theory of task scheduling, but it is significantly extended, among others, by the characteristics of tasks and resources as well as additional criteria of optimal system in scope structure and operation. The metaheuristic algorithm operating according to this model introduces a new approach to system synthesis, in which parallelism of task scheduling and resources partition is applied. An algorithm based on a genetic approach with simulated annealing and Boltzmann tournaments, avoids local minima and generates optimized solutions. Such a synthesis is based on the implementation of task scheduling, resources identification and partition, allocation of tasks and resources and ultimately on the optimization of the designed system in accordance with the optimization criteria regarding cost of implementation, execution speed of processes and energy consumption by the system during operation. This paper presents examples and results for multi-criteria optimization, based on calculations for specifying non-dominated solutions and indicating a subset of Pareto solutions in the space of all solutions.

A Study on the Automatic Placement and Routing System for Standard Cell (스텐다드 셀의 자동배치 배선시스템에 관한 연구)

  • 엄낙웅;강길순;박송배
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.6
    • /
    • pp.1049-1055
    • /
    • 1987
  • This paper describes a near-optimal standard cell layout strategy which consists of three consecutives steps` partition, placement, and routing. In the partition step, a given network is torn apart into many subnetworks such that each subnetworks contains as many cells as possible with minimum interocnnections between subnetwork. In the placement step, the conventional string placement algorithm was modified. Also, bonding pads were placed such that their connections to the related cells are shortest. As a result for the tested example, the placement time was saved by 60% and the total routing lengths were saved by more than 20% and substantial improvements in the number of feed-through cell and the track density were obtained. The layout program is coded in PASCAL and implemented on a VAX 11-750/UNIX computer.

  • PDF

Charted Depth Interpolation: Neuron Network Approaches

  • Shi, Chaojian
    • Journal of Navigation and Port Research
    • /
    • v.28 no.7
    • /
    • pp.629-634
    • /
    • 2004
  • Continuous depth data are often required in applications of both onboard systems and maritime simulation. But data available are usually discrete and irregularly distributed. Based on the neuron network technique, methods of interpolation to the charted depth are suggested in this paper. Two algorithms based on Levenberg-Marquardt back-propaganda and radial-basis function networks are investigated respectively. A dynamic neuron network system is developed which satisfies both real time and mass processing applications. Using hyperbolic paraboloid and typical chart area, effectiveness of the algorithms is tested and error analysis presented. Special process in practical applications such as partition of lager areas, normalization and selection of depth contour data are also illustrated.

A Study on the Diagnosis of Appendicitis using Fuzzy Neural Network (퍼지 신경망을 이용한 맹장염진단에 관한 연구)

  • 박인규;신승중;정광호
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2000.04a
    • /
    • pp.253-257
    • /
    • 2000
  • the objective of this study is to design and evaluate a methodology for diagnosing the appendicitis in a fuzzy neural network that integrates the partition of input space by fuzzy entropy and the generation of fuzzy control rules and learning algorithm. In particular the diagnosis of appendicitis depends on the rule of thumb of the experts such that it associates with the region, the characteristics, the degree of the ache and the potential symptoms. In this scheme the basic idea is to realize the fuzzy rle base and the process of reasoning by neural network and to make the corresponding parameters of the fuzzy control rules be adapted by back propagation learning rule. To eliminate the number of the parameters of the rules, the output of the consequences of the control rules is expressed by the network's connection weights. As a result we obtain a method for reducing the system's complexities. Through computer simulations the effectiveness of the proposed strategy is verified for the diagnosis of appendicitis.

  • PDF

Charted Depth Interpolation: Neuron Network Approaches

  • Chaojian, Shi
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2004.08a
    • /
    • pp.37-44
    • /
    • 2004
  • Continuous depth data are often required in applications of both onboard systems and maritime simulation. But data available are usually discrete and irregularly distributed. Based on the neuron network technique, methods of interpolation to the charted depth are suggested in this paper. Two algorithms based on Levenberg-Marquardt back-propaganda and radial-basis function networks are investigated respectively. A dynamic neuron network system is developed which satisfies both real time and mass processing applications. Using hyperbolic paraboloid and typical chart area, effectiveness of the algorithms is tested and error analysis presented. Special process in practical applications such as partition of lager areas, normalization and selection of depth contour data are also illustrated.

  • PDF