Data Mining Practical Machine Learning Tools and Techniques

Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian.In this paper a computational complexity theory of the “knowledge” contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity. These are the first examples of zero-knowledge proofs for languages not known to be efficiently recognizable.

/pdf/the-knowledge-complexity-of-interactive-proof-systems-31apre0ecf.pdf

The knowledge complexity of interactive proof-systems

IEEE transactions on computer-aided design of integrated circuits and systems : a publication of the IEEE Circuits and Systems Society

In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy assumption, also gradient constancy, as well as the constancy of the Hessian and the Laplacian are proposed. Since the model strictly refrains from a linearisation of these assumptions, it is also capable to deal with large displacements. For the minimisation of the rather complex energy functional, we present an efficient numerical scheme employing two nested fixed point iterations. Following a coarse-to-fine strategy it turns out that there is a theoretical foundation of so-called warping techniques hitherto justified only on an experimental basis. Since our algorithm consists of the integration of various concepts, ranging from different constancy assumptions to numerical implementation issues, a detailed account of the effect of each of these concepts is included in the experimental section. The superior performance of the proposed method shows up by significantly smaller estimation errors when compared to previous techniques. Further experiments also confirm excellent robustness under noise and insensitivity to parameter variations.

Highly accurate optic flow computation with theoretically justified warping

Recent high-level synthesis and accelerator-related architecture papers show a great disparity in workload selection. To improve standardization within the accelerator research community, we present MachSuite, a collection of 19 benchmarks for evaluating high-level synthesis tools and accelerator-centric architectures. MachSuite spans a broad application space, captures a variety of different program behaviors, and provides implementations tailored towards the needs of accelerator designers and researchers, including support for high-level synthesis. We illustrate these aspects by characterizing each benchmark along five different dimensions, highlighting trends and salient features.

MachSuite: Benchmarks for accelerator design and customized architectures

Tokens are digital, transferable and programmable assets and one of the most promising tools offered by blockchains. They could enable a wide range of applications, from down to earth to futuristic. One of the main issues in achieving wide adoption of tokens is onboarding: main platforms require users to deal with specific tools such as wallets, transaction fees, key generation and storage. The most common solution to offer a familiar experience to naive users are custodial intermediaries, which have the important drawback of centralizing the process, and keeping users away from the advantages of self-sovereign assets control. In this paper we present a process for the distribution of digital tokens to end users, exploiting “physical” objects for initial distribution. The process is aimed at making onboarding of users not yet accustomed with blockchain tools and concepts as easy as possible, in a secure and decentralized way.

A scalable decentralized system for fair token distribution and seamless users onboarding

Blockchains offer the possibility to describe and implement processes and interactions between actors through code that can be publicly inspected, and which can be executed in a transparent and guaranteed way, without resorting to the collaboration of third party guarantors.Although transparency, together with non-censorship and non-interruptibility, are characteristics that can endow unprecedented trustworthiness to the processes implemented, in many cases they risk clashing with the privacy requirements or, more specifically, with the need to control read data access.In this work we deal with a general category of processes and interactions of importance in different sectors such as procurement: auctions and tenders. If on the one hand it is important that the widest possible audience can be convinced of the correctness of a tender, on the other it is possible that some information must remain private, such as the value of the offersIn this work we present an auction / tender protocol which on the one hand publicly guarantees the fairness of the tender, and at the same time allows to keep bids private. We also present an implementation on Ethereum Virtual Machine (EVM) environments, with which we can make quantitative cost considerations.

A Protocol for On-Chain Tenders

A Caronte-oriented approach to a network-based educational infrastructure

This paper introduces Tacit Consent (TaCo), a technique that exploits spatial correlation in Wireless Sensor Networks in order to reduce energy consumption while maintaining a very high accuracy on the measured data. In fact, nodes densely deployed in a field of interest are proved to sense highly correlated data, thus this intrinsic redundancy can be exploited to predict the neighbors' measurements by defining custom estimation functions, which aim at replicating the relationship between the data sensed by two nodes. To exploit spatial correlation, TaCo splits the nodes into two groups: representative and member nodes. Representative nodes directly transmit their measurements, while member nodes use overhearing to understand whether additional information is required. If the estimation function correctly predicts the measurements of the member nodes, they tacitly consent the estimation without performing any transmission. Differently from the other state-of-the-art approaches, such as the YEAST algorithm, TaCo can be used on top of existing routing and clustering protocols. Experimental results prove that TaCo is able to drastically reduce the energy consumption of the network when a high precision of the measured data is required

Tacit Consent: A Technique to Reduce Redundant Transmissions from Spatially Correlated Nodes in Wireless Sensor Networks

The increasing complexity of modern digital devices demands for ever increasing communication requirements, and for an ever increasing heterogeneity of the target applications. Specifically, different communication domains may be implemented using the same chip area, for instance to allow multiple parallel applications to be loaded onto the device. A flexible, reliable yet performant communication infrastructure is hereby proposed, to ensure inter-domain communication and cooperation. A novel communication-centric design is proposed to easily integrate classical bus-based systems with Network-on-Chip architectures, taking directly into consideration the resource requirements of the target FPGA device.

Vincenzo Rana

Papers

A scalable decentralized system for fair token distribution and seamless users onboarding

A Protocol for On-Chain Tenders

A Caronte-oriented approach to a network-based educational infrastructure

Tacit Consent: A Technique to Reduce Redundant Transmissions from Spatially Correlated Nodes in Wireless Sensor Networks

Multiple communication-domains design in FPGA-based Systems-on-Chip