Results 181 to 190 of about 1,051,474 (226)
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Microstructure Evolution of a VMnFeCoNi High‐Entropy Alloy After Synthesis, Swaging, and Annealing
The synthesis and processing (rotary swaging and annealing) of the novel VMnFeCoNi alloy is investigated, alongside the estimation of the grain size effect on hardness. Analysis of a wide grain size range of recrystallized microstructures (12–210 µm) reveals a low annealing twin density.
Aditya Srinivasan Tirunilai +6 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Coding for a multiple-access channel
IEEE Transactions on Information Theory, 1976Summary: In this paper, coding for a multiple-access discrete memoryless channel is investigated. Some bounds on the rate pairs of uniquely decodable code pairs are derived. Coding procedures based on the Reed-Muller codes and their cosets are described for the noiseless case and for correction of single errors.
T Kasami
exaly +3 more sources
Channel-hopping multiple access
2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2000The medium-access control (MAC) protocols for wireless networks proposed or implemented to date based on collision-avoidance handshakes between the sender and receiver either require carrier sensing or the assignment of unique codes to nodes to ensure that intended receivers hear data packets without interference from hidden sources.
Asimakis Tzamaloukas +1 more
openaire +1 more source
Channel configuration of multiple-access channel
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004This paper investigates the channel configuration of multiple-access channel (MAC) by decomposing the MAC into finite subMAC and also proves that there exists an input probability that achieves boundary of a capacity region and the total capacity of the original MAC.
Yoichiro Watanabe, Koichi Kamoi
openaire +1 more source
The Interference-Multiple-Access Channel
2009 IEEE International Conference on Communications, 2009We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound
Etienne Perron +2 more
openaire +1 more source
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, 2006We study deterministic broadcasting on multiple access channels when packets are injected continuously. The quality of service is considered in the framework of adversarial queuing. An adversary is determined by injection rate and burstiness, the latter denoting the number of packets that can be injected simultaneously in a round.
Bogdan S. Chlebus +2 more
openaire +1 more source
Cognitive access algorithms for multiple access channels
2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2013This paper considers a multiple access fading channel where each terminal has a different belief about the channel states and adapts its transmission policy to the belief. In this setting, frequency division multiple access (FDMA) and channel aware random access (RA) are two special cases.
Yichuan Hu, Alejandro Ribeiro
openaire +1 more source
Compositional Restricted Multiple Access Channel
Problems of Information Transmission, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. E. Egorova, V. S. Potapova
openaire +1 more source
On multiple access channels with feedback
IEEE Trans. Inf. Theory, 1984Summary: For the binary erasure multiple access channel, \textit{E. C. van der Meulen} [ibid. IT-23, 1-37 (1977; Zbl 0355.94035)] showed in his survey paper that the symmetrical rate pair (0.79113, 0.79113) is achievable in the case of feedback. Here we prove that this rate point is on the boundary of the feedback capacity region. Subsequently we apply
openaire +1 more source

