From Ølberg Strand. Taken with iPhone 11 Pro wide-angle and given some Lightroom fixes for sky effect.

Managing money is complicated, especially for people with a brain injury who may have trouble remembering what they spent or creating a budget. Adam shares some tips from online banking to keeping a spending journal.

By Melissa Hellmann Yes! Magazine A new report revealed surprising results when Oakland overhauled its lunch menu at 100-plus schools by serving less meat and more fruits and vegetables. When her eldest son was in elementary school in the Oakland … Continue reading →

Ditch the idea of yourself as a starving artist. Throw away the notion that you’re doomed to be another poor creative soul. My long time pal Ramit Sethi is back on the show to remind us we need to get back on track to building and living a rich life. And believe me, that doesn’t have to mean cutting back the lattes. Ramit has been on the show a few times, but if you haven’t caught up yet, let me fill you in. Ramit Sethi is the author of the NYT bestseller “I Will Teach You To Be Rich” and writes for over 500,000 monthly readers on his website, iwillteachyoutoberich.com. It’s one of my favorite go-to finance resources covering psychology, personal finance, careers, and entrepreneurship. No one has single-handedly given me better insight into the business side of art, than Ramit. Ramit has updated & expanded 2nd edition of his book and joined me for a LIVE studio conversation on money confessions. In this episode we get into: A rich life isn’t only about save money, it’s about defining & prioritizing the things you love the most. It’s one thing to manage our own personal finances but navigating that with […]

The post Ramit Sethi: Money + Other Ways to Live Rich appeared first on Chase Jarvis Photography.

Today we’re going back to San Francisco with myself and Jason Calacanis on stage during my tour stop for my book Creative Calling. Jason is an investor and long time host of the This Week in Startups podcast. And, of course, Jason wastes no time in our conversation. He goes right to the heart of the matter by getting into failure, venture capitol, knowing when to quit, and when to push through. Enjoy! FOLLOW JASON: facebook | twitter | website Listen to the Podcast Subscribe   This podcast is brought to you by CreativeLive. CreativeLive is the world’s largest hub for online creative education in photo/video, art/design, music/audio, craft/maker, money/life and the ability to make a living in any of those disciplines. They are high quality, highly curated classes taught by the world’s top experts — Pulitzer, Oscar, Grammy Award winners, New York Times best selling authors and the best entrepreneurs of our times.

The post Harmony > Balance with Jason Calacanis appeared first on Chase Jarvis Photography.

St-Donat, Bas-St-Laurent, Québec

St-Donat, Bas-St-Laurent, Québec

We have a new preview on https://www.007soccerpicks.com/monday-matches/double-chance-picks-monday-18-september-2017/

Double Chance Picks *** Monday *** 18 September 2017

DOUBLE CHANCE PICKS To return: ??? USD Odds: 2.03 Stake: 100 USD   Starting in   Teams   Our Prediction Odds Espanyol - Celta Vigo Soccer: Spain - LaLiga 1X 1.29 AFC Eskilstuna - Sundsvall Soccer: Sweden -…

We have a new preview on https://www.007soccerpicks.com/monday-matches/fulltime-result-picks-monday-18-september-2017/

Fulltime Result Picks *** Monday *** 18 September 2017

FULLTIME PICKS To return: ??? USD Odds: 3.77 Stake: 100 USD   Starting in   Teams   Our Prediction Odds Plzen - Zlin Soccer: Czech Republic - 1. Liga 1 1.39 Odd - Aalesund Soccer: Norway -…

We have a new preview on https://www.007soccerpicks.com/monday-matches/teams-score-picks-monday-18-september-2017/

Both teams to score Picks *** Monday *** 18 September 2017

BOTH TEAMS TO SCORE To return: ??? USD Odds: 5.26 Stake: 100 USD   Starting in   Teams   BTS Our Pick Odds Lokomotiv Moscow - Amkar Soccer: Russia - Premier League Both to score NO 1.50 Astra - FC…

We have a new preview on https://www.007soccerpicks.com/monday-matches/corners-picks-monday-18-september-2017/

