IA Scholar Query: Exact Computation of Steiner Minimal Trees in the Plane.
https://scholar.archive.org/
Internet Archive Scholar query results feed
en
info@archive.org
Wed, 21 Sep 2022 00:00:00 GMT
fatcatscholar
https://scholar.archive.org/help
1440

Shortest Paths in Graphs of Convex Sets
https://scholar.archive.org/work/ng2fblkqqjfurn6mub2kiox3qu
Given a graph, the shortestpath problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each vertex in the graph is a continuous decision variable constrained in a convex set, and the length of an edge is a convex function of the position of its endpoints. Problems of this form can be shown to arise in many areas, from motion planning of autonomous vehicles to optimal control of hybrid systems. The price for such a wide applicability is the complexity of this problem, which is easily seen to be NPhard. Our main contribution is a strong and lightweight mixedinteger convex formulation based on perspective functions, that makes it possible to efficiently find globallyoptimal paths in large graphs and in highdimensional spaces.
Tobia Marcucci, Jack Umenberger, Pablo A. Parrilo, Russ Tedrake
work_ng2fblkqqjfurn6mub2kiox3qu
Wed, 21 Sep 2022 00:00:00 GMT

GapETHTight Approximation Schemes for RedGreenBlue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
https://scholar.archive.org/work/77g6jkuxs5g5fkhenfhz6w5eku
In this paper, we study problems of connecting classes of points via noncrossing structures. Given a set of colored terminal points, we want to find a graph for each color that connects all terminals of its color with the restriction that no two graphs cross each other. We consider these problems both on the Euclidean plane and in planar graphs. On the algorithmic side, we give a GapETHtight EPTAS for the twocolored traveling salesman problem as well as for the redbluegreen separation problem (in which we want to separate terminals of three colors with two noncrossing polygons of minimum length), both on the Euclidean plane. This improves the work of Arora and Chang (ICALP 2003) who gave a slower PTAS for the simpler redblue separation problem. For the case of unweighted plane graphs, we also show a PTAS for the twocolored traveling salesman problem. All these results are based on our new patching procedure that might be of independent interest. On the negative side, we show that the problem of connecting terminal pairs with noncrossing paths is NPhard on the Euclidean plane, and that the problem of finding two noncrossing spanning trees is NPhard in plane graphs.
François Dross and Krzysztof Fleszar and Karol Węgrzycki and Anna ZychPawlewicz
work_77g6jkuxs5g5fkhenfhz6w5eku
Mon, 19 Sep 2022 00:00:00 GMT

Isometric embedding of a weighted FermatFrechet multitree for isoperimetric deformations of the boundary of a simplex to a Frechet multisimplex in the KSpace
https://scholar.archive.org/work/xquvogvuhzfibh3yitob32jrda
In this paper, we study the weighted FermatFrechet problem for a N (N+1)/2tuple of positive real numbers determining Nsimplexes in the N dimensional KSpace (Ndimensional Euclidean space ℝ^N if K=0, the Ndimensional open hemisphere of radius 1/√(K) (𝕊_1/√(K)^N) if K >0 and the Lobachevsky space ℍ_K^N of constant curvature K if K<0). The (weighted) FermatFrechet problem is a new generalization of the (weighted) Fermat problem for Nsimplexes. We control the number of solutions (weighted Fermat trees) with respect to the weighted FermatFrechet problem that we call a weighted FermatFrechet multitree, by using some conditions for the edge lengths discovered by DeksterWilker. In order to construct an isometric immersion of a weighted FermatFrechet multitree in the K Space, we use the isometric immersion of GodelSchoenberg for Nsimplexes in the Nsphere and the isometric immersion of Gromov (up to an additive constant) for weighted Fermat (Steiner) trees in the Nhyperbolic space ℍ_K^N. Finally, we create a new variational method, which differs from Schafli's, Luo's and Milnor's techniques to differentiate the length of a geodesic arc with respect to a variable geodesic arc, in the 3KSpace. By applying this method, we eliminate one variable geodesic arc from a system of equations, which give the weighted FermatFrechet solution for a sextuple of edge lengths determining (Frechet) tetrahedra.
Anastasios N. Zachos
work_xquvogvuhzfibh3yitob32jrda
Tue, 13 Sep 2022 00:00:00 GMT

