• 제목/요약/키워드: Allocation procedure

검색결과 171건 처리시간 0.021초

현수교의 선박충돌 위험 및 설계박하중 (Ship Collision Risk of Suspension Bridge and Design Vessel Load)

  • 이성로;배용귀
    • 대한토목학회논문집
    • /
    • 제26권1A호
    • /
    • pp.11-19
    • /
    • 2006
  • 본 연구에서는 현수교의 선박충돌해석을 위한 설계선박을 결정하기 위하여 선박충돌위험도해석을 수행한다. 선박충돌에 대한 설계선박을 결정하기 위하여 AASHTO 설계기준에서 제시한 3개의 선박충돌 설계방법 중 확률기반 해석방법인 Method II를 사용한다. 선박충돌 위험에 노출된 각각의 교각에 대해 선박충돌위험도 평가를 하여 교각의 충돌설계수평강도를 결정한다. 해석과정은 반복적인 것으로 교량부재의 충돌저항강도를 가정하고 연간파괴빈도를 계산하여 허용기준이 만족하도록 설계 변수를 수정한다. 허용기준은 예상연간파괴빈도에 근거한 가중치를 이용하여 교각에 할당한다. 해석결과에서 안전성과 경제성을 얻기 위해 이 할당방법을 주탑집중 할당방법과 비교한다. 비록 주탑집중 할당방법이 주탑에 비해 과대평가되는 교각의 설계수평강도를 적절히 수정할 경우 보다 경제적인 결과를 가져오지만, 가중치에 의한 할당방법이 설계인자의 특성을 정량적으로 고려하기 때문에 더 합리적인 것으로 보인다. 그리고 선박충돌위험도 평가로부터 얻어지는 충돌설계수평강도에 상응하는 각각의 교각에 대한 설계선박이 결정된다. 같은 교량에 대해서도 충돌설계수평강도가 수로 및 교량의 특성과 선박통행량에 따라 상당히 변화한다. 따라서 허용기준의 할당과 설계선박 선정에 대한 많은 연구가 요구된다.

Comparison of sequential estimation in response-adaptive designs with and without covariate-adjustment

  • Park, Eunsik
    • Communications for Statistical Applications and Methods
    • /
    • 제23권4호
    • /
    • pp.287-296
    • /
    • 2016
  • Subjects on one side of the covariate population can be allocated to the inferior treatment when there is interaction between the covariate and treatment along with a response-adaptive (RA) design without covariate adjustment. An RA design allows a newly entered subject to have a better chance so that the subject is treated by a superior treatment based on cumulative information from previous subjects. A covariate-adjusted response-adaptive (CARA) is the same as RA design and additionally adjusts the allocation based on individual covariate information. A comparison has been made for the sequential estimation procedure with and without covariate adjustment to see how ignoring significantly interactive covariate affects the correct treatment allocation. Using logistic models, we present simulation results regarding the coverage probability of treatment effect, correct allocation, and stopping time.

NTFS 파일 시스템의 저널 파일을 이용한 파일 생성에 대한 디지털 포렌식 방법 (A Digital Forensic Method for File Creation using Journal File of NTFS File System)

  • 김태한;조규상
    • 디지털산업정보학회논문지
    • /
    • 제6권2호
    • /
    • pp.107-118
    • /
    • 2010
  • This paper proposes a digital forensic method to a file creation transaction using a journal file($LogFile) on NTFS File System. The journal file contains lots of information which can help recovering the file system when system failure happens, so knowledge of the structure is very helpful for a forensic analysis. The structure of the journal file, however, is not officially opened. We find out the journal file structure with analyzing the structure of log records by using reverse engineering. We show the digital forensic procedure extracting information from the log records of a sample file created on a NTFS volume. The related log records are as follows: bitmap and segment allocation information of MFT entry, index entry allocation information, resident value update information($FILE_NAME, $STANDARD_INFORMATION, and INDEX_ALLOCATION attribute etc.).

부하관리사업자의 부하배분 전략 (Allocation Strategies of Controllable Loads for Load Aggregator in Power Market)

  • 이찬주;조기선;김회철;박종배;신중린;김성수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 A
    • /
    • pp.630-632
    • /
    • 2003
  • This paper describes allocation strategies of controllable loads for load aggregator in power market with the direct load control (DLC) program, which is carried out the two-way confirmation procedure. So, it is needed to the priority among the controllable loads to perform effectively and quickly the confirmation task. In this paper, allocation strategies for market operator and/or load aggregator are proposed, which are based on the basic load patterns defined in this paper. To verify the soundness of proposed strategies. case study on a sample system is performed.

  • PDF

