Variations in total and differential milk somatic cell counts and plasmin levels and their role in proteolysis and quality of milk and cheese

Increased plasmin and plasminogen levels and elevated somatic cell counts (SCC) and polymorphonuclear leucocyte levels (PMN) were evident in late lactation milk. Compositional changes in these milks were associated with increased SCC. The quality of late lactation milks was related to nutritional status of herds, with milks from herds on a high plane of nutrition having composition and clotting properties similar to, or superior to, early-mid lactation milks. Nutritionally-deficient cows had elevated numbers of polymorphonuclear leucocytes (PMNs) in their milk, elevated plasmin levels and increased overall proteolytic activity. The dominant effect of plasmin on proteolysis in milks of low SCC was established. When present in elevated numbers, somatic cells and PMNs in particular had a more significant influence on the proteolysis of both raw and pasteurised milks than plasmin. PMN protease action on the caseins showed proteolysis products of two specific enzymes, cathepsin B and elastase, which were also shown in high SCC milk. Crude extracts of somatic cells had a high specificity on αs1-casein. Cheeses made from late lactation milks had increased breakdown of αs1-casein, suggestive of the action of somatic cell proteinases, which may be linked to textural defects in cheese. Late lactation cheeses also showed decreased production of small peptides and amino acids, the reason for which is unknown. Plasmin, which is elevated in activity in late lactation milk, accelerated the ripening of Gouda-type cheese, but was not associated with defects of texture or flavour. The retention of somatic cell enzymes in cheese curd was confirmed, and a potential role in production of bitter peptides identified. Cheeses made from milks containing high levels of PMNs had accelerated αs1-casein breakdown relative to cheeses made from low PMN milk of the same total SCC, consistent with the demonstrated action of PMN proteinases. The two types of cheese were determined significantly different by blind triangle testing.

Differential and numerical models of hysteretic systems with stochastic and deterministic inputs

Many deterministic models with hysteresis have been developed in the areas of economics, finance, terrestrial hydrology and biology. These models lack any stochastic element which can often have a strong effect in these areas. In this work stochastically driven closed loop systems with hysteresis type memory are studied. This type of system is presented as a possible stochastic counterpart to deterministic models in the areas of economics, finance, terrestrial hydrology and biology. Some price dynamics models are presented as a motivation for the development of this type of model. Numerical schemes for solving this class of stochastic differential equation are developed in order to examine the prototype models presented. As a means of further testing the developed numerical schemes, numerical examination is made of the behaviour near equilibrium of coupled ordinary differential equations where the time derivative of the Preisach operator is included in one of the equations. A model of two phenotype bacteria is also presented. This model is examined to explore memory effects and related hysteresis effects in the area of biology. The memory effects found in this model are similar to that found in the non-ideal relay. This non-ideal relay type behaviour is used to model a colony of bacteria with multiple switching thresholds. This model contains a Preisach type memory with a variable Preisach weight function. Shown numerically for this multi-threshold model is a pattern formation for the distribution of the phenotypes among the available thresholds.

Differential inducibility of HLA class I and II antigens by r-IFN gamma in type III bare lymphocyte syndrome.

Case Reports

Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.

Measurement of the differential cross section for the reaction gamman-->pi- p from deuterium.

We report a measurement of the differential cross section for the gamman-->pi- p process from the CLAS detector at Jefferson Laboratory in Hall B for photon energies between 1.0 and 3.5 GeV and pion center-of-mass (c.m.) angles (thetac.m.) between 50 degrees and 115 degrees. We confirm a previous indication of a broad enhancement around a c.m. energy ([sqrt]s) of 2.1 GeV at thetac.m.=90 degrees in the scaled differential cross section s7dsigma/dt and a rapid falloff in a center-of-mass energy region of about 400 MeV following the enhancement. Our data show an angular dependence of this enhancement as the suggested scaling region is approached for thetac.m. from 70 degrees to 105 degrees.

Differential inhibition of human immunodeficiency virus type 1 in peripheral blood mononuclear cells and TZM-bl cells by endotoxin-mediated chemokine and gamma interferon production.

