• Title/Summary/Keyword: Complete network

Search Result 520, Processing Time 0.039 seconds

The Design of Remote Monitoring and Warning System for Dangerous Chemicals Based on CPS

  • Kan, Zhe;Wang, Xiaolei
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.632-644
    • /
    • 2019
  • The remote monitoring and warning system for dangerous chemicals is designed with the concept of the Cyber-Physical System (CPS) in this paper. The real-time perception, dynamic control, and information service of major hazards chemicals are realized in this CPS system. The CPS system architecture, the physical layer and the applacation layer, are designed in this paper. The terminal node is mainly composed of the field collectors which complete the data acquisition of sensors and video in the physical layers, and the use of application layer makes CPS system safer and more reliable to monitor the hazardous chemicals. The cloud application layer completes the risk identification and the prediction of the major hazard sources. The early intelligent warning of the major dangerous chemicals is realized and the security risk images are given in the cloud application layer. With the CPS technology, the remote network of hazardous chemicals has been completed, and a major hazard monitoring and accident warning online system is formed. Through the experiment of the terminal node, it can be proved that the terminal node can complete the mass data collection and classify. With this experiment it can be obtained the CPS system is safe and effective. In order to verify feasible, the multi-risk warning based on CPS is simulated, and results show that the system solves the problem of hazardous chemicals enterprises safety management.

Chord-based stepwise Korean Trot music generation technique using RNN-GAN (RNN-GAN을 이용한 코드 기반의 단계적 트로트 음악 생성 기법)

  • Hwang, Seo-Rim;Park, Young-Cheol
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.6
    • /
    • pp.622-628
    • /
    • 2020
  • This paper proposes a music generation technique that automatically generates trot music using a Generative Adversarial Network (GAN) model composed of a Recurrent Neural Network (RNN). The proposed method uses a method of creating a chord as a skeleton of the music, creating a melody and bass in stages based on the chord progression made, and attaching it to the corresponding chord to complete the structured piece. Also, a new chorus chord progression is created from the verse chord progression by applying the characteristics of a trot song that repeats the structure divided into an individual section, such as intro, verse, and chorus. And it extends the length of the created trot. The quality of the generated music was specified using subjective evaluation and objective evaluation methods. It was confirmed that the generated music has similar characteristics to the existing trot.

Research on a Mobile-aware Service Model in the Internet of Things

  • An, Jian;Gui, Xiao-Lin;Yang, Jian-Wei;Zhang, Wen-Dong;Jiang, Jin-Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.5
    • /
    • pp.1146-1165
    • /
    • 2013
  • Collaborative awareness between persons with various smart multimedia devices is a new trend in the Internet of Things (IoT). Because of the mobility, randomness, and complexity of persons, it is difficult to achieve complete data awareness and data transmission in IoT. Therefore, research must be conducted on mobile-aware service models. In this work, we first discuss and quantify the social relationships of mobile nodes from multiple perspectives based on a summary of social characteristics. We then define various decision factors (DFs). Next, we construct a directed and weighted community by analyzing the activity patterns of mobile nodes. Finally, a mobile-aware service routing algorithm (MSRA) is proposed to determine appropriate service nodes through a trusted chain and optimal path tree. The simulation results indicate that the model has superior dynamic adaptability and service discovery efficiency compared to the existing models. The mobile-aware service model could be used to improve date acquisition techniques and the quality of mobile-aware service in the IoT.

An implementation of hypercube with routing algorithm in bisectional interconnection network (Bisectional 상호연결 네트워크에서 하이퍼큐브의 구현과 경로배정 알고리즘)

  • 최창훈;정영호;김성천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.5
    • /
    • pp.1180-1192
    • /
    • 1996
  • On demand of many users, basic networks of a parallel computer system are required to have a property that can embed various topologies. Bisectional interconnection network is known to satisfy this property, and it can embed various topologies optimally. Nowadays one is very interested in the hypercube as a message pssing multicomputer system, so it is very important to implement a hypercube in bisectional network. In this paper, a hypercube is implemented in a versatile bisecional netork, and its routing and broadcasting algorithm are proposed. Conventional bisectional network can accomodata linear array, complete binary tree and mesh structure as its topology. Now hypercube is implemented to be utilized as a general purpose supercomputercommunication architecture. The proposed routing and broadcasting algorithm embedded in bisectional network are general purpose algorithms which satisfy property of conventional hypercube.

  • PDF

The Improvement method of operation system for the maritime safety network in our country (우리나라의 해상안전통신망 관리 체계 개선방안)

  • 강민수;강민정;신현식;배영철;박연식
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.647-652
    • /
    • 2002
  • The main object of Maritime Safety Network is to prevent Marine Accidents in advance and avoid the loss of live and property efficiently. Our country's Marine Safety Network was widely changed with its concerned rules and the operation methods through the complete operation of GMDSS system. Thus, compared with the past, maritime safety equipment and its systems were enforced, but the loss of lives from marine accidents tends to increase against the general expectation. 80 percent of the total marine accidents in Korea is caused by small fishing boats that are capsized immediately from accidents. To minimize the loss of lives they are to require the help of rescue. Lately imported GMDSS communication equipment is operated very fast automatically to issue the rescue and inform the distress, but most general small fishing boats are under 5 ton vessel and excluded from the administration of GMDSS system. In this paper is to propose the proper solution for the efficient improvement of maritime safety network suitable for the our practical circumstance.

  • PDF

