Authenticated key exchange (AKE) needs to be designed for realizing point-to-multipoint secure communications in blockchain networks (BNet). However, since BNet is open, untrusted and decentralized, traditional certif...
详细信息
Recent research has demonstrated that neural networks using periodic nonlinearities may be used for implicit representation and reconstruction of continuous-time signals. Starting with a previously published network f...
详细信息
The work covers topics in face detection, prediction of the position of the face landmarks as well as control of the graphical model. The purpose of the work is to create a vision system that detects the user's fa...
详细信息
ISBN:
(纸本)9783031430770;9783031430787
The work covers topics in face detection, prediction of the position of the face landmarks as well as control of the graphical model. The purpose of the work is to create a vision system that detects the user's facial expressions and visualizes them on the created computer model. The scope of work includes detection of the face and face landmarks, creation of a graphic model of a character whose facial expressions can be modified, and control of the created model using data obtained from the camera image. The main objectives of the project are easy accessibility, simplicity of use and low cost of the tools used.
With the arrival of big data era and the rapid development of artificial intelligence, deep learning has made breakthroughs in many fields. However, although it has been widely used in many fields, there are still man...
详细信息
The objective of this article is to propose two natural generalizations of covering edges by edges (Edge Dominating Set) and study these problems from the multivariate lens. The first is simply considering Edge Domina...
详细信息
ISBN:
(纸本)9783031826696
The objective of this article is to propose two natural generalizations of covering edges by edges (Edge Dominating Set) and study these problems from the multivariate lens. The first is simply considering Edge Dominating Set on hypergraphs, called Hyperedge Dominating Set. Given a hypergraph H=(U,F), a set F⊆F is called a hyperedge dominating set if all hyperedges intersect with at least one hyperedge e∈F. The objective of the Hyperedge Dominating Set problem is to determine whether a hyperedge dominating set of size at most k exists. We find it quite surprising that such generalization is missing from the literature. The second extension we consider is the t-Path Edge Dominating Set problem. In this problem, the input consists of a graph G and an integer k, and the goal is to find a set P of at most k paths, each of length at most t, such that for every edge in G, at least one of its endpoints belongs to the vertex set V(P) for some P∈P. We show the following results and add to the literature on Edge Dominating Set. Hyperedge Dominating Set is FPT parameterized by k+d, where d is the maximum size of a hyperedge in the input hypergraph.A kernel of size O(kd) can be obtained for the Hyperedge Dominating Set problem, where d is the maximum size of a hyperedge in the input *** problem of finding a Hyperedge Dominating Set is computationally difficult;specifically it is W[2]-hard when parameterized by k. This hardness result holds even when each vertex is contained in at most 2 hyperedges and the intersection between any two hyperedges is at most 1.t-Path Edge Dominating Set is FPT when parameterized by k+t. Additionally, it has a kernel of size O(k3t3). Hyperedge Dominating Set is FPT parameterized by k+d, where d is the maximum size of a hyperedge in the input hypergraph. A kernel of size O(kd) can be obtained for the Hyperedge Dominating Set problem, where d is the maximum size of a hyperedge in the input hypergraph. The problem of finding a Hyperedge Dom
In multi-tenant clouds, service providers offer services to tenants and generate profits by deploying network function (e.g., NAT, VPN) instances. Tenants access services by forwarding their requests to corresponding ...
详细信息
Two minimization problems are added to the Moskovka and Valdman MATLAB package (2022): a Ginzburg-Landau (scalar) problem and a topology optimization (both scalar and vector) problem in linear elasticity. Both problem...
详细信息
Afra is an Eclipse-based tool for the modeling and model checking of Rebeca family models. Together with the standard enriched editor, easy to trace counter-example viewer, modular temporal property definition, export...
详细信息
In face detection, low-resolution faces, such as numerous small faces of a human group in a crowded scene, are common in dense face prediction tasks. They usually contain limited visual clues and make small faces less...
详细信息
In the field of computer vision, data augmentation is widely used to enrich the feature complexity of training datasets with deep learning techniques. However, regarding the generalization capabilities of models, the ...
详细信息
暂无评论