An Adaptive Transmission Mode Selection Scheme for Cellular Underlaid D2D Communication

In this paper, we propose to use Artificial Bee Colony (ABC) optimization to solve the joint mode selection, channel assignment, and power allocation (JMSCPA) problem to maximize system throughput and spectral efficiency. JMSCPA is a problem where the allocation of channel and power depends on the mode selection. Such problems require two step solution and are called bi-level optimization problems. As bi-level optimization increases the complexity and computational time, we propose a modified version of single-level ABC algorithm aided with the adaptive transmission mode selection algorithm to allocate the cellular, reuse, and dedicated modes to the DUs along with channel and power allocation based on the network traffic load scenarios. A single variable, represented by the users (CUs and DUs) is used to allocate mode selection, and channel allocation to solve the JMSCPA problem, leading to a simpler solution with faster convergence, and significant reduction in the computational complexity which scales linearly with the number of users. Further, the proposed solution avoids premature stagnation of conventional ABC into local minima by incorporating a modification in its update procedure. The efficacy of the ABC-aided approach, as compared to the results reported in the literature, is validated by extensive numerical investigations under different simulation scenarios.

     

Machine independent AND and OR parallel execution of logicprograms. I. The binding environment

We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel     

Minimum-phase filter design from linear-phase startpoint viabalanced model truncation

A new practical design approach for minimum-phase FIR or IIR filters, setting out from a high dimensionality FIR linear-phase prototype is described. The novelty of this technique lies in overcoming the inherent problem of finding the roots of a high order polynomial with repeated and/or very closely clustered roots     

Air flow through a non-airconditioned bus with open windows

Open window buses without air-conditioning are a major mode of urban and inter-city transport in most countries. High occupancy combined with hot and humid conditions makes travel in these buses quite uncomfortable. In this study air flow through a bus has been studied that could be the basis for low cost and eco-friendly methods of increasing passenger comfort and possibly reduce drag. The aerodynamics of such a road vehicle has not been studied as previous investigations have been confined to vehicles with closed windows that present a smooth exterior to air flow. Using a 1:25 scaled Perspex model of an urban bus in Delhi, flow visualization was performed in a water channel. The Reynolds numbers were one-tenth of a real bus moving at 10 m/s. Smoke and tuft visualizations were also performed on an urban bus at 40 km/h. Numerical simulations were performed at the actual Reynolds number. Even though there were Reynolds number differences, the broad features were similar. Air enters the bus from the rear windows, moves to the front (relative to the bus) and exits from the front windows. Inside air velocity relative to the bus is about one-tenth of the free-stream velocity. The flow is highly three-dimensional and unsteady.     

Some theorems on Walsh transforms of quantizer differential andintegral nonlinearity

Methods for diagnosing weight coefficient tolerances of quantizers are derived, based on the assumption of known and available data about the quantizer's nonlinearities. Two of the methods are direct and based on the Householder orthogonalization, applied to an overdetermined equation system containing data about differential or integral nonlinearities. The remaining two methods are indirect and are based on two theorems that use the Walsh transformation on the quantizer's differential or integral nonlinearities. The language MATLAB has been used to good effect for simulation of these techniques     

Reperfusion injury delays healing of intestinal anastomosis in a rat

This SAEM position paper clarifies the role of emergency medicine in health care delivery. It builds upon the working definition of emergency medicine developed by the American College of Emergency Physicians in 1994 by describing the health care role of emergency physicians (EPs). EPs are first-contact providers who care for all patients regardless of age, gender, time of presentation, or ability to pay. They remain the only continuously accessible specialty for patients seeking help and solace in the health care system. They are an essential link in the health care continuum between primary care physicians, specialists, the out-of-hospital system, the patient, inpatient services, and communication services. The EP's role is in organizing and monitoring the emergency care delivery system. Part of this role is to better align the health care provider training and ability with the specific medical needs of a patient. The emergency health care system remains the essential medical safety net for all individuals needing care in this country.     

CARD: A Contact-based Architecture for Resource Discovery in Wireless Ad Hoc Networks

