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 1-15 z 861
Tytuł:
Stochastic algorithms in discrete optimization with noisy values for the function
Autorzy:
Wieczorkowski, Robert
Powiązania:
https://bibliotekanauki.pl/articles/747459.pdf
Data publikacji:
1995
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Stochastic programming
Mathematical programming methods
Integer programming
Opis:
.
The paper deals with stochastic methods for searching approximately global minimum of function defined on discrete set. A measure of quality of solution is defined to compare different algorithms. Simple Monte Carlo method is analysed as main algorithm for which formulas dealing with the measure of quality are derived(two cases: exact values and noisy values of function). This Monte Carlo method is used as a base in simulation experiments for comparing other stochastic algorithms. The second part of the paper analyses asymptotic properties of the generalised simulated annealing algorithms. Theory of Markov chains is used in modelling this class of algorithms. Theorems about convergence of the records of algorithms to set of optima with probability one are presented in the case of function having random noisy values. The paper also reviews known results in the field of simulated annealing type algorithms for function with randomly perturbated values.
Źródło:
Mathematica Applicanda; 1995, 24, 38
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimization of a concave function on a convex polyhedron
Autorzy:
Kryński, Stanisław L.
Powiązania:
https://bibliotekanauki.pl/articles/747846.pdf
Data publikacji:
1982
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Convex programming
Nonlinear programming
Opis:
.
The problem of minimizing a concave function on a convex polyhedron is considered. The author proposes a solution algorithm which, starting from a vertex representing a local minimum of the objective function, constructs a sequence of auxiliary linear programming problems in order to find a global minimum. The convergence of the algorithm is proven.
Źródło:
Mathematica Applicanda; 1982, 10, 21
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision makers preferences modeling for multiple objective stochastic linear programming problems
Autorzy:
Bellahcene, Fatima
Powiązania:
https://bibliotekanauki.pl/articles/406663.pdf
Data publikacji:
2019
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
multiobjective programming
stochastic programming
nonlinear programming
satisfaction function
Opis:
A method has been suggested which solves a multiobjective stochastic linear programming problem with normal multivariate distributions in accordance with the minimum-risk criterion. The approach to the problem uses the concept of satisfaction functions for the explicit integration of the preferences of the decision-maker for different achievement level of each objective. Thereafter, a nonlinear deterministic equivalent problem is formulated and solved by the bisection method. Numerical examples with two and three objectives are given for illustration. The solutions obtained by this method are compared with the solutions given by other approaches.
Źródło:
Operations Research and Decisions; 2019, 29, 3; 5-16
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sensitivity analysis in piecewise linear fractional programming problem with non-degenerate optimal solution
Autorzy:
Kheirfam, B.
Powiązania:
https://bibliotekanauki.pl/articles/255257.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
piecewise linear fractional programming
fractional programming
piecewise linear programming
sensitivity analysis
Opis:
In this paper, we study how changes in the coefficients of objective function and the right-hand-side vector of constraints of the piecewise linear fractional programming problems affect the non-degenerate optimal solution. We consider separate cases when changes occur in different parts of the problem and derive bounds for each perturbation, while the optimal solution is invariant. We explain that this analysis is a generalization of the sensitivity analysis for LP, LFP and PLP. Finally, the results are described by some numerical examples.
Źródło:
Opuscula Mathematica; 2009, 29, 3; 253-269
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximating the solution of a dynamic, stochastic multiple knapsack problem
Autorzy:
Hartman, J. C.
Perry, T. C.
Powiązania:
https://bibliotekanauki.pl/articles/970874.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie liniowe
dualność
stochastic dynamic programming
approximate dynamic programming
linear programming
duality
Opis:
We model an environment where orders arrive probabilistically over time, with their revenues and capacity requirements becoming known upon arrival. The decision is whether to accept an order, receiving a reward and reserving capacity, or reject an order, freeing capacity for possible future arrivals. We model the dynamic, stochastic multiple knapsack problem (DSMKP) with stochastic dynamic programming (SDP). Multiple knapsacks are used as orders may stay in the system for multiple periods. As the state space grows exponentially in the number of knapsacks and the number of possible orders per period, we utilize linear programming and duality to quickly approximate the end-of-horizon values for the SDP. This helps mitigate end-of-study effects when solving the SDP directly, allowing for the solution of larger problems and leading to increased quality in solutions.
Źródło:
Control and Cybernetics; 2006, 35, 3; 535-550
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy programming for multi-choice bilevel transportation problem
Autorzy:
Arora, Ritu
Gupta, Kavita
Powiązania:
https://bibliotekanauki.pl/articles/2100292.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
bilevel programming
transportation problem
fuzzy programming
goal programming
tolerance limit
satisfactory solution
Opis:
Multi-choice programming problems arise due to the diverse needs of people. In this paper, multichoice optimization has been applied to the bilevel transportation problem. This problem deals with transportation at both the levels, upper as well as lower. There are multiple choices for demand and supply parameters. The multi-choice parameters at the respective levels are converted into polynomials which transmute the defined problem into a mixed integer programming problem. The objective of the paper is to determine a solution methodology for the transformed problem. The significance of the formulated model is exhibited through an example by applying it to the hotel industry. The fuzzy programming approach is employed to obtain a satisfactory solution for the decision-makers at the two levels. A comparative analysis is presented in the paper by solving the bilevel multi-choice transportation problem with goal programming mode as well as by the linear transformation technique. The example is solved using computing software.
Źródło:
Operations Research and Decisions; 2021, 31, 3; 5--21
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On solving linear programming problems with embedded network structure
Autorzy:
Zorychta, Krystian
Powiązania:
https://bibliotekanauki.pl/articles/748505.pdf
Data publikacji:
1991
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Linear programming
Opis:
W pracy przedstawiony jest uniwersalny algorytm rozwiązywania zagadnień optymalnej dystrybucji w sieci transportowej, poddanej dodatkowym ograniczeniom liniowym, czyli tzw. zadań programowania liniowego z wbudowaną strukturą sieciową. Algorytm ten funkcjonuje na zasadzie pierwotnej metody sympleksowej i opiera się na dekompozycji bazy na cztery bloki. Czynnikiem decydującym o efektywności algorytmu jest sposób realizacji operacji z udziałem bloku sieciowego. Dlatego szczególny nacisk położony jest w pracy na zaprojektowaniu struktur danych uwzględniających specyfikę tego bloku i pozwalających wykorzystać ją w pełni na poziomie implementacji.
A special partitioning algorithm for solving linear programming problems with embed-ded network structure is presented. As an example of such a problem the minimum-cost network flow problem under additional linear constraints can be considered. This algorithm is a primal simplex basis partitioning method that uses special updating and labeling procedures to accelerate computations involving the network linear programming interface. These procedures are discribed in detail to develop an efficient implementation of the method.
Źródło:
Mathematica Applicanda; 1991, 19, 33
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using erlang in research and education in a technical university
Autorzy:
Petrov, I.
Alexeyenko, A.
Ivanova, G.
Powiązania:
https://bibliotekanauki.pl/articles/305254.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
parallel programming
distributed programming
teaching
graph theory
concurrency
recursion
survey
functional programming
Opis:
This paper addresses the problem of using functional programming (FP) languages for research and educational purposes. In order to identify the problems associated with the use of FP languages such as Erlang, an experiment consisting of two surveys was performed. The first survey was anonymous and aimed at establishing whether the participants prefer object-oriented or functional coding. The second one was a survey made after the students finished an Erlang course. The results of these two surveys demonstrate that functional programming is underrated with no apparent reasons. Possible steps to address this problem are suggested.
Źródło:
Computer Science; 2018, 19 (3); 333-343
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quasiconvex and pseudoconvex functions in nonlinear programming
Autorzy:
Dubnicki, Walerian
Zorychta, Krystian
Powiązania:
https://bibliotekanauki.pl/articles/747759.pdf
Data publikacji:
1987
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Nonlinear programming
Opis:
.
The paper based on B. Martos’ ideas (B. Martos, Nonlinear programming theory and methods, Akademiai Kiado, Budapest 1975. Polish translation PWN 1983) presents theoretical results concerning quasiconvex and pseudoconvex functions.
Źródło:
Mathematica Applicanda; 1985, 15, 29
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The SUBQ method in quadratic programming
Autorzy:
Hille, Grażyna
Powiązania:
https://bibliotekanauki.pl/articles/748070.pdf
Data publikacji:
1980
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Quadratic programming
Opis:
.
Author's summary: "In linear programming the simple upper bound method (SUB in short) is well known. It is a modification of the simplex method which finds a minimum of the target function on an admissible set with some additional conditions of the form β≤x≤α imposed on x. "In this paper we present a method which solves the problem of minimization of a quadratic, convex target function on an admissible set defined by conditions of the form β≤x≤α. It is a modification of the C. E. Lemke algorithm [Management Sci. 8 (1961/62), 442–453; MR0148483] for problems of quadratic programming. Because of the special form of the conditions defining the admissible set this method is in a sense a counterpart of the SUB method in linear programming. Therefore we call the algorithm the SUBQ algorithm (the simple upper bound algorithm for quadratic programming). "In Section 2 we give a description of the method based mainly on a geometric interpretation. In Section 3 we present the algorithm and in Section 4 we give a proof of the convergence of the method.''
Źródło:
Mathematica Applicanda; 1980, 8, 16
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Use of Aspects to Simplify Concurrent Programming
Autorzy:
Negacz, M
Hnatkowska, B.
Powiązania:
https://bibliotekanauki.pl/articles/384103.pdf
Data publikacji:
2014
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
Simplify Concurrent Programming
multi-threaded programs
concurrent programming
Opis:
Developers who create multi-threaded programs must pay attention to ensuring safe implementations that avoid problems and prevent introduction of a system in an inconsistent state. To achieve this objective programming languages offer more and more support for the programmer by syntactic structures and standard libraries. Despite these enhancements, multi-threaded programming is still generally considered to be difficult. The aim of our study was the analysis of existing aspect oriented solutions, which were designed to simplify concurrent programming, propose improvements to these solutions and examine influence of concurrent aspects on complexity of programs. Improved solutions were compared with existing by listing differing characteristics. Then we compared classical concurrent applications with their aspect oriented equivalents using metrics. Values of 2 metrics (from 7 considered) decreased after using aspect oriented solutions. Values of 2 other metrics decreased or remained at the same level. The rest behaved unstably depending on the problem. No metric reported increase of complexity in more than one aspect oriented version of program from set. Our results indicate that the use of aspects does not increase the complexity of a program and in some cases application of aspects can reduce it.
Źródło:
e-Informatica Software Engineering Journal; 2014, 8, 1; 27-37
1897-7979
Pojawia się w:
e-Informatica Software Engineering Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem
Autorzy:
Jain, P.
Saran, G.
Srivastava, K.
Powiązania:
https://bibliotekanauki.pl/articles/384223.pdf
Data publikacji:
2016
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Vertex Bisection Minimization
Integer Linear Programming
quadratic programming
Opis:
Vertex Bisection Minimization problem (VBMP) consists of partitioning a vertex set V of graph G = (V, E) into two sets B and B′ where ∣B∣ = [\v|/2] such that vertex width (VW) is minimized where vertex width is defined as the number of vertices in B which are adjacent to at least one vertex in B′. It is an NP-complete problem in general. VBMP has applications in fault tolerance and is related to the complexity of sending messages to processors in interconnection networks via vertex disjoint paths. In this paper, we have proposed a new integer linear programming (ILP) and quadratically constrained quadratic programming (QCQP) formulation for VBMP. Both of them require number of variables and constraints lesser than existing ILPs and QCQP. We have also implemented ILP and obtained optimal results for various classes of graphs. The result of the experiments with the benchmark graphs shows that the proposed model outperforms the state of the art. Moreover, proposed model obtains optimal result for all the benchmark graphs.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 1; 69-73
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Postoptimal analysis in the coefficients matrix of piecewise linear fractional programming problems with non-degenerate optimal solution
Autorzy:
Kheirfam, B.
Powiązania:
https://bibliotekanauki.pl/articles/255497.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
piecewise linear fractional programming
degeneracy
optimal basis
fractional programming
piecewise linear programming
sensitivity analysis
Opis:
In this paper, we discuss how changes in the coefficients matrix of piecewise linear fractional programming problems affect the non-degenerate optimal solution. We consider separate cases when changes occur in the coefficients of the basic and non-basic variables and derive bounds for each perturbation, while the optimal solution is invariant. We explain that this analysis is a generalization of the sensitivity analysis for LP, LFP and PLP. Finally, the results are described by some numerical examples.
Źródło:
Opuscula Mathematica; 2010, 30, 3; 281-294
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hash function generation by means of Gene Expression Programming
Autorzy:
Varrette, S.
Muszyński, J.
Bouvry, P.
Powiązania:
https://bibliotekanauki.pl/articles/106148.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
hash function
Gene Expression Programming
Genetic Programming
GEPHashSearch
cryptography
Opis:
Cryptographic hash functions are fundamental primitives in modern cryptography and have many security applications (data integrity checking, cryptographic protocols, digital signatures, pseudo random number generators etc.). At the same time novel hash functions are designed (for instance in the framework of the SHA-3 contest organized by the National Institute of Standards and Technology (NIST)), the cryptanalysts exhibit a set of statistical metrics (propagation criterion, frequency analysis etc.) able to assert the quality of new proposals. Also, rules to design "good" hash functions are now known and are followed in every reasonable proposal of a new hash scheme. This article investigates the ways to build on this experiment and those metrics to generate automatically compression functions by means of Evolutionary Algorithms (EAs). Such functions are at the heart of the construction of iterative hash schemes and it is therefore crucial for them to hold good properties. Actually, the idea to use nature-inspired heuristics for the design of such cryptographic primitives is not new: this approach has been successfully applied in several previous works, typically using the Genetic Programming (GP) heuristic [1]. Here, we exploit a hybrid meta-heuristic for the evolutionary process called Gene Expression Programming (GEP) [2] that appeared far more efficient computationally speaking compared to the GP paradigm used in the previous papers. In this context, the GEPHashSearch framework is presented. As it is still a work in progress, this article focuses on the design aspects of this framework (individuals definitions, fitness objectives etc.) rather than on complete implementation details and validation results. Note that we propose to tackle the generation of compression functions as a multi-objective optimization problem in order to identify the Pareto front i.e. the set of non-dominated functions over the four fitness criteria considered. If this goal is not yet reached, the first experimental results in a mono-objective context are promising and open the perspective of fruitful contributions to the cryptographic community.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 3; 37-53
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
Wyświetlanie 1-15 z 861

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