### Refine

#### Year of publication

- 1999 (73) (remove)

#### Document Type

- Article (73) (remove)

#### Has Fulltext

- yes (73) (remove)

#### Keywords

- AG-RESY (6)
- HANDFLEX (5)
- PARO (5)
- Network Protocols (2)
- Requirements/Specifications (2)
- Wannier-Stark systems (2)
- entropy (2)
- localization (2)
- quantum mechanics (2)
- resonances (2)
- theorem proving (2)
- 90° orientation (1)
- Ablagestruktur (1)
- Access System (1)
- Ad-hoc workflow (1)
- Adaption (1)
- Banach lattice (1)
- Case Study Erfahrungsdatenbank (1)
- Case-Based Reasoning (1)
- Classification Tasks (1)
- Computer supported cooperative work (1)
- Curie temperature (1)
- Distributed Multimedia Applications (1)
- Experience Base (1)
- Experience Database (1)
- Experiment (1)
- Extensibility (1)
- Fallstu (1)
- Ferromagnetism (1)
- Filter-Diagonalization (1)
- Generic Methods (1)
- Global Software Highway (1)
- HTML (1)
- Hardy space (1)
- INRECA (1)
- Interacting Magnetic Dots and Wires (1)
- Java (1)
- Language Constructs (1)
- MHEG (1)
- Mn-Si-C alloy films (1)
- Object-Relational DataBase Management Systems (ORDBMS) (1)
- Object-Relational Database Systems (1)
- Partial functions (1)
- Pullen Edmonds system (1)
- Quality Improvement Paradigm (QIP) (1)
- Quantum Chaos (1)
- Quantum mechanics (1)
- Repositories (1)
- Reuse (1)
- SDL-pattern a (1)
- SKALP (1)
- SQUID magnetometry (1)
- Sandercock-type multipath tandem Fabry-Perot interferometer (1)
- Scalar type operator (1)
- Software Engineering (1)
- Software development environment (1)
- Stark systems (1)
- Structural Adaptation (1)
- Structure (1)
- Structuring Approach (1)
- Vector-valued holomorphic function (1)
- Wannier-Bloch states (1)
- World Wide Web (1)
- World-Wide Web (1)
- Zugriffstruktur (1)
- Zugriffsystem (1)
- abstract description (1)
- analogical reasoning (1)
- analogy (1)
- anisotropic coupling mechanism (1)
- bcc-Fe(001) (1)
- biquadratic interlayer coupling (1)
- brillouin light scattering (1)
- chaotic dynamics (1)
- completeness (1)
- complex energ (1)
- complex energy resonances (1)
- comprehensive reuse (1)
- computer control (1)
- conservative extension (1)
- consistency (1)
- critical thickness (1)
- cross-correlation (1)
- dependency management (1)
- deposition temperature (1)
- dipole-exchange surface (1)
- dynamical systems (1)
- epitaxial growth (1)
- evolutionary spectrum (1)
- exchange-coupled rare-earth (1)
- flexible workflows (1)
- frames (1)
- function of bounded variation (1)
- higher order logic (1)
- hybrid knowledge representation (1)
- layered magnetic systems (1)
- lifetime statistics (1)
- lifetimes (1)
- locally stationary process (1)
- magnetization reversal process (1)
- magneto-optical Kerr effect (1)
- many-valued logic (1)
- mathematical concept (1)
- metastable Pd(001) (1)
- minimax rate (1)
- morphism (1)
- motion planning (1)
- nonlinear wavelet thresholding (1)
- numerical computation (1)
- patterned magnetic permalloy films (1)
- phase space (1)
- phase-space (1)
- problem formulation (1)
- project coordination (1)
- proof plans (1)
- qauntum mechanis (1)
- quasienergy (1)
- resolution (1)
- reuse repositories (1)
- search algorithms (1)
- second order logic (1)
- short-time periodogram (1)
- shortest sequence (1)
- sorted logic (1)
- soundness (1)
- spinwaves (1)
- structured permalloy films (1)
- tableau (1)
- tactics (1)
- temperature dependence (1)
- traceability (1)
- transition-metal (1)
- translation (1)
- traveling salesman problem (1)
- triple layer stacks (1)
- typical instance (1)
- vector measure (1)
- wall energy (1)
- wall thickness (1)

