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

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 750
Tytuł:
Multi-objective optimization of elastomeric bearings to improve seismic performance of old bridges using eigen analysis and genetic algorithms
Autorzy:
Abbadi, Mohammed S.
Lamdouar, Nouzha
Powiązania:
https://bibliotekanauki.pl/articles/35552894.pdf
Data publikacji:
2022
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
seismic isolation
OpenSees
genetic algorithms
Eurocode 8
Opis:
Old bridges present several seismic vulnerabilities and were designed before the emergence of seismic codes. In this context, partial seismic isolation has given a special attention to improve their seismic performance. In particular, elastomeric bearings are the simplest and least expensive mean for this, enabling to resist both non-seismic actions and earthquake loads. In order to assess the initial structural performance and the improvement done by the isolation, this paper attempts to combine multi objective optimization using genetic algorithms with linear and non-linear analysis using FE program OpenSees. A prior screening of the columns states is settled and then a multi objective optimization of a population of standard sized bearings meeting non-seismic and stability requirements is established to optimize the linear and non-linear behavior of the structure, finding the best compromise between displacements and forces at the columns.
Źródło:
Scientific Review Engineering and Environmental Sciences; 2021, 30, 4; 511-524
1732-9353
Pojawia się w:
Scientific Review Engineering and Environmental Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning structures of conceptual models from observed dynamics using evolutionary echo state networks
Autorzy:
Abdelbari, H.
Shafi, K.
Powiązania:
https://bibliotekanauki.pl/articles/91864.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
complex systems modeling
conceptual models
causal loop diagrams
computational intelligence
echo state networks
evolutionary algorithms
Opis:
Conceptual or explanatory models are a key element in the process of complex system modelling. They not only provide an intuitive way for modellers to comprehend and scope the complex phenomena under investigation through an abstract representation but also pave the way for the later development of detailed and higher-resolution simulation models. An evolutionary echo state network-based method for supporting the development of such models, which can help to expedite the generation of alternative models for explaining the underlying phenomena and potentially reduce the manual effort required, is proposed. It relies on a customised echo state neural network for learning sparse conceptual model representations from the observed data. In this paper, three evolutionary algorithms, a genetic algorithm, differential evolution and particle swarm optimisation are applied to optimize the network design in order to improve model learning. The proposed methodology is tested on four examples of problems that represent complex system models in the economic, ecological and physical domains. The empirical analysis shows that the proposed technique can learn models which are both sparse and effective for generating the output that matches the observed behaviour.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 2; 133-154
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An algorithm for solving a certain sequencing problem
Autorzy:
Adrabiński, A.
Grabowski, J.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/747964.pdf
Data publikacji:
1982
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Scheduling theory, deterministic, Algorithms
Opis:
.
The authors consider the problem of nonpreemptive scheduling of n tasks in a general job shop. The objective is to find a schedule of minimum length. The algorithm presented in the paper is based on the disjunctive graph approach. Its performance is not compared with other algorithms constructed for that problem.
Źródło:
Mathematica Applicanda; 1982, 10, 18
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model-Based Method for Acoustic Echo Cancelation and Near-End Speaker Extraction: Non-negative Matrix Factorization
Autorzy:
Agrawal, P.
Shandilya, M.
Powiązania:
https://bibliotekanauki.pl/articles/958086.pdf
Data publikacji:
2018
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
adaptive algorithms
convergence
echo cancellation
non-negative matrix factorization (NMF)
Opis:
Rapid escalation of wireless communication and hands-free telephony creates a problem with acoustic echo in full-duplex communication applications. In this paper a simulation of model-based acoustic echo cancelation and near-end speaker extraction using statistical methods relying on nonnegative matrix factorization (NMF) is proposed. Acoustic echo cancelation using the NMF algorithm is developed and its implementation is presented, along with all positive, real time elements and factorization techniques. Experimental results are compared against the widely used existing adaptive algorithms which have a disadvantage in terms of long impulse response, increased computational load and wrong convergence due to change in near-end enclosure. All these shortcomings have been eliminated in the statistical method of NMF that reduces echo and enhances audio signal processing.
Źródło:
Journal of Telecommunications and Information Technology; 2018, 2; 15-22
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Advances in parallel heterogeneous genetic algorithms for continuous optimization
Autorzy:
Alba, E.
Luna, F.
Nebro, A. J.
Powiązania:
https://bibliotekanauki.pl/articles/907622.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm genetyczny
optymalizacja ciągła
konwergencja przedwczesna
parallel genetic algorithms
continuous optimization
premature convergence
heterogeneity
Opis:
In this paper we address an extension of a very efficient genetic algorithm (GA) known as Hy3, a physical parallelization of the gradual distributed real-coded GA (GD-RCGA). This search model relies on a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimization by using crossover operators tuned to explore and exploit the solutions inside each subpopulation. We introduce here a further extension of Hy3, called Hy4, that uses 16 islands arranged in a hypercube of four dimensions. Thus, two new faces with different exploration/exploitation search capabilities are added to the search performed by Hy3. We analyze the importance of running a synchronous versus an asynchronous version of the models considered. The results indicate that the proposed Hy4 model overcomes the Hy3 performance because of its improved balance between exploration and exploitation that enhances the search. Finally, we also show that the async Hy4 model scales better than the sync one.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 317-333
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Beta neuro-fuzzy systems
Autorzy:
Alimi, A. M.
Powiązania:
https://bibliotekanauki.pl/articles/1931568.pdf
Data publikacji:
2003
Wydawca:
Politechnika Gdańska
Tematy:
beta function
kernel based neural networks
Sugeno fuzzy model
neuro-fuzzy systems
universal approximation property
learning algorithms
incremental learning
Opis:
In this paper we present the Beta function and its main properties. A key feature of the Beta function, which is given by the central-limit theorem, is also given. We then introduce a new category of neural networks based on a new kernel: the Beta function. Next, we investigate the use of Beta fuzzy basis functions for the design of fuzzy logic systems. The functional equivalence between Beta-based function neural networks and Beta fuzzy logic systems is then shown with the introduction of Beta neuro-fuzzy systems. By using the SW theorem and expanding the output of the Beta neuro-fuzzy system into a series of Beta fuzzy-based functions, we prove that one can uniformly approximate any real continuous function on a compact set to any arbitrary accuracy. Finally, a learning algorithm of the Beta neuro-fuzzy system is described and illustrated with numerical examples.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2003, 7, 1; 23-41
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New characterizations of reproducing kernel Hilbert spaces and applications to metric geometry
Autorzy:
Alpay, Daniel
Jorgensen, Palle E.T.
Powiązania:
https://bibliotekanauki.pl/articles/2051893.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
reproducing kernel
positive definite functions
approximation
algorithms
measures
stochastic processes
Opis:
We give two new global and algorithmic constructions of the reproducing kernel Hilbert space associated to a positive definite kernel. We further present a general positive definite kernel setting using bilinear forms, and we provide new examples. Our results cover the case of measurable positive definite kernels, and we give applications to both stochastic analysis and metric geometry and provide a number of examples.
Źródło:
Opuscula Mathematica; 2021, 41, 3; 283-300
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary Learning of Goal-Oriented Communication Strategies in Multi-Agent Systems
Autorzy:
Althnian, A.
Agah, A.
Powiązania:
https://bibliotekanauki.pl/articles/384735.pdf
Data publikacji:
2015
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
multi-agent system
communication strategy
evolutionary communication
genetic algorithms
Opis:
Previous studies in multi-agent systems have observed that varying the type of information that agents communicate, such as goals and beliefs, has a significant impact on the performance of the system with respect to different, usually conflicting, performance metrics, such as speed of solution, communication efficiency, and travel distance/cost. Therefore, when designing a communication strategy for a multi-agent system, it is unlikely that one strategy can perform well with respect to all of performance metrics. Yet, it is not clear in advance, which strategy will be the best with respect to each metric. With multi-agent systems being a common paradigm for building distributed systems in different domains, performance goals can vary from one application to the other according to the domain’s specifications and requirements. To address this issue, this work proposes a genetic algorithm-based approach for learning a goal- oriented communication strategy. The approach enables learning an effective communication strategy with respect to flexible, user-defined measurable performance goals. The learned strategy will determine what, when, and to whom information should be communicated during the course of task execution in order to improve the performance of the system with respect to the stated goal. Our preliminary evaluation shows that the proposed approach has promising results and the learned strategies have significant usefulness in improving the performance of the system with respect to the goals.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2015, 9, 3; 52-64
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithms solution to the single-objective machining process optimization time model
Autorzy:
Amiolemhen, Patrick
Eseigbe, Joshua
Powiązania:
https://bibliotekanauki.pl/articles/95251.pdf
Data publikacji:
2019
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
production time
optimization
machining model
genetic algorithms
development
czas produkcji
optymalizacja
obróbka
algorytmy genetyczne
rozwój
Opis:
Minimum Production Time model of the machining process optimization problem comprising seven lathe machining operations were developed using Genetic Algorithms solution method. The various cost and time components involved in the minimum production cost and minimum production time criteria respectively, as well as all relevant technological/practical constraints were determined. An interactive, user-friendly computer package was then developed in Microsoft Visual Basic.Net environment to implement the developed models. The package was used to determine optimal machining parameters of cutting speed, feed rate and depth of cut for the seven machining operations with twenty-three technological constraints in the conversion of a cylindrical metal bar stock into a finished machined profile. The result of the single-objective machining process optimization models shows that the minimum production time is 21.84 min.
Źródło:
Journal of Mechanical and Energy Engineering; 2019, 3, 1; 13-23
2544-0780
2544-1671
Pojawia się w:
Journal of Mechanical and Energy Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective optimization of multipass turning machining process using the Genetic Algorithms solution
Autorzy:
Amiolemhen, Patrick Ejebheare
Eseigbe, Joshua Ahurome
Powiązania:
https://bibliotekanauki.pl/articles/95335.pdf
Data publikacji:
2019
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
turning process
genetic algorithms
minimum production cost
minimum production time
single-objective model
multi-objective model
toczenie
proces toczenia
algorytmy genetyczne
minimalny koszt produkcji
minimalny czas produkcji
model wielokryterialny
Opis:
The study involves the development of multi-objective optimization model for turning machining process. This model was developed using a GA - based weighted-sum of minimum production cost and time criteria of multipass turning machining process subject to relevant technological/practical constraints. The results of the single-objective machining process optimization models for the multipass turning machining process when compared with those of multi-objective machining process model yielded the minimum production cost and minimum production time as $5.775 and 8.320 min respectively (and the corresponding production time and production cost as 12.996 min and $6.992, respectively), while those of the multi-objective machining process optimization model were $5.841and 9.097 min. Thus, the multi-objective machining process optimization model performed better than each of the single-objective model for the two criteria of minimum production cost and minimum production time respectively. The results also show that minimum production time model performs better than the minimum production cost model. For the example considered, the multi-objective model gave a lower production time of 30.0% than the corresponding production time obtained from the minimum production cost model, while it gave a lower production cost of 16.46% than the corresponding cost obtained by the minimum production time model.
Źródło:
Journal of Mechanical and Energy Engineering; 2019, 3, 2; 97-108
2544-0780
2544-1671
Pojawia się w:
Journal of Mechanical and Energy Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Big data management algorithms in artificial Internet of Things-based fintech
Autorzy:
Andronie, Mihai
Iatagan, Mariana
Uță, Cristian
Hurloiu, Iulian
Dijmărescu, Adrian
Dijmărescu, Irina
Powiązania:
https://bibliotekanauki.pl/articles/19902795.pdf
Data publikacji:
2023
Wydawca:
Instytut Badań Gospodarczych
Tematy:
big data management algorithms
artificial intelligence
Internet of Things
fintech
banking
capital markets
Opis:
Research background: Fintech companies should optimize banking sector performance in assisting enterprise financing as a result of firm digitalization. Artificial IoT-based fintech-based digital transformation can relevantly reverse credit resource misdistribution brought about by corrupt relationship chains. Purpose of the article: We aim to show that fintech can decrease transaction expenses and consolidates firm stock liquidity, enabling excess leverage decrease and cutting down information asymmetry and transaction expenses across capital markets. AI- and IoT-based fintechs enable immersive and collaborative financial transactions, purchases, and investments in relation to payment tokens and metaverse wallets, managing financial data, infrastructure, and value exchange across shared interactive virtual 3D and simulated digital environments. Methods: AMSTAR is a comprehensive critical measurement tool harnessed in systematic review methodological quality evaluation, DistillerSR is harnessed in producing accurate and transparent evidence-based research through literature review stage automation, MMAT appraises and describes study checklist across systematic mixed studies reviews in terms of content validity and methodological quality predictors, Rayyan is a responsive and intuitive knowledge synthesis tool and cloud-based architecture for article inclusion and exclusion suggestions, and ROBIS appraises systematic review bias risk in relation to relevance and concerns. As a reporting quality assessment tool, the PRISMA checklist and flow diagram, generated by a Shiny App, was used. As bibliometric visualization and construction tools for large datasets and networks, Dimensions and VOSviewer were leveraged. Search terms were “fintech” + “artificial intelligence”, “big data management algorithms”, and “Internet of Things”, search period was June 2023, published research inspected was 2023, and selected sources were 35 out of 188. Findings & value added: The growing volume of financial products and optimized operational performance of financial industries generated by fintech can provide firms with multifarious financing options quickly. Big data-driven fintech innovations are pivotal in banking and capital markets in relation to financial institution operational efficiency. Through data-driven technological and process innovation capabilities, AI system-based businesses can further automated services.
Źródło:
Oeconomia Copernicana; 2023, 14, 3; 769-793
2083-1277
Pojawia się w:
Oeconomia Copernicana
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The eye tracking technique in the analysis of mechanisms for solving algorithmic problems
Autorzy:
Andrzejewska, Magdalena
Stolińska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/426423.pdf
Data publikacji:
2018
Wydawca:
Szkoła Główna Handlowa w Warszawie
Tematy:
algorithmic problems solving
flowchart of algorithms
teaching and learning programming
eye movement parameters
eye tracking
Opis:
The ability to solve problems using algorithms plays an increasingly important role in modern society, whereas programming, alongside with broadly understood digital skills, are considered to be one of the key competences of the future. The result of this trend is the modification in the Polish education system of the IT subjects’ core curriculum, under which teaching programming is planned at every stage of education. While teaching the skills of programming is important, it is not an easy task to achieve and hence it poses many methodological challenges. Researchers in this field are increasingly turning to new experimental methods, such as eye tracking techniques that allow to gain an insight into cognitive mechanisms and thus can provide objective information about the process of learning programming. The article discusses the results of authors’ own study, in which the state of declarative and procedural knowledge of students related to the forms of algorithm presentation was diagnosed. The questionnaires along with the tasks included in them, which the students solved in a traditional way and with the means of eye tracking techniques, were used in the study to track the process of solving comparable tasks presented on a computer monitor. The indicator of operational knowledge was the effectiveness of problem solving. The research was conducted on a group of 48 third-grade junior secondary school students. The obtained results (low level of correct answers) indicate that the situation in the area of learning the algorithmic skills of students requires improvement. The measurement data obtained using eye tracking allowed for an in-depth analysis and interpretation of visual activity of students. Therefore, it seems that eye tracking can be considered as a complementary research technique, enriching the state of knowledge on cognitive mechanisms that are triggered in the process of solving algorithmic problems.
Źródło:
e-mentor. Czasopismo naukowe Szkoły Głównej Handlowej w Warszawie; 2018, 2 (74); 10-18
1731-6758
1731-7428
Pojawia się w:
e-mentor. Czasopismo naukowe Szkoły Głównej Handlowej w Warszawie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Supplementary crossover operator for genetic algorithms based on the center-of-gravity paradigm
Autorzy:
Angelov, P.
Powiązania:
https://bibliotekanauki.pl/articles/205842.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
mutacja
środek bezwładności
center of gravity
crossover
genetic algorithms
mutation
selection operators
Opis:
A supplementary crossover operator for genetic algorithms (GA) is proposed in the paper. It performs specific breeding between the two fittest parental chromosomes. The new child chromosome is based on the center of gravity (CoG) paradigm, taking into account both the parental weights (measured by their fitness) and their actual value. It is designed to be used in combination with other crossover and mutation operators (it applies to the best fitted two parental chromosomes only) both in binary and real-valued (evolutionary) GA. Analytical proof of its ability to improve the result is provided for the simplest case of one variable and when the elitist selection strategy is used. The new operator is validated with a number of usually used numerical test functions as well as with a practical example of supply air temperature and flow rate scheduling in a hollow core ventilated slab thermal storage system. The tests indicate that it improves results (the speed of convergence as well as the final result) without a significant increase in computational expenses.
Źródło:
Control and Cybernetics; 2001, 30, 2; 159-176
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of the process of restoring the continuity of the WDS based on the matrix and genetic algorithm approach
Autorzy:
Antonowicz, Ariel
Urbaniak, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/2173692.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
WNTR
Water Network Tool for Resilience
aggregation of failures
water distribution system
EPANET Solver
Graph Searching Algorithms
genetic algorithm
optimization
post-disaster events
agregacja awarii
system dystrybucji wody
EPANET
algorytm wyszukiwania grafów
algorytm genetyczny
optymalizacja
wydarzenia po katastrofie
Opis:
The article discusses an example of the use of graph search algorithms with trace of water analysis and aggregation of failures in the occurrence of a large number of failures in the Water Supply System (WSS). In the event of a catastrophic situation, based on the Water Distribution System (WDS) network model, information about detected failures, the condition and location of valves, the number of repair teams, criticality analysis, the coefficient of prioritization of individual network elements, and selected objective function, the algorithm proposes the order of repairing the failures should be analyzed. The approach proposed by the authors of the article assumes the selection of the following objective function: minimizing the time of lack of access to drinking water (with or without prioritization) and minimizing failure repair time (with or without failure aggregation). The algorithm was tested on three different water networks (small, medium, and large numbers of nodes) and three different scenarios (different numbers of failures and valves in the water network) for each selected water network. The results were compared to a valve designation approach for closure using an adjacency matrix and a Strategic Valve Management Model (SVMM).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141594
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Badania elektromechanicznych zespołów napędowych zwałowarki ZGOT
Electromechanical driving systems tests of the spreader "ZGOT"
Autorzy:
Anuszczyk, J.
Jabłoński, M.
Powiązania:
https://bibliotekanauki.pl/articles/349394.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
górnictwo odkrywkowe
zwałowarka
zespoły napędowe
falownik
algorytmy sterowania
surface mining
spreader
driving systems
frequency converter
steering algorithms
Opis:
Artykuł przedstawia wyniki badań laboratoryjnych oraz przemysłowych gąsienicowych mechanizmów jazdy zwałowarki ZGOT-15400.120 pracującej na polu odkrywki Szczerców w Kopalni KWB "Bełchatów". Omówiono efekty wykonanych modyfikacji algorytmów sterowania zaimplementowanych w oprogramowaniu komercyjnych układów falownikowych odpowiadających za pracę napędów jazdy podawarki. Celem modyfikacji było usprawnienie pracy napędów pod kątem specjalistycznych zadań zwałowarki, a przede wszystkim ograniczenie drgań podczas rozruchu napędów oraz zapewnienie wysokiego poziomu niezawodności eksploatacyjnej zastosowanych rozwiązań.
Paper presents the results of laboratory and industrial testing of the caterpillar drives of the loading feeder of the spreader ZGOT-15400.120 working in the strip pit Szczerców of the KWB "Bełchatów" Mine. The electromagnetic and electromechanical transient states in the drive systems have been analysed. A new conception of sensorless steering algorithm modification in the CUVC bord controlling of converter has been introdused. After proposed solution the decrease of motors torque oscilations and mechanical vibrations in the low frequencies range of converter work was obtained.
Źródło:
Górnictwo i Geoinżynieria; 2009, 33, 2; 43-52
1732-6702
Pojawia się w:
Górnictwo i Geoinżynieria
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 750

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