• Title/Summary/Keyword: precedence

Search Result 383, Processing Time 0.033 seconds

Algorithm or Parallel Computation for a multi-CPU controlled Robot Manipulator (복수의 CPU로 제어되는 매니퓰레이터의 병렬계산 알고리즘)

  • Woo, Kwang-Bang;Kim, Hyun-Ki;Choi, Gyoo-Suck
    • Proceedings of the KIEE Conference
    • /
    • 1987.07a
    • /
    • pp.288-292
    • /
    • 1987
  • The purpose of this paper is to develope the parallel computation algorithm that enables it to minimize the completion tine of computation execution of the entire subtasks, under the constraints of the series-parallel precedence relation in each subtask. The developed algorithm was applied to the control of a robot manipulator functioned by multi-CPU's and to obtain the minimum time schedule so that real time control may be achieved. The completion time of computation execution was minimized by applying "Variable" Branch and Bound algorithm which was developed In this paper in determining the optimum ordered schedule for each CPU.

  • PDF

An Improved Branch-and-Bound Algorithm for Scheduling Jobs on Identical Machines

  • Park, Sung-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.1 no.2
    • /
    • pp.73-81
    • /
    • 1975
  • In an earlier paper ('Scheduling Jobs on a Number of Identical Machines' by Elmaghraby and Park, March 1974, AIIE Transactions) a branch-and-bound algorithm was developed for the sequencing problem when all jobs are available to process at time zero and are independet (i.e., there are not a priori precedence relationships among jobs.). However, the amount of computation required by the algorithm was not considered to be short if more than 50 jobs were processed. As an effort to improve the algorithm, the present paper modifies the implicit enumeration procedure in the algorithm so that moderately large problems can be treated with what appears to be a short computational time. Mainly this paper is concerned with improving the lower bound in the implicit enumeration procedure. The computational experiences with this new branch-and-bound algorithm are given.

  • PDF

A Study on the Ontology-based Design Process Modeling (온톨로지 기반 설계 프로세스 모델링에 관한 연구)

  • Kim J.K.;Kang M.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.10a
    • /
    • pp.632-636
    • /
    • 2005
  • Design process model represents how a design project proceeds. It encompasses the individual activities of design, their precedence relationships, and the relevant information related to each activity. In contrast to the conventional visual representation methods, ontology-based process model is machine-readable, and therefore it can be implemented in a software system without repeating the whole steps of coding, compiling and link. This paper proposes a framework for design process ontology that defines the relevant objects and attributes in the design process as well as the relationships between them. An example for injection mold design process is shown to explain the substance of the design process model.

  • PDF

Generation of Block Assembly Sequence by Case Based Reasoning (사례기반 추론을 이용한 블록조립계획)

  • 신동목;김태운;서윤호
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.7
    • /
    • pp.163-170
    • /
    • 2004
  • In order to automatically determine the sequences of block assembly operations in shipbuilding, a process planning system using case-based reasoning (CBR) is developed. A block-assembly planning problem is modeled as a constraint satisfaction problem where the precedence relations between operations are considered constraints. The process planning system generates an assembly sequence by adapting information such as solutions and constraints collected from similar cases retrieved from the case base. In order to find similar cases, the process planning system first matches the parts of the problem and the parts of each case based on their roles in the assembly, and then it matches the relations related to the parts-pairs. The part involved in more operations are considered more important. The process planning system is applied to simple examples fur verification and comparison.

Precedence of Parenchymal Enhancement on CT Angiography to a Fatal Duret Hemorrhage

  • Sim, Ki-Bum;Na, Dong Gyu;Park, Ji Kang
    • Journal of Korean Neurosurgical Society
    • /
    • v.53 no.6
    • /
    • pp.380-382
    • /
    • 2013
  • We report a case of fatal duret hemorrhage (DH) in a patient with acute tentorial subdural hematoma and bilateral chronic subdural hematoma along the cerebral hemispheres. Preoperative CT angiography (CTA) revealed prominent parenchymal enhancement in the ventral pontomesencephalic area. After burr-hole drainage, a large hemorrhage developed in this area. The parenchymal enhancement in the CTA may reflect the pontomensencephalic perforating vessel injury, and may be a sign of impending DH of acute transtentorial downward herniation. Previous use of aspirin and warfarin might have potentiated the process of DH and increase the extent of the bleed.

