A driver of a car collided with a bridge barrier and two lorries

Soil disturbance is a visually apparent result of using heavy equipment to harvest trees. Subsequent consequences for growth of remaining trees, however, are variable and seldom quantified. We measured tree growth 7 and 11 years after thinning of trees in four stands of coast Douglas-fir (Pseudotsuga menziesii var. menziesii (Mirb. Franco)) where soil disturbance was limited by using planned skid trails, usually on dry soils. The three younger stands had responded to nitrogen fertilizer in the 4 years before thinning, but only one stand showed continued response in the subsequent 7- or 11-year period after thinning. The most consistent pattern observed was greater growth of residual trees located next to skid trails. The older stand also showed greater growth in trees located next to skid trails, whereas tillage of skid trails failed to benefit growth of nearby residual trees for the first 7 years after tillage. We conclude that traffic that compacted soil only on one side of residual trees did not reduce growth of nearby trees.

The 1980 eruption of Mount St. Helens produced a massive landslide and consequent pyroclastic currents, deposits of which blocked the outlet to Spirit Lake. Without an outlet, the lake began to rise, threatening a breaching of the blockage and release of a massive volume of water. To mitigate the hazard posed by the rising lake and provide an outlet, in 1984–1985 the U.S. Army Corps of Engineers bored a 2.6-km (8,500-ft) long tunnel through a bedrock ridge on the western edge of the lake.

SANDHILL MEDIA Top 40 KAOX (NOW 107.9)/SHELLEY-IDAHO FALLS, ID will flip to News-Talk as "NEWSTALK 107.9" with former RICH BROADCASTING News-Talk KID-A-KIDG-KIDJ/IDAHO FALLS morning … more

It's the end of an era as after 19 years as PD at HUBBARD Hot AC KSTP (KS95)/MINNEAPOLIS, LEIGHTON PECK has resigned his post. All totaled PECK was at KS95 nearly 29 years, and worked … more

While sheltering-at-home in UPSTATE NEW YORK, GLASSNOTE Head Of Promotion NICK PETROPOULOS sent KCMP (89.3 THE CURRENT)/MINNEAPOLIS PD JIM MCGUINN a song of guitar riffs and an email about … more

Nearly 25,000 more Iowans filed unemployment claims in the past week, Iowa Workforce Development reported Thursday. Continuing weekly unemployment claims total 181,358, the department reported. Iowa...

The time is near, only 6 hours and some change to to get your tickets to WordCamp in Las Vegas! I have my tickets, and so do 125 other at the moment. If you have not purchased tickets and are going to be in the LV area, or planning on heading that way, well then […]

The post WordCamp Las Vegas Near appeared first on WPCult.

Nearly 25,000 more Iowans filed unemployment claims in the past week, Iowa Workforce Development reported Thursday.

Continuing weekly unemployment claims total 181,358, the department reported.

Iowa Workforce Development said 24,693 people filed unemployment claims between April 26 and May 2. That included 22,830 initial claims by people who work in Iowa and 1,863 claims filed by people who work in Iowa but live in another state.

State unemployment insurance benefit payments totaled $50,931,302 for the same week, the department said.

Also this week, a total of $111,378,600 in Federal Pandemic Unemployment Compensation benefits was paid to 164,088 Iowans. Since April 4, a total of $439,126,200 has been paid.

A total of $10,046,089 was paid to 15,612 Iowans receiving Pandemic Unemployment Assistance benefits.

The industries with the most claims were manufacturing, 6,053; industry not available, self-employed, independent contractors, 4,010; health care and social assistance, 2,988; accommodation and food services, 2,200; and retail trade, 1,768.

Gov. Kim Reynolds is continuing to allow more businesses to reopen, which may mean more Iowans going back to work.

On Wednesday, after meeting with President Donald Trump at the White House, Reynolds issued a proclamation permitting a variety of businesses to reopen, including dental services, drive-in movie theaters, tanning facilities and medical spas.

She also relaxed mitigation strategies in the 22 counties that remain under more strict orders because the virus is more widespread there.

Beginning Friday in those 22 counties — which include Linn, Johnson and Black Hawk — malls and retail stores may reopen provided they operate at no more than 50 percent of capacity, and fitness centers may reopen on an appointment basis only.