Traditional protocols for routing in ad hoc networks attempt to obtain optimal or shortest paths, and in doing so may incur significant route discovery overhead. Such approaches may be appropriate for routing long-lived transfers where the initial cost of route discovery may be amortized over the life of the connection. For short-lived connections, however, such as resource discovery and small transfers, traditional shortest path approaches may be quite inefficient. In this paper we propose a novel architecture, CARD, for resource discovery in large-scale wireless ad hoc networks. Our mechanism is suitable for resource discovery as well as routing very small data transfers or transactions in which the cost of data transfer is much smaller than the cost of route discovery. Our architecture avoids expensive mechanisms such as global flooding and complex hierarchy formation and does not require any location information. In CARD resources within the vicinity of a node, up to a limited number of hops, are discovered using a proactive scheme. For resources beyond the vicinity, each node maintains a few distant nodes called contacts. Contacts help in creating a small world in the network and provide an efficient way to query for distant resources. Using contacts, the network view (or reachability) of the nodes increases, reducing the discovery overhead and increasing the success rate. On the other hand, increasing the number of contacts also increases control overhead. We study such trade-off in depth and present mechanisms for contact selection and maintenance that attempt to increase reachability with reduced overhead. Our schemes adapt gracefully to network dynamics and mobility using soft-state periodic mechanisms to validate and recover paths to contacts. Our simulation results show that CARD is scalable and can be configured to provide desirable performance for various network sizes. Comparisons with other schemes show overhead savings reaching over 93% (vs. flooding) and 80% (vs. bordercasting or zone routing) for high query rates in large-scale networks.     

Stepwise-Graded Si3N4–SiC Ceramics with Improved Wear Properties

The processing of stepwise graded Si₃N₄/SiC ceramics by pressureless co-sintering is described. Here, SiC (high elastic modulus, high thermal expansion coefficient) forms the substrate and Si₃N₄ (low elastic modulus, low thermal expansion coefficient) forms the top contact surface, with a stepwise gradient in composition existing between the two over a depth of ∼1.7 mm. The resulting Si₃N₄ contact surface is fine-grained and dense, and it contains only 2 vol% yttrium aluminum garnet (YAG) additive. This graded ceramic shows resistance to cone-crack formation under Hertzian indentation, which is attributed to a combined effect of the elastic-modulus gradient and the compressive thermal-expansion-mismatch residual stress present at the contact surface. The presence of the residual stress is corroborated and quantified using Vickers indentation tests. The graded ceramic also possesses wear properties that are significantly improved compared with dense, monolithic Si₃N₄ containing 2 vol% YAG additive. The improved wear resistance is attributed solely to the large compressive stress present at the contact surface. A modification of the simple wear model by Lawn and co-workers is used to rationalize the wear results. Results from this work clearly show that the introduction of surface compressive residual stresses can significantly improve the wear resistance of polycrystalline ceramics, which may have important implications for the design of contact-damage-resistant ceramics.     

Age and ethnicity affect the risk and outcome of focal segmental glomerulosclerosis

In patients with proteinuria, African-American (AA) ethnicity is reported to be a risk factor for focal segmental glomerulosclereosis (FSGS) and its progression to end-stage renal disease (ESRD). We reviewed our single-center experience to determine the probability of FSGS and its progression to ESRD based on ethnicity and age at presentation in children with proteinuria with or without nephrotic syndrome. Proteinuria without systemic disease or acute glomerulonephritis was the presenting feature in 17% (236/1,403) of children in the renal patient database of Texas Children's Hospital, Baylor College of Medicine. Histopathological diagnoses were established in 107 of 236 patients (45%). FSGS was identified in 65 patients, accounting for 28% of all patients with proteinuria and 61% of patients who underwent renal biopsy. FSGS was more prevalent in AA (45%) than in non-AA patients (22%) (P=0.001), and AA patients with FSGS were older at presentation (12.7+/-4.4 years) than non-AA patients (5.6+/-4.6 years) (P<0.001). Among patients who underwent renal biopsy, increasing age at presentation increased the probability of having FSGS in AA but not non-AA patients (P=0.04). Five-year actuarial renal survival of FSGS was worse in AA (8%) than in non-AA patients (31%) (P=0.01). These data suggest an increased risk and worse outcome of FSGS in AA compared with non-AA children.     

Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems

The Journal of Supercomputing - Multiple tasks arrive in the distributed systems that can be executed in either parallel or sequential manner. Before the execution, tasks are scheduled prioritywise...