IoT and Wireless Sensor Network Monitoring for Campus Security (캠퍼스 보안을 위한 IoT 및 무선 센서 네트워크 모니터링)

  • Mateen, Ahmed;Zhu, Qingsheng;Afsar, Salman;Usman, Muhammad
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.33-41
    • /
    • 2018
  • The idea of the Internet of Things as a platform on the Smart Campus has become increasingly popular. It requires an infrastructure consisting of communication networks, sensor nodes and gateways to connect to the Internet. Each sensor node is responsible for gathering data from the environment. This document outlines a network of wireless sensors on the Internet for the application of Smart Campus monitoring. Wireless sensor network Monitoring have become a complete solution to using a low power implementation and integrated systems. The numerous restrictions however result from the low communication range, the limited computing power, the lack of availability of the network protocol, the lack of programming security and the security failures in the areas of confidentiality, integrity and availability. A new security technique and its functionality for WSNM nodes developed. Development in the research of a secure network and suggestions for avoiding denial of service (DOS) and complexity attacks. These systems if properly implemented can provide an energy efficiency mechanism through pre-allocation and a new key from key management models with a secure routine algorithm.

Match Field based Algorithm Selection Approach in Hybrid SDN and PCE Based Optical Networks

  • Selvaraj, P.;Nagarajan, V.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5723-5743
    • /
    • 2018
  • The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

ISFRNet: A Deep Three-stage Identity and Structure Feature Refinement Network for Facial Image Inpainting

  • Yan Wang;Jitae Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.881-895
    • /
    • 2023
  • Modern image inpainting techniques based on deep learning have achieved remarkable performance, and more and more people are working on repairing more complex and larger missing areas, although this is still challenging, especially for facial image inpainting. For a face image with a huge missing area, there are very few valid pixels available; however, people have an ability to imagine the complete picture in their mind according to their subjective will. It is important to simulate this capability while maintaining the identity features of the face as much as possible. To achieve this goal, we propose a three-stage network model, which we refer to as the identity and structure feature refinement network (ISFRNet). ISFRNet is based on 1) a pre-trained pSp-styleGAN model that generates an extremely realistic face image with rich structural features; 2) a shallow structured network with a small receptive field; and 3) a modified U-net with two encoders and a decoder, which has a large receptive field. We choose structural similarity index (SSIM), peak signal-to-noise ratio (PSNR), L1 Loss and learned perceptual image patch similarity (LPIPS) to evaluate our model. When the missing region is 20%-40%, the above four metric scores of our model are 28.12, 0.942, 0.015 and 0.090, respectively. When the lost area is between 40% and 60%, the metric scores are 23.31, 0.840, 0.053 and 0.177, respectively. Our inpainting network not only guarantees excellent face identity feature recovery but also exhibits state-of-the-art performance compared to other multi-stage refinement models.

Optimal Design of Nonsequential Batch-Storage Network (비순차 회분식 공정-저장조 망구조 최적 설계)

  • 이경범;이의수
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.5
    • /
    • pp.407-412
    • /
    • 2003
  • An effective methodology is .reported for determining the optimal capacity (lot-size) of batch processing and storage networks which include material recycle or reprocessing streams. We assume that any given storage unit can store one material type which can be purchased from suppliers, be internally produced, internally consumed and/or sold to customers. We further assume that a storage unit is connected to all processing stages that use or produce the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. The objective for optimization is to minimize the total cost composed of raw material procurement, setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory hold-up. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two subproblems. The first yields analytical solutions for determining batch sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks. For the special case in which the number of storage is equal to the number of process stages and raw materials storage units, a complete analytical solution for average flow rates can be derived. The analytical solution for the multistage, strictly sequential batch-storage network case can also be obtained via this approach. The principal contribution of this study is thus the generalization and the extension to non-sequential networks with recycle streams. An illustrative example is presented to demonstrate the results obtainable using this approach.

A Clustered Reconfigurable Interconnection Network BIST Based on Signal Probabilities of Deterministic Test Sets (결정론적 테스트 세트의 신호확률에 기반을 둔 clustered reconfigurable interconnection network 내장된 자체 테스트 기법)

  • Song Dong-Sup;Kang Sungho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.12
    • /
    • pp.79-90
    • /
    • 2005
  • In this paper, we propose a new clustered reconfigurable interconnect network (CRIN) BIST to improve the embedding probabilities of random-pattern-resistant-patterns. The proposed method uses a scan-cell reordering technique based on the signal probabilities of given test cubes and specific hardware blocks that increases the embedding probabilities of care bit clustered scan chain test cubes. We have developed a simulated annealing based algorithm that maximizes the embedding probabilities of scan chain test cubes to reorder scan cells, and an iterative algorithm for synthesizing the CRIN hardware. Experimental results demonstrate that the proposed CRIN BIST technique achieves complete fault coverage with lower storage requirement and shorter testing time in comparison with the conventional methods.