Results 211 to 220 of about 127,543 (265)

Autonomous Folding of Soft Matter From Living Polymers

Advanced Materials, EarlyView.
Origami structures are endowed with “living” polymer creases that grow, remodel, and stiffen in response to nutrient solutions. This post‐fabrication growth enables autonomous folding, iterative regrowth, and mechanical tuning involving origami assemblies, such as cranes, Miura‐ori tessellations, rigid and non‐rigid square‐twist patterns, establishing ...
Jiahe Huang, Tuo Zhao, Shixi Zang, Deep Malu, Huajian Ji, Glaucio H. Paulino, Yuhang Hu   +6 more
wiley   +1 more source

A Multi-Stage Drop-the-Loser Design With Superiority Boundaries. [PDF]

Stat Med
Greenstreet P, Khan M, Kanji S, Motazedian P, Seely A, Sibley S, Ramsay T.   +6 more
europepmc   +1 more source

Adsorption‐Engineered Hydrocarbon Ionomers for Durable Proton‐Exchange Membrane Fuel Cells

Advanced Materials, EarlyView.
Hydrocarbon ionomers suffer from oxidation‐driven interfacial degradation in PEM fuel cell cathodes, leading to catalyst instability. Here, adsorption‐engineered poly(fluorene) ionomers decouple interfacial anchoring from oxidative degradation, enabling strong catalyst–ionomer interactions while resisting electrochemical oxidation.
Heemin Park, Kate Chen, Su Min Ahn, Hengquan Guo, Cy Fujimoto, Jong‐Ho Choi, Lynda Amichi, Danah Kim, Seung Geol Lee, Xiaojing Wang, Jacob S. Spendelow, Sun Young Kang, Panagiotis Bexis, Eun Joo S. Park, Yu Seung Kim   +14 more
wiley   +1 more source

S‐Nitrosothiols as Thiol‐Protecting Groups for Controlled Thiol‐Maleimide Crosslinking of Homogeneous Soft Hydrogels

Advanced Materials, EarlyView.
Rapid thiol‐maleimide addition frequently outpaces mixing, resulting in heterogeneous hydrogels. S‐nitrosothiols act as thiol‐protecting groups, allowing uniform mixing with maleimide‐functionalized polymers before gelation. Sodium thiosulfate or sodium ascorbate then regenerates thiols on demand, triggering controlled thiol‐maleimide crosslinking ...
Julian A. Serna, Michelle J. Iwohn, Maximilian Seifermann, Stefan Heißler, Maike Schliephake, Franziska Dopp, Claudia Muhle‐Goll, Pavel A. Levkin   +7 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Generalized Stopping Sets and Stopping Redundancy

2007 Information Theory and Applications Workshop, 2007
Iterative decoding for linear block codes over erasure channels may be much simpler than optimal decoding but its performance is usually not as good. Here, we present a general iterative decoding technique that gives a more refined trade-off between complexity and performance. In each iteration, a system of equations is solved.
Khaled A.S. Abdel-Ghaffar, Jos H. Weber
openaire   +1 more source

Pseudocodeword weights and stopping sets

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
We examine the structure of pseudocodewords in Tanner graphs and derive lower bounds of pseudocodeword weights. The weight of a pseudocodeword is related to the size of its support set, which forms a stopping set in the Tanner graph.
Kelley, C, Sridhara, D, Xu, J, Rosenthal, J   +3 more
openaire   +2 more sources

Stopping Sets of Hermitian Codes

IEEE Transactions on Information Theory, 2016
Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes.
Sarah E. Anderson, Gretchen L. Matthews
openaire   +2 more sources

Stopping set elimination for LDPC codes

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017
This work studies the Stopping-Set Elimination Problem, namely, given a stopping set, how to remove the fewest erasures so that the remaining erasures can be decoded by belief propagation in k iterations (including k =∞). The NP-hardness of the problem is proven. An approximation algorithm is presented for k = 1.
Anxiao Andrew Jiang, Pulakesh Upadhyaya, Ying Wang, Krishna R. Narayanan, Hongchao Zhou, Jin Sima, Jehoshua Bruck   +6 more
openaire   +2 more sources

Stopping set analysis for Hamming codes

IEEE Information Theory Workshop, 2005., 2005
In the 2004 Shannon Lecture, McEliece presented an expression for the number of stopping sets of size three in a Hamming code. In this paper, we investigate how this number depends on the parity-check matrix used in the decoding process. First, we present basic results on stopping set enumerators for block codes in general.
Jos H. Weber, Khaled A. S. Abdel-Ghaffar
openaire   +2 more sources

Stopping sets for physical-layer security

2010 IEEE Information Theory Workshop, 2010
Physical-layer security based on wiretap codes can be used to complement cryptographic applications at higher layers of the protocol stack. We assume a passive eavesdropper that has access to noise-corrupted codewords with erasures that are statistically independent to those of the legitimate communication partners.
Willie K. Harrison, João Almeida 0004, Demijan Klinc, Steven W. McLaughlin, João Barros   +4 more
openaire   +2 more sources