|
|
|
|
|
Nenad Marku? and Mirko Su?njevic
Recently, there has been renewed interest in signed distance bound representations due to their unique properties for 3D shape modelling. This is especially the case for deep learning-based bounds. However, it is beneficial to work with polygons in most ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christopher Tsang, James Parker and David Glew
A substantial number of dwellings in the UK have poor building fabric, leading to higher carbon emissions, fuel expenses, and the risk of cold homes. To tackle these challenges, domestic energy efficiency policies are being implemented. One effective app...
ver más
|
|
|
|
|
|
|
|
|
|
|
Parag C. Pendharkar
This paper proposes a genetic algorithm-based Markov Chain approach that can be used for non-parametric estimation of regression coefficients and their statistical confidence bounds. The proposed approach can generate samples from an unknown probability ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shengkun Gu and Dejiang Wang
Within the domain of architectural urban informatization, the automated precision recognition of two-dimensional paper schematics emerges as a pivotal technical challenge. Recognition methods traditionally employed frequently encounter limitations due to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Lin Guo, Anand Balu Nellippallil, Warren F. Smith, Janet K. Allen and Farrokh Mistree
When dealing with engineering design problems, designers often encounter nonlinear and nonconvex features, multiple objectives, coupled decision making, and various levels of fidelity of sub-systems. To realize the design with limited computational resou...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammad Javad Salariseddigh, Ons Dabbabi, Christian Deppe and Holger Boche
Numerous applications of the Internet of Things (IoT) feature an event recognition behavior where the established Shannon capacity is not authorized to be the central performance measure. Instead, the identification capacity for such systems is considere...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuyang Hao, Kan He and Ying Zhang
In this paper, we establish an aggregate class distribution neural network (AGGNN) structure to determine whether an arbitrary two-qubit quantum state is steerable. Compared to the classification results obtained using a support vector machine (SVM) and ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sharanya Srinivas, Samuel Welker, Andrew Herschfelt and Daniel W. Bliss
As radio frequency (RF) hardware continues to improve, many technologies that were traditionally impractical have suddenly become viable alternatives to legacy systems. Two-way ranging (TWR) is often considered a poor positioning solution for airborne an...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo, Joshua Chukwuere and Trust Tawanda
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal int...
ver más
|
|
|
|
|
|