• The Pure and Applied Mathematics
• /
• v.31 no.2
• /
• pp.159-178
• /
• 2024

We continue the investigations in [7] extending the Bruhat order on n × n alternating sign matrices to a more general setting. We show that the resulting partially ordered set is a lattice and also investigate its rank.

• International Journal of Highway Engineering
• /
• v.11 no.1
• /
• pp.153-164
• /
• 2009

This Paper presents the severity analysis result of the year 2006 national pedestrian crashes using the data base of 37,589 records prepared for the National Police Bureau. A set of attributing factors considered to affect pedestrian crash patterns were selected, and their contributing effects were investigated by applying the Ordered Logit Model. This model was selected because this model has been able to afford satisfactory results when the dependent variable involved ordered severity levels; fatal, injury, and property- damage-only in this investigation. The investigation has unveiled the followings; First, the pedestrian crash patterns were dependent upon human -drivel and pedestrian- characteristics including gender, age, and drinking conditions. Second, other contributing factors included vehicle, roadway geometric, weather, and hour of day characteristics. Third, seasonal effect was not contributive to crash patterns. Finally, the application of the Ordered Logit Model facilitated the ordered severity level analysis of the pedestrian crash data. This paper concludes that conventional wisdom on the pedestrian crash characteristics is largely truthful. However, this conclusion is limited only to the data used in this analysis, and further research is required for its generalization.

• Korean Journal of Mathematics
• /
• v.24 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2493-2500
• /
• 1997

We propose a new key management scheme for multiuser group which is classified as hierarchical structure (sometimes it is called a multilevel security hierarchy) in the symmetric key cryptosystem. The proposed scheme is based on the trapdoor one-way permutations which are generated by the pseudo-random permutation algorithm, and it is avaliable for multilevel hierarchical structure composed of a totally ordered set and a partially ordered set, since it has advantage for time and storage from an implemental point of view. Moreover, we obtain a performance analysis by comparing with the other scheme, and show that the proposed scheme is very efficient for computing time of key generation and memory size of key storage.

• Korean Journal of Organic Agriculture
• /
• v.17 no.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.

• International Journal of Highway Engineering
• /
• v.17 no.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.

• Communications for Statistical Applications and Methods
• /
• v.22 no.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.

• Management Science and Financial Engineering
• /
• v.21 no.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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.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.

• Kyungpook Mathematical Journal
• /
• v.63 no.1
• /
• pp.123-129
• /
• 2023

For an ordered set W = {w₁, w₂, . . . , w_k} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w₁), d(v, w₂), . . . , d(v, w_k)) 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 ⊙ K₁), characterize all graphs G with dim(G ⊙ K₁) = dim(G), and prove that dim(G ⊙ K₁) = n - 1 if and only if G is the complete graph K_n or the star graph K_1,n-1.