• Title/Summary/Keyword: Route Choice

Search Result 161, Processing Time 0.031 seconds

Technical Consideration for Coiling of Ruptured Proximal Posterior Inferior Cerebellar Artery Aneurysm

  • Kim, Jong Hoon;Jeon, Ik Chan;Chang, Chul Hoon;Jung, Young Jin
    • Journal of Korean Neurosurgical Society
    • /
    • v.61 no.5
    • /
    • pp.653-659
    • /
    • 2018
  • Objective : Surgical obliteration of ruptured aneurysm of the proximal posterior inferior cerebellar artery (PICA) is challenging because of limited surgical accessibility. In recent years, coil embolization is the first-choice treatment for these lesions. However, coil embolization is not always easy in ruptured PICA aneurysm owing to the variable anatomical diversity of its shapes, its relationship to the parent artery, its low incidence, and accordingly, lesser neurointerventionist experience. Methods : The parent artery and microcatheter for easier navigation and the embolization technique for stable coiling were identified. Results : This study aimed to identify the more appropriate approach route, microcatheter, and strategies for an easier and safer, and more durable coil embolization in the treatment of lesions in the proximal PICA. Conclusion : Coil embolization for aneurysmal subarachnoid hemorrhage due to a ruptured proximal PICA remains a challenge, but with the appropriate coiling plan, it can be treated successfully.

Route Choice and Diversion Behavior Models of the Drivers Commuting to a University (대학출근운전자의 노선선택 및 전환행태 모형)

  • 김경환;김태형;서현열
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.3
    • /
    • pp.87-100
    • /
    • 2000
  • 각 지역특성에 맞는 ATIS사업이 실현되기 위해서는 각 지역 통행자들의 노선선택 및 전환행태를 정확히 파악하는 것이 필요하다. 이에 본 연구에서는 경상대를 연구대상으로 하여 대학출근운전자들의 노선선택 및 전환 행태를 정확히 파악하고 이들을 모형화하였다. 본 연구 대상지의 경우, 2개의 주 출근노선이 있으며 하나는 시내통행노선(노선 1)이고 다른 하나는 시외곽 통행노선(노선 2)이다. 노선1은 노선2에 비해 연장은 짧은 반면에 통행시간은 길며 신호교차로수. 우회전수도 많다. 먼저, 운전자의 노선선택행태모형을 통해 해석된 결과를 보면 시내노선에 대한 외곽노선의 상대적 효용이 아주 높으며, 전체적으로 출근운전자들은 짧은 통행시간을 선호하는 것으로 나타났다. 또한, 출근소요시간이 길고 라디오정보의 이용빈도가 높을수록 시내노선을 이용할 확률이 크며, 반면에 남성과 교직원인 운전자는 외곽노선을 이용할 확률이 큰 것으로 나타났다. 다음으로 행태조사에 기초한 노선전환행태모형을 통해 해석된 결과를 보면 연령, 출근시간, 라디오정보의 이용빈도들이 전환성향에 유의한 영향을 가져오는 것으로 분석되었다. 가상의 교통정보제공시의 운전자의 노선전환을 모형화한 노선전환의사모형에서는 대개의 정보에 대해 운전자가 노선전환을 하는 것으로 나타났다. 이 모형에서 지체길이에 따른 전환경향을 보면 지체의 길이가 길수록 전환경향이 높아 30분정도의 지체길이에서는 반드시 변경하는 것으로 나타났다. 본 연구대상 운전자의 경우 전반적으로 기술적인 유고(Incident)정보보다는 정량적인 지체정보에 더 민감한 것으로 나타났다.

  • PDF

An Analysis about Awareness of Use in Space on Variation Type in Middle School According to the Type of Management for Homebase (거점공간 운영방식 차이에 따른 교과교실형 중학교 공간 이용의식 분석)

  • Jeong, Joo-Seong
    • Journal of the Korean Institute of Educational Facilities
    • /
    • v.23 no.6
    • /
    • pp.19-26
    • /
    • 2016
  • In this study, moving awareness of students having different physical conditions in homebase and attitudes of students to spacial use in user's aspect were analyzed. As shown in the results, the dissatisfaction degree of the second grade using homebase type was higher than the first and the third grades using exclusive space for a class, homeroom type. The necessity of exclusive space for a class was highly shown in the second grade students. Students of the first and the third grades showed similar pattern in using frequency of homeroom. The results showed that behavior pattern of students was different with their physical conditions. Especially, factors showing obvious differences between the two groups were possession awareness of their belongings, tendency to route choice of high frequency, stay awareness of main stay in time to rest and point of time using restroom. These results will be useful to design various models in variation type of schools.