Optimal Period and Priority Assignment Using Task & Message-based Scheduling in Distributed Control Systems

  • Kim, Hyoung-Yuk;Park, Hong-Seong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.60.1-60
    • /
    • 2001
  • In recent years, distributed control systems(DCS) using fieldbus such as CAN have been being applied to process systems but it is very difficult to design the DCS in order to guarantee the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of ...

  • PDF

Reasons for Adopting Weak Opinions in Islamic Jurisprudence

  • Alharthy, Meshal Qabbas
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.8
    • /
    • pp.323-327
    • /
    • 2022
  • The field of this study is in Islamic jurisprudence. Taking the preferred saying is contrary to the original, and takes it if necessity or need arises. There are reasons for adopting the preferred saying that were mentioned in this research so that the mufti and jurist know when to take the preferred saying, and when to act with the most correct saying. The origin is the work of the jurist and mufti by saying the most correct. If the necessity or the need that prompted the mufti to take the preferred saying ceases, then he returns to work with the most correct saying, and gives it precedence over the most preferred opinion. The researcher recommends that this topic be given more attention from researchers, and that it is taken care of in jurisprudential developments; So that the embarrassment of the nation is lifted, and the jurists clarify the legal ruling on emerging issues.

A Study on the Analysis of Population Dynamics and the Model of population Relocation (人口過程의 分析과 人口配置計劃의 모델模索)

  • 박찬계;함종욱
    • Journal of the Korean Statistical Society
    • /
    • v.10
    • /
    • pp.145-157
    • /
    • 1981
  • Regional relocation of population in Korea is required strongly from natural and environmental sides for substantial growth of economy and the rigorous revival national economy against especially internationalization. This paper aimed for analysed the population distribution by regional and special characteristics of the inter-migration and showed the direction of population policy through the model building. Relocation methods of population by region has been examined through the process from the approach method by Haurin's production function to the approach by the utility function. The examination of the development model is done efficiently, how utility these approach models are depends on that scientific and composite plan for population problems against forced policy should be taken precedence.

  • PDF

Factors Influencing Entrepreneurial Intention of Young Entrepreneurs Preparing to Operate Smart Farms - The Mediating Effect of Entrepreneurship and Entrepreneurial Opportunity Recognition - (스마트팜 예비 청년창업농의 창업의지 영향요인 분석 - 기업가정신과 창업기회인식의 매개효과 -)

  • Ji-Bum Um;Myeong-Eun Park
    • Journal of Agricultural Extension & Community Development
    • /
    • v.29 no.4
    • /
    • pp.251-264
    • /
    • 2022
  • This study aimed to identify the factors that influence young entrepreneurs' desire to start a smart farm business. Young entrepreneurs' entrepreneurial self-efficacy, entrepreneurial intention, entrepreneurship, and Entrepreneurial opportunity recognition were modeled structurally, and the mediating effect of entrepreneurship and entrepreneurial opportunity recognition was investigated. Data were conducted from 159 usable questionnaires. The following are the findings of this study. Entrepreneurial self-efficacy did not have a significant effect on entrepreneurial intention, but entrepreneurship and entrepreneurial opportunity recognition were found to have a mediating effect on entrepreneurial intention. Therefore, the preparation of training programs to encourage entrepreneurship or the dissemination of pertinent information to identify opportunities should take precedence over immediate startup.

PROJECT SCHEDULING WITH START-TIME DEPENDENT COST AND IMPRECISE DURATION

  • Siamak Haji Yakhchali
    • International conference on construction engineering and project management
    • /
    • 2011.02a
    • /
    • pp.468-473
    • /
    • 2011
  • The goal of a project manager is generally to minimize the cost of the project and also to cope with uncertainty. This paper deals with the problem of project scheduling a set of activities satisfying precedence constraints in order to minimize the sum of the costs associated with the starting times of the activities in the network with imprecise activity durations, represented by means of interval or fuzzy numbers. So far this problem has been completely solved by several authors when the activities durations have crisp values. However, they do not consider the imprecision in activity durations in their models. Here the framework of possibility theory is proposed to solve this problem. In fuzzy arithmetic, usually, the interval calculations are used for the aim of complexity reduction and simplification. Thus the case of interval-valued durations is first addressed, and then extended to fuzzy intervals. A numerical example is used to illustrate the developed concept.

  • PDF