![]() ; ; Schulz, André ![]() in Widmann, A.; Andersen, S. K.; Friederici, A. D. (Eds.) et al 35. Arbeitstagung Psychophysiologie und Methodik (2009) Detailed reference viewed: 54 (0 UL)![]() ; Merkulov, Sergei ![]() in Journal of Pure and Applied Algebra (2009), 213(4), 496-535 We introduce and study wheeled PROPs, an extension of the theory of PROPs which can treat traces and, in particular, solutions to the master equations which involve divergence operators. We construct a dg ... [more ▼] We introduce and study wheeled PROPs, an extension of the theory of PROPs which can treat traces and, in particular, solutions to the master equations which involve divergence operators. We construct a dg free wheeled PROP whose representations are in one-to-one correspondence with formal germs of SP-manifolds, key geometric objects in the theory of Batalin–Vilkovisky quantization. We also construct minimal wheeled resolutions of classical operads Com and Ass as non-trivial extensions of the well-known dg operads Com-infinityand Ass-infinity source. Finally, we apply the above results to a computation of cohomology of a directed version of Kontsevich’s complex of ribbon graphs. [less ▲] Detailed reference viewed: 142 (4 UL)![]() Rosich, Albert ![]() in 20th International Workshop on Principles of Diagnosis (2009) This work is devoted to find an optimal set of sensors for model-based FDI. The novelty is that linary integer linear programming is used in the optimization problem, leading to a formulation of the ... [more ▼] This work is devoted to find an optimal set of sensors for model-based FDI. The novelty is that linary integer linear programming is used in the optimization problem, leading to a formulation of the detectability and isolability specifications as linear inequality constraints. Furthermore, a very detailed system model is not needed since the methodology handles structural models. The approach has been successfully applied to a two-tank system, as an illustrative example. [less ▲] Detailed reference viewed: 184 (3 UL)![]() ; Kolodkin, Alexey ![]() in Journal of Mathematical Biology (2009), 58(1-2), 7-34 Systems Biology is the science that aims to understand how biological function absent from macromolecules in isolation, arises when they are components of their system. Dedicated to the memory of Reinhart ... [more ▼] Systems Biology is the science that aims to understand how biological function absent from macromolecules in isolation, arises when they are components of their system. Dedicated to the memory of Reinhart Heinrich, this paper discusses the origin and evolution of the new part of systems biology that relates to metabolic and signal-transduction pathways and extends mathematical biology so as to address postgenomic experimental reality. Various approaches to modeling the dynamics generated by metabolic and signal-transduction pathways are compared. The silicon cell approach aims to describe the intracellular network of interest precisely, by numerically integrating the precise rate equations that characterize the ways macromolecules' interact with each other. The non-equilibrium thermodynamic or 'lin-log' approach approximates the enzyme rate equations in terms of linear functions of the logarithms of the concentrations. Biochemical Systems Analysis approximates in terms of power laws. Importantly all these approaches link system behavior to molecular interaction properties. The latter two do this less precisely but enable analytical solutions. By limiting the questions asked, to optimal flux patterns, or to control of fluxes and concentrations around the (patho)physiological state, Flux Balance Analysis and Metabolic/Hierarchical Control Analysis again enable analytical solutions. Both the silicon cell approach and Metabolic/Hierarchical Control Analysis are able to highlight where and how system function derives from molecular interactions. The latter approach has also discovered a set of fundamental principles underlying the control of biological systems. The new law that relates concentration control to control by time is illustrated for an important signal transduction pathway, i.e. nuclear hormone receptor signaling such as relevant to bone formation. It is envisaged that there is much more Mathematical Biology to be discovered in the area between molecules and Life. [less ▲] Detailed reference viewed: 110 (3 UL)![]() ; Ottersten, Björn ![]() in Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on (2009) The symbol error performance of spatially correlated multi-antenna systems is analyzed herein. When the transmitter only has statistical channel information, the use of space-time block codes still ... [more ▼] The symbol error performance of spatially correlated multi-antenna systems is analyzed herein. When the transmitter only has statistical channel information, the use of space-time block codes still permits spatial multiplexing and mitigation of fading. The statistical information can be used for precoding to optimize some quality measure. Herein, we analyze the performance in terms of the symbol error rate (SER). It is shown analytically that spatial correlation at the receiver decreases the performance both without precoding and with an SER minimizing precoder. Without precoding, correlation should also be avoided at the transmitter side, but with an SER minimizing precoder the performance is actually improved by increasing spatial correlation at the transmitter. The structure of the optimized precoder is analyzed and the asymptotic properties at high and low SNRs are characterized and illustrated numerically. [less ▲] Detailed reference viewed: 159 (0 UL)![]() ; Ottersten, Björn ![]() in Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on (2009) Cooperative precoding is an attractive way of improving the performance in multicell downlink scenarios. By serving each terminal through multiple surrounding base stations, inter-cell interference can be ... [more ▼] Cooperative precoding is an attractive way of improving the performance in multicell downlink scenarios. By serving each terminal through multiple surrounding base stations, inter-cell interference can be coordinated and higher spectral efficiency achieved, especially for terminals at cell edges. The optimal performance of multicell precoding is well-known as it can be treated as a single cell with distributed antennas. However, the requirements on backhaul signaling and computational power scales rapidly in large and dense networks, which often makes such fully centralized approaches impractical. In this paper, we review and generalize some recent work on multicell precoding with both centralized and distributed cooperation. We propose practical precoding strategies under Rician channel conditions, and illustrate how the major gain of multicell precoding originates from having good base station synchronization and not from making centralized precoding decisions. [less ▲] Detailed reference viewed: 146 (0 UL)![]() Biesta, Gert ![]() in Complicity: An International Journal of Complexity and Education (2009), 6(1), 28-33 Detailed reference viewed: 67 (1 UL)![]() ; Schulz, André ![]() in Widmann, A.; Andersen, S. K.; Friederici, A. D. (Eds.) et al 35. Arbeitstagung Psychophysiologie und Methodik (2009) Detailed reference viewed: 57 (0 UL)![]() Michels, Tom ![]() ![]() Scientific Conference (2009) Detailed reference viewed: 38 (0 UL)![]() Caire, Patrice ![]() ![]() in Social Networks and Multiagent Systems symposium; Artificial Intelligence and Simulation of Behaviour, AISB, April 6-9, 2009 at the Heriot-Watt University, Edinburgh (Scotland). (2009) Detailed reference viewed: 72 (0 UL)![]() Mein, Georg ![]() in Geisenhanslüke, Achim; Mein, Georg (Eds.) Monströse Ordnungen. Zur Typologie und Ästhetik des Anormalen (2009) Detailed reference viewed: 113 (1 UL)![]() Ziegler, Gudrun ![]() in SemLang (2009) Ce document constitue une synthèse des enseignements tirés de l’Université d’été SemLang (Sèvres, 6-10 juillet 2009). Il présente les grandes lignes du projet, la méthodologie utilisée, et propose une ... [more ▼] Ce document constitue une synthèse des enseignements tirés de l’Université d’été SemLang (Sèvres, 6-10 juillet 2009). Il présente les grandes lignes du projet, la méthodologie utilisée, et propose une série de recommandations. Celles-ci sont fondées sur les conclusions des conférences et des ateliers, sur l’interaction entre les participants, ainsi que sur le rapport analytique créé par le consortium. [less ▲] Detailed reference viewed: 48 (0 UL)![]() ; Schulz, André ![]() in Widmann, A.; Andersen, S. K.; Friederici, A. D. (Eds.) et al 35. Arbeitstagung Psychophysiologie und Methodik (2009) Detailed reference viewed: 54 (0 UL)![]() Biryukov, Alex ![]() ![]() in ASIACRYPT 2009 (2009) In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 2^99.5 time and data complexity, while the recent ... [more ▼] In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 2^99.5 time and data complexity, while the recent attack by Biryukov-Khovratovich-Nikolic works for a weak key class and has much higher complexity. The second attack is the first cryptanalysis of the full AES-192. Both our attacks are boomerang attacks, which are based on the recent idea of finding local collisions in block ciphers and enhanced with the boomerang switching techniques to gain free rounds in the middle. [less ▲] Detailed reference viewed: 208 (2 UL)![]() Chatzinotas, Symeon ![]() in IWCMC 2009 (2009) Detailed reference viewed: 92 (0 UL)![]() Gabbay, Dov M. ![]() in Review of Symbolic Logic (2009) Detailed reference viewed: 30 (0 UL)![]() ; ; Nikolic, Ivica ![]() in Advances in Cryptology - ASIACRYPT 2009 (2009) In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 ... [more ▼] In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 296 compression function evaluations and 2^{88} memory, and for full Lane-512 with 2^{224} compression function evaluations and 2^{128} memory. [less ▲] Detailed reference viewed: 120 (0 UL)![]() Biesta, Gert ![]() in Education, Citizenship and Social Justice [=ECSJ] (2009), 4(1), 5-24 Detailed reference viewed: 79 (0 UL)![]() ![]() Guillaume, Mathieu ![]() Poster (2009) Detailed reference viewed: 62 (1 UL)![]() ![]() Hansen, Joachim ![]() Scientific Conference (2009) Detailed reference viewed: 48 (2 UL) |
||