NADPH diaphorase activity in mammalian retinas is modulated by the state of visual adaptation

NADPH diaphorase histochemistry is commonly used to identify cells containing nitric oxide synthase (NOS), the enzyme catalyzing the production of nitric oxide from L-arginine. NADPH diaphorase activity and NOS immunostaining was demonstrated in different cells of the vertebrate retina; photoreceptors, horizontal cells, amacrine cells, ganglion cells, and Müller cells. However, the physiological role of nitric oxide (NO) in the retina has yet to be elucidated. In this study, we tested the assumption that NADPH diaphorase activity in the retinas of rabbits and rats depended on the state of visual adaptation. In the rabbit, light adaptation enhanced NADPH diaphorase activity in amacrine cells and practically eliminated it in horizontal cells. Dark adaptation induced the opposite effects; the NADPH diaphorase activity was reduced in amacrine cells and enhanced in horizontal cells. Retinas from eyes that were injected intravitreally with L-glutamate exhibited a pattern of NADPH diaphorase activity that was similar to that seen in dark-adapted retinas. In rats, the NADPH diaphorase activity of amacrine and horizontal cells exhibited adaptation dependency similar to that of the rabbit retina. But, the most pronounced effect of dark adaptation in the rat's retina was an enhancement of NADPH diaphorase activity in Müller cells, especially of the endfoot region. Assuming that NADPH diaphorase activity is a marker for NOS, these findings suggest that NO production in the mammalian retina is modulated by the level of ambient illumination and support the notion that NO plays a physiological role in the retina.     

Querying business processes with BP-QL

