A panoramic view of Li7P3S11 solid electrolytes synthesis,structural aspects and practical challenges for all-solid-state lithium batteries

The development of an inorganic electrochemical stable solid-state electrolyte is essentially responsible for future state-of-the-art all-solid-state lithium batteries (ASSLBs). Because of their advantages in safety, working temperature, high energy density, and packaging, ASSLBs can develop an ideal energy storage system for modern electric vehicles (EVs). A solid electrolyte (SE) model must have an economical synthesis approach, exhibit electrochemical and chemical stability, high ionic conductivity, and low interfacial resistance. Owing to its highest conductivity of 17 mS·cm^-1, and deformability, the sulfide-based Li₇P₃S₁₁ solid electrolyte is a promising contender for the high-performance bulk type of ASSLBs. Herein, we present a current glimpse of the progress of synthetic procedures, structural aspects, and ionic conductivity improvement strategies. Structural elucidation and mechanistic approaches have been extensively discussed by using various characterization techniques. The chemical stability of Li₇P₃S₁₁ could be enhanced via oxide doping, and hard and soft acid/base (HSAB) concepts are also discussed. The issues to be undertaken for designing the ideal solid electrolytes, interfacial challenges, and high energy density have been discoursed. This review aims to provide a bird's eye view of the recent development of Li₇P₃S₁₁-based solid-state electrolyte applications and explore the strategies for designing new solid electrolytes with a target-oriented approach to enhance the efficiency of high energy density all-solid-state lithium batteries.     

An improved remote user authentication scheme with key agreement

In distributed systems, user authentication schemes based on password and smart card are widely used to ensure only authorized access to the protected services. Recently, Chang et al. presented an untraceable dynamic-identity-based user authentication scheme with verifiable-password-update. In this research, we illustrate that Chang et al.’s scheme violates the purpose of dynamic-identity contrary to authors’ claim. We show that once the smart card of an arbitrary user is lost, passwords of all registered users are at risk. Using information from an arbitrary smart card, an adversary can impersonate any user of the system. In addition, its password change phase has loopholes and is misguiding. The scheme has no provision for session key agreement and the smart card lacks any verification mechanism. Then we come-up with an improved remote user authentication scheme with the session key agreement, and show its robustness over related schemes.     

An adaptive watermarking scheme for e-government document images

This paper proposes an adaptive watermarking scheme for e-government document images. The adaptive scheme combines the discrete cosine transform (DCT) and the singular value decomposition (SVD) using luminance masking. As a core of masking model in the human visual system (HVS), luminance masking is implemented to improve noise sensitivity. Genetic algorithm (GA), subsequently, is employed for the optimization of the scaling factor of the masking. Involving a number of steps, the scheme proposed through this study begins by calculating the mask of the host image using luminance masking. It is then continued by transforming the mask on each area into all frequencies domain. The watermark image, following this, is embedded by modifying the singular values of DCT-transformed host image with singular values of mask coefficient of host image and the control parameter of DCT-transformed watermark image using Genetic Algorithm (GA). The use of both the singular values and the control parameter respectively, in this case, is not only to improve the sensitivity of the watermark performance but also to avoid the false positive problem. The watermark image, afterwards, is extracted from the distorted images. The experiment results show the improved adaptive performance of the proposed scheme is in resistant to several types of attacks in comparison with the previous schemes; the adaptive performance refers to the adaptive parameter of the luminance masking functioned to improve the performance or robustness of an image from any attacks.     

An architecture modeling framework for probabilistic prediction

In the design phase of business and IT system development, it is desirable to predict the properties of the system-to-be. A number of formalisms to assess qualities such as performance, reliability and security have therefore previously been proposed. However, existing prediction systems do not allow the modeler to express uncertainty with respect to the design of the considered system. Yet, in contemporary business, the high rate of change in the environment leads to uncertainties about present and future characteristics of the system, so significant that ignoring them becomes problematic. In this paper, we propose a formalism, the Predictive, Probabilistic Architecture Modeling Framework (P²AMF), capable of advanced and probabilistically sound reasoning about business and IT architecture models, given in the form of Unified Modeling Language class and object diagrams. The proposed formalism is based on the Object Constraint Language (OCL). To OCL, P²AMF adds a probabilistic inference mechanism. The paper introduces P²AMF, describes its use for system property prediction and assessment and proposes an algorithm for probabilistic inference.     

Implementation of VLSI on Signal Processing-Based Digital Architecture Using AES Algorithm

