Abstract: To adequately meet the nutritional needs of broilers, it is necessary to know the values of apparent metabolizable energy corrected by the nitrogen balance (AMEn) of the feedstuffs. To determine AMEn values, biological assays, feedstuff composition tables, or prediction equations are used as a function of the chemical composition of feedstuffs, the latter using statistical methodologies such as multiple linear regression, neural networks, and Bayesian networks (BN). BN is a statistical and computational methodology that consists of graphical (graph) and probabilistic models of quantitative and/or qualitative variables. Ensembles of BN in the area of broiler nutrition are expected, as there is no research showing their AMEn prediction performance. The purpose of this article is to propose and use ensembles of hybrid Bayesian networks (EHBNs) and obtain prediction equations for the AMEn of feedstuffs used in broiler nutrition from their chemical compositions. We trained 100, 1,000, and 10,000 EHBN, and in this way, empirical distributions were found for the coefficients of the covariates (crude protein, ether extract, mineral matter, and crude fiber). Thus, the mean, median, and mode of these distributions were calculated to build prediction equations for AMEn. It is observed that the method for obtaining the coefficients of the covariates discussed in this article is an unprecedented proposal in the field of broiler nutrition. The data used to obtain the equations were obtained by meta-analysis, and the data for the validation of the equations were obtained from metabolic tests. The proposed equations were evaluated by precision measures such as the mean square error (MSE), mean absolute deviation (MAD), and mean absolute percentage error (MAPE). The best equations for predicting AMEn were derived from the mean or mode coefficients for the 10,000 EHBN results. In conclusion, the methodology used is a good tool to obtain prediction equations for AMEn as a function of the chemical composition of their feedstuffs. The coefficients were found to differ from those found by other methodologies, such as the usual neural network or multiple linear regressions. The field of broiler nutrition contributed with new equations and with a never-applied methodology and differentiated in obtaining its coefficients by empirical distributions.

Abstract: Assembly lines are production flow systems wherein activities are organised around a line consisting of various workstations through which the product flows. At each station, the product is assembled through a subset of operations. The assembly line balancing problem (ALBP) consists of allocating operations between stations to maximise the system efficiency. In this study, a variable-depth local search algorithm is proposed for solving simple assembly line balancing problems (SALBPs), which are the most widely studied versions of the ALBP. Although the state-of-the-art techniques for solving the SALBP consist of exact enumeration-based methods or heuristics, this paper proposes a local search-based heuristic using variable-length sequences that allow the solution space to be efficiently explored. The proposed algorithm improves the best solution known for multiple instances reported in the literature, indicating that its efficiency is comparable to those of the state-of-the-art method for solving the SALBP. Moreover, the characteristics of the instances for which the proposed procedure provides a better solution than previously reported construction procedures are investigated.

Abstract: In this paper, we define both the upper and lower order of a sense-preserving harmonic mapping in D. We generalize to the harmonic case some known results about holomorphic functions with positive lower order and we show some consequences of a function having finite upper order. In addition, we improve a related result in the case when there is equality in a known distortion theorem for harmonic mappings with finite upper order. Some examples are provided to illustrate the developed theory. (C) 2021 Elsevier Inc. All rights reserved.

Abstract: It is showed that complex scalar fields with a self-interaction potential may propagate along null geodesics on isotropic flat Friedmann-Lemaitre-Robertson-Walker universes with different time-dependent scale factors. This effect appears for certain kinds of self-interactions only, for different forms of potentials, and even for the massive case.

Abstract: This paper presents a strategy for modelling dynamic soil-structure interaction (DSSI) using the spectral element method (SEM) with a Discontinuous Galerkin approach, calibrated by micro-vibrations. The proposed methodology allows not only to adjust the vibration frequencies of the structure but also the observed vibration modes. First, models of two structural shear wall buildings with basements in medium dense sandy soils are developed to estimate empirical modal characteristics and calibrate the structural subdomain and low-strain site properties. Convenient 3D arrays of multiple seismic sensors are used to obtain the environmental vibrations measurements. Afterwards, an optimization process is conducted to calibrate volumetric models of structures. This optimization is performed by preserving the most relevant modal frequencies and shapes to achieve an equivalent dynamic response. Finally, structural models are placed into a neighbouring soil model (soil subdomain), approximating nonlinear soil behaviour by an equivalent linear strategy. Using this complete soil-structure interaction model, relevant engineering performance parameters are assessed via simulations of buildings subjected to a plane wave excitation. The results show the significant effect DSSI have in shear-wall buildings with basements and the importance of considering the flexibility of the foundation in the interpretation of the results. In general, results indicate that DSSI effects are strongly dependent on the input frequency content, which might cause a reduction of the inter-story drifts. Furthermore, a significant period lengthening of the studied structures up to 47% is found, as well as a considerable decrease in story shear up to 220% and a maximum lateral roof displacement reduction of 34% when compared against fixed base referential responses.

