Intelligence across humans and machines: a joint perspective.

This paper aims to address the divergences and contradictions in the definition of intelligence across different areas of knowledge, particularly in computational intelligence and psychology, where the concept is of significant interest. Despite the differences in motivation and approach, both fields have contributed to the rise of cognitive science. However, the lack of a standardized definition, empirical evidence, or measurement strategy for intelligence is a hindrance to cross-fertilization between these areas, particularly for semantic-based applications. This paper seeks to equalize the definitions of intelligence from the perspectives of computational intelligence and psychology, and offer an overview of the methods used to measure intelligence. We argue that there is no consensus for intelligence, and the term is interchangeably used with similar, opposed, or even contradictory definitions in many fields. This paper concludes with a summary of its central considerations and contributions, where we state intelligence is an agent's ability to process external and internal information to find an optimum adaptation (decision-making) to the environment according to its ontology and then decode this information as an output action.

PathMolD-AB: Spatiotemporal pathways of protein folding using parallel molecular dynamics with a coarse-grained model.

Solving the protein folding problem (PFP) is one of the grand challenges still open in computational biophysics. Globular proteins are believed to evolve from initial configurations through folding pathways connecting several thermodynamically accessible states in a free energy landscape until reaching its minimum, inhabited by the stable native structures. Despite its huge computational burden, molecular dynamics (MD) is the leading approach in the PFP studies by preserving the Newtonian temporal evolution in the canonical ensemble. Non-trivial improvements are provided by highly parallel implementations of MD in cost-effective GPUs, concomitant to multiscale descriptions of proteins by coarse-grained minimalist models. In this vein, we present the PathMolD-AB framework, a comprehensive software package for massively parallel MD simulations using the canonical ensemble, structural analysis, and visualization of the folding pathways using the minimalist AB-model. It has, also, a tool to compare the results with proteins re-scaled from the PDB. We simulate and analyze, as case studies, the folding of four proteins: 13FIBO, 2GB1, 1PLC and 5ANZ, with 13, 55, 99 and 223 amino acids, respectively. The datasets generated from simulations correspond to the MD evolution of 3500 folding pathways, encompassing 35×106 states, which contains the spatial amino acid positions, the protein free energies and radii of gyration at each time step. Results indicate that the speedup of our approach grows logarithmically with the protein length and, therefore, it is suited for most of the proteins in the PDB. The predicted structures simulated by PathMolD-AB were similar to the re-scaled biological structures, indicating that it is promising for the study of the PFP study.

A benchmark of optimally folded protein structures using integer programming and the 3D-HP-SC model.

The Protein Structure Prediction (PSP) problem comprises, among other issues, forecasting the three-dimensional native structure of proteins using only their primary structure information. Most computational studies in this area use synthetic data instead of real biological data. However, the closer to the real-world, the more the impact of results and their applicability. This work presents 17 real protein sequences extracted from the Protein Data Bank for a benchmark to the PSP problem using the tri-dimensional Hydrophobic-Polar with Side-Chains model (3D-HP-SC). The native structure of these proteins was found by maximizing the number of hydrophobic contacts between the side-chains of amino acids. The problem was treated as an optimization problem and solved by means of an Integer Programming approach. Although the method optimally solves the problem, the processing time has an exponential trend. Therefore, due to computational limitations, the method is a proof-of-concept and it is not applicable to large sequences. For unknown sequences, an upper bound of the number of hydrophobic contacts (using this model) can be found, due to a linear relationship with the number of hydrophobic residues. The comparison between the predicted and the biological structures showed that the highest similarity between them was found with distance thresholds around 5.2-8.2 Å. Both the dataset and the programs developed will be freely available to foster further research in the area.

Evaluation of dynamic behavior forecasting parameters in the process of transition rule induction of unidimensional cellular automata.

The simulation of the dynamics of a cellular systems based on cellular automata (CA) can be computationally expensive. This is particularly true when such simulation is part of a procedure of rule induction to find suitable transition rules for the CA. Several efforts have been described in the literature to make this problem more treatable. This work presents a study about the efficiency of dynamic behavior forecasting parameters (DBFPs) used for the induction of transition rules of CA for a specific problem: the classification by the majority rule. A total of 8 DBFPs were analyzed for the 31 best-performing rules found in the literature. Some of these DBFPs were highly correlated each other, meaning they yield the same information. Also, most rules presented values of the DBFPs very close each other. An evolutionary algorithm, based on gene expression programming, was developed for finding transition rules according a given preestablished behavior. The simulation of the dynamic behavior of the CA is not used to evaluate candidate transition rules. Instead, the average values for the DBFPs were used as reference. Experiments were done using the DBFPs separately and together. In both cases, the best induced transition rules were not acceptable solutions for the desired behavior of the CA. We conclude that, although the DBFPs represent interesting aspects of the dynamic behavior of CAs, the transition rule induction process still requires the simulation of the dynamics and cannot rely only on the DBFPs.

