• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,389
Next 10 →

With Stochastic Binary Signals

by Mithun Chakraborty, Sanmay Das, Malik Magdon-ismail
"... We wish to learn, within error tolerance ε, an unknown value , given access only to sequential binary thresholded observations under an additive Gaussian noise model. At t = 0, 1, 2,..., we maintain a probability distribution pt(v) over V and set a threshold θt. The observation (stochastic bina ..."
Abstract - Add to MetaCart
binary signal) is xt = sign(V + zt – θt) where.

A Theory of Binary Signal

by Jean-Jaques Lesage, Jean-Marc Roussel, Christophe Thierry , 1996
"... The dynamic modelling of logical systems widely calls upon the explicit use of time and the event notion. In terms of Function Chart Grafcet or Interpreted Petri Nets for instance, events are generally represented by "rising or falling edges" of logical variables. However, numerous ambigui ..."
Abstract - Add to MetaCart
ambiguities are encountered in the models because the translation of events into edges is not formal enough. In this paper, we propose a theory of binary signal which allows us to describe the time behavior of the inputs and the outputs of any logical system. We especially describe an extended Boolean Algebra

PSEUDO-RANDOM BINARY SIGNAL

by An Extremum Hunting, Liu Wen-jiang, An Extremum, Hunting Method Using, Liu Wen-jiang, Coden Teuede, Eip-gegevens Koninklijke Bibliotheek, Den Haag, Liu Wen-jiang , 1988
"... Met lit. opg., reg. ISBN 90-6144-198-6 SISO 656.2 UDe 519.71.001.26 NUGI832 Trefw.: regelsystemen; optimalisering.- iii-A new extremum hunting method, using a correlation analysis hunting method, is proposed in this paper. A pseudo-random binary signal has been used as probe signal and the hunting d ..."
Abstract - Add to MetaCart
Met lit. opg., reg. ISBN 90-6144-198-6 SISO 656.2 UDe 519.71.001.26 NUGI832 Trefw.: regelsystemen; optimalisering.- iii-A new extremum hunting method, using a correlation analysis hunting method, is proposed in this paper. A pseudo-random binary signal has been used as probe signal and the hunting

Distributed Beamforming with Binary Signaling

by Mark Johnson
"... Abstract — We consider a distributed beamforming problem in which nodes are restricted to sending binary phases to a receiver that has access to a one-bit feedback channel. Our simplified model allows us to prove lower bounds, as well as explore algorithmic techniques and analyses. We demonstrate bo ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
Abstract — We consider a distributed beamforming problem in which nodes are restricted to sending binary phases to a receiver that has access to a one-bit feedback channel. Our simplified model allows us to prove lower bounds, as well as explore algorithmic techniques and analyses. We demonstrate

Binary Signal Compression using DCT Signs

by Hiroshi Kondo, Satoshi Kunifusa, Zhimei Yang, Takaharu Koda, Lifeng Zhang
"... Binary Signal Compression using DCT (Discrete Cosine Transform) signs is presented. This is quite new technique for signal compression. Even a random binary signal utilized in a computer is included in our aim. The presented method enables us to make more compact signal from an usual compressed and ..."
Abstract - Add to MetaCart
Binary Signal Compression using DCT (Discrete Cosine Transform) signs is presented. This is quite new technique for signal compression. Even a random binary signal utilized in a computer is included in our aim. The presented method enables us to make more compact signal from an usual compressed

Binary signals: a note on the prime

by Serban E. Vlad
"... iv ..."
Abstract - Add to MetaCart
Abstract not found

EXPERIMENTAL REALIZATION OF BINARY SIGNALS TRANSMISSION BASED ON SYNCHRONIZED LORENZ CIRCUITS

by Centro Ciencias, Aplicadas Desarrollo, Posadas Castillo, Cornelio Cruz Hernández, C. Núñez Pérez, Ricardo F, C. Posadas-castillo, C. Cruz-hernández, R. Núnez-pérez
"... Experimental realization of binary signals transmission based on synchronized lorenz circuits ..."
Abstract - Add to MetaCart
Experimental realization of binary signals transmission based on synchronized lorenz circuits

Experimental realization of binary signal transmission using chaos

by Cornelio Posadas-castillo, César Cruz-hernández, Ricardo Nuñez-pérez - J. Circ. Syst. Comput,14 , 2005
"... In this paper, an experimental study of practical realization to transmit binary signals using chaos is presented. In particular, we use a Generalized Hamiltonian systems approach to synchronize two unidirectionally coupled Lorenz circuits. Experimental results are in close accordance with the simul ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
In this paper, an experimental study of practical realization to transmit binary signals using chaos is presented. In particular, we use a Generalized Hamiltonian systems approach to synchronize two unidirectionally coupled Lorenz circuits. Experimental results are in close accordance

Maximum Correlation of Binary Signals over Fading Channels

by Fung-ling Chiu, Nam Yul Yu, Guang Gong
"... Abstract — Multiple access interference (MAI) in CDMA sys-tem is related to the correlation of the transmitted signals from multiple users. In this work, we investigate the correlations of binary signal sets over fading channels, particularly the Gold and Kasami signal sets. A lower bound on the max ..."
Abstract - Add to MetaCart
Abstract — Multiple access interference (MAI) in CDMA sys-tem is related to the correlation of the transmitted signals from multiple users. In this work, we investigate the correlations of binary signal sets over fading channels, particularly the Gold and Kasami signal sets. A lower bound

Near-optimal target learning with stochastic binary signals

by Mithun Chakraborty, Sanmay Das, Malik Magdon-ismail - In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence , 2011
"... We study learning in a noisy bisection model: specifically, Bayesian algorithms to learn a target value V given access only to noisy realizations of whether V is less than or greater than a threshold θ. At step t = 0, 1, 2,..., the learner sets threshold θt and observes a noisy realization of sign(V ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We study learning in a noisy bisection model: specifically, Bayesian algorithms to learn a target value V given access only to noisy realizations of whether V is less than or greater than a threshold θ. At step t = 0, 1, 2,..., the learner sets threshold θt and observes a noisy realization of sign(V − θt). After T steps, the goal is to output an estimate ˆ V which is within an ε-tolerance of V. This problem has been studied, predominantly in environments with a fixed error probability q < 1 2 for the noisy realization of sign(V − θt). In practice, it is often the case that q can approach 1 2, especially as θ → V, and there is little known when this happens. We give a pseudo-Bayesian algorithm which provably converges to V. When the true prior matches our algorithm’s Gaussian prior, we show near-optimal expected performance. Our methods extend to the general multiple-threshold setting where the observation noisily indicates which of k ≥ 2 regions V belongs to. 1
Next 10 →
Results 1 - 10 of 3,389
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University