• 제목/요약/키워드: ordered set

검색결과 162건 처리시간 0.028초

Ordered Logit Model을 이용한 보행자 사고 심각도 요인 분석 (Severity Analysis of the Pedestrian Crash Patterns Based on the Ordered Logit Model)

  • 최재성;김상엽;황경성;백승엽
    • 한국도로학회논문집
    • /
    • 제11권1호
    • /
    • pp.153-164
    • /
    • 2009
  • 본 연구에서는 경찰청에서 제공한 2006년 전국 37,589개의 보행자 사고 자료에서 나타난 보행자 사고 심각도를 분석했다. 이를 위해 본 연구에서는 보행자사고 심각도에 영향을 미칠 것으로 예상되는 주요 요인을 미리 선정하여, 그 영향을 순서형 로짓 모형(Ordered Logit Model)을 통해 분석했다. 이모형은 사고 심각도와 같이 종속변수가 순서형으로 표시되는 경우 매우 유용한 결과를 제시하는 것으로 알려져 있어서 본 연구에서 사용했다. 본 연구는 다음과 같은 결과를 나타냈다. 첫째, 우리나라 보행자 사고 심각도는 운전자와 보행자로 나타나는 인적요인에서 성별, 나이, 음주여부에 영향을 많이 받는다. 둘째, 기타 요인에는 차량, 도로기하구조, 날씨, 시간대가 포함된다. 셋째, 보행자 사고 심각도는 계절요인과 무관하다. 끝으로, 보행자 사고 심각도 분석을 위해 순서형 로짓 모형을 적용하면 매우 적절한 분석결과를 얻을 수 있다. 결론적으로 본 연구는 우리나라 보행자 사고 심각도는 사람들이 전통적으로 생각하는 것과 같은 방식인 것으로 확인했다. 이 결론은 본 연구에서 사용한 사고자료에 국한한 것이며, 이 결론을 일반화시키려면 추후 연구가 필요하다.

  • PDF

A RESOLVENT APPROACH FOR SOLVING A SET-VALUED VARIATIONAL INCLUSION PROBLEM USING WEAK-RRD SET-VALUED MAPPING

  • Ahmad, Iqbal;Ahmad, Rais;Iqbal, Javid
    • Korean Journal of Mathematics
    • /
    • 제24권2호
    • /
    • pp.199-213
    • /
    • 2016
  • The resolvent operator approach of [2] is applied to solve a set-valued variational inclusion problem in ordered Hilbert spaces. The resolvent operator under consideration is called relaxed resolvent operator and we demonstrate some of its properties. To obtain the solution of a set-valued variational inclusion problem, an iterative algorithm is developed and weak-RRD set-valued mapping is used. The problem as well as main result of this paper are more general than many previous problems and results available in the literature.

의사 랜덤치환을 이용한 다중레벨 키분배 (A Multilevel Key Distribution using Pseudo - random Permutations)

  • 김주석;신원;이경현
    • 한국정보처리학회논문지
    • /
    • 제4권10호
    • /
    • pp.2493-2500
    • /
    • 1997
  • 대칭키 관리 시스템에서 계층적 구조를 지닌 다중 사용자 그룹에 대한 새로운 키관리 방안을 제안한다. 제안된 방식은 의사 랜덤치환에 의해 새성되는 트랩도어 일방향 치환을 이용하며, 구현시 시간과 공간적 측면에서 유리하기 때문에, 완전순서 집합과 부분순서가 있는 집합으로 구성되는 다단계 계층적 구조에 사용 가능하다. 또한, 다른 제안 방식과 비교하여 성능을 분석하고, 제안 방식이 키생성 시간과 키저장 크기에서 보다 효율적인 것을 보인다.

  • PDF

Bivariate Ordered Probit 모형을 이용한 미국 농업의 다원적 기능에 대한 소비자 인식분석 (Assessing Public Attitude for Multifunctional Roles of the U.S. Agriculture Using a Bivariate Ordered Probit Model)

  • 한정희;문완기;조용성
    • 한국유기농업학회지
    • /
    • 제17권4호
    • /
    • pp.413-439
    • /
    • 2009
  • This study conducts a survey and test to understand U.S. public's perception about multifunctionality. The questionnaire suggests seven alternative way of providing questions about intangible benefits provided by agriculture in the U.S. The final questionnaire was administered as an e-mail survey in June 2008 to a nationally representative household panel maintained in the U.S. by the Ipsos Observer. Data analysis shows that 64 percent of respondents considered the multifunctionality of agriculiture as an important issue and 45 percent of respondents were in favor of increasing government expenditure to support farmland preservation. Using Fishbein's multi-attribute model as a theoretical background, this paper develops an empirical model to assess and attributes of multifunctionality. For the analysis, bivariate orderd probit model was set up to reflect respondent's attitude. Regression analyses show that two questions (how much you agree with agriculture's intangible benefit and increasing government expenditure to support agriculture) are shaped by different sets of facts.

  • PDF

