• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.451-460
• /
• 2012

Natural disasters often lead to regional failures that can cause network nodes and links co-located in a large geographical area to fail. Novel approaches are required to assess the network vulnerability under such regional failures. In this paper, we investigate the vulnerability of networks by considering the geometric properties of regional failures and network nodes. To evaluate the criticality of node locations and determine the critical areas in a network, we propose the concept of ${\alpha}$-critical-distance with a given failure impact ratio ${\alpha}$, and we formulate two optimization problems based on the concept. By analyzing the geometric properties of the problems, we show that although finding critical nodes or links in a pure graph is a NP-complete problem, the problem of finding critical areas has polynomial time complexity. We propose two algorithms to deal with these problems and analyze their time complexities. Using real city-level Internet topology data, we conducted experiments to compute the ${\alpha}$-critical-distances for different networks. The computational results demonstrate the differences in vulnerability of different networks. The results also indicate that the critical area of a network can be estimated by limiting failure centers on the locations of network nodes. Additionally, we find that with the same impact ratio ${\alpha}$, the topologies examined have larger ${\alpha}$-critical-distances when the network performance is measured using the giant component size instead of the other two metrics. Similar results are obtained when the network performance is measured using the average two terminal reliability and the network efficiency, although computation of the former entails less time complexity than that of the latter.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.75-80
• /
• 2004

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

• Journal of Biomedical Engineering Research
• /
• v.23 no.6
• /
• pp.419-430
• /
• 2002

In this paper. we propose an efficient method for implementing hi-directional pixel-based focusing(BiPBF) based on a sparse array imaging technique. The proposed method can improve spatial resolution and frame rate of ultrasound imaging with reduced hardware complexity by synthesizing transmit apertures with a small number of sparsely distributed subapertures. As the distance between adjacent subapertures increases, however. the image resolution tends to decrease due to the elevation of grating lobes. Such grating lobes can be eliminated in conventional synthetic aperture imaging techniques. On the contrary, grating lobes arisen from employing sparse synthetic transmit apertures can not be eliminated, which has been shown analytically in this paper. We also propose the condition and method for suppressing the grating lobes below -40dB, which is generally required in practical imaging. by placing the transmit focal depth at a near depth and properly selecting the subaperture distance in Proportion to receive aperture size. The results of both the Phantom and in vivo experiments show that the proposed method implements two-wav dynamic focusing using a smaller number of subapertures, resulting in reduced system complexity and increased frame rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5381-5399
• /
• 2016

Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

• The Korean Journal of Malacology
• /
• v.31 no.4
• /
• pp.257-262
• /
• 2015

The seven selected primers BION-13, BION-29, BION-61, BION-64, BION-68, BION-72 and BION-80 generated the total number of loci, average number of loci per lane and specific loci in Meretrix lusoria (ML), Saxidomus purpuratus (SP) and Cyclina sinensis (CS) species. Here, the complexity of the banding patterns varied dramatically between the primers from the three venerid clam species. The higher fragment sizes (> 1,000 bp) are much more observed in the SP species. The primer BION-68 generated 21 unique loci to each species, which were ascertaining each species, approximately 150 bp, 300 bp and 450 bp, in the ML species. Remarkably, the primer BION-80 detected 7 shared loci by the three clam species, major and/or minor fragments of sizes 500 bp, which were matching in all samples. As regards average bandsharing value (BS) results, individuals from CS clam species (0.754) exhibited higher bandsharing values than did individuals from SP clam species (0.607) (P < 0.05). In this study, the dendrogram obtained by the seven oligonucleotides primers indicates three genetic clusters: cluster 1 (LUSORIA01-LUSORIA07), cluster 2 (PURPURATUS08-PURPURATUS14), cluster 3 (SINENSIS15-SINENSIS21). Among the twenty one venerid clams, the shortest genetic distance that displayed significant molecular differences was between individuals 18 and 20 from the CS species (genetic distance = 0.071), while the longest genetic distance among the twenty-one individuals that displayed significant molecular differences was between individuals LUSORIA no. 02 and PURPURATUS no. 09 (genetic distance = 0.778). Relatively, individuals of SP venerid species were appropriately closely related to that of CS species, as shown in the hierarchical dendrogram of genetic distances. Eventually, PCR fragments exposed in the present study may be worthwhile as a DNA marker the three venerid clam species to discriminate.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.479-490
• /
• 2009

A number of temporal abstraction approaches have been suggested so far to handle the high computational complexity of Markov decision problems (MDPs). Although the structure of temporal abstraction can significantly affect the efficiency of solving the MDP, to our knowledge none of current temporal abstraction approaches explicitly consider the relationship between topology and efficiency. In this paper, we first show that a topological measurement from complex network literature, mean geodesic distance, can reflect the efficiency of solving MDP. Based on this, we build an incremental method to systematically build temporal abstractions using a network model that guarantees a small mean geodesic distance. We test our algorithm on a realistic 3D game environment, and experimental results show that our model has subpolynomial growth of mean geodesic distance according to problem size, which enables efficient solving of resulting MDP.

