Search
Search Results
-
About One Galois Embedding Problem
The Galois embedding problem of an extension with elementary Abelian 2-group into an extension with the Galois group isomorphic to the group of...
-
Space-time estimates of the 3D bipolar compressible Navier-Stokes-Poisson system with unequal viscosities
The space-time behavior for the Cauchy problem of the 3D compressible bipolar Navier-Stokes-Poisson (BNSP) system with unequal viscosities is given....
-
Collapse of Dark States in Tavis–Cummings Model
The singlet state of a system of two two-level atoms changes smoothly, remaining dark, as the Hamiltonian TC is slowly deformed, despite the...
-
Packing four copies of a tree into a complete bipartite graph
In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009) gives a conjecture: For each tree T of order n and each...
-
Reflection and transmission of quasi-plane waves at the interface of piezoelectric semiconductors with initial stresses
We examine the reflection and transmission phenomena of quasi-longitudinal plane (QP) waves in an AlN-ZnO laminated composite structure. The...
-
A Low-Complexity Key-Recovery Attack on 6-Round Midori64
In EUROCRYPT 2017, a new structure-difference property, say “a-multiple-of-8” was proposed on 5-round AES. Inspired by the idea, yoyo attacks and...
-
A non-probabilistic reliability topology optimization method based on aggregation function and matrix multiplication considering buckling response constraints
A non-probabilistic reliability topology optimization method is proposed based on the aggregation function and matrix multiplication. The expression...
-
DSLS: a simple and efficient local search algorithm for the maximum bisection problem
The maximum bisection problem (max-bisection) belongs to a family of well-known graph partitioning problems with wide applications. In this study, we...
-
List Edge Coloring of Outer-1-planar Graphs
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. It is...
-
Numerical Methods for Determining the Coefficient and the Source Term in the Heat Equation
Two inverse problems are considered for the heat equation with unknown thermal conductivity coefficient and unknown function in the source term. The...
-
Fundamental Solutions for a Piecewise-Homogeneous Transversely Isotropic Elastic Space
The problem of construction of the fundamental solutions for a piecewise-homogeneous transversely isotropic space is reduced to a matrix Riemann...
-
Quantile Regression of Ultra-high Dimensional Partially Linear Varying-coefficient Model with Missing Observations
In this paper, we focus on the partially linear varying-coefficient quantile regression with missing observations under ultra-high dimension, where...
-
Large Dynamic Covariance Matrix Estimation with an Application to Portfolio Allocation: A Semiparametric Reproducing Kernel Hilbert Space Approach
The estimation of high dimensional covariance matrices is an interesting and important research topic for many empirical time series problems such as...
-
Simulation of Flow over Pseudo-Random Rough Surfaces
Direct Numerical Simulation (DNS) is used to study fully developed turbulent flow over a number of irregular rough surfaces in periodic plane...
-
Some Classes of Linear Conjugation Problems for a Four-Dimensional Vector That Are Solvable in Closed Form
We consider the structure of the set of piecewise meromorphic solutions of a homogeneous linear conjugation problem for a four-dimensional vector. We...
-
A speciation-based bilevel niching method for multimodal truss design problems
Truss design is a well-known structural optimization problem that has important practical applications in various fields. Truss design problems are...
-
Almost-Equidistant Sets
For a positive integer d , a set of points in d -dimensional Euclidean space is called almost-equidistant if for any three points from the set, some...
-
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs
A path in a vertex-coloured graph is called conflict-free if there is a colour used on exactly one of its vertices. A vertex-coloured graph is said...
-
Dynamical analysis of a giving up smoking model with time delay
In this paper, we are concerned with a delayed smoking model in which the population is divided into five classes. Sufficient conditions guaranteeing...
