Companies are responding appropriately to the rapidly changing business environment and striving to lead those changes. As part of that, we are meeting our strategic goals through IT projects, which increase the number of simultaneous projects and the importance of project portfolio management for successful project execution. It also strives for efficient deployment of human resources that have the greatest impact on project portfolio management. In the early stages of project portfolio management, it is very important to establish a reasonable manpower plan and allocate performance personnel. This problem is a problem that can not be solved by linear programming because it is calculated through the standard deviation of the input ratio of professional manpower considering the uniformity of load allocated to the input development manpower and the importance of each project. In this study, genetic algorithm, one of the heuristic methods, was applied to solve this problem. As the objective function, we used the proper input ratio of projects, the input rate of specialist manpower for important projects, and the equal load of workload by manpower. Constraints were not able to input duplicate manpower, Was used as a condition. We also developed a program for efficient application of genetic algorithms and confirmed the execution results. In addition, the parameters of the genetic algorithm were variously changed and repeated test results were selected through the independent sample t test to select optimal parameters, and the improvement effect of about 31.2% was confirmed.
Purpose: This study developed a simulation model that incorporates the uncertainty of demand and yield to obtain optimized results for supply chain coordination within environmental constraints. The objective of this study is to examine whether yield management for perishable products can achieve the goal of supply chain coordination between a single buyer and a single supplier under a variety of environmental conditions. Methods: We investigated the efficiency of a revenue-sharing contract and a wholesale price contract by considering demand and yield uncertainty, profit maximizing ratio, and success ratio. The implications for environmental variation were derived through a comparative analysis between the wholesale price contract and the revenue-sharing contract. We performed Monte Carlo simulations to give us the results of an optimized supply chain within the environments defined by the experimental factors and parameters. Results: We found that a revised revenue-sharing contracting model was more efficient than the wholesale price contract model and allowed all members of the supply chain to achieve higher profits. First, as the demand variation (${\sigma}$) increased, the profit of the total supply chain increased. Second, as the revenue-sharing ratio (${\Phi}$) increased, the profits of the manufacturer gradually decreased, while the profits of the retailer gradually increased, and this change was linear. Third, as the quality of yield increased, the profits of suppliers appear to increased. At last, success rate was expressed as the profit increased in the revenue-sharing contract compared to the profit increase in the wholesale price contract. Conclusion: The managerial implications of the simulation findings are: (1) a strategic approach to demand and yield uncertainty helps in efficient resource utilization and improved supply chain performance, (2) a revenue-sharing contract amplifies the effect of yield uncertainty, and (3) revised revenue-sharing contracts fetch more profits for both buyers and suppliers in the supply chain.
KSCE Journal of Civil and Environmental Engineering Research
/
제29권3A호
/
pp.251-258
/
2009
This paper deals with the strongest beams with the solid regular polygon cross-section, whose volumes are always held constant. The differential equation of the elastic deflection curve of such beam subjected to the concentrated and trapezoidal distributed loads are derived and solved by using the double integration method. The Simpson's formula was used to numerically integrate the differential equation. In the numerical examples, the clamped-clamped and clamped-hinged ends are considered as the end constraints and the linear, parabolic and sinusoidal tapers are considered as the shape function of cross sectional depth. As the numerical results, the configurations, i.e. section ratios, of the strongest beams are determined by reading the section ratios from the numerical data obtained in this study, under which static maximum behaviors become to be minimum.
Much has already been learned about what goes on in the minds of second language writers as they compose, yet, oddly enough, until recently little in the L2 research literature has addressed writing and mental imagery together. However, images and imaging (visual thinking) play a crucial role in perception (the basis of mental imagery), in turn, affecting language, thinking, and writing. Many theorists of mental imagery also agree that more than just language accounts for how we think and that imagery is at least as crucial as language. All of these demands, to be sure, are compounded for EFL students, which is why I investigate EFL students' writing process, focusing on the use of mental imagery and its relationship to the writing. First I speculate upon some ways that imagery influences EFL students' composing processes and products. Next, I want to explore how and whether the images in a writer's mind can be shaped effectively into a linear piece of written English in one's writing. I studied two university undergraduate EFL students, L and J. They had fairly advanced levels of English proficiency and exhibited high level of writing ability, as measured by TOEFL iBT Test. Each student wrote two comparison and contrast essays: one written under specified time limitations and the other written without the pressure of time. In order to investigate whether the amount of time in itself causes differences within an individual in imagery ability, the students were placed under strict time constraints for Topic 1. But for Topic 2, they were encouraged to take as much time as necessary to complete this essay. Immediately after completing their essays, I conducted face-to-face retrospective interviews with students to prompt them for information about the role of imagery as they write. Both L and J have spent more time on their second (untimed) essays. Without time constraint, they produced longer texts on untimed essay (149 vs. 170; 186 vs 284 words). However, despite a relatively long period of time spent writing an essay, these students neither described their images nor detailed them in their essays. Although their mental imagery generated an explosion of ideas for their writings, most visual thinking must merely be a means toward an end-pictures that writers spent in purchasing the right words or ideas.
Journal of the Computational Structural Engineering Institute of Korea
/
제36권6호
/
pp.399-405
/
2023
This study presents an optimal seismic design method based on genetic algorithms to induce beam-hinge collapse mechanisms in reinforced concrete moment frames. Two objective functions are used. The first minimizes the cost of the structure and the second maximizes the energy dissipation capacity of the structure. Constraints include strength conditions of columns and beams, minimum conditions for column-to-beam flexural strength ratio, and conditions for preventing plastic hinge occurrence of columns. Linear static analysis is performed to evaluate the strength of members, whereas nonlinear static analysis is carried out to evaluate energy dissipation capacity and occurrence of plastic hinges. The proposed method was applied to a four-story example structure, and it was confirmed that solutions for inducing a beam-hinge collapse mechanism are obtained. The value of the column-beam flexural strength ratio of the obtained design was found to be larger than the value suggested by existing seismic codes. A more robust strategy is needed to induce a beam-hinge collapse mode.
The transportation problem (TP) is one of the earliest and the most significant implementations of linear programming problem (LPP). It is a specific type of LPP that mostly works with logistics and it is connected to day-to-day activities in our everyday lives. Nowadays decision makers (DM's) aim to reduce the transporting expenses and simultaneously aim to reduce the transporting time of the distribution system so the bi-objective transportation problem (BOTP) is established in the research. In real life, the transportation parameters are naturally uncertain due to insufficient data, poor judgement and circumstances in the environment, etc. In view of this, neutrosophic bi-objective transportation problem (NBOTP) is introduced in this paper. By introducing single-valued trapezoidal neutrosophic numbers (SVTrNNs) to the co-efficient of the objective function, supply and demand constraints, the problem is formulated. The DM's aim is to determine the optimal compromise solution for NBOTP. The extended weighted possibility mean for single-valued trapezoidal neutrosophic numbers based on [40] is proposed to transform the single-valued trapezoidal neutrosophic BOTP (SVTrNBOTP) into its deterministic BOTP. The transformed deterministic BOTP is then solved using the dripping method [10]. Numerical examples are provided to illustrate the applicability, effectiveness and usefulness of the solution approach. A sensitivity analysis (SA) determines the sensitivity ranges for the objective functions of deterministic BOTP. Finally, the obtained optimal compromise solution from the proposed approach provides a better result as compared to the existing approaches and conclusions are discussed for future research.
Genetic variance and covariance components of the linear traits and the ordered categorical traits, that are usually observed as dichotomous or polychotomous outcomes, were simultaneously estimated in a multivariate threshold animal model with concepts of arbitrary underlying liability scales with Bayesian inference via Gibbs sampling algorithms. A multivariate threshold animal model in this study can be allowed in any combination of missing traits with assuming correlation among the traits considered. Gibbs sampling algorithms as a hierarchical Bayesian inference were used to get reliable point estimates to which marginal posterior means of parameters were assumed. Main point of this study is that the underlying values for the observations on the categorical traits sampled at previous round of iteration and the observations on the continuous traits can be considered to sample the underlying values for categorical data and continuous data with missing at current cycle (see appendix). This study also showed that the underlying variables for missing categorical data should be generated with taking into account for the correlated traits to satisfy the fully conditional posterior distributions of parameters although some of papers (Wang et al., 1997; VanTassell et al., 1998) presented that only the residual effects of missing traits were generated in same situation. In present study, Gibbs samplers for making the fully Bayesian inferences for unknown parameters of interests are played rolls with methodologies to enable the any combinations of the linear and categorical traits with missing observations. Moreover, two kinds of constraints to guarantee identifiability for the arbitrary underlying variables are shown with keeping the fully conditional posterior distributions of those parameters. Numerical example for a threshold animal model included the maternal and permanent environmental effects on a multiple ordered categorical trait as calving ease, a binary trait as non-return rate, and the other normally distributed trait, birth weight, is provided with simulation study.
In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.
Chen, D.T.;Lee, S.R.;Hu, Y.H.;Huang, C.C.;Cheng, Y.S.;Tai, C.;Poivey, J.P.;Rouvier, R.
Asian-Australasian Journal of Animal Sciences
/
제16권12호
/
pp.1705-1710
/
2003
A small body size of Brown Tsaiya laying duck is desirable to reduce maintenance requirements, so the body weight at 40 weeks of age (BW40) has to be maintained at its current level. Egg weight has to be maintained at around 65 g to meet market requirements. Eggshell strength at 40 weeks of age (ES40) must to be increased in order to maintain a low incidence of broken eggs. Thus, number of eggs laid up to 52 weeks of age (EN52) has to be increased without negative correlated response on ES40. A new linear genetic selection index was used: $I_g=a_0{\times}GEW40\;(g)+a_1{\times}GBW40\;(g)+a_2{\times}GES40\;(kg/cm^2)+a_3{\times}GEN52\;(eggs)$ where GEW40, GBW40, GES40 and GEN52 were the multitrait best linear unbiased prediction (MT-BLUP) animal model predictors of the breeding values respectively of egg weight and body weight at 40 weeks of age (EW40, BW40), ES40 and EN52. The coefficients $a_0$, $a_1$, $a_2$ and $a_3$ were calculated with constraints of 0.0 g, 0.0 g and $0.013kg/cm^2$ for expected genetic gains in EW40, BW40 and ES40 respectively and maximum gain in EN52. Since 1997, the drakes and the ducks were selected according to their own indexes, with this new genetic selection index. From G0 to G4, the average per generation predicted genetic responses in female duck were +0.05 g for EW40, +0.92 g for BW40, $+0.035kg/cm^2$ for ES40 and +2.13 eggs for EN52. Which represented respectively 0.07%, 0.06%, 0.67% and 1.0% of the means of the EW40, BW40, ES40 and EN52. For ES40 and EN52, it represented also respectively 16.1% and 21.6% of the additive genetic standard deviation of these traits. Thevse results indicated that selection of laying Brown Tsaiya by a restricted genetic selection index and with MT-BLUP animal model could be an efficient tool for improving the efficiency of egg production, increasing egg shell strength and egg number while holding egg weight and body weight constants.
Journal of Advanced Marine Engineering and Technology
/
제40권9호
/
pp.749-755
/
2016
A new method for measuring the 3-axis cutting forces of a pick cutter by substituting costly 3-D load cells is proposed in this paper. The proposed cutting force measurement method is capable of estimating the 3-axis cutting forces through mechanical constraints using four single-axis compressive load cells and shoulder bolts. The feasibility of the proposed method was verified by finite element analysis, and the accuracy of the force measurement of the developed force measurement device was investigated by conducting linear rock cutting tests. The tests showed that the new cutting force measurement method is able to measure 3-axis cutting forces with a relative error of approximately 6%. These results imply that the new method could be a suitable alternative to conventional 3-D load cells. In addition, it will allow a significant reduction of approximately 20-30% in the costs required for measuring the cutting force when compared to conventional 3-D load cells.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.