For more information on the total data for this week’s unemployment claims, visit https://www.iowalmi.gov/unemployment-insurance-statistics.

Comments: (319) 398-8375; james.lynch@thegazette.com

Jesse Chehak
Near Big Water, Utah, 2010
Website - JesseChehak.com

Born in Tarzana, California, Jesse Chehak studied photography and Art History at Sarah Lawrence College and is currently pursuing a MFA at the University of Arizona. Chehak has exhibited his large format prints in galleries and project spaces including Bruce Silverstein (New York), Danese (New York) and the Durham Art Guild (Durham, North Carolina.) He is currently seeking funding to publish his first monograph, Fool's Gold, and a gallery to exhibit and distribute the completed print edition. In 2005, Chehak joined M.A.P. and began executing commercial campaigns and editorial features for clients, including The New York Times, Wallpaper*, Newsweek, GQ, Ogilvy & Mather, Saatchi & Saatchi, Digitas, and others. Chehak has received notable attention for his work, including PDN30 in 2005, The Magenta Foundation's Flash Forward in 2007, a Baum Nomination in 2008, and AP25. He lives in Tucson and Los Angeles.

One proves the existence and uniqueness of a generalized (mild) solution for the nonlinear Fokker--Planck equation (FPE) egin{align*} &u_t-Delta (eta(u))+{mathrm{ div}}(D(x)b(u)u)=0, quad tgeq0, xinmathbb{R}^d, d e2, \ &u(0,cdot)=u_0,mbox{in }mathbb{R}^d, end{align*} where $u_0in L^1(mathbb{R}^d)$, $etain C^2(mathbb{R})$ is a nondecreasing function, $bin C^1$, bounded, $bgeq 0$, $Din(L^2cap L^infty)(mathbb{R}^d;mathbb{R}^d)$ with ${ m div}, Din L^infty(mathbb{R}^d)$, and ${ m div},Dgeq0$, $eta$ strictly increasing, if $b$ is not constant. Moreover, $t o u(t,u_0)$ is a semigroup of contractions in $L^1(mathbb{R}^d)$, which leaves invariant the set of probability density functions in $mathbb{R}^d$. If ${ m div},Dgeq0$, $eta'(r)geq a|r|^{alpha-1}$, and $|eta(r)|leq C r^alpha$, $alphageq1,$ $alpha>frac{d-2}d$, $dgeq3$, then $|u(t)|_{L^infty}le Ct^{-frac d{d+(alpha-1)d}} |u_0|^{frac2{2+(m-1)d}},$ $t>0$, and the existence extends to initial data $u_0$ in the space $mathcal{M}_b$ of bounded measures in $mathbb{R}^d$. The solution map $mumapsto S(t)mu$, $tgeq0$, is a Lipschitz contractions on $mathcal{M}_b$ and weakly continuous in $tin[0,infty)$. As a consequence for arbitrary initial laws, we obtain weak solutions to a class of McKean-Vlasov SDEs with coefficients which have singular dependence on the time marginal laws.

We consider a nonlinear Dirichlet problem driven by a nonhomogeneous differential operator plus an indefinite potential. In the reaction we have the competing effects of a singular term and of concave and convex nonlinearities. In this paper the concave term is parametric. We prove a bifurcation-type theorem describing the changes in the set of positive solutions as the positive parameter $lambda$ varies. This work continues our research published in arXiv:2004.12583, where $xi equiv 0 $ and in the reaction the parametric term is the singular one.

In this paper, we mainly establish the existence and uniqueness theorem for solutions of the exterior Dirichlet problem for a class of fully nonlinear second-order elliptic equations related to the eigenvalues of the Hessian, with prescribed generalized symmetric asymptotic behavior at infinity. Moreover, we give some new results for the Hessian equations, Hessian quotient equations and the special Lagrangian equations, which have been studied previously.

