Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "problem" wg kryterium: Temat


Tytuł:
Duration problem: basic concept and some extensions
Autorzy:
Porosiński, Zdzisław
Skarupski, Marek
Szajowski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/747507.pdf
Data publikacji:
2016
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
optimal stopping
duration problem
secretary problem
optymalne zatrzymanie, problem okresu trwania, problem sekretarki
Opis:
Rozważmy ciąg niezależnych zmiennych losowych o znanym rozkładzie. n-ta obserwacja jest wartością pewnej statystyki pozycyjnej, powiedzmy s:n, gdzie s przyjmuje watości od 1 do n. W chwilach następujących po n-tej obserwacji może ona pozostać s:m lub zmieni swoją pozycję tak, iż stanie się statystyką pozycyjną r:m (gdzie m> n jest liczbą obserwacji). Zmiana rangi naszej obserwacji pośród wciąż powiększającego się zbioru wszystkich obserwacji jest zjawiskiem, które nie jest łatwo przewidzieć. Z pewnych względów jest to interesujący problem. Stawiamy zatem pytanie o moment pojawienia się obserwacji, której ranga się nie zmieni znacząco aż do czasu, gdy skończymy obserwować zjawisko. Można również postawić problem w następujący sposób: ''Który obserwowalny obiekt powinniśmy zatrzymać tak, aby posiadać obiekt dobrej jakości najdłużej jak to tylko możlwe?'' Pytanie to było rozważane przez Ferguson, Hardwick and Tamaki (1991) w problemie, który został nazwany  problem of duration, a który został tu nazywamy problemem okresu trwania.Niniejsza praca ma na celu uporządkowanie znanych do tej pory modeli problemu okresu trwania oraz prezentację kilku nowych rozszerzeń. Zabrane zostały wyniki z różnych prac na temat okresu trwania dla ekstremalnej obserwacji w przypadku bez-informacyjnym (nazywanym również modelem rangowym, no-information case) oraz w przypadku pełno-informacyjnym (full-information case). W przypadkach obserwacji nieekstremalnych najczęściej pojawiającym się modelem jest model dla pierwszej i/lub drugiej statystyki pozycyjnej. Model bez-informacyjny mówi o maksymalizacji okresu trwania dla pierwszego lub drugiego najlepszego obiektu. Idea ta została sformułowana przez Szajowski i Tamaki (2006). Przypadek pełno-informacyjny z pewnymi ograniczeniami został zaprezentowany przez Kurushima i Ano(2010). 
  We consider a sequence of independent random variables with the known distribution observed sequentially. The observation n is a value of one order statistics s : n-th, where 1 ≤ s ≤ n. It the instances following the n-th observation it may remain of the s : m or it will be the value of the order statistics r : m (of m > n observations). Changing the rank of the observation, along with expanding a set of observations is a random phenomenon that is difficult to predict. From practical reasons it is of great interest. Among others, we pose the question of the moment in which the observation appears and whose rank will not change significantly until the end of sampling of a certain size. We also attempt to answer which observation should be kept to have the "good quality observation" as long as possible. This last question was analysed by Ferguson, Hardwick and Tamaki (1991) in the abstract form which they called the problem of duration.This article gives a systematical presentation of known duration models and some new generalization. We collect results from different papers on the duration of the extremal observation in the no-information (say rank based) case and the full-information case. In the case of non-extremal observation duration models the most appealing are various setting related to the two extremal order statistic. In the no-information case it will be the maximizing duration of owning the relatively the best or the second best object. The idea was formulated and the problem was solved by Szajowski and Tamaki (2006). The full-information duration problem with special requirement was presented by Kurushima and Ano (2010).
