This paper describes problems of improving security cameras' video footage for forensic investigation. When processing records, one encounters problems with low resolution, poor lighting, or excessive distance of ...
详细信息
We are intrigued by the issues of shock instability,with a particular emphasis on numerical schemes that address the carbuncle phenomenon by reducing dissipation rather than increasing *** a specific class of planar f...
详细信息
We are intrigued by the issues of shock instability,with a particular emphasis on numerical schemes that address the carbuncle phenomenon by reducing dissipation rather than increasing *** a specific class of planar flow fields where the transverse direction exhibits vanishing but non-zero velocity components,such as a disturbed onedimensional(1D)steady shock wave,we conduct a formal asymptotic analysis for the Euler system and associated numerical *** analysis aims to illustrate the discrepancies among various low-dissipative numerical ***,a numerical stability analysis of steady shock is undertaken to identify the key factors underlying shock-stable *** verify the stability mechanism,a consistent,low-dissipation,and shock-stable HLLC-type Riemann solver is presented.
While it is important to understand citizens' trust in e-government, theory on this topic does not accommodate potential differences between innovators and non-innovators. To investigate factors of trust developme...
详细信息
While it is important to understand citizens' trust in e-government, theory on this topic does not accommodate potential differences between innovators and non-innovators. To investigate factors of trust developme...
详细信息
A homomorphism from a graph G to a graph H is an edge-preserving mapping from V (G) to V (H). In the graph homomorphism problem, denoted by Hom(H), the graph H is fixed and we need to determine if there exists a homom...
详细信息
ISBN:
(纸本)9783959773225
A homomorphism from a graph G to a graph H is an edge-preserving mapping from V (G) to V (H). In the graph homomorphism problem, denoted by Hom(H), the graph H is fixed and we need to determine if there exists a homomorphism from an instance graph G to H. We study the complexity of the problem parameterized by the cutwidth of G, i.e., we assume that G is given along with a linear ordering v1, . . ., vn of V (G) such that, for each i ∈ {1, . . ., n − 1}, the number of edges with one endpoint in {v1, . . ., vi} and the other in {vi+1, . . ., vn} is at most k. We aim, for each H, for algorithms for Hom(H) running in time ckHnO(1) and matching lower bounds that exclude ckH·o(1)nO(1) or ckH(1−Ω(1))nO(1) time algorithms under the (Strong) Exponential Time Hypothesis. In the paper we introduce a new parameter that we call mimsup(H). Our main contribution is strong evidence of a close connection between cH and mimsup(H): an information-theoretic argument that the number of states needed in a natural dynamic programming algorithm is at most mimsup(H)k, lower bounds that show that for almost all graphs H indeed we have cH ≥ mimsup(H), assuming the (Strong) Exponential-Time Hypothesis, and an algorithm with running time exp(O(mimsup(H) · k log k))nO(1). In the last result we do not need to assume that H is a fixed graph. Thus, as a consequence, we obtain that the problem of deciding whether G admits a homomorphism to H is fixed-parameter tractable, when parameterized by cutwidth of G and mimsup(H). The parameter mimsup(H) can be thought of as the p-th root of the maximum induced matching number in the graph obtained by multiplying p copies of H via a certain graph product, where p tends to infinity. It can also be defined as an asymptotic rank parameter of the adjacency matrix of H. Such parameters play a central role in, among others, algebraic complexity theory and additive combinatorics. Our results tightly link the parameterized complexity of a problem to such an asymptoti
This research paper offers a novel approach to detect rear-end collisions and increase the acceleration of the victim car to possibly avoid or minimize the impact of the collision. A Deep Q-Learning model is utilized ...
详细信息
A key necessity in managing signals for processing and generating useful information in the healthcare domain is the use of many algorithms. Traditional computing methods have been successful but may not be effective ...
详细信息
In this paper,we present a nonlinear correction technique to modify the nine-point scheme proposed in[SIAM ***.,30:3(2008),1341-1361]such that the resulted scheme preserves the *** first express the flux by the cell-c...
详细信息
In this paper,we present a nonlinear correction technique to modify the nine-point scheme proposed in[SIAM ***.,30:3(2008),1341-1361]such that the resulted scheme preserves the *** first express the flux by the cell-centered unknowns and edge unknowns based on the stencil of the nine-point ***,we use a nonlinear combination technique to get a monotone *** order to obtain a cell-centered finite volume scheme,we need to use the cell-centered unknowns to locally approximate the auxiliary *** present a new method to approximate the auxiliary unknowns by using the idea of an improved multi-points flux *** numerical results show that the new proposed scheme is robust,can handle some distorted grids that some existing finite volume schemes could not handle,and has higher numerical accuracy than some existing positivity-preserving finite volume schemes.
Water Quality Sensors (WQSs) are becoming a promised tool in water quality data assessment and scientific value of aquatic structure. Such sensors are broadly used to produce live results by evaluating major water qua...
详细信息
Task planning algorithms are essential for maximizing efficiency and enhancing performance in modern computing systems, given the escalating demand for computational resources. This paper delves into the effectiveness...
详细信息
暂无评论