Features of the Support Reaction in the Range Maximization Problem in a Resistant Medium

Author(s):  
A. V. Zarodnyuk ◽  
D. I. Bugrov ◽  
O. Yu. Cherkasov
Author(s):  
Aydar К. Gumerov ◽  
◽  
Rinat M. Karimov ◽  
Robert М. Askarov ◽  
Khiramagomed Sh. Shamilov ◽  
...  

The key factor determining the strength, reliability, service life and fail-safe operation of the main pipeline is its stress-strain state. The purpose of this article is to develop a mathematical framework and methodology for calculating the stress-strain state of a pipeline section laid in complex geotechnical conditions, taking into account all planned and altitude changes and impacts at various points of operation, as well as during repair and after its completion. The mathematical framework is based on differential equations reflecting the equilibrium state of the pipeline, taking into account the features of the sections (configuration, size, initial stress state, acting forces, temperature conditions, interaction with soil, supports, and pipe layers). The equilibrium equations are drawn up in a curvilinear coordinate system – the same one that is used for in-pipe diagnostics. According to the results of the solution, all stress components are determined at each point both along the length of the pipeline and along the circumference of any section. At the same time, transverse and longitudinal forces, bending moments, shearing forces, pipeline displacements relative to the ground and soil response to displacements are determined. As an example, a solution is given using the developed mathematical framework. During the course of calculation, the places where the lower form of the pipe does not touch the ground and the places where the support reaction becomes higher than a predetermined limit are determined. A comparative analysis was accomplished, and the optimal method for section repair has been selected.


Author(s):  
Nguyen N. Tran ◽  
Ha X. Nguyen

A capacity analysis for generally correlated wireless multi-hop multi-input multi-output (MIMO) channels is presented in this paper. The channel at each hop is spatially correlated, the source symbols are mutually correlated, and the additive Gaussian noises are colored. First, by invoking Karush-Kuhn-Tucker condition for the optimality of convex programming, we derive the optimal source symbol covariance for the maximum mutual information between the channel input and the channel output when having the full knowledge of channel at the transmitter. Secondly, we formulate the average mutual information maximization problem when having only the channel statistics at the transmitter. Since this problem is almost impossible to be solved analytically, the numerical interior-point-method is employed to obtain the optimal solution. Furthermore, to reduce the computational complexity, an asymptotic closed-form solution is derived by maximizing an upper bound of the objective function. Simulation results show that the average mutual information obtained by the asymptotic design is very closed to that obtained by the optimal design, while saving a huge computational complexity.


Alloy Digest ◽  
1959 ◽  
Vol 8 (11) ◽  

Abstract BIRMABRIGHT B.B.5 is a corrosion resistant, medium-strength magnesium-aluminum alloy in both the cast and wrought conditions. This datasheet provides information on composition, physical properties, hardness, elasticity, tensile properties, and compressive strength as well as fatigue. It also includes information on high temperature performance and corrosion resistance as well as casting, forming, heat treating, machining, and joining. Filing Code: Al-85. Producer or source: Birmabright Ltd.


2021 ◽  
Vol 11 (14) ◽  
pp. 6401
Author(s):  
Kateryna Czerniachowska ◽  
Karina Sachpazidu-Wójcicka ◽  
Piotr Sulikowski ◽  
Marcin Hernes ◽  
Artur Rot

This paper discusses the problem of retailers’ profit maximization regarding displaying products on the planogram shelves, which may have different dimensions in each store but allocate the same product sets. We develop a mathematical model and a genetic algorithm for solving the shelf space allocation problem with the criteria of retailers’ profit maximization. The implemented program executes in a reasonable time. The quality of the genetic algorithm has been evaluated using the CPLEX solver. We determine four groups of constraints for the products that should be allocated on a shelf: shelf constraints, shelf type constraints, product constraints, and virtual segment constraints. The validity of the developed genetic algorithm has been checked on 25 retailing test cases. Computational results prove that the proposed approach allows for obtaining efficient results in short running time, and the developed complex shelf space allocation model, which considers multiple attributes of a shelf, segment, and product, as well as product capping and nesting allocation rule, is of high practical relevance. The proposed approach allows retailers to receive higher store profits with regard to the actual merchandising rules.