고속도로 오르막차로 교통사고 심각도 영향요인 분석 (Analysis of Factors Affecting Traffic Accident Severity on Freeway Climbing Lanes)

  • 윤석민;주신혜;이설영;오철
    • 한국도로학회논문집
    • /
    • 제17권6호
    • /
    • pp.85-95
    • /
    • 2015
  • PURPOSES : The objective of this study is to analyze factors affecting traffic accident severity for determining countermeasures on freeway climbing lanes. METHODS : In this study, an ordered probit model, which is a widely used discrete choice model for categorizing crash severity, was employed. RESULTS : Results suggest that factors affecting traffic accident severity on climbing lanes include speed, drowsy driving, grade of uphill 3%, gender (male offender and male victim), and cloud weather. CONCLUSIONS : Several countermeasures are proposed for improving traffic safety on freeway climbing lanes based on the analysis of crash severity. More extensive analysis with a larger data set and various modeling techniques are required for generalizing the results.

Families of Distributions Arising from Distributions of Ordered Data

  • Ahmadi, Mosayeb;Razmkhah, M.;Mohtashami Borzadaran, G.R.
    • Communications for Statistical Applications and Methods
    • /
    • 제22권2호
    • /
    • pp.105-120
    • /
    • 2015
  • A large family of distributions arising from distributions of ordered data is proposed which contains other models studied in the literature. This extension subsume many cases of weighted random variables such as order statistics, records, k-records and many others in variety. Such a distribution can be used for modeling data which are not identical in distribution. Some properties of the theoretical model such as moment, mean deviation, entropy criteria, symmetry and unimodality are derived. The proposed model also studies the problem of parameter estimation and derives maximum likelihood estimators in a weighted gamma distribution. Finally, it will be shown that the proposed model is the best among the previously introduced distributions for modeling a real data set.

Min-Max Regret Version of an m-Machine Ordered Flow Shop with Uncertain Processing Times

  • Park, Myoung-Ju;Choi, Byung-Cheon
    • Management Science and Financial Engineering
    • /
    • 제21권1호
    • /
    • pp.1-9
    • /
    • 2015
  • We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NP-hard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.

Fuzzzy Functions and Fuzzy Partially Ordered Sets

  • Hur, Kul;Jung, Hyo-Mi;Lee, Wang-Ro
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제9권4호
    • /
    • pp.285-293
    • /
    • 2009
  • By using the notion of fuzzy functions introduced by Dib and Youssef, we obtain fuzzy analogues of some results concerning ordinary functions. In particular, we give the denition dierent from one of invertible fuzzy function introduced by Dib and Youssef. And we show that the two denitions are equivalent. Furthermore, we introduce the concepts of fuzzy increasing functions and fuzzy isomorphisms, and we obtain fuzzy analogues of many results concerning ordinary increasing functions and isomorphisms.

On the Metric Dimension of Corona Product of a Graph with K1

  • Mohsen Jannesari
    • Kyungpook Mathematical Journal
    • /
    • 제63권1호
    • /
    • pp.123-129
    • /
    • 2023
  • For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w1), d(v, w2), . . . , d(v, wk)) is called the metric representation of v with respect to W, where d(x, y) is the distance between the vertices x and y. A set W is called a resolving set for G if distinct vertices of G have distinct metric representations with respect to W. The minimum cardinality of a resolving set for G is its metric dimension dim(G), and a resolving set of minimum cardinality is a basis of G. The corona product, G ⊙ H of graphs G and H is obtained by taking one copy of G and n(G) copies of H, and by joining each vertex of the ith copy of H to the ith vertex of G. In this paper, we obtain bounds for dim(G ⊙ K1), characterize all graphs G with dim(G ⊙ K1) = dim(G), and prove that dim(G ⊙ K1) = n - 1 if and only if G is the complete graph Kn or the star graph K1,n-1.