A framework of music literacy based on the experiences of KS2 children, and their teachers, when music making in various outdoor, rural locations
https://scholar.archive.org/work/q2itcm77ffbypnwpbk5klllnfy
This thesis investigates the experiences of Key Stage 2 children, aged 711 years old, when making music in outdoor rural locations. A framework of music literacy is constructed using analysis of the data obtained from interviews with the children and their teachers, together with and observations from the researcher. The socialconstructivist view of literacy (Lankshear and Lawler, 1987, Lankshear and Knobel, 2011, Lambirth, 2011, Gee, 2014), that sees literacy as a social practice, is the theoretical underpinning of this model. Within this perspective, literacy is "expressive fluency through symbolic form" (Barton, 2014, p.289) and therefore there is no one singular definition of literacy. Furthermore, literacy is viewed as being transformational (Freire, 1996), creative and something that is enacted. Moreover, the object for the purposes of our exploration into music literacies is not a pure noun, 'music', but rather conforms to Small's (1996) concept of 'musicking', which is a gerund. Music here is viewed as a verb, 'to music', as music, like literacy, is something that people do. Interpretivism was the paradigm within which this research study operated. The analysis aimed to interpret the experiences of those that participated in the investigation. The study adopted a grounded approach (Charmaz, 2017) whereby the theorising was led by the data collection and analysis. The investigation began by exploring children's experiences of making music at a prehistoric site, because previous research seemed to show that these sites had provided the children with rich musicmaking opportunities. Subsequent research and data analysis indicated that it was the outdoor rural nature of the location, rather than its prehistoric connection, that was having a significant impact on the children's experiences (Adams and Beauchamp, 2018). Therefore, further data collection focussed on children's experiences in outdoor rural locations rather than at prehistoric sites. Analysis of the data revealed that the children experienced a [...]
Dylan Adams
work_q2itcm77ffbypnwpbk5klllnfy
Fri, 09 Sep 2022 00:00:00 GMT

Solar farm cable layout optimization as a graph problem
https://scholar.archive.org/work/e7hj2om645fbpgoo36fyyzakty
AbstractWe introduce the Solar Farm Cable Layout Problem (SoFaCLaP), a novel graphtheoretic optimization problem. SoFaCLaP formalizes the task of finding a costoptimal cable layout in a solar farm where PV string positions are already determined but the positions of other components such as transformers can be picked from a set of candidate positions. The problem statement incorporates a network flow model in which the flow value of a connection represents the number of strings that are (indirectly) connected to a transformer via this connection. A mixedinteger linear program (MILP) formulation is proposed that uses binary variables to indicate which of several available cable types is chosen for each connection. We propose a framework to randomly generate benchmark instances to evaluate any algorithmic approach to SoFaCLaP. In particular, we generate a set of instances based on realworld solar farm characteristics. With an extensive evaluation of the MILP formulation on those instances we establish mixedinteger linear programming as a baseline for future algorithmic approaches to finding solar farm cable layouts.
Sascha Gritzbach, Dominik Stampa, Matthias Wolf
work_e7hj2om645fbpgoo36fyyzakty
Wed, 07 Sep 2022 00:00:00 GMT

Many Streams, One River: Multimusical Educators in the K12 Music Classroom
https://scholar.archive.org/work/u36shlfa3fg4rglm4yuf2qzqza
In response to the blurred boundaries and hybrid identities that define contemporary landscapes, the field of music education can benefit from the perspectives of individuals who are successful at navigating diverse musical streams. To ensure a high degree of resonance and relevance for all levels of the profession, these insights should come from those who are also familiar and engaged with the contexts of K12 music teaching. Thus, this narrative study explored the life stories of four multimusical educators to answer the following research questions: (a) How do participants describe their pathways to multimusicality? (b) In what ways do participants portray the dynamics between their musical worlds over time? and (c) How has participants' diverse musicianship influenced their classroom pedagogy? Data was gathered through background questionnaires, preliminary conversations, and four narrative interviews. Data was first analyzed and interpreted at the individual level resulting in four selfcontained chapters, each detailing a participant's story. Subsequently, an analysis of narratives was conducted to identify and discuss themes that cut across multiple stories. The findings revealed that participants' initial pathways to multimusicality largely stemmed from the contexts of family and community. As participants grew older, formal educational institutions and professional teachers exerted significant influence. The salience of third spaces (i.e., locations outside familial or institutional boundaries) as contexts for musical experimentation were especially important in adolescence. Curiosity was a longstanding force in deepening and widening musical understandings. The concurrent and historical dialectic between participants' musical worlds widened their palette and gave them a holistic view of musical concepts, practices, and cultures. The pedagogical manifestations of these interactions were found to fall within the domains of powerful knowledge, transcultural expression, lifespan engagement, and intermusica [...]
Anand Raj Sukumaran, University, My
work_u36shlfa3fg4rglm4yuf2qzqza
Tue, 06 Sep 2022 00:00:00 GMT