2021 ◽  
Vol 11 (12) ◽  
pp. 5647
Author(s):  
Nanxiang Guan ◽  
Ao Wang ◽  
Yongpeng Gu ◽  
Zhifeng Xie ◽  
Ming Zhou

Vibration is an important issue faced by reciprocating piston engines, and is caused by reciprocating inertia forces of the piston set. To reduce the vibration without changing the main structure and size of the original engine, we proposed a novel coaxial balance mechanism design based on a compact unit body. By introducing a second-order balance mass, this mechanism can significantly increase the efficiency of vibration reduction. The proposed mechanism can effectively balance the first-order and second-order inertia forces with the potential of balancing high-order inertia forces. To accurately determine the second-order balance mass, a closed-form method was developed. Simulation results with a single-cylinder piston DK32 engine demonstrate the effectiveness and advantage of the proposed mechanism. At a crankshaft speed of 2350 r/min, compared with the first-order balance device, the average root mean square velocity of the test points on the engine’s cylinder was reduced by 97.31%, and the support reaction force was reduced by 96.54%.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Yaoxin Li ◽  
Jing Liu ◽  
Guozheng Lin ◽  
Yueyuan Hou ◽  
Muyun Mou ◽  
...  

AbstractIn computer science, there exist a large number of optimization problems defined on graphs, that is to find a best node state configuration or a network structure, such that the designed objective function is optimized under some constraints. However, these problems are notorious for their hardness to solve, because most of them are NP-hard or NP-complete. Although traditional general methods such as simulated annealing (SA), genetic algorithms (GA), and so forth have been devised to these hard problems, their accuracy and time consumption are not satisfying in practice. In this work, we proposed a simple, fast, and general algorithm framework based on advanced automatic differentiation technique empowered by deep learning frameworks. By introducing Gumbel-softmax technique, we can optimize the objective function directly by gradient descent algorithm regardless of the discrete nature of variables. We also introduce evolution strategy to parallel version of our algorithm. We test our algorithm on four representative optimization problems on graph including modularity optimization from network science, Sherrington–Kirkpatrick (SK) model from statistical physics, maximum independent set (MIS) and minimum vertex cover (MVC) problem from combinatorial optimization on graph, and Influence Maximization problem from computational social science. High-quality solutions can be obtained with much less time-consuming compared to the traditional approaches.


Energies ◽  
2019 ◽  
Vol 12 (22) ◽  
pp. 4300 ◽  
Author(s):  
Hoon Lee ◽  
Han Seung Jang ◽  
Bang Chul Jung

Achieving energy efficiency (EE) fairness among heterogeneous mobile devices will become a crucial issue in future wireless networks. This paper investigates a deep learning (DL) approach for improving EE fairness performance in interference channels (IFCs) where multiple transmitters simultaneously convey data to their corresponding receivers. To improve the EE fairness, we aim to maximize the minimum EE among multiple transmitter–receiver pairs by optimizing the transmit power levels. Due to fractional and max-min formulation, the problem is shown to be non-convex, and, thus, it is difficult to identify the optimal power control policy. Although the EE fairness maximization problem has been recently addressed by the successive convex approximation framework, it requires intensive computations for iterative optimizations and suffers from the sub-optimality incurred by the non-convexity. To tackle these issues, we propose a deep neural network (DNN) where the procedure of optimal solution calculation, which is unknown in general, is accurately approximated by well-designed DNNs. The target of the DNN is to yield an efficient power control solution for the EE fairness maximization problem by accepting the channel state information as an input feature. An unsupervised training algorithm is presented where the DNN learns an effective mapping from the channel to the EE maximizing power control strategy by itself. Numerical results demonstrate that the proposed DNN-based power control method performs better than a conventional optimization approach with much-reduced execution time. This work opens a new possibility of using DL as an alternative optimization tool for the EE maximizing design of the next-generation wireless networks.


Sign in / Sign up

Export Citation Format

Share Document