Corners Picks *** Monday *** 18 September 2017

MATCH CORNERS PICKS To return: ??? USD Odds: 1.55 Stake: 100 USD   Starting in   Teams   Our Prediction Odds Espanyol - Celta Vigo Soccer: Spain - LaLiga OVER 9.5 CORNERS 1.55

We have a new preview on https://www.007soccerpicks.com/monday-matches/asian-handicap-picks-monday-18-september-2017/

Asian Handicap Picks *** Monday *** 18 September 2017

ASIAN HANDICAP PICKS To return: ??? USD Odds: 5.83 Stake: 100 USD   Starting in   Teams   Our Prediction goes for Odds Lokomotiv Moscow - Amkar Soccer: Russia - Premier League L. Moscow -0.5 1.55 Odd -…

We have a new preview on https://www.007soccerpicks.com/monday-matches/goals-scored-picks-monday-18-september-2017/

Goals Scored Picks *** Monday *** 18 September 2017

MATCH GOALS PICKS To return: ??? USD Odds: 4.56 Stake: 100 USD   Starting in   Teams   Our Prediction Odds Astra - FC Viitorul Soccer: Romania - Liga 1 UNDER 2.5 1.60 Espanyol - Celta Vigo Soccer: Spain - LaLiga…

We have a new preview on https://www.007soccerpicks.com/monday-matches/half-time-picks-monday-18-september-2017/

Half Time Picks *** Monday *** 18 September 2017

HALF TIME PICKS To return: ??? USD Odds: 8.39 Stake: 100 USD   Starting in   Teams   Half Time Our Pick Odds Espanyol - Celta Vigo Soccer: Spain - LaLiga HALF TIME X 2.07 Lokomotiv Moscow - Amkar Soccer: Russia…

We examine Chern-Simons theory as a deformation of a 3-dimensional BF theory that is partially holomorphic and partially topological. In particular, we introduce a novel gauge that leads naturally to a one-loop exact quantization of this BF theory and Chern-Simons theory. This approach illuminates several important features of Chern-Simons theory, notably the bulk-boundary correspondence of Chern-Simons theory with chiral WZW theory. In addition to rigorously constructing the theory, we also explain how it applies to a large class of closely related 3-dimensional theories and some of the consequences for factorization algebras of observables.

Let $chi_{Delta}(mathbb{R}^{n})$ denote the minimum number of colors needed to color $mathbb{R}^{n}$ so that there will not be a monochromatic equilateral triangle with side length $1$. Using the slice rank method, we reprove a result of Frankl and Rodl, and show that $chi_{Delta}left(mathbb{R}^{n} ight)$ grows exponentially with $n$. This technique substantially improves upon the best known quantitative lower bounds for $chi_{Delta}left(mathbb{R}^{n} ight)$, and we obtain [ chi_{Delta}left(mathbb{R}^{n} ight)>(1.01446+o(1))^{n}. ]

In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same assumptions as Tseng's forward-backward-forward method, namely, it does not require cocoercivity of the single-valued operator. Moreover, each iteration only requires one forward evaluation rather than two as is the case for Tseng's method. Variants of the method incorporating a linesearch, relaxation and inertia, or a structured three operator inclusion are also discussed.

In this paper we introduce various types of harmonic Finsler manifolds and study the relation between them. We give several characterizations of such spaces in terms of the mean curvature and Laplacian. In addition, we prove that some harmonic Finsler manifolds are of Einstein type and a technique to construct harmonic Finsler manifolds of Rander type is given. Moreover, we provide many examples of non-Riemmanian Finsler harmonic manifolds of constant flag curvature and constant $S$-curvature. Finally, we analyze Busemann functions in a general Finsler setting and in certain kind of Finsler harmonic manifolds, namely asymptotically harmonic Finsler manifolds along with studying some applications. In particular, we show the Busemann function is smooth in asymptotically harmonic Finsler manifolds and the total Busemann function is continuous in $C^{infty}$ topology.

