• Title/Summary/Keyword: String algorithms

Search Result 105, Processing Time 0.022 seconds

Real-Time Power Electronics Remote Wiring and Measurement Laboratory (PermLAB) Using 3-D Matrix Switching Algorithms

  • Asumadu, Johnson A.;Tanner, Ralph;Ogunley, Hakeem
    • Journal of Power Electronics
    • /
    • v.10 no.6
    • /
    • pp.611-620
    • /
    • 2010
  • This paper presents a new architecture, called "Power Electronics Remote Wiring and Measurement Laboratory (PermLAB)", that translates a common gateway interface (CGI) string from a remote web user to a web server connected to a 3-dimension switching matrix board, can be used to switch on and off, and to control a cluster of instruments and components. PermLAB addresses real-time connection, switching, and data acquisition over the Internet instead of using simulated data. A software procedure uses a signature system to identify each instrument and component in a complex system. The Web-server application is developed in HTML, JavaScript and Java, and in C language for the CGI interface, which resides in a controller portion of LabVIEW. The LabVIEW software fully integrates the Web sever, LabVIEW data acquisition boards and controllers, and the 3-dimensional switching matrix board. The paper will analyze a half-wave rectifier (AC - DC converter) circuit connected over the Internet using the PermLAB. PermLAB allows students to obtain real data by real-time wiring of real circuits in the laboratory using a "virtual breadboard" on the Web. The software for the Web-based 3-dimensional system is flexible, portable, can be integrated into many laboratory applications or expanded, and easily accessible worldwide.

Detection of Malicious PDF based on Document Structure Features and Stream Objects

  • Kang, Ah Reum;Jeong, Young-Seob;Kim, Se Lyeong;Kim, Jonghyun;Woo, Jiyoung;Choi, Sunoh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.11
    • /
    • pp.85-93
    • /
    • 2018
  • In recent years, there has been an increasing number of ways to distribute document-based malicious code using vulnerabilities in document files. Because document type malware is not an executable file itself, it is easy to bypass existing security programs, so research on a model to detect it is necessary. In this study, we extract main features from the document structure and the JavaScript contained in the stream object In addition, when JavaScript is inserted, keywords with high occurrence frequency in malicious code such as function name, reserved word and the readable string in the script are extracted. Then, we generate a machine learning model that can distinguish between normal and malicious. In order to make it difficult to bypass, we try to achieve good performance in a black box type algorithm. For an experiment, a large amount of documents compared to previous studies is analyzed. Experimental results show 98.9% detection rate from three different type algorithms. SVM, which is a black box type algorithm and makes obfuscation difficult, shows much higher performance than in previous studies.

A Study on the Prediction of Drug Efficacy by Using Molecular Structure (분자구조 유사도를 활용한 약물 효능 예측 알고리즘 연구)

  • Jeong, Hwayoung;Song, Changhyeon;Cho, Hyeyoun;Key, Jaehong
    • Journal of Biomedical Engineering Research
    • /
    • v.43 no.4
    • /
    • pp.230-240
    • /
    • 2022
  • Drug regeneration technology is an efficient strategy than the existing new drug development process, which requires large costs and time by using drugs that have already been proven safe. In this study, we recognize the importance of the new drug regeneration aspect of new drug development and research in predicting functional similarities through the basic molecular structure that forms drugs. We test four string-based algorithms by using SMILES data and searching for their similarities. And by using the ATC codes, pair them with functional similarities, which we compare and validate to select the optimal model. We confirmed that the higher the molecular structure similarity, the higher the ATC code matching rate. We suggest the possibility of additional potency of random drugs, which can be predicted through data that give information on drugs with high molecular similarities. This model has the advantage of being a great combination with additional data, so we look forward to using this model in future research.

A Protein Structure Comparison System based on PSAML (PSAML을 이용한 단백질 구조 비고 시스템)

  • Kim Jin-Hong;Ahn Geon-Tae;Byun Sang-Hee;Lee Su-Hyun;Lee Myung-Joon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.133-148
    • /
    • 2005
  • Since understanding of similarities and differences among protein structures is very important for the study of the relationship between structure and function, many protein structure comparison systems have been developed. Hut, unfortunately, these systems introduce their own protein data derived from the PDB(Protein Data Bank), which are needed in their algorithms for comparing protein structures. In addition, according to the rapid increase in the size of PDB, these systems require much more computation to search for common substructures in their databases. In this paper, we introduce a protein structure comparison system named WS4E(A Web-Based Searching Substructures of Secondary Structure Elements) based on a PSAML database which stores PSAML documents using the eXist open XML DBMS. PSAML(Protein Structure Abstraction Markup Language) is an XML representation of protein data, describing a protein structure as the secondary structures of the protein and their relationships. Using the PSAML database, the WS4E provides web services searching for common substructures among proteins represented in PSAML. In addition, to reduce the number of candidate protein structures to be compared in the PSAML database, we used topology strings which contain the spatial information of secondary structures in a protein.

