• Title/Summary/Keyword: Sub-network

Search Result 1,492, Processing Time 0.03 seconds

Ensemble Deep Network for Dense Vehicle Detection in Large Image

  • Yu, Jae-Hyoung;Han, Youngjoon;Kim, JongKuk;Hahn, Hernsoo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.45-55
    • /
    • 2021
  • This paper has proposed an algorithm that detecting for dense small vehicle in large image efficiently. It is consisted of two Ensemble Deep-Learning Network algorithms based on Coarse to Fine method. The system can detect vehicle exactly on selected sub image. In the Coarse step, it can make Voting Space using the result of various Deep-Learning Network individually. To select sub-region, it makes Voting Map by to combine each Voting Space. In the Fine step, the sub-region selected in the Coarse step is transferred to final Deep-Learning Network. The sub-region can be defined by using dynamic windows. In this paper, pre-defined mapping table has used to define dynamic windows for perspective road image. Identity judgment of vehicle moving on each sub-region is determined by closest center point of bottom of the detected vehicle's box information. And it is tracked by vehicle's box information on the continuous images. The proposed algorithm has evaluated for performance of detection and cost in real time using day and night images captured by CCTV on the road.

Design and Its Applications of a Hypercube Grid Quorum for Distributed Pub/Sub Architectures in IoTs (사물인터넷에서 분산 발행/구독 구조를 위한 하이퍼큐브 격자 쿼럼의 설계 및 응용)

  • Bae, Ihnhan
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.8
    • /
    • pp.1075-1084
    • /
    • 2022
  • Internet of Things(IoT) has become a key available technology for efficiently implementing device to device(D2D) services in various domains such as smart home, healthcare, smart city, agriculture, energy, logistics, and transportation. A lightweight publish/subscribe(Pub/Sub) messaging protocol not only establishes data dissemination pattern but also supports connectivity between IoT devices and their applications. Also, a Pub/Sub broker is deployed to facilitate data exchange among IoT devices. A scalable edge-based publish/subscribe (Pub/Sub) broker overlay networks support latency-sensitive IoT applications. In this paper, we design a hypercube grid quorum(HGQ) for distributed Pub/Sub systems based IoT applications. In designing HGQ, the network of hypercube structures suitable for the publish/subscribe model is built in the edge layer, and the proposed HGQ is designed by embedding a mesh overlay network in the hypercube. As their applications, we propose an HGQ-based mechansim for dissemination of the data of sensors or the message/event of IoT devices in IoT environments. The performance of HGQ is evaluated by analytical models. As the results, the latency and load balancing of applications based on the distributed Pub/Sub system using HGQ are improved.

Design of OP-AMP using MOSFET of Sub-threshold Region (Sub-threshold 영역의 MOSFET 동작을 이용한 OP-AMP 설계)

  • Cho, Tae-Il;Yeo, Sung-Dae;Cho, Seung-Il;Kim, Seong-Kweon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.7
    • /
    • pp.665-670
    • /
    • 2016
  • In this paper, we suggest the design of OP-AMP using MOSFET in the operation of sub-threshold condition as a basic unit of an IoT. The sub-threshold operation of MOSFET is useful for an ultra low power consumption of sensor network system in the IoT, because it cause the supply voltage to be reduced. From the simulation result using 0.35 um CMOS process, the supply voltage, VDD can be reduced with 0.6 V, open-loop gain of 43 dB and the power consumption was evaluated with about $1.3{\mu}W$ and the active size for an integration was measured with $64{\mu}m{\times}105{\mu}m$. It is expected that the proposed circuit is applied to the low power sensor network for IoT.

A Study on the Possibility to Use Christopher Alexander's Pattern Language by Using Network Analysis Tool (연결망 분석도구를 이용한 크리스토퍼 알렉산더 패턴언어 활용 가능성에 관한 연구)

  • Jung, Sung-Wook;Kim, Moon-Duck
    • Korean Institute of Interior Design Journal
    • /
    • v.25 no.3
    • /
    • pp.31-39
    • /
    • 2016
  • This study is aimed to increase the possibility of using the Christopher Alexander's pattern language. The methodology of this study is (i) to analyze the pattern language by using the network analysis tool in order to understand the complicate network structure of the pattern language, and (ii) to apply the Alexander's method of using the pattern language by using the network analysis tool (Gephi) and to examine the feasibility of the network analysis tool as a tool for using the pattern language. Firstly, as a result of analysing the pattern language, (i) the pattern language classified by pattern number is distinguished by the patterns of towns, buildings and construction, among which the pattern of buildings plays a key function in the networks; (ii) the buildings functions a medium connecting between the towns and the construction; and (iii) the pattern language is divided into 6 sub-modules, through which the user can select a pattern. Secondly, the result of using the network analysis tool as a tool for using the pattern language (i) suggests the new method of using the pattern language by using the network analysis tool (Gephi); (ii) makes it possible to easily figure out the characteristics of the links between the patterns; and (iii) increases the completeness of the pattern language by making it easy to find out the sub-patterns in selecting a pattern.

Performance Evaluation of Service-Aware Optical Transport System

  • Youn, Ji-Wook;Yu, Jea-Hoon;Yoo, Tae-Whan
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.241-247
    • /
    • 2010
  • We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed (이븐 연결망 Ed의 에지 중복 없는 스패닝 트리를 구성하는 알고리즘)

  • Kim, Jong-Seok;Kim, Sung-Won
    • The KIPS Transactions:PartA
    • /
    • v.17A no.3
    • /
    • pp.113-120
    • /
    • 2010
  • Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

