Time-Tuned Photon Avalanche Upconversion in Nanoparticles for Optical Logic and Multidimensional Data Encoding

Authors: Zhang, Hui^{aff1, aff2, aff3}, Lamon, Simone^{aff2, aff3}, Weng, Tianfeng^{aff2, aff3}, Liu, Liying^aff1, Gu, Min^{aff2, aff3}, Zhang, Qiming^{aff2, aff3}

Source: ACS Photonics. 13(5):1477-1491

Availability: https://pubs.acs.org/doi/10.1021/acsphotonics.5c02834

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Authors: Zhong, Dawei, Francis, Akhil, Rrapaj, Ermal

Source: Physical Review A. 112(4)

Subject Terms: 5102 Atomic, Molecular and Optical Physics (for-2020), 51 Physical Sciences (for-2020), 34 Chemical sciences (for-2020), 49 Mathematical sciences (for-2020), 51 Physical sciences (for-2020)

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/4cf185mr
https://escholarship.org/content/qt4cf185mr/qt4cf185mr.pdf

Position-Selective MoS2 Photoresponse Dynamics for In-Sensor Encoding of Motion History

Authors: Yun, Hyuncheol, Park, Hyeonsu, Kim, Yelim, Handriani, Lia Saptini, Jeong, Daeyeop, Jang, Suhee, Park, Won Il

Source: ACS Applied Electronic Materials. 8(7):3207-3217

Availability: https://pubs.acs.org/doi/10.1021/acsaelm.6c00234

Classification of distributed binary labeling problems

Additional Titles: We present a complete classification of the deterministic distributed time complexity for a family of graph problems: binary labeling problems in trees. These are locally checkable problems that can be encoded with an alphabet of size two in the edge labeling formalism. Examples of binary labeling problems include sinkless orientation, sinkless and sourceless orientation, 2-vertex coloring, perfect matching, and the task of coloring edges red and blue such that all nodes are incident to at least one red and at least one blue edge. More generally, we can encode e.g. any cardinality constraints on indegrees and outdegrees. We study the deterministic time complexity of solving a given binary labeling problem in trees, in the usual LOCAL model of distributed computing. We show that the complexity of any such problem is in one of the following classes: $O(1)$, $Θ(\log n)$, $Θ(n)$, or unsolvable. In particular, a problem that can be represented in the binary labeling formalism cannot have time complexity $Θ(\log^* n)$, and hence we know that e.g. any encoding of maximal matchings has to use at least three labels (which is tight). Furthermore, given the description of any binary labeling problem, we can easily determine in which of the four classes it is and what is an asymptotically optimal algorithm for solving it. Hence the distributed time complexity of binary labeling problems is decidable, not only in principle, but also in practice: there is a simple and efficient algorithm that takes the description of a binary labeling problem and outputs its distributed time complexity.

Authors: Balliu, Alkida, Brandt, Sebastian, Efron, Yuval, Hirvonen, Juho, Maus, Yannic, Olivetti, Dennis, Suomela, Jukka

Index Terms: Distributed, Parallel, and Cluster Computing, Computational Complexity, text

URL: http://arxiv.org/abs/1911.13294

Beyond Binary: A 6-ary Coprime Encoding and Thompson Sampling Approach for Directional Neighbor Discovery

Authors: Liu, Qinglin, Liu, Ting, Feng, Shiting, Liang, Pengfei

Source: Proceedings of the 2026 3rd International Conference on Machine Learning, Natural Language Processing and Modeling. :341-349

Availability: http://dl.acm.org/doi/10.1145/3832928.3832982

MCBformer: A deep learning-driven multiscale time-frequency information fusion framework for short- and medium-term wind power prediction

Authors: Zhao, Xiongfeng, Liu, Haipeng ^⁎

Source: In Expert Systems With Applications 15 January 2027 333 Part E

KSC-Letter: A Deterministic Temporal Communication Architecture Based on Prime Sequence Cryptographic State Evolution

Authors: BASSO, KAUÊ

Subject Terms: Temporal Cryptography, Covert Channels, Prime Sequence Systems, Secure Communication, Information Security Architecture, Deterministic Time Encoding

Guess & Check Codes for Deletions, Insertions, and Synchronization

Additional Titles: We consider the problem of constructing codes that can correct $δ$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(δ=1)$ correcting codes, and have an asymptotically optimal redundancy. Finding similar codes for $δ\geq 2$ deletions remains an open problem. In this work, we relax the standard zero-error (i.e., worst-case) decoding requirement by assuming that the positions of the $δ$ deletions (or insertions) are independent of the codeword. Our contribution is a new family of explicit codes, that we call Guess & Check (GC) codes, that can correct with high probability up to a constant number of $δ$ deletions (or insertions). GC codes are systematic; and have deterministic polynomial time encoding and decoding algorithms. We also describe the application of GC codes to file synchronization.

Authors: Hanna, Serge Kas, Rouayheb, Salim El

Index Terms: Information Theory, text

URL: http://arxiv.org/abs/1705.09569

Guess & Check Codes for Deletions and Synchronization