• Journal of Aquaculture
• /
• v.19 no.2
• /
• pp.67-76
• /
• 2006

Genomic DNA isolated from two Porphyra species, P. tenera and P. dentate from Wando located on the southern coast of Korean peninsula was amplified by PCR reaction. The amplified products were separated by agarose gel electrophoresis (AGE) with decamer primer and stained with ethidium bromide. The eight arbitrarily selected primers OPA-04, OPA-06, OPB-01, OPB-08, OPB-10, OPB-11, OPB-14 and OPC-10 generated the shared loci, polymorphic, and specific loci. The size of DNA bands varies from 100 bp to 2,200 bp. The complexity of the banding patterns varies dramatically between the primers and two Porphyra species. A total of 528 loci observed were identified in P. tenera and 443 in P. dentata: 22 polymorphic loci (4.2%) in P. tenera and 30 (6.8%) in P. dentata. 154 shared loci observed, the average 19.3 per primer, were identified in P. tenera and 143 loci, the aver-age 17.9 per primer, in P. dentata species. The number of specific loci in P. tenera and P. dentata was 73 and 77, respectively. The average bandsharing value was $0.623{\pm}0.008$ with P. tenera and $0.560{\pm}0.009$ within P. dentata. The average bandsharing value between two Porphyra species was $0.408{\pm}0.004$, ranged from 0.305 to 0.564. The dendrogram obtained by the eight primers indicates four genetic clusters. The genetic distance between two Porphyra species ranged from 0.076 to 0.627. The individual no. 02 of P. tenera was genetically closely related to no. 01 of P. tenera(genetic distance=0.082). Especially, two entities between the individual DENTATA no.21 and DENTATA no. 19 of P. dentata showed the longest genetic distance (0.627) in comparison with other individuals used. In this study, RAPD-PCR analysis has revealed the significant genetic distance between two Porphyra species pairs (P<0.001).

• Journal of Broadcast Engineering
• /
• v.8 no.4
• /
• pp.481-491
• /
• 2003

We present a near-optimal blind decision feedback equalizer (DFE) for Advanced Television Systems Committee digital television (DTV) receivers. By adopting a modified trellis decoder (MTD) with trace back depth of 1 for the decision device In the DFE, we obtain a hardware-efficient near-optimal blind DFE approaching to the optimal DFE which has no error propagation. The MTD uses absolute distance instead of Euclidean distance for computation of a path metric, resulting. In reduced computational complexity. Comparing to the conventional slicer, the MTD shows outstanding performance improvement of decision error probability and is comparable to the original trellis decoder using Euclidean distance. Reducing error propagation in the DFE leads to the improvement of convergence performance in terms of convergence speed and residual error. Simulation results show that the proposed blind DFE performs much better than the blind DFE with the slicer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.253-270
• /
• 2013

To achieve accurate localization information, complex algorithms that have high computational complexity are usually implemented. In addition, many of these algorithms have been developed to overcome several limitations, e.g., obstruction interference in multi-path and non-line-of-sight (NLOS) environments. However, localization systems those have complex design experience latency when operating multiple mobile nodes occupying various channels and try to compensate for inaccurate distance values. To operate multiple mobile nodes concurrently, we propose a localization system with both low complexity and high accuracy and that is based on a chirp spread spectrum (CSS) radio. The proposed localization system is composed of accurate ranging values that are analyzed by simple linear regression that utilizes a Big-$O(n^2)$ of only a few data points and an algorithm with a self-calibration feature. The performance of the proposed localization system is verified by means of actual experiments. The results show a mean error of about 1 m and multiple mobile node operation in a $100{\times}35m^2$ environment under NLOS condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.685-690
• /
• 1994

A problem associated with vector quantization(VQ) is the computational complexity incurred in searching for a codevector with the closet to a given input vector, where the complexity increases exponentionally with proportion to codebook size and then limits practical application. In this paper, a simple and fast, but efficient, VQ encoding algorithm is presented using a reference codevector as start codevector of premature exit condition, which eliminates distance claculation of unlikely codevectors. The algorithm is to find reference codevector having the possibility to be the nearest vector to input vector first and then to incorporate premature exit condition. The proposed algorithm needs only 10~15% of mathematical operations compared with the conventional full search VQ. Algorithm the number of additions and comparsions of the proposed algorithm is not reduced greatly, the number of multiplication is reduced up to 70~80% compared with other fast VQ encoding methods.