Searcharxiv⌕ Search

arXiv subjects

Yu Zhou

Publications and source records attributed to Yu Zhou.

467 records · Page 26Linked to original sources
arXiv2013

A Localization Strategy Based on N-times Trilateral Centroid with Weight

Localization based on received signal strength indication (RSSI) is a low cost and low complexity technology, and it is widely applied in distance-based localization of wireless sensor networks (WSNs). Error of existed localization technologies is significant. This paper presents the N-times trilateral centroid weighted localization algorithm (NTCWLA), which can reduce the error considerably. Considering the instability of RSSI, we use the weighted average of many RSSIs as current RSSI. To improve the accuracy we select a number of (no less than three) reliable beacon nodes to increase the localization times. Then we calculate the distances between reliable beacon nodes and the mobile node using an empirical formula. The mobile node is located N times using the trilateral centroid algorithm. Finally, we take the weighted average of the filtered reference coordinates as the mobile node's coordinates. We conduct experiments with the STM32W108 chip which supports IEEE 802.15.4. The results show that the proposed algorithm performs better than the trilateral centroid algorithm.

cs.NI↗
arXiv2013

Observation of Anticorrelation with Classical Light in a Linear Optical System

Two-photon anticorrelation is observed when laser and pseudothermal light beams are incident to the two input ports of a Hong-Ou-Mandel interferometer, respectively. The spatial second-order interference pattern of laser and pseudothermal light beams is reported. Temporal Hong-Ou-Mandel dip is also observed when these two detectors are at the symmetrical positions. These results are helpful to understand the physics behind the second-order interference of light.

physics.optics↗
arXiv2013

Cluster algebras arising from cluster tubes