Recursive nested 구조를 위한 run-time 기억장소 운영에 관한 연구 (A study on the run-time storage management for recursice and nested structure)

  • 김영택;차윤경
    • 전기의세계
    • /
    • 제31권4호
    • /
    • pp.281-287
    • /
    • 1982
  • PASCAL has a recursive nested structure and uses deep binding of identifiers. This paper studies the problems and techniques in storage management for PASCAL on the IBM 370 system, and presents run-time storage administration algorithms which use stack scheme and heap efficiently on the view of storage. The stack-scheme was used to implement the feature of recursive nested structure and the heap was used to implement the feature of the dynamic allocation procedure and pointer variable, allowing an additional dynamic storage recovery procedure.

  • PDF

다중 서비스 클래스를 제공하는 네트워크 운영자를 위한 우선순위 기반의 동적 스펙트럼 할당 알고리즘 (A Priority based Dynamic Spectrum Allocation Algorithm for Multiple Network Operators Supporting Multiple Service Classes)

  • 김훈;주양익;윤상보;이연우
    • 한국통신학회논문지
    • /
    • 제33권1A호
    • /
    • pp.59-66
    • /
    • 2008
  • 지금까지 연구된 대부분의 동적 스펙트럼 할당(DSA) 방식들은 서로 다른 네트워크을 운영하는 다중 네트워크 운영자(network operators: NOs)들 간의 시간적으로 또는 공간적으로 변화하는 트래픽 요구 변화량에 따라서 기대할 수 있는 동적 스펙트럼 할당방식의 이득에 대한 것이었다. 본 논문에서는 스펙트럼 공유(sharing)와 할당과 연계된 기능적 엔티티(entities)에 대해서 소개하고, 다중 네트워크 운영자들 간의 장기간(long-term)의 우선순위(priority), 다중 서비스 클래스간의 우선순위 및 긴급 대역폭 요구(bandwidth request) 등을 고려한 스펙트럼 할당 알고리즘을 제안한다. 제안한 우선순위 기반의 DSA 알고리즘은 네트워크 운영자간의 각기 다른 다중 서비스 클래스의 트래픽 패턴에 대해서 기존의 고정 스펙트럼 할당방식에 비해 우수한 사용자들의 만족율(satisfaction ratio: SR)을 제공함을 보였다. 따라서 제안한 알고리즘은 다중 네트워크 운영자간의 서비스 클래스에 대한 공평성(fairness)을 제공함과 동시에 사용자들의 대역폭 요구(bandwidth request)에 대해서 효율적인 타협(negotiation) 과정을 제공할 수 있다.

경쟁적 전력시장에서 발전기 증감발률을 고려한 다중시간 발전량 배분 게임 (Multi-Stage Generation Allocation Game Considering Ramp-rate Constraints)

  • 박용기;박종배;노재형;김형중;신중린
    • 전기학회논문지
    • /
    • 제60권3호
    • /
    • pp.509-516
    • /
    • 2011
  • This paper studies a novel method to find the profit-maximizing Nash Equilibriums in allocating generation quantities with consideration of ramp-rates under competitive market environment. Each GenCo in a market participates in a game to maximize its profit through competitions and play a game with bidding strategies. In order to find the Nash equilibriums it is necessary to search the feasible combinations of GenCos' strategies which satisfy every participant's profit and no one wants various constraints. During the procedure to find Nash equilibriums, the payoff matrix can be simplified as eliminating the dominated strategies. in each time interval. Because of the ramp-rate, generator's physically or technically limits to increase or decrease outputs in its range, it can restrict the number of bidding strategies of each generator at the next stage. So in this paper, we found the Nash Equilibriums for multi-stage generation allocation game considering the ramp-rate limits of generators. In the case studies, we analyzed the generation allocation game for a 12-hour multi-stage and compared it with the results of dynamic economic dispatch. Both of the two cases were considered generator's ramp-rate effects.

