The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Typically, neuropsychological testing helps medical experts situate a given patient in continuum of the Alzheimer's disease (AD) spectrum, especially in the continuum between cognitively normal controls (CN) and the prodromal stage of mild cognitive impairment (MCI). As a well-known early symptom, some linguistic complexity changes of language have been associated with the progression of AD. Currently,...
Personalized recommendations can effectively solve the data explosion problem in network. Most existing works utilize rating information to reduce the score prediction error, e.g. MAE; however, users prefer a list of top-k items and minimizing MAE does not always result in better top-k item lists. Meanwhile, because of data sparse problem, social connections among users play an increasingly important...
The practice of using divide and conquer techniques to solve complex, time-consuming problems has been in use for a very long time. Here we evaluate the performance of centroid-based clustering techniques, specifically k-means and its two approximation algorithms, the k-means++ and k-means|| (also known as Scalable k-means++), as divide and conquer paradigms applied for the creation of minimum spanning...
The use of multiple radio access technologies (RATs) is inevitable in future heterogeneous cellular networks. Various RATs can offer different throughputs, and thus RAT selection plays an important role in quality of service provisioning. In this paper, considering a heterogeneous network with two throughput classes, we introduce a new practical probabilistic RAT selection approach. In contrary to...
The implementation of channel estimation procedures in modern wireless networks exposes them to the risk of pilot contamination attacks. To protect the system from such types of malicious intervention, a recently proposed method, based on legitimate pilots from shifted constellations, can be applied. In this paper, the detection capability of this method is studied in both the presence and absence...
According to the state conversion idea of Markov process, we propose a new chaotic sequence quantization algorithm. The Markov quantization algorithm (MQA) we proposed solves the problem of poor sequence balance which is caused by the asymmetry of probability distribution on both sides of the threshold in binary quantization algorithm (BQA). Both the theoretical and simulation study results show that...
Accurate Speech endpoint detection is important for speaker recognition, speech recognition, coding, and transmission and so on. In this paper, a fusion feature is proposed for speech endpoint detection, which utilized zero-crossing rate, Lempel and Ziv complexity (LZC), C0 complexity and fluctuation complexity to represent the speech signal. In order to classify speech signal and background signal,...
What is the right way to reason about human activities? What directions forward are most promising? In this work, we analyze the current state of human activity understanding in videos. The goal of this paper is to examine datasets, evaluation metrics, algorithms, and potential future directions. We look at the qualitative attributes that define activities such as pose variability, brevity, and density...
This work proposes an analytical method for calculating sensitivity index. The proposed method is based on one-at-a-time measurements and calculates the difference between output values and the base solution to define the impact caused by each parameter in the system. The results indicated that the analytical method provides adequate values for the sensitivity index even when the parameters have minor...
Prefix Scan (or simply scan) is an operator that computes all the partial sums of a vector. A scan operation results in a vector where each element is the sum of the preceding elements in the original vector up to the corresponding position. Scan is a key operation in many relevant problems like sorting, lexical analysis, string comparison, image filtering among others. Although there are libraries...
In this paper, we propose an energy-efficient approximate multiplier design approach. Fundamental to this approach is configurable lossy logic compression, coupled with low-cost error mitigation. The logic compression is aimed at reducing the number of product rows using progressive bit significance, and thereby decreasing the number of reduction stages in Wallace-tree accumulation. This accounts...
A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is an extension of the ordinary EVD to polynomial matrices and will diagonalise a parahermitian matrix using paraunitary operations. Inspired by recent work towards a low complexity divide-and-conquer PEVD algorithm, this paper analyses the performance of this...
Starting from a hypothetical open shop production quantity estimation problem with weakly formulated objective function, this paper comparatively discusses a manual heuristic solution and an IBM-ILOG based numerical solution. Problem complexity is managed by specific partitioning strategies in the construction of heuristic solution instances. The study may serve as starting point in the systematic...
We present a deterministic distributed algorithm that computes a (2δ-1)-edge-coloring, or even list-edge-coloring, in any n-node graph with maximum degree δ, in O(log^8 δ ⋅ log n) rounds. This answers one of the long-standing open questions of distributed graph algorithms} from the late 1980s, which asked for a polylogarithmic-time algorithm. See, e.g.,...
In the set disjointess problem, we have k players, each with a private input X^i ⊆ [n], and the goal is for the players to determine whether or not their sets have a global intersection. The players communicate over a shared blackboard, and we charge them for each bit that they write on the board.We study the trade-off between the number of interaction rounds we allow the players, and the...
We prove new lower bounds on the sizes of proofs in the Cutting Plane proof system, using a concept that we call unsatisfiability certificate. This approach is, essentially, equivalent to the well-known feasible interpolation method, but is applicable to CNF formulas that do not seem suitable for interpolation. Specifically, we prove exponential lower bounds for random k-CNFs, where k is the logarithm...
We examine the power of statistical zero knowledge proofs (captured by the complexity class SZK) and their variants. First, we give the strongest known relativized evidence that SZK contains hard problems, by exhibiting an oracle relative to which SZK (indeed, even NISZK) is not contained in the class UPP, containing those problems solvable by randomized algorithms with unbounded error. This answers...
We give a deterministic \tilde{O}(\log n)-space algorithm for approximately solving linear systems given by Laplacians of undirected graphs, and consequently also approximating hitting times, commute times, and escape probabilities for undirected graphs. Previously, such systems were known to be solvable by randomized algorithms using O(\log n) space (Doron, Le Gall, and Ta-Shma, 2017) and hence by...
We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in O(\log^3 n) time on n^{O(\log^2 n)} processors. The result is obtained by a derandomization of the Isolation Lemma for perfect matchings, which was introduced in the classic paper by Mulmuley, Vazirani and Vazirani [1987] to obtain a Randomized NC algorithm...
In a non-uniform Constraint Satisfaction problem CSP(Γ), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the relations from Γ. The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP(Γ)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.