#### Faculty / Organisational entity

We consider wavelet estimation of the time-dependent (evolutionary) power spectrum of a locally stationary time series. Allowing for departures from stationary proves useful for modelling, e.g., transient phenomena, quasi-oscillating behaviour or spectrum modulation. In our work wavelets are used to provide an adaptive local smoothing of a short-time periodogram in the time-freqeuncy plane. For this, in contrast to classical nonparametric (linear) approaches we use nonlinear thresholding of the empirical wavelet coefficients of the evolutionary spectrum. We show how these techniques allow for both adaptively reconstructing the local structure in the time-frequency plane and for denoising the resulting estimates. To this end a threshold choice is derived which is motivated by minimax properties w.r.t. the integrated mean squared error. Our approach is based on a 2-d orthogonal wavelet transform modified by using a cardinal Lagrange interpolation function on the finest scale. As an example, we apply our procedure to a time-varying spectrum motivated from mobile radio propagation.

Wall energy and wall thickness of exchange-coupled rare-earth transition-metal triple layer stacks
(1999)

The room-temperature wall energy sw 54.0310 23 J/m 2 of an exchange-coupled Tb 19.6 Fe 74.7 Co 5.7 /Dy 28.5 Fe 43.2 Co 28.3 double layer stack can be reduced by introducing a soft magnetic intermediate layer in between both layers exhibiting a significantly smaller anisotropy compared to Tb+- FeCo and Dy+- FeCo. sw will decrease linearly with increasing intermediate layer thickness, d IL , until the wall is completely located within the intermediate layer for d IL d w , where d w denotes the wall thickness. Thus, d w can be obtained from the plot sw versus d IL .We determined sw and d w on Gd+- FeCo intermediate layers with different anisotropy behavior ~perpendicular and in-plane easy axis! and compared the results with data obtained from Brillouin light-scattering measurements, where exchange stiffness, A, and uniaxial anisotropy, K u , could be determined. With the knowledge of A and K u , wall energy and thickness were calculated and showed an excellent agreement with the magnetic measurements. A ten times smaller perpendicular anisotropy of Gd 28.1 Fe 71.9 in comparison to Tb+- FeCo and Dy+- FeCo resulted in a much smaller sw 51.1310 23 J/m 2 and d w 524 nm at 300 K. A Gd 34.1 Fe 61.4 Co 4.5 with in-plane anisotropy at room temperature showed a further reduced sw 50.3310 23 J/m 2 and d w 517 nm. The smaller wall energy was a result of a different wall structure compared to perpendicular layers.

Typical instances, that is, instances that are representative for a particular situ-ation or concept, play an important role in human knowledge representationand reasoning, in particular in analogical reasoning. This wellADknown obser-vation has been a motivation for investigations in cognitive psychology whichprovide a basis for our characterization of typical instances within conceptstructures and for a new inference rule for justified analogical reasoning withtypical instances. In a nutshell this paper suggests to augment the proposi-tional knowledge representation system by a non-propositional part consistingof concept structures which may have directly represented instances as ele-ments. The traditional reasoning system is extended by a rule for justifiedanalogical inference with typical instances using information extracted fromboth knowledge representation subsystems.

Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
(1999)

We develop an order-sorted higher-order calculus suitable forautomatic theorem proving applications by extending the extensional simplytyped lambda calculus with a higher-order ordered sort concept and constantoverloading. Huet's well-known techniques for unifying simply typed lambdaterms are generalized to arrive at a complete transformation-based unificationalgorithm for this sorted calculus. Consideration of an order-sorted logicwith functional base sorts and arbitrary term declarations was originallyproposed by the second author in a 1991 paper; we give here a correctedcalculus which supports constant rather than arbitrary term declarations, aswell as a corrected unification algorithm, and prove in this setting resultscorresponding to those claimed there.