Additional Titles: We consider the problem of constructing codes that can correct $δ$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes can correct all possible single deletions $(δ=1)$ with an asymptotically optimal redundancy. Finding similar codes for $δ\geq 2$ deletions is an open problem. We propose a new family of codes, that we call Guess & Check (GC) codes, that can correct, with high probability, a constant number of deletions $δ$ occurring at uniformly random positions within an arbitrary string. The GC codes are based on MDS codes and have an asymptotically optimal redundancy that is $Θ(δ\log n)$. We provide deterministic polynomial time encoding and decoding schemes for these codes. We also describe the applications of GC codes to file synchronization.

Authors: Hanna, Serge Kas, Rouayheb, Salim El

Index Terms: Information Theory, text

URL: http://arxiv.org/abs/1702.04466

A Hardware-Error-Aware Time-Domain CIM Accelerator for AdderNet with Significance-Aware Dual-Mode DTC Encoding and Shared-Clock TDC Readout.

Authors: Zhan, Aoming, Zhao, Ye, Zhou, Yumei, Qiao, Shushan

Source: Applied Sciences (2076-3417); Aug2026, Vol. 16 Issue 16, p8189, 19p

Subject Terms: Time-digital conversion, Hardware design & construction, Artificial neural networks, Computer systems

Unveiling the Stochasticity of Bank Erosion: A Hybrid Deterministic and Stochastic Modeling Approach.

Authors: Li, Zhi, Langendoen, Eddy J., García, Marcelo H.

Source: Water Resources Research; Nov2025, Vol. 61 Issue 11, p1-32, 32p

Subject Terms: Stochastic models, Fluvial geomorphology, Hydrodynamics, Environmental risk, Riparian areas, Deterministic algorithms, Erosion

Geographic Terms: Tibetan Plateau

A Distributed Storage and Indexing Framework Based on Hierarchical Space-Time Grid Encoding for Digital Cities.

Authors: Zhang, Huangchuang, Xing, Weiming, Zhang, Kai

Source: ISPRS International Journal of Geo-Information; Sep2026, Vol. 15 Issue 9, p398, 30p

Subject Terms: Digital twin, Spacetime, Nonrelational databases, Cloud storage, K-nearest neighbor classification

Capacity achieving multiwrite WOM codes

Additional Titles: In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decoding algorithms. The block length of our construction is N=(t/ε)^{O(t/(δε))} when εis the gap to capacity and encoding and decoding run in time N^{1+δ}. This is the first deterministic construction achieving these parameters. Our techniques also apply to larger alphabets.

Authors: Shpilka, Amir

Index Terms: Information Theory, Computational Complexity, text

URL: http://arxiv.org/abs/1209.1128

Probabilistic Computing With Neuromorphic Elements

Authors: Li, Z., Calvet, L.E.

Source: IEEE Journal on Exploratory Solid-State Computational Devices and Circuits IEEE J. Explor. Solid-State Comput. Devices Circuits Exploratory Solid-State Computational Devices and Circuits, IEEE Journal on. 12:167-175 2026

Deterministic Realization of Classical Dissipation on Quantum Computers

Authors: Khan, Muhammad Idrees, Author, Succi, Sauro, Author, Yao, Huadong, 1982, Author

Contributors: Khan, Muhammad Idrees, Author, Succi, Sauro, Author, Yao, Huadong, 1982, Author

Source: 3D virtuell plattform för digitalisering av holistisk akustisk miljö i kabiner av tunga fordon (OCTAVE).

File Description: electronic

Access URL: https://research.chalmers.se/publication/551889
https://research.chalmers.se/publication/551889/file/551889_Fulltext.pdf

Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time

Authors: Kammerer, Jean-Gabriel, primary, Lercier, Reynald, additional, Renault, Guénaël, additional

Source: Pairing-Based Cryptography - Pairing 2010. 2010/01/01

Access URL: https://arxiv.org/pdf/1005.1454

A Deterministic Method to Construct a Common Supercell Between Two Similar Crystalline Surfaces.

Authors: Lee, Weon‐Gyu, Lee, Jung‐Hoon

Source: Small Methods; Dec2024, Vol. 8 Issue 12, p1-10, 10p

Subject Terms: Time complexity, Deterministic algorithms, Density functional theory, Bivectors, Heterostructures

DdlRT: A deterministic data layout for efficient redundancy transitioning in erasure-coded systems

Authors: Geng, Xiaotong, Duan, Haoqi, Xu, Liangliang, Chen, Tingting, Hu, Cunchen

Source: Proceedings of the 55th International Conference on Parallel Processing. :584-594

Availability: http://dl.acm.org/doi/10.1145/3832810.3832879

Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions

Authors: Bernardo, Marco ^{a, ⁎}, Corradini, Flavio ^b, Tesei, Luca ^b

Source: In Theoretical Computer Science 23 May 2016 629:2-39

Towards separating nondeterministic time from deterministic time

Authors: Kannan, R.

Source: 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on. :235-243 Oct, 1981

Relation: 22nd Annual Symposium on Foundations of Computer Science