Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

Multilevel Recording in Ge2Sb2Te5 Thin Films

Semiconductors - The current–voltage characteristics measured on Ge2Sb2Te5 thin films in the current mode are studied. The effect of multilevel recording is established when applying...     

Plasmon Resonances in Square and Rectangular Noble Metal Nanoplates

Journal of Communications Technology and Electronics - Abstract—The article considers the two-dimensional diffraction problem of a TM-type plane electromagnetic wave on a cylindrical silver...     

MACBHA: Modified Adaptive Cluster-Based Heuristic Approach with Co-operative Spectrum Sensing in Wireless Sensor Networks

Wireless Personal Communications - In the fusion experiment, sensitive radio frequency signal diagnostic instruments need to be protected against high power stray radiation coming from the Electron...     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

On Heating and Relaxation of the Electron—Hole-Gas Energy in the Track of a Primary Recoil Atom

Semiconductors - On the basis of the Monte Carlo algorithm, a method for calculating the energy spectrum of hot nonequilibrium electrons and holes in the track of a primary recoil atom after being...