• The Korean Journal of Applied Statistics
• /
• v.21 no.5
• /
• pp.813-823
• /
• 2008

The non-homogeneous Poisson process(NHPP) based software reliability growth models are proved quite successful in practical software reliability engineering. The fault detection rate is usually assumed to be the continuous and monotonic function. However, the fault detection rate can be affected by many factors such as the testing strategy, running environment and resource allocation. This paper describes a parameter estimation of software reliability growth model with change-point problem. We obtain the maximum likelihood estimate(MLE) and least square estimate(LSE), and compare goodness-of-fit.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.149-155
• /
• 2013

Commonly, one seeks a particular pattern suitable for stock cutting and the number of such patterns through linear programming. However, since the number of the patterns increases exponentially, it is nearly impossible to predetermine all the existing patterns beforehand. This paper thus proposes an algorithm whereby one could accurately predetermine the number of existing patterns by applying Suliman's feasible pattern method. Additionally, this paper suggests a methodology by which one may obtain exact polynomial-time solutions for feasible patterns without applying linear programming or approximate algorithm. The suggested methodology categorizes the feasible patterns by whether the frequency of first occurrence of all the demands is distributed in 0 loss or in various losses. When applied to 2 data sets, the proposes algorithm is found to be successful in obtaining the optimal solutions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.257-263
• /
• 2002

A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$＋1)/2, 2$^{N3}$＋2. [3.2$^{N4}$＋1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.10
• /
• pp.580-587
• /
• 2017

Recently, as the education population of Korea has been rapidly declining, many changes have been taking place in the university environment. Especially, community colleges linked to local communities have responded to these crises through various educational changes, such as three-year study transfers, work-parallelism, and employee commissioned education. However, such changes in the contents of education are causing a new type of classroom allocation problem, in which it is difficult to assign the limited number of classrooms to the major courses. In this paper, we classified the constraints involved in assigning classrooms into absolute constraints and relative constraints, mathematically modeled them, and allocated the classrooms optimally through optimization software. The results were satisfactory and enabled us to obtain superior results in terms of the various performance indices (classroom utilization rate, teacher satisfaction, etc.) than when assigning classrooms in the normal way.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.48-58
• /
• 2002

As internet traffic increases, the problem that it should be efficiently accepted in to the existing voice network in the pending problem importantly to the existing communication corporations. The feature of next generation exchange network is made up of the form of integration network that connect data traffic(internet service. Etc) with the existing voice network and it can be showed with very diverse aspects according to the constitution time of network or the characteristics of business. The progress strategy that develop the existing circuit based communication network into packet-based communication network can be divided into two in a large scale according to the application position These are VoDSL application method(Technology that packetize access network) and softswitch technology application method(after packetizing relay network, packetizing that into the access network). In this paper, we will deduce the desirable technology that can construct packet-based next generation exchange networks in the structure of the existing communication network environment. We will perform the research on a device to offer the necessary core technique VoSDL service with realistic resolutions primarily.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.153-160
• /
• 2003

Recently, deployments of firewalls and NATs ire increasing to provide network security features or to solve the problem of public IP shortage. But, in these environments, peers in different firewall or NAT environments may get limited services because they cannot open direct communicate channels. This can be a significant problem in pure P2P environments where the peers should get or provide services by opening direct channels among themselves. In this paper, we propose a scheme for dynamically selecting a peer that fan be used as a proxy server. The proxy server supports the communication between the peers in different firewall or NAT environments. The proposed scheme is operating system independent and supports bidirectional communication among the peers in P2P environments. Additionally, the proposed scheme can distribute network traffic by dynamically allocating proxy servers to the peers that is not located in the firewall or NAT environments.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.266-276
• /
• 2011

In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.645-650
• /
• 2006

GSM(Global System for Mobile communications) provides mobile users with portability and convenience as the most popular standard for mobile phones in the world. However, GSM system has the problem that can't normally authenticate a user by the exposure of IMSI(International Mobile Subscriber Identity) of Ms(Mobile station) during the user authentication procedure. In this paper, we propose secure user authentication by preventing the exposure if IMSI via transfer the encrypted IMSI from the HLR(Home Location Register) and making the only network entities verified from the HLR use the IMSI value, as the modified mechanism based on the original user authentication protocol to solve this authentication problem. Also the proposed mechanism provides fast user authentication without changing the architecture between new VLR and old VLR in the original GSM user authentication protocol as well as user's anonymity by using a temporary ID.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.664-677
• /
• 2011

In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1098-1105
• /
• 1999

The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.