This research article aims to uncover the mysteries surrounding Mindanao’s cultural heritage by examining its myths, symbols, and philosophies. Through a multidisciplinary approach, this paper reveals the deeper meanings behind Mindanao’s mythology and encourages critical thinking and a deeper understanding of the connections between myth, culture, and identity.

Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. Recently, Arikan presented a new polar coding scheme, which he called polarization-adjusted convolutional (PAC) codes. At short blocklengths, such codes offer a dramatic improvement in performance as compared to CRC-aided list decoding of conventional polar codes. PAC codes are based primarily upon the following main ideas: replacing CRC codes with convolutional precoding (under appropriate rate profiling) and replacing list decoding by sequential decoding. Simulation results show that PAC codes, resulting from the combination of these ideas, are close to finite-length lower bounds on the performance of any code under ML decoding. One of our main goals in this paper is to answer the following question: is sequential decoding essential for the superior performance of PAC codes? We show that similar performance can be achieved using list decoding when the list size $L$ is moderately large (say, $L \geq 128$). List decoding has distinct advantages over sequential decoding in certain scenarios, such as low-SNR regimes or situations where the worst-case complexity/latency is the primary constraint. Another objective is to provide some insights into the remarkable performance of PAC codes. We first observe that both sequential decoding and list decoding of PAC codes closely match ML decoding thereof. We then estimate the number of low weight codewords in PAC codes, and use these estimates to approximate the union bound on their performance. These results indicate that PAC codes are superior to both polar codes and Reed-Muller codes. We also consider random time-varying convolutional precoding for PAC codes, and observe that this scheme achieves the same superior performance with constraint length as low as $\nu = 2$.

Broadcasting a message from one to many processors in a network corresponds to concurrent reading on a random access shared memory parallel machine. Computing the trees of a forest, the level of each node in its tree and the path between two nodes are problems that can easily be solved with concurrent reading in a time logarithmic in the maximum height of a tree. Solving such problems with exclusive reading requires a time logarithmic in the number of nodes, implying message passing between disjoint pairs of processors on a distributed system. Allowing concurrent reading in parallel algorithm design for distributed computing might be advantageous in practice if these problems are faced on shallow trees with some specific constraints. We show an application to LZC-compressed file decoding, whose parallelization employs these computations on such trees for realistic data. On the other hand, zipped files do not have such advantage since they are compressed by the Lempel-Ziv sliding window technique.

In this paper, we propose a pre-configured error pattern ordered statistics decoding (PEPOSD) algorithm and discuss its application to short cyclic redundancy check (CRC)-polar codes. Unlike the traditional OSD that changes the most reliable independent symbols, we regard the decoding process as testing the error patterns, like guessing random additive noise decoding (GRAND). Also, the pre-configurator referred from ordered reliability bits (ORB) GRAND can better control the range and testing order of EPs. Offline-online structure can accelerate the decoding process. Additionally, we also introduce two orders to optimize the search order for testing EPs. Compared with CRC-aided OSD and list decoding, PEPOSD can achieve a better trade-off between accuracy and complexity.

This study focused on the level of Phonological awareness and Word Decoding ability among second year BSED English students in the University of Southeastern Philippines in terms of critical sound. Moreover, it aimed to recognize the significant relationship between the two variables. To verify, there were tests being employed to gather the necessary data. These were: listening test for measuring the respondents' level of awareness to words with critical sounds; phonetic transcription test to identify the respondents' level of awareness to sound-symbol relationship; and spelling test to know the respondents' level of ability for transcriptions to be translated to its Standard English spelling. After the data have been gathered, it was interpreted that the students have a moderate Phonological awareness. On the other hand, their Word Decoding ability resulted to high level. As being correlated, it is being found that there is a great significant relationship between the two variables. With these marks, the researchers encourage the schools in enhancing the students' sound-word relationship knowledge by primarily utilizing speech laboratory and establishing a speech club in the school for extending their exposure about these concepts.

