About: Journal of Computers is an academic journal. The journal publishes majorly in the area(s): Computer science & Cluster analysis. It has an ISSN identifier of 1796-203X. It is also open access. Over the lifetime, 5807 publications have been published receiving 37846 citations.
TL;DR: A pathway of folding means that there exist a well- defined sequence of events which follow one another so as to carry the protein from the unfolded random coil to a uniquely folded metastable state.
Abstract: Denatured proteins, which have had essentially all of their native three-dimensional structure disrupted, can refold from their random disorderd state into a well-defined unique structure, in which the biological activity is virtually completely restored. This experimental result has lead to the suggestion that a native protein exists in some kind of thermodynamic configurational equilibrium, with the biologically active state being the one of lowest configurational energy. An alternative view is that the native protein is in a uniquely selected metastable state, in which the configurational energy is at a local minimum but not necessarily at an absolute minimum. In this latter model, the protein is not assumed to be in an equilibrium state, and one must postulate some sequence of events which takes place for each molecule so that the protein reaches the correct metastable state.One possible sequential process which might lead a protein to land in a particular state, is the growth of the peptide chain on the ribosome, starting with the amino terminal end and preceding to the carboxyl terminus. Although one could imagine a protein folding as it grows, and thus attaining a particular metastable state, this is clearly not a necessary condition for correct folding, at least for those proteins which have been shown to be reversibly denaturable. However, the fact that folding on the ribosomes is not necessary for the establishment of structure, does not imply that any theory invoking a pathway of folding can be eliminated. Such a pathway only requires some local initiations or condensations of segments of the polypeptide chain whenever the denatured protein is put into the appropriate renaturing medium. These segments would form unique three-dimensional structures which make further condensation more likely. Thus, a pathway of folding means that there exist a well- defined sequence of events which follow one another so as to carry the protein from the unfolded random coil to a uniquely folded metastable state. If the final folded state turned out to be the one of lowest configurational energy, it would be a consequence of biological evolution not of physical chemistry.Three approaches have been used in investigating this problem. First, the refolding and dimerzation of the enzyme alkaline phosphatase obtained from the bacterium E. Coli has been studied under varying conditions and from a variety of mutant strains. Mutants have been selected which fail to make active enzyme at 44 °C. About half of these mutants have activity when the cells are grown at 25 °C, and the enzyme produced at the low temperature has been found to be stable even at temperatures much higher than that used in the selection. Thus, these mutants have a temperature-sensitive step in one of the events which normally leads to the formation of active enzyme, but the enzyme produced is not temperature sensitive.A second approach involved the use of computer- aided molecular model building in attempts to deduce plausible pathways which proteins can follow as they are folding. Starting with an amino acid sequence we can describe the configuration of the protein i.e., the position of each of its atoms in space if we know the dihedral angles for the backbone and, in addition, the rotation angles about the appropriate bonds of the amino acid residues. Using a computer controlled display system, the molecule thus generated can be displayed in such a way that the observer can see the three-dimensional relationships in the structure. Computer programs have been written in such a way that any configuration can be altered to minimize the Van der Vaals energy and to insure close packing of the structure. However, this energy minimization can only be expected to alter the structure to the bottom of the local minimum; it is not intended to search through all possible configurations for a true minimum energy. In addition, the investigator can alter the computer generated structure as if he were dealing with physical models in which one part could be pushed or pulled relative to another. Thus, the computer- aided model building is not designed to find the configuration of minimum energy rather, it is designed as an aid to the investigator as various sequentially folding steps are tried.This system has been used in an attempt to obtain such a pathway of folding for the protein cytochrome C. A plausible structure has been obtained in this way which satisfies all of the known chemical interactions of the molecule. However, the uniqueness of the proposed folding process has not been determined.Finally, the computer system has been used in attempts to deduce plausible folding pathways for myoglobin and lysozyme. Three-dimensional pictures of the structures and some of the folding sequences will be shown.
TL;DR: A novel nearest neighbor-based feature weighting algorithm, which learns a feature Weighting vector by maximizing the expected leave-one-out classification accuracy with a regularization term, is proposed.
Abstract: Feature selection is of considerable importance in data mining and machine learning, especially for high dimensional data. In this paper, we propose a novel nearest neighbor-based feature weighting algorithm, which learns a feature weighting vector by maximizing the expected leave-one-out classification accuracy with a regularization term. The algorithm makes no parametric assumptions about the distribution of the data and scales naturally to multiclass problems. Experiments conducted on artificial and real data sets demonstrate that the proposed algorithm is largely insensitive to the increase in the number of irrelevant features and performs better than the state-of-the-art methods in most cases.
TL;DR: This paper presents a biometric user authentication based on a person’s gait patterns extracted from a physical device attached to the lower leg using histogram similarity and cycle length methods.
Abstract: This paper presents a biometric user authentication based on a person’s gait. Unlike most previous gait recognition approaches, which are based on machine vision techniques, in our approach gait patterns are extracted from a physical device attached to the lower leg. From the output of the device accelerations in three directions: vertical, forward-backward, and sideways motion of the lower leg are obtained. A combination of these accelerations is used for authentication. Applying two different methods, histogram similarity and cycle length, equal error rates (EER) of 5% and 9% were achieved, respectively.
TL;DR: In this paper, the authors present a map of the circum-Pacific region and a timeline of index and guide fossil sites, as well as a geology and stratigraphy of the region.
Abstract: Introduction Part I. Time Scales: 1. Numerical time scale in 1989 2. Magnetic polarity time scale Part II. Circum-Pacific Base Map: 3. Reconstruction of the circum-Pacific region Part III. Regional Geology and Stratigraphy: 4. Western Canada and United States 5. Meso-America 6. Western South America 7. Australasia 8. Indonesia 9. Southeast Asia and Japan 10. Eastern China 11. Eastern Soviet Union Part IV. Chronostratigraphy, Index and Guide Fossils: 12. Ammonite zones of the circum-Pacific region 13. Palynomorphs in the circum-Pacific region 14. Radiolarian biozones of North America and Japan 15. Ostracods of western Canada 16. Bivalve zones and assemblages of the circum-Pacific region 17. Belemnites of the Southwest Pacific Part V. Biogeography: 18. Macroflora of eastern Asia and other circum-Pacific regions 19. Ostracods and foraminifers of western interior North America 20. Ostracods of China 21. Corals of the circum-Pacific region 22. Brachiopods of the western Pacific 23. Belemnites of the circum-Pacific region 24. Ammonites of the circum-Pacific region 25. Fish of the circum-Pacific region 26. Marine reptiles of the circum-Pacific region 27. Climate and oceanography of the Pacific region Part VI. Atlas of Index and Guide Fossils.
TL;DR: The simulation results show that the algorithm proposed in this paper can not only effectively reduce the actual number of training samples and lower the calculation complexity, but also improve the accuracy of KNN text classification algorithm.
Abstract: The traditional KNN text classification algorithm used all training samples for classification, so it had a huge number of training samples and a high degree of calculation complexity, and it also didn’t reflect the different importance of different samples. In allusion to the problems mentioned above, an improved KNN text classification algorithm based on clustering center is proposed in this paper. Firstly, the given training sets are compressed and the samples near by the border are deleted, so the multipeak effect of the training sample sets is eliminated. Secondly, the training sample sets of each category are clustered by k-means clustering algorithm, and all cluster centers are taken as the new training samples. Thirdly, a weight value is introduced, which indicates the importance of each training sample according to the number of samples in the cluster that contains this cluster center. Finally, the modified samples are used to accomplish KNN text classification. The simulation results show that the algorithm proposed in this paper can not only effectively reduce the actual number of training samples and lower the calculation complexity, but also improve the accuracy of KNN text classification algorithm.