• Title/Summary/Keyword: Internet Based Laboratory

Search Result 491, Processing Time 0.028 seconds

Deep Local Multi-level Feature Aggregation Based High-speed Train Image Matching

  • Li, Jun;Li, Xiang;Wei, Yifei;Wang, Xiaojun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1597-1610
    • /
    • 2022
  • At present, the main method of high-speed train chassis detection is using computer vision technology to extract keypoints from two related chassis images firstly, then matching these keypoints to find the pixel-level correspondence between these two images, finally, detection and other steps are performed. The quality and accuracy of image matching are very important for subsequent defect detection. Current traditional matching methods are difficult to meet the actual requirements for the generalization of complex scenes such as weather, illumination, and seasonal changes. Therefore, it is of great significance to study the high-speed train image matching method based on deep learning. This paper establishes a high-speed train chassis image matching dataset, including random perspective changes and optical distortion, to simulate the changes in the actual working environment of the high-speed rail system as much as possible. This work designs a convolutional neural network to intensively extract keypoints, so as to alleviate the problems of current methods. With multi-level features, on the one hand, the network restores low-level details, thereby improving the localization accuracy of keypoints, on the other hand, the network can generate robust keypoint descriptors. Detailed experiments show the huge improvement of the proposed network over traditional methods.

Development of Problem-based Learning case using Multimedia (멀티미디어를 이용한 문제중심 증례 개발)

  • Lee, J.H.;Yoo, S.M.;Park, E.W.;Lee, S.H.;Lee, T.S.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.11
    • /
    • pp.168-171
    • /
    • 1997
  • The purpose of this study is the development of PBL(problem-based learning) system using visual C++5.0 as a window-based application program. A patient who complains of weight loss was used in PBL case. Initial frame is made by dialog-based in MFC(microsoft foundation class). Also, sample medical images are composed of ultra-sound, chest PA, Thyroid scan, otherwise. we will make this program as CD-ROM and the internet application or computer assisted learning and continuous medical education.

  • PDF

A Fast Anti-jamming Decision Method Based on the Rule-Reduced Genetic Algorithm

  • Hui, Jin;Xiaoqin, Song;Miao, Wang;Yingtao, Niu;Ke, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4549-4567
    • /
    • 2016
  • To cope with the complex electromagnetic environment of wireless communication systems, anti-jamming decision methods are necessary to keep the reliability of communication. Basing on the rule-reduced genetic algorithm (RRGA), an anti-jamming decision method is proposed in this paper to adapt to the fast channel variations. Firstly, the reduced decision rules are obtained according to the rough set (RS) theory. Secondly, the randomly generated initial population of the genetic algorithm (GA) is screened and the individuals are preserved in accordance with the reduced decision rules. Finally, the initial population after screening is utilized in the genetic algorithm to optimize the communication parameters. In order to remove the dependency on the weights, this paper deploys an anti-jamming decision objective function, which aims at maximizing the normalized transmission rate under the constraints of minimizing the normalized transmitting power with the pre-defined bit error rate (BER). Simulations are carried out to verify the performance of both the traditional genetic algorithm and the adaptive genetic algorithm. Simulation results show that the convergence rates of the two algorithms increase significantly thanks to the initial population determined by the reduced-rules, without losing the accuracy of the decision-making. Meanwhile, the weight-independent objective function makes the algorithm more practical than the traditional methods.

Implementation of An Interactive and Internet-based Virtual Laboratory For Electronic Circuit Experiments (전자회로 실험을 위한 상호작용적인 인터넷기반 가상실험실의 구현)

  • Kim Dong-Sik;Choi Kwan-Sun;Lee Sun-Heum
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2002.08a
    • /
    • pp.199-207
    • /
    • 2002
  • A virtual laboratory for measurement and instrumentation must aim to realize an integrated environment. To achieve this goal, we designed and implemented a client/server distributed environment and developed a web-based virtual laboratory system for electronic circuits. Since our virtual laboratory system is implemented to describe the on-campus laboratory, the learners can obtain similar experimental data through it. The proposed virtual laboratory system is composed of four important components Principle Classroom, Virtual Experiment Classroom, Evaluation Classroom and Overall Management System. Through our virtual laboratory, the learners will be capable of teaming the concepts and theories related to electronic circuit experiments and how to operate the experimental equipments such as multimeters, function generators, digital oscilloscopes and DC power supplies. Also, every activity occurred in our virtual laboratory is recorded on database and Printed out on the preliminary report form. All of these can be achieved by the aid of the Management System. The database connectivity is made by PHP and the virtual laboratory environment is set up slightly differently for each learner. Finally, we have obtained several affirmative effects such as reducing the total experimental hours and the damage rate for experimental equipments and increasing Loaming efficiencies as well as faculty productivity.

  • PDF