The gene translation system possesses inherent complexity in distinguishing codons with degeneracy through repertoires of aminoacyl-tRNAs in the ribosome. Implementation of inosine nucleoside at the anticodon wobble-position in certain tRNAs, especially in eukaryotes, might be arisen to establish complex decoding systems. This report introduces the novel concept of “decoding tables”, which serve as concise summaries of codon-anticodon pairings provided in codon table-like format. Utilizing tRNA genome database information and a procedure based on compiled tRNA studies, the tRNA repertoire and the use of wobble pairings can be depicted for any organisms. The decoding table sheds light on the use of wobble pairings across diverse organisms.

We propose a deep-learning approach for the joint MIMO detection and channel decoding problem. Conventional MIMO receivers adopt a model-based approach for MIMO detection and channel decoding in linear or iterative manners. However, due to the complex MIMO signal model, the optimal solution to the joint MIMO detection and channel decoding problem (i.e., the maximum likelihood decoding of the transmitted codewords from the received MIMO signals) is computationally infeasible. As a practical measure, the current model-based MIMO receivers all use suboptimal MIMO decoding methods with affordable computational complexities. This work applies the latest advances in deep learning for the design of MIMO receivers. In particular, we leverage deep neural networks (DNN) with supervised training to solve the joint MIMO detection and channel decoding problem. We show that DNN can be trained to give much better decoding performance than conventional MIMO receivers do. Our simulations show that a DNN implementation consisting of seven hidden layers can outperform conventional model-based linear or iterative receivers. This performance improvement points to a new direction for future MIMO receiver design.

Neural decoding from spiking activity is an essential tool for understanding the information encoded in population neurons, especially in applications like brain-computer interface (BCI). Various quantitative methods have been proposed and have shown superiorities under different scenarios respectively. From the machine learning perspective, the decoding task is to map the high-dimensional spatial & temporal neuronal activity to the low-dimensional physical quantities (e.g., velocity, position). Because of the complex interactions and the abundant dynamics among neural circuits, good decoding algorithms usually have the capability of capturing flexible spatiotemporal structures embedded in the input feature space. Recently, the Transformer-based models are widely used in processing natural languages and images due to its superior performances in handling long-range and global dependencies. Hence, in this work we examine the potential applications of Transformers in neural decoding and introduce two Transformer-based models. Besides adapting the Transformer to neuronal data, we also propose a data augmentation method for overcoming the data shortage issue. We test our models on three experimental datasets and their performances are comparable to the previous state-of-the-art (SOTA) RNN-based methods. In addition, Transformer-based models show increased decoding performances when the input sequences are longer, while LSTM-based models deteriorate quickly. Our research suggests that Transformer-based models are important additions to the existing neural decoding solutions, especially for large datasets with long temporal dependencies.

Schrödinger dynamics is a nonlocal process. Not only does local perturbation affect instantaneously the entire space, but the effect decays slowly. When the wavefunction is spectrally bounded, the Schrödinger equation can be written as a universal set of ordinary differential equations, with universal coupling between them, which is related to Euler’s formula. Since every variable represents a different local value of the wave equation, the coupling represents the dynamics’ nonlocality. It is shown that the nonlocal coefficient is inversely proportional to the distance between the centers of these local areas. As far as we know, this is the first time that this inverse square law was formulated.

In this paper, chaos sequence is used to replace the traditional Spread Spectrum sequence. From the perspective of the communication partner, a new method of generating the initial value of chaotic sequence is proposed, which is more suitable for the multi-base Spread Spectrum System and easy to extract. In order to further improve the error performance of the system and ensure the integrity of the system, an improved suboptimal soft information extraction method based on log-likelihood ratio (LLR) is proposed in the channel coding module, which can further improve the error performance of the system. On this basis, we choose the synchronization mode of multiple transmission of one reference signal to solve the problem that chaotic sequence is difficult to obtain synchronization because of its aperiodic characteristics. Finally, the system is simulated in the channel with low SNR. The simulation results show that chaotic sequence as Spread Spectrum code can make the signal transmit accurately in the worse channel environment. The performance gain of applying soft information decoding decision in the M-ary Spread Spectrum System with chaotic sequence as Spread Spectrum code can reach 5.2dB compared with the traditional Direct Spread Spectrum System.

