• Title/Summary/Keyword: Redundant stage

Search Result 37, Processing Time 0.019 seconds

Optimizing Boot Stage of Linux for Low-power ARM Embedded Devices (리눅스기반 저전력 ARM 임베디드 장비의 부팅과정 최적화)

  • Kim, Jongseok;Yang, Jinyoung;Kim, Daeyoung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.137-140
    • /
    • 2013
  • Conventionally embedded devices used simple operating system (OS); however, the number of embedded devices using Linux as OS is increasing to keep up with hardware's performance improvement and customer's various needs. While embedded devices using Linux can take advantage of expandability, generality, portability, Linux's flexibility nature may cause undesirable overheads because of its increased complexity. One such overhead makes boot stage optimization essential in most embedded systems, where many features are redundant and possible to be removed or reconfigured. This paper applies well-known software optimization technique for Linux's boot stage to an CLM9722 DTK, measures the results, and studies about limitation of such techniques from hardware dependancy on the standard framework of Linux. The booting time from power-on until completion were decreased by 33% approximately.

  • PDF

Advanced On-Chip Debugging Unit Design for JTAG-based SoC (JTAG기반 SoC의 개선된 온 칩 디버깅 유닛 설계)

  • Yun Yeon sang;Ryoo Kwang hyun;Kim Yong dae;Han Seon kyoung;You Young gap
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3A
    • /
    • pp.226-232
    • /
    • 2005
  • An on-chip debugging unit is proposed aiming performance enhancement of JTAG-based SoC systems. The proposed unit comprises a JTAG module and a core breaker. The IEEE 1149.1 standard has been modified and applied to the new JTAG module. The proposed unit eliminates redundant clock cycles included in the TAP command execution stage. TAP execution commands are repeatedly issued to perform debugging of complicated SoC systems. Simulation on the proposed unit shows some 14% performance enhancement and 50% gate count reduction compared to the conventional ones.

Postsolving in interior-point methods (내부점 선형계획법에서의 사후처리)

  • 이상욱;임성묵;성명기;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.89-92
    • /
    • 2003
  • It is often that a large-scale linear programming(LP) problem may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. Presolving or preprocessing is a series of operations which removes the underlying redundancy or detects infeasibility in the given LP problem. It is essential for the speedup of an LP system solving large-scale problems to implement presolving techniques. For the recovery of an optimal solution for the original problem from an optimal solution for the presolved problem, a special procedure, so called postsolving, must be applied. In this paper, we present how a postsolving procedure is constructed and implemented in LPABO, a interior-point based LP system. Briefly, all presolving processes are logged in a data structure in LPABO, and after the end of the solution method an optimal solution for the original problem is obtained by tracing the logs. In each stage of the postsolving procedure, the optimality of intermediate solutions is maintained. We tested our postsolving procedure on Netlib, Gondzio and Kennington LP data sets, and concluded that the computational burden of the procedure is relatively negligible compared with the total solving time.

  • PDF

High Utility Itemset Mining over Uncertain Datasets Based on a Quantum Genetic Algorithm

  • Wang, Ju;Liu, Fuxian;Jin, Chunjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3606-3629
    • /
    • 2018
  • The discovered high potential utility itemsets (HPUIs) have significant influence on a variety of areas, such as retail marketing, web click analysis, and biological gene analysis. Thus, in this paper, we propose an algorithm called HPUIM-QGA (Mining high potential utility itemsets based on a quantum genetic algorithm) to mine HPUIs over uncertain datasets based on a quantum genetic algorithm (QGA). The proposed algorithm not only can handle the problem of the non-downward closure property by developing an upper bound of the potential utility (UBPU) (which prunes the unpromising itemsets in the early stage) but can also handle the problem of combinatorial explosion by introducing a QGA, which finds optimal solutions quickly and needs to set only very few parameters. Furthermore, a pruning strategy has been designed to avoid the meaningless and redundant itemsets that are generated in the evolution process of the QGA. As proof of the HPUIM-QGA, a substantial number of experiments are performed on the runtime, memory usage, analysis of the discovered itemsets and the convergence on real-life and synthetic datasets. The results show that our proposed algorithm is reasonable and acceptable for mining meaningful HPUIs from uncertain datasets.

