منابع مشابه
O N O N N
Hierarchical terrain models describe a topographic surface at di erent levels of detail, providing a multiresolution representation as well as a data compression mechanism. In this paper, we consider the problem of computing the visibility map, with respect to a xed viewpoint, on a hierarchical triangle-based terrain model. This problem presents two aspects: the extraction of a visibility map a...
متن کاملFascinating frontiers of N/O-functionalized N-heterocyclic carbene chemistry: from chemical catalysis to biomedical applications.
The in vogue N-heterocyclic carbenes (NHCs) have attracted attention largely for its new found popularity in chemical catalysis and also for displaying promising traits in biomedical applications. The current perspective provides an account of our efforts in exploring the utility of N/O-functionalized N-heterocyclic carbenes in these two areas. On the catalysis front, we have employed the N/O-f...
متن کاملDiversity of new structural types in polynuclear iron chemistry with a tridentate N,N,O ligand.
The syntheses, crystal structures, and magnetochemical characterization of four new iron clusters [Fe7O4(O2CPh)11(dmem)2] (1), [Fe7O4(O2CMe)11(dmem)2] (2), [Fe6O2(OH)4(O2CBut)8(dmem)2] (3), and [Fe3O(O2CBut)2(N3)3(dmem)2] (4) (dmemH=Me2NCH2CH2N(Me)CH2CH2OH)=2-{[2-(dimethylamino)ethyl]methylamino}ethanol) are reported. The reaction of dmemH with [Fe3O(O2CR)6(H2O)3](NO3) (R=Ph (1), Me (2), and Bu...
متن کاملJa n 20 06 CATEGORY O OVER SKEW GROUP RINGS
We study the BGG Category O over a skew group ring, involving a finite group acting on a regular triangular algebra. We relate the representation theory of the algebra to Clifford theory for the skew group ring, and obtain results on block decomposition, semisimplicity, and enough projectives. O is also shown to be a highest weight category; the BGG Reciprocity formula is slightly different bec...
متن کاملBisimulations over DLTS in O(m.log n)-time
The well known Hopcroft’s algorithm to minimize deterministic complete automata runs in O(kn log n)-time, where k is the size of the alphabet and n the number of states. The main part of this algorithm corresponds to the computation of a coarsest bisimulation over a finite Deterministic Labelled Transition System (DLTS). By applying techniques we have developed in the case of simulations, we de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2008
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.319.5867.1163b