40 resultados para Standards of length.
Resumo:
We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT
Resumo:
Design and characterization of a new shape memory alloy wire based Poly Phase Motor has been reported in this paper. The motor can be used either in stepping mode or in servo mode of operation. Each phase of the motor consists of an SMA wire with a spring in series. The principle of operation of the poly phase motor is presented. The motor resembles a stepper motor in its functioning though the actuation principles are different and hence has been characterized similar to a stepper motor. The motor can be actuated in either direction with different phase sequencing methods, which are presented in this work. The motor is modelled and simulated and the results of simulations and experiments are presented. The experimental model of the motor is of dimension 150mm square, 20mm thick and uses SMA wire of 0·4mm diameter and 125mm of length in each phase.
Resumo:
Engineering education quality embraces the activities through which a technical institution satisfies itself that the quality of education it provides and standards it has set are appropriate and are being maintained. There is a need to develop a standardised approach to most aspects of quality assurance for engineering programmes which is sufficiently well defined to be accepted for all assessments.We have designed a Technical Educational Quality Assurance and Assessment (TEQ-AA) System, which makes use of the information on the web and analyzes the standards of the institution. With the standards as anchors for definition, the institution is clearer about its present in order to plan better for its future and enhancing the level of educational quality.The system has been tested and implemented on the technical educational Institutions in the Karnataka State which usually host their web pages for commercially advertising their technical education programs and their Institution objectives, policies, etc., for commercialization and for better reach-out to the students and faculty. This helps in assisting the students in selecting an institution for study and to assist in employment.
Resumo:
Analysis of climate change impacts on streamflow by perturbing the climate inputs has been a concern for many authors in the past few years, but there are few analyses for the impacts on water quality. To examine the impact of change in climate variables on the water quality parameters, the water quality input variables have to be perturbed. The primary input variables that can be considered for such an analysis are streamflow and water temperature, which are affected by changes in precipitation and air temperature, respectively. Using hypothetical scenarios to represent both greenhouse warming and streamflow changes, the sensitivity of the water quality parameters has been evaluated under conditions of altered river flow and river temperature in this article. Historical data analysis of hydroclimatic variables is carried out, which includes flow duration exceedance percentage (e.g. Q90), single low- flow indices (e.g. 7Q10, 30Q10) and relationships between climatic variables and surface variables. For the study region of Tunga-Bhadra river in India, low flows are found to be decreasing and water temperatures are found to be increasing. As a result, there is a reduction in dissolved oxygen (DO) levels found in recent years. Water quality responses of six hypothetical climate change scenarios were simulated by the water quality model, QUAL2K. A simple linear regression relation between air and water temperature is used to generate the scenarios for river water temperature. The results suggest that all the hypothetical climate change scenarios would cause impairment in water quality. It was found that there is a significant decrease in DO levels due to the impact of climate change on temperature and flows, even when the discharges were at safe permissible levels set by pollution control agencies (PCAs). The necessity to improve the standards of PCA and develop adaptation policies for the dischargers to account for climate change is examined through a fuzzy waste load allocation model developed earlier. Copyright (C) 2011 John Wiley & Sons, Ltd.
Resumo:
The present article reviews some of the current work on a new class of materials which are nanoscale granular materials. We shall discuss in this paper two phase granular materials where one of the phases having nanometric dimension is embedded in a matrix of larger dimension. Known as nanoembedded materials, nanocomposites or ultrafine granular materials, this class of materials has attracted attention because of the opportunity of basic studies on the effect of size and embedding matrix on transformation behaviors as well as some novel properties, which include structural, magnetic and transport properties. These are in addition to the tremendous interests in what is known as quantum structures(embedded particles size less than 5 nm) for the case of semiconductors, which will not be discussed here. We shall primarily review the work done on metallic systems where the dispersed phases have low melting points and borrow extensively from the work done in our group. The phase transformations of the embedded particles show distinctive behavior and yield new insights. We shall first highlight briefly the strategy of synthesis of these materials by non-equilibrium processing techniques, which will be followed by examples where the effect of length scales on phase transformation behaviors like melting and solidification are discussed.
Resumo:
We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize 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 motivate 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 wireless network (described above) as a single cell, we study the 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 (t) (1/eta), 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 characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.
Resumo:
A combined set of thermo-mechanical steps recommended for high strength beta Ti alloy are homogenization, deformation, recrystallization, annealing and ageing steps in sequence. Recrystallization carried out above or below beta transus temperature generates either beta annealed (lath type morphology of alpha) or bimodal (lath+globular morphology of alpha) microstructure. Through variations in heat treatment parameters at these processing steps, wide ranges of length scales of features have been generated in both types of microstructures in a near beta Ti alloy, Ti-5Al-5Mo-5V-3Cr (Ti-5553). 0.2% Yield strength (YS) has been correlated to various microstructural features and associated heat treatment parameters. Relative importance of microstructural features in influencing YS has been identified. Process parameters at different steps have been identified and recommended for attaining different levels of YS for this near beta Ti alloy. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
This article reports on analysis of fracture processes in reinforced concrete (RC) beams with acoustic emission (AE) technique. An emphasis was given to study the effect of loading rate on variation in AE based b-values with the development of cracks in RC structures. RC beams of length 3.2 m were tested under load control at a rate of 4 kN/s, 5 kN/s and 6 kN/s and the b-value analysis available in seismology was used to study the fracture process in RC structures. Moreover, the b-value is related to the strain in steel to assess the damage state. It is observed that when the loading rate is higher, quick cracking development lead to rapid fluctuations and drops in the b-values. Also it is observed that concrete behaves relatively more brittle at higher loading rates (or at higher strain rates). The average b-values are lower as a few but larger amplitudes of AE events occur in contrast to more number of low amplitude AE events occur at low loading rates (or at low strain rates). (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).
Resumo:
Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.