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.
The ℓp norm-constrained proportionate normalized least-mean-square (LP-PNLMS) using the modified filtered-x structure is proposed for active noise control. It is shown that better performance is obtained for primary and secondary paths having a wide range of sparseness levels when compared with competing sparsity-inducing algorithms at a price of moderate complexity increase.
This paper gives overview of two modern approaches to enterprise resources scheduling problem: continuous time problem setting that leads to a combinatorial set of classical linear programming models and discrete time approach that gives an integer programming model. We follow the main steps of problem formulating and find decision points where the researcher chooses which model and computational...
In Bike-Sharing System (BSS), great efforts have been devoted to performing resources prediction, redistribution and trip planning to alleviate the unbalance of resources and inconvenience of bike utilization caused by the explosion of users. However, there is few work in trip planning noticing that the complete trip composes of three segments: from user's start point to a start station, from the...
Non-malleable commitments, introduced by Dolev, Dwork and Naor (STOC 1991), are a fundamental cryptographic primitive, and their round complexity has been a subject of great interest. And yet, the goal of achieving non-malleable commitments with only one or two rounds} has been elusive. Pass (TCC 2013) captured this difficulty by proving important impossibility results regarding two-round non-malleable...
In the communication problem UR (universal relation), Alice and Bob respectively receive x, y ∊{0,1\}^n with the promise that x≠ y. The last player to receive a message must output an index i such that x_i≠ y_i. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly \Theta(\min\{n,\log(1/δ)\log^2(\frac...
We study streaming principal component analysis (PCA), that is to find, in O(dk) space, the top k eigenvectors of a d× d hidden matrix \bold \Sigma with online vectors drawn from covariance matrix \bold \Sigma.We provide global convergence for Ojas algorithm which is popularly used in practice but lacks theoretical understanding for k≈1. We also provide a modified variant \mathsf{Oja}^{++}...
We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of bidder valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We obtain our learning results in two settings. The first is the commonly studied setting where sample access to the bidders distributions over valuations is given,...
For any n-bit boolean function f, we show that the randomized communication complexity of the composed function f o g^n, where g is an index gadget, is characterized by the randomized decision tree complexity of f. In particular, this means that many query complexity separations involving randomized models (e.g., classical vs. quantum) automatically imply analogous separations in communication complexity.
We provide a combinatorial characterization of all testable properties of k-graphs (i.e. k-uniform hypergraphs). Here, a k-graph property P is testable if there is a randomized algorithm which makes a bounded number of edge queries and distinguishes with probability 2/3 between k-graphs that satisfy P and those that are far from satisfying P. For the 2-graph case, such a combinatorial characterization...
In this paper we introduce the notion of lockable obfuscation. In a lockable obfuscation scheme there exists an obfuscation algorithm Obf that takes as input a security parameter, a program P, a message msg and lock value lck and outputs an obfuscated program oP. One can evaluate the obfuscated program oP on any input x where the output of evaluation is the message msg if P(x) = lck and otherwise...
Ramsey theory assures us that in any graph there is a clique or independent set of a certain size, roughly logarithmic in the graph size. But how difficult is it to find the clique or independent set? If the graph is given explicitly, then it is possible to do so while examining a linear number of edges. If the graph is given by a black-box, where to figure out whether a certain edge exists the box...
We consider the problem of robust polynomial regression, where one receives samples that are usually within a small additive error of a target polynomial, but have a chance of being arbitrary adversarial outliers. Previously, it was known how to efficiently estimate the target polynomial only when the outlier probability was subconstant in the degree of the target polynomial. We give an algorithm...
Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this property was not known to be robust - the marginals of such states to a subset of the qubits containing all but a small constant fraction of them may be only locally...
Spreadsheets serve as a basis for decision-making processes in many companies and bugs in spreadsheets can therefore represent a considerable risk to businesses. Systematic tests can help to locate such bugs, but providing test cases can be cumbersome and complex for large real-world spreadsheets. To make the specification of test cases easier, we propose to split spreadsheets into smaller logically...
User interface modeling tools can play a useful role for engineering interactive systems. However, little is known about how these tools are used, the strategies and workarounds employed, and whether usability problems are encountered. To start answering this question, we run a user study with software engineers carrying out task modeling activities. The analysis of the data generated by an instrumented...
Solid state transformers (SSTs) include dc subsystems to enable plug-and-play support of dc loads, generation sources, and energy storage. Dual active bridge (DAB) converters are a suitable topology for both the primary energy conversion and load interface applications in an SST. This study considers an SST that uses DAB converters for both applications, and describes a method of generating a full...
Gesture recognition is an important research area in video analysis and computer vision. Gesture recognition systems include several advantages, such as the interaction with machines without needing additional external devices. Moreover, gesture recognition involves many challenges, as the distribution of a specific gesture largely varies depending on viewpoints due to its multiple joint structures...
Established methods and processes in the field of Automotive Systems Engineering (ASE) are challenged by the rising complexity of current features. Expanding system boundaries, tighter interconnections of functional elements, increasingly complex algorithms and an ever growing operational domain generate a multitude of different scenarios that require consideration during specification, design, implementation...
Object tracking configuration is a tedious task for users due to an overwhelming amount of parameters while solving a multicriterial optimisation problem for a black box. With increasing complexity of the algorithms and fast changing situations due to the upcoming fourth industrial revolution, even experts will find themselves struggling with this topic. For this reason we present a concept for an...
Attack graphs constitute a powerful security tool aimed at modelling the many ways in which an attacker may compromise different assets in a network. Despite their usefulness in several security-related activities (e.g. hardening, monitoring, forensics), the complexity of these graphs can massively grow as the network becomes denser and larger, thus defying their practical usability. In this presentation,...
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.