We study the cluster algebras arising from cluster tubes with rank bigger than $1$. Cluster tubes are $2-$Calabi-Yau triangulated categories which contain no cluster tilting objects, but maximal rigid objects. Fix a certain maximal rigid object $T$ in the cluster tube $\mathcal{C}_n$ of rank $n$. For any indecomposable rigid object $M$ in $\mathcal{C}_n$, we define an analogous $X_M$ of Caldero-Chapton's formula (or Palu's cluster character formula) by using the geometric information of $M$. We show that $X_M, X_{M'}$ satisfy the mutation formula when $M,M'$ form an exchange pair, and that $X_{?}: M\mapsto X_M$ gives a bijection from the set of indecomposable rigid objects in $\mathcal{C}_n$ to the set of cluster variables of cluster algebra of type $C_{n-1}$, which induces a bijection between the set of basic maximal rigid objects in $\mathcal{C}_n$ and the set of clusters. This strengths a surprising result proved recently by Buan-Marsh-Vatne that the combinatorics of maximal rigid objects in the cluster tube $\mathcal{C}_n$ encode the combinatorics of the cluster algebra of type $B_{n-1}$ since the combinatorics of cluster algebras of type $B_{n-1}$ or of type $C_{n-1}$ are the same by a result of Fomin and Zelevinsky. As a consequence, we give a categorification of cluster algebras of type $C$.

math.RT↗
arXiv2013

Universal stability of Banach spaces for $\varepsilon$-isometries

Let $X$, $Y$ be two real Banach spaces and $\varepsilon>0$. A standard $\varepsilon$-isometry $f:X\rightarrow Y$ is said to be $(α,γ)$-stable (with respect to $T:L(f)\equiv\overline{\rm span}f(X)\rightarrow X$ for some $α, γ>0$) if $T$ is a linear operator with $\|T\|\leqα$ so that $Tf-Id$ is uniformly bounded by $γ\varepsilon$ on $X$. The pair $(X,Y)$ is said to be stable if every standard $\varepsilon$-isometry $f:X\rightarrow Y$ is $(α,γ)$-stable for some $α,γ>0$. $X (Y)$ is said to be universally left (right)-stable, if $(X,Y)$ is always stable for every $Y (X)$. In this paper, we show that universal right-stability spaces are just Hilbert spaces; every injective space is universally left-stable; a Banach space $X$ isomorphic to a subspace of $\ell_\infty$ is universally left-stable if and only if it is isomorphic to $\ell_\infty$; and that a separable space $X$ satisfies the condition that $(X,Y)$ is left-stable for every separable $Y$ if and only if it is isomorphic to $c_0$.

math.FA↗
arXiv2013

Position-sensitive spectral splitting with a plasmonic nanowire on silicon chip

On-chip nanophotonics serves as the foundation for the new generation of information technology, but it is challenged by the diffraction limit of light. With the capabilities of confining light into (deep) subwavelength volumes, plasmonics makes it possible to dramatically miniaturize optical devices so as to integrate them into silicon chips. Here we demonstrate that by cascading nano-corrugation gratings with different periodicities on silver nanowires atop silicon, different colors can be spatially separated and chronologically released at different grating junctions. The released light frequency depends on the grating arrangement and corrugation periodicities. Hence the nanowire acts as a spectral splitter for sorting/demultiplexing photons at different nano-scale positions with a ten-femtosecond-level interval. Such nanowires can be constructed further into compact 2D networks or circuits. We believe that this study provides a new and promising approach for realizing spatiotemporal-sensitive spectral splitting and optical signal processing on nanoscales, and for general integration of nanophotonics with microelectronics.

physics.optics↗
arXiv2013

Flexible RNA design under structure and sequence constraints using formal languages

The problem of RNA secondary structure design (also called inverse folding) is the following: given a target secondary structure, one aims to create a sequence that folds into, or is compatible with, a given structure. In several practical applications in biology, additional constraints must be taken into account, such as the presence/absence of regulatory motifs, either at a specific location or anywhere in the sequence. In this study, we investigate the design of RNA sequences from their targeted secondary structure, given these additional sequence constraints. To this purpose, we develop a general framework based on concepts of language theory, namely context-free grammars and finite automata. We efficiently combine a comprehensive set of constraints into a unifying context-free grammar of moderate size. From there, we use generic generic algorithms to perform a (weighted) random generation, or an exhaustive enumeration, of candidate sequences. The resulting method, whose complexity scales linearly with the length of the RNA, was implemented as a standalone program. The resulting software was embedded into a publicly available dedicated web server. The applicability demonstrated of the method on a concrete case study dedicated to Exon Splicing Enhancers, in which our approach was successfully used in the design of \emph{in vitro} experiments.

q-bio.QM↗
arXiv2013

Cloud Computing framework for Computer Vision Research:An Introduction

Cloud computing offers the potential to help scientists to process massive number of computing resources often required in machine learning application such as computer vision problems. This proposal would like to show that which benefits can be obtained from cloud in order to help medical image analysis users (including scientists, clinicians, and research institutes). As security and privacy of algorithms are important for most of algorithms inventors, these algorithms can be hidden in a cloud to allow the users to use the algorithms as a package without any access to see/change their inside. In another word, in the user part, users send their images to the cloud and configure the algorithm via an interface. In the cloud part, the algorithms are applied to this image and the results are returned back to the user. My proposal has two parts: (1) investigate the potential of cloud computing for computer vision problems and (2) study the components of a proposed cloud-based framework for medical image analysis application and develop them (depending on the length of the internship). The investigation part will involve a study on several aspects of the problem including security, usability (for medical end users of the service), appropriate programming abstractions for vision problems, scalability and resource requirements. In the second part of this proposal I am going to thoroughly study of the proposed framework components and their relations and develop them. The proposed cloud-based framework includes an integrated environment to enable scientists and clinicians to access to the previous and current medical image analysis algorithms using a handful user interface without any access to the algorithm codes and procedures.

cs.CV↗
arXiv2012

Cotorsion pairs and t-structures in a $2-$Calabi-Yau triangulated category

For a Calabi-Yau triangulated category $\mathcal{C}$ of Calabi-Yau dimension $d$ with a $d-$cluster tilting subcategory $\mathcal{T}$, it is proved that the decomposition of $\mathcal{C}$ is determined by the special decomposition of $\mathcal{T}$, namely, $\mathcal{C}=\oplus_{i\in I}\mathcal{C}_i$, where $\mathcal{C}_i, i\in I$ are triangulated subcategories, if and only if $\mathcal{T}=\oplus_{i\in I}\mathcal{T}_i,$ where $\mathcal{T}_i, i\in I$ are subcategories with $Hom_{\mathcal{C}}(\mathcal{T}_i[t],\mathcal{T}_j)=0, \forall 1\leq t\leq d-2$ and $i\not= j.$ This induces that the Gabriel quivers of endomorphism algebras of any two cluster tilting objects in a $2-$Calabi-Yau triangulated category are connected or not at the same time. As an application, we prove that indecomposable $2-$Calabi-Yau triangulated categories with cluster tilting objects have no non-trivial t-structures and no non-trivial co-t-structures. This allows us to give a classification of cotorsion pairs in this triangulated category. Moreover the hearts of cotorsion pairs in the sense of Nakaoka are equivalent to the module categories over the endomorphism algebras of the cores of the cotorsion pairs.

math.RT↗
arXiv2012

Cotorsion pairs in the cluster category of a marked surface

We study extension spaces, cotorsion pairs and their mutations in the cluster category of a marked surface without punctures. Under the one-to-one correspondence between the curves, valued closed curves in the marked surface and the indecomposable objects in the associated cluster category, we prove that the dimension of extension space of two indecomposable objects in the cluster categories equals to the intersection number of the corresponding curves. By using this result, we prove that there are no non-trivial $t-$structures in the cluster categories when the surface is connected. Based on this result, we give a classification of cotorsion pairs in these categories. Moreover we define the notion of paintings of a marked surface without punctures and their rotations. They are a geometric model of cotorsion pairs and of their mutations respectively.

math.RT↗
arXiv2011

A Failure Self-recovery Strategy with Balanced Energy Consumption for Wireless Ad Hoc Networks

In energy constrained wireless sensor networks, it is significant to make full use of the limited energy and maximize the network lifetime even when facing some unexpected situation. In this paper, all sensor nodes are grouped into clusters, and for each cluster, it has a mobile cluster head to manage the whole cluster. We consider an emergent situation that one of the mobile cluster heads is broken down, and hence the whole cluster is consequently out of work. An efficient approach is proposed for recovering the failure cluster by selecting multiple static sensor nodes as the cluster heads to collect packets and transmit them to the sink node. Improved simulated annealing algorithm is utilized to achieve the uniform deployment of the cluster heads. The new cluster heads are dynamically changed in order to keep balanced energy consumption. Among the new cluster heads, packets are transmitted through multi-hop forwarding path which is cost-lowest path found by Dijkstra's algorithm. A balanced energy consumption model is provided to help find the cost-lowest path and prolong the lifetime of the network. The forwarding path is updated dynamically according to the cost of the path and residual energy of the node in that path. The experimental results show that the failure cluster is recovered and the lifetime of the cluster is prolonged.

cs.NI↗
arXiv2011

Effect of Layer-Stacking on the Electronic Structure of Graphene Nanoribbons

The evolution of electronic structure of graphene nanoribbons (GNRs) as a function of the number of layers stacked together is investigated using \textit{ab initio} density functional theory (DFT) including interlayer van der Waals interactions. Multilayer armchair GNRs (AGNRs), similar to single-layer AGNRs, exhibit three classes of band gaps depending on their width. In zigzag GNRs (ZGNRs), the geometry relaxation resulting from interlayer interactions plays a crucial role in determining the magnetic polarization and the band structure. The antiferromagnetic (AF) interlayer coupling is more stable compared to the ferromagnetic (FM) interlayer coupling. ZGNRs with the AF in-layer and AF interlayer coupling have a finite band gap while ZGNRs with the FM in-layer and AF interlayer coupling do not have a band gap. The ground state of the bi-layer ZGNR is non-magnetic with a small but finite band gap. The magnetic ordering is less stable in multilayer ZGNRs compared to single-layer ZGNRs. The quasipartcle GW corrections are smaller for bilayer GNRs compared to single-layer GNRs because of the reduced Coulomb effects in bilayer GNRs compared to single-layer GNRs.

cond-mat.mtrl-sci↗
arXiv2011

Accurate six-band nearest-neighbor tight-binding model for the pi-bands of bulk graphene and graphene nanoribbons

Accurate modeling of the pi-bands of armchair graphene nanoribbons (AGNRs) requires correctly reproducing asymmetries in the bulk graphene bands as well as providing a realistic model for hydrogen passivation of the edge atoms. The commonly used single-pz orbital approach fails on both these counts. To overcome these failures we introduce a nearest-neighbor, three orbital per atom p/d tight-binding model for graphene. The parameters of the model are fit to first-principles density-functional theory (DFT) - based calculations as well as to those based on the many-body Green's function and screened-exchange (GW) formalism, giving excellent agreement with the ab initio AGNR bands. We employ this model to calculate the current-voltage characteristics of an AGNR MOSFET and the conductance of rough-edge AGNRs, finding significant differences versus the single-pz model. These results show that an accurate bandstructure model is essential for predicting the performance of graphene-based nanodevices.

cond-mat.mes-hall↗
arXiv2010

Maximal rigid subcategories in 2-Calabi-Yau triangulated categories

We study the maximal rigid subcategories in $2-$CY triangulated categories and their endomorphism algebras. Cluster tilting subcategories are obviously maximal rigid; we prove that the converse is true if the $2-$CY triangulated categories admit a cluster tilting subcategory. As a generalization of a result of [KR], we prove that any maximal rigid subcategory is Gorenstein with Gorenstein dimension at most 1. Similar as cluster tilting subcategory, one can mutate maximal rigid subcategories at any indecomposable object. If two maximal rigid objects are reachable via mutations, then their endomorphism algebras have the same representation type.

math.RT↗
arXiv2009

3rd Order Temporal Correlation Function of Pseudo-Thermal Light

This experiment reports a nontrivial third-order temporal correlation of chaotic-thermal light in which the randomly radiated thermal light is observed to have a 6-times greater chance of being captured by three individual photodetectors simultaneously than that of being captured by three photodetectors at different times (separated by the coherent time of pseudo-thermal light), indicating a "three-photon bunching" effect. The nontrivial correlation of thermal light is the result of multi-photon interference.

quant-ph↗
arXiv2009

Cluster combinatorics of d-cluster categories

We study the cluster combinatorics of $d-$cluster tilting objects in $d-$cluster categories. By using mutations of maximal rigid objects in $d-$cluster categories which are defined similarly for $d-$cluster tilting objects, we prove the equivalences between $d-$cluster tilting objects, maximal rigid objects and complete rigid objects. Using the chain of $d+1$ triangles of $d-$cluster tilting objects in [IY], we prove that any almost complete $d-$cluster tilting object has exactly $d+1$ complements, compute the extension groups between these complements, and study the middle terms of these $d+1$ triangles. All results are the extensions of corresponding results on cluster tilting objects in cluster categories established in [BMRRT] to $d-$cluster categories. They are applied to the Fomin-Reading's generalized cluster complexes of finite root systems defined and studied in [FR2] [Th] [BaM1-2], and to that of infinite root systems [Zh3].

math.RT↗
arXiv2007

Random Delayed-Choice Quantum Eraser via Two-Photon Imaging

We report on a delayed-choice quantum eraser experiment based on a two-photon imaging scheme using entangled photon pairs. After the detection of a photon which passed through a double-slit, a random delayed choice is made to erase or not erase the which-path information by the measurement of its distant entangled twin; the particle-like and wave-like behavior of the photon are then recorded simultaneously and respectively by only one set of joint detection devices. The present eraser takes advantage of two-photon imaging. The complete which-path information of a photon is transferred to its distant entangled twin through a "ghost" image. The choice is made on the Fourier transform plane of the ghost image between reading "complete information" or "partial information" of the double-path.

quant-ph↗