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


Wyświetlanie 1-2 z 2
Tytuł:
On Time-to-Build Economies with Multiple-Stage Investments
On time-to-build economies with multiple stage investments
Autorzy:
Dziewulski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/574421.pdf
Data publikacji:
2011-09-30
Wydawca:
Szkoła Główna Handlowa w Warszawie. Kolegium Analiz Ekonomicznych
Tematy:
time to build
dynamic general equilibrium
monotone comparative statics
Opis:
The paper presents a constructive method for studying dynamic general equilibrium models with time-to-build technology. In the work, the author modifies a seminal work by Kydland and Prescott [1982] by allowing agents to make multi-stage investments. In this framework, consumers decide on how much to consume each period, and how much to invest in future capital, which will yield them income in future periods. Unlike in Kydland and Prescott, agents are allowed to postpone, stop or accelerate the investment by devoting a certain amount of their product to investments, which allows consumers to smooth investment expenses throughout the investment process rather than incur the whole cost at the beginning of the investment, as in Kydland and Prescott. The analysis of the model poses several technical issues, which are tackled in the article. First, the premises of the model exhibit unbounded returns, which makes several dynamic programming arguments invalid. Second, since the imposed assumptions do not exclude boundary solutions, the consumer value function of the underlying problem might not be differentiable, as the standard Benveniste and Scheinkman [1979] argument does not hold. Finally, as the feasible action set is not a lattice, standard monotone comparative statics cannot be introduced in order to bring about the monotonicity results concerning the policy functions in the model. Using dynamic programming methods and monotone operators theory (by Matkowski and Nowak [2009], Quah and Strulovici [2009], and Rincón-Zapatero and Santos [2009]), the author presents a convergent algorithm for the computation of optimal allocations of the model, as well as proposes an economy that decentralizes the allocations in the Arrow-Debreu general equilibrium. Eventually, the author presents some comparative statics results useful for a more general analysis of the problem, and discusses the efficiency of the presented economy.
Źródło:
Gospodarka Narodowa. The Polish Journal of Economics; 2011, 250, 9; 23-49
2300-5238
Pojawia się w:
Gospodarka Narodowa. The Polish Journal of Economics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A bioinspired optimization strategy: to minimize the travel segment of the nozzle to accelerate the fused deposition modeling process
Autorzy:
Sridhar, Sundarraj
Aditya, K.
Venkatraman, Ramamoorthi
Venkatesan, M.
Powiązania:
https://bibliotekanauki.pl/articles/27311459.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
additive manufacturing
fused deposition modeling
extruder path
ant colony optimization
build time
produkcja dodatkowa
modelowanie osadzania stopionego
ścieżka wytłaczarki
optymalizacja kolonii mrówek
czas budowy
Opis:
The fused deposition modeling process of digital printing uses a layer-by-layer approach to form a three-dimensional structure. Digital printing takes more time to fabricate a 3D model, and the speed varies depending on the type of 3D printer, material, geometric complexity, and process parameters. A shorter path for the extruder can speed up the printing process. However, the time taken for the extruder during printing (deposition) cannot be reduced, but the time taken for the extruder travel (idle move) can be reduced. In this study, the idle travel of the nozzle is optimized using a bioinspired technique called "ant colony optimization" (ACO) by reducing the travel transitions. The ACO algorithm determines the shortest path of the nozzle to reduce travel and generates the tool paths as G-codes. The proposed method’s G-code is implemented and compared with the G-code generated by the commercial slicer, Cura, in terms of build time. Experiments corroborate this finding: the G-code generated by the ACO algorithm accelerates the FDM process by reducing the travel movements of the nozzle, hence reducing the part build time (printing time) and increasing the strength of the printed object.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 4; art. no. e146236
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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