• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.52-67
• /
• 2011

Network coding is a newly developed technology that can cause considerable improvements in network throughput. COPE is the first network coding approach for wireless mesh networks and it is based on opportunistic Wireless Network Coding (WNC). It significantly improves throughput of multi-hop wireless networks utilizing network coding and broadcast features of wireless medium. In this paper we propose a new method, called FENC, for opportunistic WNC that improves the network throughput. In addition, its complexity is lower than other opportunistic WNC approaches. FENC utilizes division and conquer method to find an optimal network coding. The numerical results show that the proposed opportunistic algorithm improves the overall throughput as well as network coding approach.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.451-458
• /
• 1999

This paper considers the problem of routing connections in multi-optical tree network using WDM (Wavelength Division Multiplexing), where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths. The problem of optimal colouring of paths on multi-optical network is NP-hard[1], but if that is the colouring of all paths, then there exists an efficient polynomial time algorithm. In this paper, using divided & conquer method we gave an efficient algorithm to assign wavelengths to the all paths of a tree network based on the theory of (7) and our time complexity $O(n^4log\; n)$.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.322-329
• /
• 2000

BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.194-197
• /
• 2002

This paper considers the problem of routing connections in a optical multi tree networks using WDM (Wavelength Division Multiplexing), where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, so that connections whose paths share a common link in the network are assigned different wavelengths. The problem of optimal coloring of the paths on the optical multi-networks is NP-hard[1], but if that is the coloring of all paths, then there exists efficient polynomial time algorithm. In this paper, using a "divide & conquer" method, we give efficient algorithm to assign wavelengths to all the paths of a tree network based on the theory of [7]. Here, our time complexity is 0(n4log n).

• Journal of Yeungnam Medical Science
• /
• v.37 no.4
• /
• pp.286-295
• /
• 2020

Respiratory infections are very common and highly contagious. Respiratory infectious diseases affect not only the person infected but also the family members and the society. As medical sciences advance, several diseases have been conquered; however, the impact of novel infectious diseases on the society is enormous. As the clinical presentation of respiratory infections is similar regardless of the pathogen, the causative agent is not distinguishable by symptoms alone. Moreover, it is difficult to develop a cure because of the various viral mutations. Various respiratory infectious diseases ranging from influenza, which threaten the health of mankind globally, to the coronavirus disease 2019, which resulted in a pandemic, exist. Contrary to human expectations that development in health care and improvement in hygiene will conquer infectious diseases, humankind's health and social systems are threatened by novel infectious diseases. Owing to the development of transport and trading activity, the rate of spread of new infectious diseases is increasing. As respiratory infections can threaten the members of the global community at any time, investigations on preventing the transmission of these diseases as well as development of effective antivirals and vaccines are of utmost importance and require a worldwide effort.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.211-218
• /
• 2015

This paper introduces a 'divide-and-conquer' algorithm to the travelling salesman problem (TSP). Top 10n are selected beforehand from a pool of n(n-1) data which are sorted in the ascending order of each vertex's distance. The proposed algorithm then firstly selects partial paths that are interconnected with the shortest distance $r_1=d\{v_i,v_j\}$ of each vertex $v_i$ and assigns them as individual regions. For $r_2$, it connects all inter-vertex edges within the region and inter-region edges are connected in accordance with the connection rule. Finally for $r_3$, it connects only inter-region edges until one whole Hamiltonian cycle is constructed. When tested on TSP-1(n=26) and TSP-2(n=42) of real cities and on a randomly constructed TSP-3(n=50) of the Euclidean plane, the algorithm has obtained optimal solutions for the first two and an improved one from that of Valenzuela and Jones for the third. In contrast to the brute-force search algorithm which runs in n!, the proposed algorithm runs at most 10n times, with the time complexity of $O(n^2)$.

• BMB Reports
• /
• v.36 no.1
• /
• pp.78-81
• /
• 2003

The prevention of cancer is one of the most important public health and medical practices of the $21^{st}$ century. We have made much progress in this new emerging field, but so much remains to be accomplished before widespread use and practice become common place. Cancer chemoprevention encompasses the concepts of inhibition, reversal, and retardation of the cancer process. This process, called carcinogenesis, requires 20-40 years to reach the endpoint called invasive cancer. It typically follows multiple, diverse and complex pathways in a stochastic process of clonal evolution. These pathways appear amenable to inhibition, reversal or retardation at various points. We must therefore identify key pathways in the evolution of the cancer cell that can be exploited to prevent this carcinogenesis process. Basic research is identifying many genetic lesions and epigenetic processes associated with the progression of precancer to invasive disease. Many of these early precancerous lesions favor cell division over quiescence and protect cells against apoptosis when signals are present. Many oncogenes are active during early development and are reactivated in adulthood by aberrant gene promoting errors. Normal regulatory genes are mutated, making them insensitive to normal regulatory signals. Tumor suppressor genes are deleted or mutated rendering them inactive. Thus there is a wide range of defects in cellular machinery which can lead to evolution of the cancer phenotype. Mistakes may not have to appear in a certain order for cells to progress along the cancer pathway. To conquer this diverse disease, we must attack multiple key pathways at once for a predetermined period of time. Thus, agent combination prevention strategies are essential to decrease cancer morbidity. Furthermore, each cancer type may require custom combination of prevention strategies to be successful.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3952-3963
• /
• 2000

This paper considers the WRA(Wavelength and Houting Assignment) problem on all-optical tree networks using WDM(Wavelength Division Multiplexing). Each link between a pair of request nodes on all optical networks is assigned different wavelengths because of technical constraint. On the basis of this, we give an polynomial time algorithm to assign wavelengths to the all patbs of a arbitrary tree network using divide and conquer method. The time complexity of this algorithm is O(Q. R), in which Q is the request nodes for all to'all communication in a tree topology and U is the maximum number of wavelength. Also we implemented our algorithm using C in Pentium II 233MHz and analyzed performance results.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.12
• /
• pp.3708-3714
• /
• 2009

Recently, most of information services are provided by the computer network, since the technology of computer communication is developing rapidly, and the worth of information over the network is also increasing with expensive cost. But various attacks to quietly intercept the informations is invoked with the technology of communication developed, and then most of the financial agency currently have used OTP, which is generated by a token at a number whenever a user authenticates to a server, rather than general static password for some services. A 2-factor OTP generating method using the OTP token is mostly used by the financial agency. However, the method is vulnerable to real attacks and therefore the OTP token could be robbed and disappeared. In this paper, we propose a 3-factor OTP way using HMAC to conquer the problems and analyze the security of the proposed scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.185-191
• /
• 2022

This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the x_j number of coins exchanged when a given amount of money C is exchanged for c_j,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2ⁿ, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of c_j of n for c_j ≤ C and i rows are placed k excluding all the dividers in c_j. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.