A Receiver-Driven Loss Recovery Mechanism for Video Dissemination over Information-Centric VANET

  • Han, Longzhe;Bao, Xuecai;Wang, Wenfeng;Feng, Xiangsheng;Liu, Zuhan;Tan, Wenqun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3465-3479
    • /
    • 2017
  • Information-Centric Vehicular Ad Hoc Network (IC-VANET) is a promising network architecture for the future intelligent transport system. Video streaming applications over IC-VANET not only enrich infotainment services, but also provide the drivers and pedestrians real-time visual information to make proper decisions. However, due to the characteristics of wireless link and frequent change of the network topology, the packet loss seriously affects the quality of video streaming applications. In this paper, we propose a REceiver-Driven loss reCOvery Mechanism (REDCOM) to enhance video dissemination over IC-VANET. A Markov chain based estimation model is introduced to capture the real-time network condition. Based on the estimation result, the proposed REDCOM recovers the lost packets by requesting additional forward error correction packets. The REDCOM follows the receiver-driven model of IC-VANET and does not require the infrastructure support to efficiently overcome packet losses. Experimental results demonstrate that the proposed REDCOM improves video quality under various network conditions.

Resilient Routing Overlay Network Construction with Super-Relay Nodes

  • Tian, Shengwen;Liao, Jianxin;Li, Tonghong;Wang, Jingyu;Cui, Guanghai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1911-1930
    • /
    • 2017
  • Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

A Hybrid Cloud Testing System Based on Virtual Machines and Networks

  • Chen, Jing;Yan, Honghua;Wang, Chunxiao;Liu, Xuyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1520-1542
    • /
    • 2020
  • Traditional software testing typically uses many physical resources to manually build various test environments, resulting in high resource costs and long test time due to limited resources, especially for small enterprises. Cloud computing can provide sufficient low-cost virtual resources to alleviate these problems through the virtualization of physical resources. However, the provision of various test environments and services for implementing software testing rapidly and conveniently based on cloud computing is challenging. This paper proposes a multilayer cloud testing model based on cloud computing and implements a hybrid cloud testing system based on virtual machines (VMs) and networks. This system realizes the automatic and rapid creation of test environments and the remote use of test tools and test services. We conduct experiments on this system and evaluate its applicability in terms of the VM provision time, VM performance and virtual network performance. The experimental results demonstrate that the performance of the VMs and virtual networks is satisfactory and that this system can improve the test efficiency and reduce test costs through rapid virtual resource provision and convenient test services.

Design and Implementation of a Latency Efficient Encoder for LTE Systems

  • Hwang, Soo-Yun;Kim, Dae-Ho;Jhang, Kyoung-Son
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.493-502
    • /
    • 2010
  • The operation time of an encoder is one of the critical implementation issues for satisfying the timing requirements of Long Term Evolution (LTE) systems because the encoder is based on binary operations. In this paper, we propose a design and implementation of a latency efficient encoder for LTE systems. By virtue of 8-bit parallel processing of the cyclic redundancy checking attachment, code block (CB) segmentation, and a parallel processor, we are able to construct engines for turbo codings and rate matchings of each CB in a parallel fashion. Experimental results illustrate that although the total area and clock period of the proposed scheme are 19% and 6% larger than those of a conventional method based on a serial scheme, respectively, our parallel structure decreases the latency by about 32% to 65% compared with a serial structure. In particular, our approach is more latency efficient when the encoder processes a number of CBs. In addition, we apply the proposed scheme to a real system based on LTE, so that the timing requirement for ACK/NACK transmission is met by employing the encoder based on the parallel structure.

A Group Key Management Scheme for WSN Based on Lagrange Interpolation Polynomial Characteristic

  • Wang, Xiaogang;Shi, Weiren;Liu, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3690-3713
    • /
    • 2019
  • According to the main group key management schemes logical key hierarchy (LKH), exclusion basis systems (EBS) and other group key schemes are limited in network structure, collusion attack, high energy consumption, and the single point of failure, this paper presents a group key management scheme for wireless sensor networks based on Lagrange interpolation polynomial characteristic (AGKMS). That Chinese remainder theorem is turned into a Lagrange interpolation polynomial based on the function property of Chinese remainder theorem firstly. And then the base station (BS) generates a Lagrange interpolation polynomial function f(x) and turns it to be a mix-function f(x)' based on the key information m(i) of node i. In the end, node i can obtain the group key K by receiving the message f(m(i))' from the cluster head node j. The analysis results of safety performance show that AGKMS has good network security, key independence, anti-capture, low storage cost, low computation cost, and good scalability.

Lattice-based Threshold Ring Signature with Message Block Sharing

  • CHEN, Jiangshan;HU, Yupu;GAO, Wen;Liang, Hongmei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.1003-1019
    • /
    • 2019
  • Threshold ring signature scheme enables any t entities from N ring members to spontaneously generate a publicly verifiable t-out-of-N signature anonymously. The verifier is convinced that the signature is indeed generated by at least t users from the claimed group, but he cannot tell them apart. Threshold ring signatures are significant for ad-hoc groups such as mobile ad-hoc networks. Based on the lattice-based ring signature proposed by Melchor et al. at AFRICRYPT'13, this work presents a lattice-based threshold ring signature scheme, employing the technique of message block sharing proposed by Choi and Kim. Besides, in order to avoid the system parameter setup problems, we proposed a message processing technique called "pad-then-permute", to pre-process the message before blocking the message, thus making the threshold ring signature scheme more flexible. Our threshold ring signature scheme has several advantages: inherits the quantum immunity from the lattice structure; has considerably short signature and almost no signature size increase with the threshold value; provable to be correct, efficient, indistinguishable source hiding, and unforgeable.