• 한국콘텐츠학회논문지
• /
• 제12권5호
• /
• pp.103-112
• /
• 2012

본 연구는 과학대중화에 있어 중요한 역할을 수행하고 있는 국내 과학전문채널인 'YTN 사이언스'가 시청률, 콘텐츠, 제작비의 부족을 드러내고 있다는 문제인식 하에, 우선 현행 국내 과학전문채널의 프로그램 편성과 운영현황, 홍보 전략을 탐색적으로 확인하였다. 다음으로 미국(디스커버리 채널, 내셔널지오그래픽 채널), 영국(BBC Knowledge), 일본(사이언스채널), 중국(CCTV 10) 등 해외 각국의 과학방송채널 특히, 중요 프로그램들을 분석하여 향후 국내 과학전문채널에 활용 및 접목시킬 수 있는 가능성을 모색하였다. 이러한 현실진단과 해외사례분석을 통해 다양한 시사점을 확인하였으며, 이를 통해 제시될 수 있는 콘텐츠 개발 및 홍보전략은 다음과 같다. 우선 콘텐츠가치 제고를 위한 편성전략의 수정이 필요한 바, 타깃 시청집단과 시청자 라이프스타일을 고려한 편성 재조정, 줄띠편성(Stripping)을 통한 시청습관화 전략, 프라임타임(prime time)대의 전략 프로그램 배치가 필요할 것이다. 다음으로 콘텐츠제작 및 활용전략 측면에서는 콘텐츠 제작의 이중적 전략(지식전달, 흥미전달의 두 분야로의 구분), 프로그램의 대표 캐릭터의 기획과 활용, 한국적 과학기술소재의 선택, SNS와의 전략적 연계, 소재의 다변화와 심층화, OSMU 활성화 전략이 요구될 것이다. 마지막으로 홍보전략 차원에서는 과학관련 행사 개최와 중계방송을 통한 채널 인지도 제고, 잡지 및 단행본 발간 등 인쇄매체로의 확장을 통한 홍보전략 수행, 온라인/모바일 홍보 전략의 강화 등을 제시할 수 있겠다.

• Management Science and Financial Engineering
• /
• 제14권2호
• /
• pp.67-87
• /
• 2008

Data envelopment analysis (DEA) has proven to be a useful tool for assessing efficiency or productivity of organizations which is of vital practical importance in managerial decision making. While DEA assumes exact input and output data, the development of imprecise DEA (IDEA) broadens the scope of applications to efficiency evaluations involving imprecise information which implies various forms of ordinal and bounded data possibly or often occurring in practice. The primary purpose of this article is to characterize the variable efficiency in IDEA. Since DEA describes a pair of primal and dual models, also called envelopment and multiplier models, we can basically consider two IDEA models: One incorporates imprecise data into envelopment model and the other includes the same imprecise data in multiplier model. The issues of rising importance are thus the relationships between the two models and how to solve them. The groundwork we will make includes a duality study which makes it possible to characterize the efficiency solutions from the two models. This also relates to why we take into account the variable efficiency and its bounds in IDEA that some of the published IDEA studies have made. We also present computational aspects of the efficiency bounds and how to interpret the efficiency solutions.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.48-53
• /
• 2004

In this paper, the task-oriented optimal configuration in the sense of Velocity and Force manipulability measure of manipulator mounted on ROV is considered. Manipulability is a quantitative measure of manipulator's capability obtained under the limits of joint velocities or torques. The base arrangements and optimal joint configuration of manipulator, that maximize the manipulability measure under the constraints of given task, are investigated. With the two types of base arrangements of manipulator, workspace analysis is carried out to investigate merits and demerits of each arrangement on the view of manipulability measure. To find optimal joint configuration for a given task with each arrangement, the SQP(Sequential Quadratic Programming) optimization are performed. Weighted linear combination of velocity and force manipulability measure is object function for SQP optimization. The kinematic parameters of Dual Orion manipulator which will be mounted on KORDI ROV are used for simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.921-940
• /
• 2015

In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.

• 대한기계학회논문집A
• /
• 제24권4호
• /
• pp.894-900
• /
• 2000

Optimization of chassis frame is performed according to the minimization of eleven responses representing one total frame weight, three natural frequencies and seven strength limits of chassis frame that are analyzed by using each response surface model from D-optimal design of experiments. After each response surface model is constructed form D-optimal design and random orthogonal array, the main effect and sensitivity analyses are successfully carried out by using this approximated regression model and the optimal solutions are obtained by using a nonlinear programming method. The response surface models and the optimization algorithms are used together to obtain the optimal design of chassis frame. The eleven-polynomial response surface models of the thirteen frame members (design factors) are constructed by using D-optimal Design and the multi-disciplinary design optimization is also performed by applying dual response analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• 한국경영과학회지
• /
• 제23권2호
• /
• pp.29-46
• /
• 1998

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n$^2$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n＝150 and H＝1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.54-68
• /
• 1995

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network (LATN) Design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column. Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot, an entering variable is selected by detecting the Locally Most Violated (LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN Design problem can be solved in O(n$^{2}$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN Design problem with n = 150 and H = 1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.149-168
• /
• 2015

In cognitive radio networks (CRNs), hybrid overlay and underlay sharing transmission mode is an effective technique for improving the efficiency of radio spectrum. Unlike existing works in the literature, where only one secondary user (SU) uses overlay and underlay modes, the different transmission modes should be allocated to different SUs, according to their different quality of services (QoS), to achieve the maximal efficiency of radio spectrum. However, hybrid sharing mode allocation for heterogeneous services is still a challenge in CRNs. In this paper, we propose a new resource allocation method for hybrid sharing transmission mode of overlay and underlay (HySOU), to achieve more potential resources for SUs to access the spectrum without interfering with the primary users. We formulate the HySOU resource allocation as a mixed-integer programming problem to optimize the total system throughput, satisfying heterogeneous QoS. To decrease the algorithm complexity, we divide the problem into two sub-problems: subchannel allocation and power allocation. Cutset is used to achieve the optimal subchannel allocation, and the optimal power allocation is obtained by Lagrangian dual function decomposition and subgradient algorithm. Simulation results show that the proposed algorithm further improves spectrum utilization with a simultaneous fairness guarantee, and the achieved HySOU diversity gain is a satisfactory improvement.

• 한국정보통신학회논문지
• /
• 제16권7호
• /
• pp.1416-1427
• /
• 2012

본 논문에서는 생존 가능한 선박 백본 네트워크의 설계 기법을 제안하였다. 제안한 설계 기법에서 선박 백본 네트워크의 토폴로지를 근사 최적으로 구성하기 위하여 먼저 선박 장치의 통신 인터페이스와 링크가 이중화로 구성된 선박 백본 네트워크의 효율적인 구조를 분석 및 제안하였다. 그리고 제안한 선박 백본 네트워크의 구조를 고려한 정수선형계획법 기반 물리 토폴로지의 구성 방안을 제안하였다. 마지막으로 메타 휴리스틱 기법을 적용하여 물리 토폴로지 계층 위에서 형성되는 논리 토폴로지의 구성 방안을 제안하였다.