The Role of Psychological Ownership in Communitybased Piped Water Supply Infrastructure in Nepal and India
https://scholar.archive.org/work/52xnhi35xbcptdfuftwe6yjm7y
Psychological ownership, the feeling that something is mine, is a diverse social construct on the individual level with a measurable core dimension of possessiveness. It can be fostered through participative elements in combination with behaviour change interventions. The concept originally stems from the organizational context, where antecedents leading to, and consequences of psychological ownership were vastly researched. Initial evidence of the application of the construct to shared targets such as the environment or commonpool resources, for instance communitybased water infrastructure, yielded promising results. However, causal evidence is scarce and a holistic adaptation of the construct, tests of theorybased interventions concerning the routes, validation of the measurement scale, and a systematic investigation of the consequences of psychological ownership are lacking. This dissertation presents findings from two community development programmes in Nepal and India, where psychological ownership for communitybased water infrastructure was the subject of the research. Our results are inline with existing evidence from the organizational context and applications in other domains. First, we found qualitative evidence for the importance of the construct in the specific context of Nepal and India, and we validated the measurement for individual psychological ownership. Second, we found that interventions should be targeting the three routes substantially, e.g. by participatory activities. Community participation can be seen as a means of implementation and therefore needs to be combined with individuallevel behaviour change and embedded in institutional interventions to cause greater psychological ownership. Third, the results show that psychological ownership fosters behavioural determinants and organizational citizenship behaviour, but not the functionality of safe water supply infrastructure. This body of work provides various connecting factors for future research. Apart from changes towards an en [...]
Benjamin Adrian Ambühl
work_52xnhi35xbcptdfuftwe6yjm7y
Mon, 05 Sep 2022 00:00:00 GMT

Spanner Approximations in Practice
https://scholar.archive.org/work/bv5mris5gzh5vp3w73cylfgv4a
A multiplicative αspanner H is a subgraph of G = (V,E) with the same vertices and fewer edges that preserves distances up to the factor α, i.e., d_H(u,v) ≤ α⋅ d_G(u,v) for all vertices u, v. While many algorithms have been developed to find good spanners in terms of approximation guarantees, no experimental studies comparing different approaches exist. We implemented a rich selection of those algorithms and evaluate them on a variety of instances regarding, e.g., their running time, sparseness, lightness, and effective stretch.
Markus Chimani, Finn Stutzenstein, Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman
work_bv5mris5gzh5vp3w73cylfgv4a
Thu, 01 Sep 2022 00:00:00 GMT

Numerical geometric acoustics: an eikonalbased approach for modeling sound propagation in 3D environments
https://scholar.archive.org/work/scv7br5e75hn5o4rhej26uk2dq
We present algorithms for solving highfrequency acoustic scattering problems in complex domains. The eikonal and transport partial differential equations from the WKB/geometric optic approximation of the Helmholtz equation are solved recursively to generate boundary conditions for a tree of eikonal/transport equation pairs, describing the phase and amplitude of a geometric optic wave propagating in a complicated domain, including reflection and diffraction. Edge diffraction is modeled using the uniform theory of diffraction. For simplicity, we limit our attention to domains with piecewise linear boundaries and a constant speed of sound. The domain is discretized into a conforming tetrahedron mesh. For the eikonal equation, we extend the jet marching method to tetrahedron meshes. Hermite interpolation enables second order accuracy for the eikonal and its gradient and first order accuracy for its Hessian, computed using cell averaging. To march the eikonal on an unstructured mesh, we introduce a new method of rejecting unphysical updates by considering Lagrange multipliers and local visibility. To handle accuracy degradation near caustics, we introduce several fast Lagrangian initialization algorithms. We store the dynamic programming plan uncovered by the marcher in order to propagate auxiliary quantities along characteristics. We introduce an approximate origin function which is computed using the dynamic programming plan, and whose 1/2level set approximates the geometric optic shadow and reflection boundaries. We also use it to propagate geometric spreading factors and unit tangent vector fields needed to compute the amplitude and evaluate the highfrequency edge diffraction coefficient. We conduct numerical tests on a semiinfinite planar wedge to evaluate the accuracy of our method. We also show an example with a more realistic building model with challenging architectural features.
Samuel F. Potter, Maria K. Cameron, Ramani Duraiswami
work_scv7br5e75hn5o4rhej26uk2dq
Sat, 27 Aug 2022 00:00:00 GMT

