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ę "learning network" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Hospitalization patient forecasting based on multi-task deep learning
    Autorzy:
    Zhou, Min
    Huang, Xiaoxiao
    Liu, Haipeng
    Zheng, Dingchang
    Powiązania:
    https://bibliotekanauki.pl/articles/2201025.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    hospitalization patient
    neural network
    multitask learning
    pacjent hospitalizowany
    sieć neuronowa
    nauka wielozadaniowa
    Opis:
    Forecasting the number of hospitalization patients is important for hospital management. The number of hospitalization patients depends on three types of patients, namely, admission patients, discharged patients, and inpatients. However, previous works focused on one type of patients rather than the three types of patients together. In this paper, we propose a multi-task forecasting model to forecast the three types of patients simultaneously. We integrate three neural network modules into a unified model for forecasting. Besides, we extract date features of admission and discharged patient flows to improve forecasting accuracy. The algorithm is trained and evaluated on a real-world data set of a one-year daily observation of patient numbers in a hospital. We compare the performance of our model with eight baselines over two real-word data sets. The experimental results show that our approach outperforms other baseline algorithms significantly.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 151--162
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance analysis of a dual stage deep rain streak removal convolution neural network module with a modified deep residual dense network
    Autorzy:
    Jayaraman, Thiyagarajan
    Chinnusamy, Shankar
    Powiązania:
    https://bibliotekanauki.pl/articles/2055158.pdf
    Data publikacji:
    2022
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    single image deraining
    deep learning
    modified residual dense network
    PyTorch
    obraz pojedynczy
    uczenie głębokie
    sieć gęsta
    Opis:
    The visual appearance of outdoor captured images is affected by various weather conditions, such as rain patterns, haze, fog and snow. The rain pattern creates more degradation in the visual quality of the image due to its physical structure compared with other weather conditions. Also, the rain pattern affects both foreground and background image information. The removal of rain patterns from a single image is a critical process, and more attention is given to remove the structural rain pattern from real-time rain images. In this paper, we analyze the single image deraining problem and present a solution using the dual stage deep rain streak removal convolutional neural network. The proposed single image deraining framework primarily consists of three main blocks: a derain streaks removal CNN (derain SRCNN), a modified residual dense block (MRDB), and a six-stage scale feature aggregation module (3SFAM). The ablation study is conducted to evaluate the performance of various modules available in the proposed deraining network. The robustness of the proposed deraining network is evaluated over the popular synthetic and real-time data sets using four performance metrics such as the peak signal-to-noise ratio (PSNR), the feature similarity index (FSIM), the structural similarity index measure (SSIM), and the universal image quality index (UIQI). The experimental results show that the proposed framework outperforms both synthetic and real-time images compared with other state-of-the-art single image deraining approaches. In addition, the proposed network takes less running and training time.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2022, 32, 1; 111--123
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Choice of the p-norm for high level classification features pruning in modern convolutional neural networks with local sensitivity analysis
    Autorzy:
    Jeczmionek, Ernest
    Kowalski, Piotr A.
    Powiązania:
    https://bibliotekanauki.pl/articles/24988509.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    convolutional neural network
    pruning
    sensitivity analysis
    transfer learning
    ImageNet
    sieć neuronowa konwolucyjna
    analiza wrażliwości
    uczenie transferowe
    Opis:
    Transfer learning has surfaced as a compelling technique in machine learning, enabling the transfer of knowledge across networks. This study evaluates the efficacy of ImageNet pretrained state-of-the-art networks, including DenseNet, ResNet, and VGG, in implementing transfer learning for prepruned models on compact datasets, such as FashionMNIST, CIFAR10, and CIFAR100. The primary objective is to reduce the number of neurons while preserving high-level features. To this end, local sensitivity analysis is employed alongside p-norms and various reduction levels. This investigation discovers that VGG16, a network rich in parameters, displays resilience to high-level feature pruning. Conversely, the ResNet architectures reveal an interesting pattern of increased volatility. These observations assist in identifying an optimal combination of the norm and the reduction level for each network architecture, thus offering valuable directions for model-specific optimization. This study marks a significant advance in understanding and implementing effective pruning strategies across diverse network architectures, paving the way for future research and applications.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 4; 663--672
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A hybrid two-stage SqueezeNet and support vector machine system for Parkinson’s disease detection based on handwritten spiral patterns
    Autorzy:
    Bernardo, Lucas Salvador
    Damaševičius, Robertas
    de Albuquerque, Victor Hugo C.
    Maskeliūnas, Rytis
    Powiązania:
    https://bibliotekanauki.pl/articles/2055162.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    Parkinson’s disease
    spirography
    convolutional neural network
    deep learning
    choroba Parkinsona
    spirografia
    sieć neuronowa konwolucyjna
    uczenie głębokie
    Opis:
    Parkinson’s disease (PD) is the second most common neurological disorder in the world. Nowadays, it is estimated that it affects from 2% to 3% of the global population over 65 years old. In clinical environments, a spiral drawing task is performed to help to obtain the disease’s diagnosis. The spiral trajectory differs between people with PD and healthy ones. This paper aims to analyze differences between handmade drawings of PD patients and healthy subjects by applying the SqueezeNet convolutional neural network (CNN) model as a feature extractor, and a support vector machine (SVM) as a classifier. The dataset used for training and testing consists of 514 handwritten draws of Archimedes’ spiral images derived from heterogeneous sources (digital and paper-based), from which 296 correspond to PD patients and 218 to healthy subjects. To extract features using the proposed CNN, a model is trained and 20% of its data is used for testing. Feature extraction results in 512 features, which are used for SVM training and testing, while the performance is compared with that of other machine learning classifiers such as a Gaussian naive Bayes (GNB) classifier (82.61%) and a random forest (RF) (87.38%). The proposed method displays an accuracy of 91.26%, which represents an improvement when compared to pure CNN-based models such as SqueezeNet (85.29%), VGG11 (87.25%), and ResNet (89.22%).
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 4; 549--561
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A genetic algorithm based optimized convolutional neural network for face recognition
    Autorzy:
    Karlupia, Namrata
    Mahajan, Palak
    Abrol, Pawanesh
    Lehana, Parveen K.
    Powiązania:
    https://bibliotekanauki.pl/articles/2201023.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    convolutional neural network
    genetic algorithm
    deep learning
    evolutionary technique
    sieć neuronowa konwolucyjna
    algorytm genetyczny
    uczenie głębokie
    technika ewolucyjna
    Opis:
    Face recognition (FR) is one of the most active research areas in the field of computer vision. Convolutional neural networks (CNNs) have been extensively used in this field due to their good efficiency. Thus, it is important to find the best CNN parameters for its best performance. Hyperparameter optimization is one of the various techniques for increasing the performance of CNN models. Since manual tuning of hyperparameters is a tedious and time-consuming task, population based metaheuristic techniques can be used for the automatic hyperparameter optimization of CNNs. Automatic tuning of parameters reduces manual efforts and improves the efficiency of the CNN model. In the proposed work, genetic algorithm (GA) based hyperparameter optimization of CNNs is applied for face recognition. GAs are used for the optimization of various hyperparameters like filter size as well as the number of filters and of hidden layers. For analysis, a benchmark dataset for FR with ninety subjects is used. The experimental results indicate that the proposed GA-CNN model generates an improved model accuracy in comparison with existing CNN models. In each iteration, the GA minimizes the objective function by selecting the best combination set of CNN hyperparameters. An improved accuracy of 94.5% is obtained for FR.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 21--31
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Local stability conditions for discrete-time cascade locally recurrent neural networks
    Autorzy:
    Patan, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/907772.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sieć lokalnie rekurencyjna
    stabilność
    stabilizacja
    uczenie się
    optymalizacja ograniczona
    locally recurrent neural network
    stability
    stabilization
    learning
    constrained optimization
    Opis:
    The paper deals with a specific kind of discrete-time recurrent neural network designed with dynamic neuron models. Dynamics are reproduced within each single neuron, hence the network considered is a locally recurrent globally feedforward. A crucial problem with neural networks of the dynamic type is stability as well as stabilization in learning problems. The paper formulates local stability conditions for the analysed class of neural networks using Lyapunov's first method. Moreover, a stabilization problem is defined and solved as a constrained optimization task. In order to tackle this problem, a gradient projection method is adopted. The efficiency and usefulness of the proposed approach are justified by using a number of experiments.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 23-34
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of prototype selection algorithms used in construction of neural networks learned by SVD
    Autorzy:
    Jankowski, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/330020.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    radial basis function network
    extreme learning machine
    kernel method
    prototype selection
    machine learning
    k nearest neighbours
    radialna funkcja bazowa
    metoda jądrowa
    uczenie maszynowe
    metoda k najbliższych sąsiadów
    Opis:
    Radial basis function networks (RBFNs) or extreme learning machines (ELMs) can be seen as linear combinations of kernel functions (hidden neurons). Kernels can be constructed in random processes like in ELMs, or the positions of kernels can be initialized by a random subset of training vectors, or kernels can be constructed in a (sub-)learning process (sometimes by k-means, for example). We found that kernels constructed using prototype selection algorithms provide very accurate and stable solutions. What is more, prototype selection algorithms automatically choose not only the placement of prototypes, but also their number. Thanks to this advantage, it is no longer necessary to estimate the number of kernels with time-consuming multiple train-test procedures. The best results of learning can be obtained by pseudo-inverse learning with a singular value decomposition (SVD) algorithm. The article presents a comparison of several prototype selection algorithms co-working with singular value decomposition-based learning. The presented comparison clearly shows that the combination of prototype selection and SVD learning of a neural network is significantly better than a random selection of kernels for the RBFN or the ELM, the support vector machine or the kNN. Moreover, the presented learning scheme requires no parameters except for the width of the Gaussian kernel.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 719-733
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A fast neural network learning algorithm with approximate singular value decomposition
    Autorzy:
    Jankowski, Norbert
    Linowiecki, Rafał
    Powiązania:
    https://bibliotekanauki.pl/articles/330870.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    Moore–Penrose pseudoinverse
    radial basis function network
    extreme learning machine
    kernel method
    machine learning
    singular value decomposition
    deep extreme learning
    principal component analysis
    pseudoodwrotność Moore–Penrose
    radialna funkcja bazowa
    maszyna uczenia ekstremalnego
    uczenie maszynowe
    analiza składników głównych
    Opis:
    The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms. With fast learning we can examine more learning scenarios for a given problem, especially in the case of meta-learning. In this article we focus on the construction of a much faster learning algorithm and its modifications, especially for nonlinear versions of neural networks. The main idea of this algorithm lies in the usage of fast approximation of the Moore–Penrose pseudo-inverse matrix. The complexity of the original singular value decomposition algorithm is O(mn2). We consider algorithms with a complexity of O(mnl), where l < n and l is often significantly smaller than n. Such learning algorithms can be applied to the learning of radial basis function networks, extreme learning machines or deep ELMs, principal component analysis or even missing data imputation.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 3; 581-594
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A hybrid control strategy for a dynamic scheduling problem in transit networks
    Autorzy:
    Liu, Zhongshan
    Yu, Bin
    Zhang, Li
    Wang, Wensi
    Powiązania:
    https://bibliotekanauki.pl/articles/2172126.pdf
    Data publikacji:
    2022
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    service reliability
    transit network
    proactive control method
    deep reinforcement learning
    hybrid control strategy
    niezawodność usług
    sieć tranzytowa
    uczenie głębokie
    kontrola hybrydowa
    Opis:
    Public transportation is often disrupted by disturbances, such as the uncertain travel time caused by road congestion. Therefore, the operators need to take real-time measures to guarantee the service reliability of transit networks. In this paper, we investigate a dynamic scheduling problem in a transit network, which takes account of the impact of disturbances on bus services. The objective is to minimize the total travel time of passengers in the transit network. A two-layer control method is developed to solve the proposed problem based on a hybrid control strategy. Specifically, relying on conventional strategies (e.g., holding, stop-skipping), the hybrid control strategy makes full use of the idle standby buses at the depot. Standby buses can be dispatched to bus fleets to provide temporary or regular services. Besides, deep reinforcement learning (DRL) is adopted to solve the problem of continuous decision-making. A long short-term memory (LSTM) method is added to the DRL framework to predict the passenger demand in the future, which enables the current decision to adapt to disturbances. The numerical results indicate that the hybrid control strategy can reduce the average headway of the bus fleet and improve the reliability of bus service.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2022, 32, 4; 553--567
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Neural network segmentation of images from stained cucurbits leaves with colour symptoms of biotic and abiotic stresses
    Autorzy:
    Gocławski, J.
    Sekulska-Nalewajko, J.
    Kuźniak, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/330961.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    segmentacja obrazu
    przestrzeń koloru
    przetwarzanie morfologiczne
    progowanie obrazu
    sztuczna sieć neuronowa
    ochrona roślin
    image segmentation
    colour space
    morphological processing
    image thresholding
    artificial neural network
    WTA learning
    Widrow-Hoff learning
    Cucurbita species
    plant stress
    ROS detection
    Opis:
    The increased production of Reactive Oxygen Species (ROS) in plant leaf tissues is a hallmark of a plant's reaction to various environmental stresses. This paper describes an automatic segmentation method for scanned images of cucurbits leaves stained to visualise ROS accumulation sites featured by specific colour hues and intensities. The leaves placed separately in the scanner view field on a colour background are extracted by thresholding in the RGB colour space, then cleaned from petioles to obtain a leaf blade mask. The second stage of the method consists in the classification of within mask pixels in a hue-saturation plane using two classes, determined by leaf regions with and without colour products of the ROS reaction. At this stage a two-layer, hybrid artificial neural network is applied with the first layer as a self-organising Kohonen type network and a linear perceptron output layer (counter propagation network type). The WTA-based, fast competitive learning of the first layer was improved to increase clustering reliability. Widrow-Hoff supervised training used at the output layer utilises manually labelled patterns prepared from training images. The generalisation ability of the network model has been verified by K-fold cross-validation. The method significantly accelerates the measurement of leaf regions containing the ROS reaction colour products and improves measurement accuracy.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 669-684
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Nonparametric statistical analysis for multiple comparison of machine learning regression algorithms
    Autorzy:
    Trawiński, B.
    Smętek, M.
    Telec, Z.
    Lasota, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/331296.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    maszyna ucząca się
    test statystyczny nieparametryczny
    regresja statystyczna
    sieć neuronowa
    wielokrotne testy porównawcze
    machine learning
    nonparametric statistical tests
    statistical regression
    neural network
    multiple comparison tests
    Opis:
    In the paper we present some guidelines for the application of nonparametric statistical tests and post-hoc procedures devised to perform multiple comparisons of machine learning algorithms. We emphasize that it is necessary to distinguish between pairwise and multiple comparison tests. We show that the pairwise Wilcoxon test, when employed to multiple comparisons, will lead to overoptimistic conclusions. We carry out intensive normality examination employing ten different tests showing that the output of machine learning algorithms for regression problems does not satisfy normality requirements. We conduct experiments on nonparametric statistical tests and post-hoc procedures designed for multiple 1 x N and N x N comparisons with six different neural regression algorithms over 29 benchmark regression data sets. Our investigation proves the usefulness and strength of multiple comparison statistical procedures to analyse and select machine learning algorithms.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 867-881
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A hybrid approach of a deep learning technique for real-time ECG beat detection
    Autorzy:
    Patro, Kiran Kumar
    Prakash, Allam Jaya
    Samantray, Saunak
    Pławiak, Joanna
    Tadeusiewicz, Ryszard
    Pławiak, Paweł
    Powiązania:
    https://bibliotekanauki.pl/articles/2172118.pdf
    Data publikacji:
    2022
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    cardiac abnormalities
    CAD
    convolutional neural network
    CNN
    deep learning
    ECG
    electrocardiogram
    supra ventricular ectopic beats
    SVE
    nieprawidłowości kardiologiczne
    sieć neuronowa konwolucyjna
    uczenie głębokie
    EKG
    elektrokardiogram
    Opis:
    This paper presents a new customized hybrid approach for early detection of cardiac abnormalities using an electrocardiogram (ECG). The ECG is a bio-electrical signal that helps monitor the heart’s electrical activity. It can provide health information about the normal and abnormal physiology of the heart. Early diagnosis of cardiac abnormalities is critical for cardiac patients to avoid stroke or sudden cardiac death. The main aim of this paper is to detect crucial beats that can damage the functioning of the heart. Initially, a modified Pan–Tompkins algorithm identifies the characteristic points, followed by heartbeat segmentation. Subsequently, a different hybrid deep convolutional neural network (CNN) is proposed to experiment on standard and real-time long-term ECG databases. This work successfully classifies several cardiac beat abnormalities such as supra-ventricular ectopic beats (SVE), ventricular beats (VE), intra-ventricular conduction disturbances beats (IVCD), and normal beats (N). The obtained classification results show a better accuracy of 99.28% with an F1 score of 99.24% with the MIT–BIH database and a descent accuracy of 99.12% with the real-time acquired database.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2022, 32, 3; 455--465
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Constant Q-transform-based deep learning architecture for detection of obstructive sleep apnea
    Autorzy:
    Kandukuri, Usha Rani
    Prakash, Allam Jaya
    Patro, Kiran Kumar
    Neelapu, Bala Chakravarthy
    Tadeusiewicz, Ryszard
    Pławiak, Paweł
    Powiązania:
    https://bibliotekanauki.pl/articles/24200694.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sleep apnea
    convolutional neural network
    constant Q-transform
    deep learning
    single lead ECG signal
    non apnea
    obstructive sleep apnea
    bezdech senny
    sieć neuronowa konwolucyjna
    uczenie głębokie
    sygnał EKG
    obturacyjny bezdech senny
    Opis:
    Obstructive sleep apnea (OSA) is a long-term sleep disorder that causes temporary disruption in breathing while sleeping. Polysomnography (PSG) is the technique for monitoring different signals during the patient’s sleep cycle, including electroencephalogram (EEG), electromyography (EMG), electrocardiogram (ECG), and oxygen saturation (SpO2). Due to the high cost and inconvenience of polysomnography, the usefulness of ECG signals in detecting OSA is explored in this work, which proposes a two-dimensional convolutional neural network (2D-CNN) model for detecting OSA using ECG signals. A publicly available apnea ECG database from PhysioNet is used for experimentation. Further, a constant Q-transform (CQT) is applied for segmentation, filtering, and conversion of ECG beats into images. The proposed CNN model demonstrates an average accuracy, sensitivity and specificity of 91.34%, 90.68% and 90.70%, respectively. The findings obtained using the proposed approach are comparable to those of many other existing methods for automatic detection of OSA.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 3; 493--506
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      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