Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Khan, N." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    A control chart using belief information for a gamma distribution
    Autorzy:
    Aslam, M.
    Khan, N.
    Jun, C. -H.
    Powiązania:
    https://bibliotekanauki.pl/articles/406500.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    control chart
    belief statistic
    average run length
    gamma distribution
    Opis:
    The design of a control chart has been presented using a belief estimator by assuming that the quantitative characteristic of interest follows the gamma distribution. The authors present the structure of the proposed chart and derive the average run lengths for in-control and a shifted process. The aver-age run lengths for various specified parameters have been reported. The efficiency of the proposed chart has been compared to existing control charts. The application of the proposed chart is illustrated with the help of simulated data.
    Źródło:
    Operations Research and Decisions; 2016, 26, 4; 5-19
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the performance of modified EWMA charts using resampling schemes
    Autorzy:
    Khan, N.
    Yasmin, T.
    Aslam, M.
    Jun, C. -H.
    Powiązania:
    https://bibliotekanauki.pl/articles/406444.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    repetitive group sampling
    multiple dependent state sampling
    EWMA statistic
    average run length
    simulation
    Opis:
    Two popular sampling schemes have been used to design control charts by means of a modified exponentially weighted moving average (EWMA) statistic. The structures of the proposed charts, using repetitive group sampling and multiple dependent state sampling, have been presented. The values of average run length have been determined by some specified control chart parameters. The performance of the proposed chart was illustrated via a simulation study. The efficiency of the proposed chart has been compared with the existing one. A practical example based on real data was also given to explain the application of the proposed chart in industry.
    Źródło:
    Operations Research and Decisions; 2018, 28, 3; 29-43
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A mixed control chart adapted to the truncated life test based on the Weibull distribution
    Autorzy:
    Khan, N.
    Aslam, M.
    Kim, K.-J.
    Jun, C. -H.
    Powiązania:
    https://bibliotekanauki.pl/articles/406432.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    life test
    Weibull distribution
    attribute chart
    binomial distribution
    average run length
    Opis:
    The design of a new mixed attribute control chart adapted to a truncated life test has been pre-sented. It was assumed that the lifetime of a product follows the Weibull distribution and the number of failures was observed using a truncated life test, where the test duration was specified as a fraction of the mean lifespan. The proposed control chart consists of two pairs of control limits based on a binomial distribution and one lower bound. The average run length of the chart was determined for various levels of shift constants and specified parameters. The efficiency of the chart is compared with an existing control chart in terms of the average run length. The application of the proposed chart is discussed with the aid of a simulation study.
    Źródło:
    Operations Research and Decisions; 2017, 27, 1; 43-55
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new and fast approximation algorithm for vertex cover using a maximum independent set (VCUMI)
    Autorzy:
    Khan, I.
    Riaz, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/406436.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    non-deterministic polynomial
    vertex cover
    independent set
    benchmark
    error ratio
    Opis:
    The importance of non-deterministic polynomial (NP) problems in real world scenarios has compelled researchers to consider simple ways of finding approximate solutions to these problems in polynomial time. Minimum vertex cover is an NP complete problem, where the objective is to cover all the edges in a graph with the minimal number of vertices possible. The maximal independent set and maximal clique problems also belong to the same class. An important property that we have analyzed while considering various approaches to find approximate solutions to the minimum vertex cover problem (MVC) is that solving MVC directly can result in a bigger error ratio. We propose a new approximation algorithm for the minimum vertex cover problem called vertex cover using a maximum independent set (VCUMI). This algorithm works by removing the nodes of a maximum independent set until the graph is an approximate solution of MVC. Based on empirical results, it can be stated that VCUMI outperforms all competing algorithms presented in the literature. Based on all the benchmarks used, VCUMI achieved the worst case error ratio of 1.033, while VSA, MDG and NOVAC-1 gave the worst error ratios of 1.583, 1.107 and 1.04, respectively.
    Źródło:
    Operations Research and Decisions; 2015, 25, 4; 5-18
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies