Influence of pH on the DSSC Performance of Template Assisted SnO2 Nanostructures

Journal of Inorganic and Organometallic Polymers and Materials - This paper reports the performance of alizarin based SnO2 dye-sensitized solar cells. A novel template assisted method has been...     

Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno, and SACK

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.     

A KBES for integrated engineering

The expert process of engineering involves application of knowledge fundamental to the engineering process at one end, and of compiled knowledge in the form of heuristics gained through many years of experience at the other. Developments in Artificial Intelligence have made the process of computer aided engineering richer by enabling the simulation of this human process of engineering, which until now has been difficult to capture. Knowledge Based Expert Systems (KBES) in engineering developed so far have addressed only narrow domains of the entire process of engineering. This paper discusses a KBES shell (IES) that integrates various AI technologies, which makes it possible to implement new problem-solving strategies required for efficient handling of the entire engineering process. Issues in the integrated process of engineering are discussed first, in order to evolve a specification for the shell. The blackboard architecture is shown to be the ideal backbone for such a shell. The details of inference techniques, the knowledge based backtracking mechanism and the DBMS used in the IES are presented. The application of the IES is demonstrated using the domain of integrated engineering of steel industrial structures as an example. This application encompasses the engineering activities of conceptual design, detailed design, documentation and construction planning.     

Space and time efficient parallel algorithms and software for EST clustering

Expressed sequence tags, abbreviated as ESTs, are DNA molecules experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and for understanding important genetic variations such as those resulting in diseases. We present the algorithmic foundations and implementation of PaCE, a parallel software system we developed for large-scale EST clustering. The novel features of our approach include 1) design of space-efficient algorithms to limit the space required to linear in the size of the input data set, 2) a combination of algorithmic techniques to reduce the total work without sacrificing the quality of EST clustering, and 3) use of parallel processing to reduce runtime and facilitate clustering of large data sets. Using a combination of these techniques, we report the clustering of 327,632 rat ESTs in 47 minutes, and 420,694 Triticum aestivum ESTs in 3 hours and 15 minutes, using a 60-processor IBM xSeries cluster. These problems are well beyond the capabilities of state-of-the-art sequential software. We also present thorough experimental evaluation of our software including quality assessment using benchmark Arabidopsis EST data.     

Performance and buffering requirements of Internet protocols overATM ABR and UBR services

ATM networks are quickly being adopted as backbones over various parts of the Internet. This article studies the dynamics and performance of the TCP/IP protocol over the ABR and UBR services of ATM networks. Specifically the buffering requirements in the ATM switches as well as the ATM edge devices. It is shown that with a good switch algorithm, ABR pushes congestion to the edges of the ATM network while UBR leaves it inside the ATM portion. As a result, the switch ABR buffer requirement for zero-packet-loss high-throughput TCP transmission is a sublinear function of the number of TCP connections     

Yield optimization for complex reactor systems

For complex reactions, the choice of reactor type is important for attaining optimum product yields. Strategies for specifying reactor types have beenIn this paper, product yield in a Van de Vusse reaction scheme has been studied for a wide range of the rate constants, in a reactor system consisting     

Cross‐polarization reduction of microstrip antenna using microwave absorbers

In this article, a metamaterial inspired microwave absorber is used to reduce the cross‐polarization (XP) level of the radiated wave in microstrip antenna (MSA). A microwave absorber unit‐cell has been analyzed and implemented to reduce the cross polarization (XP) level in a single element and a 2 × 2 microstrip patch array antennas. The antennas have been designed on a FR‐4 substrate of thickness 0.8 mm at 10.1 GHz center frequency. The 2 × 2 patch array antenna with and without the absorbers have been experimentally verified for the S11 parameter, the radiation pattern, and the XP suppression in H‐plane and a good comparison has been found.     

Weak state versus strong state: an analysis of a probabilistic state mechanism for dynamic networks

Network protocols coordinate their decision making using information about entities in remote locations. Such information is provided by state entries. To remain valid, the state information needs to be refreshed via control messages. When it refers to a dynamic entity, the state has to be refreshed at a high rate to prevent it from becoming stale. In capacity constrained networks, this may deteriorate the overall performance of the network. The concept of weak state has been proposed as a remedy to this problem in the context of routing in mobile ad-hoc networks. Weak state is characterized by probabilistic semantics and local refreshes as opposed to strong state that is interpreted as absolute truth. A measure of the probability that the state remains valid, i.e. confidence, accompanies the state. The confidence is decayed in time to adapt to dynamism and to capture the uncertainty in the state information. This way, weak state remains valid without explicit state refresh messages. We evaluate the consistency of weak state and strong state using two notions of distortion. Pure distortion measures the average difference between the actual value of the entity and the value that is provided by the remote state. Informed distortion captures both this difference and the effect of confidence value on state consistency. Using a mathematical analysis and simulations, we show that weak state reduces the distortion values when it provides information about highly dynamic entities and/or it is utilized for protocols that is required to incur a low amount of overhead.