Terahertz time domain spectroscopy of graphene and MXene polymer composites

The rising demand for faster and more efficient electronic devices forces electronics industry to shift toward terahertz frequencies. Therefore there is a growing need for efficient, lightweight, and easy to produce absorbing materials in the terahertz range for electromagnetic interference (EMI) shielding and related applications. This study presents a study on basic optical properties of two types polymer-based composites loaded with two-dimensional structures—graphene and MXene phases (Ti₂C). In said range, total EMI shielding efficiency (SE) and its components, the absorption coefficient (α ), refractive index, and complex dielectric function are investigated. The ratio of SE absorption component to reflection component (SE_ABS :SE_R ) of fabricated composites is equal or higher than 30:1 in over 80% of studied range. The fabricated composites exhibit low (<0.1) loss tangent in studied range. The addition of 1 wt% of graphene increases the composite α over 10-fold in respect to pure polymer–up to 60 cm⁻¹ for frequency higher than 2 THz.     

Maximum throughput of multiple access channels in adversarial environments

We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. A protocol is stable when the number of packets in queues at the stations stays bounded. The maximum injection rate that a protocol can handle in a stable manner is called the throughput of the protocol. We consider adversaries of injection rate 1, that is, of one packet per round, to address the question if the maximum throughput 1 can be achieved, and if so then with what quality of service. We develop a protocol that achieves throughput 1 for any number of stations against leaky-bucket adversaries. The protocol has O(n²+\textburstiness){\mathcal{O}(n^2+\text{burstiness})} packets queued simultaneously at any time, where n is the number of stations; this upper bound is proved to be best possible. A protocol is called fair when each packet is eventually broadcast. We show that no protocol can be both stable and fair for a system of at least two stations against leaky-bucket adversaries. We study in detail small systems of exactly two and three stations against window adversaries to exhibit differences in quality of broadcast among classes of protocols. A protocol is said to have fair latency if the waiting time of packets is O(\textburstiness){\mathcal{O}(\text{burstiness})}. For two stations, we show that fair latency can be achieved by a full sensing protocol, while there is no stable acknowledgment based protocol. For three stations, we show that fair latency can be achieved by a general protocol, while no full sensing protocol can be stable. Finally, we show that protocols that either are fair or do not have the queue sizes affect the order of transmissions cannot be stable in systems of at least four stations against window adversaries.     

Self-optimizing generalized adaptive notch filters — comparison of three optimization strategies

The paper provides comparison of three different approaches to on-line tuning of generalized adaptive notch filters (GANFs) — the algorithms used for identification/tracking of quasi-periodically varying dynamic systems. Tuning is needed to adjust adaptation gains, which control tracking performance of GANF algorithms, to the unknown and/or time time-varying rate of system nonstationarity. Two out of three compared approaches are classical solutions — the first one incorporates sequential optimization of adaptation gains while the second one is based on the concept of parallel estimation. The main contribution of the paper is that it suggests the third way — it shows that the best results can be achieved when both approaches mentioned above are combined in a judicious way. Such joint sequential/parallel optimization preserves advantages of both treatments: adaptiveness (sequential approach) and robustness to abrupt changes (parallel approach). Additionally the paper shows how, using the concept of surrogate outputs, one can extend the proposed single-frequency algorithm to the multiple frequencies case, without falling into the complexity trap known as the “curse of dimensionality”.     

Constrained motion planning of nonholonomic systems

This paper addresses the constrained motion planning problem for nonholonomic systems represented by driftless control systems with output. The problem consists in defining a control function driving the system output to a desirable point at a given time instant, whereas state and control variables remain over the control horizon within prescribed bounds. The state and control constraints are handled by extending the control system with a pair of state equations driven by the violation of constraints, and adding regularizing perturbations. For the regularized system a Jacobian motion planning algorithm is designed, called imbalanced. Solutions of example constrained motion planning problems for the rolling ball illustrate the theoretical concepts.     

Evolutionary Algorithm Integrating Stress Heuristics for Truss Optimization

The optimal truss design using problem-oriented evolutionary algorithm is presented in the paper. The minimum weight structures subjected to stress and displacement constraints are searched. The discrete design variables are areas of members, selected from catalogues of available sections. The integration of the problem specific knowledge into the optimization procedure is proposed. The heuristic rules based on the concept of fully stressed design are introduced through special genetic operators, which use the information concerning the stress distribution of structural members. Moreover, approximated solutions obtained by deterministic, sequential discrete optimization methods are inserted into the initial population. The obtained hybrid evolutionary algorithm is specialized for truss design. Benchmark problems are calculated in numerical examples. The knowledge about the problem integrated into the evolutionary algorithm can enhance considerably the effectiveness of the approach and improve significantly the convergence rate and the quality of the results. The advantages and drawbacks of the proposed method are discussed.     

Online determination of transient thermal stresses in critical steam turbine components using a two-step algorithm

The article presents a novel algorithm for robust calculation of thermal stresses in steam turbine components during transient operating conditions. Stress calculations are performed in 2 steps: in the first step an unsteady radial temperature distribution in the component model is computed, and based on this thermal stresses at critical locations are determined in the second step. The radial temperature distribution is obtained by solving the Fourier-Kirchhoff equation for a cylinder or sphere by means of a finite difference method. The thermal stresses are computed using the Duhamel integral and Green functions evaluated with a constant heat transfer coe?cient and used with an equivalent steam temperature obtained from the surface heat flux.     

Influence of megaplastic deformation on the structure and hardness of Al–Cu–Mg alloy after aging

Methods of electron microscopy and X-ray diffraction have been used to investigate structural and phase transformations in the aluminum alloy of grade A2024 (Al–4.5 Cu–1.37 Mg–0.61 Mn–0.07 Si–0.27 Fe–0.02 Zn–0.02 Ti (wt %)) after aging and deformation by shear under high quasi-static pressure. It has been shown that the combination of two-stage aging with megaplastic deformation leads to the refinement of the structure to a nanolevel and to strengthening of the alloy (to an increase in the microhardness to 3000 MPa). The values of true deformation at which the deformation-induced dissolution of the particles of the strengthening S phase occurs have been determined.