• Title/Summary/Keyword: The ordered systems

Search Result 234, Processing Time 0.026 seconds

The Ordered Weighted Averaging (OWA) Operator Weighting Functions with Constant Value of Orness and Application to the Multiple Criteria Decision Making Problems (순위가 있는 가중치 평균 방법에서 일정한 수준의 결합력을 갖는 가중치 함수의 성질 및 다기준의사결정 문제에의 활용)

  • Ahn, Byeong-Seok
    • Asia pacific journal of information systems
    • /
    • v.16 no.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.

Block-Ordered Layered Detector for MIMO-STBC Using Joint Eigen-Beamformers and Ad-Hoc Power Discrimination Scheme

  • Lee Won-Cheol
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.275-285
    • /
    • 2006
  • Suitable for multi-input multi-output (MIMO) communications, the joint beamforming space-time block coding (JBSTBC) scheme is proposed for high-speed downlink transmission. The major functionality of the scheme entails space-time block encoder and joint transmit and receive eigen-beamformer (EBF) incorporating with block-ordered layered decoder (BOLD), and its operating principle is described in this paper. Within these functionalities, the joint EBFs will be utilized for decorrelating fading channels to cause an enhancement in the spatial diversity gain. Furthermore, to fortify the capability of layered successive interference cancellation (LSIC) in block-ordered layered decoding process, this paper will develop a simple ad-hoc transmit power discrimination scheme (TPDS) based on a particular power discrimination function (PDF). To confirm the superior behavior of the proposed JBSTBC scheme employing ad-hoc TPDS, computer simulations will be conducted under various channel conditions with the provision of detailed mathematical derivations for clarifying its functionality.

Block-Ordered Layered Detector for MIMO-STBC Combined with Transmit and Receive Eigen-Beamformers (MIMO-STBC를 위한 송수신 고유빔 형성기를 이용한 블록순 계층적 검파기)

  • 이원철;김홍철
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.10
    • /
    • pp.17-26
    • /
    • 2004
  • This paper proposes JBSTBC (Joint Beamforming Space-Time Block Coding) scheme for MIMO (Multi-Input Multi-Output) communication systems. To enhance the order of spatial diversity in presence of deteriorative fading correlations as well as inter-substream interferences, the proposed JBSTBC method employs joint eigen-beamforming technique together with the BOLD (block-ordered layered detector) for MIMO-STBC. In order to confirm superiority of the proposed JBSTBC method, the computer simulations are conducted in highly correlated fading situations with providing detailed mathematical derivations for clarifying functionality of the proposed scheme.

A Study on Comparison with the Methods of Ordered Categorical Data of Analysis (순서 범주형 자료해석법의 비교 연구)

  • 김홍준;송서일
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.44
    • /
    • pp.207-215
    • /
    • 1997
  • This paper deals with a comparison between Taguchi's accumulation analysis method and Nair test on the ordered categorical data from an industrial experiment for quality improvement. a result of Taguchi's accumulation analysis method is shown to have reasonable power for detecting location effects, while Nair test identifies the location and dispersion effects separately, Accordingly, Taguchi's accumulation analysis needs to develop methods for detecting dispersion effects as well as location effects. In addition this paper rewmmends models for analyzing ordered categorical data, for examples, the cumulative legit model, mean response model etc Successively simple, reasonable methods should be introduced more likely to be used by the practitioners.

  • PDF

Processing-Node Status-based Message Scattering and Gathering for Multi-processor Systems on Chip

  • Park, Jongsu
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.4
    • /
    • pp.279-284
    • /
    • 2019
  • This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

A Design for Optimal Models of Inventory-Distribution System with Back-Ordered Case (부재고를 갖는 재고.수송시스템의 최적모형설계)

  • 우태희;조남호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.43
    • /
    • pp.25-36
    • /
    • 1997
  • The purpose of this paper is to structure a new integrated model that can minimize the total cost for the transportation and inventory systems between m origin points, where origin i has a supply of a commodity, such as distribution centers or warehouses, and n destination points, where destination j requires the commodity. In this case, demands of the destination points are assumed random variables which have a known probability distribution. We will find optimal distribution centers which transport the commodity to the destination points and suggest optimal inventory policy to the selected distribution center which find the optimal pair $$ and safety stock level that minimize total cost with back-ordered case. This new model is formulated as a 0-1 nonlinear integer programming problem. To solve the problem, this paper proposes heuristic computational procedures and program and provides numerical examples.

  • PDF

Non-iterative Bit Loading Algorithm for OFDM in Independent and Correlated fading

  • Manry, John W.;Nagaraj, Santosh
    • Journal of Information Processing Systems
    • /
    • v.10 no.2
    • /
    • pp.163-175
    • /
    • 2014
  • This paper will focus on improving the performance of orthogonal frequency division multiplexing (OFDM) in Rayleigh fading environments. The proposed technique will use a previously published method that has been shown to improve OFDM performance in independent fading, based on ordered sub-carrier selection. Then, a simple non-iterative method for finding the optimal bit-loading allocation was proposed. It was also based on ordered sub-carrier selection. We compared both of these algorithms to an optimal bit-loading solution to determine their effectiveness in a correlated fading environment. The correlated fading was simulated using the JTC channel models. Our intent was not to create an optimal solution, but to create a low complexity solution that can be used in a wireless environment in which the channel conditions change rapidly and that require a simple algorithm for fast bit loading.

Fuzzzy Functions and Fuzzy Partially Ordered Sets

  • Hur, Kul;Jung, Hyo-Mi;Lee, Wang-Ro
    • 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.