GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Adaptive Control of Nonlinear Discrete-Time Systems by Using OS-ELM Neural Networks
    Hindawi Limited ; 2014
    In:  Abstract and Applied Analysis Vol. 2014 ( 2014), p. 1-11
    Details
    In: Abstract and Applied Analysis, Hindawi Limited, Vol. 2014 ( 2014), p. 1-11
    Abstract: As a kind of novel feedforward neural network with single hidden layer, ELM (extreme learning machine) neural networks are studied for the identification and control of nonlinear dynamic systems. The property of simple structure and fast convergence of ELM can be shown clearly. In this paper, we are interested in adaptive control of nonlinear dynamic plants by using OS-ELM (online sequential extreme learning machine) neural networks. Based on data scope division, the problem that training process of ELM neural network is sensitive to the initial training data is also solved. According to the output range of the controlled plant, the data corresponding to this range will be used to initialize ELM. Furthermore, due to the drawback of conventional adaptive control, when the OS-ELM neural network is used for adaptive control of the system with jumping parameters, the topological structure of the neural network can be adjusted dynamically by using multiple model switching strategy, and an MMAC (multiple model adaptive control) will be used to improve the control performance. Simulation results are included to complement the theoretical results.
    Type of Medium: Online Resource
    ISSN: 1085-3375 , 1687-0409
    URL: Article
    DOI: 10.1155/2014/267609
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2014
    detail.hit.zdb_id: 2064801-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Boundedness of operators generated by fractional semigroups associated with Schrödinger operators on Campanato type spaces via T1 theorem
    Springer Science and Business Media LLC ; 2021
    In:  Banach Journal of Mathematical Analysis Vol. 15, No. 4 ( 2021-10)
    Details
    In: Banach Journal of Mathematical Analysis, Springer Science and Business Media LLC, Vol. 15, No. 4 ( 2021-10)
    Type of Medium: Online Resource
    ISSN: 2662-2033 , 1735-8787
    URL: Article
    DOI: 10.1007/s43037-021-00148-4
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2021
    detail.hit.zdb_id: 2395499-1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Information Propagation in Online Social Network Based on Human Dynamics
    Hindawi Limited ; 2013
    In:  Abstract and Applied Analysis Vol. 2013 ( 2013), p. 1-6
    Details
    In: Abstract and Applied Analysis, Hindawi Limited, Vol. 2013 ( 2013), p. 1-6
    Abstract: We investigate the impact of human dynamics on the information propagation in online social networks. First, statistical properties of the human behavior are studied using the data from “Sina Microblog,” which is one of the most popular online social networks in China. We find that human activity patterns are heterogeneous and bursty and are often described by a power-law interevent time distribution P ( τ ) ~ τ − α . Second, we proposed an extended Susceptible-Infected (SI) propagation model to incorporate bursty and limited attention. We unveil how bursty human behavior and limited attention affect the information propagation in online social networks. The result in this paper can be useful for optimizing or controlling information propagation in online social networks.
    Type of Medium: Online Resource
    ISSN: 1085-3375 , 1687-0409
    URL: Article
    DOI: 10.1155/2013/953406
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2013
    detail.hit.zdb_id: 2064801-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set
    Hindawi Limited ; 2013
    In:  Journal of Applied Mathematics Vol. 2013 ( 2013), p. 1-15
    Details
    In: Journal of Applied Mathematics, Hindawi Limited, Vol. 2013 ( 2013), p. 1-15
    Abstract: This paper presents a shuffled frog leaping algorithm (SFLA) for the single-mode resource-constrained project scheduling problem where activities can be divided into equant units and interrupted during processing. Each activity consumes 0–3 types of resources which are renewable and temporarily not available due to resource vacations in each period. The presence of scarce resources and precedence relations between activities makes project scheduling a difficult and important task in project management. A recent popular metaheuristic shuffled frog leaping algorithm, which is enlightened by the predatory habit of frog group in a small pond, is adopted to investigate the project makespan improvement on Patterson benchmark sets which is composed of different small and medium size projects. Computational results demonstrate the effectiveness and efficiency of SFLA in reducing project makespan and minimizing activity splitting number within an average CPU runtime, 0.521 second. This paper exposes all the scheduling sequences for each project and shows that of the 23 best known solutions have been improved.
    Type of Medium: Online Resource
    ISSN: 1110-757X , 1687-0042
    URL: Article
    DOI: 10.1155/2013/451090
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2013
    detail.hit.zdb_id: 2578385-3
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 5
    Online Resource
    Online Resource
    Finite and Infinite Arithmetic Progressions Related to Beta-Expansion
    Hindawi Limited ; 2014
    In:  Abstract and Applied Analysis Vol. 2014 ( 2014), p. 1-6
    Details
    In: Abstract and Applied Analysis, Hindawi Limited, Vol. 2014 ( 2014), p. 1-6
    Abstract: Let 1 〈 β 〈 2 and ε ( x , β ) be the β -expansion of x ∈ [ 0,1 ) . Denote by A β ( x ) the set of positions where the digit 1 appears in ε ( x , β ) . We consider the sets of points x such that A β ( x ) contains arbitrarily long arithmetic progressions and includes infinite arithmetic progressions, respectively. Their sizes are investigated from the topological, metric, and dimensional viewpoints.
    Type of Medium: Online Resource
    ISSN: 1085-3375 , 1687-0409
    URL: Article
    DOI: 10.1155/2014/678769
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2014
    detail.hit.zdb_id: 2064801-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 6
    Online Resource
    Online Resource
    Global Stability Analysis of a Nonautonomous Stage-Structured Competitive System with Toxic Effect and Double Maturation Delays
    Hindawi Limited ; 2014
    In:  Abstract and Applied Analysis Vol. 2014 ( 2014), p. 1-15
    Details
    In: Abstract and Applied Analysis, Hindawi Limited, Vol. 2014 ( 2014), p. 1-15
    Abstract: We investigate a nonautonomous two-species competitive system with stage structure and double time delays due to maturation for two species, where toxic effect of toxin liberating species on nontoxic species is considered and the inhibiting effect is zero in absence of either species. Positivity and boundedness of solutions are analytically studied. By utilizing some comparison arguments, an iterative technique is proposed to discuss permanence of the species within competitive system. Furthermore, existence of positive periodic solutions is investigated based on continuation theorem of coincidence degree theory. By constructing an appropriate Lyapunov functional, sufficient conditions for global stability of the unique positive periodic solution are analyzed. Numerical simulations are carried out to show consistency with theoretical analysis.
    Type of Medium: Online Resource
    ISSN: 1085-3375 , 1687-0409
    URL: Article
    DOI: 10.1155/2014/689573
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2014
    detail.hit.zdb_id: 2064801-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 7
    Online Resource
    Online Resource
    Classifying sufficiently connected PSC manifolds in 4 and 5 dimensions
    Mathematical Sciences Publishers ; 2023
    In:  Geometry & Topology Vol. 27, No. 4 ( 2023-6-15), p. 1635-1655
    Details
    In: Geometry & Topology, Mathematical Sciences Publishers, Vol. 27, No. 4 ( 2023-6-15), p. 1635-1655
    Type of Medium: Online Resource
    ISSN: 1364-0380 , 1465-3060
    URL: Issue
    URL: Journal
    URL: Article
    DOI: 10.2140/gt.2023.27:4
    DOI: 10.2140/gt
    DOI: 10.2140/gt.2023.27.1635
    Language: English
    Publisher: Mathematical Sciences Publishers
    Publication Date: 2023
    detail.hit.zdb_id: 1411579-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 8
    Online Resource
    Online Resource
    Stability of Exact and Discrete Energy for Non-Fickian Reaction-Diffusion Equations with a Variable Delay
    Hindawi Limited ; 2014
    In:  Abstract and Applied Analysis Vol. 2014 ( 2014), p. 1-9
    Details
    In: Abstract and Applied Analysis, Hindawi Limited, Vol. 2014 ( 2014), p. 1-9
    Abstract: This paper is concerned with the stability of non-Fickian reaction-diffusion equations with a variable delay. It is shown that the perturbation of the energy function of the continuous problems decays exponentially, which provides a more accurate and convenient way to express the rate of decay of energy. Then, we prove that the proposed numerical methods are sufficient to preserve energy stability of the continuous problems. We end the paper with some numerical experiments on a biological model to confirm the theoretical results.
    Type of Medium: Online Resource
    ISSN: 1085-3375 , 1687-0409
    URL: Article
    DOI: 10.1155/2014/840573
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2014
    detail.hit.zdb_id: 2064801-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 9
    Online Resource
    Online Resource
    Incremental Graph Regulated Nonnegative Matrix Factorization for Face Recognition
    Hindawi Limited ; 2014
    In:  Journal of Applied Mathematics Vol. 2014 ( 2014), p. 1-10
    Details
    In: Journal of Applied Mathematics, Hindawi Limited, Vol. 2014 ( 2014), p. 1-10
    Abstract: In a real world application, we seldom get all images at one time. Considering this case, if a company hired an employee, all his images information needs to be recorded into the system; if we rerun the face recognition algorithm, it will be time consuming. To address this problem, In this paper, firstly, we proposed a novel subspace incremental method called incremental graph regularized nonnegative matrix factorization (IGNMF) algorithm which imposes manifold into incremental nonnegative matrix factorization algorithm (INMF); thus, our new algorithm is able to preserve the geometric structure in the data under incremental study framework; secondly, considering we always get many face images belonging to one person or many different people as a batch, we improved our IGNMF algorithms to Batch-IGNMF algorithms (B-IGNMF), which implements incremental study in batches. Experiments show that (1) the recognition rate of our IGNMF and B-IGNMF algorithms is close to GNMF algorithm while it runs faster than GNMF. (2) The running times of our IGNMF and B-IGNMF algorithms are close to INMF while the recognition rate outperforms INMF. (3) Comparing with other popular NMF-based face recognition incremental algorithms, our IGNMF and B-IGNMF also outperform then both the recognition rate and the running time.
    Type of Medium: Online Resource
    ISSN: 1110-757X , 1687-0042
    URL: Article
    DOI: 10.1155/2014/928051
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2014
    detail.hit.zdb_id: 2578385-3
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 10
    Online Resource
    Online Resource
    An Adaptive Regulator for Space Teleoperation System in Task Space
    Hindawi Limited ; 2014
    In:  Abstract and Applied Analysis Vol. 2014 ( 2014), p. 1-7
    Details
    In: Abstract and Applied Analysis, Hindawi Limited, Vol. 2014 ( 2014), p. 1-7
    Abstract: The problem of the gravity information which can not be obtained in advance for bilateral teleoperation is studied. In outer space exploration, the gravity term changes with the position changing of the slave manipulator. So it is necessary to design an adaptive regulator controller to compensate for the unknown gravity signal. Moreover, to get a more accurate position tracking performance, the controller is designed in the task space instead of the joint space. Additionally, the time delay considered in this paper is not only time varying but also unsymmetrical. Finally, simulations are presented to show the effectiveness of the proposed approach.
    Type of Medium: Online Resource
    ISSN: 1085-3375 , 1687-0409
    URL: Article
    DOI: 10.1155/2014/501860
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2014
    detail.hit.zdb_id: 2064801-7
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...