Search

We present warp-canceling corotation, a nonlinear finite element formulation for elastodynamic simulation that achieves fast performance by making only partial or delayed changes to the simulation's linearized system matrices. Coupled with an algorithm for incremental updates to a sparse Cholesky factorization, the method realizes the stability and scalability of a sparse direct method without the need for expensive refactorization at each time step. This finite element formulation combines the widely used corotational method with stiffness warping so that changes in the per-element rotations are initially approximated by inexpensive per-node rotations. When the errors of this approximation grow too large, the per-element rotations are selectively corrected by updating parts of the matrix chosen according to locally measured errors. These changes to the system matrix are propagated to its Cholesky factor by incremental updates that are much faster than refactoring the matrix from scratch. A nested dissection ordering of the system matrix gives rise to a hierarchical factorization in which changes to the system matrix cause limited, well-structured changes to the Cholesky factor. We show examples of simulations that demonstrate that the proposed formulation produces results that are visually comparable to those produced by a standard corotational formulation. Because our method requires computing only partial updates of the Cholesky factor, it is substantially faster than full refactorization and outperforms widely used iterative methods such as preconditioned conjugate gradients. Our method supports a controlled trade-off between accuracy and speed, and unlike most iterative methods its performance does not slow for stiffer materials but rather it actually improves. © 2012 ACM.

We present warp-canceling corotation, a nonlinear finite element formulation for elastodynamic simulation that achieves fast performance by making only partial or delayed changes to the simulation's linearized system matrices. Coupled with an algorithm for incremental updates to a sparse Cholesky factorization, the method realizes the stability and scalability of a sparse direct method without the need for expensive refactorization at each time step. This finite element formulation combines the widely used corotational method with stiffness warping so that changes in the per-element rotations are initially approximated by inexpensive per-node rotations. When the errors of this approximation grow too large, the per-element rotations are selectively corrected by updating parts of the matrix chosen according to locally measured errors. These changes to the system matrix are propagated to its Cholesky factor by incremental updates that are much faster than refactoring the matrix from scratch. A nested dissection ordering of the system matrix gives rise to a hierarchical factorization in which changes to the system matrix cause limited, well-structured changes to the Cholesky factor. We show examples of simulations that demonstrate that the proposed formulation produces results that are visually comparable to those produced by a standard corotational formulation. Because our method requires computing only partial updates of the Cholesky factor, it is substantially faster than full refactorization and outperforms widely used iterative methods such as preconditioned conjugate gradients. Our method supports a controlled trade-off between accuracy and speed, and unlike most iterative methods its performance does not slow for stiffer materials but rather it actually improves. © 2012 ACM.

The motivation of this work is the detection of cerebrovascular accidents by microwave tomographic imaging. This requires the solution of an inverse problem relying on a minimization algorithm (for example, gradient-based), where successive iterations consist in repeated solutions of a direct problem. The reconstruction algorithm is extremely computationally intensive and makes use of efficient parallel algorithms and high-performance computing. The feasibility of this type of imaging is conditioned on one hand by an accurate reconstruction of the material properties of the propagation medium and on the other hand by a considerable reduction in simulation time. Fulfilling these two requirements will enable a very rapid and accurate diagnosis. From the mathematical and numerical point of view, this means solving Maxwell's equations in time-harmonic regime by appropriate domain decomposition methods, which are naturally adapted to parallel architectures.

Events during primary HIV-1 infection have been shown to be critical for the subsequent rate of disease progression. Early control of viral replication, resolution of clinical symptoms and development of a viral set point have been associated with the emergence of HIV-specific CD8 T cell responses. Here we assessed which particular HIV-specific CD8 T cell responses contribute to long-term control of HIV-1. A total of 620 individuals with primary HIV-1 infection were screened by gamma interferon (IFN-γ) enzyme-linked immunospot (ELISPOT) assay for HLA class I-restricted, epitope-specific CD8 T cell responses using optimally defined epitopes approximately 2 months after initial presentation. The cohort was predominantly male (97%) and Caucasian (83%) (Fiebig stages II/III [n = 157], IV [n = 64], V [n = 286], and VI [n = 88] and Fiebig stage not determined [n = 25]). Longitudinal viral loads, CD4 count, and time to ART were collected for all patients. We observed strong associations between viral load at baseline (initial viremia) and the established early viral set points (P<0.0001). Both were significantly associated with HLA class I genotypes (P = 0.0009). While neither the breadth nor the magnitude of HIV-specific CD8 T cell responses showed an influence on the early viral set point, a broader HIV-specific CD8 T cell response targeting epitopes within HIV-1 Gag during primary HIV-1 infection was associated with slower disease progression. Moreover, the induction of certain HIV-specific CD8 T cell responses-but not others-significantly influenced the time to ART initiation. Individual epitope-specific CD8 T cell responses contribute significantly to HIV-1 disease control, demonstrating that the specificity of the initial HIV-specific CD8 T cell response rather than the restricting HLA class I molecule alone is a critical determinant of antiviral function.