Locating ballot drop boxes
https://scholar.archive.org/work/ihibbrmbvfffray4nllgcovmku
For decades, votingbymail and the use of ballot drop boxes has substantially grown, and in response, many election officials have added new drop boxes to their voting infrastructure. However, existing guidance for locating drop boxes is limited. In this paper, we introduce an integer programming model, the drop box location problem (DBLP), to locate drop boxes. The DBLP considers criteria of cost, voter access, and risk. The cost of the drop box system is determined by the fixed cost of adding drop boxes and the operational cost of a collection tour by a bipartisan team who regularly collects ballots from selected locations. The DBLP utilizes covering sets to ensure each voter is in close proximity to a drop box and incorporates a novel measure of access to measure the ability to use multiple voting pathways to vote. The DBLP is shown to be NPHard, and we introduce a heuristic to generate a large number of feasible solutions for policy makers to select from a posteriori. Using a realworld case study of Milwaukee, WI, we study the benefit of the DBLP. The results demonstrate that the proposed optimization model identifies drop box locations that perform well across multiple criteria. The results also demonstrate that the tradeoff between cost, access, and risk is nontrivial, which supports the use of the proposed optimizationbased approach to select drop box locations.
Adam P. Schmidt, Laura A. Albert
work_ihibbrmbvfffray4nllgcovmku
Wed, 24 Aug 2022 00:00:00 GMT

The END: Estimation Network Design for efficient distributed equilibrium seeking
https://scholar.archive.org/work/rm4bm6rkgngp3gtxsjd47ov2ai
Multiagent decision problems are typically solved via distributed algorithms, where the computational burden is partitioned among a group of agents, only allowed to communicate on a peertopeer network. To cope with the limited information available, each processor is required to store a copy of certain variables, while agreement among the local copies is enforced via consensus protocols. This structure often leads to redundancy of the information, poor scalability with the network size, communication and memory overhead. In this paper, we develop a framework for the design and analysis of distributed algorithms, named END, to systematically assign local copies only to a subset of the agents, while still ensuring consistency. END unifies and generalizes several existing (applicationspecific) approaches, and leverages the original sparsity of the problem to improve efficiency and minimize redundancy. We illustrate the flexibility and potential of END for several methods in the context of consensus optimization and game equilibrium seeking.
Mattia Bianchi, Sergio Grammatico
work_rm4bm6rkgngp3gtxsjd47ov2ai
Wed, 24 Aug 2022 00:00:00 GMT

Album
https://scholar.archive.org/work/bec46vz3uvhdlmhsaen7rymp7q
Is it Percival? No; it is not Percival.' There is a morbid pleasure in saying: 'No, it is not Percival.' I have seen the door open and shut twenty times already; each time the suspense sharpens. This is the place to which he is coming. This is the table at which he will sit. Here, incredible as it seems, will be his actual body. This table, these chairs, this metal vase with its three red flowers are about to undergo an extraordinary transformation.
Ruth Rosengarten
work_bec46vz3uvhdlmhsaen7rymp7q
Mon, 22 Aug 2022 00:00:00 GMT

