ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (14,979)
  • Hindawi  (14,979)
  • American Meteorological Society
  • Blackwell Publishing Ltd
  • Copernicus
  • Institute of Electrical and Electronics Engineers
  • Molecular Diversity Preservation International
  • National Academy of Sciences
  • Oxford University Press
  • Public Library of Science
  • Springer Nature
  • Springer Science + Business Media
  • 2010-2014  (14,979)
  • 1985-1989
  • 1980-1984
  • 1970-1974
  • 1960-1964
  • 1950-1954
  • Mathematical Problems in Engineering  (4,432)
  • Journal of Applied Mathematics  (2,522)
  • 38993
  • 9340
  • Mathematics  (14,979)
  • Nature of Science, Research, Systems of Higher Education, Museum Science
  • Geosciences
  • Architecture, Civil Engineering, Surveying
Collection
  • Articles  (14,979)
Publisher
  • Hindawi  (14,979)
  • American Meteorological Society
  • Blackwell Publishing Ltd
  • Copernicus
  • Institute of Electrical and Electronics Engineers
  • +
Years
Year
Topic
  • Mathematics  (14,979)
  • Nature of Science, Research, Systems of Higher Education, Museum Science
  • Geosciences
  • Architecture, Civil Engineering, Surveying
  • Technology  (9,573)
  • 1
    Publication Date: 2013-09-10
    Description: Pupylation, one of the most important posttranslational modifications of proteins, typically takes place when prokaryotic ubiquitin-like protein (Pup) is attached to specific lysine residues on a target protein. Identification of pupylation substrates and their corresponding sites will facilitate the understanding of the molecular mechanism of pupylation. Comparing with the labor-intensive and time-consuming experiment approaches, computational prediction of pupylation sites is much desirable for their convenience and fast speed. In this study, a new bioinformatics tool named EnsemblePup was developed that used an ensemble of support vector machine classifiers to predict pupylation sites. The highlight of EnsemblePup was to utilize the Bi-profile Bayes feature extraction as the encoding scheme. The performance of EnsemblePup was measured with a sensitivity of 79.49%, a specificity of 82.35%, an accuracy of 85.43%, and a Matthews correlation coefficient of 0.617 using the 5-fold cross validation on the training dataset. When compared with other existing methods on a benchmark dataset, the EnsemblePup provided better predictive performance, with a sensitivity of 80.00%, a specificity of 83.33%, an accuracy of 82.00%, and a Matthews correlation coefficient of 0.629. The experimental results suggested that EnsemblePup presented here might be useful to identify and annotate potential pupylation sites in proteins of interest. A web server for predicting pupylation sites was developed.
    Print ISSN: 1024-123X
    Electronic ISSN: 1563-5147
    Topics: Mathematics , Technology
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2013-09-12
    Description: A classical issue in many applied fields is to obtain an approximating surface to a given set of data points. This problem arises in Computer-Aided Design and Manufacturing (CAD/CAM), virtual reality, medical imaging, computer graphics, computer animation, and many others. Very often, the preferred approximating surface is polynomial, usually described in parametric form. This leads to the problem of determining suitable parametric values for the data points, the so-called surface parameterization. In real-world settings, data points are generally irregularly sampled and subjected to measurement noise, leading to a very difficult nonlinear continuous optimization problem, unsolvable with standard optimization techniques. This paper solves the parameterization problem for polynomial Bézier surfaces by applying the firefly algorithm, a powerful nature-inspired metaheuristic algorithm introduced recently to address difficult optimization problems. The method has been successfully applied to some illustrative examples of open and closed surfaces, including shapes with singularities. Our results show that the method performs very well, being able to yield the best approximating surface with a high degree of accuracy.
    Print ISSN: 1110-757X
    Electronic ISSN: 1687-0042
    Topics: Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2013-09-12
    Description: This paper proposes a partial refactorization for faster nonlinear analysis based on sparse matrix solution, which is nowadays the default solution choice in finite element analysis and can solve finite element models up to millions degrees of freedom. Among various fill-in’s reducing strategies for sparse matrix solution, the graph partition is in general the best in terms of resultant fill-ins and floating-point operations and furthermore produces a particular graph of sparse matrix that prevents local change of entries from wide spreading in factorization. Based on this feature, an explicit partial triangular refactorization with local change is efficiently constructed with limited additional storage requirement in row-sparse storage scheme. The partial refactorization of the changed stiffness matrix inherits a big percentage of the original factor and is carried out only on partial factor entries. The proposed method provides a new possibility for faster nonlinear analysis and is mainly suitable for material nonlinear problems and optimization problems. Compared to full factorization, it can significantly reduce the factorization time and can make nonlinear analysis more efficient.
    Print ISSN: 1024-123X
    Electronic ISSN: 1563-5147
    Topics: Mathematics , Technology
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2013-09-12
    Description: Prediction of RNA structure is a useful process for creating new drugs and understanding genetic diseases. In this paper, we proposed a particle swarm optimization (PSO) and ant colony optimization (ACO) based framework (PAF) for RNA secondary structure prediction. PAF consists of crucial stem searching (CSS) and global sequence building (GSB). In CSS, a modified ACO (MACO) is used to search the crucial stems, and then a set of stems are generated. In GSB, we used a modified PSO (MPSO) to construct all the stems in one sequence. We evaluated the performance of PAF on ten sequences, which have length from 122 to 1494. We also compared the performance of PAF with the results obtained from six existing well-known methods, SARNA-Predict, RnaPredict, ACRNA, PSOfold, IPSO, and mfold. The comparison results show that PAF could not only predict structures with higher accuracy rate but also find crucial stems.
    Print ISSN: 1024-123X
    Electronic ISSN: 1563-5147
    Topics: Mathematics , Technology
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2013-09-13
    Description: A virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the virtual channels are scheduled with a polling algorithm; during the asynchronous time slots, the virtual channels are scheduled with an algorithm based on virtual channel urgency and frame urgency. If there are no valid frames in the corresponding VC at a certain synchronous time slot, a frame of the other synchronous VCs or asynchronous VCs will be transmitted through the physical channel. Only when there are no valid frames in all VCs would an idle frame be generated and transmitted. Experiments show that the proposed algorithm yields much lower scheduling delay and higher channel utilization ratio than those based on unmovable boundary or virtual channel urgency in many kinds of sources. Therefore, broad applicability can be achieved by the proposed algorithm.
    Print ISSN: 1024-123X
    Electronic ISSN: 1563-5147
    Topics: Mathematics , Technology
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2013-09-13
    Description: Self-localization is a basic skill for mobile robots in the dynamic environments. It is usually modeled as a state estimation problem for nonlinear system with non-Gaussian noise and needs the real-time processing. Unscented particle filter (UPF) can handle the state estimation problem for nonlinear system with non-Gaussian noise; however the computation of UPF is very high. In order to reduce the computation cost of UPF and meanwhile maintain the accuracy, we propose an adaptive unscented particle filter (AUPF) algorithm through relative entropy. AUPF can adaptively adjust the number of particles during filtering to reduce the necessary computation and hence improve the real-time capability of UPF. In AUPF, the relative entropy is used to measure the distance between the empirical distribution and the true posterior distribution. The least number of particles for the next step is then decided according to the relative entropy. In order to offset the difference between the proposal distribution, and the true distribution the least number is adjusted thereafter. The ideal performance of AUPF in real robot self-localization is demonstrated.
    Print ISSN: 1024-123X
    Electronic ISSN: 1563-5147
    Topics: Mathematics , Technology
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2013-09-16
    Description: We prove a common fixed point theorem for two pairs of compatible and subsequentially continuous (alternately subcompatible and reciprocally continuous) mappings satisfying a general contractive condition in a metric space. Some illustrative examples are furnished to highlight the realized improvements. Our result improves the main result of Sedghi and Shobe (2007).
    Print ISSN: 1110-757X
    Electronic ISSN: 1687-0042
    Topics: Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2013-09-17
    Description: Location estimation for object tracking is one of the important topics in the research of wireless sensor networks (WSNs). Recently, many location estimation or position schemes in WSN have been proposed. In this paper, we will propose the procedure and modeling of location estimation for object tracking in WSN. The designed modeling is a simple scheme without complex processing. We will use Matlab to conduct the simulation and numerical analyses to find the optimal modeling variables. The analyses with different variables will include object moving model, sensing radius, model weighting value α, and power-level increasing ratio k of neighboring sensor nodes. For practical consideration, we will also carry out the shadowing model for analysis.
    Print ISSN: 1110-757X
    Electronic ISSN: 1687-0042
    Topics: Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2013-09-17
    Description: This paper investigates the stability analysis problem for a class of discrete-time networked control systems (NCSs) with random time delays and packet dropouts based on unified Markov jump model. The random time delays and packet dropouts existed in feedback communication link are modeled by two independent Markov chains; the resulting closed-loop system is described by a new Markovian jump linear system (MJLS) with Markov delays. Sufficient conditions of the stochastic stability for NCSs is obtained by constructing a novel Lyapunov functional, and the mode-dependent output feedback controller design method is presented based on linear matrix inequality (LMI) technique. A numerical example is given to illustrate the effectiveness of the proposed method.
    Print ISSN: 1110-757X
    Electronic ISSN: 1687-0042
    Topics: Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2013-09-17
    Description: The rate-dependent hysteresis in giant magnetostrictive materials is a major impediment to the application of such material in actuators. In this paper, a relevance vector machine (RVM) model is proposed for describing the hysteresis nonlinearity under varying input current. It is possible to construct a unique dynamic model in a given rate range for a rate-dependent hysteresis system using the sinusoidal scanning signals as the training set input signal. Subsequently, a proportional integral derivative (PID) control scheme combined with a feedforward compensation is implemented on a giant magnetostrictive actuator (GMA) for real-time precise trajectory tracking. Simulations and experiments both verify the effectiveness and the practicality of the proposed modeling and control methods.
    Print ISSN: 1110-757X
    Electronic ISSN: 1687-0042
    Topics: Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...