40 resultados para Standards of length.
Resumo:
We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.
Resumo:
A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible number of colours is called an optimal rainbow colouring, and the minimum number of colours required is called the rainbow connection number of the graph. A Chordal Graph is a graph in which every cycle of length more than 3 has a chord. A Split Graph is a chordal graph whose vertices can be partitioned into a clique and an independent set. A threshold graph is a split graph in which the neighbourhoods of the independent set vertices form a linear order under set inclusion. In this article, we show the following: 1. The problem of deciding whether a graph can be rainbow coloured using 3 colours remains NP-complete even when restricted to the class of split graphs. However, any split graph can be rainbow coloured in linear time using at most one more colour than the optimum. 2. For every integer k ≥ 3, the problem of deciding whether a graph can be rainbow coloured using k colours remains NP-complete even when restricted to the class of chordal graphs. 3. For every positive integer k, threshold graphs with rainbow connection number k can be characterised based on their degree sequence alone. Further, we can optimally rainbow colour a threshold graph in linear time.
Resumo:
A transform approach to network coding was in-troduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as k-instantaneous networks (for some large k). When the local encoding kernels (LEKs) of the network are varied with every time block of length k >1, the network is said to use block time varying LEKs. In this work, we propose a Precoding Based Network Alignment (PBNA) scheme based on transform approach and block time varying LEKs for three-source three-destination multiple unicast network with delays (3-S3-D MUN-D). In a recent work, Menget al. (arXiv:1202.3405v1 [cs.IT]) reduced the infinite set of sufficient conditions for feasibility of PBNA in a three-source three-destination instantaneous multiple unicast network as given by Das et al. (arXiv:1008.0235v1 [cs.IT]) to a finite set and also showed that the conditions are necessary. We show that the conditions of Meng et al. are also necessary and sufficient conditions for feasibility of PBNA based on transform approach and block time varying LEKs for 3-S3-D MUN-D.
Resumo:
The growth of neuroblastoma (N2a) and Schwann cells has been explored on polymer derived carbon substrates of varying micro and nanoscale geometries: resorcinol-formaldehyde (RE) gel derived carbon films and electrospun nanofibrous (similar to 200 nm diameter) mat and SU-8 (a negative photoresist) derived carbon micro-patterns. MTT assay and complementary lactate dehydrogenase (LDH) assay established cytocompatibility of RE derived carbon films and fibers over a period of 6 days in culture. The role of length scale of surface patterns in eliciting lineage-specific adaptive response along, across and on the interspacing between adjacent micropatterns (i.e., ``on'', ``across'' and ``off'') has been assayed. Textural features were found to affect 3',5'-cyclic AMP sodium salt-induced neurite outgrowth, over a wide range of length scales: from similar to 200 nm (carbon fibers) to similar to 60 mu m (carbon patterns). Despite their innate randomness, carbon nanofibers promoted preferential differentiation of N2a cells into neuronal lineage, similar to ordered micro-patterns. Our results, for the first time, conclusively demonstrate the potential of RE-gel and SU-8 derived carbon substrates as nerve tissue engineering platforms for guided proliferation and differentiation of neural cells in vitro. (C) 2013 Elsevier Ltd. All rights reserved.
Resumo:
Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G m is chordal then so is G(m+2). Brandst `` adt et al. in Andreas Brandsadt, Van Bang Le, and Thomas Szymczak. Duchet- type theorems for powers of HHD- free graphs. Discrete Mathematics, 177(1- 3): 9- 16, 1997.] showed that if G m is k - chordal, then so is G(m+2). Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m - th bipartite power G(m]) of a bipartite graph G is the bipartite graph obtained from G by adding edges (u; v) where d G (u; v) is odd and less than or equal to m. Note that G(m]) = G(m+1]) for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G m], where k, m are positive integers with k >= 4
Resumo:
This paper presents the design technique that has been adopted for packaging of Polyvinylidene fluoride (PVDF) nasal sensor for biomedical applications. The PVDF film with the dimension of length 10mm, width 5mm and thickness 28 mu m was firmly adhered on one end of plastic base (8mmx5mmx30 mu m) in such a way that it forms a cantilever configuration leaving the other end free for deflection. Now with the leads attached on the surface of the PVDF film, the cantilever configuration becomes the PVDF nasal sensor. For mounting a PVDF nasal sensor, a special headphone was designed, that can fit most of the human head sizes. Two flexible strings are soldered on either side of the headphone. Two identical PVDF nasal sensors were then connected to either side of flexible string of the headphone in such a way that they are placed below the right and left nostrils respectively without disturbing the normal breathing. When a subject wares headphone along with PVDF nasal sensors, two voltage signals due to the piezoelectric property of the PVDF film were generated corresponding to his/her nasal airflow from right and left nostril. The entire design was made compact, so that PVDF nasal sensors along with headphone can be made portable. No special equipment or machines are needed for mounting the PVDF nasal sensors. The time required for packaging of PVDF nasal sensors was less and the approximate cost of the entire assembly (PVDF nasal sensors + headphone) was very nominal.
Resumo:
The characteristics of surface roughness span a range of length scales determined by the nature of the surface generation process. The mechanism by which material is removed at a length scale determines the roughness at that scale. Electropolishing preferentially reduces the peaks of surface protuberances at sub-micron length scales to produce smooth surfaces. The material removal in electropolishing occurs by two different mechanisms of anodic leveling and microsmoothing. Due to insufficient lateral resolution, individual contribution of these two mechanisms could not be measured by conventional roughness measurement techniques and parameters. In this work, we utilize the high lateral resolution offered by Atomic force microscopy along with the power spectral density method of characterization, to study the evolution of roughness during electropolishing. The power spectral density show two corner frequencies indicating the length scales over which the two mechanisms operate. These characteristic frequencies are found to be a function of the electropolishing time and hence can be used to optimize the electropolishing process.
Resumo:
Shock-Boundary Layer Interaction (SBLI) often occurs in supersonic/hypersonic flow fields. Especially when accompanied by separation (termed strong interaction), the SBLI phenomena largely affect the performance of the systems where they occur, such as scramjet intakes, thus often demanding the control of the interaction. Experiments on the strong interaction between impinging shock wave and boundary layer on a flat plate at Mach 5.96 are carried out in IISc hypersonic shock tunnel HST-2. The experiments are performed at moderate flow total enthalpy of 1.3 MJ/kg and freestream Reynolds number of 4 million/m. The strong shock generated by a wedge (or shock generator) of large angle 30.96 degrees to the freestream is made to impinge on the flat plate at 95 mm (inviscid estimate) from the leading edge, due to which a large separation bubble of length (75 mm) comparable to the distance of shock impingement from the leading edge is generated. The experimental simulation of such large separation bubble with separation occurring close to the leading edge, and its control using boundary layer bleed (suction and tangential blowing) at the location of separation, are demonstrated within the short test time of the shock tunnel (similar to 600 mu s) from time resolved schlieren flow visualizations and surface pressure measurements. By means of suction - with mass flow rate one order less than the mass flow defect in boundary layer - a reduction in separation length by 13.33% was observed. By the injection of an array of (nearly) tangential jets in the direction of mainstream (from the bottom of the plate) at the location of separation - with momentum flow rate one order less than the boundary layer momentum flow defect - 20% reduction in separation length was observed, although the flow field was apparently unsteady. (C) 2014 Elsevier Masson SAS. All rights reserved.
Resumo:
Optical transport behavior of organic photo-voltaic devices with nano-pillar transparent electrodes is investigated in this paper in order to understand possible enhancement of their charge-collection efficiency. Modeling and simulations of optical transport due to this architecture show an interesting regime of length-scale dependent optical characteristics. An electromagnetic wave propagation model is employed with simulation objectives toward understanding the mechanism of optical scattering and waveguide effects due to the nano-pillars and effective transmission through the active layer. Partial filling of gaps between the nano-pillars due to the nano-fabrication process is taken into consideration. Observations made in this paper will facilitate appropriate design rules for nano-pillar electrodes. (C) 2014 AIP Publishing LLC.
Resumo:
The present study discusses the photosensitivity of GeS2 chalcogenide glass in response to irradiation with femtosecond pulses at 1047 nm. Bulk GeS2 glasses are prepared by conventional melt quenching technique and the amorphous nature of the glass is confirmed using X-ray diffraction. Ultrafast laser inscription technique is used to fabricate the straight channel waveguides in the glass. Single scan and multi scan waveguides are inscribed in GeS2 glasses of length 0.65 cm using a master oscillator power amplifier Yb doped fiber laser (IMRA mu jewel D400) with different pulse energy and translation speed. Diameters of the inscribed waveguides are measured and its dependence on the inscription parameters such as translation speed and pulse energy is studied. Butt coupling method is used to characterize the loss measurement of the inscribed optical waveguides. The mode field image of the waveguides is captured using CCD camera and compared with the mode field image of a standard SMF-28 fibers.
Resumo:
The central problem in the study of glass-forming liquids and other glassy systems is the understanding of the complex structural relaxation and rapid growth of relaxation times seen on approaching the glass transition. A central conceptual question is whether one can identify one or more growing length scale(s) associated with this behavior. Given the diversity of molecular glass-formers and a vast body of experimental, computational and theoretical work addressing glassy behavior, a number of ideas and observations pertaining to growing length scales have been presented over the past few decades, but there is as yet no consensus view on this question. In this review, we will summarize the salient results and the state of our understanding of length scales associated with dynamical slow down. After a review of slow dynamics and the glass transition, pertinent theories of the glass transition will be summarized and a survey of ideas relating to length scales in glassy systems will be presented. A number of studies have focused on the emergence of preferred packing arrangements and discussed their role in glassy dynamics. More recently, a central object of attention has been the study of spatially correlated, heterogeneous dynamics and the associated length scale, studied in computer simulations and theoretical analysis such as inhomogeneous mode coupling theory. A number of static length scales have been proposed and studied recently, such as the mosaic length scale discussed in the random first-order transition theory and the related point-to-set correlation length. We will discuss these, elaborating on key results, along with a critical appraisal of the state of the art. Finally we will discuss length scales in driven soft matter, granular fluids and amorphous solids, and give a brief description of length scales in aging systems. Possible relations of these length scales with those in glass-forming liquids will be discussed.
Resumo:
We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.
Resumo:
We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.
Resumo:
An invariant imbedding method yields exact analytical results for the distribution of the phase theta (L) of the reflection amplitude and for low-order resistance moments (pn) for a disordered conductor of length L in the quasi-metallic regime L<
Resumo:
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.