Thematisches Glossar "Religion, Worldviews, Ethics"
https://scholar.archive.org/work/dq3tmfi6efhr5gb7yaei2sfbei
Thematic GermanEnglish Glossary "Religion, Worldviews, Ethics"; this glossary is a supplement to: JensPeter Green, Manfred L. Pirner and Jens Büngener (eds.) with assistance of Nele Orlemann: "Religionsunterricht bilingual. Didaktische Perspektiven und Anregungen für die Praxis". Erlangen: FAU University Press 2022. ISBN: 9783961474837, eISBN: 9783961474844, DOI: 10.25593/9783961474844
JensPeter Green
work_dq3tmfi6efhr5gb7yaei2sfbei
Fri, 19 Aug 2022 00:00:00 GMT

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification
https://scholar.archive.org/work/vj7js77zljgmrbulcuqbl3nfbi
In the Directed Steiner Network problem, the input is a directed graph G, a subset T of k vertices of G called the terminals, and a demand graph D on T. The task is to find a subgraph H of G with the minimum number of edges such that for every edge (s,t) in D, the solution H contains a directed s to t path. In this paper we investigate how the complexity of the problem depends on the demand pattern when G is planar. Formally, if 𝒟 is a class of directed graphs closed under identification of vertices, then the 𝒟Steiner Network (𝒟SN) problem is the special case where the demand graph D is restricted to be from 𝒟. For general graphs, Feldmann and Marx [ICALP 2016] characterized those families of demand graphs where the problem is fixedparameter tractable (FPT) parameterized by the number k of terminals. They showed that if 𝒟 is a superset of one of the five hard families, then 𝒟SN is W[1]hard parameterized by k, otherwise it can be solved in time f(k)n^O(1). For planar graphs an interesting question is whether the W[1]hard cases can be solved by subexponential parameterized algorithms. Chitnis et al. [SICOMP 2020] showed that, assuming the ETH, there is no f(k)n^o(k) time algorithm for the general 𝒟SN problem on planar graphs, but the special case called Strongly Connected Steiner Subgraph can be solved in time f(k) n^O(√(k)) on planar graphs. We present a farreaching generalization and unification of these two results: we give a complete characterization of the behavior of every 𝒟SN problem on planar graphs. We show that assuming ETH, either the problem is (1) solvable in time 2^O(k)n^O(1), and not in time 2^o(k)n^O(1), or (2) solvable in time f(k)n^O(√(k)), but not in time f(k)n^o(√(k)), or (3) solvable in time f(k)n^O(k), but not in time f(k)n^o(k).
Esther Galby, Sandor KisfaludiBak, Daniel Marx, Roohani Sharma
work_vj7js77zljgmrbulcuqbl3nfbi
Thu, 11 Aug 2022 00:00:00 GMT

Multi Purpose Routing: New Perspectives and Approximation Algorithms
https://scholar.archive.org/work/nrekjgmbbnhkxhooy3yz2d7v6a
The cost due to delay in services may be intrinsically different for various applications of vehicle routing such as medical emergencies, logistical operations, and ridesharing. We study a fundamental generalization of the Traveling Salesman Problem, namely L_p TSP, where the objective is to minimize an aggregated measure of the delay in services, quantified by the Minkowski pnorm of the delay vector. We present efficient combinatorial and Linear Programming algorithms for approximating L_p TSP on general metrics. We provide several approximation algorithms for the L_p TSP problem, including 4.27 10.92approximation algorithms for single multi vehicle L_2 TSP, called the Traveling Firefighter Problem. Among other contributions, we provide an 8approximation and a 1.78 inapproximability for AllNorm TSP problem, addressing scenarios where one does not know the ideal cost function, or is seeking simultaneous approximation with respect to any cost function.
Majid Farhadi, Jai Moondra, Prasad Tetali, Alejandro Toriello
work_nrekjgmbbnhkxhooy3yz2d7v6a
Mon, 08 Aug 2022 00:00:00 GMT

Thematisches Glossar "Religion, Worldviews, Ethics"
https://scholar.archive.org/work/5ejomrgdrbbjbhgkgo3vr33bom
Thematic GermanEnglish Glossary "Religion, Worldviews, Ethics"; this glossary is a supplement to: JensPeter Green, Manfred L. Pirner and Jens Büngener (eds.) with assistance of Nele Orlemann: "Religionsunterricht bilingual. Didaktische Perspektiven und Anregungen für die Praxis". Erlangen: FAU University Press 2022. ISBN: 9783961474837, eISBN: 9783961474844, DOI: 10.25593/9783961474844
JensPeter Green
work_5ejomrgdrbbjbhgkgo3vr33bom
Wed, 27 Jul 2022 00:00:00 GMT

