Some New Solutions of Non Linear Evolution Equations With Mutable Coefficients

We construct the traveling wave solutions of some NonLinear Evolution Equations (NLEEs) with mutable coefficients arising in different branches of physics and mathematics. we apply a novel (G′G)-formalism to construct more general solitary traveling wave solutions of NLEEs such as Sharma-Tasso-Olver with mutable coefficients and Zakharov Kuznetsov equation. Interesting solutions of NLEEs are investigated by traveling wave solutions which are in form of trigonometric, rational, and hyperbolic functions. This may build more unified new solutions for different kinds of such NLEEs with mutable coefficients arising in mathematics and physics. Wolfram Mathematica 11 is used to perform the computation work and their corresponding plots and counter graphs are plotted. This method is found to be more useful and efficient for searching the exact solutions of NLEEs.

AN INDEFINITE QUADRATIC PROGRAMMING PROBLEMS

In this paper, we give in section (1) compact description of the algorithm for solving general quadratic programming problems (that is, obtaining a local minimum of a quadratic function subject to inequality constraints) is presented. In section (2), we give practical application of the algorithm, we also discuss the computation work and performing by the algorithm and try to achieve efficiency and stability as possible as we can. In section (3), we show how to update the QR-factors of A1 (K), when the tableau is complementary ,we give updating to the LDLT-Factors of (K ) A G . In section (4) we are not going to describe a fully detailed method of obtaini

Practical Time-Release Blockchain

Time-release cryptography is a special encryption technique that allows a message to be hidden for some time. The previous schemes have shortcomings in that the encryptor should predict the decryptor’s computing power precisely or the trusted agent should be always available. In this paper, we propose a new, practical time-release blockchain, and find the key to decrypt the content after a certain time. In order to verify the effectiveness of the blockchain system automatically, which uses the proof-of-work (PoW) and the consensus algorithm in the the proposed technique, we have implemented a prototype version of our blockchain system using Python. The proposed method has the following advantages. First, the decryption time is automatically adjusted, even if the miner’s computing power changes over time. Second, unlike previous time-lock puzzle schemes, our algorithm does not require additional computation work for solving the puzzle. Third, our scheme does not need any trusted agents (third parties). Fourth, the proposed method uses standard cryptographic algorithms.

The Comparison Study of Hybrid Method with RDTM for Solving Rosenau-Hyman Equation

In this paper, the hybrid method (differential transform and finite difference methods) and the RDTM (reduced differential transform method) are implemented to solve Rosenau-Hyman equation. These methods give the desired accurate results in only a few terms and the approach procedure is rather simple and effective. An experiment is given to demonstrate the efficiency and reliability of these presented methods. The obtained numerical results are compared with each other and with exact solution. It seems that the results of the hybrid method and the RDTM show good performance as the other methods. The most important part of this study is that these methods are suitable to solve both some linear and nonlinear problems, and reduce the size of computation work.

New Method for Static Analysis of Frame Structures Considered Floor Deformation

The piecewise continuum technique was used for the frame structure and a series-parallel system was taken for the mathematical model for the structure in which the deformation of floor slab had to be considered, and its state space equations were derived. Then the numerical solution of deformations and internal forces were obtained by using of state method. It is shown that the method of this paper has the advantages of less computation work and high precision.

PARALLEL INCREMENTAL SCHEDULING

Parallel incremental scheduling is a new approach for load balancing. In parallel scheduling, all processors cooperate together to balance the workload. Parallel scheduling accurately balances the load by using global load information. In incremental scheduling, the system scheduling activity alternates with the underlying computation work. This paper provides an overview of parallel incremental scheduling. Different categories of parallel incremental scheduling are discussed.

THE BEST FIT VALUES OF K PARAMETER FOR (n, p) REACTIONS

The semiclassical exciton model which is generally used for describing the pre-equilibrium emission at a moderate excitation energy, contains various free parameters; among them the strength factor K of the two-body residual interaction plays an important role in the computation work. With the view of fixing the free parameter K for (n, p) reactions, the excitation functions for about eight nuclei have been calculated using exciton model in combination with Hauser-Feshbach formalism. The average best fit values of the exciton model free parameter K has been found to be K=700 MeV3. Departure from this value appears to cancel out structure effects introduced into transition rates through the structure-sensitive single particle level density.

Cyclo-Symmetric Modal Synthesis of Rotating Bladed Disc System

The natural mode analysis of bladed disc system at an arbitrary constant rotational speed is investigated in this paper and the large deformation effect caused by the pretorsion of the blades is also considered. The computational method of group theory is employed in substructure technique and equilibrium position and stress distribution of the bladed disc system in centrifugal field are obtained through simultaneous iteration, further more, the initial stress stiffness matrix, the large deformation stiffness matrix and the corresponding rotating natural frequencies and modal shapes are determined. Because the large deformation effect of the blades is considered and all the interface degrees of freedom between the substructures can be eliminated in the present method, the computation work can be cut down remarkably under the precondition that the computational accuracy is ensured. It shows practically that the substructure simultaneous iteration method presented in this paper has a good convergency and greatly reduces the computation work.