The following two norms for holomorphic functions \(F\), defined on the right complex half-plane \(\{z \in C:\Re(z)\gt 0\}\) with values in a Banach space \(X\), are equivalent:
\[\begin{eqnarray*} \lVert F \rVert _{H_p(C_+)} &=& \sup_{a\gt0}\left( \int_{-\infty}^\infty \lVert F(a+ib) \rVert ^p \ db \right)^{1/p}
\mbox{, and} \\ \lVert F \rVert_{H_p(\Sigma_{\pi/2})} &=& \sup_{\lvert \theta \lvert \lt \pi/2}\left( \int_0^\infty \left \lVert F(re^{i \theta}) \right \rVert ^p\ dr \right)^{1/p}.\end{eqnarray*}\] As a consequence, we derive a description of boundary values ofsectorial holomorphic functions, and a theorem of Paley-Wiener typefor sectorial holomorphic functions.

Most automated theorem provers suffer from the problemthat the resulting proofs are difficult to understand even for experiencedmathematicians. An effective communication between the system andits users, however, is crucial for many applications, such as in a mathematical assistant system. Therefore, efforts have been made to transformmachine generated proofs (e.g. resolution proofs) into natural deduction(ND) proofs. The state-of-the-art procedure of proof transformation fol-lows basically its completeness proof: the premises and the conclusionare decomposed into unit literals, then the theorem is derived by mul-tiple levels of proofs by contradiction. Indeterminism is introduced byheuristics that aim at the production of more elegant results. This inde-terministic character entails not only a complex search, but also leads tounpredictable results.In this paper we first study resolution proofs in terms of meaningful op-erations employed by human mathematicians, and thereby establish acorrespondence between resolution proofs and ND proofs at a more ab-stract level. Concretely, we show that if its unit initial clauses are CNFsof literal premises of a problem, a unit resolution corresponds directly toa well-structured ND proof segment that mathematicians intuitively un-derstand as the application of a definition or a theorem. The consequenceis twofold: First it enhances our intuitive understanding of resolutionproofs in terms of the vocabulary with which mathematicians talk aboutproofs. Second, the transformation process is now largely deterministicand therefore efficient. This determinism also guarantees the quality ofresulting proofs.

Using an experience factory is one possible concept for supporting and improving reuse in software development. (i.e., reuse of products, processes, quality models, ...). In the context of the Sonderforschungsbereich 501: "Development of Large Systems with Generic methods" (SFB501), the Software Engineering Laboratory (SE Lab) runs such an experience factory as part of the infrastructure services it offers. The SE Lab also provides several tools to support the planning, developing, measuring, and analyzing activities of software development processes. Among these tools, the SE Lab runs and maintains an experience base, the SFB-EB. When an experience factory is utilized, support for experience base maintenance is an important issue. Furthermore, it might be interesting to evaluate experience base usage with regard to the number of accesses to certain experience elements stored in the database. The same holds for the usage of the tools provided by the SE LAB. This report presents a set of supporting tools that were designed to aid in these tasks. These supporting tools check the experience base's consistency and gather information on the usage of SFB-EB and the tools installed in the SE Lab. The results are processed periodically and displayed as HTML result reports (consistency checking) or bar charts (usage profiles).

Comprehensive reuse and systematic evolution of reuse artifacts as proposed by the Quality Improvement Paradigm (QIP) do not only require tool support for mere storage and retrieval. Rather, an integrated management of (potentially reusable) experience data as well as project-related data is needed. This paper presents an approach exploiting object-relational database technology to implement the QIP-driven reuse repository of the SFB 501. Requirements, concepts, and implementational aspects are discussed and illustrated through a running example, namely the reuse and continuous improvement of SDL patterns for developing distributed systems. Based on this discussion, we argue that object-relational database management systems (ORDBMS) are best suited to implement such a comprehensive reuse repository. It is demonstrated how this technology can be used to support all phases of a reuse process and the accompanying improvement cycle. Although the discussions of this paper are strongly related to the requirements of the SFB 501 experience base, the basic realization concepts, and, thereby, the applicability of ORDBMS, can easily be extended to similar applications, i. e., reuse repositories in general.