Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs. 相似文献
A compact 64‐channel hybrid demultiplexer based on silicon‐on‐insulator nanowires is proposed and demonstrated experimentally to enable wavelength‐division‐multiplexing and mode‐division‐multiplexing simultaneously in order to realize an ultra‐large capacity on‐chip optical‐interconnect link. The present hybrid demultiplexer consists of a 4‐channel mode multiplexer constructed with cascaded asymmetrical directional‐couplers and two bi‐directional 17 × 17 arrayed‐waveguide gratings (AWGs) with 16 channels. Here each bi‐directional AWG is equivalent as two identical 1 × 16 AWGs. The measured excess loss and the crosstalk for the monolithically integrated 64‐channel hybrid demultiplexer are about ‐5 dB and ‐14 dB, respectively. Better performance can be achieved by minimizing the imperfections (particularly in AWGs) during the fabrication processes.
A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions. 相似文献
The biocatalytic production of flavor naturals that determine chemosensory percepts of foods and beverages is an ever challenging target for academic and industrial research. Advances in chemical trace analysis and post‐genomic progress at the chemistry–biology interface revealed odor qualities of nature’s chemosensory entities to be defined by odorant‐induced olfactory receptor activity patterns. Beyond traditional views, this review and meta‐analysis now shows characteristic ratios of only about 3 to 40 genuine key odorants for each food, from a group of about 230 out of circa 10 000 food volatiles. This suggests the foodborn stimulus space has co‐evolved with, and roughly match our circa 400 olfactory receptors as best natural agonists. This perspective gives insight into nature’s chemical signatures of smell, provides the chemical odor codes of more than 220 food samples, and beyond addresses industrial implications for producing recombinants that fully reconstruct the natural odor signatures for use in flavors and fragrances, fully immersive interactive virtual environments, or humanoid bioelectronic noses. 相似文献
Optical multiplexing based on luminescent materials with tunable color/lifetime has potential applications in information storage and security. However, the available tunable luminescent materials reported so far still suffer from several drawbacks of low efficiency or poor stability, thus restraining their further applications. Herein, we demonstrate a strategy to develop efficient and stable lanthanide coordination polymers (LCPs) with tunable luminescence as a new option for optical multiplexing. Their multicolor emission from green to red and naked-eye-sensitive green emission with tunable lifetime (from ca. 300 to ca. 600 μs) can be controlled by host differential sensitization and energy transfer between lanthanide ions. The quantum efficiencies of developed samples range from around 20 % to 46 % and the luminescence intensity/lifetime appear quite stable in polar solvents up to ten weeks. Furthermore, with the aid of inkjet printing and concepts of luminescence lifetime imaging and time-gated imaging, we illustrate their promising applications of information storage and security in spatial and temporal domains. 相似文献