Speech emotion recognition based on genetic algorithm-decision tree fusion of deep and acoustic features

  • Sun, Linhui;Li, Qiu;Fu, Sheng;Li, Pingan
    • ETRI Journal
    • /
    • v.44 no.3
    • /
    • pp.462-475
    • /
    • 2022
  • Although researchers have proposed numerous techniques for speech emotion recognition, its performance remains unsatisfactory in many application scenarios. In this study, we propose a speech emotion recognition model based on a genetic algorithm (GA)-decision tree (DT) fusion of deep and acoustic features. To more comprehensively express speech emotional information, first, frame-level deep and acoustic features are extracted from a speech signal. Next, five kinds of statistic variables of these features are calculated to obtain utterance-level features. The Fisher feature selection criterion is employed to select high-performance features, removing redundant information. In the feature fusion stage, the GA is is used to adaptively search for the best feature fusion weight. Finally, using the fused feature, the proposed speech emotion recognition model based on a DT support vector machine model is realized. Experimental results on the Berlin speech emotion database and the Chinese emotion speech database indicate that the proposed model outperforms an average weight fusion method.

Development of System-Wide Functional Analysis Platform for Pathogenicity Genes in Magnaporthe oryzae

  • Park, Sook-Young;Choi, Jaehyuk;Choi, Jaeyoung;Kim, Seongbeom;Jeon, Jongbum;Kwon, Seomun;Lee, Dayoung;Huh, Aram;Shin, Miho;Jung, Kyungyoung;Jeon, Junhyun;Kang, Chang Hyun;Kang, Seogchan;Lee, Yong-Hwan
    • 한국균학회소식:학술대회논문집
    • /
    • 2014.10a
    • /
    • pp.9-9
    • /
    • 2014
  • Null mutants generated by targeted gene replacement are frequently used to reveal function of the genes in fungi. However, targeted gene deletions may be difficult to obtain or it may not be applicable, such as in the case of redundant or lethal genes. Constitutive expression system could be an alternative to avoid these difficulties and to provide new platform in fungal functional genomics research. Here we developed a novel platform for functional analysis genes in Magnaporthe oryzae by constitutive expression under a strong promoter. Employing a binary vector (pGOF1), carrying $EF1{\beta}$ promoter, we generated a total of 4,432 transformants by Agrobacterium tumefaciens-mediated transformation. We have analyzed a subset of 54 transformants that have the vector inserted in the promoter region of individual genes, at distances ranging from 44 to 1,479 bp. These transformants showed increased transcript levels of the genes that are found immediately adjacent to the vector, compared to those of wild type. Ten transformants showed higher levels of expression relative to the wild type not only in mycelial stage but also during infection-related development. Two transformants that T-DNA was inserted in the promotor regions of putative lethal genes, MoRPT4 and MoDBP5, showed decreased conidiation and pathogenicity, respectively. We also characterized two transformants that T-DNA was inserted in functionally redundant genes encoding alpha-glucosidase and alpha-mannosidase. These transformants also showed decreased mycelial growth and pathogenicity, implying successful application of this platform in functional analysis of the genes. Our data also demonstrated that comparative phenotypic analysis under over-expression and suppression of gene expression could prove a highly efficient system for functional analysis of the genes. Our over-expressed transformants library would be a valuable resource for functional characterization of the redundant or lethal genes in M. oryzae and this system may be applicable in other fungi.

  • PDF

