UN Environment Press Release Hundreds of millions of people in Asia rely on rice not only as a staple but as their main source of nutrition. But new research suggests the rice they eat will become less nutritious due to … Continue reading →

Lean, agile, do more with less. Again, and again, design culture urges us to move quickly and trim research and design operations to the point where design becomes a mere thread in the larger corporate spool. Author and designer Nikki Anderson explains the consequences of this pressure to conduct research at lightning speed: “When we’re asked to synthesize at the speed of light, user research becomes a way for teams to take a shortcut — to invent assumptions based on quickly made correlations, opinions, and quotes.

In this note, we unify and extend various concepts in the area of $G$-complete reducibility, where $G$ is a reductive algebraic group. By results of Serre and Bate--Martin--R"{o}hrle, the usual notion of $G$-complete reducibility can be re-framed as a property of an action of a group on the spherical building of the identity component of $G$. We show that other variations of this notion, such as relative complete reducibility and $sigma$-complete reducibility, can also be viewed as special cases of this building-theoretic definition, and hence a number of results from these areas are special cases of more general properties.

We study a problem concerning parabolic induction in certain p-adic unitary groups. More precisely, for $E/F$ a quadratic extension of p-adic fields the associated unitary group $G=mathrm{U}(n,n)$ contains a parabolic subgroup $P$ with Levi component $L$ isomorphic to $mathrm{GL}_n(E)$. Let $pi$ be an irreducible supercuspidal representation of $L$ of depth zero. We use Hecke algebra methods to determine when the parabolically induced representation $iota_P^G pi$ is reducible.

We prove that there are no irreducible representations of $B_n$ of dimension $n+1$ for $ngeq 10.$

Restless multi-armed bandits are a class of discrete-time stochastic control problems which involve sequential decision making with a finite set of actions (set of arms). This paper studies a class of constrained restless multi-armed bandits (CRMAB). The constraints are in the form of time varying set of actions (set of available arms). This variation can be either stochastic or semi-deterministic. Given a set of arms, a fixed number of them can be chosen to be played in each decision interval. The play of each arm yields a state dependent reward. The current states of arms are partially observable through binary feedback signals from arms that are played. The current availability of arms is fully observable. The objective is to maximize long term cumulative reward. The uncertainty about future availability of arms along with partial state information makes this objective challenging. Applications for CRMAB abound in the domain of cyber-physical systems. This optimization problem is analyzed using Whittle's index policy. To this end, a constrained restless single-armed bandit is studied. It is shown to admit a threshold-type optimal policy, and is also indexable. An algorithm to compute Whittle's index is presented. Further, upper bounds on the value function are derived in order to estimate the degree of sub-optimality of various solutions. The simulation study compares the performance of Whittle's index, modified Whittle's index and myopic policies.

In ASPIC-style structured argumentation an argument can rebut another argument by attacking its conclusion. Two ways of formalizing rebuttal have been proposed: In restricted rebuttal, the attacked conclusion must have been arrived at with a defeasible rule, whereas in unrestricted rebuttal, it may have been arrived at with a strict rule, as long as at least one of the antecedents of this strict rule was already defeasible. One systematic way of choosing between various possible definitions of a framework for structured argumentation is to study what rationality postulates are satisfied by which definition, for example whether the closure postulate holds, i.e. whether the accepted conclusions are closed under strict rules. While having some benefits, the proposal to use unrestricted rebuttal faces the problem that the closure postulate only holds for the grounded semantics but fails when other argumentation semantics are applied, whereas with restricted rebuttal the closure postulate always holds. In this paper we propose that ASPIC-style argumentation can benefit from keeping track not only of the attack relation between arguments, but also the relation of deductive joint support that holds between a set of arguments and an argument that was constructed from that set using a strict rule. By taking this deductive joint support relation into account while determining the extensions, the closure postulate holds with unrestricted rebuttal under all admissibility-based semantics. We define the semantics of deductive joint support through the flattening method.

