Phosphofructokinase from mantle tissue of Mytilus galloprovincialis. Purification and effects of phosphorylation on the enzymatic activity

Phosphofructokinase purified from mantle tissue of the sea mussel Mytilus galloprovincialis, was phosphorylated "in vitro" by the catalytic subunit of cyclic AMP-dependent protein kinase. The incorporation of phosphate gave rise to an activation of the enzyme by increasing its affinity for fructose-6-phosphate, by decreasing its sensitivity to the inhibition by ATP and by enhancing the effect of allosteric activators (5'-AMP and fructose-2,6-bisphosphate). In addition, the effects of phosphorylation on the catalytic activity are pH-dependent.     

Universal Features of the Superfluid Transition of a Thin 4He Film on an Atomically Flat Substrate

We analyse recent observations, using a torsional oscillator, of the superfluid transition of a fluid ⁴ He bilayer, within the framework of a modified dynamic theory of the Kosterlitz-Thouless transition. A parametric plot of the real and imaginary parts of the complex superfluid density, determined from the measured period shift and dissipation, achieves a high degree of collapse of the experimental data at different coverages onto a universal curve. This is compared with the result of the recent theory.     

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are discussed.     

Diseases of the digestive system and a system for patient classification: diagnostic-related groups (DRG)

In the last years different classification systems for hospitalized patients have been developed in the United States, that allow to evaluate different aspects of any Hospital: The quality, the efficacy and the efficiency. The classification of "The Diagnosis Related Groups" (DRG) relates the hospitalized patients with the expenses that they generate, and it is the most used in Europe. In the version DRG-All Patient, all the diagnoses and procedures of the hospitalized patients, using the International Classification of Diseases, are divided in to 25 Major Diagnostic Categories (MDC) where each one excludes all the others. We describe the behavior with respect to the age, sex and stay of all the GDR integrated in the CDM 6 and 7: diseases and disorders of the digestive tract, and diseases and disorders of the hepatobiliary system and the pancreas. The study has been carried out with a national data base of two millions of cases seen from 214 acute-care Hospitals. The MDC number 6 is the most frequent, with an important number of patients in the pediatric age; it is more frequent in males; the average stay is 8.59 days and 19 GDR (36.5%) have a variation coefficient greater than one. The other MDC, number 7 is less frequent, the majority of the patients are between 60-80 years of age, the average stay is 12.2 days with a coefficient of variation greater than one in 4 GDR (17.4%). Clinical Services should know the characteristics and behavior of their patients, as well as the comparison with the national data bases. This may allow a control of the quality and the costs by using a common "language" with the managers.     

Simple procedures of choice in multicriteria problems without precise information about the alternatives’ values

The additive model of multiattribute value theory is widely used in multicriteria choice problems. But often it is not easy to obtain precise values for the scaling weights or the alternatives’ value in each function. Several decision rules which require weaker information, such as ordinal information, have been proposed to select an alternative under these circumstances. We propose new decision rules and test them using Monte-Carlo simulation, considering that there is ordinal information both on the scaling weights and on the alternatives’ values. Results show the new rules constitute a good approximation. We provide guidelines about how to use these rules in a context of selecting a subset of the most promising alternatives, considering the contradictory objectives of keeping a low number of alternatives yet not excluding the best one.     

An adaptive, real-time, traffic monitoring system

In this paper we describe a computer vision-based traffic monitoring system able to detect individual vehicles in real-time. Our fully integrated system first obtains the main traffic variables: counting, speed and category; and then computes a complete set of statistical variables. The objective is to investigate some of the difficulties impeding existing traffic systems to achieve balanced accuracy in every condition; i.e. day and night transitions, shadows, heavy vehicles, occlusions, slow traffic and congestions. The system we present is autonomous, works for long periods of time without human intervention and adapts automatically to the changing environmental conditions. Several innovations, designed to deal with the above circumstances, are proposed in the paper: an integrated calibration and image rectification step, differentiated methods for day and night, an adaptive segmentation algorithm, a multistage shadow detection method and special considerations for heavy vehicle identification and treatment of slow traffic. A specific methodology has been developed to benchmark the accuracy of the different methods proposed.     

Broadband system to increase bitrate in train communication networks

MVB (Multifunction Vehicle Bus), defined in IEC 61375, has been broadly adopted as the communication standard between embedded control systems on-board modern trains. In this work a new method to take advantage of the full bandwidth of the channel using an OFDM technique is described. With this new method it is possible to share the physical medium between standard MVB traffic and new OFDM traffic. A 90 Mbps theoretical bitrate can be achieved. The results of this work have been validated in a test bench including standard MVB nodes transmitting on a line similar to a real vehicle bus.     

The joint movement of pebbles in solving the ($$N^2-1$$)-puzzle suboptimally and its applications in rule-based cooperative path-finding

The present paper deals with the problem of solving the (\(n^2 - 1\))-puzzle and cooperative path-finding (CPF) problems sub-optimally by rule-based algorithms. To solve the puzzle, we need to rearrange \(n^2 - 1\) pebbles in the \(n \times n\)-sized square grid using one vacant position to achieve the goal configuration. An improvement to the existing polynomial-time algorithm is proposed and experimentally analyzed. The improved algorithm represents an attempt to move pebbles in a more efficient way compared to the original algorithm by grouping them into so-called snakes and moving them together as part of a snake formation. An experimental evaluation has shown that the snakeenhanced algorithm produces solutions which are 8–9 % shorter than the solutions generated by the original algorithm. Snake-like movement has also been integrated into the rule-based algorithms used in solving CPF problems sub-optimally, which is a closely related task. The task in CPF consists in moving a group of abstract robots on an undirected graph to specific vertices. The robots can move to unoccupied neighboring vertices; no more than one robot can be placed in each vertex. The (\(n^2 - 1\))-puzzle is a special case of CPF where the underlying graph is a 4-connected grid and only one vertex is vacant. Two major rule-based algorithms for solving CPF problems were included in our study—BIBOX and PUSH-and-SWAP (PUSH-and-ROTATE). The use of snakes in the BIBOX algorithm led to consistent efficiency gains of around 30 % for the (\(n^2 - 1\))-puzzle and up to 50 % in for CPF problems on biconnected graphs with various ear decompositions and multiple vacant vertices. For the PUSH-and-SWAP algorithm, the efficiency gain achieved from the use of snakes was around 5–8 %. However, the efficiency gain was unstable and hardly predictable for PUSH-and-SWAP.