• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2778-2791
• /
• 2017

In the age of big data, distributed data providers need to ensure the privacy, while data analysts need to mine the value of data. Therefore, how to find the privacy-utility tradeoff has become a research hotspot. Besides, the adversary may have the background knowledge of the data source. Therefore, it is significant to solve the privacy-utility tradeoff problem in the distributed environment with side information. This paper proposes a distributed privacy-utility tradeoff method using distributed lossy source coding with side information, and quantitatively gives the privacy-utility tradeoff region and Rate-Distortion-Leakage region. Four results are shown in the simulation analysis. The first result is that both the source rate and the privacy leakage decrease with the increase of source distortion. The second result is that the finer relevance between the public data and private data of source, the finer perturbation of source needed to get the same privacy protection. The third result is that the greater the variance of the data source, the slighter distortion is chosen to ensure more data utility. The fourth result is that under the same privacy restriction, the slighter the variance of the side information, the less distortion of data source is chosen to ensure more data utility. Finally, the provided method is compared with current ones from five aspects to show the advantage of our method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.436-442
• /
• 2013

The diversity-multiplexing tradeoff (DMT) function of a special half-duplex (HD) dynamic decode and forward (DDF) relay protocol with more than two antennas at the source node, two antennas at the relay node, and two antennas at the destination node is derived. This protocol is compared to a HD NAF protocol with the same number of source antennas and a HD DDF relay protocol with two antennas at the source node, more than two antennas at the relay node, and two antennas at the destination node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1837-1860
• /
• 2020

We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.35-43
• /
• 2011

To develop a software, there is a relationship between development organization's productivity, effort, development schedule, and software size. It is software equation that motive these relations. Basically, relationship between size-effort and size-schedule is applied. If this relationship is not proper, there would be no effect of the cost-schedule tradeoff equation that is derived from software equation, and the manpower profile analysis, etc. To solve these unwanted problems, we presented a modified software equation and a cost-schedule tradeoff model based on the modified software equation. To improve software development success rate, applying proposed model will help in contract negotiation or bid.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1085-1092
• /
• 2012

Mobile communication systems define user state transition mechanisms in order to manage radio resources and battery power efficiently. In the state transition mechanism, a state with a higher energy consumption inherently offers a shorter access delay, so there is a tradeoff between the energy and delay performances. In this paper, we analyze the user state transition mechanism of UMTS by considering the bursty traffic attributes of mobile applications. We perform a numerical evaluation for both the energy consumption and the activation delay by Markov modeling of the state transition mechanism, and investigate their tradeoff relationship as functions of operational parameters. The resulting energy-delay tradeoff curves clearly show an achievable performance bound of the user state transition mechanism and also offer an optimal operation strategy to minimize the energy consumption while guaranteeing the delay requirement.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.36-38
• /
• 1998

비디오 서버에서 가변 비트율 데이터를 위한 다양한 스케줄링 기법이 제안되어 왔다. 가변 비트율로 저장장치에 저장된 비디오 데이터를 재생할 때 최악의 경우를 가정하여 디스크 대역폭을 할당하면 디스크 대역폭 이용율이 매우 낮아진다. 디스크 대역폭의 이용율을 높이기 위한 방법으로 선반입 기법을 사용하는데 이를 위해서는 많은 버퍼가 필요하다. 본 논문에서는 가변 비트율 데이터를 위한 윈도우별 선반입에 기반한 데이터 스케줄링에서 시스템의 자원 상황을 고려하여 적절한 디스크 대역폭과 버퍼 할당을 Tradeoff 하는 기법을 제안한다. 제안한 기법은 비디오 데이터에 대한 메타 데이터를 미리 구축하고 이에 따라 자원을 윈도우 단위로 할당한다. 선반입은 윈도우 단위로 실시하며 선반입에 필요한 버퍼가 과다하게 증가하는 것을 조절한다. 모의 실험에서는 기존의 가변 비트율 데이터 스케줄링 기법과 제안한 기법의 자원 할당량과 동시 지원 가능 사용자수를 실험하고 비교하였다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.

• Journal of Applied Reliability
• /
• v.16 no.4
• /
• pp.280-286
• /
• 2016

Purpose: Recently, Jiang defines the tradeoff B life to minimize a sum of life lost by preventive maintenance (PM) and corrective maintenance (CM) contribution parts and sets up an optimal replacement age of age replacement policy as this tradeoff life. In this paper, Jiang's model only considering the known lifetime distribution is extended by assigning different weights to two parts of PM and CM in order to reflect the practical maintenance situations in application. Methods: The new age replacement model is formulated and the meaning of a weight factor is expressed with the implied cost of failure under asymptotic expected cost model and also discussed with one-cycle expected cost criterion. Results: The proposed model is applied to Weibull and lognormal lifetime distributions and optimum PM replacement ages are derived with corresponding implied cost of failure. Conclusion: The new age replacement policy to escape the estimation of cost of failure in classical asymptotic expected cost criterion based on the renewal process is provided.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.11-18
• /
• 2010

Diversity-multiplexing tradeoff (DMT) is an efficient tool to measure the performance of multiple-input and multiple-output (MIMO) systems and cooperative systems. Recently, cooperative multicast system with wireless network coding stretched tremendous interesting due to that it can drastically enhance the throughput of the wireless networks. It is desirable to apply DMT to the performance analysis on the multicast system with wireless network coding. In this paper, DMT is performed at the three proposed wireless network coding protocols, i.e., non-regenerative network coding (NRNC), regenerative complex field network coding (RCNC) and regenerative Galois field network coding (RGNC). The DMT analysis shows that under the same system performance, i.e., the same diversity gain, all the three network coding protocols outperform the traditional transmission scheme without network coding in terms of multiplexing gain. Our DMT analysis also exhibits the trends of the three network coding protocols' performance when multiplexing gain is changing from the lower region to the higher region. Monte-Carlo simulations verify the prediction of DMT.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.224-232
• /
• 2012

The paper proposes a non-parametric methodology, data envelopment analysis, for measuring efficiency and productivity in service delivery systems with capacity constraints. The methodology provides allocation approaches for studying behaviors of firm and customers in service delivery strategy. The experimental study is carried out to investigate allocation behaviors and conduct an objective tradeoff between efficiency approach and productivity approach. The experimental result indicates that the efficiency approach allocates resource via maximizing customer efficiency rather than firm productivity as in the productivity approach. Moreover, the experiment reveals that there exists an objective tradeoff between the efficiency approach and the productivity approach. These findings provide strategic options for allocation policy in service delivery systems.