• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권2호
• /
• pp.143-152
• /
• 2005

We present a new block cipher called DyC. It consists of four sets (procedures) having the different $2^2,\;2^2,\;2^4$, and $2^8$ one-to-one correspondence functions as the elements. The round key is used to determine exactly one composite function from the possible $2^{16}$ composite functions. DyC supports 8 $\times$ n bit key size, 16 $\times$ m bit block length, and n rounds. We have confirmed that DyC offers security against other well-known advanced cryptanalytic attacks including the slide attacks and interpolation attacks. In this paper, we show several properties of the key schedule of DyC by mathematical analysis.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.161-164
• /
• 2000

A cyclic shop is a production system that repeatedly produces identical sets of jobs, called minimal part sets, in the same loading and processing sequence. We consider a version of cyclic shop where the operations are processed and unloaded within time limits, so called a time window. We model the shop using an event graph model, a class of Petri nets. To represent the time window constraint, we introduce places with negative time delays. From the shop modeling graph, we develop a linear system model based on the max- plus algebra and characterize the conditions on the existence of a stable schedule.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.139-149
• /
• 1994

In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [13] and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 하계학술대회 논문집 A
• /
• pp.731-733
• /
• 2004

제약급전계획은 중앙급전발전기 및 중앙급전부하의 급전값을 산정하기 위해 각 급전주기마다 해당급전주기에 대하여 전력거래소가 예측한 비중앙급전발전기 및 비중앙급전부하에 대한 자료를 기초로 제약요소를 고려하여 작성하는 급전계획이다. 이 급전계획은 실제발전기와 부하의 출력 및 전력소비를 결정하므로 전력수급 조건, 발전기제약, 전력망제약, 보조서비스제약 등을 고려하여 전력의 시장거래가치를 최대화하도록 해야 한다. 본 논문에서는 제약급전을 결정함에 있어 선형계획법의 적용방법을 제시하고, 해의 수렴 개선을 위해 결정변수 및 제약조건의 수를 줄일 수 있는 방법을 제시한다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.410-420
• /
• 1994

In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

• 한국산업정보학회논문지
• /
• 제1권1호
• /
• pp.29-62
• /
• 1996

In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.421-429
• /
• 2014

We consider the problem of scheduling communications in wireless sensor networks (WSNs) to ensure battery preservation through the use of the sleeping mode of sensors.We propose a communication protocol for 1-hop WSNs and extend it to multi-hop WSNs through the use of a 1-hop clustering algorithm.We propose to schedule communications in each cluster in a virtual communication ring so as to avoid collisions. Since clusters are cliques, only one sensor can speak or listen in a cluster at a time, and all sensors need to speak in each of their clusters at least once to realize the communication protocol. We model this situation as a mathematical program.

• Safety and Health at Work
• /
• 제12권3호
• /
• pp.296-303
• /
• 2021

Background: Rapid population aging in developed countries has resulted in the working-age population increasingly being tasked with the provision of informal care. Methods: An educational intervention was delivered to 21 carer-employees employed at a Canadian University. Work role function, job security, schedule control, work-family conflict, familywork conflict, and supervisor and coworker support were measured as part of an aggregated workplace experience score. This score was used to measure changes pre/post intervention and at a follow-up period approximately 12 months post intervention. Three random intercept models were created via linear mixed modeling to illustrate changes in participants' workplace experience across time. Results: All three models reported statistically significant random and fixed effects intercepts, with a positive coefficient of change. Conclusion: This suggests that the intervention demonstrated an improvement of the workplace experience score for participants over time, with the association particularly strong immediately after intervention.

• 한국건설관리학회논문집
• /
• 제24권3호
• /
• pp.52-61
• /
• 2023

Conflicts in a construction project not only make negative impacts on project performance such as schedule delay or cost overrun but also require social cost to resolve the conflicts. Although the conflict needs a preemptive management because a conflict usually begins with a complaint, existing studies have focused on conflict resolution after it occurs. This study identifies and categorizes complaints which mainly appear in the construction projects. Those complaints were evaluated and quantified in terms of occurrence frequency and potential to conflict through a questionnaire survey with industry experts. Using the survey results, this study examines the characteristic of complaints in linear project and clustered project, and analyzes what kind of complaints occur by project type. As the results, this study derives the complaints with high potential to the conflicts that should be managed first during managing a construction project in each project type.