Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

Reducing cycle times in manufacturing and supply chains by input and service rate smoothing

A key performance parameter of a manufacturing network or supply chain is its cycle time; the time that a typical item spends in the network. A previous simulation study on a semiconductor assembly and test facility showed that cycle times could be reduced by having smooth input and service rates. This suggested that there is a “cycle time principle” that, for a system with a specified throughput or input rate, the shortest cycle times are obtained when the input and service rates do not vary over time. We prove that this principle is true for the M/G/1 and M/M/s queueing systems and Jackson networks. The analysis involves establishing several results on the concavity of waiting time probabilities and the convexity of expected waiting times and queue lengths, as functions of input and service rates. These results also have natural uses in other optimization problems.     

Parallel transport: a new transport layer paradigm for enabling Internet quality of service

The transport layer in the network protocol stack serves as a liaison between the application and the underlying network. Any quality of service provided by the network thus has to be effectively translated by the transport layer protocol in order to be enjoyed by the applications. In this article, we argue for a fundamental rethinking of the transport layer design to facilitate such QoS delivery. We identify the key requirement for a QoS enabling transport layer protocol as the ability to effectively handle multiplicity in terms of user differentiation levels, network resources, and service models. However, TCP, the transport layer protocol predominantly used in the Internet, is unable to support such multiplicity due to its single-state design. We extend TCP to a parallel transport layer protocol called parallel TCP (pTCP) that can tackle the different dimensions of multiplicity, and hence enable varying classes of QoS to applications. We discuss the applicability of pTCP in three specific domains with different levels of network support for QoS, and present simulation results substantiating our arguments.     

TFRC friendliness and the case of ECN

The TFRC protocol has been proposed as a TCP‐friendly protocol to transport streaming media over the Internet. However, its deployment is still questionable because it has not been compared to other important protocols, analysed in the presence of important mechanisms, such as the explicit congestion notification (ECN), and studied under more realistic network conditions. In this paper, we address these three aspects, including other congestion control protocols not considered before in the same investigation, such as TCP Tahoe, Reno, Newreno, Vegas, Sack, GAIMD, and the Binomial algorithms, the effect of using ECN in the friendliness of the protocols, and the fairness of the protocols under static and dynamic network conditions. We found that TFRC can be safely deployed in the Internet if competing with TCP Tahoe, New Reno and SACK since fairness is achieved under all scenarios considered. We also found that ECN actually helps in achieving better fairness. However, fairness problems arise when TFRC competes with TCP Reno, GAIMD, SQRT or IIAD in static or dynamic conditions, or both. We used normalized throughput, fairness index, and convergence time as the main performance metrics for comparison. Copyright © 2004 John Wiley & Sons, Ltd.     

Medium access control in ad hoc networks with MIMO links: optimization considerations and algorithms

we present a medium access control (MAC) protocol for ad hoc networks with multiple input multiple output (MIMO) links. MIMO links provide extremely high spectral efficiencies in multipath channels by simultaneously transmitting multiple independent data streams in the same channel. MAC protocols have been proposed in related work for ad hoc networks with other classes of smart antennas such as switched beam antennas. However, as we substantiate in the paper, the unique characteristics of MIMO links coupled with several key optimization considerations, necessitate an entirely new MAC protocol. We identify several advantages of MIMO links, and discuss key optimization considerations that can help in realizing an effective MAC protocol for such an environment. We present a centralized algorithm called stream-controlled medium access (SCMA) that has the key optimization considerations incorporated in its design. Finally, we present a distributed SCMA protocol that approximates the centralized algorithm and compare its performance against that of baseline protocols that are CSMA/CA variants.     

Control of power factor correcting boost converter withoutinstantaneous measurement of input current

This paper proposes a new control method for the constant-frequency control of power factor correcting boost power converter using a sinewave template modulated PWM signal which eliminates the need for instantaneous measurement of the line current for the switching control of the boost converter. The control strategy is based on the notion that the line current can be forced to trace a deterministic waveform such as a sinusoid by considering the implicit model of the sinewave in the boost converter controller structure. The modulating sinewave template is generated using the line voltage, the boost converter output voltage and the load current. The paper provides the analysis and the design of the controller and presents simulation and implementation results to demonstrate its effectiveness     

Esterification of valeric acid over PTA supported mesoporous Al-SBA-15 as efficient solid acid catalysts

Journal of Porous Materials - Valeric acid can be produced by selective hydrogenation of biomass-derived levulinic acid. The present work aims to synthesize ethyl valerate (EV), a fuel, fuel...     

A study on development of cognitive support features in recent ontology visualization tools

Ontologies are currently emerging as representation techniques for overlapping compatibility context domains. The continuing need for more effective information retrieval has lead to the creation of the notions of the semantic web and personalized information management. Subsequently, the need for effective ontology visualization for design, management and browsing has arisen. Several ontology visualization tools have come out to strengthen the users’ cognitive support. The primary goal of this paper is to present a survey on recently implemented ontology visualization tools and their contributions in the enrichment of users’ cognitive support. This work also presents the preliminary results of an evaluation of three visualization tools to determine the suitability of each method for end user applications where ontologies are used as browsing aids.