ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (23,604)
  • Mathematical Problems in Engineering  (9,060)
  • 38993
  • Mathematics  (23,604)
  • Economics
  • Physics
  • 1
    facet.materialart.
    Unknown
    An Integrated Decoupling Device for Azimuth Control of a Balloon-Borne Gondola (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Controlling and maintaining the orientation of the balloon-borne gondola for high-altitude flight is a prerequisite for ensuring the pointing control of observation instruments. When the balloon-borne gondola is flying in the stratosphere of the atmosphere, the existing external interferences will be converted into the coupling moment to the azimuth control system. Meanwhile, those uncertain factors and the frictional nonlinearity of the control system will also cause a certain magnitude of coupling moment. The existence of such coupling moment largely impacts on the accuracy and stability of the orientation control for the angular momentum exchange devices of the balloon-borne gondola. To address such an issue, this paper proposes and implements a novel type of integrated decoupler device. With this decoupler adopted, the aziDmuth control system could sense the existence of coupling torque and azimuth fluctuations quickly and suppress the influences of external interference, uncertain factors, and system structure nonlinearity on the azimuth control effectively, thereby improving the control accuracy of the azimuth control system. Both simulations and experiments are conducted to verify the effectiveness of the proposed device. The results show that the integration of the decoupler and the controller of the azimuth control system provide the azimuth control of the balloon-borne gondola with high accuracy and stability. Such a decoupler device design has a broad potential and could not only be used for balloon-borne gondola control but also could be applied onto other control systems using angular momentum exchange devices as actuators.
    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 ...
    PAPER CURRENT
  • 2
    facet.materialart.
    Unknown
    Continuous Time Formulation and Lagrangian Relaxation Algorithm for the Gate Assignment Problem (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Gates are important operating facilities and resources in civil airports. It is a core task in the airport operation management to select reasonable gates for inbound and outbound flights. We present a continuous time formulation with second-order cone programming (SOCP) for the gate assignment problem which allocates flights to available gates to optimize both the transfer time of passengers and the robustness of the airport operations schedules. The problem is formulated as a mixed integer nonlinear program, and then, the quadratic objective that minimizes the walking distance of transferring passengers is linearized, and the objective that minimizes the variance of idle time at the gates is transformed to a second-order cone constraint with a linear objective function. Then, a Lagrangian relaxation algorithm is developed by exploiting the problem structure. Computational tests are carried out to illustrate the efficiency of the model and the algorithms. It is shown that the continuous time formulation is more efficient than the existing model, and the Lagrangian relaxation algorithm can obtain better solutions faster than a commercial solver.
    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 ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    Certain Generating Relations Involving the Generalized Multi-Index Bessel–Maitland Function (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Generating relations involving the special functions have already proved their important role in mathematics and other fields of sciences. In this paper, we aim to provide some presumably new generating relations in connection with the generalized multi-index Bessel–Maitland function Jνjm,qλjm,γ.. The main results presented here, being very general, can yield a number of particular or equivalent identities, some of which are explicitly 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 ...
    PAPER CURRENT
  • 4
    facet.materialart.
    Unknown
    Electric Vehicle Routing Problems with Stochastic Demands and Dynamic Remedial Measures (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: With the rapid development of e-commerce, logistic enterprises must better predict customer demand to improve distribution efficiency, so as to deliver goods in advance, which makes logistics stochastic and dynamic. In order to deal with this challenge and respond to the concept of “green logistics,” an electric vehicle routing problem with stochastic demands (EVRPSD) and proactive remedial measures is investigated, and an EVRPSD model with probability constraints is established. At the same time, a hybrid heuristic algorithm, combining a saving method and an improved Tabu search algorithm, is proposed to solve the model. Moreover, two insertion strategies with the greedy algorithm for charging stations and dynamic nodes are introduced. Finally, a large number of experimental data show that the heuristic algorithm proposed in this paper is feasible and effective.
    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 ...
    PAPER CURRENT
  • 5
    facet.materialart.
    Unknown
    An Overview on Linear Unmixing of Hyperspectral Data (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Hyperspectral remote sensing technology has a strong capability for ground object detection due to the low spatial resolution of hyperspectral imaging spectrometers. A single pixel that leads to a hyperspectral remote sensing image usually contains more than one feature coverage type, resulting in a mixed pixel. The existence of a mixed pixel affects the accuracy of the ground object identification and classification and hinders the application and development of hyperspectral technology. For the problem of unmixing of mixed pixels in hyperspectral images (HSIs), the linear mixing model can model the mixed pixels well. Through the collation of nearly five years of the literature, this paper introduces the development status and problems of linear unmixing models from four aspects: geometric method, nonnegative matrix factorization (NMF), Bayesian method, and sparse unmixing.
    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 ...
    PAPER CURRENT
  • 6
    facet.materialart.
    Unknown
    Robust Object Tracking via Reverse Low-Rank Sparse Learning and Fractional-Order Variation Regularization (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Object tracking based on low-rank sparse learning usually makes the drift phenomenon occur when the target faces severe occlusion and fast motion. In this paper, we propose a novel tracking algorithm via reverse low-rank sparse learning and fractional-order variation regularization. Firstly, we utilize convex low-rank constraint to force the appearance similarity of the candidate particles, so as to prune the irrelevant particles. Secondly, fractional-order variation is introduced to constrain the sparse coefficient difference in the bounded variation space, which allows the difference between consecutive frames to exist, so as to adapt object fast motion. Meanwhile, fractional-order regularization can restrain severe occlusion by considering more adjacent frames information. Thirdly, we employ an inverse sparse representation method to model the relationship between target candidates and target template, which can reduce the computation complexity for online tracking. Finally, an online updating scheme based on alternating iteration is proposed for tracking computation. Experiments on benchmark sequences show that our algorithm outperforms several state-of-the-art methods, especially exhibiting better adaptability for fast motion and severe occlusion.
    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 ...
    PAPER CURRENT
  • 7
    facet.materialart.
    Unknown
    A Velocity-Combined Local Best Particle Swarm Optimization Algorithm for Nonlinear Equations (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Many people use traditional methods such as quasi-Newton method and Gauss–Newton-based BFGS to solve nonlinear equations. In this paper, we present an improved particle swarm optimization algorithm to solve nonlinear equations. The novel algorithm introduces the historical and local optimum information of particles to update a particle’s velocity. Five sets of typical nonlinear equations are employed to test the quality and reliability of the novel algorithm search comparing with the PSO algorithm. Numerical results show that the proposed method is effective for the given test problems. The new algorithm can be used as a new tool to solve nonlinear equations, continuous function optimization, etc., and the combinatorial optimization problem. The global convergence of the given method is established.
    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 ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    Study on Waste Type Identification Method Based on Bird Flock Neural Network (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: According to the waste type identification requirement in waste classification, a waste type identification method based on a bird flock neural network (BFNN) was proposed. The problem of obtaining the feature dataset of waste images was considered, and color histogram and texture feature extraction techniques were used. The local optimum problem of a typical backpropagation neural network (BPNN) was considered, and a bird flock optimization (BFO) algorithm was proposed. The accuracy problem of the typical BPNN was considered, and a new online weight adjustment method of neurons was proposed. The number of hidden layer neurons (nodes) of the typical BPNN was considered, and an online adjustment method was proposed. The experimental results show that the recyclables (paper, plastic, glass, and cloth) and nonrecyclables can effectively be identified by the waste type identification method based on the BFNN, and the recognition accuracy is 81% which meets actual needs.
    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 ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Multipopulation Genetic Algorithm Based on GPU for Solving TSP Problem (2020)
    Hindawi
    Details
    Publication Date: 2020-08-28
    Description: A GPU-based Multigroup Genetic Algorithm was proposed, which parallelized the traditional genetic algorithm with a coarse-grained architecture island model. The original population is divided into several subpopulations to simulate different living environments, thus increasing species richness. For each subpopulation, different mutation rates were adopted, and the crossover results were optimized by combining the crossover method based on distance. The adaptive mutation strategy based on the number of generations was adopted to prevent the algorithm from falling into the local optimal solution. An elite strategy was adopted for outstanding individuals to retain their superior genes. The algorithm was implemented with CUDA/C, combined with the powerful parallel computing capabilities of GPUs, which greatly improved the computing efficiency. It provided a new solution to the TSP problem.
    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 ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    A New Separable Piecewise Linear Learning Algorithm for the Stochastic Empty Container Repositioning Problem (2020)
    Hindawi
    Details
    Publication Date: 2020-08-28
    Description: A common challenge faced by liner operators in practice is to effectively allocate empty containers now in a way that minimizes the expectation of costs and reduces inefficiencies in the future with uncertainty. To incorporate uncertainties in the operational model, we formulate a two-stage stochastic programming model for the stochastic empty container repositioning (ECR) problem. This paper proposes a separable piecewise linear learning algorithm (SPELL) to approximate the expected cost function. The core of SPELL involves learning steps that provide information for updating the expected cost function adaptively through a sequence of piecewise linear separable approximations. Moreover, SPELL can utilize the network structure of the ECR problem and does not require any information about the distribution of the uncertain parameters. For the two-stage stochastic programs, we prove the convergence of SPELL. Computational results show that SPELL performs well in terms of operating costs. When the scale of the problem is very large and the dimensionality of the problem is increased, SPELL continues to provide consistent performance very efficiently and exhibits excellent convergence performance.
    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 ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...