As a result of the fast spread of Coronavirus disease (COVID-19) throughout the world, it became urgent to evolve an aided-intelligent system to help healthcare organizations to control and early detect COVID-19 outbr...
详细信息
Due to drastic climatic changes and scarcity of water, the need for proper and sustainable irrigation methods is of high demand. The water demand for plants varies from place to place with the changes in soil content,...
详细信息
A multiparadigm approach is developed and demonstrated for exploiting knowledge about structure for the purpose of extracting information from noisy textual data. A motivating example of a potential application would ...
详细信息
Big data has emerged very fast, and this has brought both opportunities and problems that are related to the application of deep learning. This paper explores how deep learning can be implemented using big data and in...
详细信息
Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-bas...
Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.
In this paper, the whole system starts with a real time picture of the sender and the receiver. The pairing is done utilizing the image of the sender and the receiver at the place of the pin used for pairing. The key ...
详细信息
Speech Enhancement (SE) aims to improve the quality of degraded speech while maintaining its intelligibility. The Wavelet Transform (WT) has become a powerful tool of signal analysis thereby widely used in signal dete...
详细信息
In a faulty environment, comparisons between two elements with respect to an underlying linear order can come out right or go wrong. A wrong comparison is a recurring comparison fault if comparing the same two element...
详细信息
ISBN:
(纸本)9783319221762
In a faulty environment, comparisons between two elements with respect to an underlying linear order can come out right or go wrong. A wrong comparison is a recurring comparison fault if comparing the same two elements yields the very same result each time we compare the elements. We examine the impact of such faults on the elementary problems of sorting a set of distinct elements and finding a minimum element in such a set. The more faults occur, the worse the approaches to solve these problems can become and we parametrize our analysis by an upper bound k on the number of faults. We first explain that reconstructing the sorted order of the elements is impossible in the presence of even one fault. Then, we focus on the maximum information content we get by performing all possible comparisons. We consider two natural approaches for sorting the elements that involve knowledge of the outcomes of all comparisons: the first approach finds a permutation (compatible solution) that contradicts at most k times the outcomes of comparisons, and the second approach sorts the elements by the number of times an element is returned to be larger in the outcomes of its comparisons with all other elements (score solution). In such permutations the elements can be dislocated from their positions in the linear order. We measure the quality of such permutations by three measures: the maximum dislocation of an element, the sum of dislocations of all elements, and the Kemeny distance compared to the linear order. We show for compatible solutions that the Kemeny distance is at most 2k, the sum of dislocations at most 4k, and the maximum dislocation at most 2k. In score solutions the Kemeny distance is smaller than 4k, the sum of dislocations smaller than 8k, and the maximum dislocation at most k +1. Our upper bounds are tight for compatible solutions, but possibly not tight for score solutions. It turns out that none of the two approaches is better than the other in all measures. For the
A key component for preserving a WSN's integrity is designing an intrusion detection system (IDS). This article covers several sorts of security threats that may occur in a WSN. It proposes a detection of maliciou...
详细信息
暂无评论