Abstract: The decision to work from home (WFH) or to commute during COVID-19 is having a major structural impact on individuals' travel, work and lifestyle. There are many possible factors influencing this non-marginal change, some of which are captured by objective variables while others are best represented by a number of underlying latent traits captured by attitudes towards WFH and the use of specific modes of transport for the commute that have a bio-security risk such as public transport (PT). We develop and implement a hybrid choice model to investigate the sources of influence, accounting for the endogenous nature of latent soft variables for workers in metropolitan areas in New South Wales and Queensland. The data was collected between September-October 2020, during a period of no lockdown and relatively minor restrictions on workplaces and public gatherings. The results show that one of the most important attributes defining the WFH loving attitude is the workplace policy towards WFH, with workers that can decide where to work having a higher probability of WFH, followed by those that are being directed to, relative to other workplace policies. The bio-security concern with using shared modes such as public transport is a key driver of WFH and choosing to commute via the safer environment of the private car.

Abstract: Given its wide spectrum of applications, the classical problem of all-terminal network reliability evaluation remains a highly relevant problem in network design. The associated optimization problem-to find a network with the best possible reliability under multiple constraints-presents an even more complex challenge, which has been addressed in the scientific literature but usually under strong assumptions over failures probabilities and/or the network topology. In this work, we propose a novel reliability optimization framework for network design with failures probabilities that are independent but not necessarily identical. We leverage the linear-time evaluation procedure for network reliability in the series-parallel graphs of Satyanarayana and Wood (1985) to formulate the reliability optimization problem as a mixed-integer nonlinear optimization problem. To solve this nonconvex problem, we use classical convex envelopes of bilinear functions, introduce custom cutting planes, and propose a new family of convex envelopes for expressions that appear in the evaluation of network reliability. Furthermore, we exploit the refinements produced by spatial branch-and-bound to locally strengthen our convex relaxations. Our experiments show that, using our framework, one can efficiently obtain optimal solutions in challenging instances of this problem.

Abstract: We examine the unexplored effects on art markets of artist death (asset supply constraints), collectors' wealth (background risk) and forgery risk (risk of investment fraud), under short-sale constraints and risk aversion. Speculative bubbles emerge and have the form of an option strangle (a put option and a call option), in which strike prices are affected by art supply constraints and the association of the artworks' emotional value with both collectors' wealth and forgery, while the options' underlying asset is the stochastic heterogeneous beliefs of agents. We show that speculative bubbles increase with four elements: art supply constraints; a more negative correlation between collectors' wealth and the artworks' emotional value; a more positive relationship between forgery and the artworks' emotional value; and more heterogeneous beliefs. These four sources of speculation increase the expected turnover rate; however, they also augment the variance of speculative bubbles, which generates price discounts (i.e. risk premiums) for holding artworks. Consequently, the net impact of speculation is not necessarily increased art prices. This study not only contributes to the art market literature, but also to studies about speculative bubbles in other financial markets under heterogeneous beliefs, short-sale constraints and risk-averse investors, since we additionally consider the simultaneous effect of asset supply constraints, investors' background risk and the risk of investment fraud.

Abstract: In this paper, we propose a new class of non-Gaussian random fields named two-piece random fields. The proposed class allows to generate random fields that have flexible marginal distributions, possibly skewed and/or heavy-tailed and, as a consequence, has a wide range of applications. We study the second-order properties of this class and provide analytical expressions for the bivariate distribution and the associated correlation functions. We exemplify our general construction by studying two examples: two-piece Gaussian and two-piece Tukey-h random fields. An interesting feature of the proposed class is that it offers a specific type of dependence that can be useful when modeling data displaying spatial outliers, a property that has been somewhat ignored from modeling viewpoint in the literature for spatial point referenced data. Since the likelihood function involves analytically intractable integrals, we adopt the weighted pairwise likelihood as a method of estimation. The effectiveness of our methodology is illustrated with simulation experiments as well as with the analysis of a georeferenced dataset of mean temperatures in Middle East.

Abstract: Diffusion-Limited Aggregation (DLA) is a cluster-growth model that consists in a set of particles that are sequentially aggregated over a two-dimensional grid. In this paper, we introduce a biased version of the DLA model, in which particles are limited to move in a subset of possible directions. We denote by k-DLA the model where the particles move only in k possible directions. We study the biased DLA model from the perspective of Computational Complexity, defining two decision problems The first problem is Prediction, whose input is a site of the grid c and a sequence S of walks, representing the trajectories of a set of particles. The question is whether a particle stops at site c when sequence S is realized. The second problem is Realization, where the input is a set of positions of the grid, P. The question is whether there exists a sequence S that realizes P, i.e. all particles of S exactly occupy the positions in P. Our aim is to classify the Prediciton and Realization problems for the different versions of DLA. We first show that Prediction is P-Complete for 2-DLA (thus for 3-DLA). Later, we show that Prediction can be solved much more efficiently for 1-DLA. In fact, we show that in that case the problem is NL-Complete. With respect to Realization, we show that restricted to 2-DLA the problem is in P, while in the 1-DLA case, the problem is in L.