Zusammenfassung Man erh?lt kompakte Approximationen von Laplace-übergangsfunktionen, wenn die Koeffizienten des Nenners aus den Zeitkonstanten
des Systems abgeleitet werden. (üblicherweise führt dies auf das Problem der Nullstellensuche einer transzendenten Funktion.)
Es ist bekannt (Gough [1], Stephenson [2]), da? für die meisten W?nde drei Zeitkonstanten ausreichen, um hinreichend genaue
übergansfunktionen zu erhalten.
Die Taylor-Entwicklung der Kettenmatrix im Laplaceraum wird für beliebige W?nde mit eindimensionalem W?rmestrom mit der Picard'schen
Methode berechnet. Für ebene Mehrschichtw?nde ist dafür eine explizite L?sung angegeben.
Die ersten N Zeitkonstanten werden n?herungsweise aus der (N+1). Ordnung der Partial-Summe der Taylor-Entwicklung berechnet.
Dies wird mit einer generalisierten Pade-Approximation bewerkstelligt, die eine Totzeit enth?lt und direkt auf ein Nennerpolynom
führt (ohne transzendente Wurzeln). Die Wurzeln konvergieren geometrisch zu den Eigenwerten mit wachsendem N (die Eigenwerte
stellen die reziproken Zeitkonstanten dar). Die Komplexit?t der gesamten Prozedur liegt kaum über derjenigen für ein System
mit konzentrierten Parametern der Ordnung N+1. Es werden Beispiele angegeben, um mit den „exakten” Frequenzg?ngen zu vergleichen. 相似文献
The ears of lizards are highly directional. The directionality is generated by strong acoustical coupling of the eardrums.
A simple lumped-parameter model of the ear followed by binaural comparisons has been shown to perform successful phonotaxis
in robot implementations. However, such a model will produce localization errors in the form of response bias if the ears
are asymmetrical. We have evaluated how large errors are generated by asymmetry using simulations of the ear model in Mathematica
5.2. The study shows that the effect of asymmetry is minimal around the most directional frequency of the ear, but that biases
reduce the useful bandwidth of localization.
This work was presented in part at the First European Workshop on Artificial Life and Robotics, Vienna, Austria, July 12–13,
2007 相似文献
Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation. 相似文献
Resonance and wave-propagation problems are known to be highly sensitive towards parameter variations. This paper discusses topology optimization formulations for creating designs that perform robustly under spatial variations for acoustic cavity problems. For several structural problems, robust topology optimization methods have already proven their worth. However, it is shown that direct application of such methods is not suitable for the acoustic problem under consideration. A new double filter approach is suggested which makes robust optimization for spatial variations possible. Its effect and limitations are discussed. In addition, a known explicit penalization approach is considered for comparison. For near-uniform spatial variations it is shown that highly robust designs can be obtained using the double filter approach. It is finally demonstrated that taking non-uniform variations into account further improves the robustness of the designs. 相似文献
Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt. 相似文献
A group of users in Copenhagen were asked to evaluate how important a number of user interface characteristics were for them. The results show high importance of efficient daily use and of possibilities for exploratory learning while tutorial materials were of less importance. Users also were asked to evaluate four usability aspects of a number of popular programs. Results show that the quality pleasant to work with has the largest impact on evaluations of overall user‐friendliness while users seem able to view usability independently from the number of features in an application. 相似文献
The proposed European Artificial Intelligence Act (AIA) is the first attempt to elaborate a general legal framework for AI carried out by any major global economy. As such, the AIA is likely to become a point of reference in the larger discourse on how AI systems can (and should) be regulated. In this article, we describe and discuss the two primary enforcement mechanisms proposed in the AIA: the conformity assessments that providers of high-risk AI systems are expected to conduct, and the post-market monitoring plans that providers must establish to document the performance of high-risk AI systems throughout their lifetimes. We argue that the AIA can be interpreted as a proposal to establish a Europe-wide ecosystem for conducting AI auditing, albeit in other words. Our analysis offers two main contributions. First, by describing the enforcement mechanisms included in the AIA in terminology borrowed from existing literature on AI auditing, we help providers of AI systems understand how they can prove adherence to the requirements set out in the AIA in practice. Second, by examining the AIA from an auditing perspective, we seek to provide transferable lessons from previous research about how to refine further the regulatory approach outlined in the AIA. We conclude by highlighting seven aspects of the AIA where amendments (or simply clarifications) would be helpful. These include, above all, the need to translate vague concepts into verifiable criteria and to strengthen the institutional safeguards concerning conformity assessments based on internal checks.
Iterative Feedback Tuning constitutes an attractive control loop tuning method for processes in the absence of an accurate process model. It is a purely data driven approach aiming at optimizing the closed loop performance. The standard formulation ensures an unbiased estimate of the loop performance cost function gradient with respect to the control parameters. This gradient is important in a search algorithm. The extension presented in this paper further ensures informative data to improve the convergence properties of the method and hence reduce the total number of required plant experiments especially when tuning for disturbance rejection. Informative data is achieved through application of an external probing signal in the tuning algorithm. The probing signal is designed based on a constrained optimization which utilizes an approximate black box model of the process. This model estimate is further used to guarantee nominal stability and to improve the parameter update using a line search algorithm for determining the iteration step size. The proposed algorithm is compared to the classical formulation in a simulation study of a disturbance rejection problem. This type of problem is notoriously difficult for Iterative Feedback Tuning due to the lack of excitation from the reference. 相似文献