Recurrent neural networks (RNNs) are useful for text generation since they can generate outputs in the context of previous ones. Baroque music and language are similar, as every word or note exists in context with others, and they both follow strict rules. The authors hypothesized that if we represent music in a text format, an RNN designed to generate language could train on it and create music structurally similar to Bach’s. They found that the music generated by our RNN shared a similar structure with Bach’s music in the input dataset, while Bachbot’s outputs are significantly different from this experiment’s outputs and thus are less similar to Bach’s repertoire compared to our algorithm.

Here, seeking to better understand the control algorithms used in autonomous vehicles, the authors compared the Stanley and pure pursuit control algorithms along with a new version of each. Unexpectedly, they found that no control algorithm offered optimal performance, but rather resulted in tradeoffs between the various ideal results.

The authors use the Lanczos algorithm to computationally solve the Schrodinger equation for 2D potentials with a Python program

Wang and Gong developed a novel dynamic gene-searching algorithm called Dynamic Gene Search (DyGS) to create a gene panel for each of the 12 cancers with the highest annual incidence and death rate. The 12 gene panels the DyGS algorithm selected used only 3.5% of the original gene mutation pool, while covering every patient sample. About 40% of each gene panel is druggable, which indicates that the DyGS-generated gene panels can be used for early cancer detection as well as therapeutic targets in treatment methods.

The authors looked at using genetic algorithms to look at the Indian labor market and what features might best explain any variation seen. They found that features such as economic growth and household consumption, among others, best explained variation.

Here, the authors investigated methods to reduce noise in audio composed of real-word sounds. They specifically used two spectral subtraction noise reduction algorithms: stationary and non-stationary finding notable differences in noise improvements depending on the noise sources.

In this work, the authors develop an algorithm that solves the problem of efficient space travel between planets. This is a problem that could soon be of relevance as mankind continues to expand its exploration of outer space, and potentially attempt to inhabit it.

Ant colony optimization algorithms simulate ants moving from point to point on a graph and coordinate their actions, similar to ants laying down pheromones to strengthen a path as it is used more frequently. These ACO algorithms can be applied to the classic traveling salesman problem, which aims to determine the lowest-cost path through a given set of points on a graph. In this study, a novel multiple-colony system was developed that uses multiple simulated ant colonies to generate improved solutions to the traveling salesman problem.

Here, seeking to identify an optimal method to classify tree species through remote sensing, the authors used a few machine learning algorithms to classify forest tree species through multispectral satellite imagery. They found the Random Forest algorithm to most accurately classify tree species, with the potential to improve model training and inference based on the inclusion of other tree properties.

Machine learning algorithms are becoming increasingly popular for data crunching across a vast area of scientific disciplines. Here, the authors compare two machine learning algorithms with respect to accuracy and user-friendliness and find that random forest algorithms outperform logistic regression when applied to the same dataset.