We present a novel numerical scheme to approximate the solution map $smapsto u(s) := mathcal{L}^{-s}f$ to partial differential equations involving fractional elliptic operators. Reinterpreting $mathcal{L}^{-s}$ as interpolation operator allows us to derive an integral representation of $u(s)$ which includes solutions to parametrized reaction-diffusion problems. We propose a reduced basis strategy on top of a finite element method to approximate its integrand. Unlike prior works, we deduce the choice of snapshots for the reduced basis procedure analytically. Avoiding further discretization, the integral is interpreted in a spectral setting to evaluate the surrogate directly. Its computation boils down to a matrix approximation $L$ of the operator whose inverse is projected to a low-dimensional space, where explicit diagonalization is feasible. The universal character of the underlying $s$-independent reduced space allows the approximation of $(u(s))_{sin(0,1)}$ in its entirety. We prove exponential convergence rates and confirm the analysis with a variety of numerical examples.

Further improvements are proposed in the second part of this investigation to avoid inversion of $L$. Instead, we directly project the matrix to the reduced space, where its negative fractional power is evaluated. A numerical comparison with the predecessor highlights its competitive performance.

We present a sound and complete method for the verification of qualitative liveness properties of replicated systems under stochastic scheduling. These are systems consisting of a finite-state program, executed by an unknown number of indistinguishable agents, where the next agent to make a move is determined by the result of a random experiment. We show that if a property of such a system holds, then there is always a witness in the shape of a Presburger stage graph: a finite graph whose nodes are Presburger-definable sets of configurations. Due to the high complexity of the verification problem (non-elementary), we introduce an incomplete procedure for the construction of Presburger stage graphs, and implement it on top of an SMT solver. The procedure makes extensive use of the theory of well-quasi-orders, and of the structural theory of Petri nets and vector addition systems. We apply our results to a set of benchmarks, in particular to a large collection of population protocols, a model of distributed computation extensively studied by the distributed computing community.

This paper is the first to consider online algorithms to schedule a proportionate flexible flow shop of batching machines (PFFB). The scheduling model is motivated by manufacturing processes of individualized medicaments, which are used in modern medicine to treat some serious illnesses. We provide two different online algorithms, proving also lower bounds for the offline problem to compute their competitive ratios. The first algorithm is an easy-to-implement, general local scheduling heuristic. It is 2-competitive for PFFBs with an arbitrary number of stages and for several natural scheduling objectives. We also show that for total/average flow time, no deterministic algorithm with better competitive ratio exists. For the special case with two stages and the makespan or total completion time objective, we describe an improved algorithm that achieves the best possible competitive ratio $varphi=frac{1+sqrt{5}}{2}$, the golden ratio. All our results also hold for proportionate (non-flexible) flow shops of batching machines (PFB) for which this is also the first paper to study online algorithms.

Recent studies have confirmed a growing trend, especially among youngsters, of using Online Social Media as favourite information platform at the expense of traditional mass media. Indeed, they can easily reach a wide audience at a high speed; but exactly because of this they are the preferred medium for influencing public opinion via so-called fake news. Moreover, there is a general agreement that the main vehicle of fakes news are malicious software robots (bots) that automatically interact with human users. In previous work we have considered the problem of tagging human users in Online Social Networks as credulous users. Specifically, we have considered credulous those users with relatively high number of bot friends when compared to total number of their social friends. We consider this group of users worth of attention because they might have a higher exposure to malicious activities and they may contribute to the spreading of fake information by sharing dubious content. In this work, starting from a dataset of fake news, we investigate the behaviour and the degree of involvement of credulous users in fake news diffusion. The study aims to: (i) fight fake news by considering the content diffused by credulous users; (ii) highlight the relationship between credulous users and fake news spreading; (iii) target fake news detection by focusing on the analysis of specific accounts more exposed to malicious activities of bots. Our first results demonstrate a strong involvement of credulous users in fake news diffusion. This findings are calling for tools that, by performing data streaming on credulous' users actions, enables us to perform targeted fact-checking.

We show that combining a prediction model (based on neural networks), with a new method of test pooling (better than the original Dorfman method, and better than double-pooling) called 'Grid', we can reduce the number of Covid-19 tests by 73%.

