• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.23-32
• /
• 1999

Reliability and maintainability allocation in the analysis of the system's design, with the objective of planning and installing the individual components in such a way that the system performance is achieved. This paper has been made to solve an important task in reliability management of manufacturing systems within the general objective being to increase productivity while maintaining costs low. Thus, the purpose of this paper is to provide an analytical approach to determine an optimal reliability and maintainability allocation, trading off among system performance and parts investment costs. Two important considerations will be addressed in this regard : (ⅰ) determine the reliability and maintainability allocation of parts which maximizes a given production index, having fixed the total cost of investments ; and (ⅱ) determine the reliability and maintainability allocation which minimizes the total cost of investments, having fixed a minimum acceptable level of productivity. The procedure proposed in this paper is able to provide to managers and designers useful indications on the reliability and maintainability characteristics of parts in series -parallel systems. And this heuristic model is a decision support tool for contractors who are involved in large scale design projects such as ship and aircraft design. Numerical examples prove that an approximate expression of the average throughput rate is sufficiently accurate to be used in a numerical optimization method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1681-1693
• /
• 1997

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.6
• /
• pp.477-487
• /
• 2005

As embedded system grows in size and complexity, the importance of the technique for dynamic memory allocation has increased. The objective of this paper is to measure the performance of dynamic memory allocation by varying both hardware and software design parameters for embedded systems. Unlike torrent performance evaluation studies that have presumed the single threaded system with single address spate without OS support, our study adopts realistic environment where the embedded system runs on Linux OS. This paper contains the experimental performance analyses of dynamic memory allocation method by investigating the effects of each software layer and some hardware design parameters. Our quantitative results tan be used to help system designers design high performance, low power embedded systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.16-33
• /
• 2019

In this paper, a full-duplex NOMA relaying based underlay device-to-device (D2D) communication scheme is proposed, in which D2D transmitter assists cellular downlink transmission as a full-duplex relay. Specifically, D2D transmitter receives signals from base station and transmits the superposition signals to D2D receiver and cellular user in NOMA scheme simultaneously. Furthermore, we investigate the power allocation under the proposed scheme, aiming to maximize D2D link's achievable transmit rate under cellular link's transmit rate constraint and total power constraint. To tackle the power allocation problem, we first propose a power allocation method based on linear fractional programming. In addition, we derive closed-form expressions of the optimal transmit power for base station and D2D transmitter. Simulation results show that the performance of two solutions matches well and the proposed full-duplex NOMA relaying based underlay D2D communication scheme outperforms existing full-duplex relaying based D2D communication scheme.

• Journal of IKEEE
• /
• v.10 no.2 s.19
• /
• pp.134-140
• /
• 2006

This paper proposed a low power resource allocation algorithm for the minimum switching activity of operators in high level synthesis. In this paper, the proposed method finds switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To use the switching activity was found the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step. As the existing method, the execution time can be fast according to use the number of operator and maximal control step. And it is the reduction effect from 8.5% to 9.3%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3A
• /
• pp.221-228
• /
• 2009

We consider distributed resource allocation among the links in a wireless network to minimize the total transmit power of the network while meeting the target rate required by each link. The problem to be solved is how to change the amount of wireless resource allocated and the number of links sharing the resource according to the interference environment so that the following distributed power control game converges to a stable point. To provide a distributed method with less complexity and lower information exchange than the centralized optimal method, we define the resource sharing level among the links from which the size of resource allocated and the links sharing the resource are determined distributively. It is shown that the performance of the proposed method is better than that of the conventional methods, orthogonal resource allocation only and resource sharing only, as well as it approaches to that of the optimal method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.692-698
• /
• 1999

In this paper, we proposed the channel assignment scheme for the CDMA(Code Division Multiple Access) cellular system using power allocation concept. Also, the performance of the proposed scheme was analyzed and it was compared with the channel assignment scheme using the fixed power allocation method in the CDMA cellular system. The proposed scheme allocates the power adaptively in according to the traffic loads and the traffic distribution pattern of neighbor cells in the forward link. We found that total call blocking probability (Pr) is more dependent on blocking probability($P_B$) than outage probability (Po) under physical number of channels ($C_{th}$)=30. Pr(Call Blocking Probability) is dependent on $P_B$(Blocking Probability) and Po(Outage Probability) at the same ratio under $C_{th}$=32, in which case P$P_{TA}$(blocking probability for the adaptive power allocation) is greater than $P_{TF}$(blocking probability for the fixed power allocation) about 6%.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.11-25
• /
• 2020

This study proposes a method to manipulate fragmentation of disks by arbitrarily allocating and releasing the status of a disk cluster in the NTFS file system. This method allows experiments to be performed in several studies related to fragmentation problems on disk cluster. Typical applicable research examples include testing the performance of disk defragmentation tools according to the state of fragmentation, establishing an experimental environment for fragmented file carving methods for digital forensics, setting up cluster fragmentation for testing the robustness of data hiding methods within directory indexes, and testing the file system's disk allocation methods according to the various version of Windows. This method suggests how a single file occupies a cluster and presents an algorithm with a flowchart. It raises three tricky problems to solve the method, and we propose solutions to the problems. Experiments for allocating the disk cluster to be fragmented to the maximum extent possible, it then performs a disk defragmentation experiment to prove the proposed method is effective.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.17-26
• /
• 2017

An anti-forensic data hiding method in an NTFS index record is a method designed for anti-forensics, which records data as a file name in index entries and thereafter the index entries are made to remain in the intentionally generated slack area in a 4KB-sized index record[7]. In this paper, we propose a maximum data allocation rule for an anti-forensic data hiding method in an NTFS index record; i.e., a computational method for storing optimal data to hide data in an index record of NTFS is developed and the optimal solution is obtained by applying the method. We confirm that the result of analyzing the case where the number of index entries n = 7 is the maximum case, and show the screen captures of index entries as experimental results.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.375-381
• /
• 2012

If a mobile station requests a channel allocation in its mobile networks, the switching center assigns a channel to a mobile station that belongs to each base station. There are three kinds of channel allocation schemes; a fixed channel allocation, a dynamic channel allocation and a hybrid combination of these two forms. In assigning a good frequency, it is our intention to provide quality service to our customers as well as to use resources efficiently. This paper proposes methods of assigning frequencies that minimize interference between channels and that also minimize the amount of searching time involved. In this paper, we propose an algorithm to per specific equipment, regardless of the number of channels that can be used as a general-purpose system, such as base stations, control stations, central office model is proposed, the existing operators manner similar to the fixed channel allocation based statistics and assigned when the conventional method and the improved method is proposed. Different ways and compared via simulations to verify the effectiveness of the proposed approach.