Functional properties of egg yolk concentrate with a reduced cholesterol content prepared by treatment with supercritical CO2

A yolk protein concentrate containing ~45 and 75% less total lipids and cholesterol, respectively, than the original yolk was prepared by treating spray-dried yolk with supercritical CO₂. The yolk protein concentrate exhibited emulsion-stabilizing ability similar to that of dried yolk. A mayonnaise-like emulsion prepared with the yolk concentrate had lower consistency index and yield stress values, and less pronounced pseudoplasticity, than mayonnaise prepared with the original dried yolk. Both the foaming activity and the foam liquid stability were considerably greater in the case of yolk protein concentrate. Finally, the concentrate performed satisfactorily in cake preparation, but the texture of cake obtained, as assessed by panel tests, was different to the texture of cake prepared with dried yolk.     

Legal reasoning methodology: The missing link

The biggest false assumption made when attempting to model automatically acquired legal knowledge is that methodological and procedural legal knowledge is also contained in the text of law. Although the legal profession Intuitively knows the falsity of this assumption, researchers in the area of automatic knowledge acquisition are still confident in implementing systems that use only the text of laws as their main source of knowledge. Knowledge engineers are then forced to make their own interpretations of this knowledge, thus resulting in erroneous and legally unacceptable interpretations of the law. The aim of Nomos (an EC supported project under the ESPRIT II initiative) was to assist the knowledge engineer by providing tools that perform semiautomatic knowledge acquisition from legal texts in Italian and French. This paper uses the implementation of Nomos‐advisor, a legal expert system that uses Nomos's results as an input, as a proof of the falsity of the above assumption and discusses possible solutions.     

Historical queries along multiple lines of time evolution

Traditional approaches to addressing historical queries assume asingle line of time evolution; that is, a system (database, relation) evolves over time through a sequence of transactions. Each transaction always applies to the unique, current state of the system, resulting in a new current state. There are, however, complex applications where the system's state evolves intomultiple lines of evolution. In general, this creates a tree (hierarchy) of evolution lines, where each tree node represents the time evolution of a particular subsystem. Multiple lines create novel historical queries, such asvertical orhorizontal historical queries. The key characteristic of these problems is that portions of the history are shared; answering historical queries should not necessitate duplication of shared histories as this could increase the storage requirements dramatically. Both the vertical and horizontal historical queries have two parts: a search part, where the time of interest is located together with the appropriate subsystem, and a reconstruction part, where the subsystem's state is reconstructed for that time. This article focuses on the search part; several reconstruction methods, designed for single evolution lines can be applied once the appropriate time of interest is located. For both the vertical and the horizontal historical queries, we present algorithms that work without duplicating shared histories. Combinations of the vertical and horizontal queries are possible, and enable searching in both dimensions of the tree of evolutions.     

Multi‐parametric linear programming under global uncertainty

Multi‐parametric programming has proven to be an invaluable tool for optimisation under uncertainty. Despite the theoretical developments in this area, the ability to handle uncertain parameters on the left‐hand side remains limited and as a result, hybrid, or approximate solution strategies have been proposed in the literature. In this work, a new algorithm is introduced for the exact solution of multi‐parametric linear programming problems with simultaneous variations in the objective function's coefficients, the right‐hand side and the left‐hand side of the constraints. The proposed methodology is based on the analytical solution of the system of equations derived from the first order Karush–Kuhn–Tucker conditions for general linear programming problems using symbolic manipulation. Emphasis is given on the ability of the proposed methodology to handle efficiently the LHS uncertainty by computing exactly the corresponding nonconvex critical regions while numerical studies underline further the advantages of the proposed methodology, when compared to existing algorithms. © 2017 The Authors AIChE Journal published by Wiley Periodicals, Inc. on behalf of American Institute of Chemical Engineers AIChE J, 63: 3871–3895, 2017     

Functional effects of lupin proteins in comminuted meat and emulsion gels

The mechanical and textural properties of gel network resulting by heating at 90 °C of comminuted meat systems, containing lupin seed protein isolate at a relatively low concentration (2%), were studied in an attempt to establish the role of the lupin proteins in the gel structure network development. These results are supported with data from SDS–PAGE analysis of the adsorbed protein at the fat particle surface of the system. The findings are considered in terms of lupin protein involvement in interactions, either at the fat particle surface, or within isolated pockets of high lupin protein content.     

KnowBaSICS-M: an ontology-based system for semantic management of medical problems and computerised algorithmic solutions

In this paper, an ontology-based system (KnowBaSICS-M) is presented for the semantic management of Medical Computational Problems (MCPs), i.e., medical problems and computerised algorithmic solutions. The system provides an open environment, which: (1) allows clinicians and researchers to retrieve potential algorithmic solutions pertinent to a medical problem and (2) enables incorporation of new MCPs into its underlying Knowledge Base (KB). KnowBaSICS-M is a modular system for MCP acquisition and discovery that relies on an innovative ontology-based model incorporating concepts from the Unified Medical Language System (UMLS). Information retrieval (IR) is based on an ontology-based Vector Space Model (VSM) that estimates the similarity among user-defined MCP search criteria and registered MCP solutions in the KB. The results of a preliminary evaluation and specific examples of use are presented to illustrate the benefits of the system. KnowBaSICS-M constitutes an approach towards the construction of an integrated and manageable MCP repository for the biomedical research community.     

Supporting Temporal Views in a Management Information Base

In many network management applications, likepost-mortem fault analysis or performance trendsprofiling, it is advantageous to have the ability toview the state of the network as it was at some time in the past. To support such Temporal Views anefficient data organization, or access method, is neededfor storing and updating network related data (as thenetwork evolves over time) and for retrieving requested past network states. For applications where thenetwork manager is not interested in the full (and maybetoo large) snapshot of a past network state it is usefulif partial state snapshots can be extracted quickly. It is thus of particular interest toconstruct an access method that can efficiently supportPartial Temporal Views. Efficiency implies that arequested partial temporal view should be constructed directly, without first computing the elaboratefull temporal view. In this paper we present a newaccess method (called the Neighbor History Index) forthis problem. One of the advantages of this method is that the update processing is independent ofthe evolution size (the total number of changes in theevolution). In addition, our method uses a small diskspace overhead. We then present a general framework for organizing time-evolving network data. Ourframework distinguishes between flat and hierarchicalevolutions and subsequently between flat andhierarchical temporal views. We also provide a way toefficiently construct temporal views on hierarchicalevolutions. This paper shows that supporting temporalviews on flat or hierarchical evolutions is notexpensive: our solutions use small space overhead, havesmall updating and compute temporal viewsfast.     

Types and Functions of Mitoribosome-Specific Ribosomal Proteins across Eukaryotes

Mitochondria are key organelles that combine features inherited from their bacterial endosymbiotic ancestor with traits that arose during eukaryote evolution. These energy producing organelles have retained a genome and fully functional gene expression machineries including specific ribosomes. Recent advances in cryo-electron microscopy have enabled the characterization of a fast-growing number of the low abundant membrane-bound mitochondrial ribosomes. Surprisingly, mitoribosomes were found to be extremely diverse both in terms of structure and composition. Still, all of them drastically increased their number of ribosomal proteins. Interestingly, among the more than 130 novel ribosomal proteins identified to date in mitochondria, most of them are composed of a-helices. Many of them belong to the nuclear encoded super family of helical repeat proteins. Here we review the diversity of functions and the mode of action held by the novel mitoribosome proteins and discuss why these proteins that share similar helical folds were independently recruited by mitoribosomes during evolution in independent eukaryote clades.