Continuous improvements in very-large-scale integration (VLSI) technology and design software have significantly broadened the scope of digital signal processing (DSP) applications. The use of application-specific integrated circuits (ASICs) and programmable digital signal processors for many DSP applications have changed, even though new system implementations based on reconfigurable computing are becoming more complex. Adaptable platforms that combine hardware and software programmability efficiency are rapidly maturing with discrete wavelet transformation (DWT) and sophisticated computerized design techniques, which are much needed in today’s modern world. New research and commercial efforts to sustain power optimization, cost savings, and improved runtime effectiveness have been initiated as initial reconfigurable technologies have emerged. Hence, in this paper, it is proposed that the DWT method can be implemented on a field-programmable gate array in a digital architecture (FPGA-DA). We examined the effects of quantization on DWT performance in classification problems to demonstrate its reliability concerning fixed-point math implementations. The Advanced Encryption Standard (AES) algorithm for DWT learning used in this architecture is less responsive to resampling errors than the previously proposed solution in the literature using the artificial neural networks (ANN) method. By reducing hardware area by 57%, the proposed system has a higher throughput rate of 88.72%, reliability analysis of 95.5% compared to the other standard methods.     

MTPSO algorithm for solving planar graph coloring problem

In this paper, we proposed a modified turbulent particle swarm optimization (named MTPSO) model for solving planar graph coloring problem based on particle swarm optimization. The proposed model is consisting of the walking one strategy, assessment strategy and turbulent strategy. The proposed MTPSO model can solve the planar graph coloring problem using four-colors more efficiently and accurately. Compared to the results shown in Cui et al. (2008), not only the experimental results of the proposed model can get smaller average iterations but can get higher correction coloring rate when the number of nodes is greater than 30.     

3D block-based medial axis transform and chessboard distance transform based on dominance

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. In fact, there exist some equivalent properties between them. The relationship between both of them is first derived and proved in this paper. One of the significant properties is that CDT for 3D binary image V is equal to BB-MAT for image V' where it denotes the inverse image of V. In a parallel algorithm, a cost is defined as the product of the time complexity and the number of processors used. The main contribution of this work is to reduce the costs of 3D BB-MAT and 3D CDT problems proposed by Wang [65]. Based on the reverse-dominance technique which is redefined from dominance concept, we achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N³, our parallel algorithm can be run in O(logN) time using N³ processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. The presented results for the cost are reduced in comparison with those of Wang's. To the best of our knowledge, this work is the lowest costs for the 3D BB-MAT and 3D CDT algorithms known. In parallel algorithms, the running time can be divided into computation time and communication time. The experimental results of the running, communication and computation times for the different problem sizes are implemented in an HP Superdome with SMP/CC-NUMA (symmetric multiprocessor/cache coherent non-uniform memory access) architecture. We conclude that the parallel computer (i.e., SMP/CC-NUMA architecture or cluster system) is more suitable for solving problems with a large amount of input size.     

Study on the common criteria methodology for secure ubiquitous environment construction

The ubiquitous environment has been developed since the extension of IT technology. The term ‘Ubiquitous’ is referred firstly by Mark Weiser, which means the user based environment that provides network service ‘any time, anywhere’. In the ubiquitous environment, the computing environment should have the device that recognizes the user and the environment. But there is not a verification process when dealing in sensitive information, and it may cause serious errors or malfunction. In order to complement the problem, members of the CCRA utilized CC(Common Criteria) to build up an assessment system and create a secured ubiquitous environment.     

A Multiscale/stabilized Formulation of the Incompressible Navier–Stokes Equations for Moving Boundary Flows and Fluid–structure Interaction

This paper presents a multiscale/stabilized finite element formulation for the incompressible Navier–Stokes equations written in an Arbitrary Lagrangian–Eulerian (ALE) frame to model flow problems that involve moving and deforming meshes. The new formulation is derived based on the variational multiscale method proposed by Hughes (Comput Methods Appl Mech Eng 127:387–401, 1995) and employed in Masud and Khurram in (Comput Methods Appl Mech Eng 193:1997–2018, 2006); Masud and Khurram in (Comput Methods Appl Mech Eng 195:1750–1777, 2006) to study advection dominated transport phenomena. A significant feature of the formulation is that the structure of the stabilization terms and the definition of the stabilization tensor appear naturally via the solution of the sub-grid scale problem. A mesh moving technique is integrated in this formulation to accommodate the motion and deformation of the computational grid, and to map the moving boundaries in a rational way. Some benchmark problems are shown, and simulations of an elastic beam undergoing large amplitude periodic oscillations in a viscous fluid domain are presented.