A dose-response model for the conventional phototherapy of the newborn.

Jaundice of the newborn is a common problem as a consequence of the rapid increment of blood bilirubin in the first days of live. In most cases, it is considered a physiological transient situation, but unmanaged hyperbilirubinemia can lead to death or serious injuries for the survivors. For decades, phototherapy has been used as the main method for prevention and treatment of hyperbilirubinaemia of the newborn. This work aims at finding a predictive model for the decrement of blood bilirubin for patients submitted to conventional phototherapy. Data from the phototherapy of 90 term newborns were collected and used in a multiple regression method. A rigorous statistical analysis was done in order to guarantee a correct and valid model. The obtained model was able to explain 78% of the variation of the dependent variable. We show that it is possible to predict the total serum bilirubin of the patient under conventional phototherapy by knowing its birth weight, bilirubin level at the beginning of treatment and the radiant energy density (dose). Besides, it is possible to infer the time necessary for a given decrement of bilirubin, under approximately constant irradiance. Statistical analysis of the obtained model shows that it is valid for several ranges of birth weight, initial bilirubin level, and radiant energy density. It is expected that the proposed model can be useful in the clinical management of hyperbilirubinemia of the newborn.

Avaliação do ensino-aprendizagem em ventilação mecânica nos cursos de fisioterapia no Paraná / Assessment of mechanical ventilation training in physical therapy schools of Paraná

Com o crescente interesse dos fisioterapeutas em se especializar e trabalhar na área de fisioterapia respiratória, torna-se necessário uma formação acadêmica mais completa. Durante a formação destes futuros profissionais observa-se que o tempo de estagio em uma Unidade de Terapia Intensiva e, em geral, insuficiente para adquirir os conhecimentos suficientes sobre ventilação mecânica. Alem disto, realizar na Universidade a pratica do funcionamento de um ventilador mecânico e inviável por falta de infra-estrutura. Devido a estas dificuldades, o aluno termina sua formação acadêmica com pouco conhecimento e embasamento sobre ventilação mecânica. Este estudo mostra que realmente existe um déficit em relação ao ensino e aprendizado dos alunos de fisioterapia, no que diz respeito a ventilação mecânica.

With the increasing interest of physical therapists in specializing and working in the area of respiratory physical therapy, a more complete academic instruction has become increasingly necessary. During the instruction of these future professionals, it has been observed that the time of training in an Intensive Care Unit is general insufficient to acquire the sufficient knowledge of ventilation mechanics. Besides, to practice the use of a mechanical ventilator in the University is unviable since there is lack of infrastructure. Because of these difficulties, the student finishes their academic instruction with little knowledge and basing on mechanical ventilation. This study shows that there is a deficit in the process of teaching mechanical ventilation to physical therapy students.

Reconstruction of phylogenetic trees using the ant colony optimization paradigm.

We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics. A tree is constructed using a fully connected graph and the problem is approached similarly to the well-known traveling salesman problem. This methodology was used to develop an algorithm for constructing a phylogenetic tree using a pheromone matrix. Two data sets were tested with the algorithm: complete mitochondrial genomes from mammals and DNA sequences of the p53 gene from several eutherians. This new methodology was found to be superior to other well-known softwares, at least for this data set. These results are very promising and suggest more efforts for further developments.

Neural networks for protein classification.

This paper describes a biomolecular classification methodology based on multilayer perceptron neural networks. The system developed is used to classify enzymes found in the Protein Data Bank. The primary goal of classification, here, is to infer the function of an (unknown) enzyme by analysing its structural similarity to a given family of enzymes. A new codification scheme was devised to convert the primary structure of enzymes into a real-valued vector. The system was tested with a different number of neural networks, training set sizes and training epochs. For all experiments, the proposed system achieved a higher accuracy rate when compared with profile hidden Markov models. Results demonstrated the robustness of this approach and the possibility of implementing fast and efficient biomolecular classification using neural networks.