13,976 results
Search Results
2. An Optimal Clustering Approach Applying to Asynchronous Finite-State Machine Design
- Author
-
Bychko, Volodymyr A., Yershov, Roman D., Bryukhovetsky, Vasyl V., Bychko, Kyrylo V., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Kazymyr, Volodymyr, editor, Morozov, Anatoliy, editor, Palagin, Alexander, editor, Shkarlet, Serhiy, editor, Stoianov, Nikolai, editor, Vinnikov, Dmitri, editor, and Zheleznyak, Mark, editor
- Published
- 2024
- Full Text
- View/download PDF
3. Machine Printed Page Number Anomaly Detection Method Based on Multi-scale Self Attention Encoding Decoding
- Author
-
Shao, Xiangchao, Xiao, Xueli, Leng, Yingxiong, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Prates, Raquel Oliveira, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Jin, Hai, editor, Pan, Yi, editor, and Lu, Jianfeng, editor
- Published
- 2024
- Full Text
- View/download PDF
4. The Random Fault Model
- Author
-
Dhooghe, Siemen, Nikova, Svetla, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Carlet, Claude, editor, Mandal, Kalikinkar, editor, and Rijmen, Vincent, editor
- Published
- 2024
- Full Text
- View/download PDF
5. Complex Contourlet Transform Domain Based Image Compression
- Author
-
Saranya, G., Shrinidhi, G. S., Bargavi, S., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Nagar, Atulya K., editor, Jat, Dharm Singh, editor, Marín-Raventós, Gabriela, editor, and Mishra, Durgesh Kumar, editor
- Published
- 2022
- Full Text
- View/download PDF
6. Process Mining Encoding via Meta-learning for an Enhanced Anomaly Detection
- Author
-
Tavares, Gabriel Marques, Junior, Sylvio Barbon, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Prates, Raquel Oliveira, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Bellatreche, Ladjel, editor, Dumas, Marlon, editor, Karras, Panagiotis, editor, Matulevičius, Raimundas, editor, Awad, Ahmed, editor, Weidlich, Matthias, editor, Ivanović, Mirjana, editor, and Hartig, Olaf, editor
- Published
- 2021
- Full Text
- View/download PDF
7. Neural-like Real-Time Data Protection and Transmission System
- Author
-
Tsmots, Ivan, Rabyk, Vasyl, Skorokhoda, Oleksa, Tsymbal, Yurii, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Shakhovska, Natalya, editor, and Medykovskyy, Mykola O., editor
- Published
- 2021
- Full Text
- View/download PDF
8. Early Detection of Autism Spectrum Disorder in Children Using Supervised Machine Learning
- Author
-
Vakadkar, Kaushik, Purkayastha, Diya, Krishnan, Deepa, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Kotenko, Igor, Editorial Board Member, Prates, Raquel Oliveira, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Singh, Mayank, editor, Gupta, P. K., editor, Tyagi, Vipin, editor, Flusser, Jan, editor, Ören, Tuncer, editor, and Valentino, Gianluca, editor
- Published
- 2020
- Full Text
- View/download PDF
9. A New Encoding Method for Graph Clustering Problem
- Author
-
Tabrizi, Amir Hossein Farajpour, Izadkhah, Habib, Barbosa, Simone Diniz Junqueira, Editorial Board Member, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Kotenko, Igor, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Grandinetti, Lucio, editor, Mirtaheri, Seyedeh Leili, editor, and Shahbazian, Reza, editor
- Published
- 2019
- Full Text
- View/download PDF
10. Reference Values Based Hardening for Bloom Filters Based Privacy-Preserving Record Linkage
- Author
-
Vaiwsri, Sirintra, Ranbaduge, Thilina, Christen, Peter, Barbosa, Simone Diniz Junqueira, Editorial Board Member, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Kotenko, Igor, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Sivalingam, Krishna M., Founding Editor, Washio, Takashi, Founding Editor, Yuan, Junsong, Founding Editor, Islam, Rafiqul, editor, Koh, Yun Sing, editor, Zhao, Yanchang, editor, Warwick, Graco, editor, Stirling, David, editor, Li, Chang-Tsun, editor, and Islam, Zahidul, editor
- Published
- 2019
- Full Text
- View/download PDF
11. A Method of Encoding Coordinates on the Paper for Digitizing Handwriting.
- Author
-
Qingcheng Li, Guangming Zheng, Ye Lu, and Heng Cao
- Subjects
PAPER ,WRITING ,ENCODING ,DECODERS & decoding ,CIPHERS - Abstract
We have been using paper for more than a thousand years and we are so accustomed to using it. However, digital information is easy to share and manage. It is necessary to digitize the handwriting. This article proposes a method of encoding coordinates on a twodimensional page for digitizing hand-writing, combining Anoto encoding and nCode encoding. The coding scheme is calibrated based on coordinate relation, and the feasibility of the scheme is verified through experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
12. Multi-party (Leveled) Homomorphic Encryption on Identity-Based and Attribute-Based Settings
- Author
-
Kuchta, Veronika, Sharma, Gaurav, Sahu, Rajeev Anand, Markowitch, Olivier, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Kim, Howon, editor, and Kim, Dong-Chan, editor
- Published
- 2018
- Full Text
- View/download PDF
13. (Finite) Field Work: Choosing the Best Encoding of Numbers for FHE Computation
- Author
-
Jäschke, Angela, Armknecht, Frederik, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Capkun, Srdjan, editor, and Chow, Sherman S. M., editor
- Published
- 2018
- Full Text
- View/download PDF
14. An Entropy Based Encrypted Traffic Classifier
- Author
-
Mamun, Mohammad Saiful Islam, Ghorbani, Ali A., Stakhanova, Natalia, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Qing, Sihan, editor, Okamoto, Eiji, editor, Kim, Kwangjo, editor, and Liu, Dongmei, editor
- Published
- 2016
- Full Text
- View/download PDF
15. Power Reduction by Integrated Within_Clock_Power Gating and Power Gating (WCPG_in_PG)
- Author
-
Nath, Debanjali, Choudhury, Priyanka, Pradhan, Sambhu Nath, Gaur, Manoj Singh, editor, Zwolinski, Mark, editor, Laxmi, Vijay, editor, Boolchandani, Dharmendra, editor, Sing, Virendra, editor, and Sing, Adit D., editor
- Published
- 2013
- Full Text
- View/download PDF
16. Frugal Encoding in Reversible : A Case Study for Quicksort
- Author
-
Early, Diarmuid, Gao, Ang, Schellekens, Michel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Glück, Robert, editor, and Yokoyama, Tetsuo, editor
- Published
- 2013
- Full Text
- View/download PDF
17. Torn-Paper Coding.
- Author
-
Shomorony, Ilan and Vahid, Alireza
- Subjects
- *
SEQUENTIAL analysis , *DATA warehousing - Abstract
We consider the problem of communicating over a channel that randomly “tears” the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\mathrm{ Geometric}}(p_{n})$ , we characterize the capacity as $C = e^{-\alpha }$ , where $\alpha = \lim _{n\to \infty } p_{n} \log n$. Our results show that the case of ${\mathrm{ Geometric}}(p_{n})$ -length fragments and the case of deterministic length- $(1/p_{n})$ fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
18. Paper Bodies: Data and Embodiment in the Sisterhood of Slade's Commonplace Books.
- Author
-
Hess, Jillian M.
- Subjects
- *
COMMONPLACE-books , *ROMANTICISM , *ENCODING , *PARATEXT , *ARCHIVES - Abstract
The article introduces a small bit of data for Romanticists' consideration, a collection of seventeen commonplace books kept from 1814 to 1817. It explores how Mary and Sarah Leigh and their cousin Maria Leigh used their commonplace books as archives of shared intimacy. The strategies the Leigh sisters used to encode embodied data include linking immaterial ideas with the materiality of the notebook and paratext that teaches how to read the verse in the context of the sisters' lived experience.
- Published
- 2022
- Full Text
- View/download PDF
19. Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues
- Author
-
Chroni, Maria, Fylakis, Angelos, Nikolopoulos, Stavros D., van der Aalst, Wil, Series editor, Mylopoulos, John, Series editor, Rosemann, Michael, Series editor, Shaw, Michael J., Series editor, Szyperski, Clemens, Series editor, Krempels, Karl-Heinz, editor, and Stocker, Alexander, editor
- Published
- 2014
- Full Text
- View/download PDF
20. Corpus Academicum Lithuanicum: Design Criteria, Methodology, Application
- Author
-
Usoniene, Aurelija, Butenas, Linas, Ryvityte, Birute, Sinkuniene, Jolanta, Jasionyte, Erika, Juozapavicius, Algimantas, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, and Vetulani, Zygmunt, editor
- Published
- 2011
- Full Text
- View/download PDF
21. Compression in Molecular Simulation Datasets
- Author
-
Kumar, Anand, Zhu, Xingquan, Tu, Yi-Cheng, Pandit, Sagar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sun, Changyin, editor, Fang, Fang, editor, Zhou, Zhi-Hua, editor, Yang, Wankou, editor, and Liu, Zhi-Yong, editor
- Published
- 2013
- Full Text
- View/download PDF
22. An Improved DNA Computing Method for Elevator Scheduling Problem
- Author
-
Zhao, Hong-Chao, Liu, Xi-Yu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Zu, Qiaohong, editor, Hu, Bo, editor, and Elçi, Atilla, editor
- Published
- 2013
- Full Text
- View/download PDF
23. Data Encoding for SDL in ITU-T Rec. Z.104
- Author
-
Reed, Rick, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Amyot, Daniel, editor, and Williams, Alan W., editor
- Published
- 2005
- Full Text
- View/download PDF
24. On the Expressiveness of the π-Calculus and the Mobile Ambients
- Author
-
Brodo, Linda, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Johnson, Michael, editor, and Pavlovic, Dusko, editor
- Published
- 2011
- Full Text
- View/download PDF
25. Exploiting Aligned Parallel Corpora in Multilingual Studies and Applications
- Author
-
Tufiş, Dan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ishida, Toru, editor, Fussell, Susan R., editor, and Vossen, Piek T. J. M., editor
- Published
- 2007
- Full Text
- View/download PDF
26. A commentary on the NIMA paper by J. Brennan et al. on the demonstration of two-dimensional time encoded imaging of fast neutrons.
- Author
-
Wehe, David
- Subjects
- *
FAST neutrons , *ENCODING , *ARMS control - Published
- 2024
- Full Text
- View/download PDF
27. On the Capacity of the Carbon Copy onto Dirty Paper Channel.
- Author
-
Rini, Stefano and Shamai Shitz, Shlomo
- Subjects
- *
RADIO transmitter fading , *TRANSMITTERS (Communication) , *QUASISTATIC processes , *RANDOM noise theory , *ENCODING - Abstract
The “carbon copy onto dirty paper” (CCDP) channel is the compound “writing on dirty paper” channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected among a set possible realizations. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which sequence is selected to produce the channel output. We study the capacity of the CCDP channel for two scenarios: 1) the state sequences are independent and identically distributed; and 2) the state sequences are scaled versions of the same sequence. In the first scenario, we show that a combination of superposition coding, time-sharing, and Gel’fand-Pinsker binning is sufficient to approach the capacity to within 3 bits per channel use for any number of possible state realizations. In the second scenario, we derive capacity to within 4 bits per channel use for the case of two possible state sequences. This result is extended to the CCDP channel with any number of possible state sequences under certain conditions on the scaling parameters, which we denote as “strong fading” regime. We conclude by providing some remarks on the capacity of the CCDP channel in which the state sequences have any jointly Gaussian distribution. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
28. Proper multi-layer coding in fading dirty-paper channel.
- Author
-
Hoseini, Sayed Ali Khodam and Akhlaghi, Soroush
- Subjects
- *
CHANNEL coding , *RADIO transmitter fading , *ADDITIVE white Gaussian noise channels , *RADIO transmitters & transmission , *ENCODING - Abstract
This study investigates multi-layer coding over a dirty-paper channel. First, it is demonstrated that superposition coding in such channel still achieves the capacity of interference-free additive white Gaussian noise channel when the transmitter is non-causally aware of interference signal. Then, the problem is extended to the dirty-paper block fading channel, where it is shown that in the lack of channel information at the transmitter, the so-called broadcast approach maximises the average achievable rate of such channel. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
29. Ergodic Fading MIMO Dirty Paper and Broadcast Channels: Capacity Bounds and Lattice Strategies.
- Author
-
Hindy, Ahmed and Nosratinia, Aria
- Abstract
A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process, and the fading channel state is known at the receiver. This represents settings where signal and interference sources are co-located, such as in the broadcast channel. First, a variant of Costa’s dirty paper coding is presented, whose achievable rates are within a constant gap to capacity for all signal and dirt powers. In addition, a lattice coding and decoding scheme is proposed, whose decision regions are independent of the channel realizations. Under Rayleigh fading, the gap to capacity of the lattice coding scheme vanishes with the number of receive antennas, even at finite Signal-to-Noise Ratio (SNR). Thus, although the capacity of the fading dirty paper channel remains unknown, this paper shows it is not far from its dirt-free counterpart. The insights from the dirty paper channel directly lead to transmission strategies for the two-user MIMO broadcast channel, where the transmitter emits a superposition of desired and undesired (dirt) signals with respect to each receiver. The performance of the lattice coding scheme is analyzed under different fading dynamics for the two users, showing that high-dimensional lattices achieve rates close to capacity. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
30. Dirty-Paper Coding Based Secure Transmission for Multiuser Downlink in Cellular Communication Systems.
- Author
-
Wang, Bo and Mu, Pengcheng
- Subjects
- *
MULTIUSER channels , *LINEAR network coding , *WIRELESS communications , *BROADCAST channels , *COVARIANCE matrices , *PROBABILITY theory - Abstract
This paper studies the secure transmission in a multiuser broadcast channel where only the statistical channel state information of the eavesdropper is available. We propose to apply secret dirty-paper coding (S-DPC) in this scenario to support the secure transmission of one user and the normal (unclassified) transmission of the other users. By adopting the S-DPC and encoding the secret message in the first place, all the information-bearing signals of the normal transmission are treated as noise by potential eavesdroppers and thus provide secrecy for the secure transmission. In this way, the proposed approach exploits the intrinsic secrecy of multiuser broadcasting and can serve as an energy-efficient alternative to the traditional artificial noise (AN) scheme. To evaluate the secrecy performance of this approach and compare it with the AN scheme, we propose two S-DPC-based secure transmission schemes for maximizing the secrecy rate under constraints on the secrecy outage probability (SOP) and the normal transmission rates. The first scheme directly optimizes the covariance matrices of the transmit signals, and a novel approximation of the intractable SOP constraint is derived to facilitate the optimization. The second scheme combines zero-forcing dirty-paper coding and AN, and the optimization involves only power allocation. We establish efficient numerical algorithms to solve the optimization problems for both schemes. Theoretical and simulation results confirm that, in addition to supporting the normal transmission, the achievable secrecy rates of the proposed schemes can be close to that of the traditional AN scheme, which supports only the secure transmission of one user. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
31. Text/Conference Paper
- Author
-
Cayoglu, Ugur, Tristram, Frank, Meyer, Jörg, Kerzenmacher, Tobias, Braesicke, Peter, and Streit, Achim
- Subjects
Data_CODINGANDINFORMATIONTHEORY ,compression algorithms ,meteorology ,prediction-based compression ,encoding ,information spaces - Abstract
One of the scientific communities that generate the largest amounts of data today are the climate sciences. New climate models enable model integrations at unprecedented resolution, simulating timescales from decades to centuries of climate change. Nowadays, limited storage space and ever increasing model output is a big challenge. For this reason, we look at lossless compression using prediction-based data compression. We show that there is a significant dependence of the compression rate on the chosen traversal method and the underlying data model. We examine the influence of this structural dependency on prediction-based compression algorithms and explore possibilities to improve compression rates. We introduce the concept of Information Spaces (IS), which help to improve the accuracy of predictions by nearly 10% and decrease the standard deviation of the compression results by 20% on average.
- Published
- 2019
- Full Text
- View/download PDF
32. Dirty Paper Coding Based on Polar Codes and Probabilistic Shaping.
- Author
-
Sener, M. Yusuf, Bohnke, Ronald, Xu, Wen, and Kramer, Gerhard
- Abstract
A precoding technique based on polar codes and probabilistic shaping is introduced for dirty paper coding. Two variants of the precoding use multi-level shaping and sign-bit shaping in one dimension. The decoder uses multi-stage successive-cancellation list decoding with list-passing across the bit levels. The approach achieves approximately the same frame error rates as polar codes with multi-level shaping over standard additive white Gaussian noise channels at a block length of 256 symbols and with different amplitude shift keying (ASK) constellations. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. A Review of Affective Computing Research Based on Function-Component-Representation Framework.
- Author
-
Ma, Haiwei and Yarosh, Svetlana
- Abstract
Affective computing (AC), a field that bridges the gap between human affect and computational technology, has witnessed remarkable technical advancement. However, theoretical underpinnings of affective computing are rarely discussed and reviewed. This paper provides a thorough conceptual analysis of the literature to understand theoretical questions essential to affective computing and current answers. Inspired by emotion theories, we proposed the function-component-representation (FCR) framework to organize different conceptions of affect along three dimensions that each address an important question: function of affect (why compute affect), component of affect (how to compute affect), and representation of affect (what affect to compute). We coded each paper by its underlying conception of affect and found preferences towards affect detection, behavioral component, and categorical representation. We also observed coupling of certain conceptions. For example, papers using the behavioral component tend to adopt the categorical representation, whereas papers using the physiological component tend to adopt the dimensional representation. The FCR framework is not only the first attempt to organize different theoretical perspectives in a systematic and quantitative way, but also a blueprint to help conceptualize an AC project and pinpoint new possibilities. Future work may explore how the identified frequencies of FCR framework combinations may be applied in practice. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
34. Secret Writing on Dirty Paper: A Deterministic View.
- Author
-
El-Halabi, Mustafa, Liu, Tie, Georghiades, Costas N., and Shamai, Shlomo
- Subjects
- *
CRYPTOGRAPHY , *INTERFERENCE channels (Telecommunications) , *CODING theory , *INFORMATION theory , *COMPUTER network security , *MATHEMATICAL models , *VECTOR analysis , *GAUSSIAN processes - Abstract
Recently, there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as “secret writing on dirty paper”) to within half a bit. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
35. On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding.
- Author
-
Scarlett, Jonathan
- Subjects
- *
ERROR probability , *GAUSSIAN channels , *RANDOM noise theory , *DISPERSIVE channels (Telecommunication) , *CHANNEL coding - Abstract
This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the empirical distribution of the state sequence. For error probabilities less than 0.5, it is shown that the second-order rate improves on an existing one based on independent and identically distributed random coding. In the Gaussian case (dirty paper coding) with an almost-sure power constraint, an achievability result is obtained using random coding over the surface of a sphere, and using a small fraction of the block to transmit a quantized description of the state power. It is shown that the second-order asymptotics are identical to the single-user Gaussian channel of the same input power without a state. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
36. Design of Chipless RFID Tags Printed on Paper by Flexography.
- Author
-
Vena, Arnaud, Perret, Etienne, Tedjini, Smail, Eymin Petot Tourtollet, Guy, Delattre, Anastasia, Garet, Frederic, and Boutant, Yann
- Subjects
- *
RADIO frequency identification systems , *FLEXOGRAPHY , *ULTRA-wideband antennas , *PRINTING , *COMPUTER printers - Abstract
In this paper, we demonstrate for the first time that a 19-bit chipless tag based on a paper substrate can be realized using the flexography technique, which is an industrial high-speed printing process. The chipless tag is able to operate within the ultra-wide band (UWB) and has a reasonable size (7\times 3 cm^2) compared to state-of-the-art versions. Thus, it is possible to use this design for various identification applications that require a low unit cost of tags. Both the simulation and measurement results are shown, and performance comparisons are provided between several realization processes, such as classical chemical etching, flexography printing, and catalyst inkjet printing. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
37. Channel Capacity Analysis for Dirty Paper Coding With the Binary Codeword and Interference.
- Author
-
Xu, Zhengguang and Xie, Yongbiao
- Abstract
Dirty paper coding is an interference pre-cancellation method for known interference at the transmitter and serves as a basic building block in the digital watermarking system. In this letter, we investigate the dirty paper model in the simplest digital communication system, where both the codeword and the interference are binary. For watermark embedment, we derive the relevant coding, the constant coding, and the symmetric relevant coding when the encoder focuses on the binary codeword and interference. The channel capacity is analyzed and the optimal parameter is discussed in the case. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
38. Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing.
- Author
-
Bross, Shraga I., Lapidoth, Amos, and Wigger, Michèle
- Subjects
- *
GAUSSIAN processes , *TRANSMITTERS (Communication) , *RANDOM noise theory , *CODE division multiple access , *CODING theory , *SIGNAL processing , *BIT error rate - Abstract
We derive the capacity region of the two-user dirty-paper Gaussian multiaccess channel (MAC) with conferencing encoders. In this MAC, prior to each transmission block, the transmitters can hold a conference in which they can communicate with each other over error-free bit pipes of given capacities. The received signal suffers not only from additive Gaussian noise but also from additive interference, which is known noncausally to the transmitters but not to the receiver. The additive interference is modeled as Gaussian or uniform over a sphere. We show that the interference can be perfectly mitigated, i.e., that the capacity region without interference can also be achieved in its presence. This holds irrespective of whether the transmitters learn the interference before or after the conference. It follows as a corollary that also for the MAC with degraded message sets, the interference can be perfectly mitigated if it is known noncausally to the transmitters. To derive our results, we generalize Costa's single-user writing-on-dirty-paper achievability result to channels with dependent interference and not-necessarily Gaussian noise. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
39. Writing on Fading Paper, Dirty Tape With Little Ink: Wideband Limits for Causal Transmitter CSI.
- Author
-
Borade, Shashi and Zheng, Lizhong
- Subjects
- *
TRANSMITTERS (Communication) , *BROADBAND communication systems , *INTERFERENCE channels (Telecommunications) , *INDUSTRIAL costs , *BANDWIDTHS - Abstract
A wideband Rayleigh fading channel is considered with causal channel state information (CSI) at the transmitter and no receiver CSI. A simple orthogonal code with energy detection rule at the receiver (similar to pulse position modulation in IEEE Trans. Inf. Theory, vol. 46, no. 4, Apr. 2000 and IEEE Trans. Inf. Theory, vol. 52 no. 5, May 2006) is shown to achieve the capacity of this channel in the wideband limit. This strategy transmits energy only when the channel gain exceeds a threshold, hence only needs causal transmitter CSI. In the wideband limit, this capacity without any receiver CSI is the same as the capacity with full receiver CSI, which is proportional to the logarithm of the bandwidth. Similar threshold-based pulse position modulation is shown to achieve the capacity per unit cost of the dirty-tape channel (dirty paper channel with causal transmitter CSI and no receiver CSI), which equals its capacity per unit cost with full receiver CSI. Then, a general discrete channel with i.i.d. states is considered. Each input has an associated cost and a zero cost input “0” exists. The channel state is assumed to be known at the transmitter in a causal manner. Capacity per unit cost is found for this channel and a simple orthogonal code is shown to achieve this capacity. Later, a novel orthogonal coding scheme is proposed for the case of causal transmitter CSI and a condition for equivalence of capacity per unit cost for causal and noncausal transmitter CSI is derived. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
40. Enhancing LS-PIE's Optimal Latent Dimensional Identification: Latent Expansion and Latent Condensation.
- Author
-
Stevens, Jesse, Wilke, Daniel N., and Setshedi, Isaac I.
- Subjects
SINGULAR value decomposition ,COMPACT spaces (Topology) ,LATENT variables ,PRINCIPAL components analysis ,CONDENSATION - Abstract
The Latent Space Perspicacity and Interpretation Enhancement (LS-PIE) framework enhances dimensionality reduction methods for linear latent variable models (LVMs). This paper extends LS-PIE by introducing an optimal latent discovery strategy to automate identifying optimal latent dimensions and projections based on user-defined metrics. The latent condensing (LCON) method clusters and condenses an extensive latent space into a compact form. A new approach, latent expansion (LEXP), incrementally increases latent dimensions using a linear LVM to find an optimal compact space. This study compares these methods across multiple datasets, including a simple toy problem, mixed signals, ECG data, and simulated vibrational data. LEXP can accelerate the discovery of optimal latent spaces and may yield different compact spaces from LCON, depending on the LVM. This paper highlights the LS-PIE algorithm's applications and compares LCON and LEXP in organising, ranking, and scoring latent components akin to principal component analysis or singular value decomposition. This paper shows clear improvements in the interpretability of the resulting latent representations allowing for clearer and more focused analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. The Distortions Region of Broadcasting Correlated Gaussians and Asymmetric Data Transmission Over a Gaussian BC.
- Author
-
Bross, Shraga I.
- Subjects
DATA transmission systems ,DIGITAL communications ,GAUSSIAN channels ,BROADCAST channels ,ELECTRONIC paper ,VIDEO coding ,DIGITAL video broadcasting - Abstract
A memoryless bivariate Gaussian source is transmitted to a pair of receivers over an average-power limited bandwidth-matched Gaussian broadcast channel. Based on their observations, Receiver 1 reconstructs the first source component while Receiver 2 reconstructs the second source component both seeking to minimize the expected squared-error distortions. In addition to the source transmission digital information at a specified rate should be conveyed reliably to Receiver 1–the “stronger” receiver. Given the message rate we characterize the achievable distortions region. Specifically, there is an ${\sf SNR}$ -threshold below which Dirty Paper coding of the digital information against a linear combination of the source components is optimal. The threshold is a function of the digital information rate, the source correlation and the distortion at the “stronger” receiver. Above this threshold a Dirty Paper coding extension of the Tian-Diggavi-Shamai hybrid scheme is shown to be optimal. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
42. Light drive reversible color switching for rewritable media and encoding.
- Author
-
Ren, Qiaoli, Aodeng, Gerile, Ga, Lu, and Ai, Jun
- Subjects
- *
ELECTRONIC paper , *REDUCING agents , *CATALYSTS , *ENCODING , *INDUSTRIAL costs , *COLOR - Abstract
[Display omitted] • Photoreversible color switching systems have been integrated by reducing agent of triethanolamine, catalyst of β-FeOOH nanorods. • With high switching rate, high reversibility (>10 cycle), the new system could be broad use in rewritable paper. • The rewritable paper is highly applicable as self-erasing rewritable media for printing. • The rewritable paper can be applied for a data encoding and reading strategy. Nowadays, photo reversible color switching systems (PCSS) are always limited by some requirements, such as good stability, low toxicity, fast light response, long cycling performance and low production cost, therefore, it is a huge challenge to develop such a system that integrates beneficial features. Herein, a new type of PCSS have been demonstrated, which integrated reducing agent of triethanolamine (TEOA), catalyst of β-FeOOH nanorods and the redox driven color conversion characteristics of redox dyes. The system has the advantages of high switching rate, high reversibility (>10 cycles), wavelength selective response, safety and less light damage, which can be widely used in rewritable paper. As-prepared rewritable paper has high contrast, high resolution, suitable printing time and good reversibility, which is in line with the environmental protection concept of green printing. Rewritable paper is a kind of self-erasable rewritable medium which is highly suitable for printing. Environmental protection film has the advantages of low cost, convenient preparation and recycling. It is expected to replace the traditional writing, printing paper, existing systems and make a big step forward to practical application. Even more surprising, it also can be applied for a data encoding and reading strategy. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
43. Near-Field Chipless-RFID System With Erasable/Programmable 40-bit Tags Inkjet Printed on Paper Substrates.
- Author
-
Herrojo, Cristian, Mata-Contreras, Javier, Paredes, Ferran, Nunez, Alba, Ramon, Eloi, and Martin, Ferran
- Abstract
In this letter, a chipless radio frequency identification (chipless-RFID) system with erasable/programmable 40-bit tags inkjet printed on paper substrates, where tag reading proceeds sequentially through near-field coupling, is presented for the first time. The tags consist of a linear chain of identical split ring resonators (SRRs) printed at predefined and equidistant positions on a paper substrate, and each resonant element provides a bit of information. Tag programming is achieved by cutting certain resonant elements, providing the logic state “0” to the corresponding bit. Conversely, tags can be erased (all bits set to “1”) by short circuiting those previously cut resonant elements through inkjet. An important feature of the proposed system is the fact that tag reading is possible either with the SRR chain faced up or faced down (with regard to the reader). To this end, two pairs of header bits (resonators), with different sequences, have been added at the beginning and at the end of the tag identification chain. Moreover, tag data storage capacity (number of bits) is only limited by the space occupied by the linear chain. The implementation of tags on paper substrates demonstrates the potential of the proposed chipless-RFID system in secure paper applications, where the necessary proximity between the reader and the tag, inherent to near-field reading, is not an issue. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
44. Using Procedural Scaffoldings to Enhance Group Discourse Levels in a Paper-plus-smartphone Learning Context.
- Author
-
Huang, Hui-Wen, Wu, Chih-Wei, and Chen, Nian-Shing
- Abstract
The purpose of this study was to evaluate the effectiveness of using procedural scaffoldings to enhance group discourse levels in a paper-plus-smart phone learning context. Sixty undergraduate and graduate students enrolled at a four-year university in southern Taiwan participated in this experimental study. All participants used built-in camera smart phones to learn new knowledge by scanning QR codes embedded in paper-based learning materials in this study. The researchers applied content analyses and a chi-square test to answer the research question. The findings indicated that participants in the experimental group expanded higher-order discourse levels than their counterparts in the control group. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
45. Generic techniques to improve SVC enhancement layer encoding: digest of technical papers
- Author
-
Rik Van de Walle, Rosario Garrido-Cantos, Pedro Cuenca, Glenn Van Wallendael, Sebastiaan Van Leuven, José Luis Martínez, and Jan De Cock
- Subjects
Technology and Engineering ,Computer science ,Real-time computing ,scalable video coding ,SVC enhancement layer encoding ,encoding ,Scalable Video Coding ,video coding ,Computer engineering ,Video encoding ,generic technique ,Encoding (memory) ,encoded bitstream ,Layer (object-oriented design) ,Bitstream - Abstract
Scalable video coding is an important mechanism to provide different types of end-user devices with different versions of the same encoded bitstream. However, scalable video encoding remains a computationally expensive operation. To decrease the complexity we propose generic techniques. These techniques can also be combined with existing fast mode decision modes. We show that extending these existing techniques yield an average complexity reduction of 87%.
- Published
- 2011
46. HME-KG: A method of constructing the human motion encoding knowledge graph based on a hierarchical motion model.
- Author
-
Liu, Qi, Huang, Tianyu, and Li, Xiangchen
- Subjects
KNOWLEDGE graphs ,MOTION capture (Human mechanics) ,POSTURE ,ENCODING ,VISUALIZATION - Abstract
The diversity, infinity, and nonuniform description of human motion make it challenging for computers to understand human activities. To explore and reuse captured human motion data, this work defines a more comprehensive hierarchical theoretical model of human motion and proposes a standard human posture encoding scheme. We construct a domain knowledge graph (DKG) named the human motion encoding knowledge graph (HME-KG) based on posture codes and action labels. Community detection, similarity analysis, and centrality analysis are used to explore the potential value of motion data. This paper conducts an evaluation and visualization of HME-KG. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Han–Kobayashi and Dirty-Paper Coding for Superchannel Optical Communications.
- Author
-
Koike-Akino, Toshiaki, Kojima, Keisuke, Millar, David S., Parsons, Kieran, Kametani, Soichiro, Sugihara, Takashi, Yoshida, Tsuyoshi, Ishida, Kazuyuki, Miyata, Yoshikuni, Matsumoto, Wataru, and Mizuochi, Takashi
- Abstract
Superchannel transmission is a candidate to realize Tb/s-class high-speed optical communications. In order to achieve higher spectrum efficiency, the channel spacing shall be as narrow as possible. However, densely allocated channels can cause non-negligible inter-channel interference (ICI) especially when the channel spacing is close to or below the Nyquist bandwidth. In this paper, we consider joint decoding to cancel the ICI in dense superchannel transmission. To further improve the spectrum efficiency, we propose the use of Han–Kobayashi superposition coding. In addition, for the case when neighboring subchannel transmitters can share data, we introduce dirty-paper coding for pre-cancelation of the ICI. We analytically evaluate the potential gains of these methods when ICI is present for sub-Nyquist channel spacing. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
48. Generalization and Analysis of the Paper Folding Method for Steganography.
- Author
-
Zhang, Weiming, Liu, Jiufen, Wang, Xin, and Yu, Nenghai
- Abstract
Wet paper codes (WPCs) are designed for steganography, in which the sender and recipient do not need to share the changeable positions. In this paper, we propose the N-page construction for wet paper coding, which can generate a family of WPCs following the upper bound on embedding efficiency from one single WPC. The Paper Folding method, one of our previous methods, is a special case of the N-page construction with N=2^k. We deduce recursions for calculating embedding efficiency of N-page construction, and obtain explicit expression on embedding efficiency of 2^k-page construction. Furthermore, we derive the limit of distance between the embedding efficiency of 2^k-page construction and the upper bound of embedding efficiency as k tends to infinity. Based on the limit, we analyze how the embedding efficiency is influenced by the proportion of wet pixels (wet ratio) in the cover, showing that embedding efficiency only drops about 0.32 as the wet ratio increases to 0.9999. [ABSTRACT FROM PUBLISHER]
- Published
- 2010
- Full Text
- View/download PDF
49. Long Short-Term Memory-Based Non-Uniform Coding Transmission Strategy for a 360-Degree Video.
- Author
-
Guo, Jia, Li, Chengrui, Zhu, Jinqi, Li, Xiang, Gao, Qian, Chen, Yunhe, and Feng, Weijia
- Subjects
PREDICTION models ,TILES ,VIDEOS ,ALGORITHMS ,VIDEO coding ,ENCODING - Abstract
This paper studies an LSTM-based adaptive transmission method for a 360-degree video and proposes a non-uniform encoding transmission strategy based on LSTM. Our goal is to maximize the user's video experience by dynamically dividing the 360-degree video into tiles of different numbers and sizes, and selecting different bitrates for each tile. This aims to reduce buffering events and video jitter. To determine the optimal number and size of tiles at the current moment, we constructed a dual-layer stacked LSTM network model. This model predicts, in real-time, the number, size, and bitrate of the tiles needed for the next moment of the 360-degree video based on the distance between the user's eyes and the screen. In our experiments, we used an exhaustive algorithm to calculate the optimal tile division and bitrate selection scheme for a 360-degree video under different network conditions, and used this dataset to train our prediction model. Finally, by comparing with other advanced algorithms, we demonstrated the superiority of our proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. Fd-CasBGRel: A Joint Entity–Relationship Extraction Model for Aquatic Disease Domains.
- Author
-
Ye, Hongbao, Lv, Lijian, Zhou, Chengquan, and Sun, Dawei
- Subjects
KNOWLEDGE graphs ,CORPORA ,WEBSITES ,GENERALIZATION ,ENCODING - Abstract
Featured Application: The model is primarily utilized for the task of entity relationship extraction during the construction process of an aquatic disease knowledge graph. Entity–relationship extraction plays a pivotal role in the construction of domain knowledge graphs. For the aquatic disease domain, however, this relationship extraction is a formidable task because of overlapping relationships, data specialization, limited feature fusion, and imbalanced data samples, which significantly weaken the extraction's performance. To tackle these challenges, this study leverages published books and aquatic disease websites as data sources to compile a text corpus, establish datasets, and then propose the Fd-CasBGRel model specifically tailored to the aquatic disease domain. The model uses the Casrel cascading binary tagging framework to address relationship overlap; utilizes task fine-tuning for better performance on aquatic disease data; trains on specialized aquatic disease corpora to improve adaptability; and integrates the BRC feature fusion module—which incorporates self-attention mechanisms, BiLSTM, relative position encoding, and conditional layer normalization—to leverage entity position and context for enhanced fusion. Further, it replaces the traditional cross-entropy loss function with the GHM loss function to mitigate category imbalance issues. The experimental results indicate that the F1 score of the Fd-CasBGRel on the aquatic disease dataset reached 84.71%, significantly outperforming several benchmark models. This model effectively addresses the challenges of ternary extraction's low performance caused by high data specialization, insufficient feature integration, and data imbalances. The model achieved the highest F1 score of 86.52% on the overlapping relationship category dataset, demonstrating its robust capability in extracting overlapping data. Furthermore, We also conducted comparative experiments on the publicly available dataset WebNLG, and the model in this paper obtained the best performance metrics compared to the rest of the comparative models, indicating that the model has good generalization ability. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.