This paper considers the distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of local cost functions by using local information exchange. We first propose a distributed first-order primal-dual algorithm. We show that it converges sublinearly to the stationary point if each local cost function is smooth and linearly to the global optimum under an additional condition that the global cost function satisfies the Polyak-{L}ojasiewicz condition. This condition is weaker than strong convexity, which is a standard condition for proving the linear convergence of distributed optimization algorithms, and the global minimizer is not necessarily unique or finite. Motivated by the situations where the gradients are unavailable, we then propose a distributed zeroth-order algorithm, derived from the proposed distributed first-order algorithm by using a deterministic gradient estimator, and show that it has the same convergence properties as the proposed first-order algorithm under the same conditions. The theoretical results are illustrated by numerical simulations.

This paper is devoted to the study of the singularity phenomenon of timelike extremal hypersurfaces in Minkowski spacetime $mathbb{R}^{1+3}$. We find that there are two explicit lightlike self-similar solutions to a graph representation of timelike extremal hypersurfaces in Minkowski spacetime $mathbb{R}^{1+3}$, the geometry of them are two spheres. The linear mode unstable of those lightlike self-similar solutions for the radially symmetric membranes equation is given. After that, we show those self-similar solutions of the radially symmetric membranes equation are nonlinearly stable inside a strictly proper subset of the backward lightcone. This means that the dynamical behavior of those two spheres is as attractors. Meanwhile, we overcome the double roots case (the theorem of Poincar'{e} can't be used) in solving the difference equation by construction of a Newton's polygon when we carry out the analysis of spectrum for the linear operator.

We study a class of fourth order nonlinear parabolic equations which include the thin-film equation and the quantum drift-diffusion model as special cases. We investigate these equations by first developing functional inequalities of the type $ int_Omega u^{2gamma-alpha-eta}Delta u^alphaDelta u^eta dx geq cint_Omega|Delta u^gamma |^2dx $, which seem to be of interest on their own right.

Let $Gamma$ be a discrete group acting properly discontinuously and isometrically on the three-dimensional anti-de Sitter space $mathrm{AdS}^{3}$, and $square$ the Laplacian which is a second-order hyperbolic differential operator. We study linear independence of a family of generalized Poincar'{e} series introduced by Kassel-Kobayashi [Adv. Math. 2016], which are defined by the $Gamma$-average of certain eigenfunctions on $mathrm{AdS}^{3}$. We prove that the multiplicities of $L^{2}$-eigenvalues of the hyperbolic Laplacian $square$ on $Gammaackslashmathrm{AdS}^{3}$ are unbounded when $Gamma$ is finitely generated. Moreover, we prove that the multiplicities of extit{stable $L^{2}$-eigenvalues} for compact anti-de Sitter $3$-manifolds are unbounded.

Our goal in this article is to study the global Lorentz estimates for gradient of weak solutions to $p$-Laplace double obstacle problems involving the Schr"odinger term: $-Delta_p u + mathbb{V}|u|^{p-2}u$ with bound constraints $psi_1 le u le psi_2$ in non-smooth domains. This problem has its own interest in mathematics, engineering, physics and other branches of science. Our approach makes a novel connection between the study of Calder'on-Zygmund theory for nonlinear Schr"odinger type equations and variational inequalities for double obstacle problems.

High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs, because of three challenges: (1) difficulty of coming up with graph building blocks, (2) load imbalance on parallel hardware, and (3) graph problems having low arithmetic intensity. To address these challenges, GraphBLAS is an innovative, on-going effort by the graph analytics community to propose building blocks based in sparse linear algebra, which will allow graph algorithms to be expressed in a performant, succinct, composable and portable manner. In this paper, we examine the performance challenges of a linear algebra-based approach to building graph frameworks and describe new design principles for overcoming these bottlenecks. Among the new design principles is exploiting input sparsity, which allows users to write graph algorithms without specifying push and pull direction. Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed. Load-balancing is an important feature for balancing work amongst parallel workers. We describe the important load-balancing features for handling graphs with different characteristics. The design principles described in this paper have been implemented in "GraphBLAST", the first open-source linear algebra-based graph framework on GPU targeting high-performance computing. The results show that on a single GPU, GraphBLAST has on average at least an order of magnitude speedup over previous GraphBLAS implementations SuiteSparse and GBTL, comparable performance to the fastest GPU hardwired primitives and shared-memory graph frameworks Ligra and Gunrock, and better performance than any other GPU graph framework, while offering a simpler and more concise programming model.