Quality grading of Hanwoo (Korean native cattle breed) sub-images using convolutional neural network

  • Kwon, Kyung-Do;Lee, Ahyeong;Lim, Jongkuk;Cho, Soohyun;Lee, Wanghee;Cho, Byoung-Kwan;Seo, Youngwook
    • Korean Journal of Agricultural Science
    • /
    • v.47 no.4
    • /
    • pp.1109-1122
    • /
    • 2020
  • The aim of this study was to develop a marbling classification and prediction model using small parts of sirloin images based on a deep learning algorithm, namely, a convolutional neural network (CNN). Samples were purchased from a commercial slaughterhouse in Korea, images for each grade were acquired, and the total images (n = 500) were assigned according to their grade number: 1++, 1+, 1, and both 2 & 3. The image acquisition system consists of a DSLR camera with a polarization filter to remove diffusive reflectance and two light sources (55 W). To correct the distorted original images, a radial correction algorithm was implemented. Color images of sirloins of Hanwoo (mixed with feeder cattle, steer, and calf) were divided and sub-images with image sizes of 161 × 161 were made to train the marbling prediction model. In this study, the convolutional neural network (CNN) has four convolution layers and yields prediction results in accordance with marbling grades (1++, 1+, 1, and 2&3). Every single layer uses a rectified linear unit (ReLU) function as an activation function and max-pooling is used for extracting the edge between fat and muscle and reducing the variance of the data. Prediction accuracy was measured using an accuracy and kappa coefficient from a confusion matrix. We summed the prediction of sub-images and determined the total average prediction accuracy. Training accuracy was 100% and the test accuracy was 86%, indicating comparably good performance using the CNN. This study provides classification potential for predicting the marbling grade using color images and a convolutional neural network algorithm.

Position of Hungarian Merino among other Merinos, within-breed genetic similarity network and markers associated with daily weight gain

  • Attila, Zsolnai;Istvan, Egerszegi;Laszlo, Rozsa;David, Mezoszentgyorgyi;Istvan, Anton
    • Animal Bioscience
    • /
    • v.36 no.1
    • /
    • pp.10-18
    • /
    • 2023
  • Objective: In this study, we aimed to position the Hungarian Merino among other Merinoderived sheep breeds, explore the characteristics of our sampled animals' genetic similarity network within the breed, and highlight single nucleotide polymorphisms (SNPs) associated with daily weight-gain. Methods: Hungarian Merino (n = 138) was genotyped on Ovine SNP50 Bead Chip (Illumina, San Diego, CA, USA) and positioned among 30 Merino and Merino-derived breeds (n = 555). Population characteristics were obtained via PLINK, SVS, Admixture, and Treemix software, within-breed network was analysed with python networkx 2.3 library. Daily weight gain of Hungarian Merino was standardised to 60 days and was collected from the database of the Association of Hungarian Sheep and Goat Breeders. For the identification of loci associated with daily weight gain, a multi-locus mixed-model was used. Results: Supporting the breed's written history, the closest breeds to Hungarian Merino were Estremadura and Rambouillet (pairwise FST values are 0.035 and 0.036, respectively). Among Hungarian Merino, a highly centralised connectedness has been revealed by network analysis of pairwise values of identity-by-state, where the animal in the central node had a betweenness centrality value equal to 0.936. Probing of daily weight gain against the SNP data of Hungarian Merinos revealed five associated loci. Two of them, OAR8_17854216.1 and s42441.1 on chromosome 8 and 9 (-log10P>22, false discovery rate<5.5e-20) and one locus on chromosome 20, s28948.1 (-log10P = 13.46, false discovery rate = 4.1e-11), were close to the markers reported in other breeds concerning daily weight gain, six-month weight, and post-weaning gain. Conclusion: The position of Hungarian Merino among other Merino breeds has been determined. We have described the similarity network of the individuals to be applied in breeding practices and highlighted several markers useful for elevating the daily weight gain of Hungarian Merino.

AN ANALYSIS OF MMPP/D1, D2/1/B QUEUE FOR TRAFFIC SHAPING OF VOICE IN ATM NETWORK

  • CHOI, DOO IL
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.2
    • /
    • pp.69-80
    • /
    • 1999
  • Recently in telecommunication, BISDN ( Broadband Integrated Service Digital Network ) has received considerable attention for its capability of providing a common interface for future communication needs including voice, data and video. Since all information in BISDN are statistically multiplexed and are transported in high speed by means of discrete units of 53-octet ATM ( asynchronous Transfer Mode ) cells, appropriate traffic control needs. For traffic shaping of voice, the output cell discarding scheme has been proposed. We analyze the scheme with a MMPP/$D_1$, $D_2$/1/B queueing system to obtain performance measures such as loss probability and waiting time distribution.

  • PDF

Method for Evaluating Optimal Air Monitoring Sites for SO2 in Ulsan (울산광역시 아황산가스(SO2)의 최적관측소 평가방법)

  • Lim, Junghyun;Yoon, Sanghoo
    • Journal of Environmental Science International
    • /
    • v.26 no.9
    • /
    • pp.1073-1080
    • /
    • 2017
  • Manufacturing and technology industries produce large amounts of air pollutants. Ulsan Metropolitan City, South Korea, is well-known for its large industrial complexes; in particular, the concentration of $SO_2$ here is the highest in the country. We assessed $SO_2$ monitoring sites based on conditional and joint entropy, because this is a common method for determining an optimal air monitoring network. Monthly $SO_2$ concentrations from 12 air monitoring sites were collected, and the distribution of spatial locations was determined by kriging. Mean absolute error, Root Mean Squared Error (RMSE), bias and correlation coefficients were employed to evaluate the considered algorithms. An optimal air monitoring network for Ulsan was suggested based on the improvement of RMSE.