IEEE / Institute of Electrical and Electronics Engineers Incorporated

Boston : Birkhäuser, 2006

Wiesbaden : Vieweg, 2007

Boston, Mass. : Birkhäuser ; 2007

This paper highlights the many enhancements to SAS/ETS software and demonstrates how these features can help your organization increase revenue and enhance productivity.

Free-electron lasers (FELs) based on superconducting accelerator technology and storage ring facilities operate with bunch repetition rates in the MHz range, and the need arises for bunch-by-bunch electron and photon diagnostics. For photon-pulse-resolved measurements of spectral distributions, fast one-dimensional profile monitors are required. The linear array detector KALYPSO (KArlsruhe Linear arraY detector for MHz-rePetition rate SpectrOscopy) has been developed for electron bunch or photon pulse synchronous read-out with frame rates of up to 2.7 MHz. At the FLASH facility at DESY, a current version of KALYPSO with 256 pixels has been installed at a grating spectrometer as online diagnostics to monitor the pulse-resolved spectra of the high-repetition-rate FEL pulses. Application-specific front-end electronics based on MicroTCA standard have been developed for data acquisition and processing. Continuous data read-out with low latency in the microsecond range enables the integration into fast feedback applications. In this paper, pulse-resolved FEL spectra recorded at 1.0 MHz repetition rate for various operation conditions at FLASH are presented, and the first application of an adaptive feedback for accelerator control based on photon beam diagnostics is demonstrated.

X-ray absorption linear dichroism of rutile TiO2 at the Ti K-edge provides information about the electronic states involved in the pre-edge transitions. Here, linear dichroism with high energy resolution is analyzed in combination with ab initio finite difference method calculations and spherical tensor analysis. It provides an assignment of the three pre-edge peaks beyond the octahedral crystal field splitting approximation and estimates the spatial extension of the corresponding final states. It is then discussed for the first time the X-ray absorption (XAS) of pentacoordinated titanium atoms due to oxygen vacancies and it is found that, similarly to anatase TiO2, rutile is expected to exhibit a transition on the low-energy side of peak A3. Its apparent absence in the experiment is related to the degree of p–d orbital mixing which is small in rutile due to its centrosymmetric point group. A recent XAS linear dichroism study on anatase TiO2 single crystals has shown that peak A2 has an intrinsic origin and is due to a quadrupolar transition to the 3d energy levels. In rutile, due to its centrosymmetric point group, the corresponding peak A2 has a small dipole moment explaining the weak transition. The results are confronted with recent picosecond X-ray absorption spectroscopy on rutile TiO2 nanoparticles.

During single-crystal-to-single-crystal (SCSC) phase transitions, a polymorph of a compound can transform to a more stable form while remaining in the solid state. By understanding the mechanism of these transitions, strategies can be developed to control this phenomenon. This is particularly important in the pharmaceutical industry, but also relevant for other industries such as the food and agrochemical industries. Although extensive literature exists on SCSC phase transitions in inorganic crystals, it is unclear whether their classications and mechanisms translate to molecular crystals, with weaker interactions and more steric hindrance. A comparitive study of SCSC phase transitions in aliphatic linear-chain amino acid crystals, both racemates and quasi-racemates, is presented. A total of 34 transitions are considered and most are classified according to their structural change during the transition. Transitions without torsional changes show very different characteristics, such as transition temperature, enthalpy and free energy, compared with transitions that involve torsional changes. These differences can be rationalized using classical nucleation theory and in terms of a difference in mechanism; torsional changes occur in a molecule-by-molecule fashion, whereas transitions without torsional changes involve cooperative motion with multiple molecules at the same time.

A Thomson scattering X-ray source can provide quasi-monochromatic, continuously energy-tunable, polarization-controllable and high-brightness X-rays, which makes it an excellent tool for X-ray fluorescence computed tomography (XFCT). In this paper, we examined the suppression of Compton scattering background in XFCT using the linearly polarized X-rays and the implementation feasibility of linearly polarized XFCT based on this type of light source, concerning the influence of phantom attenuation and the sampling strategy, its advantage over K-edge subtraction computed tomography (CT), the imaging time, and the potential pulse pile-up effect by Monte Carlo simulations. A fan beam and pinhole collimator geometry were adopted in the simulation and the phantom was a polymethyl methacrylate cylinder inside which were gadolinium (Gd)-loaded water solutions with Gd concentrations ranging from 0.2 to 4.0 wt%. Compared with the case of vertical polarization, Compton scattering was suppressed by about 1.6 times using horizontal polarization. An accurate image of the Gd-containing phantom was successfully reconstructed with both spatial and quantitative identification, and good linearity between the reconstructed value and the Gd concentration was verified. When the attenuation effect cannot be neglected, one full cycle (360°) sampling and the attenuation correction became necessary. Compared with the results of K-edge subtraction CT, the contrast-to-noise ratio values of XFCT were improved by 2.03 and 1.04 times at low Gd concentrations of 0.2 and 0.5 wt%, respectively. When the flux of a Thomson scattering light source reaches 1013 photons s−1, it is possible to finish the data acquisition of XFCT at the minute or second level without introducing pulse pile-up effects.