When time-dependent partial differential equations (PDEs) are solved numerically in a domain with curved boundary or on a curved surface, mesh error and geometric approximation error caused by the inaccurate location of vertices and other interior grid points, respectively, could be the main source of the inaccuracy and instability of the numerical solutions of PDEs. The role of these geometric errors in deteriorating the stability and particularly the conservation properties are largely unknown, which seems to necessitate very fine meshes especially to remove geometric approximation error. This paper aims to investigate the effect of geometric approximation error by using a high-order mesh with negligible geometric approximation error, even for high order polynomial of order p. To achieve this goal, the high-order mesh generator from CAD geometry called NekMesh is adapted for surface mesh generation in comparison to traditional meshes with non-negligible geometric approximation error. Two types of numerical tests are considered. Firstly, the accuracy of differential operators is compared for various p on a curved element of the sphere. Secondly, by applying the method of moving frames, four different time-dependent PDEs on the sphere are numerically solved to investigate the impact of geometric approximation error on the accuracy and conservation properties of high-order numerical schemes for PDEs on the sphere.

Dense kernel matrices $Theta in mathbb{R}^{N imes N}$ obtained from point evaluations of a covariance function $G$ at locations ${ x_{i} }_{1 leq i leq N} subset mathbb{R}^{d}$ arise in statistics, machine learning, and numerical analysis. For covariance functions that are Green's functions of elliptic boundary value problems and homogeneously-distributed sampling points, we show how to identify a subset $S subset { 1 , dots , N }^2$, with $# S = O ( N log (N) log^{d} ( N /epsilon ) )$, such that the zero fill-in incomplete Cholesky factorisation of the sparse matrix $Theta_{ij} 1_{( i, j ) in S}$ is an $epsilon$-approximation of $Theta$. This factorisation can provably be obtained in complexity $O ( N log( N ) log^{d}( N /epsilon) )$ in space and $O ( N log^{2}( N ) log^{2d}( N /epsilon) )$ in time, improving upon the state of the art for general elliptic operators; we further present numerical evidence that $d$ can be taken to be the intrinsic dimension of the data set rather than that of the ambient space. The algorithm only needs to know the spatial configuration of the $x_{i}$ and does not require an analytic representation of $G$. Furthermore, this factorization straightforwardly provides an approximate sparse PCA with optimal rate of convergence in the operator norm. Hence, by using only subsampling and the incomplete Cholesky factorization, we obtain, at nearly linear complexity, the compression, inversion and approximate PCA of a large class of covariance matrices. By inverting the order of the Cholesky factorization we also obtain a solver for elliptic PDE with complexity $O ( N log^{d}( N /epsilon) )$ in space and $O ( N log^{2d}( N /epsilon) )$ in time, improving upon the state of the art for general elliptic operators.

Lexicographic Depth First Search (LexDFS) is a special variant of a Depth First Search (DFS), which was introduced by Corneil and Krueger in 2008. While this search has been used in various applications, in contrast to other graph searches, no general linear time implementation is known to date. In 2014, K"ohler and Mouatadid achieved linear running time to compute some special LexDFS orders for cocomparability graphs. In this paper, we present a linear time implementation of LexDFS for chordal graphs. Our algorithm is able to find any LexDFS order for this graph class. To the best of our knowledge this is the first unrestricted linear time implementation of LexDFS on a non-trivial graph class. In the algorithm we use a search tree computed by Lexicographic Breadth First Search (LexBFS).

We study the problem of pricing under a Multinomial Logit model where we incorporate network effects over the consumer's decisions. We analyse both cases, when sellers compete or collaborate. In particular, we pay special attention to the overall expected revenue and how the behaviour of the no purchase option is affected under variations of a network effect parameter. Where for example we prove that the market share for the no purchase option, is decreasing in terms of the value of the network effect, meaning that stronger communication among costumers increases the expected amount of sales. We also analyse how the customer's utility is altered when network effects are incorporated into the market, comparing the cases where both competitive and monopolistic prices are displayed. We use tools from stochastic approximation algorithms to prove that the probability of purchasing the available products converges to a unique stationary distribution. We model that the sellers can use this stationary distribution to establish their strategies. Finding that under those settings, a pure Nash Equilibrium represents the pricing strategies in the case of competition, and an optimal (that maximises the total revenue) fixed price characterise the case of collaboration.