Źródło:
Mathematica Applicanda; 2016, 44, 1
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On bi-criteria two-stage transportation problem: a case study
O dwukryterialnym, dwuetapowym problemie transportowym: studium przypadku
Autorzy:
Murad, A.
Al-Ali, A.
Ellaimony, E.
Abdelwali, H.
Powiązania:
https://bibliotekanauki.pl/articles/374839.pdf
Data publikacji:
2010
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
problem transportowy dwuetapowy
problem transportowy dwukryterialny
two stage transportation problem
bi-criteria transportation problem
Opis:
The study of the optimum distribution of goods between sources and destinations is one of the important topics in projects economics. This importance comes as a result of minimizing the transportation cost, deterioration, time, etc. The classical transportation problem constitutes one of the major areas of application for linear programming. The aim of this problem is to obtain the optimum distribution of goods from different sources to different destinations which minimizes the total transportation cost. From the practical point of view, the transportation problems may differ from the classical form. It may contain one or more objective function, one or more stage to transport, one or more type of commodity with one or more means of transport. The aim of this paper is to construct an optimization model for transportation problem for one of mill-stones companies. The model is formulated as a bi-criteria two-stage transportation problem with a special structure depending on the capacities of suppliers, warehouses and requirements of the destinations. A solution algorithm is introduced to solve this class of bi-criteria two-stage transportation problem to obtain the set of non-dominated extreme points and the efficient solutions accompanied with each one that enables the decision maker to choose the best one. The solution algorithm mainly based on the fruitful application of the methods for treating transportation problems, theory of duality of linear programming and the methods of solving bi-criteria linear programming problems.
Analiza optymalnej dystrybucji towarów pomiędzy punktem początkowym a końcowym jest jednym z ważnych zagadnień w ekonomice projektów. Ma to znaczenie jako wynik minimalizacji kosztów transportu, rozkładu przewozów, czasu, etc. Klasyczny problem transportowy stanowi jedno z głównych zagadnień programowania liniowego. Rozwiązaniem tego problemu jest uzyskanie optymalnej dystrybucji towarów z różnych źródeł do różnych punktów przeznaczenia, co minimalizuje całkowity koszt transportu. Z praktycznego punktu widzenia problemy transportowe mogą się różnić od problemów w formie klasycznej. Mogą one zawierać jedną lub więcej funkcji celu, jedną lub więcej tras, jeden lub więcej rodzajów towarów przewożonych za pomocą jednego lub więcej środków transportu. Celem artykułu jest stworzenie modelu optymalizacyjnego, który rozwiązuje problem transportowy dla jednej z firm przewozowych, specjalizującej się w przewozie kruszyw. Model jest sformułowany jako dwukryterialny, dwuetapowy problem transportowy w celu pozyskania zbioru ekstremów lokalnych oraz skutecznych rozwiązań związanych z takimi, które pozwalają osobie podejmującej decyzję wybrać te najodpowiedniejsze. Algorytm rozwiązania bazuje głównie na efektywnej aplikacji metod rozwiązywania problemów transportowych, teorii dualizmu programowania liniowego oraz metodach poszukiwania rozwiązań dwukryterialnych problemów programowania liniowego.
Źródło:
Transport Problems; 2010, 5, 3; 103-114
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Redefining the Modifiable Areal Unit Problem Within Spatial Econometrics, the Case of the Aggregation Problem
Autorzy:
Pietrzak, Michał Bernard
Powiązania:
https://bibliotekanauki.pl/articles/517415.pdf
Data publikacji:
2014
Wydawca:
Instytut Badań Gospodarczych
Tematy:
spatial econometrics
modifiable areal unit problem
scale problem
aggregation problem
Opis:
The paper focuses on the issue of the aggregation problem, which is frequently discussed within spatial econometrics. The aggregation problem is one of the two aspects of the modifiable areal unit problem (MAUP). The aggregation problem is connected with the volatility of the obtained results occurred when various compositions of territorial units for the same aggregation scale were applied. The objective of the present paper is to consider the redefinition of aggregation problem and showing positive solution of the aggregation problem based on the empirical example of determining agricultural macroregions. In the article the aggregation problem was defined as a problem of establishing a particular composition of territorial units at a selected aggregation scale in a such a way that is remains in the quasi composition of regions within the undertaken research problem. The paper also presented the procedure for determining agricultural macroregions where the analysis of the spatial volatility of the agrarian structure and the current knowledge on the agriculture in Poland were applied. In addition, the paper considered the final areal interpretation problem con-nected with the incorrect determination of the area in relation to which final conclusions are drawn. The problem was presented basing on the example of the establishment of the average concentration of the area of agricultural land in Poland with the use of the Gini index calculated for districts. The paper emphasised that ignoring the final areal interpretation problem in spatial analyses may lead to an apparent identification of the modifiable areal unit problem.
Źródło:
Equilibrium. Quarterly Journal of Economics and Economic Policy; 2014, 9, 3; 131-151
1689-765X
2353-3293
Pojawia się w:
Equilibrium. Quarterly Journal of Economics and Economic Policy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Redefining The Modifiable Areal Unit Problem Within Spatial Econometrics, the Case of The Scale Problem
Autorzy:
Bernard Pietrzak, Michał
Powiązania:
https://bibliotekanauki.pl/articles/517391.pdf
Data publikacji:
2014
Wydawca:
Instytut Badań Gospodarczych
Tematy:
spatial econometrics
modifiable areal unit problem
scale problem
aggregation problem
Opis:
The paper focuses on the issue of the modifiable areal unit problem (MAUP), which is frequently discussed within spatial econometrics. This issue concerns the changeability of the characteristics of the analysed phenomena under the impact of the change in the composition of territorial units. The article indicates four conditions which need to be fulfilled if the correctness of spatial analyses is to be maintained. Also, the paper introduces the concept of the quasi composition of regions (QCR). It was defined as a set of particular compositions of territorial units for subsequent aggregation scales. Particular compositions of territorial units are selected in a way that allows a correct analysis within the undertaken research problem to be conducted. The chief asset of the paper is the proposal to redefine the concept of the modifiable areal unit problem. Both the scale problem and the aggregation problem were linked to the accepted quasi composition of regions. The redefinition of the concept is vital for the research conducted since analysing phenomena based on compositions of territorial units which are excluded from the quasi composition of regions leads to the formulation of incorrect conclusions. Within the undertaken research problem there exists only one particular composition of territorial units which allows the identification and description of the dependence for analysed phenomena. Within the considered modifiable areal unit problem two potential problems were defined and they can occur while making spatial analyses. The first is the final areal interpretation problem (FAIP) that occurs when the characteristics of phenomena or the dependence are designated for too large region. The other issue is the aggregation scale interpretation problem (ASIP). It occurs when a quasi composition of regions is enlarged by an aggregation scale where the correctness of the results of the undertaken research problem is not preserved. In both cases it is possible to reach a situation where the obtained characteristics will be deprived of the cognitive value.
Źródło:
Equilibrium. Quarterly Journal of Economics and Economic Policy; 2014, 9, 2; 111-132
1689-765X
2353-3293
Pojawia się w:
Equilibrium. Quarterly Journal of Economics and Economic Policy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On some elliptic transmission problems
Autorzy:
Athanasiadis, Christodoulos
Stratis, Ioannis
Powiązania:
https://bibliotekanauki.pl/articles/1311187.pdf
Data publikacji:
1996
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
transmission condition
Dirichlet problem
Robin problem
diffraction problem
acoustic scattering
Opis:
Boundary value problems for second order linear elliptic equations with coefficients having discontinuities of the first kind on an infinite number of smooth surfaces are studied. Existence, uniqueness and regularity results are furnished for the diffraction problem in such a bounded domain, and for the corresponding transmission problem in all of $ℝ^N$. The transmission problem corresponding to the scattering of acoustic plane waves by an infinitely stratified scatterer, consisting of layers with physically different materials, is also studied.
Źródło:
Annales Polonici Mathematici; 1996, 63, 2; 137-154
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A modified hat problem
Autorzy:
Krzywkowski, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/746273.pdf
Data publikacji:
2010
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
hat problem
variation of hat problem
Opis:
The topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultane- ously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many variations of the hat problem. In this paper we consi- der a variation in which there are \(n\geq 3\) players, and blue and red hats. Players do not have to guess their hat colors simultaneously. In this variation of the hat problem players guess their hat colors by coming to the basket and throwing the proper card into it. Every player has got two cards with his name and the sentence ``I have got a red hat'' or ``I have got a blue hat''. If someone wants to resign from answering, then he does not do anything. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. Is there a strategy such that the team always succeeds? We give an optimal strategy for the problem which always succeeds. Additionally, we prove in which step the team wins using the strategy. We also prove what is the greatest possible number of steps that are needed for the team to win using the strategy.
Źródło:
Commentationes Mathematicae; 2010, 50, 2
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A secretary problem with missing observations
Autorzy:
Ramsey, David Mark
Powiązania:
https://bibliotekanauki.pl/articles/747394.pdf
Data publikacji:
2016
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
secretary problem, missing observations, stopping problem
Opis:
Two versions of a best choice problem in which an employer views a sequence of $N$ applicants are considered. The employer can hire at most one applicant. Each applicant is available for interview (and, equivalently, for employment) with some probability $p$.The available applicants are interviewed in the order that they are observed and the availability of the $i$-th applicant is ascertained before the employer can observe the $(i+1)$-th applicant. The employer can rank an available applicant with respect to previously interviewed applicants. The employer has no information on the value of applicants who are unavailable for interview. Applicants appear in a random order. An employer can only offer a position to an applicant directly after the interview. If an available applicant is offered the position, then he will be hired. In the first version of the problem, the goal of the employer is to obtain the best of all the applicants. The form of the optimal strategy is derived. In the second version of the problem, the goal of the employer to obtain the best of the available applicants. It is proposed that the optimal strategy for this second version is of the same form as the form of the optimal strategy for the first version. Examples and the results of numerical calculations are given.
Źródło:
Mathematica Applicanda; 2016, 44, 1
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SAT-based searching for k-quasi-optimal runs in weighted timed automata
Autorzy:
Woźna-Szcześniak, B.
Zbrzezny, A.
Powiązania:
https://bibliotekanauki.pl/articles/121744.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
SAT
timed automata
air traffic control problem
reachability problem
automat czasowy
problem kontroli ruchu lotniczego
problem osiągalności
Opis:
In the paper we are concerned with an optimal cost reachability problem for weighted timed automata, and we use a translation to SAT to solve the problem. In particular, we show how to find a run of length k ∈ IN that starts at the initial state and terminates at a state containing a target location, its total cost belongs to the interval [c,c+1), for some natural number c ∈ IN, and the cost of each other run of length k, which also leads from the initial state to a state containing the target location, is greater or equal to c. This kind of runs is called k-quasi-optimal. We exemplify the use of our solution to the mentioned problem by means of the air traffic control problem, and we provide some preliminary experimental results.
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2010, 15; 163-176
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Weakly nonlinear boundaty value problems for differential systems with impulse action
Slabonelinejjnye kraevye zadachi dlja sistem differencial'nykh uravnenijj s impul'snym vozdejjstviem
Autorzy:
Ovchar, R.
Powiązania:
https://bibliotekanauki.pl/articles/76835.pdf
Data publikacji:
2013
Wydawca:
Komisja Motoryzacji i Energetyki Rolnictwa
Tematy:
nonlinear boundary value problem
linear boundary value problem
differential equation
Cauchy problem
Opis:
Coefficient obtained sufficient conditions for the existence and iterative algorithm of solutions of weakly nonlinear boundary value problems for ordinary differential equations with impulse action in general, when the number of boundary conditions does not coincide with the order of the differential system.
Коэффициенты получены с достаточных условий для существования и итерационного алгоритма решения через слабо нелинейни краеви задачи для обыкновенных дифференциальных уравнений с импульсным воздействием в общем случае, когда число граничных условий не совпадает с порядком дифференциального системы.
Źródło:
Motrol. Motoryzacja i Energetyka Rolnictwa; 2013, 15, 3
1730-8658
Pojawia się w:
Motrol. Motoryzacja i Energetyka Rolnictwa
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Solution of a Finite Element Approximation of a Linear Obstacle Plate Problem
Autorzy:
Fernandes, L. M.
Figueiredo, I. N.
Judice, J. J.
Powiązania:
https://bibliotekanauki.pl/articles/907894.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
matematyka
variational inequality
complementarity problem
contact problem
Opis:
In this paper the solution of a finite element approximation of a linear obstacle plate problem is investigated. A simple version of an interior point method and a block pivoting algorithm have been proposed for the solution of this problem. Special purpose implementations of these procedures are included and have been used in the solution of a set of test problems. The results of these experiences indicate that these procedures are quite efficient to deal with these instances and compare favourably with the path-following PATH and the active-set MINOS codes of the commercial GAMS collection
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 1; 27-40
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From Problem Conceptualization to Simulation. the Application of the Systems Dynamics to Water Management Problem
Autorzy:
Kazimierz, Śliwa
Powiązania:
https://bibliotekanauki.pl/articles/474980.pdf
Data publikacji:
2011
Wydawca:
Fundacja Upowszechniająca Wiedzę i Naukę Cognitione
Tematy:
problem simulation
system dynamics
water management problem
Opis:
The article continues previous text published in "Management Business Innovation" (no. 6, 2010) under the title Stock-And-Flow Thinking In Decision Making. Towards Systemic Procedure of Problem Solving. The methodology presented there is shown in the practical context of water supply management problem in one of the largest cities in Mexico. Basic methodological implications for computer supported problem modeling and simulation are shown, beginning with the Partitioning&Tearing Method, causal diagram of the problem as well as the computer simulation model structure drawn with the VensimTM software.
Źródło:
Journal of Entrepreneurship, Management and Innovation; 2011, 7; 51-61
2299-7075
2299-7326
Pojawia się w:
Journal of Entrepreneurship, Management and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Interdisciplinary Problem: An Analysis
Autorzy:
Walczak, Monika
Powiązania:
https://bibliotekanauki.pl/articles/30147102.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Szczeciński. Wydawnictwo Naukowe Uniwersytetu Szczecińskiego
Tematy:
interdisciplinarity
problem
question
interdisciplinary problem
interdisciplinary question
interdyscyplinarność
pytanie
problem interdyscyplinarny
pytanie interdyscyplinarne
Opis:
The purpose of this paper is to analyze the concept of the interdisciplinary problem using the categories of the logic of questions. The problem is seen in a logical and epistemic sense: the problem is a meaning of the question, and the question is a formulation of the problem in a particular language. Demonstrating that the interdisciplinarity of an interdisciplinary problem is understood in terms of a particular kind of complexity, I indicate the places where it is realized in the structure of the problem-question, in the problem’s solution-answer to the question, and in the cognitive context of the problem solving - answering to the question. The paper also displays how an interdisciplinary problem is situated within the broader structure of an interdisciplinary research process. Thus, the paper provides not only a metatheoretical characterization of the interdisciplinary problem but also a general methodological tool for analyzing particular interdisciplinary problems.
Źródło:
Analiza i Egzystencja; 2022, 60; 21-42
1734-9923
2300-7621
Pojawia się w:
Analiza i Egzystencja
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of nature inspired algorithms for the quadratic assignment problem
Autorzy:
Chmiel, W.
Kadłuczka, P.
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/202135.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
permutation problem
quadratic assignment problem
ant algorithm
bees algorithm
problem permutacji
problem przydziału kwadratowego
algorytm Ant Colony
algorytm pszczół
Opis:
This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Second order evolution equations with parameter
Autorzy:
Bochenek, Jan
Winiarska, Teresa
Powiązania:
https://bibliotekanauki.pl/articles/1311748.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
evolution problem
cosine family
evolution problem with parameter
Opis:
We give some theorems on continuity and differentiability with respect to (h,t) of the solution of a second order evolution problem with parameter $h ∈ Ω ⊂ ℝ^m$. Our main tool is the theory of strongly continuous cosine families of linear operators in Banach spaces.
Źródło:
Annales Polonici Mathematici; 1994, 59, 1; 41-52
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Modifiable Areal Unit Problem – Analysis of Correlation and Regression
Autorzy:
Pietrzak, Michał Bernard
Powiązania:
https://bibliotekanauki.pl/articles/517297.pdf
Data publikacji:
2014
Wydawca:
Instytut Badań Gospodarczych
Tematy:
spatial econometrics
modifiable areal unit problem
scale problem
Opis:
The paper focuses on the issue of the modifiable areal unit problem, which means a possibility of obtaining various results for spatial economic analyses depending on the assumed composition of territorial units. The major research objective of the work is to examine the scale problem that constitutes one of the aspects of the modifiable areal unit problem. Analysis of the scale problem will be conducted for two research problems, namely, for the problem of the causal relationships between the level of investment outlays in enterprises per capita and the number of entities of the national economy per capita, and the issue of the dependence between the registered unemployment rate and the level of investment outlays per capita. The calculations based on the empirical values of those variables have showed that moving to a higher level of aggregation resulted in a change in the estimates of the parameters. The results obtained were the justification for undertaking the realisation of the objective. The scale problem was considered by means of a simulation analysis with a special emphasis laid on differentiating the variables expressed in absolute quantities and ones expressed in relative quantities. The study conducted allowed the identification of changes in basic properties as well as in correlation of the researched variables expressed in absolute and relative quantities. Based on the findings, it was stated that a correlation analysis and a regression analysis may lead to different conclusions depending on the assumed level of aggregation. The realisation of the research objective set in the paper also showed the need to consider the adequate character of variables in both spatial economic analyses and during the examination of the scale problem.
Źródło:
Equilibrium. Quarterly Journal of Economics and Economic Policy; 2014, 9, 4; 113-131
1689-765X
2353-3293
Pojawia się w:
Equilibrium. Quarterly Journal of Economics and Economic Policy
Dostawca treści:
Biblioteka Nauki
Artykuł

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