We empirically evaluate an undervolting technique, i.e., underscaling the circuit supply voltage below the nominal level, to improve the power-efficiency of Convolutional Neural Network (CNN) accelerators mapped to Field Programmable Gate Arrays (FPGAs). Undervolting below a safe voltage level can lead to timing faults due to excessive circuit latency increase. We evaluate the reliability-power trade-off for such accelerators. Specifically, we experimentally study the reduced-voltage operation of multiple components of real FPGAs, characterize the corresponding reliability behavior of CNN accelerators, propose techniques to minimize the drawbacks of reduced-voltage operation, and combine undervolting with architectural CNN optimization techniques, i.e., quantization and pruning. We investigate the effect of environmental temperature on the reliability-power trade-off of such accelerators. We perform experiments on three identical samples of modern Xilinx ZCU102 FPGA platforms with five state-of-the-art image classification CNN benchmarks. This approach allows us to study the effects of our undervolting technique for both software and hardware variability. We achieve more than 3X power-efficiency (GOPs/W) gain via undervolting. 2.6X of this gain is the result of eliminating the voltage guardband region, i.e., the safe voltage region below the nominal level that is set by FPGA vendor to ensure correct functionality in worst-case environmental and circuit conditions. 43% of the power-efficiency gain is due to further undervolting below the guardband, which comes at the cost of accuracy loss in the CNN accelerator. We evaluate an effective frequency underscaling technique that prevents this accuracy loss, and find that it reduces the power-efficiency gain from 43% to 25%.

In this paper we study a single machine scheduling problem on a set of independent jobs whose execution time is not known, but guaranteed to be either short or long, for two given processing times. At every time step, the scheduler has the possibility either to test a job, by querying a processing time oracle, which reveals its processing time, and occupies one time unit on the schedule. Or the scheduler can execute a job, might it be previously tested or not. The objective value is the total completion time over all jobs, and is compared with the objective value of an optimal schedule, which does not need to test. The resulting competitive ratio measures the price of hidden processing time.

Two models are studied in this paper. In the non-adaptive model, the algorithm needs to decide before hand which jobs to test, and which jobs to execute untested. However in the adaptive model, the algorithm can make these decisions adaptively to the outcomes of the job tests. In both models we provide optimal polynomial time two-phase algorithms, which consist of a first phase where jobs are tested, and a second phase where jobs are executed untested. Experiments give strong evidence that optimal algorithms have this structure. Proving this property is left as an open problem.

Several nonlinear model reduction techniques are compared for the three cases of the non-parallel version of the Kuramoto-Sivashinsky equation, the transient regime of flow past a cylinder at $Re=100$ and fully developed flow past a cylinder at the same Reynolds number. The linear terms of the governing equations are reduced by Galerkin projection onto a POD basis of the flow state, while the reduced nonlinear convection terms are obtained either by a Galerkin projection onto the same state basis, by a Galerkin projection onto a POD basis representing the nonlinearities or by applying the Discrete Empirical Interpolation Method (DEIM) to a POD basis of the nonlinearities. The quality of the reduced order models is assessed as to their stability, accuracy and robustness, and appropriate quantitative measures are introduced and compared. In particular, the properties of the reduced linear terms are compared to those of the full-scale terms, and the structure of the nonlinear quadratic terms is analyzed as to the conservation of kinetic energy. It is shown that all three reduction techniques provide excellent and similar results for the cases of the Kuramoto-Sivashinsky equation and the limit-cycle cylinder flow. For the case of the transient regime of flow past a cylinder, only the pure Galerkin techniques are successful, while the DEIM technique produces reduced-order models that diverge in finite time.

We study the problem of jointly designing a sparse sensor and actuator schedule for linear dynamical systems while guaranteeing a control/estimation performance that approximates the fully sensed/actuated setting. We further prove a separation principle, showing that the problem can be decomposed into finding sensor and actuator schedules separately. However, it is shown that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial time for time-invariant sensor/actuator schedules; instead, we develop deterministic polynomial-time algorithms for a time-varying sensor/actuator schedule with guaranteed approximation bounds. Our main result is to provide a polynomial-time joint actuator and sensor schedule that on average selects only a constant number of sensors and actuators at each time step, irrespective of the dimension of the system. The key idea is to sparsify the controllability and observability Gramians while providing approximation guarantees for Hankel singular values. This idea is inspired by recent results in theoretical computer science literature on sparsification.

