Milk from cows fed a diet with a high forage:concentrate ratio improves inflammatory state,oxidative stress,and mitochondrial function in rats

Excessive energy intake may evoke complex biochemical processes characterized by inflammation, oxidative stress, and impairment of mitochondrial function that represent the main factors underlying noncommunicable diseases. Because cow milk is widely used for human nutrition and in food industry processing, the nutritional quality of milk is of special interest with respect to human health. In our study, we analyzed milk produced by dairy cows fed a diet characterized by a high forage:concentrate ratio (high forage milk, HFM). In view of the low n-6:n-3 ratio and high content of conjugated linoleic acid of HFM, we studied the effects of this milk on lipid metabolism, inflammation, mitochondrial function, and oxidative stress in a rat model. To this end, we supplemented for 4 wk the diet of male Wistar rats with HFM and with an isocaloric amount (82 kJ, 22 mL/d) of milk obtained from cows fed a diet with low forage:concentrate ratio, and analyzed the metabolic parameters of the animals. Our results indicate that HFM may positively affect lipid metabolism, leptin:adiponectin ratio, inflammation, mitochondrial function, and oxidative stress, providing the first evidence of the beneficial effects of HFM on rat metabolism.     

Constructing Pseudo-Random Permutations with a Prescribed Structure

We show how to construct pseudo-random permutations that satisfy a certain cycle restriction, for example that the permutation be cyclic (consisting of one cycle containing all the elements) or an involution (a self-inverse permutation) with no fixed points. The construction can be based on any (unrestricted) pseudo-random permutation. The resulting permutations are defined succinctly and their evaluation at a given point is efficient. Furthermore, they enjoy a fast forward property, i.e. it is possible to iterate them at a very small cost. Received 10 August 2000 and revised 30 September 2000 Online publication 9 April 2001     

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several protocols that achieve these goals. Broadly speaking, the protocols are either cryptographic or physical. By a cryptographic protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the protocol relies on computational hardness. By a physical protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our physical protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic protocols are direct and efficient, and do not involve a reduction to other problems. The physical protocols are meant to be understood by “lay-people” and implementable without the use of computers. Research of R. Gradwohl was supported by US-Israel Binational Science Foundation Grant 2002246. Research of M. Naor was supported in part by a grant from the Israel Science Foundation. Research of B. Pinkas was supported in part by the Israel Science Foundation (grant number 860/06). Research of G.N. Rothblum was supported by NSF grant CNS-0430450 and NSF grant CFF-0635297.     

Large scale fabrication of asymmetric 2D and 3D micro/nano array pattern structures using multi-beam interference lithography technique for Solar cell texturing application

Microsystem Technologies - A method for the large scale fabrication of nano/micro array patterned structure for solar Photovoltaics (PV) is demonstrated by the use of laser interference lithography...     

Scalable and dynamic quorum systems

We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algorithmic complexity of finding a quorum in case of random failures. We show a tradeoff between the load of a quorum system and its probe complexity for non adaptive algorithms. We analyze the algorithmic probe complexity of the Paths quorum system suggested by Naor and Wool in [29], and present two optimal algorithms. The first is a non adaptive algorithm that matches our lower bound. The second is an adaptive algorithm with a probe complexity that is linear in the cardinality of the smallest quorum set. We supply a constant degree network in which these algorithms could be executed efficiently. Thus the Paths quorum system is shown to have good balance between many measures of quality. Our second contribution is presenting Dynamic Paths - a suggestion for a dynamic and scalable quorum system, which can operate in an environment where elements join and leave the system. The quorum system could be viewed as a dynamic adaptation of the Paths system, and therefore has low load high availability and good probe complexity. We show that it scales gracefully as the number of elements grows.Published online: 10 December 2004Moni Naor: Incumbent of the Judith Kleeman ProfessorialChair.Research supported in part by the RAND/APX grant from the EU Program IST     

Novel sol-gel derived calcium phosphate coatings on Mg4Y alloy

Calcium phosphates (CaPs) and silicon containing calcium phosphates (Si-CaPs) coatings on a biodegradable magnesium yttrium alloy (Mg4Y) were prepared by a sol-gel technique to improve the bioactivity of the alloy surface. The experimental results show that thick porous coatings comprised of nano-sized calcium phosphate particles can be prepared by heating the as dip coated substrates at 450 °C. The in vitro degradation results show that the coatings do not alter the degradation kinetics of the substrates significantly and the release of magnesium and yttrium ions at initial time points was very similar for both the coated and bare substrates. The cyto-compatibility studies using MC3T3-E1 osteoblasts show that the coated substrates were more bioactive than the uncoated substrates as the cells begin to grow and form a matrix on the coated substrates more easily than on the bare metal. These preliminary results collectively show the potential of use of sol-gel derived calcium phosphate coatings on magnesium based degradable scaffolds to improve their surface bioactivity.     

Performance analysis of wave atom transform in texture classification

Texture classification is an important application in image processing and pattern recognition such as detection of defects on the materials and diseases from the medical images. This paper presents the performance of wave atom transform on texture classification. Wave atom transform is a new multi-resolution technique that not only captures the coherence of the pattern along the oscillations, but also the pattern across the oscillations. The classification is done using a wave atom–transformed features reduced by singular value decomposition and a support vector machine. Experimental results are presented to demonstrate the effectiveness of this approach on Brodatz database, Alzheimer’s Disease Neuro Imaging database for Alzheimer’s disease classification and liver computed tomography images for tumor classification. The experimental results demonstrate that the proposed approach gives a percent correct classification of 97.29 % on Brodatz database, classification accuracy of 94 % on Alzheimer’s Disease Neuro Imaging database for Alzheimer’s disease diagnosis and 93.3 % on liver computed tomography images for tumor classification.     

Completeness in Two-Party Secure Computation: A Computational View

A Secure Function Evaluation (SFE) of a two-variable function f(·,·) is a protocol that allows two parties with inputs x and y to evaluate f(x,y) in a manner where neither party learns "more than is necessary". A rich body of work deals with the study of completeness for secure two-party computation. A function f is complete for SFE if a protocol for securely evaluating f allows the secure evaluation of all (efficiently computable) functions. The questions investigated are which functions are complete for SFE, which functions have SFE protocols unconditionally and whether there are functions that are neither complete nor have efficient SFE protocols. The previous study of these questions was mainly conducted from an information theoretic point of view and provided strong answers in the form of combinatorial properties. However, we show that there are major differences between the information theoretic and computational settings. In particular, we show functions that are considered as having SFE unconditionally by the combinatorial criteria but are actually complete in the computational setting. We initiate the fully computational study of these fundamental questions. Somewhat surprisingly, we manage to provide an almost full characterization of the complete functions in this model as well. More precisely, we present a computational criterion (called computational row non-transitivity) for a function f to be complete for the asymmetric case. Furthermore, we show a matching criterion called computational row transitivity for f to have a simple SFE (based on no additional assumptions). This criterion is close to the negation of the computational row non-transitivity and thus we essentially characterize all "nice" functions as either complete or having SFE unconditionally.     

Exploration of photoreduction ability of reduced graphene oxide–cadmium sulphide hetero-nanostructures and their intensified activities against harmful microbes

Journal of Materials Science - Fabrication of effective photocatalyst using semiconductors and graphene or reduced graphene oxide has been regarded as one of the most promising task to attenuate...