The Design of Optimal Fuzzy-Neural networks Structure by Means of GA and an Aggregate Weighted Performance Index (유전자 알고리즘과 합성 성능지수에 의한 최적 퍼지-뉴럴 네트워크 구조의 설계)

  • Oh, Sung-Kwun;Yoon, Ki-Chan;Kim, Hyun-Ki
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.3
    • /
    • pp.273-283
    • /
    • 2000
  • In this paper we suggest an optimal design method of Fuzzy-Neural Networks(FNN) model for complex and nonlinear systems. The FNNs use the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM(Hard C-Means) Clustering Algorithm to find initial parameters of the membership function. The parameters such as parameters of membership functions learning rates and momentum weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. According to selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity (distribution of I/O data we show that it is available and effective to design and optimal FNN model structure with a mutual balance and dependency between approximation and generalization abilities. This methodology sheds light on the role and impact of different parameters of the model on its performance (especially the mapping and predicting capabilities of the rule based computing). To evaluate the performance of the proposed model we use the time series data for gas furnace the data of sewage treatment process and traffic route choice process.

  • PDF

Development of A System Optimum Traffic Control Strategy with Cell Transmission Model (Cell Transmission 이론에 근거한 시스템최적 신호시간산정)

  • 이광훈;신성일
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.5
    • /
    • pp.193-206
    • /
    • 2002
  • A signal optimization model is proposed by applying the Cell-Transmission Model(CTM) as an embedded traffic flow model to estimate a system-optimal signal timing plan in a transportation network composed of signalized intersections. Beyond the existing signal-optimization models, the CTM provides appropriate theoretical and practical backgrounds to simulate oversaturation phenomena such as shockwave, queue length, and spillback. The model is formulated on the Mixed-Integer Programming(MIP) theory. The proposed model implies a system-optimal in a sense that traffic demand and signal system cooperate to minimize the traffic network cost: the demand departing from origins through route choice behavior until arriving at destinations and the signal system by calculating optimal signal timings considering the movement of these demand. The potential of model's practical application is demonstrated through a comparison study of two signal control strategies: optimal and fixed signal controls.

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • v.15 no.1
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

Anesthesia for the Experimental Rats (실험용 쥐의 마취)

  • Choi, Hee-Rack;Ko, Jong-Hyun;Lee, Hae Beom;Lee, Jun-Mo
    • Archives of Reconstructive Microsurgery
    • /
    • v.22 no.1
    • /
    • pp.1-6
    • /
    • 2013
  • Rats and mice are commonly used in experimental laboratories and anesthetic drugs are important for researchers to understand the details. Administration of fluids helps to stabilize the experimental animals before anesthesia via intravenously through the lateral vein in rats and in case of difficulty in catheterization and maintenance, fluids are usually administered as boluses. Large volumes of cool fluids will rapidly lead to hypothermia and all parenteral fluids must be warmed to body temperature before administration. Premedication with a sedative may ease induction with volatile anesthetic drugs. The first choice for rodent anesthesia is complete inhalational anesthesia. The second option is using injectable anesthesia. Recovery from the volatile agents that have been used rapid when the agent is no longer administered. Anesthetic monitoring equipment is an infant-size bell sthethoscope that can be used to ausculate the heart and lungs. Supplemental heating should be provided to reduce the heat loss supply and maintain core body temperature. The kinds of drugs, characteristics, route of administration and care after surgery were reviewed and summarized from the references. Anesthetic drugs, maintenance, monitoring and aftercare are important in the laboratories to keep the animal safe in all experimental procedures.

  • PDF

Dynamic Model Considering the Biases in SP Panel data (SP 패널데이터의 Bias를 고려한 동적모델)

  • 남궁문;성수련;최기주;이백진
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.6
    • /
    • pp.63-75
    • /
    • 2000
  • Stated Preference (SP) data has been regarded as more useful than Revealed Preference (RP) data, because researchers can investigate the respondents\` Preference and attitude for a traffic condition or a new traffic system by using the SP data. However, the SP data has two bias: the first one is the bias inherent in SP data and the latter one is the attrition bias in SP panel data. If the biases do not corrected, the choice model using SP data may predict a erroneous future demand. In this Paper, six route choice models are constructed to deal with the SP biases, and. these six models are classified into cross-sectional models (model I∼IH) and dynamic models (model IV∼VI) From the six models. some remarkable results are obtained. The cross-sectional model that incorporate RP choice results of responders with SP cross-sectional model can correct the biases inherent in SP data, and also the dynamic models can consider the temporal variations of the effectiveness of state dependence in SP responses by assuming a simple exponential function of the state dependence. WESML method that use the estimated attrition probability is also adopted to correct the attrition bias in SP Panel data. The results can be contributed to the dynamic modeling of SP Panel data and also useful to predict more exact demand.

  • PDF

Adaptive Partitioning of the Global Key Pool Method using Fuzzy Logic for Resilience in Statistical En-Route Filtering (통계적 여과기법에서 훼손 허용도를 위한 퍼지 로직을 사용한 적응형 전역 키 풀 분할 기법)

  • Kim, Sang-Ryul;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.4
    • /
    • pp.57-65
    • /
    • 2007
  • In many sensor network applications, sensor nodes are deployed in open environments, and hence are vulnerable to physical attacks, potentially compromising the node's cryptographic keys. False sensing report can be injected through compromised nodes, which can lead to not only false alarms but also the depletion of limited energy resource in battery powered networks. Fan Ye et al. proposed that statistical en-route filtering scheme(SEF) can do verify the false report during the forwarding process. In this scheme, the choice of a partition value represents a trade off between resilience and energy where the partition value is the total number of partitions which global key pool is divided. If every partition are compromised by an adversary, SEF disables the filtering capability. Also, when an adversary has compromised a very small portion of keys in every partition, the remaining uncompromised keys which take a large portion of the total cannot be used to filter false reports. We propose a fuzzy-based adaptive partitioning method in which a global key pool is adaptively divided into multiple partitions by a fuzzy rule-based system. The fuzzy logic determines a partition value by considering the number of compromised partitions, the energy and density of all nodes. The fuzzy based partition value can conserve energy, while it provides sufficient resilience.

  • PDF

K-th Path Search Algorithms with the Link Label Correcting (링크표지갱신 다수경로탐색 알고리즘)

  • Lee, Mee-Young;Baik, Nam-Cheol;Choi, Dae-Soon;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.131-143
    • /
    • 2004
  • Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.