It’s that time of the year again. A new TV season is upon us. With some shows beginning to air this week, I thought it best to post my “to watch” schedule for the fall. Unlike last year, I…

Summer Camps 2020 ACT/SAT Prep Camp Students can use their free time this summer to get ready to take the ACT or SAT test with educational staff at Gonzaga Prep.…

Calling all fearless freaks! Mark your calendars: The Flaming Lips have rescheduled their now-canceled April gig at the Fox Theater for March 19, 2021.…

While events around the country have been put on hold, Coeur d’Alene’s Summer Theatre is still slated for a show at the end of the month. But it won’t be in the usual format.…

A process for reductive amination of aliphatic cyanoaldehydes to aliphatic diamines comprising (1) providing a mixture of 1,3-cyanocyclohexane carboxaldehyde and/or 1,4-cyanocyclohexane carboxaldehyde; (2) contacting said mixture with a metal carbonate based solid bed or a weak base anion exchange resin bed at a temperature from 15 to 40 ° C. for a period of at least 1 minute; (3) thereby treating said mixture, wherein said treated mixture has a pH in the range of 6 to 9; (4) feeding said treated mixture, hydrogen, and ammonia into a continuous reductive amination reactor system; (6) contacting said treated mixture, hydrogen, and ammonia with each other in the presence of one or more heterogeneous metal based catalyst systems at a temperature from 80 ° C. to 160 ° C. and a pressure from 700 to 3500 psig; (7) thereby producing one or more cycloaliphatic diamines is provided.

Disclosed is a process for preparing an aryloxyalkylene amine compound via an aminoethylation reaction comprising: a) reacting an aromatic hydroxyl compound in the presence of a basic catalyst with a 2-oxazolidinone compound of the formula II to form an intermediate reaction product; wherein R3 is selected from the group consisting of hydrogen or lower alkyl having 1 to 6 carbon atoms, R4 is selected from the group consisting of hydrogen, straight or branched chain alkyl having from one to six carbon atoms, phenyl, alkaryl, or arylalkyl; and b) reacting the intermediate product of step a) with a polyalkylene polyamine.

Method and apparatus for managing data in a memory. In accordance with some embodiments, a first data object and an associated first ECC data set are generated and stored in a non-volatile (NV) main memory responsive to a first set of data blocks having a selected logical address. A second data object and an associated second ECC data set are generated responsive to receipt of a second set of data blocks having the selected logical address. The second data object and the second ECC data set are subsequently stored in the in the NV main memory responsive to a mismatch between the first ECC data set and the second ECC data set.

The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for variable rate coding in a data processing system.

Method of extracting syngas between the zone in a furnace where oxygen-starved combustion of biomass occurs and the zone in the furnace where secondary air is added to complete combustion, conditioning and cleaning the extracted syngas, and delivering it in a metered amount to the oxidizer or upstream of the oxidizer to reduce or eliminate the need for additional fossil fuels once the oxidizer has achieved its operating temperature. The gasifier or furnace burns solid waste and produces a syngas containing relatively high levels of CO, which is extracted from the furnace, conditioned, and introduced into an RTO as a fuel source. In certain embodiments, no extraction of syngas from the furnace takes place; the furnace conditions are manipulated so that normally undesirable levels of CO and other VOC's remain in the process stream. The heat from the furnace is used as intended (e.g., to heat a dryer), the stream is conditioned, and ultimately proceeds to a downstream RTO. Since the gas stream remains rich in CO and VOC's, its fuel value in the RTO is substantially higher than otherwise would be the case.

A treatment process of persistent organic pollutants contained in particles is provided. Said process includes reacting persistent organic pollutant in particles under hydrothermal conditions in the presence of Fe2+ and Fe3+. Several beneficial effects can be achieved, including 1) no other additive is needed during the reaction process; 2) Fe2+ and Fe3+ are safe, cheap and extensive sources; 3) because Fe2+ and Fe3+ are dissolved, they can fully disperse into particles, and fully contact can be achieved, thus obtaining a decomposition rate no less than 70% of the persistent organic pollutants is under subcritical conditions.