A target screening method using ultra high performance liquid chromatography-high resolution mass spectrometry (UPLC-HRMS) was developed. The method was applied to 14 groundwater and 11 surface water samples of a former wastewater infiltration site, where raw wastewater was applied until 1985 and treated wastewater is applied since 2005. The measured data are compared with mass spectrometric data of over 2000 organic micropollutants (OMPs), including pharmaceuticals, personal care products, pesticides, industrial chemicals and metabolites of these classes. A total number of 151 and 159 OMPs were detected in groundwater and surface water, respectively, of which 12 have not been reported before in these matrices. Among these 12 compounds were 11 pharmaceuticals and one personal care product. The identity of 55 of the detected OMPs (35%) was verified by analysis of standard compounds. Based on the distribution in the study area, two groups of OMPs were clearly distinguished: current OMPs introduced with treated municipal wastewater since 2005 and legacy OMPs originating from infiltration of untreated wastewater until 1985. A third group included OMPs contained in historic as well as in current wastewater. During infiltration, OMPs with molecular mass >500 g/mol and log DOW > 3.9 were preferentially removed. Speciation had a strong impact with cationic OMPs showing high, neutral OMPs medium and anionic OMPs lowest elimination during infiltration. This target screening method proved useful to study a wide range of compounds, even in retrospect and at sites with poorly documented history and with a complex and variable hydrological situation.

This paper describes a method for animating the appearance of clothing, such as pants or a shirt, that fits closely to a figure's body. Compared to flowing cloth, such as loose dresses or capes, these types of garments involve nearly continuous collision contact and small wrinkles, that can be troublesome for traditional cloth simulation methods. Based on the observation that the wrinkles in closefitting clothing behave in a predominantly kinematic fashion, we have developed an example-based wrinkle synthesis technique. Our method drives wrinkle generation from the pose of the figure's kinematic skeleton. This approach allows high quality clothing wrinkles to be combined with a coarse cloth simulation that computes the global and dynamic aspects of the clothing motion. While the combined results do not exactly match a high-resolution reference simulation, they do capture many of the characteristic fine-scale features and wrinkles. Further, the combined system runs at interactive rates, making it suitable for applications where high-resolution offline simulations would not be a viable option. The wrinkle synthesis method uses a precomputed database built by simulating the high-resolution clothing as the articulated figure is moved over a range of poses. In principle, the space of poses is exponential in the total number of degrees of freedom; however clothing wrinkles are primarily affected by the nearest joints, allowing each joint to be processed independently. During synthesis, mesh interpolation is used to consider the influence of multiple joints, and combined with a coarse simulation to produce the final results at interactive rates.

This paper describes a method for animating the appearance of clothing, such as pants or a shirt, that fits closely to a figure's body. Compared to flowing cloth, such as loose dresses or capes, these types of garments involve nearly continuous collision contact and small wrinkles, that can be troublesome for traditional cloth simulation methods. Based on the observation that the wrinkles in closefitting clothing behave in a predominantly kinematic fashion, we have developed an example-based wrinkle synthesis technique. Our method drives wrinkle generation from the pose of the figure's kinematic skeleton. This approach allows high quality clothing wrinkles to be combined with a coarse cloth simulation that computes the global and dynamic aspects of the clothing motion. While the combined results do not exactly match a high-resolution reference simulation, they do capture many of the characteristic fine-scale features and wrinkles. Further, the combined system runs at interactive rates, making it suitable for applications where high-resolution offline simulations would not be a viable option. The wrinkle synthesis method uses a precomputed database built by simulating the high-resolution clothing as the articulated figure is moved over a range of poses. In principle, the space of poses is exponential in the total number of degrees of freedom; however clothing wrinkles are primarily affected by the nearest joints, allowing each joint to be processed independently. During synthesis, mesh interpolation is used to consider the influence of multiple joints, and combined with a coarse simulation to produce the final results at interactive rates.

