A generation problem

2021 ◽  
pp. 207-220
Author(s):  
Alessandro Sebastianelli ◽  
Maria Pia Del Rosso ◽  
Silvia Liberata Ullo ◽  
Erika Puglisi ◽  
Filippo Biondi
Keyword(s):  
2021 ◽  
pp. 027836492110333
Author(s):  
Gilhyun Ryou ◽  
Ezra Tal ◽  
Sertac Karaman

We consider the problem of generating a time-optimal quadrotor trajectory for highly maneuverable vehicles, such as quadrotor aircraft. The problem is challenging because the optimal trajectory is located on the boundary of the set of dynamically feasible trajectories. This boundary is hard to model as it involves limitations of the entire system, including complex aerodynamic and electromechanical phenomena, in agile high-speed flight. In this work, we propose a multi-fidelity Bayesian optimization framework that models the feasibility constraints based on analytical approximation, numerical simulation, and real-world flight experiments. By combining evaluations at different fidelities, trajectory time is optimized while the number of costly flight experiments is kept to a minimum. The algorithm is thoroughly evaluated for the trajectory generation problem in two different scenarios: (1) connecting predetermined waypoints; (2) planning in obstacle-rich environments. For each scenario, we conduct both simulation and real-world flight experiments at speeds up to 11 m/s. Resulting trajectories were found to be significantly faster than those obtained through minimum-snap trajectory planning.


1989 ◽  
Vol 04 (14) ◽  
pp. 1381-1387 ◽  
Author(s):  
R. DELBOURGO

We show that five complex anticommuting coordinates are sufficient to describe the present particle spectrum, including the possibility of understanding the generation problem.


2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Andrea Asperti ◽  
Davide Evangelista ◽  
Elena Loli Piccolomini

AbstractVariational Autoencoders (VAEs) are powerful generative models that merge elements from statistics and information theory with the flexibility offered by deep neural networks to efficiently solve the generation problem for high-dimensional data. The key insight of VAEs is to learn the latent distribution of data in such a way that new meaningful samples can be generated from it. This approach led to tremendous research and variations in the architectural design of VAEs, nourishing the recent field of research known as unsupervised representation learning. In this article, we provide a comparative evaluation of some of the most successful, recent variations of VAEs. We particularly focus the analysis on the energetic efficiency of the different models, in the spirit of the so-called Green AI, aiming both to reduce the carbon footprint and the financial cost of generative techniques. For each architecture, we provide its mathematical formulation, the ideas underlying its design, a detailed model description, a running implementation and quantitative results.


Author(s):  
Jose Torres-Jimenez ◽  
Himer Avila-George ◽  
Ezra Federico Parra-González

Software testing is an essential activity to ensure the quality of software systems. Combinatorial testing is a method that facilitates the software testing process; it is based on an empirical evidence where almost all faults in a software component are due to the interaction of very few parameters. The test generation problem for combinatorial testing can be represented as the construction of a matrix that has certain properties; typically this matrix is a covering array. Covering arrays have a small number of tests, in comparison with an exhaustive approach, and provide a level of interaction coverage among the parameters involved. This paper presents a repository that contains binary covering arrays involving many levels of interaction. Also, it discusses the importance of covering array repositories in the construction of better covering arrays. In most of the cases, the size of the covering arrays included in the repository reported here are the best upper bounds known, moreover, the files containing the matrices of these covering arrays are available to be downloaded. The final purpose of our Binary Covering Arrays Repository (BCAR) is to provide software testing practitioners the best-known binary test-suites.


1982 ◽  
Vol 26 (5) ◽  
pp. 1133-1156 ◽  
Author(s):  
Aharon Davidson ◽  
Philip D. Mannheim ◽  
Kameshwar C. Wali
Keyword(s):  

2008 ◽  
Vol 28 (4) ◽  
pp. 90-95 ◽  
Author(s):  
Xiang YIN ◽  
Jian-guo JIANG ◽  
Na XIA ◽  
Chuan-wen CHANG

2018 ◽  
Vol 8 ◽  
pp. 29-43
Author(s):  
Patrycja Kochanek

Intergenerational communication in Polish cultureThe object of this paper is to verify the structure of communication in cultural discourse in Poland. It is analyzed if this discourse sees differences between the next generations and if it personalizes communication for them. Pilot research CAWI was done in May 2017. Twenty one responders answered 7 opened and 5 closed questions in an online survey. All of the responders were working in cultural institutions. The categorization of the answers gave an image of the social groups that have some specific and unique characteristics and values. The quantitative analysis of the answers verified the hypotheses: cultural discourse creates communication according to the audience — which is generation specific. Cultural institutions see this generation problem in Poland and they attribute this change to the activities that have been created for people. This research is only an opening to further investigations on this topic.


Author(s):  
Satoshi Ono ◽  
◽  
Kensuke Morinaga ◽  
Shigeru Nakayama

To improve on our previously proposed but problem-plagued innovation for generating animated and illustrated Quick Response (QR) codes, this paper proposes a method which formulates the animated QR code generation problem as an optimization problem rather than as a set of still QR code decoration problems. The proposed method also uses optimization operators designed for this problem and quality evaluation to maintain natural, smooth movement. Experiments demonstrate that the proposed method can generate animated QR codes involve a maximum of eight illustrations moving inside the code which maintaining decoding feasibility and smooth illustration movement.<FONT color="red" size="3">Erratum<br /></FONT> <FONT color="red" size="2">Due to a wrong manipulation during the correction of the proofs of the above paper, the running head title (short title) was incorrect. The correct running head title should have read as "Animated Two–Dimensional Barcode Generation."</FONT>


Sign in / Sign up

Export Citation Format

Share Document