The cost relating to a reduction in volume and storage of a waste resin including a radioactive nuclide is reduced. In an aspect of the invention, a volume reduction processing system 1000 is provided. The volume reduction processing system 1000 includes a radioactivity meter 102 that measures the radioactivity of a processing target resin, a volume reduction processing device 110 that carries out a heating process, and an oxidation process using oxygen plasma P on the processing target resin, and a process stopping point computation unit 180 that determines a process stopping point for carrying out a volume reduction process on the processing target resin with the volume reduction processing device as far as a volume reduction target value. The volume reduction processing device 110 stops at least one process of the heating process and oxidation process on the process stopping point being reached.

A sine wave generator for a Direct Digital Synthesizer (DDS) converts a digital phase input into a digital sine wave output. Sine values and slopes are stored in read-only memory (ROM) for coarse upper phase bits in a first quadrant. A quadrant folder and phase splitter reflects and inverts values from the first quadrant to generate amplitudes for all four quadrants. Each sine value and slope is stored for a range of lower phase bits. A Delta bit separates upper and lower phase bits. Delta conditionally inverts the lower phase bits, the sine value, and the final polarity. A reduced AND logic array multiplies the slope by the conditionally inverted lower phase bits. A reconstructed ADD logic array then adds the conditionally inverted sine value. The conditionally inverted polarity is added to generate the final sine value. Sine generation logic is streamlined with conditional inversion based on the Delta bit.

A system (200) and a method (100) of operating a computing device to perform memoization are disclosed. The method includes determining whether a result of a function is stored in a cache and, if so, retrieving the result from the cache and, if not, calculating the result and storing it in the cache. The method (100) includes transforming (104) by the computing device at least one selected from the input parameters and the output parameters of the function, the transforming being based on an analysis of the function and its input arguments to establish whether or not there is a possible relationship reflecting redundancy among the input parameters and output parameters of the function. The transforming may include at least one of: use of symmetry, scaling, linear shift, interchanging of variables, inversion, polynomial and/or trigonometric transformations, spectral or logical transformations, fuzzy transformations, and systematic arrangement of parameters.

A system, method and computer-readable media for managing a compute environment are disclosed. The method includes importing identity information from an identity manager into a module performs workload management and scheduling for a compute environment and, unless a conflict exists, modifying the behavior of the workload management and scheduling module to incorporate the imported identity information such that access to and use of the compute environment occurs according to the imported identity information. The compute environment may be a cluster or a grid wherein multiple compute environments communicate with multiple identity managers.

A method for efficient dispatch/completion of a work element within a multi-node data processing system. The method comprises: selecting specific processing units from among the processing nodes to complete execution of a work element that has multiple individual work items that may be independently executed by different ones of the processing units; generating an allocated processor unit (APU) bit mask that identifies at least one of the processing units that has been selected; placing the work element in a first entry of a global command queue (GCQ); associating the APU mask with the work element in the GCQ; and responsive to receipt at the GCQ of work requests from each of the multiple processing nodes or the processing units, enabling only the selected specific ones of the processing nodes or the processing units to be able to retrieve work from the work element in the GCQ.

Techniques for adaptive thread scheduling on a plurality of cores for reducing system energy are described. In one embodiment, a thread scheduler receives leakage current information associated with the plurality of cores. The leakage current information is employed to schedule a thread on one of the plurality of cores to reduce system energy usage. On chip calibration of the sensors is also described.

The present disclosure relates to processes for reducing the concentration of RfC≡CX impurities in fluoroolefins. The process involves: contacting a mixture comprising at least one fluoroolefin and at least one RfC≡CX impurity with at least one amine to reduce the concentration of the at least one RfC≡CX impurity in the mixture; wherein Rf is a perfluorinated alkyl group, and X is H, F, Cl, Br or I. The present disclosure also relates to processes for making at least one hydrotetrafluoropropene product selected from the group consisting of CF3CF═CH2, CF3CH═CHF, and mixtures thereof and reducing the concentration of CF3C═CH impurity generated during the process. The present disclosure also relates to processes for making at least one hydrochlorotrifluoropropene product selected from the group consisting of CF3CCl═CH2, CF3CH═CHCl, and mixtures thereof and reducing the concentration of CF3C≡CH impurity generated during the process.

