• 대한수학회보
• /
• 제53권5호
• /
• pp.1471-1481
• /
• 2016

We characterize reducing subspaces of weighted shifts with operator weights as wandering invariant subspaces of the shifts with additional structures. We show how some earlier results on reducing subspaces of powers of weighted shifts with scalar weights on the unit disk and the polydisk can be fitted into our general framework.

• 한국지능시스템학회논문지
• /
• 제19권2호
• /
• pp.273-278
• /
• 2009

The determination of the associated weights in the theory of ordered weighted averaging (OWA) operators is one of the important issue. Recently, Wang and Parkan [Information Sciences 175 (2005) 20-29] proposed a minimax disparity approach for obtaining OWA operator weights and the approach is based on the solution of a linear program (LP) model for a given degree of orness. Recently, Liu [International Journal of Approximate Reasoning, accepted] showed that the minimum variance OWA problem of Fuller and Majlender [Fuzzy Sets and Systems 136 (2003) 203-215] and the minimax disparity OWA problem of Wang and Parkan always produce the same weight vector using the dual theory of linear programming. In this paper, we give an improved proof of the minimax disparity problem of Wang and Parkan while Liu's method is rather complicated. Our method gives the exact optimum solution of OWA operator weights for all levels of orness, $0\leq\alpha\leq1$, whose values are piecewise linear and continuous functions of $\alpha$.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1788-1792
• /
• 2006

The ordered weighted averaging (OWA) operator by Yager has received more and more attention since its appearance. One key point in the OWA operator is to determine its associated weights. Among numerous methods that have appeared in the literature, we notice the maximum entropy OWA (MEOWA) weights that are determined by taking into account two appealing measures characterizing the OWA weights. Instead of maximizing the entropy in the formulation for determining the MEOWA weights, the new method in the article tries to obtain the OWA weights which are evenly spread out around equal weights as much as possible while strictly satisfying the orness value provided in the program. This consideration leads to the least squared OWA (LSOWA) weighting method in which the program tries to obtain the weights that minimize the sum of deviations from the equal weights since entropy is maximized when the weights are equal. Above all, the LSOWA weights display symmetric allocations of weights on the basis of equal weights. The positive or negative allocations of weights from the median as a basis depend on the magnitude of orness specified. Further interval LSOWA weights are constructed when a decision-maker specifies his or her value of orness in uncertain numerical bounds.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.499-505
• /
• 2006

In this note, we give an elementary simple new proof of the main result of $Full{\acute{e}}r$ and Majlender [Fuzzy Sets and systems 136 (2003) 203-215] concerning obtaining minimal variability OWA operator weights.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.537-541
• /
• 2006

In this note, we give an elementary simple proof of the main result of $Full{\acute{e}}rand$ Majlender [Fuzzy Sets and systems 124(2001) 53-57] concerning obtaining maximal entropy OWA operator weights.

• Asia pacific journal of information systems
• /
• 제16권1호
• /
• pp.85-101
• /
• 2006

Actual type of aggregation performed by an ordered weighted averaging (OWA) operator heavily depends upon the weighting vector. A number of approaches have been suggested for obtaining the associated weights. In this paper, we present analytic forms of OWA operator weighting functions, each of which has such properties as rank-based weights and constant value of orness, irrespective of number of objectives aggregated. Specifically, we propose four analytic forms of OWA weighting functions that can be positioned at 0.25, 0.334, 0.667, and 0.75 on the orness scale. The merits for using these weights over other weighting schemes can be mentioned in a couple of ways. Firstiy, we can efficiently utilize the analytic forms of weighting functions without solving complicated mathematical programs once the degree of orness is specified a priori by decision maker. Secondly, combined with well-known OWA operator weights such as max, min, and average, any weighting vectors, having a desired value of orness and being independent of the number of objectives, can be generated. This can be accomplished by convex combinations of predetermined weighting functions having constant values of orness. Finally, in terms of a measure of dispersion, newly generated weighting vectors show just a few discrepancies with weights generated by maximum entropy OWA.

• 대한수학회보
• /
• 제61권4호
• /
• pp.875-895
• /
• 2024

In this paper, we completely characterize the Schatten classes of composition operators on the Dirichlet type spaces with superharmonic weights. Our investigation is basced on building a bridge between the Schatten classes of composition operators on the weighted Dirichlet type spaces and Toeplitz operators on weighted Bergman spaces.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.338-341
• /
• 2005

In this paper, we present analytic forms of the ordered weighted averaging (OWA) operator weighting functions, each of which has properties of rank-based weights and a constant level of orness, irrespective of the number of objectives considered. These analytic forms provide significant advantages for generating OWA weights over previously reported methods. First, OWA weights can be efficiently generated by use of proposed weighting functions without solving a complicated mathematical program. Moreover, convex combinations of these specific OWA operators can be used to generate OWA operators with any predefined values of orness once specific values of orness are α priori stated by decision maker. Those weights have a property of constant level of orness as well. Finally, OWA weights generated at a predefined value of orness make almost no numerical difference with maximum entropy OWA weights in terms of dispersion.

• East Asian mathematical journal
• /
• 제23권1호
• /
• pp.37-43
• /
• 2007

We study a maximal operator defined on spaces of homogeneous type, and we prove that this operator is of weak type (1,1). As a consequence we show that the maximal operator belongs to the Muckenhoupt's class $A_1$.

• Communications for Statistical Applications and Methods
• /
• 제19권3호
• /
• pp.359-365
• /
• 2012

The fuzzy set framework has a number of properties that make it suitable to formulize uncertain information in medical diagnosis. This study introduces a fuzzy diagnostic method based on the interval-valued interview chart and the interval-valued intuitionistic fuzzy weighted arithmetic average(IIFWAA) operator. An issue in the use of the IIFWAA operator is to determine the weights. In this study, we propose the occurrence information of symptoms as the weights. An illustrative example is provided to demonstrate its practicality and effectiveness.