• Mycobiology
• /
• 제45권4호
• /
• pp.392-400
• /
• 2017

Peanut yield and quality are seriously affected by pod rot pathogens worldwide, especially in China in recent years. The goals of this study are to analyze the structure of fungal communities of peanut pod rot in soil in three peanut cultivars and the correlation of pod rot with environmental variables using 454 pyrosequencing. A total of 46,723 internal transcribed spacer high-quality sequences were obtained and grouped into 1,706 operational taxonomic units at the 97% similarity cut-off level. The coverage, rank abundance, and the Chao 1 and Shannon diversity indices of the operational taxonomic units were analyzed. Members of the phylum Ascomycota were dominant, such as Fusarium, Chaetomium, Alternaria, and Sordariomycetes, followed by Basidiomycota. The results of the heatmap and redundancy analysis revealed significant variation in the composition of the fungal community among the three cultivar samples. The environmental conditions in different peanut cultivars may also influence on the structure of the fungal community. The results of this study suggest that the causal agent of peanut pod rot may be more complex, and cultivars and environmental conditions are both important contributors to the community structure of peanut pod rot fungi.

• 한국CDE학회논문집
• /
• 제1권1호
• /
• pp.1-19
• /
• 1996

Non-manifold topological representations can provide a single unified representation for mixed dimensional models or cellular models and thus have a great potential to be applied in many application areas. Various boundary representations for non-manifold topology have been proposed in recent years. These representations are mainly interested in describing the sufficient adjacency relationships and too redundant as a result. A model stored in these representations occupies too much storage space and is hard to be manipulated. In this paper, we proposed a compact hierarchical non-manifold boundary representation that is extended from the half-edge data structure for solid models by introducing the partial topological entities to represent some non-manifold conditions around a vertex, edge or face. This representation allows to reduce the redundancy of the existing schemes while full topological adjacencies are still derived without the loss of efficiency. To verify the statement above, the storage size requirement of the representation is compared with other existing representations and present some main procedures for querying and traversing the representation. We have also implemented a set of the generalized Euler operators that satisfy the Euler-Poincare formula for non-manifold geometric models.

• BMB Reports
• /
• 제40권2호
• /
• pp.172-179
• /
• 2007

PCR-mediated recombination describes the process of in vitro chimera formation from related template sequences present in a single PCR amplification. The high levels of genetic redundancy in eukaryotic genomes should make recombination artifacts occur readily. However, few evolutionary biologists adequately consider this phenomenon when studying gene lineages. The cytosolic glyceraldehyde-3-phosphate dehydrogenase gene (GapC), which encodes a NADP-dependent nonphosphorylating glyceraldehyde-3-phosphate dehydrogenase in the cytosol, is a classical lowcopy nuclear gene marker and is commonly used in molecular evolutionary studies. Here, we report on the occurrence of PCR-mediated recombination in the GapC gene family of Hibiscus tiliaceus. The study suggests that recombinant areas appear to be correlated with DNA template secondary structures. Our observations highlight that recombination artifacts should be considered when studying specific and allelic phylogenies. The authors suggest that nested PCR be used to suppress PCRmediated recombination.

• 디지털산업정보학회논문지
• /
• 제11권3호
• /
• pp.31-43
• /
• 2015

In this paper, we discuss a code generation technique for custom transport triggered architecture (TTA) from a high-level language structure. This methodology is implemented by using TTA-based Co-design Environment (TCE) tool. The results show how the scheduler exploits instruction level parallelism in the custom target architecture and source program. Thus, the scheduler generates parallel TTA instructions using lower cycle counts than the sequential scheduling algorithm. Moreover, we take Tensilica tool to make a comparison with TCE. Because of the efficiency of TTA, TCE takes less execution cycles compared to Tensilica configurations. Finally, this paper shows that it requires only 7 cycles to generate the parallel TTA instruction set for implementing Cyclic Redundancy Check (CRC) applications as an input design, and presents the code generation technique to move complexity from the processor software to hardware architecture. This method can be applicable lots of channel Codecs like CRC and source Codecs like High Efficiency Video Coding (HEVC).

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.1037-1041
• /
• 2007

With the advent of sound field simulator, many sound fields have been reproduced by obtaining the impulse responses of specific acoustic spaces like famous concert hall, opera house. This sound field reproduction has been done by the linear convolution operation between the sound input signal and the impulse response of certain acoustic space. However, the conventional finite impulse response based linear convolution operation always makes real-time implementation of sound field generator impossible due to the large amount of computational burden. This paper introduces the fast convolution method using perceptual redundancy in the processed signals, input audio signal and room impulse response. Temporal and spectral psycho-acoustic filters considering masking effects are implemented in the proposed convolution structure. It reduces the computational burden of convolution methods for realtime implementation of a sound field generator. The conventional convolutions are compared with the proposed one in views of computational burden and sound quality. In the proposed method, a considerable reduction in the computational burden was realized with acceptable changes in sound quality.