A method of reducing the downward flow of air currents on the leeward side of an emissions emitting structure including the step of using a system that includes components chosen from the group consisting of one or more mechanical air moving devices; physical structures; and combinations thereof to create an increase in the air pressure within a volume of air on the leeward side of an emissions emitting structure having emissions that become airborne. The increased air pressure prevents or lessens downward flow of emissions that would occur without the use of the system and increases the safety by which one can travel a road or other transportation route that might otherwise be visually obscured by the emissions and the safety of the property and those within the area where emissions occur.

Systems and methods for static code scheduling are disclosed. A method can include receiving an intermediate representation of source code, building a directed acyclic graph (DAG) for the intermediate representation, and creating chains of dependent instructions from the DAG for cluster formation. The chains are merged into clusters and each node in the DAG is marked with an identifier of a cluster it is part of to generate a marked instruction DAG. Instruction DAG scheduling is then performed using information about the clusters to generate an ordered intermediate representation of the source code.

The use is described (i)(a) of a single alcohol of formula (1) or(i)(b) of a mixture comprising or consisting of two or more different alcohols of formula (1), wherein in each case one of the two radicals Ra or Rb represents hydrogen and in each case the other radical Ra or Rb represents an acyl radical having 2 to 6 C atoms,for reducing an odororas an auxiliary for reducing an odor.

The present invention is directed to processes for the recovery of ethanol from a crude ethanol product obtained from the hydrogenation of acetic acid using a low energy process. The crude ethanol product is separated in one or more columns. At least one of the columns is operated at a controlled pressure to enhance separation of ethanol and organics. In one embodiment, there are at least two columns that operate at controlled pressures.

The present invention is directed to processes for recovering ethanol obtained from the hydrogenation of acetic acid. Acetic acid is hydrogenated in the presence of a catalyst in a hydrogenation reactor to form a crude ethanol product. The crude ethanol product is separated in one or more columns to recover ethanol. In some embodiments, less than 10 wt. % ethanol is recycled to the hydrogenation reactor.

A leakage power control vector is loaded into existing test scan chain elements for application to circuit elements of a circuit in which the leakage currents are to be controlled. The vector is designed to configure the circuit elements into states in which leakage currents are reduced. A multiplexer selects the power control vector for loading into the scan chain elements, and a clock generator clocks the configuration vector into the scan chain elements. A sleep mode detector may be provided to configure the multiplexer to select the power control vector and to operate the clock generator to clock the power control vector into the scan chain elements when a sleep mode of the circuit is detected.

Methods employing detergent compositions effective for reducing soil redeposition and accumulation on hard surfaces are disclosed. The detergent compositions employ phosphinosuccinic acid adducts in combination with an alkalinity source and gluconic acid or salts thereof, copolymers of acrylic acid and maleic acids or salts thereof, sodium hypochlorite, sodium dichloroisocyanurate or combinations thereof.

A VCR schedule controller receives broadcast data over antenna (1) or cable (2) by a programmable tuner (3), which is connected to a teletext receiver (4). The teletext receiver (4) is connected to a microprocessor (5). Microprocessor output (11) is connected to a video display generator (10), used to create text for television receiver (60) to display a message from the microprocessor (5). After processing embedded data in a broadcast, the microprocessor (5) generates a cue for display on TV receiver (60). Remote control receiver (20) receives a command from a remote controller (22) from a viewer input in response to the cue. Remote control receiver (20) supplies a control signal to cause the microprocessor to store the embedded data in memory (9). The microprocessor then issues a message to the display generator (10) as an acknowledgement of the viewer input. The microprocessor (5) monitors the system clock (6) and compares it with stored schedules from the embedded supplemental data. When the system time corresponds to one of the scheduled times, the microprocessor (5) sets the programmable tuner (3) to the stored channel and initiates recording on VCR (30).