Machine Learning (ML) approaches have been fruitfully applied to several classification problems of neurophysiological activity. Considering the relevance of emotion in human cognition and behaviour, ML found an important application field in emotion identification based on neurophysiological activity. Nonetheless, the literature results present a high variability depending on the neuronal activity measurement, the signal features and the classifier type. The present work aims to provide new methodological insight on ML applied to emotion identification based on electrophysiological brain activity. For this reason, we recorded EEG activity while emotional stimuli, high and low arousal (auditory and visual) were provided to a group of healthy participants. Our target signal to classify was the pre-stimulus onset brain activity. Classification performance of three different classifiers (LDA, SVM and kNN) was compared using both spectral and temporal features. Furthermore, we also contrasted the classifiers performance with static and dynamic (time evolving) features. The results show a clear increased in classification accuracy with temporal dynamic features. In particular, the SVM classifiers with temporal features showed the best accuracy (63.8 %) in classifying high vs. low arousal auditory stimuli.

Most of the research of mental fatigue evaluation mainly concentrated on some indexes that require sophisticate and large instruments which make the detection of mental fatigue cumbersome, time-consuming, and difficult to apply on a large scale. A quick and sensitive mental fatigue detection index is necessary so that mental workers can be alerted in time and take corresponding countermeasures. But to date, no studies have compared the sensitivity of common objective evaluation indexes. To solve these problems this study recruited 56 human subjects. These subjects were evaluated using six fatigue indexes: the Stanford sleepiness scale, digital span, digital decoding, short-term memory, critical flicker fusion frequency (CFF), and speed perception deviation. The results of fatigue tests before and after mental fatigue were compared, and a one-way analysis of variance (ANOVA) was performed on the speed perception deviation. The result indicated the significance of this index. Considering individual differences, the relative fatigue index (RFI) was proposed to compare the sensitivity of the indexes. The results showed that when the self-rated fatigue grade changed from non-fatigue to mild fatigue, the ranges of RFI values for digital span, digital decoding, short-term memory and CFF were 0.175–0.258, 0.194–0.316, 0.068–0.139, and 0.055–0.075, respectively. Correspondingly, when the self-rated fatigue grade changed from non-fatigue to severe fatigue, the ranges of RFI values for the above indexes were 0.175–0.258, 0.194–0.316, 0.068–0.139, and 0.055–0.075, respectively. These results suggest that the sensitivity of the digital decoding, digital span, short-term memory, and CFF decreased sequentially when the self-evaluated fatigue grade changed from no fatigue to mild or severe fatigue. The RFI individuality of the speed perception deviation is highly variable and is not suitable as an evaluation index. In mental fatigue testing, digital decoding testing can provide faster, more convenient, and more accurate results.

The paper presents a study of two novel visual motion onset stimulus-based brain–computer interfaces (vmoBCI). Two settings are compared with afferent and efferent to a computer screen center motion patterns. Online vmoBCI experiments are conducted in an oddball event–related potential (ERP) paradigm allowing for “aha–responses” decoding in EEG brainwaves. A subsequent stepwise linear discriminant analysis classification (swLDA) classification accuracy comparison is discussed based on two inter–stimulus–interval (ISI) settings of 700 and 150 ms in two online vmoBCI applications with six and eight command settings. A research hypothesis of classification accuracy non–significant differences with various ISIs is confirmed based on the two settings of 700 ms and 150 ms, as well as with various numbers of ERP response averaging scenarios.The efferent in respect to display center visual motion patterns allowed for a faster interfacing and thus they are recommended as more suitable for the no–eye–movements requiring visual BCIs.