• 한국정밀공학회지
• /
• 제16권1호통권94호
• /
• pp.211-218
• /
• 1999

The traditional robot manipulators are actuated by continuous range of motion actuators such as motors or hydraulic cylinders. However, there are many applications of mechanisms and robotic manipulators where only a finite number of locations need to be reached, and the robot’s trajectory is not important as long as it is bounded. Binary manipulator uses actuators which have only two stable states. As a result, binary manipulators have a finite number of states. The number of states of a binary manipulator grows exponentially with the number of actuators. This kind of robot manipulator has some advantage compared to a traditional one. Feedback control is not required, task repeatability can be very high, and finite state actuators are generally inexpensive. And this kind of robot manipulator has a fault tolerant mechanism because of kinematic redundancy. In this paper, we solve the inverse kinematic problem of a binary parallel robot manipulator using neural network and test the validity of this structure using some arbitrary points m the workspace of the robot manipulator. As a result, we can show that the neural network can find the nearest feasible points and corresponding binary states of the joints of the robot manipulator

• 한국통신학회논문지
• /
• 제24권10B호
• /
• pp.1912-1920
• /
• 1999

본 논문에서는 이종 환경에서 효과적으로 사용할 수 있도록 다중 계층형 비트열을 생성할 수 있는 계층형 동영상 부호화 방식을 제안한다. 제안하는 부호화 기법에서는 시축 해상도의 확장성(scalability)을 지원하기 위해 시축 계층구조에서 새로운 움직임 추정 구조를 가지도록 하고, 웨이브릿 분할을 이용하여 공간 확장성까지도 지원하도록 한다. 움직임 추정과 보상을 사용하여 시축 중복성을 더욱 줄여 조건 갱신 방식보다 압축률을 향상시킬 뿐만 아니라‘분산 부대역 인트라 갱신’기법을 사용하여 동적 적응이나 에러에 대해서도 효과적으로 동작할 수 있다. 또한 EZW (embedded zerotree wavelet) 기법을 사용하여 임베디드 비트열을 생성함으로써 추후에 데이터율 확장성을 쉽게 얻을 수 있도록 하였다. 따라서 제안하는 부호화 기법은 인터넷이나 ATM, 무선망과 같이 상호 운용과 확장성을 필요로 하는 네트웍 상에서 매우 효과적으로 사용될 수 있을 것이다.

• Journal of information and communication convergence engineering
• /
• 제9권5호
• /
• pp.615-618
• /
• 2011

Living cells generate the cell cycle or apoptosis, depending on the course will be repeated. If an error occurs during this period of life in order to maintain the cells in the peripheral cells find the error portion. These cellular functions were applied to the system to simulate the circuit. Circuit implementation of the present study was constructed the redundant structure in order to found the error quickly. Self-repairing of digital systems as an advanced form of fault-tolerance has been increasingly receiving attention according as digital systems have been more and more complex and speed-up especially for urgent systems or those working on extreme environments such as deep sea and outer space. Simulating the process of cell differentiation algorithm was confirmed by the FPGA on the counter circuit. If an error occurs on the circuit where the error was quickly locate and repair. In this paper, we propose a novel self-repair architecture for fast and robust fault-recovery that can easily apply to real, complex digital systems. These Self-Repairing Algorithms make it possible for the application digital systems to be alive even though in very noisy and extreme environments.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• 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.

• 대한기계학회논문집A
• /
• 제32권3호
• /
• pp.232-239
• /
• 2008

The position sensors used in a magnetic bearing system are desirable to provide some degree of fault-tolerance as the rotor position is necessary for the feedback control to overcome the open-loop instability. In this paper, we propose an inductive position sensor that can cope with a partial fault in the sensor. The sensor has multiple poles which can be combined to sense the in-plane motion of the rotor. When a high-frequency voltage signal drives each pole of the sensor, the resulting current in the sensor coil contains information regarding the rotor position. The signal processing circuit of the sensor extracts this position information. In this paper, we used the magnetic circuit model of the sensor that shows the analytical relationship between the sensor output and the rotor motion. The multi-polar structure of the sensor makes it possible to introduce redundancy which can be exploited for fault-tolerant operation. The proposed sensor is applied to a magnetically levitated turbo-molecular vacuum pump. Experimental results validate the fault-tolerance algorithm.