Randomized Numerical Linear Algebra (RandNLA) uses randomness to develop improved algorithms for matrix problems that arise in scientific computing, data science, machine learning, etc. Determinantal Point Processes (DPPs), a seemingly unrelated topic in pure and applied mathematics, is a class of stochastic point processes with probability distribution characterized by sub-determinants of a kernel matrix. Recent work has uncovered deep and fruitful connections between DPPs and RandNLA which lead to new guarantees and improved algorithms that are of interest to both areas. We provide an overview of this exciting new line of research, including brief introductions to RandNLA and DPPs, as well as applications of DPPs to classical linear algebra tasks such as least squares regression, low-rank approximation and the Nystr"om method. For example, random sampling with a DPP leads to new kinds of unbiased estimators for least squares, enabling more refined statistical and inferential understanding of these algorithms; a DPP is, in some sense, an optimal randomized algorithm for the Nystr"om method; and a RandNLA technique called leverage score sampling can be derived as the marginal distribution of a DPP. We also discuss recent algorithmic developments, illustrating that, while not quite as efficient as standard RandNLA techniques, DPP-based algorithms are only moderately more expensive.

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.

In this paper, we analyze the symbol error rate (SER) performance of the simultaneous wireless information and power transfer (SWIPT) enabled three-node differential decode-and-forward (DDF) relay networks, which adopt the power splitting (PS) protocol at the relay. The use of non-coherent differential modulation eliminates the need for sending training symbols to estimate the instantaneous channel state informations (CSIs) at all network nodes, and therefore improves the power efficiency, as compared with the coherent modulation. However, performance analysis results are not yet available for the state-of-the-art detectors such as the approximate maximum-likelihood detector. Existing works rely on Monte-Carlo simulation to show that there exists an optimal PS ratio that minimizes the overall SER. In this work, we propose a near-optimal detector with linear complexity with respect to the modulation size. We derive an accurate approximate SER expression, based on which the optimal PS ratio can be accurately estimated without requiring any Monte-Carlo simulation.

An approach is given for solving large linear systems that combines Krylov methods with use of two different grid levels. Eigenvectors are computed on the coarse grid and used to deflate eigenvalues on the fine grid. GMRES-type methods are first used on both the coarse and fine grids. Then another approach is given that has a restarted BiCGStab (or IDR) method on the fine grid. While BiCGStab is generally considered to be a non-restarted method, it works well in this context with deflating and restarting. Tests show this new approach can be very efficient for difficult linear equations problems.

By The New York Times The New York Times Company As President Donald Trump presses for states to reopen their economies, his administration is privately projecting a steady rise in the number of cases and deaths from the coronavirus over the next several weeks, reaching about 3,000 daily deaths June 1, according to an internal document obtained by The New York Times, nearly double from the current level of about 1,750.…

ON INLANDER.COM NATION: Even as U.S. President Donald Trump urges states to reopen their economies, his own administration projects that the death toll from COVID-19 will spike to 3,000 people per day.…

The latest issue of the Inlander is hitting newsstands today. Find it at your local grocery store and hundreds of other locations; use this map to find a pickup point near you.…

In one embodiment, a plurality of objects associated with a dataset and a specified number of nearest objects to be identified are received. The received objects are sorted in a structured format. Further, a key object and a number of adjacent objects corresponding to the key object are selected from the sorted plurality of objects, wherein the number of adjacent objects is selected based on the specified number of nearest objects to be identified. Furthermore, distances between the key object and the number of adjacent objects are determined to identify the specified number of nearest objects, wherein the distances are determined until the specified number of nearest objects is identified. Based on the determined distances, the specified number of nearest objects in the dataset is identified for data analysis.

A method for controlling 2-isomer content in linear alkylbenzene obtained by alkylating benzene with olefins and catalyst used in the method.

Apparatus comprising an input connected to receive an input signal, a lookup table comprising a plurality of input entries and first and second output entries for each input entry. The look up table receives the input signal and returns a lower input entry, an upper input entry, the second output entry for the lower input entry, and the first output entry for the upper input entry. A first subtractor subtracts the lower input entry from the input signal to produce a first difference. A second subtractor subtracts the input signal from the upper input entry to produce a second difference. First and second multipliers multiply the first and second differences by the first output entry for the upper input entry and the second output entry for the lower input entry, respectively, to produce first and second products. An adder adds the first and second products to produce an output signal.

