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ę "Zurada, J." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Information technology tools for Business Intelligence development in organizations
    Narzędzia technologii informacyjnej w rozwoju Business Intelligence w organizacjach
    Autorzy:
    Olszak, C. M.
    Zurada, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/405737.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Częstochowska
    Tematy:
    Business Intelligence
    organization
    information technology tools
    organizacja
    narzędzia technologii informacyjnych
    Opis:
    The research objective for this study is to investigate different Information Technology (IT) tools for Business Intelligence (BI) development. Firstly, the issue of BI was identified and the various ages in BI development were presented. Then, the most important IT tools used in BI development were discussed. Finally, some strengths and weaknesses of described tools were demonstrated. The study was based mainly on a critical analysis of literature, creative thinking and an interpretive philosophy. The results of this research can be used by IT and business leaders as they plan and develop BI applications in their organizations.
    Celem artykułu jest rozpoznanie możliwości różnych narzędzi IT do budowy aplikacji Business Intelligence (BI). Na wstępie zidentyfikowano istotę BI oraz opisano trzy etapy rozwoju systemów BI. Następnie omówiono różne narzędzia IT, jakie mogą być stosowane do budowy BI w organizacjach. Ostatecznie, mocne i słabe strony tych narzędzi zostały zaprezentowane. Badania zostały przeprowadzone w oparciu o krytyczną analizę literatury przedmiotu. Wyniki badań mogą być interesujące dla specjalistów IT oraz menedżerów, którzy planują tworzenie aplikacji BI w swoich organizacjach.
    Źródło:
    Polish Journal of Management Studies; 2015, 12, 1; 132-142
    2081-7452
    Pojawia się w:
    Polish Journal of Management Studies
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multiplicative Algorithm for Correntropy-Based Nonnegative Matrix Factorization
    Autorzy:
    Hosseini-Asl, E.
    Zurada, J. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/108758.pdf
    Data publikacji:
    2013
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    Nonnegative Matrix Factorization (NMF)
    Correntropy
    Multiplicative Algorithm
    Document Clustering
    Opis:
    Nonnegative matrix factorization (NMF) is a popular dimension reduction technique used for clustering by extracting latent features from highdimensional data and is widely used for text mining. Several optimization algorithms have been developed for NMF with different cost functions. In this paper we evaluate the correntropy similarity cost function. Correntropy is a nonlinear localized similarity measure which measures the similarity between two random variables using entropy-based criterion, and is especially robust to outliers. Some algorithms based on gradient descent have been used for correntropy cost function, but their convergence is highly dependent on proper initialization and step size and other parameter selection. The proposed general multiplicative factorization algorithm uses the gradient descent algorithm with adaptive step size to maximize the correntropy similarity between the data matrix and its factorization. After devising the algorithm, its performance has been evaluated for document clustering. Results were compared with constrained gradient descent method using steepest descent and L-BFGS methods. The simulations show that the performance of steepest descent and LBFGS convergence are highly dependent on gradient descent step size which depends on σ parameter of correntropy cost function. However, the multiplicative algorithm is shown to be less sensitive to σ parameterand yields better clustering results than other algorithms. The results demonstrate that clustering performance measured by entropy and purity improve the clustering. The multiplicative correntropy-based algorithm also shows less variation in accuracy of document clusters for variable number of clusters. The convergence of each algorithm is also investigated, and the experiments have shown that the multiplicative algorithm converges faster than L-BFGS and steepest descent method.
    Źródło:
    Journal of Applied Computer Science Methods; 2013, 5 No. 2; 89-104
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    International Journal of Applied Computer Science Methods: Authors’ Instructions for the Preparation of the Submission Format of the Final Version of the Manuscript
    Autorzy:
    Zurada, J. M.
    Cader, A.
    Przybyszewski, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/108698.pdf
    Data publikacji:
    2009
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    JACSM
    authors’ instructions
    submission format
    MS Word template
    Opis:
    The abstract should summarize the content of the paper and should contain at least 50 and at most 120 words. It should be set in 9-point font size and should be inset 1.0 cm from the right and left margins. Following the abstract, at least three and up to six keywords should be included. The keywords must characterize the subject of the paper and assists in indexing.
    Źródło:
    Journal of Applied Computer Science Methods; 2009, 1 No. 1; 93-99
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Searching and Reasoning with Distributed Resources in Computational Intelligence and Machine
    Autorzy:
    Wojtusiak, J
    Chorowski, J
    Pietrzykowski, J.
    Zurada, J. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/108650.pdf
    Data publikacji:
    2009
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    virtual organization
    resource
    discovery
    categorization
    sharing
    Opis:
    Virtual organizations (VO) are geographically distributed groups of people sharing common goals and willingness to collaborate. One of the important roles of virtual organizations is to facilitate sharing resources related to the area of collaboration. This paper presents an approach to handling resources in Computational Intelligence and Machine Learning distributed over a large number of sites. Resources are first discovered in the internet, evaluated, and then shared among users. Reasoning and adaptation methods can then be applied to best fit resources into users’ needs without a long search process.
    Źródło:
    Journal of Applied Computer Science Methods; 2009, 1 No. 2; 5-19
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Convergence Analysis of Multilayer Feedforward Networks Trained with Penalty Terms: A review
    Autorzy:
    Wang, J.
    Yang, G.
    Liu, S.
    Zurada, J. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/108639.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    Gradient
    feedforward neural networks
    generalization
    penalty
    convergence
    pruning algorithms
    Opis:
    Gradient descent method is one of the popular methods to train feedforward neural networks. Batch and incremental modes are the two most common methods to practically implement the gradient-based training for such networks. Furthermore, since generalization is an important property and quality criterion of a trained network, pruning algorithms with the addition of regularization terms have been widely used as an efficient way to achieve good generalization. In this paper, we review the convergence property and other performance aspects of recently researched training approaches based on different penalization terms. In addition, we show the smoothing approximation tricks when the penalty term is non-differentiable at origin.
    Źródło:
    Journal of Applied Computer Science Methods; 2015, 7 No. 2; 89-103
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Convergence Analysis of Inverse Iterative Neural Networks with L₂ Penalty
    Autorzy:
    Wen, Y.
    Wang, J.
    Huang, B.
    Zurada, J. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/108754.pdf
    Data publikacji:
    2016
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    neural networks
    gradient descent
    inverse iterative
    monotonicity
    regularization
    convergence
    Opis:
    The iterative inversion of neural networks has been used in solving problems of adaptive control due to its good performance of information processing. In this paper an iterative inversion neural network with L₂ penalty term has been presented trained by using the classical gradient descent method. We mainly focus on the theoretical analysis of this proposed algorithm such as monotonicity of error function, boundedness of input sequences and weak (strong) convergence behavior. For bounded property of inputs, we rigorously proved that the feasible solutions of input are restricted in a measurable field. The weak convergence means that the gradient of error function with respect to input tends to zero as the iterations go to infinity while the strong convergence stands for the iterative sequence of input vectors convergence to a fixed optimal point.
    Źródło:
    Journal of Applied Computer Science Methods; 2016, 8 No. 2; 85-98
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Collaborative Web-based Workspaces for an Academic Department
    Autorzy:
    Zurada, J. M.
    Habas, P A
    Muezzinoglu, M K
    Powiązania:
    https://bibliotekanauki.pl/articles/108746.pdf
    Data publikacji:
    2009
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    document repositories
    collaborative workspaces
    open source database MySQL
    web-based information sharing
    accreditation of engineering programs
    Opis:
    Continuous program improvement and expectations of productivity of academic departments necessitate the use of web-based information sharing. This paper outlines how simple-to-use web-based environments such as documents repositories and collaborative ABET workspaces can improve the workflow of an academic department. They can boost the departmental productivity and faculty involvement in many aspects of teaching and accreditation efforts, and assist with faculty, staff and students interaction. Such environments reduce email communications and can vary by their degree of interactivity. Document repositories can be read-only, while interactive workspaces will typically extend read-write privileges to all participants. Furthermore, collaborative workspaces offer a democratic and open environment that encourages faculty and staff interaction. Finally, such workspaces remain easily scalable for projects of any size, and offer simplicity of navigation and easy-to-organize table of contents. The discussion of web-based tools has been illustrated with several examples of departmental repositories and interactive workspaces. Implementation guidelines are also offered for those interested in custom design of such tools.
    Źródło:
    Journal of Applied Computer Science Methods; 2009, 1 No. 1; 25-36
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Robust Identification Approach to Individualized Anemia Model
    Autorzy:
    Akabua, E.
    Inanc, T.
    Gaweda, A.
    Brier, M. E.
    Kim, S.
    Zurada, J. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/108768.pdf
    Data publikacji:
    2011
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    hemoglobin
    robust identification
    Carathéodory-Fejér problem
    erythropoeitin
    anemia management
    Opis:
    Over ninety percent of End Stage Renal Disease (ESRD) patients suffer from anemia due to insufficient endogenous production of human erythropoietin. Until the advent of Recombinant Human Erythropoietin (r-HuEPO) over 30 years ago, patients with ESRD were treated mainly with multiple blood transfusions. The high cost of r-HuEPO in addition to the narrow margin between an effective do-sage and toxicity in drug administration calls for optimal dosage strategy capable of minimizing cost and toxicity while at the same time achieving the desired do-sage outcome. It is well known from control theory that a controller can be de-signed for any plant provided there is readily available a valid model for such a plant. We present Robust Identification procedure, a dimensionality reduction technique capable of capturing the inherent dynamics of anemia patients; conse-quently producing individualized model suitable for robust control synthesis and any other controller design methodologies.
    Źródło:
    Journal of Applied Computer Science Methods; 2011, 3 No. 2; 65-75
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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