Type-II kinase inhibitors represent a class of chemicals that trap their target kinases in an inactive, so-called DFG-out state, occupying a hydrophobic pocket adjacent to the ATP binding site. These compounds are often more specific than those that target active DFG-in kinase conformations. Unfortunately, the discovery of novel type-II scaffolds presents a considerable challenge, partially bec...

در این پژوهش، برای نخستین بار کشور، جداسازی لیزری ایزوتوپ C13 از راه گسست چندفوتونی ایزوتوپ- گزین مولکول‌های گاز HCl2CF مقیاس آزمایشگاهی به انجام رسید. کار، تپ‌های یک لیزر 2TEA CO کوک‌پذیر که با برش­گر پلاسمایی کوتاه‌سازی شده‌اند، شاریدگی 2J/cm 50 درون اتاقک تابش‌دهی کانونی شدند. تابش‌‌دهی نیز فشار mbar 10-20 نسبت‌های HCl: He2CF برابر 1:5 و 1:10 پر شده بود. نشان داده شد فراوانی فرآورده‌ی 4F2C ک...

Loop scheduling is an important problem in parallel processing. The retiming technique reorganizes an iteration; the unfolding technique schedules several iterations together. We combine these two techniques to obtain a static schedule with a reduced average computation time per iteration. We first prove that the order of retiming and unfolding is immaterial for scheduling a data-flow graph (DF...

The active vision paradigm plays a significant role in a recently established interdisciplinary research initiative (DFG Forschergruppe) at Heidelberg University. The goal of the Forschergruppe is to develop and apply advanced image sequence processing techniques to study key scientific questions in environmental sciences and biology that cannot be approached with conventional techniques. The F...

Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). The execution of all tasks of a DFG is called an iteration, with the average computation time of an iteration the iteration period. A great deal of research has been done attempting to optimize such applicatio...

Many iterative or recursive applications commonly found in DSP and image processing applications can be represented by data-flow graphs (DFGs). This graph is then used to perform DFG scheduling, where the starting times for executing the application’s individual tasks are determined. The minimum length of time required to execute all tasks once is called the schedule length of the DFG. A great ...