In this paper, we propose an imagined speech-based brain wave pattern recognition using deep learning. Multiple features were extracted concurrently from eight-channel Electroencephalography (EEG) signals. To obtain classifiable EEG data with fewer number of sensors, we placed the EEG sensors on carefully selected spots on the scalp. To decrease the dimensions and complexity of the EEG dataset and to avoid overfitting during the deep learning algorithm, we utilized the wavelet scattering transformation. A low-cost 8-channel EEG headset was used with MATLAB 2023a to acquire the EEG data. The Long-Short Term Memory Recurrent Neural Network (LSTM-RNN) was used to decode the identified EEG signals into four audio commands: Up, Down, Left, and Right. Wavelet scattering transformation was applied to extract the most stable features by passing the EEG dataset through a series of filtration processes. Filtration has been implemented for each individual command in the EEG datasets. The proposed imagined speech-based brain wave pattern recognition approach achieved a 92.50% overall classification accuracy. This accuracy is promising for designing a trustworthy imagined speech-based Brain-Computer Interface (BCI) future real-time systems. For better evaluation of the classification performance, other metrics were considered, and we obtained 92.74%, 92.50% and 92.62% for precision, recall, and F1-score, respectively.

Theories of reading comprehension emphasize decoding and listening comprehension as two essential components. The current study aimed to investigate how Chinese character decoding and context-driven auditory semantic integration contribute to reading comprehension in Chinese middle school students. Seventy-five middle school students were tested. Context-driven auditory semantic integration was assessed with speech-in-noise tests in which the fundamental frequency (F0) contours of spoken sentences were either kept natural or acoustically flattened with the latter requiring a higher degree of contextual information. Statistical modelling with hierarchical regression was conducted to examine the contributions of Chinese character decoding and context-driven auditory semantic integration to reading comprehension. Performance on Chinese character decoding and auditory semantic integration scores with the flattened (but not natural) F0 sentences significantly predicted reading comprehension. Furthermore, the contributions of these two factors to reading comprehension were better fitted with an additive model instead of a multiplicative model. These findings indicate that reading comprehension in middle schoolers is associated with not only character decoding but also the listening ability to make better use of the sentential context for semantic integration in a severely degraded speech-in-noise condition. The results add to our better understanding of the multi-faceted reading comprehension in children. Future research could further address the age-dependent development and maturation of reading skills by examining and controlling other important cognitive variables, and apply neuroimaging techniques such as functional magmatic resonance imaging to reveal the neural substrates for the contribution of auditory semantic integration and the observed additive model to reading comprehension.

Abstract: In recent years, low frequency (LF) electroencephalogram (EEG) signals have been decoded to obtain kinematic trajectories with the aim of achieving closed loop natural control. However, decoded trajectories suffer variability and low correlation against the measured movement. This paper suggests that if EEG features of motor intents are directly associated with fixed points along a given range of motion, then the natural kinematic parameters can be quantified. A novel classification method is proposed to evaluate this hypothesis along with equations for obtaining the movement parameters (velocity, acceleration). Furthermore, this implies that the force of an end-effector and work done in moving the end-effector may be computed, leading to natural control of EEG-based robotic arms and neuroprostheses. Finally, expectations are that combining the proposed method with existing classification methods will increase the accuracy and scalability of brain-computer interface (BCI) applications.

Iterative Stochastic decoding is an alternative to standard fixed-point decoding of Low-density parity check codes (LDPC) to reduce inter-node routing. In this paper, we propose a Flexible Field-Programmable Gate Array (FPGA)-Based Stochastic decoding (SD) hardware architecture for LDPC codes in the Fifth-Generation (5G) New Radio (NR) Standard that supports decoding of set of various code rates. This decoder’s runtime flexibility is desirable to switch a better performing code rate automatically based on the channel conditions without the extra time needed for reprogramming of FPGA. An offline design method is implemented to generate the hardware description language (HDL) code description of the decoder for the required code-rate set, which is further synthesized and integrated into the Xilinx Kintex-7 series FPGA board to determine the hardware resource utilisation and processing throughput. The Synopsys design tools were employed during both the simulation and synthesis stages, in combination with TSMC 65-nm CMOS standard cell technology, to facilitate comparative analysis. Compared with state-of-the-art designs, the proposed architecture reduces hardware utilization by up to 26% and achieved energy efficiency by 52%.