Preparation and characterization of the N and C monoferric lobes of buffalo lactoferrin produced by proteolysis using proteinase K

The two glycosylated N- and C-terminal lobes of buffalo lactoferrin have been produced by limited proteolysis using proteinase K. Lactoferrin is a single chain glycoprotein of molecular mass 80 kDa with two iron-binding sites and two structural lobes connected by a short peptide. Purified samples of lactoferrin, isolated from buffalo colostrum, were subjected to hydrolysis using trypsin, chymotrypsin, pepsin, subtilisin and proteinase K. The first three proteinases produced two major fragments of approximately 35 and 23 kDa together with small molecular mass peptides. Trypsin and chymotrypsin partly digested lactoferrin, while pepsin converted all the intact lactoferrin into fragments. Subtilisin hydrolysis produced fragments of 40 and 26 kDa together with low molecular mass peptides. However, SDS-PAGE of the proteinase K hydrolysis product gave a clear band at 40 kDa together with a band indicating a substantial quantity of low molecular mass peptides (< 14.4 kDa). Upon ion-exchange chromatography this product gave two major fractions, which were further purified by gel filtration and identified as the C and N lobes from their N-terminal sequences. Thus, the 40 kDa band in SDS-PAGE of the proteinase K hydrolysis product contained two fragments of equal molecular mass. On further hydrolysis with proteinase K, the N lobe was completely hydrolysed into low molecular mass peptides, while only a small fraction of the C lobe was converted into small products. This suggested that an inhibitory fragment was present in the C lobe that was released on hydrolysis to small fragments and prevented complete digestion of the C lobe by high-affinity binding to the active site of proteinase K. This fragment was isolated from the lactoferrin-proteinase K complex and its sequence determined to be Val-Ala-Gln-Gly-Gly-Ala-Ala-Gly-Leu-Ala. Circular dichroism studies indicated a high alpha-helical content in the native lactoferrin while comparatively lower helical structures were present in the N and C lobes. In addition, the iron saturations of the N and C lobes appeared to be lower than that of the native protein.     

A novel fed-batch digestion system for biomethanation of plant biomasses

Plant biomasses, which in the absence of adequate pretreatment pose serious operational problems in biogas production using conventional domestic flow-through digesters, can be successfully digested in a novel fedbatch digestion system that produces a steady rate of biogas. Basically, the system is a batch digestion operated with a regular input of a calculated amount of feed based on first order decay kinetics in order to maintain a regular biogas production rate. For nearly three years the system was tested in a laboratory-scale fed-batch digester (10 l) using dried water hyacinth as feed providing the desired biogas production rate. A field-scale domestic digester of masonry construction with a working volume of 10 m3 was designed and tested for about 9 months by feeding a mixture of dried water hyacinth or banana stem along with sugarcane press mud, yielding an average biogas production of 90-100% of the expected rate calculated on the basis of the feed rate.     

Computationally Efficient Motion Estimation Algorithm for HEVC

In this paper, we present a novel computationally efficient motion estimation (ME) algorithm for high-efficiency video coding (HEVC). The proposed algorithm searches in the hexagonal pattern with a fixed number of search points at each grid. It utilizes the correlation between contiguous pixels within the frame. In order to reduce the computational complexity, the proposed algorithm utilizes pixel truncation, adaptive search range, sub-sampling and avoids some of the asymmetrical prediction unit techniques. Simulation results are obtained by using the reference software HM (e n c o d e r_l o w d e l a y_P_m a i n and e n c o d e r_r a n d o m a c c e s s_m a i n profile) and shows 55.49% improvement on search points with approximately the same PSNR and around 1% increment in bit rate as compared to the Test Zonal Search (TZS) ME algorithm. By utilizing the proposed algorithm, the BD-PSNR loss for the video sequences like B a s k e t b a l l P a s s_416 × 240@50 and J o h n n y_1280 × 720@60 is 0.0804 dB and 0.0392 dB respectively as compared to the HM reference software with the e n c o d e r_l o w d e l a y_P_m a i n profile.     

An Investigation of Massive Gain in Hybrid Configurable Cylindrical Dielectric Resonator Antenna

Delay Tolerant Networks (DTNs) have attracted various interests these days. Since DTNs are subject to high loss rate, large delay, intermittent connection, and even no end-to-end connectivity, relay nodes, such as throwboxes, are deployed to enhance network performance. Internet-based systems have contemporaneous connectivity between location-distributed nodes, and this does not apply to DTNs. Thus, the traditional relay node deployment strategies are no longer suitable for DTNs. In this paper, we propose a novel strategy, named Connection-2 (\(CO_2\)), to deploy throwboxes to enhance the fault tolerance of DTNs. \(CO_2\) constructs a 2-connected DTN using an approximation algorithm. Every mobile node in the 2-connected DTN can reach another mobile node via two or more node-disjoint paths within its mobility range. While enhancing fault tolerance, the number of throwboxes that \(CO_2\) requires is small. We conduct various experiments based on the simulation of the real Tuscaloosa bus transit system and compare its performance with two popular strategies. Experimental results show that \(CO_2\) is effective.     

Yield optimization in large RAM's with hierarchical redundancy

