This study evaluates biorefinery bio-oil feedstock costs at the plant gate for a prospective field pennycress (Thlaspi arvense L.) to sustainable aviation fuel (SAF) supply chain. The biorefinery would supply SAF to the Nashville, Tennessee international airport. Supply chain activities include pennycress production, transporting oilseed to a crushing facility, processing of oilseed into bio-oil, and transporting bio-oil to the biorefinery. The analysis shows profit potential for economic agents in the prospective supply chain. Estimated breakeven cost (profit = 0) of growing, harvesting, and transporting oilseed to a crushing facility is 17.7 ¢ kg −1 . A crushing facility can pay up to 23.8 ¢ kg −1 for pennycress oilseed during the first year of production and provide investors 12.5% annual rate of return. Therefore, a profit margin of up to 6.1 ¢ kg −1 is available for the crushing facility to induce prospective pennycress producers to supply oilseed for SAF production. However, the estimated profit margin was sensitive mainly to uncertain oilseed yields, changes in field production costs, and pennycress meal and bio-oil prices. A spatial biorefineries sitting model, the Biofuels Facility Location Analysis Modeling Endeavor, estimated that the least-cost supply chain configuration is to establish three crushing facilities located in Union City, Huntington, and Clarksville, TN, to supply bio-oil to the biorefinery, with the biorefinery sited in an industrial park about 24.14 km from the Nashville international airport aviation fuel storage. Estimated total costs of bio-oil at the biorefinery plant gate are between 83 and 109 ¢ kg −1 if crushing facility oilseed procurement costs are between 17.7 and 23.8 ¢ kg −1 for oilseed.

No abstract

No abstract

No abstract

No abstract

This paper presents a new method for the relaxation of multiview registration error. The multiview registration problem is represented using a graph. Each node and each edge in the graph represents a 3-D data set and a pairwise registration, respectively. Assuming that all the pairwise registration processes have converged to fine results, this paper shows that the multiview registration problem can be converted into a quadratic programming problem of Lie algebra parameters. The constraints are obtained from every cycle of the graph to eliminate the accumulation errors of global registration. A linear solution is proposed to distribute the accumulation error to proper positions in the graph, as specified by the quadratic model. Since the proposed method does not involve the original 3-D data, it has low time and space complexity. Additionally, the proposed method can be embedded into a trust-region algorithm and, thus, can correctly handle the nonlinear effects of large accumulation errors, while preserving the global convergence property to the first-order critical point. Experimental results confirm both the efficiency and the accuracy of the proposed method.

No abstract

The confinement effect in spherical inhomogeneous quantum dots and stability of excitons AIP Advances 7, 065112 (2017); https://doi