A system and method for tracking and informing about a physical, emotional, or physiological cycle, such as a menstrual cycle, includes at least one definition entry and at least one date indicator. Each definition entry defines indicia such as color to represent a stage of a physical, emotional, or physiological cycle. Each date indicator includes a date section and a tracking section corresponding to each date section. The date section of the date indicator indicates at least one date, wherein the tracking section is capable of being marked so as to indicate indicia corresponding to a definition entry to signify the stage of the physical, emotional, or physiological cycle for each date. According to one embodiment, the date indicators are arranged according to phases of the moon to allow correlation of a user's cycle to the lunar cycle.

The present invention relates to methods for safe and efficient use of hydrogen and oxygen in ozonolysis operations. The invention also relates to an ozonolysis process involving elements of both reductive and oxidative ozonolysis which are integrated in a continuous process. In one embodiment, the ozonolysis process of the present invention uses hydrogen and/or oxygen generated from water and electricity, which may be recycled to generate water and/or electricity.

An object of the present invention is to provide a substance characterized by ability to reduce oxidized coenzyme Q10 and ability to stabilize reduced coenzyme Q10, which contains nutrients, has a favorable taste, and is excellent in general versatility, and a method for using the same. The present invention relates to a method for producing reduced coenzyme Q10 comprising reducing oxidized coenzyme Q10 with a particular amino acid. The present invention also relates to a method for stabilizing reduced coenzyme Q10 in the presence of a particular amino acid and a composition stabilized by the method.

The present invention relates to the field of cardiology. More specifically, the present invention provides methods and compositions for inducing proliferation of cardiomyocytes. In a specific embodiment, a method for inducing proliferation of cardiomyocytes comprises the step of administering an effective amount of an ALMS1 inhibitor.

Techniques are described to transmit commands to a display device. The commands can be transmitted in header byte fields of secondary data packets. The commands can be used to cause a target device to capture a frame, enter or exit self refresh mode, or reduce power use of a connection. In addition, a request to exit main link standby mode can cause the target enter training mode without explicit command to exit main link standby mode.

The present invention discloses devices and methods for performing intravascular procedures without cardiac bypass. The devices include various embodiments of temporary filter devices, temporary valves, and prosthetic valves. The temporary filter devices have one or more cannulae which provide access for surgical tools for effecting repair of the cardiac valves. A cannula may have filters of various configurations encircling the distal region of the cannula, which prevent embolitic material from entering the coronary arteries and aorta.The temporary valve devices may also have one or more cannulae which guide the insertion of the valve into the aorta. The valve devices expand in the aorta to occupy the entire flow path of the vessel. In one embodiment, the temporary valve is a disc of flexible, porous, material that acts to filter blood passing therethrough. A set of valve leaflets extend peripherally from the disc. These leaflets can alternately collapse to prevent blood flow through the valve and extend to permit flow.The prosthetic valves include valve fixation devices which secure the prosthetic valve to the wall of the vessel. In one embodiment, the prosthetic valves have at least one substantially rigid strut, at least two expandable fixation rings located about the circumference of the base of the apex of the valve, and one or more commissures and leaflets. The prosthetic valves are introduced into the vascular system a compressed state, advanced to the site of implantation, expanded and secured to the vessel wall.

The present disclosure relates to a system for use in surgical procedures. The system includes an endoscope; an imaging device coupled to the endoscope; an imaging processor coupled to the imaging device; and at least one management system coupled to the imaging processor, wherein a function of the management system is automatically adjusted upon receipt of a communication from the imaging processor. A method of adjusting an image of a surgical site during a surgical procedure is also disclosed.

The subject of the present invention are novel esters of (acyloxymethyl)acrylamide, a pharmaceutical composition containing them and their use in the production of drugs for the prophylaxis or treatment of oncogenic diseases and diseases connected with increased cell proliferation.

Disclosed herein are methods for recovering diphosphite-containing compounds from mixtures comprising organic mononitriles and organic dinitriles, using liquid-liquid extraction. Also disclosed are treatments to enhance extractability of the diphosphite-containing compounds.