A demonstration case on the derivation of process-level logical architectures for ambient assisted living ecosystems

When representing the requirements for an intended software solution during the development process, a logical architecture is a model that provides an organized vision of how functionalities behave regardless of the technologies to be implemented. If the logical architecture represents an ambient assisted living (AAL) ecosystem, such representation is a complex task due to the existence of interrelated multidomains, which, most of the time, results in incomplete and incoherent user requirements. In this chap- ter, we present the results obtained when applying process-level modeling techniques to the derivation of the logical architecture for a real industrial AAL project. We adopt a V-Model–based approach that expresses the AAL requirements in a process-level perspec- tive, instead of the traditional product-level view. Additionally, we ensure compliance of the derived logical architecture with the National Institute of Standards and Technology (NIST) reference architecture as nonfunctional requirements to support the implementa- tion of the AAL architecture in cloud contexts.

High strain rate constitutive modeling forhistorical structures subjected to blast loading

Doctoral Thesis Civil Engineering

Singularities of the dynamical structure factors of the spin-1/2 XXX chain at finite magnetic field

We study the longitudinal and transverse spin dynamical structure factors of the spin-1/2 XXX chain at finite magnetic field h, focusing in particular on the singularities at excitation energies in the vicinity of the lower thresholds. While the static properties of the model can be studied within a Fermi-liquid like description in terms of pseudoparticles, our derivation of the dynamical properties relies on the introduction of a form of the ‘pseudofermion dynamical theory’ (PDT) of the 1D Hubbard model suitably modified for the spin-only XXX chain and other models with two pseudoparticle Fermi points. Specifically, we derive the exact momentum and spin-density dependences of the exponents ζτ(k) controlling the singularities for both the longitudinal  and transverse (τ = t) dynamical structure factors for the whole momentum range  , in the thermodynamic limit. This requires the numerical solution of the integral equations that define the phase shifts in these exponents expressions. We discuss the relation to neutron scattering and suggest new experiments on spin-chain compounds using a carefully oriented crystal to test our predictions.

Vanishing spin stiffness in the spin-1/2 Heisenberg chain for any nonzero temperature

Whether at the zero spin density m = 0 and finite temperatures T > 0 the spin stiffness of the spin-1/2 XXX chain is finite or vanishes remains an unsolved and controversial issue, as different approaches yield contradictory results. Here we explicitly compute the stiffness at m = 0 and find strong evidence that it vanishes. In particular, we derive an upper bound on the stiffness within a canonical ensemble at any fixed value of spin density m that is proportional to m2L in the thermodynamic limit of chain length L → ∞, for any finite, nonzero temperature, which implies the absence of ballistic transport for T > 0 for m = 0. Although our method relies in part on the thermodynamic Bethe ansatz (TBA), it does not evaluate the stiffness through the second derivative of the TBA energy eigenvalues relative to a uniform vector potential. Moreover, we provide strong evidence that in the thermodynamic limit the upper bounds on the spin current and stiffness used in our derivation remain valid under string deviations. Our results also provide strong evidence that in the thermodynamic limit the TBA method used by X. Zotos [Phys. Rev. Lett. 82, 1764 (1999)] leads to the exact stiffness values at finite temperature T > 0 for models whose stiffness is finite at T = 0, similar to the spin stiffness of the spin-1/2 Heisenberg chain but unlike the charge stiffness of the half-filled 1D Hubbard model.

Metaphorisms in programming

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.