The authors present and analyze large RAM architectures with hierarchical redundancy and determine the optimal redundancy organization for yield enhancement. A two-level redundancy scheme is used for defect tolerance, and the defect distribution is modeled using the compounded Poisson model. The tree random access memory (TRAM), which has been proposed as a design methodology for future multimegabit memories (N. Jarwala et al., 1988) is considered as an example for modeling and optimization. The results show that the two-level hierarchical redundancy approach, with spare bit and word lines within memory quadrants, and additional spare modules for global sparing, along with redundant interconnections can efficiently provide defect tolerance and viable yields for future generations of high-density dynamic random access memories     

Probabilistic Discovery of Semantically Diverse Content in MANETs

Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralized nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus among the nodes is kept to a minimum. This paper addresses an issue within the domain of semantic content discovery, namely, its current reliance on the preexisting agreement between the schema of content providers and consumers. We present OntoMobil, a semantic discovery model for ad hoc networks that removes the assumption of a globally known schema and allows nodes to publish information autonomously. The model relies on the randomized dissemination and replication of metadata through a gossip protocol. Given schemas with partial similarities, the randomized metadata dissemination mechanism facilitates eventual semantic agreement and provides a substrate for the scalable discovery of content. A discovery protocol can then utilize the replicated metadata to identify content within a predictable number of hops using semantic queries. A stochastic analysis of the gossip protocol presents the different trade-offs between discoverability and replication. We evaluate the proposed model by comparing OntoMobil against a broadcast-based protocol and demonstrate that semantic discovery with proactive replication provides good scalability properties, resulting in a high discovery ratio with less overhead than a reactive nonreplicated discovery approach.     

Formulae for determining heterodyne system spurious frequencies that coincide with desired output frequency

In this paper, formulae to determine the lowest order and other higher order spurious frequencies that coincide with desired output signal frequencies of mixers have been derived. The proposed formulae give general expressions that are suitable for any order of heterodyne mixing. The formulae have been verified using a suitable example and compared with the simulation results obtained through the radio frequency simulation software of Advanced Design System. The formulae directly reveal the order of the troublesome spurious frequencies that the designers would encounter in heterodyne systems. In comparison with these direct formulae, the results of existing spurious analysis software are based on the maximum order of simulation carried out. Based on these simulations, the coinciding spurious components have to be manually sorted out. Proposed formulae are quick tools used by the microwave system and circuit designers for choosing and finalizing heterodyne frequencies in their designs without the need for any simulations.     

Efficiency enhancement for indirect vector-controlled induction motor drive

In this paper, efficiency enhancement algorithms are developed and implemented on an indirect vector-controlled three-phase induction motor (IM) drive, and its performance under different operating conditions is analysed. The controllable electrical losses in the IM are minimised through the optimal control of direct axis (d-axis) stator current, and improvement in motor efficiency is achieved by weakening the rotor flux. The optimal d-axis stator current is also estimated using particle swarm optimisation (PSO) to validate the results obtained through analytical control method. The developed algorithms are tested under various operating conditions and the dynamic performance of the IM drive is analysed. The effectiveness of analytical and PSO-based efficiency optimisation control over conventional constant flux control, especially during light load at rated speed operation, is summarised. The effectiveness of the developed algorithm is validated experimentally through development of laboratory prototype set-up. The effect of parametric variation on efficiency, stator current, torque and speed of IM drive is studied through sensitivity analysis. The effect of variation in stator and rotor resistance due to change in operating temperature of the IM is also analysed and the robustness of the developed algorithm against parametric variations is demonstrated through simulation and experimental studies.     

Computationally efficient variational Bayesian method for PAPR reduction in multiuser MIMO‐OFDM systems

This paper investigates the use of the inverse‐free sparse Bayesian learning (SBL) approach for peak‐to‐average power ratio (PAPR) reduction in orthogonal frequency‐division multiplexing (OFDM)‐based multiuser massive multiple‐input multiple‐output (MIMO) systems. The Bayesian inference method employs a truncated Gaussian mixture prior for the sought‐after low‐PAPR signal. To learn the prior signal, associated hyperparameters and underlying statistical parameters, we use the variational expectation‐maximization (EM) iterative algorithm. The matrix inversion involved in the expectation step (E‐step) is averted by invoking a relaxed evidence lower bound (relaxed‐ELBO). The resulting inverse‐free SBL algorithm has a much lower complexity than the standard SBL algorithm. Numerical experiments confirm the substantial improvement over existing methods in terms of PAPR reduction for different MIMO configurations.     

Traffic grooming in WDM optical network with grooming resources at Max Connectivity nodes

In this paper, we propose Max Connectivity grooming in WDM mesh networks under static lightpath connection requests. The grooming and wavelength conversion resources are placed at the nodes having maximum connections. We propose a heuristic genetic algorithm (GA) model to solve grooming, routing and wavelength assignment. The GA algorithm has been used to optimize the cost of grooming and wavelength conversion resources. The blocking probability has been investigated under different lightpath connections. The performance of Max Connectivity grooming has been compared with other grooming policies. Our results indicate the improvement of resource utilization with minimum blocking probability.