989 resultados para Poly(dimethylsiloxane) Networks
Resumo:
Thermal degradation of copolyurethanes based on hydroxyl terminated polybutadiene (HTPB) and poly(12-hydroxy stearic acid-co-TMP) ester polyol (PEP) with varying compositions has been studied by thermo-gravimetric and pyrolysis-GC techniques. The copolyurethanes were found to decompose in multiple stages and the kinetic parameters were found to be dependent on the method of their evaluation. The activation energy for the initial stage of decomposition was found to increase, and for the main stage decreases with the increase in PEP content. The pyrolysis-GC studies on the ammonium perchlorate filled copolyurethanes (solid propellants) showed that the major products during the pyrolysis were C-2, C-3 hydrocarbons and butadiene. The amount of C-2 fraction in the pyrolyslate increased with solid loading, as well as with the HTPB content in the copolyurethanes. A linear relationship apparently exists between the amount of C-2 fraction and the burn rates of the solid propellants. (C) 2000 Elsevier Science Ltd. All rights reserved.
Resumo:
A method is presented to model server unreliability in closed queuing networks. Breakdowns and repairs of servers, assumed to be time-dependent, are modeled using virtual customers and virtual servers in the system. The problem is thus converted into a closed queue with all reliable servers and preemptive resume priority centers. Several recent preemptive priority approximations and an approximation of the one proposed are used in the analysis. This method has approximately the same computational requirements as that of mean-value analysis for a network of identical dimensions and is therefore very efficient
Resumo:
This paper deals with the development and performance evaluation of three modified versions of a scheme proposed for medium access control in local area networks. The original scheme implements a collision-free and fair medium arbitration by using a control wire in conjunction with a data bus. The modifications suggested in this paper are intended to realize the multiple priority function in local area networks.
Resumo:
We study wireless multihop energy harvesting sensor networks employed for random field estimation. The sensors sense the random field and generate data that is to be sent to a fusion node for estimation. Each sensor has an energy harvesting source and can operate in two modes: Wake and Sleep. We consider the problem of obtaining jointly optimal power control, routing and scheduling policies that ensure a fair utilization of network resources. This problem has a high computational complexity. Therefore, we develop a computationally efficient suboptimal approach to obtain good solutions to this problem. We study the optimal solution and performance of the suboptimal approach through some numerical examples.
Resumo:
The objective of the present paper is to select the best compromise irrigation planning strategy for the case study of Jayakwadi irrigation project, Maharashtra, India. Four-phase methodology is employed. In phase 1, separate linear programming (LP) models are formulated for the three objectives, namely. net economic benefits, agricultural production and labour employment. In phase 2, nondominated (compromise) irrigation planning strategies are generated using the constraint method of multiobjective optimisation. In phase 3, Kohonen neural networks (KNN) based classification algorithm is employed to sort nondominated irrigation planning strategies into smaller groups. In phase 4, multicriterion analysis (MCA) technique, namely, Compromise Programming is applied to rank strategies obtained from phase 3. It is concluded that the above integrated methodology is effective for modeling multiobjective irrigation planning problems and the present approach can be extended to situations where number of irrigation planning strategies are even large in number. (c) 2004 Elsevier Ltd. All rights reserved.
Resumo:
It has been shown in an earlier paper that I-realizability of a unate function F of up to six variables corresponds to ' compactness ' of the plot of F on a Karnaugh map. Here, an algorithm has been presented to synthesize on a Karnaugh map a non-threahold function of up to Bix variables with the minimum number of threshold gates connected in cascade. Incompletely specified functions can also be treated. No resort to inequalities is made and no pre-processing (such as positivizing and ordering) of the given switching function is required.
Resumo:
The poly(vinylidene fluoride)/CaCu3Ti4O12 (CCTO) nanocrystal composite films (thickness approximate to 85 mu m) with relatively high dielectric permittivity (90 at 100 Hz) were prepared by the solution casting followed by spin coating technique. The structural, the microstructural and the dielectric properties of the composites were studied using X-ray diffraction, Scanning Electron Microscope, and Impedance analyzer respectively. The effective dielectric permittivity (e(eff)) of the composite increased with increase in the volume fraction of CCTO at all the frequencies (100 Hz to 1 MHz) under investigation. The room temperature dielectric permittivity which is around 90 at 100 Hz, has increased to about 290 at 125 degrees C (100 Hz). These results may be exploited in the development of high energy density capacitors.
Resumo:
In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.
Resumo:
Artificial neural networks (ANNs) have shown great promise in modeling circuit parameters for computer aided design applications. Leakage currents, which depend on process parameters, supply voltage and temperature can be modeled accurately with ANNs. However, the complex nature of the ANN model, with the standard sigmoidal activation functions, does not allow analytical expressions for its mean and variance. We propose the use of a new activation function that allows us to derive an analytical expression for the mean and a semi-analytical expression for the variance of the ANN-based leakage model. To the best of our knowledge this is the first result in this direction. Our neural network model also includes the voltage and temperature as input parameters, thereby enabling voltage and temperature aware statistical leakage analysis (SLA). All existing SLA frameworks are closely tied to the exponential polynomial leakage model and hence fail to work with sophisticated ANN models. In this paper, we also set up an SLA framework that can efficiently work with these ANN models. Results show that the cumulative distribution function of leakage current of ISCAS'85 circuits can be predicted accurately with the error in mean and standard deviation, compared to Monte Carlo-based simulations, being less than 1% and 2% respectively across a range of voltage and temperature values.
Resumo:
The current density-voltage (J-V) characteristics of poly(3-methylthiophene) devices show a negative differential resistance (NDR) at room temperature with a large peak to valley current ratio (similar to 507). This NDR can be tuned by two orders of magnitude by controlling the carrier density due to the variation of the space-charge region in the device. The temperature and scan rate dependent J-V measurements infer that the NDR is mainly driven by the trapping and de-trapping of carriers. The photo-generation of carriers is observed to reduce the NDR effect.
Resumo:
In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.
Resumo:
We report experimental studies which confirm our prediction, namely that the ordered structure of poly(hydroxypro1ine) in solution corresponds to a left-handed helical structure with intrachain hydrogen bonds. The CD studies show that the poly(hydroxypro1ine) molecule has essentially the same conformation in aqueous solution and in the film obtained subsequently by evaporation. X-ray diffraction patterns of the sample in this form (B form) have been recorded at different relative humidities. The patterns recorded at relative humidities over 66% can be interpreted in terms of a helical structure with intrachain hydrogen bonds. These results lead us to conclude that the ordered conformation of poly(hydroxypro1ine) in solution is form B and not form A. This offers a simple explanation for the greater stability of the poly(hydroxypro1ine) helix in solution as compared to the poly(pro1ine) form I1 helix and also for the absence of mutarotation for poly(hydroxypro1ine).