New rr-Matrices for Lie Bialgebra Structures over Polynomials

For a finite dimensional simple complex Lie algebra $\mathfrak{g}$, Lie bialgebra structures on $\mathfrak{g}[[u]]$ and $\mathfrak{g}[u]$ were classified by Montaner, Stolin and Zelmanov. In our paper, we provide an explicit algorithm to produce $r$-matrices which correspond to Lie bialgebra structures over polynomials

Classification of quantum groups and Belavin--Drinfeld cohomologies for orthogonal and symplectic Lie algebras

In this paper we continue to study Belavin-Drinfeld cohomology introduced in arXiv:1303.4046 [math.QA] and related to the classification of quantum groups whose quasi-classical limit is a given simple complex Lie algebra. Here we compute Belavin-Drinfeld cohomology for all non-skewsymmetric $r$-matrices from the Belavin-Drinfeld list for simple Lie algebras of type $B$, $C$, and $D$.Comment: 17 page

Avalanche-Induced Current Enhancement in Semiconducting Carbon Nanotubes

Semiconducting carbon nanotubes under high electric field stress (~10 V/um) display a striking, exponential current increase due to avalanche generation of free electrons and holes. Unlike in other materials, the avalanche process in such 1D quantum wires involves access to the third sub-band, is insensitive to temperature, but strongly dependent on diameter ~exp(-1/d^2). Comparison with a theoretical model yields a novel approach to obtain the inelastic optical phonon emission length, L_OP,ems ~ 15d nm. The combined results underscore the importance of multi-band transport in 1D molecular wires

Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems

We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, but also in terms of communication protocols and scheduling policies. When several scheduling policies share a resource, they are organised in a hierarchy. In this paper, we first develop a holistic scheduling and schedulability analysis that determines the timing properties of a hierarchically scheduled system. Second, we address design problems that are characteristic to such hierarchically scheduled systems: assignment of scheduling policies to tasks, mapping of tasks to hardware components, and the scheduling of the activities. We also present several algorithms for solving these problems. Our heuristics are able to find schedulable implementations under limited resources, achieving an efficient utilisation of the system. The developed algorithms are evaluated using extensive experiments and a real-life example. © 2007 Springer Science+Business Media, LLC.</p

Thermal Dissipation and Variability in Electrical Breakdown of Carbon Nanotube Devices

We study high-field electrical breakdown and heat dissipation from carbon nanotube (CNT) devices on SiO2 substrates. The thermal "footprint" of a CNT caused by van der Waals interactions with the substrate is revealed through molecular dynamics (MD) simulations. Experiments and modeling find the CNT-substrate thermal coupling scales proportionally to CNT diameter and inversely with SiO2 surface roughness (~d/{\Delta}). Comparison of diffuse mismatch modeling (DMM) and data reveals the upper limit of thermal coupling ~0.4 W/K/m per unit length at room temperature, and ~0.7 W/K/m at 600 C for the largest diameter (3-4 nm) CNTs. We also find semiconducting CNTs can break down prematurely, and display more breakdown variability due to dynamic shifts in threshold voltage, which metallic CNTs are immune to; this poses a fundamental challenge for selective electrical breakdowns in CNT electronics

Understanding the μ\muSR spectra of MnSi without magnetic polarons

Transverse-field muon-spin rotation ($\mu$SR) experiments were performed on a single crystal sample of the non-centrosymmetric system MnSi. The observed angular dependence of the muon precession frequencies matches perfectly the one of the Mn-dipolar fields acting on the muons stopping at a 4a position of the crystallographic structure. The data provide a precise determination of the magnetic dipolar tensor. In addition, we have calculated the shape of the field distribution expected below the magnetic transition temperature $T_C$ at the 4a muon-site when no external magnetic field is applied. We show that this field distribution is consistent with the one reported by zero-field $\mu$SR studies. Finally, we present ab initio calculations based on the density-functional theory which confirm the position of the muon stopping site inferred from transverse-field $\mu$SR. In view of the presented evidence we conclude that the $\mu$SR response of MnSi can be perfectly and fully understood without invoking a hypothetical magnetic polaron state.Comment: 10 pages, 12 figure

Analysis and Optimization of Distributed Real-Time Embedded Systems

An increasing number of real-time applications are today implemented using distributed heterogeneous architectures composed of interconnected networks of processors. The systems are heterogeneous not only in terms of hardware and software components, but also in terms of communication protocols and scheduling policies. In this context, the task of designing such systems is becoming increasingly difficult. The success of new adequate design methods depends on the availability of efficient analysis as well as optimization techniques. In this article, we present both analysis and optimization approaches for such heterogeneous distributed real-time embedded systems. More specifically, we discuss the schedulability analysis of hard real-time systems, highlighting particular aspects related to the heterogeneous and distributed nature of the applications. We also introduce several design optimization problems characteristic of this class of systems: mapping of functionality, the optimization of access to communication channel, and the assignment of scheduling policies to processes. Optimization heuristics aiming at producing a schedulable system with a given amount of resources are presented. © 2006 ACM.</p

Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems

We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In our approach, the application messages are packed into frames such that the application is schedulable. Thus, we have also proposed a schedulability analysis for applications consisting of mixed event-triggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Optimization heuristics for frame packing aiming at producing a schedulable system have been proposed. Extensive experiments and a real-life example show the efficiency of our frame-packing approach