No abstract

No abstract

Optimization algorithms are liable for sinking the losses and to give the most precise outcomes conceivable. Optimizers are utilized to modify the properties of neural network, for example, training rate and weights are used to reduce the losses. Optimization means a procedure of obtaining a global optimal solution for a given problem under given conditions. The real-world problems in the scientific fields, such as engineering design and economic planning, mostly are multimodal, high-dimensional, disconnected, and oscillated optimization problems. These complex problems cannot be solved well within reasonable time using traditional method based on gradient. Nature-inspired algorithms are becoming delightful in resolving mathematical optimization problems, like multiprocessor scheduling problem, vehicle routing and classification problems etc. In this manuscript, Whale Swarm Optimization algorithm on optimizing the neural networks, one of the meta-heuristic algorithms is applied to analysis of the cardiovascular disease dataset and compares the performance with Gradient Descent and RMSprop optimization techniques.

Summary A time‐limited data access control scheme allows a user's access to the data files only for a specified time period. A cryptographic solution to the time‐limited access control problem is by encrypting each data group associated with a time period with a distinct key. The data is encrypted by the data owner. The respective decryption keys are then distributed to authorized users by the data owner. A user requires one secret decryption key storage for each authorized time period. To reduce the secret key storage with each user, time‐limited hierarchical key management schemes are generally used. Many such schemes are proposed in the recent years. The objective of these schemes is system efficiency and data security. Construction of such schemes become more challenging when data is outsourced to an untrusted third party service provider. In current work, an efficient and secure time‐limited hierarchical key assignment scheme is proposed for key management suitable for data outsourcing scenario. We compare it with the other recent similar schemes. The scheme is formally proved against the modern stronger security notion called key indistinguishability.

In this present paper, an M/M/1 retrial queueing model with a waiting server subject to breakdown and repair under working vacation, vacation interruption is considered. Customers are served at a slow rate during the working vacation period, and the server may undergo breakdowns from a normal busy state. The customer has to wait in orbit for the service until the server gets repaired. Steady-state solutions are obtained using the probability generating function technique. Probabilities of different server states and some other performance measures of the system are developed.  The variation in mean orbit size, availability of the server, and server state probabilities are plotted for different values of breakdown parameter and repair rate with the help of MATLAB software. Finally, cost optimization of the system is also discussed, and the optimal value of the slow service rate for the model is obtained.