We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (business process execution language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are typically specified, and can be employed in a distributed setting, where process components may be provided by distinct providers.     

Thermal feedback control techniques for transistor-transistor logic triggered CO(2) laser used for irradiation of biological tissue utilizing infrared fiber-optic radiometry

A fiber-optic radiometer is used to monitor and control, in real time, the temperature of samples of biological tissue irradiated with a CO(2) laser. Several control algorithms are investigated and the optimal control mode is obtained. A silver halide infrared fiber is used both to deliver the CO(2) laser radiation needed to irradiate the target and to deliver the thermal radiation emitted from the target back to the radiometer. Such a system can be useful in medical applications of CO(2) lasers.     

Study of DNA Origami Dimerization and Dimer Dissociation Dynamics and of the Factors that Limit Dimerization

Organizing DNA origami building blocks into higher order structures is essential for fabrication of large structurally and functionally diverse devices and molecular machines. Unfortunately, the yields of origami building block attachment reactions are typically not sufficient to allow programed assembly of DNA devices made from more than a few origami building blocks. To investigate possible reasons for these low yields, a detailed single‐molecule fluorescence study of the dynamics of rectangular origami dimerization and origami dimer dissociation reactions is conducted. Reactions kinetics and yields are investigated at different origami and ion concentrations, for different ion types, for different lengths of bridging strands, and for the “sticky end” and “weaving welding” attachment techniques. Dimerization yields are never higher than 86%, which is typical for such systems. Analysis of the dynamic data shows that the low yield cannot be explained by thermodynamic instability or structural imperfections of the origami constructs. Atomic force microscopy and gel electrophoresis evidence reveal self‐dimerization of the origami monomers, likely via blunt‐end interactions made possible by the presence of bridging strands. It is suggested that this mechanism is the major factor that inhibits correct dimerization and means to overcome it are discussed.     

Single Nanoparticle Magnetic Spin Memristor

There is an increasing demand for the development of a simple Si‐based universal memory device at the nanoscale that operates at high frequencies. Spin‐electronics (spintronics) can, in principle, increase the efficiency of devices and allow them to operate at high frequencies. A primary challenge for reducing the dimensions of spintronic devices is the requirement for high spin currents. To overcome this problem, a new approach is presented that uses helical chiral molecules exhibiting spin‐selective electron transport, which is called the chiral‐induced spin selectivity (CISS) effect. Using the CISS effect, the active memory device is miniaturized for the first time from the micrometer scale to 30 nm in size, and this device presents memristor‐like nonlinear logic operation at low voltages under ambient conditions and room temperature. A single nanoparticle, along with Au contacts and chiral molecules, is sufficient to function as a memory device. A single ferromagnetic nanoplatelet is used as a fixed hard magnet combined with Au contacts in which the gold contacts act as soft magnets due to the adsorbed chiral molecules.     

以可编程DSP架构应对TD-SCDMA以及TD-LTE带来的设计挑战

中国作为目前世界上最大的移动市场,对于移动标准的发展,希望制定不同于西方的自己的标准。这就是目前的3G标准TD-SCDMA以及未来的4G标准TD-LTE。在2006年初,中国政府宣布TD-SCDMA正式成为中国的3G移动通信的标准。在2009年,世界最大的移动运营商中国移动宣布将提供基于TD-SCDMA为标准的3G服务;同时,中国联通以及中国电信分别将以WCDMA以及CDMA-2000标准推出3G服务。这就意味着,中国在接下来的时间将会同时存在3种不同的3G网络。显而易见的是,中国的3G服务的启动要远远晚于西方世界。中国移动明白不可能只是依靠TD-SCDMA来确保其目前领先的地位。因此,中国移     

A note on maximizing the spread of influence in social networks

We consider the spread maximization problem that was defined by Domingos and Richardson (2001, 2002) [7] and [22]. In this problem, we are given a social network represented as a graph and are required to find the set of the most “influential” individuals that by introducing them with a new technology, we maximize the expected number of individuals in the network, later in time, that adopt the new technology. This problem has applications in viral marketing, where a company may wish to spread the rumor of a new product via the most influential individuals in popular social networks such as Myspace and Blogsphere.The spread maximization problem was recently studied in several models of social networks (Kempe et al. (2003, 2005) [14] and [15], Mossel and Roch (2007) [20]). In this short paper we study this problem in the context of the well studied probabilistic voter model. We provide very simple and efficient algorithms for solving this problem. An interesting special case of our result is that the most natural heuristic solution, which picks the nodes in the network with the highest degree, is indeed the optimal solution.     

Distributed data clustering in sensor networks

Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., a local sensor read, and a concise picture of the global system state needs to be obtained. In resource-constrained environments like sensor networks, this needs to be done without collecting all the data at any location, i.e., in a distributed manner. To this end, we address the distributed clustering problem, in which numerous interconnected nodes compute a clustering of their data, i.e., partition these values into multiple clusters, and describe each cluster concisely. We present a generic algorithm that solves the distributed clustering problem and may be implemented in various topologies, using different clustering types. For example, the generic algorithm can be instantiated to cluster values according to distance, targeting the same problem as the famous k-means clustering algorithm. However, the distance criterion is often not sufficient to provide good clustering results. We present an instantiation of the generic algorithm that describes the values as a Gaussian Mixture (a set of weighted normal distributions), and uses machine learning tools for clustering decisions. Simulations show the robustness, speed and scalability of this algorithm. We prove that any implementation of the generic algorithm converges over any connected topology, clustering criterion and cluster representation, in fully asynchronous settings.     

Partition arguments in multiparty communication complexity

Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x₁,…,x_k∈{0,1}ⁿ communicate to compute the value f(x₁,…,x_k) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find a lower bound for the induced two-party communication complexity problem.In this paper, we study the power of partition arguments. Our two main results are very different in nature:

(i)

For randomized communication complexity, we show that partition arguments may yield bounds that are exponentially far from the true communication complexity. Specifically, we prove that there exists a 3-argument function f whose communication complexity is Ω(n), while partition arguments can only yield an Ω(logn) lower bound. The same holds for nondeterministiccommunication complexity.

(ii)

For deterministic communication complexity, we prove that finding significant gaps between the true communication complexity and the best lower bound that can be obtained via partition arguments, would imply progress on a generalized version of the “log-rank conjecture” in communication complexity. We also observe that, in the case of computing relations (search problems), very large gaps do exist.

We conclude with two results on the multiparty “fooling set technique”, another method for obtaining communication complexity lower bounds.