Search Results
A boundary control problem for the pure Cahn–Hilliard equation with dynamic boundary conditions
A boundary control problem for the pure Cahn–Hilliard equations with possibly singular potentialsand dynamic boundary conditions is studied and rst-order necessary conditions for optimality are proved.
Analysis, simulation and prediction of multivariate random fields with package randomfields
Modeling of and inference on multivariate data that have been measured in space, such as temperature and pressure, are challenging tasks in environmental sciences, physics and materials science. We give an overview over and some background on modeling with crosscovariance models. The R package RandomFields supports the simulation, the parameter estimation and the prediction in particular for the linear model of coregionalization, the multivariate Matérn models, the delay model, and a spectrum of physically motivated vector valued models. An example on weather data is considered, illustrating the use of RandomFields for parameter estimation and prediction.
Effective Numerical Algorithm for Simulations of Beam Stabilization in Broad Area Semiconductor Lasers and Amplifiers
Abstract: A 2 + 1 dimensional PDE traveling wave model describing spatial-lateral dynamics of edge-emitting broad area semiconductor devices is considered. A numerical scheme based on a split-step Fourier method is presented. The domain decomposition method is used to parallelize the sequential algorithm. The parallel algorithm is implemented by using Message Passing Interface system, results of computational experiments are presented and the scalability of the algorithm is analyzed. Simulations of the model equations are used for optimizing of existing devices with respect to the emitted beam quality, as well as for creating and testing of novel device design concepts.
Algebraische Zahlentheorie
The workshop brought together leading experts in Algebraic Number Theory. The talks presented new methods and results that intertwine a multitude of topics ranging from classical diophantine themes to modern arithmetic geometry, modular forms and p-adic aspects in number theory.
Prevention and trust evaluation scheme based on interpersonal relationships for large-scale peer-to-peer networks
In recent years, the complex network as the frontier of complex system has received more and more attention. Peer-to-peer (P2P) networks with openness, anonymity, and dynamic nature are vulnerable and are easily attacked by peers with malicious behaviors. Building trusted relationships among peers in a large-scale distributed P2P system is a fundamental and challenging research topic. Based on interpersonal relationships among peers of large-scale P2P networks, we present prevention and trust evaluation scheme, called IRTrust. The framework incorporates a strategy of identity authentication and a global trust of peers to improve the ability of resisting the malicious behaviors. It uses the quality of service (QoS), quality of recommendation (QoR), and comprehensive risk factor to evaluate the trustworthiness of a peer, which is applicable for large-scale unstructured P2P networks. The proposed IRTrust can defend against several kinds of malicious attacks, such as simple malicious attacks, collusive attacks, strategic attacks, and sybil attacks. Our simulation results show that the proposed scheme provides greater accuracy and stronger resistance compared with existing global trust schemes. The proposed scheme has potential application in secure P2P network coding.
Topology identification of complex network via chaotic ant swarm algorithm
Nowadays, the topology of complex networks is essential in various fields as engineering, biology, physics, and other scientific fields. We know in some general cases that there may be some unknown structure parameters in a complex network. In order to identify those unknown structure parameters, a topology identification method is proposed based on a chaotic ant swarm algorithm in this paper. The problem of topology identification is converted into that of parameter optimization which can be solved by a chaotic ant algorithm. The proposed method enables us to identify the topology of the synchronization network effectively. Numerical simulations are also provided to show the effectiveness and feasibility of the proposed method.
Advanced Computational Engineering
The finite element method is the established simulation tool for the numerical solution of partial differential equations in many engineering problems with many mathematical developments such as mixed finite element methods (FEMs) and other nonstandard FEMs like least-squares, nonconforming, and discontinuous Galerkin (dG) FEMs. Various aspects on this plus related topics ranging from order-reduction methods to isogeometric analysis has been discussed amongst the pariticpants form mathematics and engineering for a large range of applications.
Canonical sets of best L1-approximation
In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are called canonical sets of best approximation. The present paper summarizes results on canonical sets of best L1-approximation with emphasis on multivariate interpolation and best L1-approximation by blending functions. The best L1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariate L 1-approximation by sums of univariate functions. Explicit constructions of best one-sided L1-approximants give rise to well-known and new inequalities.
A reconfigurable logic cell based on a simple dynamical system
This paper introduces a new scheme to achieve a dynamic logic gate which can be adjusted flexibly to obtain different logic functions by adjusting specific parameters of a dynamical system. Based on graphical tools and the threshold mechanism, the distribution of different logic gates is studied, and a transformation method between different logics is given. Analyzing the performance of the dynamical system in the presence of noise, we discover that it is resistant to system noise. Moreover, we find some part of the system can be considered as a leaky integrator which has been already widely applied in engineering. Finally, we provide a proof-of-principle hardware implementation of the proposed scheme to illustrate its effectiveness. With the proposed scheme in hand, it is convenient to build the flexible, robust, and general purpose computing devices such as various network coding routers, communication encoders or decoders, and reconfigurable computer chips.
Algebraic K-theory and Motivic Cohomology
Algebraic K-theory and motivic cohomology are strongly related tools providing a systematic way of producing invariants for algebraic or geometric structures. The definition and methods are taken from algebraic topology, but there have been particularly fruitful applications to problems of algebraic geometry, number theory or quadratic forms. 19 one-hour talks presented a wide range of latest results on the theory and its applications.