Combinatorial Gray codesan updated survey
https://scholar.archive.org/work/zryp7sxkrbczrguasg4ugmgfee
A combinatorial Gray code for a class of objects is a listing that contains each object from the class exactly once such that any two consecutive objects in the list differ only by a 'small change'. Such listings are known for many different combinatorial objects, including bitstrings, combinations, permutations, partitions, triangulations, but also for objects defined with respect to a fixed graph, such as spanning trees, perfect matchings or vertex colorings. This survey provides a comprehensive picture of the stateoftheart of the research on combinatorial Gray codes. In particular, it gives an update on Savage's influential survey [C. D. Savage. A survey of combinatorial Gray codes. SIAM Rev., 39(4):605629, 1997.], incorporating many more recent developments. We also elaborate on the connections to closely related problems in graph theory, algebra, order theory, geometry and algorithms, which embeds this research area into a broader context. Lastly, we collect and propose a number of challenging research problems, thus stimulating new research endeavors.
Torsten Mütze
work_zryp7sxkrbczrguasg4ugmgfee
Tue, 26 Jul 2022 00:00:00 GMT

Energy correlations of nonintegrable Ising models: The scaling limit in the cylinder
https://scholar.archive.org/work/b2zd57rqcncrvchreyhd3jv7wa
We consider a class of nonintegrable 2D Ising models, whose Hamiltonian, in addition to the nearest neighbor couplings, includes weak multispin interactions, even under spin flip. We study the model in cylindrical domains of arbitrary aspect ratio and prove that, in the scaling limit, the multipoint energy correlations converge to the same limiting correlations as those of the nearestneighbor Ising model in the cylinder with renormalized couplings, up to an overall multiplicative constant, independent of the shape and size of the domain. The proof is based on a representation of the generating function of correlations in terms of a nonGaussian Grassmann integral, and a constructive Renormalization Group (RG) analysis thereof. A key technical novelty compared with previous works is a systematic analysis of the effect of the boundary corrections to the RG flow, in particular a proof that the scaling dimension of boundary operators is better by one dimension than their bulk counterparts. A cancellation mechanism based on an approximate image rule for the fermionic Green's function is of crucial importance for controlling the RG flow of the marginal boundary terms.
Giovanni Antinucci, Alessandro Giuliani, Rafael Leon Greenblatt
work_b2zd57rqcncrvchreyhd3jv7wa
Mon, 25 Jul 2022 00:00:00 GMT

Fatty acidmodified poly(glycerol adipate) as a versatile matrix for parenteral depot formulations
https://scholar.archive.org/work/nfenma54xjfjjfpkx46svlevxm
Fettsäuremodifiziertes Poly(glyceroladipat) (FAPGA) ist ein neuartiges bioabbaubares Polymer mit großem Potenzial für die Verwendung in verschiedenen parenteralen Depotarzneiformen. Durch die Veresterung der freien Hydroxylgruppe der PGAHauptkette mit verschiedenen Fettsäuren ist eine flexible Anpassung der Polymereigenschaften möglich. Diese FAPGAs dienten als Matrices für die Herstellung von Mikropartikeln und vorgeformten Implantaten. Es war möglich die Eigenschaften dieser Depotarzneiformen durch die unterschiedlichen Polymermodifikationen zu optimieren und verschiedene Freisetzungsprofile zu erreichen. Die gute Verträglichkeit ausgewählter Mikropartikelformulierungen konnte im Mausmodell belegt werden. Durch einen Vergleich mit PLGAMikropartikeln konnte die Position von FAPGA als Alternative zu PLGA gefestigt werden.
Jonas Steiner, Universitäts Und Landesbibliothek SachsenAnhalt, MartinLuther Universität, Karsten Mäder, Jörg Kreßler, Michaela Schulz
work_nfenma54xjfjjfpkx46svlevxm
Wed, 20 Jul 2022 00:00:00 GMT

EUROPE, SCIENCE AND WE
https://scholar.archive.org/work/yo3t3gbzm5du7cykih5ar2mrle
Publishing House "Education and Science" s.r.o., International Conference EUROPE, SCIENCE AND WE EVROPA, VĚDA A MY ЕВРОПА, НАУКА И МЫ 2022 Praha, Czech Republic Conference Proceedings Publishing House "Education and Science" s.r.o., International Conference EUROPE, SCIENCE AND WE EVROPA, VĚDA A MY ЕВРОПА, НАУКА И МЫ Science editor: Tomash Nejezchleb ISBN 9788090784581 DOI: https://doi.org/10.5281/zenodo.6844617 Conference Proceedings available at virtualconferences.press https://doi.org/10.5281/zenodo.6844617 Copyright © 2022 All rights reserved. Published by Publishing House "Education and Science" s.r.o. Praha, Czech Republic
COLLECTIVE OUTHORS
work_yo3t3gbzm5du7cykih5ar2mrle
Sat, 16 Jul 2022 00:00:00 GMT