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

  Lista filtrów
Wyrównaj
Wyświetlanie 16-30 z 869
Tytuł:
Investigating the effectiveness of the flipped classroom in an introductory programming course
Autorzy:
Souza, Manoj Joseph D
Rodrigues, Paul
Powiązania:
https://bibliotekanauki.pl/articles/2012135.pdf
Data publikacji:
2015-06-30
Wydawca:
Wydawnictwo Adam Marszałek
Tematy:
flipped classroom
programming self-efficacy
academic performance
introductory programming
Opis:
A flipped classroom is a teaching-learning environment in which students self-learn content by watching video lectures outside of the classroom and engage in learner-centered activities in the classroom with the guidance of an instructor. Earlier research into programming education has shown that students in the traditional classroom find introductory programming courses hard. This experimental study compared the effectiveness of a flipped classroom (experimental group, N=48) with a traditional classroom (control group, N=52) in two areas: 1. programming self-efficacy; and 2. academic performance. The results show that the students in the flipped classroom increased programming self-efficacy and achieved higher grades.
Źródło:
The New Educational Review; 2015, 40; 129-139
1732-6729
Pojawia się w:
The New Educational Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Models and tools for improving efficiency in Constraint Logic Programming
Autorzy:
Ligęza, A.
Powiązania:
https://bibliotekanauki.pl/articles/375886.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
constraint satisfaction problem (CSP)
constraint programming
constraint logic programming
Opis:
Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach.
Źródło:
Decision Making in Manufacturing and Services; 2011, 5, 1-2; 69-78
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Building an interpreter for the rey programming language using desing patterns
Autorzy:
Baszuro, P
Powiązania:
https://bibliotekanauki.pl/articles/117880.pdf
Data publikacji:
2009
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
Rey programming language
Opis:
Rey is an educational programming language. It is designed for students as their first programming language, so it contains a simple grammar and a user friendly environment. For ease of usage, an interpreter was chosen as the execution model. Most of the well-known industry interpreters are created with performance as a key point. Building an educational tool requires a different approach. Rather than performance, extensibility is the main goal of the Rey implementation. Unlike many others, the Rey interpreter is implemented in a high level programming language using design patterns. This paper describes the process of building a language interpreter using Interpreter, Factory Method and Visitor design patterns.
Źródło:
Applied Computer Science; 2009, 5, 1; 1-10
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Overlay Multicast Optimization : IBM ILOG CPLEX
Autorzy:
Kucharzak, M.
Zydek, D.
Poźniak-Koszałka, I.
Powiązania:
https://bibliotekanauki.pl/articles/226362.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
overlay multicast
maximum flows
linear programming
mixed-integer programming
Opis:
IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixed integer. Moreover, the optimization tool provides users with its Academic Research Edition, which is available for teaching and noncommercial research at no-charge. This paper describes the usage of CPLEX C++ API for solving linear problems and, as an exhaustive example, optimization of network flows in overlay multicast is taken into account. Applying continuous and integral variables and implementing various constraints, including equations and inequalities, as well as setting some global parameters of the solver are presented and widely explained.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 381-388
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the polyblock method to special integer chance constrained problem
Autorzy:
Bellahcene, Fatima
Powiązania:
https://bibliotekanauki.pl/articles/406257.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
stochastic programming
integer nonlinear programming
monotone optimization
polyblock method
Opis:
The focus in this paper is on a special integer stochastic program with a chance constraint in which, with a given probability, a sum of independent and normally distributed random variables is bounded below. The objective is to maximize the expectation of a linear function of the random variables. The stochastic program is first reduced to an equivalent deterministic integer nonlinear program with monotonic objective and constraints functions. The resulting deterministic problem is solved using the discrete polyblock method which exploits its special structure. A numerical example is included for illustration and comparisons with LINGO, COUENNE, BONMIN and BARON solvers are performed.
Źródło:
Operations Research and Decisions; 2019, 29, 4; 23-40
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm for the stochastic generalized transportation problem
Autorzy:
Anholcer, M.
Powiązania:
https://bibliotekanauki.pl/articles/406627.pdf
Data publikacji:
2012
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
generalized transportation problem
stochastic programming
convex programming
equalization method
Opis:
The equalization method for the stochastic generalized transportation problem has been presented. The algorithm allows us to find the optimal solution to the problem of minimizing the expected total cost in the generalized transportation problem with random demand. After a short introduction and literature review, the algorithm is presented. It is a version of the method proposed by the author for the nonlinear generalized transportation problem. It is shown that this version of the method generates a sequence of solutions convergent to the KKT point. This guarantees the global optimality of the obtained solution, as the expected cost functions are convex and twice differentiable. The computational experiments performed for test problems of reasonable size show that the method is fast.
Źródło:
Operations Research and Decisions; 2012, 22, 4; 9-20
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Programowanie może być interesujące – platforma Arduino
Programming can be interesting – Arduino platform
Autorzy:
Piecuch, Aleksander
Powiązania:
https://bibliotekanauki.pl/articles/446079.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Rzeszowski
Tematy:
Arduino
programowanie
programming
Opis:
Niniejsze opracowanie jest propozycją nauczania programowania języka C/C++ bazującego na platformie Arduino dla III etapu edukacyjnego. Programowanie mikrokontrolerów daje możli-wość nabycia szerokich kompetencji techniczno-informatycznych użytecznych zarówno w warun-kach szkolnych (uczelnianych), jak i pozaszkolnych. W przekonaniu autora może wpłynąć na: poszerzenie horyzontów wiedzy techniczno-informatycznej, wybór dalszej ścieżki edukacyjnej, rozbudzenie nowych zainteresowań możliwych do urzeczywistniania także w czasie wolnym.
This paper proposes teaching programming of language C/C++ based on the Arduino plat-form for the III education stage. Programming microcontrollers gives the opportunity of gaining a wide expertise in information technology useful both in school (university) as well as extracur-ricular activities. In the author’s opinion it may influence: broadening the horizons of information technology knowledge, the choice of future educational path, awakening new interests possible to realize also in spare time.
Źródło:
Dydaktyka informatyki; 2017, (12)2017; 155-160
2083-3156
Pojawia się w:
Dydaktyka informatyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
"On the Shoulders of Giants" A brief excursion into the history of mathematical programming
Autorzy:
Tichatschke, Rainer
Powiązania:
https://bibliotekanauki.pl/articles/729300.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
history
mathematical programming
Opis:
Similar to many mathematical fields also the topic of mathematical programming has its origin in applied problems. But, in contrast to other branches of mathematics, we don't have to dig too deeply into the past centuries to find their roots. The historical tree of mathematical programming, starting from its conceptual roots to its present shape, is remarkably short, and to quote Isaak Newton, we can say:
"We are standing on the shoulders of giants".
The goal of this paper is to describe briefly the historical growth of mathematical programming from its beginnings to the seventies of the last century and to review its basic ideas for a broad audience. During this process we will demonstrate that optimization is a natural way of thinking which follows some extremal principles.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2012, 32, 1; 5-44
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
Autorzy:
Arora, R.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/1403683.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bilevel programming
indefinite quadratic programming
multi-objective programming
pay-off matrix
Taylor series approximation
LINGO 17.0
Opis:
Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Źródło:
Archives of Control Sciences; 2020, 30, 4; 683-699
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model checking of java programs using networks of fadds
Autorzy:
Woźna, B.
Zbrzezny, A.
Powiązania:
https://bibliotekanauki.pl/articles/121764.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
język programowania Java
programowanie komputerowe
Pathfinder
języki programowania
Java programming language
computer programming
PathFinder code
programming languages
Opis:
In the paper we present the current theoretical base of the J2FADD tool, which translates a Java program to a network of finite automata with discrite data (FADDs).The reason for building the tool is that to model check a concurrent program writ-ten in Java by means of the tools like Uppaal or VerICS (the module VerICS ), an automata model of the Java program must be build first. This is because these tools verify only systems modeled as networks of automata, in particular, systems modeled as networks of FADDs. We also make an attempt to evaluate the J2FADD tool by comparison of it with the two well known Java verification tools: Bandera and Java PathFinder.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2009, 14; 151-164
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An integrated modelling approach for an optimal location of warehouses in the defence industry organisation
Autorzy:
Bayrakcı, Melda Gelibolu
Baykoç, Ömer Faruk
Powiązania:
https://bibliotekanauki.pl/articles/27315334.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
warehouse location
integer programming
defence industry
analytic hierarchy process
goal programming
Opis:
Countries’ defence industries are the leading indicator of their global power. The warehouse is the place where the materials are kept until the customer order arrives so that the companies are viable and can respond appropriately to internal/external customer demands. In this regard, warehouse location plays a vital role in the defence industry in terms of storage options with increased flexibility, a simplified supply chain with cost management and optimal positioning according to deployment locations. In this study, the decision on the location of warehouses for logistic support during the warranty period of military vehicles manufactured and supplied to the armed forces by a defence company was made. It is aimed to propose the best solution to a real-life problem with high complexity, containing many data and constraints. In this context, the criteria that are thought to be most relevant to this problem have been determined by taking expert opinions. Having determined the order of importance of the requirements by the analytical hierarchy process (AHP) with the Super Decisions V 2.10, their weights were included as a coefficient of the objective function in the goal programming (GP) model. As a result of solving the GP model using GAMS (general algebraic modelling system), it was decided to select the warehouses that provided the optimal results among the alternative warehouse locations in 9 different locations. Furthermore, to see the impact of changes in criterion weights, sensitivity analysis has also been included. The significance of this research lies within the integrated usage of AHP and GP in the defence industry when determining warehouse locations by the experts’ opinions. With this study, not only a solution strategy was developed, but also a basis for the warehouse location decision in the defence industry projects already signed or to be signed was given.
Źródło:
Operations Research and Decisions; 2023, 33, 2; 35--52
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal algorithms for seeking the minimum
Autorzy:
Adamski, A.
Korytowski, A.
Mitkowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/747469.pdf
Data publikacji:
1977
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Mathematical programming methods, Numerical analysis, Mathematical programming, optimization and variational techniques
Opis:
.
The definition of the optimality of an algorithm is modified so that the optimal algorithm satisfies Bellman's principle. The search for a minimum using this technique is compared with J. Kiefer's algorithm
Źródło:
Mathematica Applicanda; 1977, 5, 11
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic programming approach to shape optimization
Autorzy:
Fulmański, P.
Nowakowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/206302.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
dynamic programming
shape optimization
Opis:
We provide a dynamic programming approach through the level set setting to structural optimization problems. By constructing a dual dynamic programming method we provide the verification theorem for optimal and "−optimal solutions of shape optimization problem.
Źródło:
Control and Cybernetics; 2014, 43, 3; 379-401
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wieloletnie programowanie rozwoju społeczno-gospodarczego Walii
Long-Term Programs for the Socioeconomic Development of Wales
Autorzy:
Szlachta, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/575709.pdf
Data publikacji:
2006-08-31
Wydawca:
Szkoła Główna Handlowa w Warszawie. Kolegium Analiz Ekonomicznych
Tematy:
model
programming
development
Wales
Opis:
The article examines the model and programs for the socioeconomic development of Wales. As a result of a devolution process, Wales gained the possibility of independently programming its developing policy in the 21st century. Wales is also a major beneficiary of European structural funds, as a result of which its national strategies must be in line with the priorities of European regional policy. The main value of the article is that it assesses, in a uniform analytical arrangement, the most important strategic long-term and medium-term documents of Wales, including a plan for the regional development of the country, a long-term concept for environmental policy, a medium-term strategy of socioeconomic development and a section of the National Strategic Reference Framework for 2007-2013 applying to Wales. All these documents represent an internally consistent arrangement, which also applies to studies prepared for the needs of the European Union. The analysis shows that Wales, taking advantage of the process of devolution, adopted a modern model of socioeconomic development oriented toward building a knowledge-based society. Logical and internally consistent development activities are especially important to an effective economic policy. An analysis of the Welsh socioeconomic policy and its EU context reveals that many of this country’s experiences may be applied in other EU countries and regions, in keeping with the principle of promoting best practices. Because Poland faces development challenges similar to those embraced by Wales over the past few years, the final part of the text presents the most important conclusions and recommendations for Poland.
Źródło:
Gospodarka Narodowa. The Polish Journal of Economics; 2006, 209, 7-8; 83-96
2300-5238
Pojawia się w:
Gospodarka Narodowa. The Polish Journal of Economics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Programowanie skoordynowanych ruchów robotów na przykładzie robotów ABB i Fanuc
Programming of coordinated motion for ABB and Fanuc robots
Autorzy:
Słota, A.
Domka, M.
Powiązania:
https://bibliotekanauki.pl/articles/275319.pdf
Data publikacji:
2010
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
roboty
programowanie
robots
programming
Opis:
W pracy przedstawiono charakterystykę rozwiązań: MultiMove firmy ABB oraz DUALARM, Multi arm control i Robot Link firmy Fanuc Robotics umożliwiających koordynację ruchów robotów. Przedstawiono przykłady konfiguracji stanowisk, wymagane opcje oprogramowania oraz kalibrację układów współrzędnych robotów. Dla rozwiązania MultiMove przedstawiono przykład stanowiska wykorzystującego koordynację ruchów do przenoszenia przedmiotu przez dwa roboty oraz zamieszczono fragmenty programów.
In the paper description of functionalities of robots' motion coordination provided by ABB and Fanuc Robotics is presented - solutions MultiMove, DUALARM, Multi arm control and Robot Link are described. Examples of configuration, required software options and TCP calibration are presented. For MultiMove solution an example of work cell which uses coordinated motion of two robots for workpiece transport is presented. Sample robot programs are included.
Źródło:
Pomiary Automatyka Robotyka; 2010, 14, 2; 635-644
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 16-30 z 869

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