A Seifert matrix is a square integral matrix V satisfying det(V − V T ) = ±1. To such a matrix and unit complex number ω there is a signature, σω(V ) = sign((1 − ω)V + (1 − ω̄)V T ). Let S denote the set of unit complex numbers with positive imaginary part. We show {σω}ω∈S is linearly independent, viewed as a set of functions on the set of all Seifert matrices. If V is metabolic, then σω(V ) = 0...

A Seifert matrix is a square integral matrix V satisfying det(V − V T ) = ±1. To such a matrix and unit complex number ω there is a signature, σω(V ) = sign((1 − ω)V + (1 − ω̄)V T ). Let S denote the set of unit complex numbers with positive imaginary part. We show {σω}ω∈S is linearly independent, viewed as a set of functions on the set of all Seifert matrices. If V is metabolic, then σω(V ) = 0...

Limnimeter and Rain Gauge FDI in Sewer Networks 1 using an Interval Parity Equations based Detection Approach 2 and an Enhanced Isolation Scheme 3 4 Vicenç Puig, Joaquim Blesa 5  6 Advanced Control Systems Group (SAC), Institute of Robotics and Industrial Informatics (IRI-CSIC) ,Universitat 7 Politècnica de Catalunya (UPC), Pau Gargallo, 5 ,08028 Barcelona, Spain 8 (e-mail: [email protected]...

In this paper, we describe a new method to identify the writer of handwritten documents. There are many methods for signature verification or writer identification, but most of them require segmentation or connected component analysis. They are the kinds of content dependent identification methods as signature verification requires the writer to write the same text (e.g. his name). In our new m...

This paper proposes trial algorithms for some basic components in cryptography and lossless bit compression. The symmetric encryption is accomplished by mixing up randomizations and scrambling with hashing of the key playing an essential role. The digital signature is adapted from the Hill cipher with the verification key matrices incorporating un-invertible parts to hide the signature matrix. ...

The precise nature of the relationship between language and thought is an intriguing and challenging area of inquiry for scientists across many disciplines. In the realm of neuropsychology, research has investigated the inter-dependence of language and thought by testing individuals with compromised language abilities and observing whether performance in other cognitive domains is diminished. O...

Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the formalization of lattice-based programmable hash function (PHF), and give two types of constructions by using several techniques such as a novel combination of cover-free sets and lattice trapdoors. Under the Inhomogeneous Small Integer Solution (ISIS) assumption, we show that any (non-trivial) l...

The extraction of a clear and simple footprint of the structure of large, weighted and directed networks is a general problem that has relevance for many applications. An important example is seen in origin-destination matrices, which contain the complete information on commuting flows, but are difficult to analyze and compare. We propose here a versatile method, which extracts a coarse-grained...

Digital signature schemes are used for the authentication and verification of signatures. The Courtois–Finiasz–Sendrier (CFS) digital is a well-known code-based scheme based on Niederreiter cryptosystem. However, it not widely due to computation time signing algorithm. Most This paper proposes new that McEliece Key generation, signing, algorithms presented. key generation algorithm constructs p...

This paper studies the device activity detection problem in a multi-cell massive multiple-input multiple-output (MIMO) system, which active devices transmit signature sequences to multiple base stations (BSs) that are connected central unit (CU), and BSs cooperate across cells detect based on sample covariance matrices at BSs. demonstrates importance of exploiting knowledge channel large-scale ...