In this paper, we derive a formula for the sums of powers of the first $n$ positive integers that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the hyperharmonic numbers, we generalize this formula to the sums of powers of an arbitrary arithmetic progression. Moreover, as a by-product, we express the Bernoulli polynomials in terms of the hyperharmonic polynomials and the Stirling numbers of the second kind.

We consider a fair division setting where indivisible items are allocated to agents. Each agent in the setting has strictly negative, zero or strictly positive utility for each item. We, thus, make a distinction between items that are good for some agents and bad for other agents (i.e. mixed), good for everyone (i.e. goods) or bad for everyone (i.e. bads). For this model, we study axiomatic concepts of allocations such as jealousy-freeness up to one item, envy-freeness up to one item and Pareto-optimality. We obtain many new possibility and impossibility results in regard to combinations of these properties. We also investigate new computational tasks related to such combinations. Thus, we advance the state-of-the-art in fair division of mixed manna.

Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets of any such family of sets are interesting from a combinatorial point of view and have algorithmic applications. Many such bounds on different families of sets over different classes of graphs are already provided in the literature. In particular, Rote recently showed that the number of minimal dominating sets in trees of order $n$ is at most $95^{frac{n}{13}}$ and that this bound is asymptotically sharp up to a multiplicative constant. We build on his work to show that what he did for minimal dominating sets can be done for any family of sets definable by a monadic second order formula.

We first show that, for any monadic second order formula over graphs that characterizes a given kind of subset of its vertices, the maximal number of such sets in a tree can be expressed as the extit{growth rate of a bilinear system}. This mostly relies on well known links between monadic second order logic over trees and tree automata and basic tree automata manipulations. Then we show that this "growth rate" of a bilinear system can be approximated from above.We then use our implementation of this result to provide bounds on the number of independent dominating sets, total perfect dominating sets, induced matchings, maximal induced matchings, minimal perfect dominating sets, perfect codes and maximal irredundant sets on trees. We also solve a question from D. Y. Kang et al. regarding $r$-matchings and improve a bound from G'orska and Skupie'n on the number of maximal matchings on trees. Remark that this approach is easily generalizable to graphs of bounded tree width or clique width (or any similar class of graphs where tree automata are meaningful).

The Hierarchical Equal Area isoLatitude Pixelation (HEALPix) scheme is used extensively in astrophysics for data collection and analysis on the sphere. The scheme was originally designed for studying the Cosmic Microwave Background (CMB) radiation, which represents the first light to travel during the early stages of the universe's development and gives the strongest evidence for the Big Bang theory to date. Refined analysis of the CMB angular power spectrum can lead to revolutionary developments in understanding the nature of dark matter and dark energy. In this paper, we present a new method for performing spherical harmonic analysis for HEALPix data, which is a central component to computing and analyzing the angular power spectrum of the massive CMB data sets. The method uses a novel combination of a non-uniform fast Fourier transform, the double Fourier sphere method, and Slevinsky's fast spherical harmonic transform (Slevinsky, 2019). For a HEALPix grid with $N$ pixels (points), the computational complexity of the method is $mathcal{O}(Nlog^2 N)$, with an initial set-up cost of $mathcal{O}(N^{3/2}log N)$. This compares favorably with $mathcal{O}(N^{3/2})$ runtime complexity of the current methods available in the HEALPix software when multiple maps need to be analyzed at the same time. Using numerical experiments, we demonstrate that the new method also appears to provide better accuracy over the entire angular power spectrum of synthetic data when compared to the current methods, with a convergence rate at least two times higher.

Finding a good regularization parameter for Tikhonov regularization problems is a though yet often asked question. One approach is to use leave-one-out cross-validation scores to indicate the goodness of fit. This utilizes only the noisy function values but, on the downside, comes with a high computational cost. In this paper we present a general approach to shift the main computations from the function in question to the node distribution and, making use of FFT and FFT-like algorithms, even reduce this cost tremendously to the cost of the Tikhonov regularization problem itself. We apply this technique in different settings on the torus, the unit interval, and the two-dimensional sphere. Given that the sampling points satisfy a quadrature rule our algorithm computes the cross-validations scores in floating-point precision. In the cases of arbitrarily scattered nodes we propose an approximating algorithm with the same complexity. Numerical experiments indicate the applicability of our algorithms.