Whilst SAML-based federations are most often used by academic and semi-commercial institutions that focus only on attribute-based authentication, we foresee a growing interest for service providers providing charged services. Since more and more academic and semi-commercial federation participants offer Voice-over-IP (VoIP) services, this type of service provides an entry point into identity federation based payment. Therefore, this paper describes an approach on how to harmonize the SAML-based federation technology with the needs of a payment infrastructure for enabling charging of VoIP services within a federation. However, since the different aspects of our approach (SAML Payment, SIP Discovery and Tariff Function) are not bound to VoIP applications, each one of them could be used separately or combined for several service types.

Peer-to-peer (P2P) systems achieve scalability, fault tolerance, and load balancing, while effectively reducing infrastructure cost compared to client/server systems. For large wiki-based collaboration systems these characteristics can be beneficial as well. However, a fully decentralized P2P-based collaboration system requires appropriate incentives for users to (a) contribute resources for storing and providing documents, and (b) to participate in collaborative control mechanisms for keeping content quality at a high level. Therefore, this position paper proposes a score-based incentive scheme for voting-based quality control and document storage in a P2P-based collaboration system. The approach is based on the PeerVote mechanism, which enables users to vote on content modifications. In order to encourage peers to store and vote on documents, each peer is assigned a score related to its contribution. Peers have an incentive to achieve a high score, as only this allows them to create and approve new documents. The proposed scheme is resistant to fraud, since the score of a peer can be verified by any other peer.

In informal data sharing environments, misspellings cause problems for data indexing and retrieval. This is even more pronounced in mobile environments, in which devices with limited input devices are used. In a mobile environment, similarity search algorithms for finding misspelled data need to account for limited CPU and bandwidth. This demo shows P2P fast similarity search (P2PFastSS) running on mobile phones and laptops that is tailored to uncertain data entry and uses available resources efficiently. In this demo, users publish and search for textual content containing misspellings without relying on query logging, as done by Google, and with a minimum distributed indexing infrastructure. Similarity search is supported by using the concept of deletion neighborhood to evaluate the edit distance metric of string similarity.

The increasing assortment of devices with IP connectivity contributes to the high popularity of video sharing over the Internet. High traffic generated by such applications at the source can be better distributed using a peer-to-peer overlay, since every user forwards information to other users. Current implementations target either live or on demand video streaming. LiveShift is an application that combines both approaches. While video is transmitted through the peer-to-peer network in a live fashion, all peers participate in a distributed storage. This adds ability to replay time-shifted streams from other peers in a distributed and scalable manner. For the demonstration, a decentralized network is used, with peers running on EMANICSLab nodes and notebook computers.

Fully decentralized peer-to-peer (P2P) systems do not have a central control mechanism. Thus, different forms of control mechanisms are required to deal with selfish peers. One type of selfish behavior is the consumption of resources without providing sufficient resources. Therefore, incentive schemes encourage peers to share resources while punishing selfish peers. A well-known example of an incentive scheme is Tit-for-Tat (TFT), as used in BitTorrent. With this scheme, a peer can only consume as much resources as it provides. TFT is resilient to collusion due to relying on private histories only. However, TFT can only be applied to peers with direct reciprocity. This paper presents a private and shared history (PSH) based incentive mechanism, which supports transitive relations (indirect reciprocity). Furthermore, it is resilient to collusion and it combines private and shared histories in an efficient manner. The PSH approach uses a shared history for identifying transitive relations. Those relations are verified using private histories. Simulations show that the PSH mechanism has a higher transaction success ratio than TFT.

SCOPUS: ar.j, info:eu-repo/semantics/published

SCOPUS: ar.j, info:eu-repo/semantics/published

SCOPUS: ar.j, info:eu-repo/semantics/published

SCOPUS: ar.j, info:eu-repo/semantics/published

Appartient à l’ensemble documentaire : IconMUS1, Appartient à l’ensemble documentaire : IconMUSNum, Appartient à l’ensemble documentaire : IconMUS0

von Johann Töbing/ Archid. und Prediger daselbst, Schlüsselseiten aus dem Exemplar der ULB Halle: an Pon IIn 9457 (2), Signaturformel: A - K4

von Johann Töbing/ Archid. und Prediger daselbst, Schlüsselseiten aus dem Exemplar der ULB Halle: an Pon IIn 9457 (2), Signaturformel: A - K4