Hardware Design of High Performance CAVLC Encoder (H.264/AVC를 위한 고성능 CAVLC 부호화기 하드웨어 설계)

  • Lee, Yang-Bok;Ryoo, Kwang-Ki
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.3
    • /
    • pp.21-29
    • /
    • 2012
  • This paper presents optimized searching technique to improve the performance of H.264/AVC. By using the proposed forward and backward searching algorithm, redundant cycles of latency for data reordering can be removed. Furthermore, in order to reduce the total number of execution cycles of CAVLC encoder, early termination mode and two stage pipelined architecture are proposed. The experimental result shows that the proposed architecture needs only 36.0 cycles on average for each $16{\times}16$ macroblock encoding. The proposed architecture improves the performance by 57.8% than that of previous designs. The proposed CAVLC encoder was implemented using Verilog HDL and synthesized with Magnachip $0.18{\mu}m$ standard cell library. The synthesis result shows that the gate count is about 17K with 125Mhz clock frequency.

GoF design patterns based object-oriented Total Maximum Daily Load software design (GoF 디자인 패턴기반 객체지향 오염총량제 소프트웨어 설계)

  • Kim Hyung-Moo;Kwak Hoon-Seong
    • The KIPS Transactions:PartD
    • /
    • v.12D no.1 s.97
    • /
    • pp.73-80
    • /
    • 2005
  • The purpose of using CBD in the object-oriented modeling is to improve the software capability by reducing iterative time and space complexity. Despites many achievements of CBD, it is needed to study about design patterns and it's standardization for the increment of CBD design reusability. However, it is rather possible that impetuous constructing meta-pattern languages and pattern repositories make adapting patterns to software development more complicate and difficult. By applying GoF design patterns to the design of the TMDL(Total Maximum Daily Load) environmental software discipline, this study suggests a method which specifies Pattern names at class names for retrieving, exploring the adapted patterns on the stage of software design without meta-pattern language which is a redundant abstraction, nor additional pattern repositories. Thus, this study can contribute on the reducing iterations and repetitions that are frequently occurred in the process of the environmental software developments.

Design Edrcation of Elementary School in the Unite States-Design Principles, Color, and Design Related Area- (미술 교과서에 나타난 미국 초등학교 디자인 교육에 관한 고찰-조형 원리, 색채 및 분야별 디자인 교육을 중심으로-)

  • 박은덕
    • Archives of design research
    • /
    • v.14
    • /
    • pp.43-51
    • /
    • 1996
  • To analyze the design education of elementary school in the united states, the content of Discover art, one of the popular art textbooks for elementary school student, has been examined. Focusing on the developmental stage and sequential curriculum across all grades, design principles, color and criteria of design are investigated. The subjects studied are as follows: an introduction of new word or concept of design principles and color, repetition of the learning, the number of color taught, looking at products of design and making design at each grade level. The curriculum of design principles is well composed, but line, shape and form parts are redundant throughout all grades. The learning order of the color at one grade is well organized but the repetition is too much. The portion of design part is too small. It is adequate that the history of design is introduced at grade 5 where children start to learn history. However, it should be more strengthened for the continuous development of design ability. Looking at product design is introduced before grade 4, and making product design is taught just once at grade 4, although sequential learning is necessary in late elementary grades.

  • PDF

Efficient Optimization Method for Polynomial Selection (다항식 선택을 위한 효율적인 최적화 기법)

  • Kim, Suhri;Kwon, Heetaek;Lee, Yongseong;Chang, Nam Su;Yoon, Kisoon;Kim, Chang Han;Park, Young-Ho;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.3
    • /
    • pp.631-643
    • /
    • 2016
  • Currently, General Number Field Sieve(GNFS) is known as the most efficient way for factoring large numbers. CADO-NFS is an open software based on GNFS, that was used to factor RSA-704. Polynomial selection in CADO-NFS can be divided into two stages - polynomial selection, and optimization of selected polynomial. However, optimization of selected polynomial in CADO-NFS is an immense procedure which takes 90% of time in total polynomial selection. In this paper, we introduce modification of optimization stage in CADO-NFS. We implemented precomputation table and modified optimization algorithm to reduce redundant calculation for faster optimization. As a result, we select same polynomial as CADO-NFS, with approximately 40% decrease in time.