In this paper, we present three distributed algorithms to solve a class of generalized Nash equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) is based on synchronous updates of the agents, while the second and the third (AD-GEED and AD-GENO) represent asynchronous solutions that are robust to communication delays. AD-GENO can be seen as a refinement of AD-GEED, since it only requires node auxiliary variables, enhancing the scalability of the algorithm. Our main contribution is to prove converge to a variational GNE of the game via an operator-theoretic approach. Finally, we apply the algorithms to network Cournot games and show how different activation sequences and delays affect convergence. We also compare the proposed algorithms to the only other in the literature (ADAGNES), and observe that AD-GENO outperforms the alternative.

Previous methods on estimating detailed human depth often require supervised training with `ground truth' depth data. This paper presents a self-supervised method that can be trained on YouTube videos without known depth, which makes training data collection simple and improves the generalization of the learned network. The self-supervised learning is achieved by minimizing a photo-consistency loss, which is evaluated between a video frame and its neighboring frames warped according to the estimated depth and the 3D non-rigid motion of the human body. To solve this non-rigid motion, we first estimate a rough SMPL model at each video frame and compute the non-rigid body motion accordingly, which enables self-supervised learning on estimating the shape details. Experiments demonstrate that our method enjoys better generalization and performs much better on data in the wild.

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to interesting linear algebra questions. When attempting to find a polynomial approximation of boundary or initial data, one encounters the Bernstein-Vandermonde matrix, which is found to be highly ill-conditioned. Previously, we used the relationship between monomial Bezout matrices and the inverse of Hankel matrices to obtain a decomposition of the inverse of the Bernstein mass matrix in terms of Hankel, Toeplitz, and diagonal matrices. In this paper, we use properties of the Bernstein-Bezout matrix to factor the inverse of the Bernstein-Vandermonde matrix into a difference of products of Hankel, Toeplitz, and diagonal matrices. We also use a nonstandard matrix norm to study the conditioning of the Bernstein-Vandermonde matrix, showing that the conditioning in this case is better than in the standard 2-norm. Additionally, we use properties of multivariate Bernstein polynomials to derive a block $LU$ decomposition of the Bernstein-Vandermonde matrix corresponding to equispaced nodes on the $d$-simplex.

Making changes to a program to optimize its performance is an unscalable task that relies entirely upon human intuition and experience. In addition, companies operating at large scale are at a stage where no single individual understands the code controlling its systems, and for this reason, making changes to improve performance can become intractably difficult. In this paper, a learning system is introduced that provides AI assistance for finding recommended changes to a program. Specifically, it is shown how the evaluative feedback, delayed-reward performance programming domain can be effectively formulated via the Monte Carlo tree search (MCTS) framework. It is then shown that established methods from computational games for using learning to expedite tree-search computation can be adapted to speed up computing recommended program alterations. Estimates of expected utility from MCTS trees built for previous problems are used to learn a sampling policy that remains effective across new problems, thus demonstrating transferability of optimization knowledge. This formulation is applied to the Apache Spark distributed computing environment, and a preliminary result is observed that the time required to build a search tree for finding recommendations is reduced by up to a factor of 10x.

Put pictures of 1975-era Aerosmith and 1995-era Guided By Voices next to each other and you probably wouldn’t think the bands have anything in common.…

A method for preparation of an aryl poly(oxalkyl) quaternary ammonium compound is provided, said method comprising steps of: 1) reacting a phenol with a dihalopolyalkylene ether under the action of a phase transfer catalyst, to obtain an arylpoly(oxalkyl) halide; 2) reacting said arylpoly(oxalkyl) halide with an amination reagent under the action of a phase transfer catalyst, to obtain an arylpoly(oxalkyl) amine; 3) reacting said arylpoly(oxalkyl) amine with an alkylation reagent, to obtain an aryl poly(oxalkyl) quaternary ammonium compound; wherein R1 is H or a C1 to C16 alkyl group, located in the ortho, meta or para position; n is an integer of 2 to 6; R2 is H or a C1 to C16 alkyl group; R3 is H or a C1 to C16 alkyl group; R4 is a C1 to C16 alkyl group; X1 is Br or Cl; X is Cl, Br, or I. The preparation method according to the present invention requires low temperature and low pressure, the reaction time is short, and an overall yield can reach 75%. The operation is simple, the cost is low, and the product can be separated easily and have a purity of pharmaceutical grade, thereby facilitating the large-scale production.

Provided are an anti-static and anti-microbial surface treatment agent including a quaternary ammonium salt compound as an active ingredient and a method of preventing a polymer fiber from developing static electricity by using the surface treatment agent. The quaternary ammonium salt compound has excellent anti-static and anti-microbial effects for the prevention or improvement of static electricity in a polymer fiber. Accordingly, the quaternary ammonium salt compound is suitable for use as a fabric softener, or an anti-static agent, and also, provides anti-microbial effects to a polymer fiber.

The current application is directed to monitoring subsystems, and monitoring methods incorporated within the monitoring subsystems, that monitor operation of devices and systems in order to identify normal states and to quickly determine when a device or system transitions from a normal state to an abnormal state. The methods and monitoring components to which the current application is directed employ self-organizing maps and moving-average self-organizing maps to both characterize normal system behavior and to identify transitions to abnormal system behaviors.

A process for producing C10-C26 monobranched fatty acids or alkyl esters thereof which includes isomerizing unsaturated C10-C26 fatty acids or alkyl esters thereof in the presence of a catalyst which comprises both a zeolite and a Lewis base. The zeolite can be reused after simple separation from the reaction products without having to regenerate. The process is particularly suitable for producing highly monobranched fatty acids or alkyl esters thereof.

The invention relates to the use of a composition of A) at least one quaternary ammonia compound comprising at least one organic radical bonded to the ammonia nitrogen atom and optionally comprising heteroatoms and having 1 to 36 carbon atoms, and B) at least one amine alkoxylate ester of formula (1) or a salt thereof, where A, B are, independently of each other, a C2- through C5-alkylene radical R1, a C8- through C24-alkyl radical or alkenyl radical R2, R3, R4 independent of each other, H, or a C8- through C24-acyl radical, with the stipulation that at least one of the radicals R2, R3 or R4 stands for a C8- through C24-acyl radical, and x, y, z, independently of each other, stand for a whole number from 0 through 50, with the stipulation that x+y+z is a whole number from 1 through 100, in quantities of 10 through 5000 g/tonne of ore as a collector in silicate floation.

A glycerol derivative which is effective to reduce blood pressure and has the formula: ##STR1## wherein R1 is an alkyl group having 10-22 carbon atoms, R2 is a lower acyl group or benzoyl, each of R3 and R4 independently is hydrogen or a straight or branched chain alkyl group having 1-6 carbon atoms; each of R5, R6 and R7 independently is hydrogen, a straight or branched chain alkyl group having 1-6 carbon atoms, an aryl group or an aralkyl group; and each of m and n independently is 0 or a positive integer under the condition of m+n=2-8.

In a method for fabricating a graphene structure, there is formed on a fabrication substrate a pattern of a plurality of distinct graphene catalyst materials. In one graphene synthesis step, different numbers of graphene layers are formed on the catalyst materials in the formed pattern. In a method for fabricating a graphene transistor, on a fabrication substrate at least one graphene catalyst material is provided at a substrate region specified for synthesizing a graphene transistor channel and at least one graphene catalyst material is provided at a substrate region specified for synthesizing a graphene transistor source, and at a substrate region specified for synthesizing a graphene transistor drain. Then in one graphene synthesis step, at least one layer of graphene is formed at the substrate region for the graphene transistor channel, and at the regions for the transistor source and drain there are formed a plurality of layers of graphene.

A composite material and method of making and using the same is described. In particular a dental (and preferably photocurable) composite material, and the use of a composite material according to the invention as a dental material and a method for preparation of a composite material according to the invention. Also disclosed are novel radically polymerizable monomers comprising at least one polyalicyclic structure element and certain ethylenic structure elements, which are particularly suitable for use in a composite material according to the invention.

A Montgomery inverse calculation device includes a plurality of registers each storing a value of a variable, a modulus register storing a modulus, a multiplier performing multiplication on the modulus. A comparator compares the value of the variable stored in each of the registers with an output value of the multiplier and generates a plurality of control signals. A plurality of shifters shifts bits of a value of a variable stored in a corresponding register among the registers in response to at least one first control signal, and a quotient generation block calculates a quotient of mod 2m with respect to values output from some of the shifters in response to a second control signal. A calculation block calculates an updated value of an output value of each of the shifters using the quotient in response to at least one third control signal.

Machines, systems and methods for I/O monitoring in a plurality of compute nodes and a plurality of service nodes utilizing a Peripheral Component Interconnect express (PCIe) are provided. In one embodiment, the method comprises assigning at least one virtual function to a services node and a plurality of compute nodes by the PCIe interconnect and a multi-root I/O virtualization (MR-IOV) adapter. The MR-IOV adapter enables bridging of a plurality of compute node virtual functions with corresponding services node virtual functions. A front-end driver on the compute node requests the services node virtual function to send data and the data is transferred to the services node virtual function by the MR-IOV adapter. A back-end driver running in the services node receives and passes the data to a software service to modify/monitor the data. The back-end driver sends the data to another virtual function or an external entity.

An optically active bisbenzyl compound or a racemic bisbenzyl compound represented by formula (2) that has axial chirality: where: R1 represents a halogen, or an optionally substituted: linear, branched, or cyclic C1-8 alkyl, C2-8 alkenyl, C2-8 alkynyl, C6-14 aryl, C3-8 heteroaryl, linear, branched, or cyclic C1-8 alkoxy, or C7-16 aralkyl;R21 each independently represents hydrogen, halogen, nitro, or an optionally substituted: linear, branched, or cyclic C1-8 alkyl, C2-8 alkenyl, C2-8 alkynyl, C6-14 aryl, linear, branched, or cyclic C1-8 alkoxy, or a C7-16 aralkyl;R3 represents hydrogen, or an optionally substituted: C6-14 aryl, a C3-8 heteroaryl, or a C7-16 aralkyl; andY2 represents a halogen, or an optionally substituted: C1-8 alkylsulfonyloxy, C6-14 arylsulfonyloxy, or C7-16 aralkylsulfonyloxy.

The invention is drawn to fluid concentrate formulations of fatty acid monoethanolamides comprising (a) about 71-76% by weight of one or more C8-C22 fatty acid monoethanolamides, (b) about 15-17% by weight of water, and (c) about 10-12% by weight of one or more hydrotropes, based on the fluid formulation, wherein the fluid formulation is homogeneous, pumpable and color stable at a temperature of less than 55° C. A preferred embodiment is drawn to fluid concentrate formulations of cocamide monoethanolamide (CMEA) consisting of (a) about 71-76% by weight of CMEA, (b) about 15-17% by weight of water, and (c) about 10-12% by weight of glycerol, based on the fluid formulation. Methods of preparing the fluid concentrate formulations mulations are also disclosed. The fluid concentrate formulations of fatty acid monoethanolamides are useful in the preparation of cosmetic and pharmaceutical compositions.

An array of a plurality of processing elements (PEs) are in a data packet-switched network interconnecting the PEs and memory to enable any of the PEs to access the memory. The network connects the PEs and their local memories to a common controller. The common controller may include a shared load/store (SLS) unit and an array control unit. A shared read may be addressed to an external device via the common controller. The SLS unit can continue activity as if a normal shared read operation has taken place, except that the transactions that have been sent externally may take more cycles to complete than the local shared reads. Hence, a number of transaction-enabled flags may not have been deactivated even though there is no more bus activity. The SLS unit can use this state to indicate to the array control unit that a thread switch may now take place.

A computer-implemented method is provided for evaluating team performance in a product development environment. The method includes receiving a plurality of points of effort made by a team over a plurality of days in a time period, computing a slope associated with a line of best fit through the plurality of points of effort over the plurality of days, computing a deviation of the slope from an ideal slope corresponding to a desired performance rate for the team, and generating a display illustrating at least one of the slope, the ideal slope or the deviation.

A method for cultivating Monarda fistulosaincludes planting seeds at rates between about 2.5 and about 5 pounds per acre, preferably about 4 pounds per acre. Fuel costs are reduced because seeding, mowing the first season, and harvesting in seasons thereafter are all that is required. Reduction in herbicide use results from the heavy rate of planting, improved germination attributed to rolling, and the plant's natural herbicides which are more highly effective when seeded at the higher rate. The method includes seeding, mowing during a first growing season, and harvesting each season thereafter. This method results in oil without weed contamination and carvacrol levels are high.

A method of monitoring an engine coolant system includes modeling the total energy stored within an engine coolant. If an actual temperature of the engine coolant is below a minimum target temperature, the modeled total energy stored within the energy coolant is compared to a maximum stored energy limit to determine if sufficient energy exists within the engine coolant to heat the engine coolant to a temperature equal to or greater than the minimum target temperature. The engine coolant system fails the diagnostic check when the modeled total energy stored within the energy coolant is greater than the maximum stored energy limit, and the minimum target temperature has not been reached.

A method, a system and a computer readable medium for providing information relating to a verification of a digital circuit. The verification may be formal verification and comprise formally verifying that a plurality of formal properties is valid for a representation of the digital circuit. The method comprises replacing at least a first input value relating to the representation of the digital circuit by a first free variable, determining if at least one of the plurality of formal properties is valid or invalid after replacing the first input value by the first variable and indicating if the at least one of the plurality of formal property is valid or invalid. The use of a free or open variable that has not determined value can be directly in the description or representation of the digital circuit. It is not necessary to insert errors or to apply an error model.

A process is provided for recovering aliphatic monocarboxylic acids having from 4 to 11 carbon atoms from the distillation residue obtained in the oxidation of the corresponding aldehyde by means of oxygen or oxygen-containing gas mixtures in the presence of alkali metal carboxylates or alkaline earth metal carboxylates to form the corresponding monocarboxylic acid and subsequent distillation, characterized in that the distillation residue is reacted with an aqueous acid in a tube reactor and the two-phase mixture flowing out from the tube reactor is introduced into a settling vessel in which the organic phase which separates out has a pH of 4.5 or less.

An ammonium hydroxyfluoroalkanesulfinate is obtained by using an organic base while sulfinating a bromofluoroalcohol with a sulfinating agent. An ammonium hydroxyfluoroalkanesulfonate is obtained by oxidizing the ammonium hydroxyfluoroalkanesulfinate. An onium fluoroalkanesulfonate is obtained by converting the ammonium hydroxyfluoroalkanesulfonate into an onium salt through esterification. This onium fluoroalkanesulfonate is useful as a photoacid generator in chemically amplified resists and the like.

A method for preparing a high purity (e.g. greater than 70 wt. %) mono-hydrolyzed acyl halide compound as a precipitate from solution comprising the steps of preparing a solution comprising: i) at least 80 v/v % of a hydrocarbon solvent, ii) water at a molar concentration greater than its solubility limit within the solvent but less that its solubility limit in solution, iii) a tri-hydrocarbyl phosphate compound, and iv) a polyfunctional acyl halide compound at molar ratio to both water and the tri-hydrocarbyl phosphate compound of at least 1:1.

The present invention concerns a TCTP antagonist, in particular a nucleic acid targeting an m RNA encoding Translationally-Controlled Tumor Protein (TCTP), wherein said nucleic acid is capable of reducing the amount of TCTP in cells, for use in the treatment or prevention of hormone-independent cancer or chemo-resistant cancer, such as an androgen-independent prostate cancer.