Apparatus and method for processing linear systems of equations and finding a n×1 vector x satisfying Ax=b where A is a symmetric, positive-definite n×n matrix corresponding to n×n predefined high-precision elements and b is an n1 vector corresponding to n predefined high-precision elements. A first iterative process generates n low-precision elements corresponding to an n×1 vector xl satisfying Alxl=bl where Al, bl are elements in low precision. The elements are converted to high-precision data elements to obtain a current solution vector x. A second iterative process generates n low-precision data elements corresponding to an n×1 correction vector dependent on the difference between the vector b and the vector product Ax. Then there is produced from the n low-precision data elements of the correction vector respective high-precision data elements of an n×1 update vector u. The data elements of the current solution vector x are updated such that x=x+u.

Disclosed is a splicing method of two second-generation ReBCO high temperature superconductor coated conductors (2G ReBCO HTS CCs), in which, with stabilizing layers removed from the two strands of 2G ReBCO HTS CCs through chemical wet etching or plasma dry etching, surfaces of the two high temperature superconducting layers are brought into direct contact with each other and heated in a splicing furnace in a vacuum for micro-melting portions of the surfaces of the high temperature superconducting layers to permit inter-diffusion of ReBCO atoms such that the surfaces of the two superconducting layers can be spliced to each other and oxygenation annealing for recovery of superconductivity which was lost during splicing.

Tissue slices and whole organisms offer substantial challenges to fluorescence imaging. Autofluorescence and absorption via intrinsic chromophores, such as flavins, melanin, and hemoglobins, confound and degrade output from all fluorescent tags. An “optical window,” farther red than most autofluorescence sources and in a region of low hemoglobin and water absorbance, lies between 650 and 900 nm. This valley of relative optical clarity is an attractive target for fluorescence-based studies within tissues, intact organs, and living organisms. Novel fluorescent tags were developed herein, based upon a genetically targeted fluorogen activating protein and cognate fluorogenic dye that yields emission with a peak at 733 nm exclusively when complexed as a “fluoromodule”. This tool improves substantially over previously described far-red/NIR fluorescent proteins in terms of brightness, wavelength, and flexibility by leveraging the flexibility of synthetic chemistry to produce novel chromophores.

A computer-implemented method, system, and computer program product are disclosed for updating simulation models of a subterranean reservoir. An ensemble of reservoir models representing a subterranean reservoir having non-Gaussian characteristics is provided and the ensemble of reservoir models is updated using a subspace ensemble Kalman filter. Kemal principle component analysis parameterization or K-L expansion parameterization can be used to update the ensemble of reservoir models.

Methods for creating and using space-time surrogate models of subsurface regions, such as subsurface regions containing at least one hydrocarbon formation. The created surrogate models are explicit models that may be created from implicit models, such as computationally intensive full-physics models. The space-time surrogate models are parametric with respect to preselected variables, such as space, state, and/or design variables, while also indicating responsiveness of the preselected variables with respect to time. In some embodiments, the space-time surrogate model may be parametric with respect to preselected variables as well as to time. Methods for updating and evolving models of subsurface regions are also disclosed.

A mixing and kneading machine (1) for continual compounding comprises a screw shaft (3) rotating in a casing (2) and simultaneously moving axially translationally. To sustainably enhance the efficiency of the machine as regards its material thruput per unit of time the screw shaft (3) comprises at least four groups of radial screw vanes (4a, 4b, 4c, 4d) evenly distributed circumferentially, each group consisting of a plurality of screw vanes in axial sequence. The outer diameter (Da) of the screw shaft ranges from 400 to 800 millimeters. The rotary speed of the screw shaft (3) ranges from 30 to 80 rpm. A mixing and kneading machine (1) engineered as such is particularly suitable for compounding an anodic mass in the production of electrodes—anodes—for the aluminum industry.