한국 침 임상시험의 질 평가 및 분석 (Assessing Methodological Quality of Acupuncture Clinical Trials of Korea)

  • 박지은;강경원;최선미
    • Journal of Acupuncture Research
    • /
    • 제24권1호
    • /
    • pp.127-135
    • /
    • 2007
  • Objectives: To evaluate the methodological quality of Korean Acupuncture Clinical trials Methods : Two independent researchers reviewed 12 protocols of Acupuncture clinical trials which were conducted in Korea 2006. Also, Survey Principal Investigator of those was conducted. We compare the results of protocol review with investigator reponses of actual practice. Quality assessment consisted of 5 items including random sequence generation, randomization method, allocation concealment, subject blinding, assessor blinding. Results : Randomization was performed using the proper procedure to insure that treatment assignment is unbiased and concealed from subjects in all clinical trials, According to protocols, 6(50%) of 12 clinical trials used computer-generated random numbers, 6(50%) remaining trials didn't describe the randomization method. Also all trials used appropriate randomization methods on the basis of the survey results: 8 trials used computer-generated random number, 2 used random table. Of 7 protocols in which allocation concealment was stated, 5(71%) reported appropriate method (Calling a central office or statisticians, Sealed opaque envelopes). However according to survey, 5(42%) of 12 trials used inappropriate allocation concealment (Keeping a master randomization list and referring to when subject entered the trial). In addition, the result of protocol review and survey response was not coincident in 5(42%) trials. Subject blinding was conducted in all except 1 clinical trials. Although 11(92%) of 12 trials were conducted using assessor blinding in actual practice, only 7(58%) reported that in protocol. Conclusion : Although randomization and blinding were conducted adequately, allocation concealment was used inadequately, Not only appropriate allocation concealment, but also every quality assessment item including randomization, blinding should be stated in more detail in protocol.

  • PDF

A Case Study of a Resource Reservation Protocol in IP Based Wireless Access Networks for ITS Service

  • Jung Kwang Mo;Jung Hyun Chul;Min Sang Won
    • 한국ITS학회 논문지
    • /
    • 제4권1호
    • /
    • pp.107-115
    • /
    • 2005
  • For effective IP based service implementation on the wireless network environments, wireless network including the ITS network have to support QoS guaranteed protocol such as a RSVP. RSVP is a resource reservation protocol for Internet environment, and its scalability makes easy to implement RSVP over the various IP transport technologies. But for the If based ITS wireless network environment, RSVP is not suitable, since by its path setup procedure characteristic. In the wireless access network for ITS service, when a mobile node moves to other domain it must perform registration procedure. But the registration procedure is time consuming steps, so if a RSVP session was already established in the previous domain, the RSYP session may be disconnected and the time to re establish a new RSVP session is long enough to cause serious packet loss. In this paper, we propose a pre-path reservation mechanism for applying the RSVP in wireless access networks for ITS. In the pre-path reservation mechanism, the resource reservation procedure occurred during a mobile node's handoff time. An access point in wireless access network performs this procedure when the mobile node attempts handoff The access point executes pre-path reservation procedure as a proxy, since the mobile node does not have IP address until the address allocation procedure is finished in a new domain.

  • PDF

5-6세 아동의 분배 결정에 내집단 선호가 미치는 영향 (The influence of in-group favoritism on 5 to 6-year-olds' resource-allocation decisions)

  • 차민정;송현주
    • 인지과학
    • /
    • 제26권2호
    • /
    • pp.241-261
    • /
    • 2015
  • 본 연구에서는 만 5-6세 아동들의 타인-타인 또는 자신-타인 간 자원 분배 결정에 수혜자의 소속집단(내집단 대 외집단)이 영향을 미치는지를 검증하였다. 실험 1에서는 아동이 자원 분배의 수혜자가 되지 않고 친구(내집단)와 낯선 아동(외집단)에게 스티커를 나누어주는 분배자의 역할만을 수행한 게임을 진행하였다. 이 때 아동은 낯선 아동보다 친구에게 더 많은 스티커를 나누어주었고, 이는 아동 자신이 분배의 이해 당사자가 아닌 경우에는 내집단에게 더 호의적으로 분배를 한다는 것을 보여주었다. 실험 2에서 아동은 상대방이 친구 혹은 낯선 아동인 상황에서 자기 자신과 상대방에게 스티커 10개를 분배하는 게임에 참여하였다. 이러한 자기-타인 분배 상황에서 아동들은 상대방이 내집단 또는 외집단 구성원인지에 관계없이 이기적인 분배를 하는 양상을 보였다. 이는 자기 자신이 자원 분배의 당사자가 되었을 경우에는 내집단을 선호하는 경향성을 나타내지 않았음을 보여주었다. 본 연구는 기존 성인 연구에서 관찰되어온 자원 분배 행동에서의 내집단 편향의 발달 과정에 대한 추가 자료를 제공한다.