Bacterial lipopolysaccharide (endotoxin) is a frequent contaminant of biological specimens and is also known to be a potent inducer of beta-chemokines and other soluble factors that inhibit HIV-1 infection in vitro. Though lipopolysaccharide (LPS) has been shown to stimulate the production of soluble HIV-1 inhibitors in cultures of monocyte-derived macrophages, the ability of LPS to induce similar inhibitors in other cell types is poorly characterized. Here we show that LPS exhibits potent anti-HIV activity in phytohemagglutinin-stimulated peripheral blood mononuclear cells (PBMCs) but has no detectable anti-HIV-1 activity in TZM-bl cells. The anti-HIV-1 activity of LPS in PBMCs was strongly associated with the production of beta-chemokines from CD14-positive monocytes. Culture supernatants from LPS-stimulated PBMCs exhibited potent anti-HIV-1 activity when added to TZM-bl cells but, in this case, the antiviral activity appeared to be related to IFN-gamma rather than to beta-chemokines. These observations indicate that LPS stimulates PBMCs to produce a complex array of soluble HIV-1 inhibitors, including beta-chemokines and IFN-gamma, that differentially inhibit HIV-1 depending on the target cell type. The results also highlight the need to use endotoxin-free specimens to avoid artifacts when assessing HIV-1-specific neutralizing antibodies in PBMC-based assays.

Recursive directional ligation by plasmid reconstruction allows rapid and seamless cloning of oligomeric genes.

This paper reports a new strategy, recursive directional ligation by plasmid reconstruction (PRe-RDL), to rapidly clone highly repetitive polypeptides of any sequence and specified length over a large range of molecular weights. In a single cycle of PRe-RDL, two halves of a parent plasmid, each containing a copy of an oligomer, are ligated together, thereby dimerizing the oligomer and reconstituting a functional plasmid. This process is carried out recursively to assemble an oligomeric gene with the desired number of repeats. PRe-RDL has several unique features that stem from the use of type IIs restriction endonucleases: first, PRe-RDL is a seamless cloning method that leaves no extraneous nucleotides at the ligation junction. Because it uses type IIs endonucleases to ligate the two halves of the plasmid, PRe-RDL also addresses the major limitation of RDL in that it abolishes any restriction on the gene sequence that can be oligomerized. The reconstitution of a functional plasmid only upon successful ligation in PRe-RDL also addresses two other limitations of RDL: the significant background from self-ligation of the vector observed in RDL, and the decreased efficiency of ligation due to nonproductive circularization of the insert. PRe-RDL can also be used to assemble genes that encode different sequences in a predetermined order to encode block copolymers or append leader and trailer peptide sequences to the oligomerized gene.

Analysis of an asymptotic preserving scheme for linear kinetic equations in the diffusion limit

We present a mathematical analysis of the asymptotic preserving scheme proposed in [M. Lemou and L. Mieussens, SIAM J. Sci. Comput., 31 (2008), pp. 334-368] for linear transport equations in kinetic and diffusive regimes. We prove that the scheme is uniformly stable and accurate with respect to the mean free path of the particles. This property is satisfied under an explicitly given CFL condition. This condition tends to a parabolic CFL condition for small mean free paths and is close to a convection CFL condition for large mean free paths. Our analysis is based on very simple energy estimates. © 2010 Society for Industrial and Applied Mathematics.

An energy-efficient data delivery scheme for delay-sensitive traffic in wireless sensor networks

We propose a novel data-delivery method for delay-sensitive traffic that significantly reduces the energy consumption in wireless sensor networks without reducing the number of packets that meet end-to-end real-time deadlines. The proposed method, referred to as SensiQoS, leverages the spatial and temporal correlation between the data generated by events in a sensor network and realizes energy savings through application-specific in-network aggregation of the data. SensiQoS maximizes energy savings by adaptively waiting for packets from upstream nodes to perform in-network processing without missing the real-time deadline for the data packets. SensiQoS is a distributed packet scheduling scheme, where nodes make localized decisions on when to schedule a packet for transmission to meet its end-to-end real-time deadline and to which neighbor they should forward the packet to save energy. We also present a localized algorithm for nodes to adapt to network traffic to maximize energy savings in the network. Simulation results show that SensiQoS improves the energy savings in sensor networks where events are sensed by multiple nodes, and spatial and/or temporal correlation exists among the data packets. Energy savings due to SensiQoS increase with increase in the density of the sensor nodes and the size of the sensed events. © 2010 Harshavardhan Sabbineni and Krishnendu Chakrabarty.