The structural and nonlinear optical properties of a new anilinium hybrid crystal of chemical formula (C6H7NCl+·NO3−)3 have been investigated. The crystal structure was determined from single-crystal X-ray diffraction measurements performed at a temperature of 100 K which show that the compound crystallizes in a noncentrosymmetric space group (Pna21). The structural analysis was coupled with Hirshfeld surface analysis to evaluate the contribution of the different intermolecular interactions to the formation of supramolecular assemblies in the solid state that exhibit nonlinear optical features. This analysis reveals that the studied compound is characterized by a three-dimensional network of hydrogen bonds and the main contributions are provided by the O...H, C...H, H...H and Cl...H interactions, which alone represent ∼85% of the total contributions to the Hirshfeld surfaces. It is noteworthy that the halogen...H contributions are quite comparable with those of the H...H contacts. The nonlinear optical properties were investigated by nonlinear diffuse femtosecond-pulse reflectometry and the obtained results were compared with those of the reference material LiNbO3. The hybrid crystals exhibit notable second (SHG) and third (THG) harmonic generation which confirms its polarity is generated by the different intermolecular interactions. These measurements also highlight that the THG signal of the new anilinium compound normalized to its SHG counterpart is more pronounced than for LiNbO3.

Grey published a vlog, Myke is back to Mega Office, and they both know what day starts the week.

Product Information

Linear Motor for Higher-speed and Higher-precision(R88L-EC, R88D-KN[]-ECT-L)

These income concepts are what divide the rich and the poor, the wealthy and the middle-class, the knowledgeable and the ignorant.

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.

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.

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.

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.

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.

A combine side-shaking control system includes a sieve for separating crop material from other materials and configured to move in a fore-aft direction. At least one side-shaking assembly includes a mounting device attached to a combine chassis, a lower plate configured to rotate about a lower plate axis and an upper plate configured to (i) have an upper plate rotational motion and rotate responsive to the rotation of the lower plate and (ii) have an upper plate substantially linear motion in a substantially linear direction. A fixed arm is rotatably coupled to the upper plate and attached to the sieve. An actuation device is configured to rotate the lower plate about the lower plate axis. Responsive to the rotation of the upper plate, the sieve is controlled to move diagonal to the fore-aft direction in the substantially linear direction of the upper plate substantially linear motion.

A curvilinear gear system and method for transferring force and speed through a wide range of angles is disclosed. The system can optionally incorporate curvilinear U joints to increase effective range of angles to tailor the system to specific applications. The system includes complimentary gear heads, one of which is a curvilinear gear such as a hemispherical gear. A method of using the gear systems in a transmission apparatus is also disclosed.

An end cap module of a linear guideway for being installed on a sliding block, comprises: a cap having an oil-input hole and a resilient dustproof member installed on the cap. The dustproof member has an oil-guiding passage concavely formed on a surface thereof and communicated with the oil-input hole. When the end cap module is installed on the sliding block, the dustproof member is clipped between the cap and the sliding block. Thus, the instant disclosure provides the end cap module for reducing the design difficulty and producing difficulty of the cap. Moreover, the instant disclosure also provides a linear guideway.

Provided is a technique to secure compositional or microstructural uniformity of a ceramic sintered body while increasing the area of the ceramic sintered boy, thus improving basic performance including non-linearity, maximum withstand energy and aging characteristics. A plurality of small varistor pieces 11 and insulating resin are kneaded and extruded for shaping, whereby a sheet-form varistor layer 13 can be formed where a plurality of small varistor pieces 11 are spaced from one another and are aligned on the same plane, and the adjacent small varistor pieces 11 are bonded via insulating resin.

Provided is a non-linear resistive element which enables to narrow an interval between a plurality of electrodes. A ceramic sheet (2) which constitutes the non-linear resistive element is configured by being supported in a sheet like form by a support member (22) composed of an insulating material. A plurality of ceramic pieces (21) are sectioned and arranged in each of a plurality of unit areas (23) which are apart from each other.

Provided is a non-linear resistive element which improves the degree of freedom of design of its mounting space. A ceramic sheet 10 which constitutes the non-linear resistive element is configured by a plurality of ceramic pieces 11 being consolidated in a plate like form by an insulating resin 12. One or a plurality of ceramic pieces 11 configure each of a plurality of conductive paths which penetrate the ceramic sheet 10 in a thickness direction thereof, and the ceramic pieces 11 which configure both ends of the conductive paths partially projects from the insulating resin 12.

An end effector for use with a surgical stapler comprising a staple cartridge having a tissue contacting surface, a first side surface, and a second side surface opposite the first side surface, an anvil plate having a tissue contacting surface, a first side surface, and a second side surface opposite the first side surface, wherein the first and second side surfaces of each of the staple cartridge and anvil plate have overmolded zones, a buttress releasably disposed on the tissue contacting surfaces of each of the staple cartridge and the anvil plate, and a pair of sutures wherein each suture is bonded to the respective overmolded zones of the first and second side surfaces configured to retain the respective buttress atop the respective tissue contacting surfaces.

The linear position of an object is estimated using multiple magnetic field sensors and a magnet. The multiple magnetic field sensors are held in fixed relation to one another and in moving relation with respect to the magnet. Readings of the first and second magnetic field sensors and the fixed distance between the first and second magnetic field sensors may be used to estimate the linear position. In some embodiments, an estimated frequency of an approximately sinusoidal field versus position characteristic is also used as part of the estimation.

An embodiment of the present invention provides an apparatus, comprising at least one anti-parallel pair VVC network comprised of two parallel VVCs with one biased in the opposite polarity of the other and at least one anti-series VVC network comprised of two VVCs configured in series, one biased in the opposite polarity of the other such that the resulting AC capacitive variations produce a desired capacitance variation.

Techniques for extracting the characteristic response of a non-linear channel are presented. In various implementations of the invention, a channel's characteristic response may be determined by identifying a first input sequence, determining the ones compliment of the first input sequence and then determining the response of the channel to these two input sequences. Subsequently, two input matrices and two response matrices may be generated based upon the two input sequences and their corresponding responses. Given these four matrices, a symmetrical response component may be determined by iteratively solving a system of equations formed from the columns of each matrix. Subsequently, given the symmetric component and these four matrices, an asymmetrical response component may be determined by again iteratively solving the system of equations for the columns of each matrix.