• Phonetics and Speech Sciences
• /
• v.6 no.4
• /
• pp.127-132
• /
• 2014

This paper describes a robust speech recognition technique by reconstructing spectral components mismatched with a training environment. Although the cluster-based reconstruction method can compensate the unreliable components from reliable components in the same spectral vector by assuming an independent, identically distributed Gaussian-mixture process of training spectral vectors, the presented method exploits the temporal dependency of speech to reconstruct the components by introducing a hidden-Markov-model prior which incorporates an internal state transition plausible for an observed spectral vector sequence. The experimental results indicate that the described method can provide temporally consistent reconstruction and further improve recognition performance on average compared to the conventional method.

• Journal of Information Processing Systems
• /
• v.19 no.3
• /
• pp.377-384
• /
• 2023

The existence of abnormal breakpoint data leads to poor channel balance in wireless sensor networks (WSN). To enhance the communication quality of WSNs, a method for positioning abnormal breakpoint data in WSNs on the basis of signal reconstruction is studied. The WSN signal is collected using compressed sensing theory; the common part of the associated data set is mined by exchanging common information among the cluster head nodes, and the independent parts are updated within each cluster head node. To solve the non-convergence problem in the distributed computing, the approximate term is introduced into the optimization objective function to make the sub-optimization problem strictly convex. And the decompressed sensing signal reconstruction problem is addressed by the alternating direction multiplier method to realize the distributed signal reconstruction of WSNs. Based on the reconstructed WSN signal, the abnormal breakpoint data is located according to the characteristic information of the cross-power spectrum. The proposed method can accurately acquire and reconstruct the signal, reduce the bit error rate during signal transmission, and enhance the communication quality of the experimental object.

• Journal of The Korean Astronomical Society
• /
• v.49 no.4
• /
• pp.157-162
• /
• 2016

High resolution reconstruction technology is developed to help enhance the spatial resolution of observational images for ground-based solar telescopes, such as speckle masking. Near real-time reconstruction performance is achieved on a high performance cluster using the Message Passing Interface (MPI). However, much time is spent in reconstructing solar subimages in such a speckle reconstruction. We design and implement a novel parallel method for speckle masking reconstruction of solar subimage on a shared memory machine using the OpenMP. Real tests are performed to verify the correctness of our codes. We present the details of several parallel reconstruction steps. The parallel implementation between various modules shows a great speed increase as compared to single thread serial implementation, and a speedup of about 2.5 is achieved in one subimage reconstruction. The timing result for reconstructing one subimage with 256×256 pixels shows a clear advantage with greater number of threads. This novel parallel method can be valuable in real-time reconstruction of solar images, especially after porting to a high performance cluster.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.41.1-41.1
• /
• 2017

We present weak-lensing analysis of the merging galaxy cluster Abell 115 at z=0.197 based on Subaru i and V band images. As merging clusters often show, Abell 115's merging signatures include radio relics, double X-ray peaks, and large offsets between the cluster member galaxies and the X-ray distributions. A weak-lensing study provides underlying dark matter distribution, the key information to determine the complex merging scenario of the cluster. In this work, we present 2D mass reconstruction of the cluster, which reveals two distinct mass peaks consistent with galaxy distributions. We measure the first weak-lensing mass of each subcluster. Our weak-lensing total mass estimate is a few factors lower than the published dynamical mass obtained from velocity dispersion. This large mass discrepancy may be attributed to a significant departure from dynamical equilibrium. We also re-analyze the archival chandra data and find that the result is consistent with weak-lensing mass.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.410-421
• /
• 2019

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.1
• /
• pp.51.1-51.1
• /
• 2017

The galaxy cluster Abell 115 shows ongoing merger features, which suggest that it might be in an intermediate phase of dynamical evolution. As merging clusters often show, the characteristic hints of A115's merging activities include radio relics, double X-ray peaks, and large offsets between the cluster member galaxies and the X-ray distributions. To constrain the exact stage of the merger, it is necessary to obtain its dark matter distribution. In this study, we carry out a precision weak lensing study of this interesting system based on Subaru images. We present our mass reconstruction together with descriptions on our core procedure of the analysis: Subaru data reduction, galaxy shape measurement, and source selection. We find that Abell 115 consists of two massive dark matter clumps, which closely follow the cluster galaxies. Our weak lensing mass estimate is a few factors lower than the published dynamical mass obtained from velocity dispersion. This large mass discrepancy may be attributed to a significant departure from dynamical equilibrium.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.8-16
• /
• 2022

In this paper, we propose a method of reconstructing the file system to obtain digital forensics information from the APFS file system when meta information that can know the structure of the file system is deleted due to partial damage to the disk. This method is to reconstruct the tree structure of the file system by only retrieving the B-tree node where file/directory information is stored. This method is not a method of constructing nodes based on structural information such as Container Superblock (NXSB) and Volume Checkpoint Superblock (APSB), and B-tree root and leaf node information. The entire disk cluster is traversed to find scattered B-tree leaf nodes and to gather all the information in the file system to build information. It is a method of reconstructing a tree structure of a file/directory based on refined essential data by removing duplicate data. We demonstrate that the proposed method is valid through the results of applying the proposed method by generating numbers of user files and directories.

• Journal of Microbiology and Biotechnology
• /
• v.18 no.5
• /
• pp.866-873
• /
• 2008

2-Deoxystreptamine is a core aglycon that is vital to backbone formation in various aminoglycosides. This core structure can be modified to develop hybrid types of aminoglycoside antibiotics. We obtained three genes responsible for 2-deoxystreptamine production, neo7, neo6, and neo5, which encode 2-deoxy-scyllo-inosose synthase, L-glutamine: 2-deoxy-scyllo-inosose aminotransferase, and dehydrogenase, respectively, from the neomycin gene cluster. These genes were cloned into pIBR25, a Streptomyces expression vector, resulting in pNDOS. The recombinant pNDOS was transformed into a non-aminoglycoside-producing host, Streptomyces venezuelae YJ003, for heterologous expression. Based on comparisons of the retention time on LC-ESI/MS and ESI-MS data with those of the 2-deoxystreptamine standard, a compound produced by S. venezuelae YJ003/pNDOS was found to be 2-deoxystreptamine.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.199-202
• /
• 2013

In the cluster mechanism of the wireless sensor network, the network lifetime is affected by how cluster heads are selected. One of the representative clustering mechanisms, the low-energy adaptive clustering hierarchy (LEACH), selects cluster heads periodically, resulting in high energy consumption in cluster reconstruction. On the other hand, the adaptive clustering algorithm via waiting timer (ACAWT) proposes a non-periodic re-clustering mechanism that reconstructs clusters if the remaining energy level of a cluster head reaches a given threshold. In this paper, we propose a re-clustering mechanism that uses multiple remaining node energy levels and does re-clustering when the remaining energy level of a cluster head reaches one level lower. Also, in determining cluster heads, both of the number of neighbor nodes and the remaining energy level are considered so that cluster heads can be more evenly placed. From the simulations based on the Qualnet simulator, we validate that our proposed mechanism outperforms ACAWT in terms of the network lifetime.