Method for a memory including a first, second, third and fourth cells include applying a read, program, or erase voltage, the first and second cells coupled to a first top interconnect, the third and fourth cells coupled to a second top interconnect, the first and third cells coupled to a first bottom interconnect, the second and fourth cells are to a second bottom interconnect, each cell includes a switching material overlying a non-linear element (NLE), the resistive switching material is associated with a first conductive threshold voltage, the NLE is associated with a lower, second conductive threshold voltage, comprising applying the read voltage between the first top and the first bottom electrode to switch the NLE of the first cell to conductive, while the NLEs of the second, third, and the fourth cells remain non-conductive, and detecting a read current across the first cell in response to the read voltage.

An apparatus for energy assisted magnetic recording of a storage disk include a plurality of dielectric waveguide cores configured to direct received incident light energy to a target, and a near field transducer (NFT) configured to focus light energy received from the plurality of waveguide cores and to transmit the focused light energy onto the storage disk surface to generate a heating spot on the storage disk. The NFT includes a plurality of propagating surface plasmon polariton (PSPP) elements that are energized by the light energy from the waveguide cores. Each of the PSPP elements has a plasmonic metal bar disposed above a single waveguide core in a longitudinal alignment. Each metal bar has a width at least twice the width of the heating spot generated on the storage disk.

This invention is provides a means of playing LP records with minimal distortion. Low distortion is achieved by eliminating tracking error normally associated with pickup cartridges mounted to pivoting tone arms. This invention discloses a tone arm that constrains the motion of the stylus to straight radial path, mimicking the cutting path of the record lathe, supported on parallel rails by free rolling spherical bearings. Unlike many previous linear tracking tone arms, this invention does not rely on air pressure or servo motor mechanisms. The use of free rolling bearings or axles between parallel tracks fashioned from rails, rods or tubes, eliminates all sources of lateral friction other than pure static and rolling friction of the balls on the rails, rods or tubes. In the preferred embodiment, the fixed rods or tubes are driven synchronously, thereby eliminating static friction of the supporting rolling balls. Friction is further reduced using magnetic or buoyant support of the tone arm to reduce bearing load to that amount minimally sufficient to maintain full contact between the rolling balls and the upper and lower rods.

An near-field light device (100) is provided with: a first electrode layer (123) having a protruding portion (123a); a second electrode layer (121); and a light emitting layer (122), the protruding portion protrudes along a predetermined direction (Y axis direction) to be capable of extracting energy which is caused by emission of light at the light emitting layer, the predetermined direction intersects with a laminated direction (X axis direction) of the near-field light device, an edge surface of at least one portion of the projection portion is located at more outward side in the optical device than an edge surface of the second electrode layer is.

In a heat-assisted magnetic recording head for use in a hard disk drive, a thermal shunt is positioned between an E-antenna near field transducer (NFT) and a return pole, to draw excess heat away from the NFT region. The thermal shunt comprises two portions separated by a gap that has a trapezoidal cross-section, where the NFT-side of the gap is wider than the return pole-side of the gap.

An apparatus includes a writer, an arrangement comprising a plasmonic near-field transducer (NFT) adjacent the writer and comprising a material having a temperature coefficient of resistance (TCR), and a lead arrangement connected to the NFT arrangement. In some configurations, the NFT arrangement includes a heat sink, and the lead arrangement is connected to the heat sink. In other configurations, the lead arrangement is connected directly to the NFT.

A sleep apnea prevention sleep-aid mask is described. The sleep-aid mask is configured to secure the lips of a user together in a natural state, in order to encourage the respiratory system of the user to employ the nasal passages rather than the mouth for respiration. A pad equipped with a perforated mesh or channel is positioned over the lips and mouth of the user, and secured in position on the user via an adhesive, which temporarily affixes the pad to the face of the user. The sleep-aid mask is preferably shaped and sized according to the specific size of the user's face, and is configured to limit the effective diameter of the mouth of the user, in order to cause continued use of respiration via the nasal passages.

Porphyrin compounds are provided. The compounds may further comprise a fused polycyclic aromatic hydrocarbon or a fused heterocyclic aromatic. Fused polycyclic aromatic hydrocarbon s and fused heterocyclic aromatics may extend and broaden absorption, and modify the solubility, crystallinity, and film-forming properties of the porphyrin compounds. Additionally, devices comprising porphyrin compounds are also provided. The porphyrin compounds may be used in a donor/acceptor configuration with compounds, such as C60.