Method of ChatBot Implementation Using Bot Framework (봇 프레임워크를 활용한 챗봇 구현 방안)

  • Kim, Ki-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.1
    • /
    • pp.56-61
    • /
    • 2022
  • In this paper, we classify and present AI algorithms and natural language processing methods used in chatbots. A framework that can be used to implement a chatbot is also described. A chatbot is a system with a structure that interprets the input string by constructing the user interface in a conversational manner and selects an appropriate answer to the input string from the learned data and outputs it. However, training is required to generate an appropriate set of answers to a question and hardware with considerable computational power is required. Therefore, there is a limit to the practice of not only developing companies but also students learning AI development. Currently, chatbots are replacing the existing traditional tasks, and a practice course to understand and implement the system is required. RNN and Char-CNN are used to increase the accuracy of answering questions by learning unstructured data by applying technologies such as deep learning beyond the level of responding only to standardized data. In order to implement a chatbot, it is necessary to understand such a theory. In addition, the students presented examples of implementation of the entire system by utilizing the methods that can be used for coding education and the platform where existing developers and students can implement chatbots.

Multiobjective Genetic Algorithm for Design of an Bicriteria Network Topology (이중구속 통신망 설계를 위한 다목적 유전 알고리즘)

  • Kim, Dong-Il;Kwon, Key-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.4
    • /
    • pp.10-18
    • /
    • 2002
  • Network topology design is a multiobjective problem with various design components. The components such as cost, message delay and reliability are important to gain the best performance. Recently, Genetic Algorithms(GAs) have been widely used as an optimization method for real-world problems such as combinatorial optimization, network topology design, and so on. This paper proposed a method of Multi-objective GA for Design of the network topology which is to minimize connection cost and message delay time. A common difficulty in multiobjective optimization is the existence of an objective conflict. We used the prufer number and cluster string for encoding, parato elimination method and niche-formation method for the fitness sharing method, and reformation elitism for the prevention of pre-convergence. From the simulation, the proposed method shows that the better candidates of network architecture can be found.

Design and Implementation of 10 Giga VPN Acceleration Board (10 Giga급 VPN 가속보드 설계 및 구현)

  • 김기현;한종욱
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.661-664
    • /
    • 2003
  • Trade-off of sorority and speed always exists in the latest network environment. Recently, developed security processors is improved very performance, and sorority connection algorithms of a lot of part were embodied by hardware. This high speed security processor is essential ingredient in string network security solution equipment development that require very big band width. In this paper, we wish to describe about design and implementation of 10 Giga VPN equipments. In this system, embodied 10 Giga to use Cavium company's Nitrox-II processor, and supports two SP14-2 interface and PCI interface. All of the password algorithm that password algorithm that support is used in common use VPN equipment for compatibility with common use VPN equipment are supported and support SEED algorithm developed in domestic. Designed to support IPsec and SSL protocol, and supports all of In-Line structure that is profitable in high speed transaction and the Look-Aside structure that is profitable in practical use degree of NPU(Network Processor Unit).

  • PDF

A Genetic Algorithm with a New Encoding Method for Bicriteria Network Designs (2기준 네트워크 설계를 위한 새로운 인코딩 방법을 기반으로 하는 유전자 알고리즘)

  • Kim Jong-Ryul;Lee Jae-Uk;Gen Mituso
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.963-973
    • /
    • 2005
  • Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.

Weighted Disassemble-based Correction Method to Improve Recognition Rates of Korean Text in Signboard Images (간판영상에서 한글 인식 성능향상을 위한 가중치 기반 음소 단위 분할 교정)

  • Lee, Myung-Hun;Yang, Hyung-Jeong;Kim, Soo-Hyung;Lee, Guee-Sang;Kim, Sun-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.2
    • /
    • pp.105-115
    • /
    • 2012
  • In this paper, we propose a correction method using phoneme unit segmentation to solve misrecognition of Korean Texts in signboard images using weighted Disassemble Levenshtein Distance. The proposed method calculates distances of recognized texts which are segmented into phoneme units and detects the best matched texts from signboard text database. For verifying the efficiency of the proposed method, a database dictionary is built using 1.3 million words of nationwide signboard through removing duplicated words. We compared the proposed method to Levenshtein Distance and Disassemble Levenshtein Distance which are common representative text string comparison algorithms. As a result, the proposed method based on weighted Disassemble Levenshtein Distance represents an improvement in recognition rates 29.85% and 6% on average compared to that of conventional methods, respectively.

Efficient Handwritten Character Verification Using an Improved Dynamic Time Warping Algorithm (개선된 동적 타임 워핑 알고리즘을 이용한 효율적인 필기문자 감정)

  • Jang, Seok-Woo;Park, Young-Jae;Kim, Gye-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.7
    • /
    • pp.19-26
    • /
    • 2010
  • In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular projection method to input handwritten strings and extracts their representative features including shape, directions, etc. It then calculates the similarity between two character strings by using an improved dynamic time warping (DTW) algorithm. We improved the conventional DTW algorithm efficiently through adopting the branch-and-bound policy to the existing DTW algorithm which is well-known to produce good results in the various optimization problems. The experimental results to verify the performance of the proposed system show that the suggested handwritten character verification method operates more efficiently than the existing DTW and DDTW algorithms in terms of the speed.