• Journal of Microbiology and Biotechnology
• /
• v.29 no.3
• /
• pp.367-372
• /
• 2019

Deactivation of aminoglycosides by their modifying enzymes, including a number of aminoglycoside O-phosphotransferases, is the most ubiquitous resistance mechanism in aminoglycoside-resistant pathogens. Nonetheless, in a couple of biosynthetic pathways for gentamicins, fortimicins, and istamycins, phosphorylation of aminoglycosides seems to be a unique and initial step for the creation of a natural defensive structural feature such as a 3',4'-dideoxy scaffold. Our aim was to elucidate the biochemical details on the beginning of these C3',4'-dideoxygenation biosynthetic steps for aminoglycosides. The biosynthesis of istamycins must surely involve these 3',4'-didehydroxylation steps, but much less has been reported in terms of characterization of istamycin biosynthetic genes, especially about the phosphotransferase-encoding gene. In the disruption and complementation experiments pointing to a putative gene, istP, in the genome of wild-type Streptomyces tenjimariensis, the function of the istP gene was proved here to be a phosphotransferase. Next, an in-frame deletion of a known phosphotransferase-encoding gene forP from the genome of wild-type Micromonospora olivasterospora resulted in the appearance of a hitherto unidentified fortimicin shunt product, namely 3-O-methyl-FOR-KK1, whereas complementation of forP restored the natural fortimicin metabolite profiles. The bilateral complementation of an istP gene (or forP) in the ${\Delta}forP$ mutant (or ${\Delta}istP$ mutant strain) successfully restored the biosynthesis of 3',4'-dideoxy fortimicins and istamycins, thus clearly indicating that they are interchangeable launchers of the biosynthesis of 3',4'-dideoxy types of 1,4-diaminocyclitol antibiotics.

• Journal of Information Management
• /
• v.41 no.2
• /
• pp.31-46
• /
• 2010

Now named-entity recognition(NER) as a part of information extraction has been used in the fields of information retrieval as well as question-answering systems. Unlike words, named-entities(NEs) are generated and changed steadily in documents on the Web, newspapers, and so on. The NE generation causes an unknown word problem and makes many application systems with NER difficult. In order to alleviate this problem, this paper proposes a new feature generation method for machine learning-based NER. In general features in machine learning-based NER are related with words, but entities in named-entity dictionaries are related to phrases. So the entities are not able to be directly used as features of the NER systems. This paper proposes an encoding scheme as a feature generation method which converts phrase entities into features of word units. Futhermore, due to this scheme, entities with semantic information in WordNet can be converted into features of the NER systems. Through our experiments we have shown that the performance is increased by about 6% of F1 score and the errors is reduced by about 38%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.187-193
• /
• 2015

The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.1-14
• /
• 2017

This paper proposes adaptive reference structure decision method to improve the performance of HEVC (High Efficiency Video Coding) encoder. When an event occurs in the input sequence, such as scene change, scene rotation, fade in/out, or light on/off, the proposed algorithm changes the reference structure to improve the inter prediction performance. The proposed algorithm divides GOP (Group Of Pictures) into two sub-groups based on the picture that has such event and decides the reference pictures in the divided sub-groups. Also, this paper proposes fast encoding method which changes the picture type of first encoded picture in the GOP that has such event to CRA (Clean Random Access). With the statistical feature that intra prediction is selected by high probability for the first encoded picture in the GOP carrying such event, the proposed fast encoding method does not operate inter prediction. The experimental result shows that the proposed adaptive reference structure decision method improves the BD-rate 0.3% and reduces encoding time 4.9% on average under the CTC (Common Test Condition) for standardization. In addition, the proposed reference structure decision method with the picture type change reduces the average encoding time 12.2% with 0.11% BD-rate loss.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.129-136
• /
• 2011

This paper presents the coding method that have multi-mode and efficiency of audio codecs using the feature of audio signal. Recently, the developed extension super-wideband codec based on G.718 wideband divides two mode between Generic and Sinusiodal. So codec efficently encode audio signal exist in super-wideband. But the codec is not as efficent coding for harmonic component of wind instrument and string instrument and individual-Line component of percussion instrument. The proposed method are modeling and encoding multiple pitch and individual-line feature using multi mode coding. For the performance evaluation, we used SNR in MDCT domain for objective test and MUSHRA test for subjective test. As a result, the performance of SNR and MUSHRA test of the proposed method have better performance than the G.718 super-wideband codec.

• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.49-56
• /
• 2023

Machine learning methods diversely applied to the Internet of Things (IoT) field have been successful due to the enhancement of computer processing power. They offer an effective way of detecting malicious intrusions in IoT because of their high-level feature extraction capabilities. In this paper, we proposed a novel feature selection method for malicious intrusion detection in IoT by using an evolutionary technique - Genetic Algorithm (GA) and Machine Learning (ML) algorithms. The proposed model is performing the classification of BoT-IoT dataset to evaluate its quality through the training and testing with classifiers. The data is reduced and several preprocessing steps are applied such as: unnecessary information removal, null value checking, label encoding, standard scaling and data balancing. GA has applied over the preprocessed data, to select the most relevant features and maintain model optimization. The selected features from GA are given to ML classifiers such as Logistic Regression (LR) and Support Vector Machine (SVM) and the results are evaluated using performance evaluation measures including recall, precision and f1-score. Two sets of experiments are conducted, and it is concluded that hyperparameter tuning has a significant consequence on the performance of both ML classifiers. Overall, SVM still remained the best model in both cases and overall results increased.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.143-146
• /
• 2000

Motion Estimation/compensation(ME/MC) is one of the efficient interframe ceding techniques for its ability to reduce the high redundancy between successive frames of an image sequence. Calculating the blocking matching takes most of the encoding time. In this paper a new fast block matching algorithm(BMA) is developed for motion estimation and for reduction of the computation time to search motion vectors. The feature of the new algorithm comes from the center-biased checking concept and the trend of pixel movements. At first, Motion Vector(MV) is searched in ${\pm}$1 of search area and then the motion estimation is exploited in the rest block. The ASP and MSE of the proposed search algorithm show good performance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.1-14
• /
• 1997

This study proposes a genetic algorithm using Pr(equation omitted)fer number for the traveling salesman problem(PNGATSP). Nearest neighbor nodes are mixed with randomly selected nodes at the stage of generating initial solutions. Proposed PNGATSP adopts a few ideas which are different from traditional genetic algorithms. For instance, an exponential fitness function and elitism are used and Pr(equation omitted)fer number is used for encoding TSP. Genetic operators are selected by experiments, which make a good solution among four combinations of conventional genetic operators and new genetic operators. For respective combinations, robust set of parameters is determined by the experimental designing approach. The feature of Pr(equation omitted)fer number code for TSP and the search power of GA using Pr(equation omitted)fer number is analysed. The best is a combination of OX(order crossover) and swap, which is superior to the other experimented combinations of genetic operators by 1.0%∼12.8% deviation.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.20 no.1
• /
• pp.28-44
• /
• 2002

Wavelet transformation in image compression is to offer higher image compressibility and high-quality by quantization and entropy encoding. More image quality is good that reconstructed image by wavelet calculation than acquire cosine transform. Therefore, wavelet itself is function if it is wavelet's feature, in this function, do processing applying difference scale and resolution. That is, this is not that fixed resolution has been decided like existent compression way, when it regulated scale, damage goes in pixel and picture looks like break without giving damage entirely in reflex even if magnify or curtail Decoding. Therefore, this paper is in Image that using new wavelet application compression way research that see applies comparing In each image noted this time compressing step by step with circle image compression efficiency recognize. Also, estimated quality pass through by printing of compressed image, investigated compression ratio of most suitable that get print of high quality and elevation of transmission speed.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.631-634
• /
• 1999

In this work, a new algorithm for canceling MRI artifact in the image plane is presented. In the conventional approach, the motions in the X(readout) direction and Y(the phase encoding) direction are estimated simultaneously. However, the feature of each X and Y directional motion is different. First, we notice that the X directional motion corresponds to a shift of the X directional spectrum of the MRI signal, and the non zero area of the spectrum just corresponds to X axis projected area of the density function. So the motion is estimated by tracing the edges of the spectrum, and the X directional motion is canceled by shifting the spectrum in inverse direction. Next, the Y directional motion is canceled using a new constraint, with which the motion component and the true image component can be separated. This algorithm is shown to be effective by simulations.