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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Adaptation of Evolutionary Algorithms for Decision Making on Building Construction Engineering (TSP Problem)
    Autorzy:
    Wazirali, R. A.
    Alzughaibi, A. D.
    Chaczko, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/226730.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    TSP
    genetic algorithms
    GA
    support vector machines
    SVM
    Opis:
    The report revolve on building construction engineering and management, in which there are a lot of requirements such as well supervision and accuracy and being in position to forecast uncertainties that may arise and mechanisms to solve them. It also focuses on the way the building and construction can minimise the cost of building and wastages of materials. The project will be based of heuristic methods of Artificial Intelligence (AI). There are various evolution methods, but report focus on two experiments Pattern Recognition and Travelling Salesman Problem (TSP). The Pattern Recognition focuses Evolutionary Support Vector Machine Inference System for Construction Management. The construction is very dynamic are has a lot of uncertainties, no exact data this implies that the inference should change according to the environment so that it can fit the reality, therefore there a need of Support Vector Machine Inference System to solve these problems. TSP focus on reducing cost of building construction engineering and also reduces material wastages, through its principals of finding the minimum cost path of the salesman.
    Źródło:
    International Journal of Electronics and Telecommunications; 2014, 60, 1; 125-128
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An inventory model to study the effect of the probabilistic rate of carbon emission on the profit earned by a supplier
    Autorzy:
    Bhattacharjee, Nabajyoti
    Sen, Nabendu
    Powiązania:
    https://bibliotekanauki.pl/articles/2100360.pdf
    Data publikacji:
    2021
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    inventory modelling
    carbon emission
    green investment
    preservation
    PSO
    GA
    Opis:
    Sensitivity analysis of parameters is usually more important than the optimal solution when it comes to linear programming. Nevertheless, in the analysis of traditional sensitivities for a coefficient, a range of changes is found to maintain the optimal solution. These changes can be functional constraints in the coefficients, such as good values or technical coefficients, of the objective function. When real-world problems are highly inaccurate due to limited data and limited information, the method of grey systems is used to perform the needed optimisation. Several algorithms for solving grey linear programming have been developed to entertain involved inaccuracies in the model parameters; these methods are complex and require much computational time. In this paper, the sensitivity of a series of grey linear programming problems is analysed by using the definitions and operators of grey numbers. Also, uncertainties in parameters are preserved in the solutions obtained from the sensitivity analysis. To evaluate the efficiency and importance of the developed method, an applied numerical example is solved.
    Źródło:
    Operations Research and Decisions; 2021, 31, 4; 5--33
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    QIBMRMN: Design of a Q-Learning based Iterative sleep-scheduling & hybrid Bioinspired Multipath Routing model for Multimedia Networks
    Autorzy:
    Doorwar, Minaxi
    Malathi, P
    Powiązania:
    https://bibliotekanauki.pl/articles/27311958.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    multimedia
    network
    Q-learning
    GWO
    GA
    Adhoc
    QoS
    iterative
    process
    Opis:
    Multimedia networks utilize low-power scalar nodes to modify wakeup cycles of high-performance multimedia nodes, which assists in optimizing the power-toperformance ratios. A wide variety of machine learning models are proposed by researchers to perform this task, and most of them are either highly complex, or showcase low-levels of efficiency when applied to large-scale networks. To overcome these issues, this text proposes design of a Q-learning based iterative sleep-scheduling and fuses these schedules with an efficient hybrid bioinspired multipath routing model for largescale multimedia network sets. The proposed model initially uses an iterative Q-Learning technique that analyzes energy consumption patterns of nodes, and incrementally modifies their sleep schedules. These sleep schedules are used by scalar nodes to efficiently wakeup multimedia nodes during adhoc communication requests. These communication requests are processed by a combination of Grey Wolf Optimizer (GWO) & Genetic Algorithm (GA) models, which assist in the identification of optimal paths. These paths are estimated via combined analysis of temporal throughput & packet delivery performance, with node-to-node distance & residual energy metrics. The GWO Model uses instantaneous node & network parameters, while the GA Model analyzes temporal metrics in order to identify optimal routing paths. Both these path sets are fused together via the Q-Learning mechanism, which assists in Iterative Adhoc Path Correction (IAPC), thereby improving the energy efficiency, while reducing communication delay via multipath analysis. Due to a fusion of these models, the proposed Q-Learning based Iterative sleep-scheduling & hybrid Bioinspired Multipath Routing model for Multimedia Networks (QIBMRMN) is able to reduce communication delay by 2.6%, reduce energy consumed during these communications by 14.0%, while improving throughput by 19.6% & packet delivery performance by 8.3% when compared with standard multimedia routing techniques.
    Źródło:
    International Journal of Electronics and Telecommunications; 2023, 69, 4; 776--784
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    GA Among Giants. Gans’s Scene of Language and Culture Origin in Reference to Cassirer’s and Heidegger’s Visions of the Human
    Autorzy:
    Złocka-Dąbrowska, Magdalena
    Powiązania:
    https://bibliotekanauki.pl/articles/1186434.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Kardynała Stefana Wyszyńskiego w Warszawie
    Tematy:
    Eric Gans
    GA
    Cassirer
    Heidegger
    scene of origin
    representation
    language
    culture
    Opis:
    This essay situates Eric Gans’s Generative Anthropology (GA) within Ernst Cassirer’s and Martin Heidegger’s intricate ontologies and validates GA as an applied ontology of language and culture. First, I will follow Gans’s suggestions for placing GA within a philosophical context, in particular, in terms of his situating of GA as a response to Heidegger’s Being and Time. I will then present Gans’s central concept of GA – the rise of language/ culture as the origin of the ‘human as human’ – a way of linking Gans’s system of representation with Cassirer’s system of symbolic forms. The description of the main components of Gans’s ‘scene’, namely: language, sign, community and violence, as responding to Cassirer’s and Heidegger’s respective understandings, will lead us to symbolic representation as opposed to a phenomenology that views forms merely as limitations for Being. I propose a mediating position between the competing claims of Cassirer and Heidegger, respectively, in Gans’s originary thinking, in the ‘explosion of language’ that allows the hermeneutics of the language of being (Dasein) to regain its presence.
    Źródło:
    Załącznik Kulturoznawczy; 2020, 7; 37-61
    2392-2338
    Pojawia się w:
    Załącznik Kulturoznawczy
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of artificial neural network and genetic algorithm to healthcarewaste prediction
    Autorzy:
    Arabgol, S.
    Ko, H. S.
    Powiązania:
    https://bibliotekanauki.pl/articles/91848.pdf
    Data publikacji:
    2013
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    artificial neural network
    ANN
    application
    hospital
    genetic algorithm
    GA
    healthcare waste
    Opis:
    Prompt and proper management of healthcare waste is critical to minimize the negative impact on the environment. Improving the prediction accuracy of the healthcare waste generated in hospitals is essential and advantageous in effective waste management. This study aims at developing a model to predict the amount of healthcare waste. For this purpose, three models based on artificial neural network (ANN), multiple linear regression (MLR), and combination of ANN and genetic algorithm (ANN-GA) are applied to predict the waste of 50 hospitals in Iran. In order to improve the performance of ANN for prediction, GA is applied to find the optimal initial weights in the ANN. The performance of the three models is evaluated by mean squared errors. The obtained results have shown that GA has significant impact on optimizing initial weights and improving the performance of ANN.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 4; 243-250
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Reducing transfer costs of fragments allocation in replicated distributed database using genetic algorithms
    Autorzy:
    Sourati, N. K
    Ramezni, F
    Powiązania:
    https://bibliotekanauki.pl/articles/102446.pdf
    Data publikacji:
    2015
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    distributed database
    genetic algorithms
    communication costs
    GA
    data segmentation
    Fitness
    Crossover
    node
    fragment data
    Opis:
    Distributed databases were developed in order to respond to the needs of distributed computing. Unlike traditional database systems, distributed database systems are a set of nodes that are connected with each other by network and each of nodes has its own database, but they are available by other systems. Thus, each node can have access to all data on entire network. The main objective of allocated algorithms is to attribute fragments to various nodes in order to reduce the shipping cost. Thus, firstly fragments of nodes must be accessible by all nodes in each period, secondly, the transmission cost of fragments to nodes must be reduced and thirdly, the cost of updating all components of nodes must be optimized, that results in increased reliability and availability of network. In this study, more efficient hybrid algorithm can be produced combining genetic algorithms and previous algorithms.
    Źródło:
    Advances in Science and Technology. Research Journal; 2015, 9, 25; 1-6
    2299-8624
    Pojawia się w:
    Advances in Science and Technology. Research Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Designing a Mixed Evaluating System for Green Manufacturing of Automotive Industry
    Projektowanie mieszanego system oceny zielonej produkcji dla przemysłu samochodowego
    Autorzy:
    Cao, Y.
    You, J.
    Wang, R.
    Shi, Y.
    Powiązania:
    https://bibliotekanauki.pl/articles/371839.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Komitet Człowiek i Środowisko PAN
    Tematy:
    SBSC
    GM
    index system of automotive industry
    GA
    BPANN
    zielona produkcja
    system wskaźników przemysłu motoryzacyjnego
    Opis:
    The article proposed, from a sustainable development perspective, an index system based on Sustainability Balanced Scorecard (SBSC), including the main index of Financial, Internal process, Customer, Learning and growth, Social and the sub- index which comprised 28 indexes to evaluate the Green Manufacturing (GM) of automotive industry. Based on the index system, an evaluation model integrates by back-propagation artificial neural network (BPANN) and genetic algorithm (GA) was introduced. Using established model and indicators evaluated GM in four automotive companies; the key result of the evaluated show that: China’s automotive manufacturing enter-prises still have big room for improvement in respect of customer satisfaction, resource consumption, community service, low-carbon activities etc., so the strategy and management activities that put much pressure on these respect are necessary.
    W artykule zaproponowano wykorzystanie systemu wskaźników opartych na Zrównoważonej Karcie Wyników (Sustainability Balanced Scorecard – SBSC). Zgodnie z koncepcją rozwoju zrównoważonego uwzględniono na-stępujące główne wskaźniki: finansowy, procesów wewnętrznych, klienta, wzrostu i uczenia się, społeczny, a także 28 podwskaźników. Celem była ocena Zielonej Produkcji (Green Manufacturing – GM) w przemyśle mo-toryzacyjnym. Wprowadzono model oceny oparty na systemie wskaźników, łączący propagację wsteczną sztucz-nej sieci neuronowej (back-propagation artificial neural network – BPANN) oraz algorytm genetyczny (genetic algorithm – GA). Za pomocą wybranego modelu i wskaźników dokonano oceny Zielonej Produkcji w czterech firmach motoryzacyjnych. Wyniki wskazują, że chińskie przedsiębiorstwa motoryzacyjne mają jeszcze dużo do poprawy w kwestii satysfakcji klienta, zużycia zasobów, pracy społecznej, działań niskoemisyjnych, itp. Ko-nieczne jest zatem obranie strategii oraz gospodarki, które kładą nacisk na wymienione kwestie.
    Źródło:
    Problemy Ekorozwoju; 2016, 11, 1; 73-86
    1895-6912
    Pojawia się w:
    Problemy Ekorozwoju
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Applying artificial intelligence algorithms in MOBA games
    Autorzy:
    Wiśniewski, M.
    Niewiadomski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/92952.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
    Tematy:
    multiplayer online battle arena
    MOBA
    artificial intelligence
    AI
    genetic algorithm
    GA
    computer game
    computer game agents
    bots
    Opis:
    Multiplayer Online Battle Arena games focus mainly on struggles between two teams of players. An increasing level of cyberbullying [1] discourages new players from the game and they often chose a different option, that is, a match against opponents controlled by the computer. The behavior of artificial foes can be dynamically fitted to user’s needs, in particular with regard to the difficulty of the game. In this paper we explore different approaches to provide an intelligent behavior of bots basing on more human-like combat predictions rather than instant, scripted behaviors.
    Źródło:
    Studia Informatica : systems and information technology; 2016, 1-2(20); 53-64
    1731-2264
    Pojawia się w:
    Studia Informatica : systems and information technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Advanced helical gear reducer design optimization through nature inspired algorithms
    Autorzy:
    Ebenezer, N. Godwin Raja
    Saravanan, R.
    Ramabalan, S.
    Navaneethasanthakumar, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1178368.pdf
    Data publikacji:
    2017
    Wydawca:
    Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
    Tematy:
    CS
    DIN Standards
    FA
    GA
    Helical gear reducer design
    MATLAB solvers fmincon
    Nature inspired Algorithms SA
    metaheuristics
    optimization
    Opis:
    In this paper a high power helical gear pair design optimization problem is solved. It is a multi variable, complex non linear problem with derived objective function and constraints. The objective is to minimize the volume of the gear. The design parameters considered are module, face width, number of teeth on drive and driven and helix angle. The various factors for sizing and strength of gear geometry parameters are based on German Institute for Standardization (DIN) Standards. Nature inspired algorithms, namely, Simulated Annealing (SA), Fire fly (FA) and Cuckoo Search (CS) and MATLAB solvers fmincon, GA are used. Simulation results are analysed and compared with literature.
    Źródło:
    World Scientific News; 2017, 77, 2; 267-280
    2392-2192
    Pojawia się w:
    World Scientific News
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Administration-and communication-aware IP core mapping in scalable multiprocessor system-on-chips via evolutionary computing
    Autorzy:
    Guderian, F.
    Schaffer, R.
    Fettweis, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/91539.pdf
    Data publikacji:
    2012
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    intellectual property
    IP
    IP core
    mapping
    system-on-chips
    mixed-integer linear programming
    MILP
    genetic algorithm
    GA
    administration
    communication
    Opis:
    In this paper, an efficient mapping of intellectual property (IP) cores onto a scalable multiprocessor system-on-chip with a k-ary 2-mesh network-on-chip is performed. The approach is to place more affine IP cores closer to each other reducing the number of traversed routers. Affinity describes the pairwise relationship between the IP cores quantified by an amount of exchanged communication or administration data. A genetic algorithm (GA) and a mixed-integer linear programming (MILP) solution use the affinity values in order to optimize the IP core mappings. The GA generates results faster and with a satisfactory quality relative to MILP. Realistic benchmark results demonstrate that a tradeoff between administration and communication affinity significantly improves application performance.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 2; 133-146
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The comparison of genetic algorithms which solve orienteering problem using complete and incomplete graph
    Porównanie algorytmów genetycznych rozwiązujących Orienteering Problem przy pomocy grafu pełnego i niepełnego
    Autorzy:
    Ostrowski, K.
    Koszelew, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/341187.pdf
    Data publikacji:
    2011
    Wydawca:
    Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
    Tematy:
    graf niepełny
    graf pełny
    sieć transportowa
    OP
    GA
    algorytm genetyczny
    orienteering problem
    transport network
    genetic algorithm
    incomplete graph
    complete graph
    Opis:
    The purpose of this work was to compare two forms of genetic algorithm (complete and incomplete graph version) which solves Orienteering Problem (OP). While in most papers concerning OP graph is complete and satisfies triangle inequality, in our versions such assumptions may not be satisfied. It could be more practical as transport networks are graphs which do not have to satisfy those conditions. In such cases, graphs are usually complemented with fictional edges before they can be used by classic OP solving algorithms which operate on complete graphs. This paper answers the question: Is it better (in terms of results quality and time consumption) to transform graphs to classic OP form before running algorithm (complete graph version) or to solve OP on graphs without any assumptions and changes (incomplete graph version)? The computer experiment was conducted on the real transport network in Poland and its results suggest that it is worth checking both versions of the algorithm on concrete networks.
    Celem pracy było porównanie dwóch odmian algorytmu (wersja dla grafu pełnego i niepełnego) rozwiązujących Orienteering Problem (OP). W większości artykułów dotyczących OP graf jest pełny, a jego krawędzie spełniają nierówność trójkąta, natomiast w naszej wersji takie założenia mogą nie być spełnione. Może to być bardziej praktyczne ponieważ sieci transportowe są grafami, ktore nie muszą spełniać tych warunków. W takich przypadkach grafy są zazwyczaj uzupełniane fikcyjnymi krawędziami, a następnie działają na nich algorytmy rozwiązujące klasyczną wersje OP, które operują na grafie pełnym. Artykuł odpowiada na pytanie: czy pod względem jakości wyników i czasu obliczeń lepiej jest przekształcać graf do klasycznej formy OP przed uruchomieniem algorytmu w wersji dla grafu pełnego czy rozwiązywać OP na grafie niezmienionym i nie spełniającym dodatkowych założeń (wersja dla grafu niepełnego)? Eksperyment został przeprowadzony na prawdziwej sieci transportowej w Polsce, a jego wyniki sugerują, że warto sprawdzać obie wersje algorytmu na konkretnych sieciach.
    Źródło:
    Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2011, 8; 61-77
    1644-0331
    Pojawia się w:
    Zeszyty Naukowe Politechniki Białostockiej. Informatyka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Global path planning for multiple AUVs using GWO
    Autorzy:
    Panda, Madhusmita
    Das, Bikramaditya
    Pati, Bibhuti
    Powiązania:
    https://bibliotekanauki.pl/articles/229749.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Autonomous Underwater Vehicle
    AUV
    Genetic Algorithm
    GA
    Global Path Planning
    GPP
    Grey Wolf Optimization
    GWO
    Sliding Mode Control
    SMC
    waypoints
    Opis:
    In global path planning (GPP), an autonomous underwater vehicle (AUV) tracks a predefined path. The main objective of GPP is to generate a collision free sub-optimal path with minimum path cost. The path is defined as a set of segments, passing through selected nodes known as waypoints. For smooth planar motion, the path cost is a function of the path length, the threat cost and the cost of diving. Path length is the total distance travelled from start to end point, threat cost is the penalty of collision with the obstacle and cost of diving is the energy expanse for diving deeper in ocean. This paper addresses the GPP problem for multiple AUVs in formation. Here, Grey Wolf Optimization (GWO) algorithm is used to find the suboptimal path for multiple AUVs in formation. The results obtained are compared to the results of applying Genetic Algorithm (GA) to the same problem. GA concept is simple to understand, easy to implement and supports multi-objective optimization. It is robust to local minima and have wide applications in various fields of science, engineering and commerce. Hence, GA is used for this comparative study. The performance analysis is based on computational time, length of the path generated and the total path cost. The resultant path obtained using GWO is found to be better than GA in terms of path cost and processing time. Thus, GWO is used as the GPP algorithm for three AUVs in formation. The formation follows leader-follower topography. A sliding mode controller (SMC) is developed to minimize the tracking error based on local information while maintaining formation, as mild communication exists. The stability of the sliding surface is verified by Lyapunov stability analysis. With proper path planning, the path cost can be minimized as AUVs can reach their target in less time with less energy expanses. Thus, lower path cost leads to less expensive underwater missions.
    Źródło:
    Archives of Control Sciences; 2020, 30, 1; 77-100
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    WTHD minimisation in hybrid multilevel inverter using biogeographical based optimisation
    Autorzy:
    Kavitha, R.
    Thottungal, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/141212.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    biogeographical based optimisation
    BBO
    genetic algorithm
    GA
    bacterial foraging algorithm
    BFA
    weighted total harmonics distortion
    WTHD
    optimal minimisation of total harmonic
    OMTHD
    selective harmonic elimination
    SHE
    Opis:
    Harmonic minimisation in hybrid cascaded multilevel inverter involves complex nonlinear transcendental equation with multiple solutions. Hybrid cascaded multilevel can be implemented using reduced switch count when compared to traditional cascaded multilevel inverter topology. In this paper Biogeographical Based Optimisation (BBO) technique is applied to Hybrid multilevel inverter to determine the optimum switching angles with weighted total harmonic distortion (WTHD) as the objective function. Optimisation based on WTHD combines the advantage of both OMTHD (Optimal Minimisation of Total Harmonic Distortion) and SHE (Selective Harmonic Elimination) PWM. WTHD optimisation has the benefit of eliminating the specific lower order harmonics as in SHEPWM and minimisation of THD as in OMTHD. The simulation and experimental results for a 7 level multilevel inverter were presented. The results indicate that WTHD optimization provides both elimination of lower order harmonics and minimisation of Total Harmonic Distortion when compared to conventional OMTHD and SHE PWM. Experimental prototype of a seven level hybrid cascaded multilevel inverter is implemented to verify the simulation results.
    Źródło:
    Archives of Electrical Engineering; 2014, 63, 2; 187-196
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    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