Split (2)

validation · 215k rows

text stringlengths 1 3.78M	meta dict
Q: how to highlight buttons in extjs when clicking on it items: [{ xtype: 'button', text: 'Today', ui:'default-toolbar', margin: '10 10 10 10' },{ xtype: 'button', text: 'Yesterday', ui:'default-toolbar', margin: '0 10 10 10' } },{ xtype: 'button', text:'Last 7 days', ui:'default-toolbar', margin: '0 10 10 10' }, { xtype: 'button', text: 'Last Month', ui:'default-toolbar', margin: '0 10 10 10' }] A: Ext.Button have a property enableToggle which if set to true will apply pressedCls to the button when clicked and remove the pressedCls when pressed again. Sample Code: Ext.application({ name: 'Fiddle', launch: function() { Ext.create('Ext.Container', { renderTo: Ext.getBody(), items: [{ xtype: 'button', text: 'My Button', enableToggle: true }] }); } }); <link rel="stylesheet" href="https://cdn.sencha.com/ext/gpl/4.1.1/resources/css/ext-all.css"> <script type="text/javascript" src="https://cdn.sencha.com/ext/gpl/4.1.1/ext-all-debug.js"></script> For Multiple Button: When we need to toggle pressedCls between mutiple button.We need to use toggleGroup property of button. It will toggle the pressedCls among multiple where same toggleGroup is given. Sample Code: Ext.application({ name: 'Fiddle', launch: function() { Ext.create('Ext.Container', { renderTo: Ext.getBody(), layout:'vbox', items: [{ xtype: 'button', text: 'Today', enableToggle: true, toggleGroup:'myButtonGroup' },{ xtype: 'button', text: 'Yesterday', enableToggle: true, toggleGroup:'myButtonGroup' }, { xtype: 'button', text: 'Last 7 days', enableToggle: true, toggleGroup:'myButtonGroup' }] }); } }); <link rel="stylesheet" href="https://cdn.sencha.com/ext/gpl/4.1.1/resources/css/ext-all.css"> <script type="text/javascript" src="https://cdn.sencha.com/ext/gpl/4.1.1/ext-all-debug.js"></script>	{ "pile_set_name": "StackExchange" }
CU Boulder is a state-of-the-art campus with many unique facilities that push students to excel both academically and in their daily lives. But although the Rec Center has many great activities that help encourage student wellness and relaxation, it is sorely lacking by having four pools and yet no hot tubs or waterslides, an essential part of any pool experience. As a university with such incredible resources, it makes no sense whatsoever that we don't have these essential things. By adding a waterslide and hot tub, students will not only be able to de-stress and get more done, but they'll also be more inclined to come to the Rec and thus adopt healthy exercise habits. It will also make CU more attractive for prospective students. CU Boulder - we're asking you to help make our student life more fun, fulfilling, and healthy. To those reading - sign and share this petition now to help make our dream a reality!	{ "pile_set_name": "OpenWebText2" }
Q: How to structure this SQL query. Combining multiple tables? NOTE: This is not a duplicate of my other question . I have changed the table structure and need new help with a new query. So basically I'm getting notifications of new content on my website. I have 4 tables - articles media updates comments Each table has a set of its own columns (I can include these if anyone wants). In my new notification system I am designing, I determine the newest content, by its timestamp. The timestamp value is an integer formatted to Unix Time. I have just changed my table structure, before, my tables all had columns that were similar. An example, both articles and media had the column id. The SQL code I was using was this - SELECT a.,m.,u.,c. from articles AS a LEFT JOIN media AS m ON (m.mediaTimestamp = a.timestamp) LEFT JOIN updates AS u ON (u.updateTimestamp = a.timestamp) LEFT JOIN comments AS c ON (c.commentTimestamp = a.timestamp) ORDER BY a.timestamp desc LIMIT 30 However when doing this, the code would return multiple iterations of a column in the same row (it would return an id column for articles and media!). Obviously when I tried to get the data via code, it would give me data for different tables (instead of giving me the article id, it would give me the media id). My solution to this was to 'pretty' up my code and name all columns in a table (such as articles) with their table prefix (so id would become articleID). However now the above SQL is producing errors. Could someone 'convert'/restructure this SQL for me. A: try this: SELECT a.,m.,u.,c. from articles AS a LEFT JOIN media AS m ON (m.mediaTimestamp = a.articleTimestamp) LEFT JOIN updates AS u ON (u.updateTimestamp = m.mediaTimestamp) LEFT JOIN comments AS c ON (c.commentTimestamp = u.updateTimestamp) ORDER BY a.articleTimestamp desc LIMIT 30	{ "pile_set_name": "StackExchange" }
A role for HEM2 in cadmium tolerance. A Candida glabrata cadmium-sensitive mutant partially defective in glutathione production and exhibiting a complete absence of phytochelatins was used to clone a gene required for Cd tolerance. Transformation of the Cd-sensitive mutant with a genomic library from the wild-type C. glabrata led to the cloning of a gene that restored Cd tolerance and formation of Cd-glutathione and Cd-phytochelatin complexes. The cloned gene showed high levels of nucleic acid and protein sequence homology to the HEM2 genes, encoding porphobilinogen synthases, from several sources. It was shown that the C, glabrata Cd-sensitive mutant indeed exhibited a significant reduction in porphobilinogen synthase levels. The cloned C. glabrata gene complemented a hem2 mutant of Saccharomyces cerevisiae and restored porphobilinogen synthase activity in the mutant. The Cd sensitive mutant predictably showed decreased levels of sulfite reductase that requires siroheme, a metabolite produced in the heme biosynthetic pathway. The addition of cysteine, but not methionine, increased glutathione levels and Cd tolerance of both the wild-type and the mutant strain. However, addition of hemin chloride and methionine together restored Cd tolerance indicating that heme was required for transsulfuration of homocysteine to cysteine.	{ "pile_set_name": "PubMed Abstracts" }
--- abstract: \| The present works deals with gravitational collapse of cylindrical viscous heat conducting anisotropic fluid following the work of Misner and Sharp. Using Darmois matching conditions, the dynamical equations are derived and the effect of charge and dissipative quantities over the cylindrical collapse are analyzed. Finally, using the Miller-Israel-Steward causal thermodynamic theory, the transport equation for heat flux are derived and its influence on collapsing system has been studied.\ Keywords : Cylindrical collapse, Dissipation, heat flux, Junction conditions, Dynamical equations . --- 0.2cm 0.2cm \ Introduction ============ A challenging but curious issue in gravitational physics as well as in relativistic astrophysics is to know the final fate of a continual gravitational collapse. The stable configuration of a massive star persists as long as the inward pull of gravity is neutralized by the outward pressure of the nuclear fuel at the core of the star. Subsequently, when the star has exhausted its nuclear fuel there is no longer any thermonuclear burning and there will be endless gravitational collapse. However, depending on the mass of the collapsing star, the compact objects such as white dwarfs, neutron stars and black holes are formed. In white dwarf and neutron star gravity is counter balanced by electron and neutron degeneracy pressure respectively while black hole is an example of the end state of collapse.\ The study of gravitational collapse was initiated long back in 1939 by Oppenheimer and Snyder \[1\]. They have studied the collapse of a homogeneous spherical dust cloud in the frame work of general relativity. Then after a quarter century, a more realistic investigation was done by Misner and Sharp\[2\] with perfect fluid in the interior of a collapsing star. In both the studies, the exterior of the collapsing star was chosen as vacuum. Vaidya\[3\] formulated the non-vacuum exterior of a star having radiating fluid in the interior. An inhomogeneous spherically symmetric dust cloud was analytically studied by Joshi and Singh \[4\] and they have shown that the final fate of the collapsing star depend crucially on the initial density profile and the radius of the star. Debnath etal\[5\] investigated collapse dynamics of the non-adiabatic fluid, considering quasi-spherical Szekeres space-time in the interior and plane symmetric Vaidya solution in the exterior region.\ Although most of the works on collapse dynamics are related to spherical objects, still there are interesting information about self-gravitating fluids for collapsing object with different symmetries. The natural choice for non-spherical symmetry is axis symmetric objects. The vacuum solution for Einstein field equations in cylindrically symmetric space-time was obtained first by Levi-Civita \[6\] but still it is a challenging issue of interpreting two independent parameters in the solution. Herrera etal \[7\] studied cylindrical collapse of non-dissipative fluid with exterior Einstein -Rosen space-time and showed wrongly a non-vanishing radial pressure on the boundary surface and subsequently in collaboration with M.A.H. Maccallum \[8\] they corrected the result. Then Herrera and collaborators investigated cylindrical collapse of matter with\[9\] or without shear \[10\].\ Further, the junction conditions due to Darmois \[11\] has a very active role in dealing collapsing problems. Sharif etal \[12-14\] showed the effect of positive cosmological constant on the collapsing process by using junction conditions between static exterior and non-static interior with a cosmological constant. Also Herrera etal \[15\], using junction conditions were able to prove that any conformally flat cylindrically symmetric static source cannot be matched to the Levi-Civita space-time. Then Kurita and Nakao \[16\] formulated naked singularity along the axis of symmetry, considering cylindrical collapse with null dust.\ Moreover from realistic point of view it is desirable to consider dissipative matter in the context of collapse dynamics \[17-19\]. Considering collapse of a radiating star with dissipation in the form of radial heat flow and shear viscosity, Chan\[20\] has showed that shear viscosity plays a significant role in the collapsing process. Collapse dynamics with dissipation of energy as heat flow and radiation has been studied by Herrera and Santos\[18\]. Subsequently, by Considering of causal transport equations related to different dissipative components (heat flow, radiation, shear and bulk viscosity) Herrera etal \[15,21,22\] investigated the collapse dynamics. The same collapsing process with plane symmetric geometry or others has been examined by Sharif etal \[23,24\] .\ On the other-hand, in the context of gravitational waves, the sources must have non spherical symmetry. Further, cylindrical collapse of non-dissipative fluid with exterior containing gravitational waves shows non-vanishing pressure on the boundary surface by using Darmois matching conditions. Recently, it has been verified \[25\] in studying cylindrical collapse of anisotropic dissipative fluid with formation of gravitational waves outside the collapsing matter.\ In the present work, following Misner and Sharp collapse dynamics of viscous, heat conducting charged anisotropic fluid in cylindrically symmetric background will be studied. The paper is organized as follows. Section 2 deals with basic equations related to interior and exterior space-time. The junction conditions are evaluated and discussed in Section 3. The dynamical equations are derived and studied in Section 4. Finally, the process of mass, heat and momentum transfer through transport equation is discussed in section 5.\ Interior and exterior space-time: Basic equations. ================================================== Mathematically, the whole four dimensional space-time manifold having a cylindrical collapsing process can be written as $M=M^+U \Sigma U M^-$ with $M^{-}\bigcap M^{+}=\phi$. Here, $\Sigma$, the collapsing cylindrical surface is a time-like three surface and is the boundary of the two four dimensional sub-manifolds $M^-$ (interior) and $M^+$ (exterior).\ In $M^-$ choosing co-moving coordinates the line element can be written as \[25\] $$d{s_-^2}=-{A^2}d{t^2} +{B^2 }d{r^2} +{C^2}d{\phi^2} +{D^2}d{z^2}$$\ where the metric coefficients are functions of t and r i.e. A=A(t,r) and so on. Also due to cylindrical symmetry, the coordinates are restricted as:\ $-\infty\leq t\leq +\infty,~~~r\geq 0,~~~-\infty<z<+\infty,~~~0\leq \phi \leq 2\pi$\ For compact notation we write $\lbrace x^{-\mu} \rbrace \equiv[t,r,\phi,z]~~~,~~~ (\mu=0,1,2,3) $.\ The anisotropic fluid having dissipation in the form of shear viscosity and heat flow has the energy- momentum tensor of the form \[7,9\] $$T_{\mu\nu}=(\rho+p_t){v_\mu}{v_\nu}+{p_t}g_{\mu\nu}+({p_r}-{p_t}){\chi_\mu}{\chi_\nu}-2\eta\sigma_{\mu\nu}+2q_{(\mu}v_{\nu)}$$\ Here $\rho,~p_r,~p_t~ ~~\eta~~~ and~~q_{\mu}$ stands for energy density ,the radial pressure, the tangential pressure, coefficient of shear viscosity and radial heat flux vector respectively. Also $v_\mu$ and $\chi_\mu$ are unit time-like and space-like vectors satisfying the following relations $$v_\mu v^\mu =-\chi_\mu\chi^\mu=-1~~~,~~~~\chi^\mu v_\mu=0~~~,~~~q_{\mu}v^{\mu}=0~~~~$$\ Moreover, the shear tensor $\sigma_{\mu\nu}$ has the expression $$\sigma_{\mu\nu}= v_{(\mu;\nu)}+a_{(\mu}v_{\nu)}-\frac{1}{3}\Theta(g_{\mu\nu}+v_\mu v_\nu)$$\ where $a_\mu=v_{\mu;\nu}v^\nu $ is the acceleration vector and $\Theta=v^\mu;_\mu$ is the expansion scalar.\ For the above metric one may choose the unit time-like vector, space-like vector and heat flux vector in a simple form as $$v^\mu=A^{-1}\delta_0^\mu~~~,~~~~~~~~~~~~~~\chi^\mu=B^{-1}\delta_1^\mu~~~,~~~~~q^{\mu}=q\delta^{\mu}_{1}~~~~~$$\ The shear tensor has only non-zero diagonal components as $$\sigma_{11}=\frac{B^2}{3A}[\Sigma_1-\Sigma_3]~~,~~~~~~\sigma_{22}=\frac{C^2}{3A}[\Sigma_2-\Sigma_1]~~~and~~~\sigma_{33}=\frac{D^2}{3A}[\Sigma_3-\Sigma_2]~~~with~~~~~\sigma^2=\frac{1}{6A^2}[\Sigma_1^2+\Sigma_2^2+\Sigma_3^2]$$\ where $ \Sigma_1=\frac{\dot{B}}{B}-\frac{\dot{C}}{C}~~,~~~\Sigma_2=\frac{\dot{C}}{C}-\frac{\dot{D}}{D}~~,~~~\Sigma_3=\frac{\dot{D}}{D}-\frac{\dot{B}}{B} $\ Also the acceleration vector and the expansion scalar have the explicit expressions $$a_1=\frac{A^\prime}{A}~~,\Theta=\frac{1}{A}(\frac{\dot{B}}{B}+\frac{\dot{C}}{C}+\frac{\dot{D}}{D})$$\ In the above, by notation we have used $\cdot$ $\equiv\frac{\partial}{\partial t}$ and $^\prime$ $\equiv\frac{\partial}{\partial r}.$\ If in addition we assume the above fluid distribution to be charged then the energy-momentum tensor for the electromagnetic field has the form $$E_{\alpha\beta}=\frac{1}{4\pi}(F^{\alpha}_{\mu}F_{\nu\alpha}-\frac{1}{4}F^{\alpha\beta}F_{\alpha\beta}g_{\mu\nu})~~~~~$$ where the Maxwell field tensor $F_{\alpha\beta}$ is related to the four potential $\phi_{\alpha}$ as $$F_{\alpha\beta}=\phi_{\beta , \alpha}-\phi_{\alpha , \beta}$$ and the evolution of the field tensor corresponds to Maxwell equations $$F^{\alpha\beta}_{;\beta}=4\pi J^{\alpha}$$ where $J^{\alpha}$ the four current vector.\ As the charge per unit length of the cylinder is at rest with respect to comoving co-ordinates so the magnetic field will be zero in this local coordinate system \[26,27\]. Hence the four potential and the four current takes the simple form $$\phi_{\alpha}=\phi\delta^{0}_{\alpha} ,~~~~J^{\alpha}=\epsilon v^{\alpha}$$ where $\phi=\phi(t,r)$ is the scalar potential and $\epsilon=\epsilon(t,r)$ is the charge density.\ From the law of conservation of charge : $J^{\alpha}_{;\alpha}=0$, one obtains the total charge distribution interior to radius $r$ and per unit length of the cylinder as $$s(r)=2\pi\int^{r}_{0}\epsilon BCD dr$$ Now the explicit form of the Maxwell’s equations (10) for the interior space-time $M^{-}$ are given by $$\phi^{''}-(\frac{A^{'}}{A}+\frac{B^{'}}{B}-\frac{C^{'}}{C}-\frac{D^{'}}{D})\phi^{'}=4\pi\epsilon AB^{2}$$ and $$\dot{\phi}^{'}-(\frac{\dot{A}}{A}+\frac{\dot{B}}{B}-\frac{\dot{C}}{C}-\frac{\dot{D}}{D})\phi^{'}=0$$ A first integral of equation (13) gives $$\phi^{'}=\frac{2sAB}{CD}$$ which satisfies identically the other Maxwell’s equation(14). Hence one obtains the electric field intensity as $E(t,r)=\frac{s(r)}{2\pi C}$ Further, in the interior space-time $M^{-}$ the Einstein field equations $G_{\alpha\beta}=8\pi(T_{\alpha\beta}+E_{\alpha\beta})$ have the explicit form $$\frac{A^{2}}{B^{2}}(-\frac{C^{''}}{C}-\frac{D^{''}}{D}+\frac{B^{'}}{B}(\frac{C^{'}}{C}+\frac{D^{'}}{D})-\frac{C^{'}D^{'}}{CD})+(\frac{\dot{B}\dot{C}}{BC}+\frac{\dot{B}\dot{D}}{BD}+\frac{\dot{C}\dot{D} }{CD})=8\pi(\rho A^{2}-2\eta\sigma_{00})+4\frac{s^{2}A^{2}}{C^{2}D^{2}}$$ \ $$-\frac{B^{2}}{A^{2}}(\frac{\ddot{C}}{C}+\frac{\ddot{D}}{D}+\frac{\dot{C}\dot{D}}{CD}-\frac{\dot{A}\dot{C}}{AC}-\frac{\dot{A}\dot{D}}{AD})+(\frac{C^{'}D^{'}}{CD}+\frac{A^{'}C^{'}}{AC}+\frac{A^{'}D^{'}}{AD})=8\pi(p_{r}B^{2}-2\eta\sigma_{11})-4\frac{s^{2}B^{2}}{C^{2}D^{2}}$$ $$-\frac{C^2}{A^2}[\frac{\ddot{B}}{B}+\frac{\ddot{D}}{D}-\frac{\dot{A}}{A}(\frac{\dot{B}}{B}+\frac{\dot{D}}{D})+\frac{\dot{B}\dot{D}}{BD}]+\frac{C^2}{B^{2}}[\frac{A^{''}}{A}+\frac{D^{''}}{D}-\frac{A^{'}}{A}(\frac{B^{'}}{B}-\frac{D^{'}}{D})-\frac{D^{'}}{D}\frac{B^{'}}{B}]=8\pi(p_{t}C^2-2\eta\sigma_{22})+4\frac{s^{2}}{D^{2}}$$ $$-\frac{D^{2}}{A^{2}}[\frac{\ddot{B}}{B}+\frac{\ddot{C}}{C}-\frac{\dot{A}}{A}(\frac{\dot{B}}{B}+\frac{\dot{C}}{C})+\frac{\dot{B}\dot{C}}{BC}]+\frac{D^{2}}{B^{2}}[\frac{A^{''}}{A}+\frac{C^{''}}{C}-\frac{A^{'}}{A}(\frac{B^{'}}{B}-\frac{C^{'}}{C})-\frac{C^{'}}{C}\frac{B^{'}}{B}]=8\pi(p_{t}D^{2}-2\eta\sigma_{33})+4\frac{s^{2}}{C^{2}}$$ and $$\frac{1}{AB}(\frac{\dot{C^{'}}}{C}+\frac{\dot{D^{'}}}{D}-\frac{C^{'}}{C}\frac{\dot{B}}{B}-\frac{\dot{B}}{B}\frac{D^{'}}{D}-\frac{A^{'}}{A}\frac{\dot{C}}{C}-\frac{A^{'}}{A}\frac{\dot{D}}{D})=8\pi q$$ The gravitational energy per specific length in cylindrically symmetric space-time is defined as \[28-30\] $$E=\frac{(1-l^{-2}\nabla^{a}r \nabla_{a}r)}{8}$$ In principle, $E$ is the charge associated with a general current which combines the energy-momentum of the matter and gravitational waves. It is usually referred in the literature as $C$-energy for the cylindrical symmetric space-time. For cylindrically symmetric model with killing vectors the circumference radius $\rho$ and specific length $l$ are defined as \[28-30\]\ $\rho^{2}=\xi_{(1)a}\xi_{(1)}^{a}$ , $l^{2}=\xi_{(2)a}\xi_{(2)}^{a}$, so that $r=\rho l$ is termed as areal radius.\ For the present model with the contribution of electromagnetic field in the interior region the $C-$energy takes the form $$E'=\frac{l}{8}+\frac{1}{8D}[\frac{1}{A^{2}}(C\dot{D}+\dot{C}D)^{2}-\frac{1}{B^{2}}(CD^{'}+C^{'}D)^{2}]+\frac{s^{2}}{2C}$$ \ It should be noted that the above energy is also very similar to Tabu’s mass function in the plane symmetric space-time\[31\]\ The exterior space-time manifold $(M^{+})$ of the cylindrical surface $\Sigma$ is described by the metric in the retarded time co-ordinate as \[32,33\] $$ds_{+}^{2}=-(\frac{-2M(v)}{R}+\frac{Q^{2}(v)}{R^{2}})dv^{2}-2dRdv+R^{2}(d\phi^{2}+\lambda^{2}dz^{2})$$ where $v$ is the usual retarded time, $M(v)$ is the total mass inside $\Sigma$, $Q(v)$ is the total charge bounded by $\Sigma$ and $\lambda$ is an arbitrary constant. Further, from the point of view of the interior manifold $(M^{-})$ the bounding three surface $\Sigma$ (comoving surface) is described as $$f_{-}(t,r)=r-r_{\Sigma}=0$$ and hence the interior metric on $\Sigma$ takes the form $$ds_-^2\stackrel{\Sigma}{=}-d\tau^2 +C^2dz^2+D^2d\phi^2$$ where $$d\tau\stackrel{\Sigma}{=}Adt,$$\ defines the time co-ordinate on $\Sigma$ and $\stackrel{\Sigma}{=}$ by notation implies the equality of both sides on the surface $\Sigma$.\ Similarly, from the perspective of the exterior manifold the boundary three surface $\Sigma$ is characterized by $$f_{+}(v,R)\equiv R-R_{\Sigma}(v)=0$$ so that the exterior metric on $\Sigma$ takes the form $$ds_{+}^{2}\stackrel{\Sigma}{=}-(\frac{-2M(v)}{R}+\frac{Q^{2}(v)}{R^{2}}+\frac{2dR_{\Sigma}(v)}{dv})dv^{2}+R^{2}(d\phi^{2}+\lambda^{2}dz^{2})$$ Here by notation we write $[x^{+\mu}]=[v,R,\phi, z]$ Junction conditions =================== In order to have a smooth matching of the interior and exterior manifolds over the bounding three surface (not a surface layer), the following conditions due to Darmois \[11\] are to be satisfied:\ (i)The continuity of the first fundamental form i.e. $$(ds^2)_{\Sigma}=(ds^2_{-})_{\Sigma}=(ds^{2}_{+})_{\Sigma}$$ (ii)The continuity of the second fundamental form i.e $K_{ij}d\xi^{i}d\xi^{j}$. This implies the continuity of the extrinsic curvature $K_{ij}$ over the hypersurface \[11\] i.e. $$[K_{ij}]\equiv K_{ij}^+ -K_{ij}^-=0$$ where $K_{ij}^\pm$ is given by $$K_{ij}^\pm=-n_\sigma^\pm[\frac{\partial^2x_\pm ^\sigma}{\partial\xi^i \partial\xi^j}+\Gamma_{\mu\nu}^\sigma \frac{\partial x_\pm^\mu}{\partial\xi^i}\frac{\partial x_\pm^\nu}{\partial\xi^j}],~~~(\sigma,~\mu,~\nu~=0,1,2,3)$$ In the above expression for extrinsic curvature, $n_{\sigma}^{\pm}$ are the components of the outward unit normal to the hyper-surface with respect to the manifolds $M^{\pm}$ (i.e. in the co-ordinates $x^{\pm \mu}$) and have explicit expressions\ $n_\sigma^- \stackrel{\Sigma}{=}(0,B,0,0)~~and~~~~n_\sigma^+ \stackrel{\Sigma}{=}\mu(\frac{-dR}{dv},1,0,0)$ with $\mu=[\frac{-2M(v)}{R}+\frac{Q^{2}(v)}{R^{2}}+2\frac{dR}{dv}]^{\frac{-1}{2}}$\ Also in the above the christoffel symbols are evaluated for the metric in $M^{-}$ or $M^{+}$ accordingly and we choose $\xi^{0}=\tau$, $\xi^{2}=z$, $\xi^{3}=\phi$ as the intrinsic co-ordinates on $\Sigma$ for convenience.\ The continuity of the 1st fundamental form gives $$C(t,r_{\Sigma})\stackrel{\Sigma}{=}R_{\Sigma}(v)~~~,~~~D(t,r_{\Sigma})\stackrel{\Sigma}{=}\lambda R_{\Sigma}(v)$$ $$\frac{dt}{d\tau}=1/A~~~~\frac{dv}{d\tau}=\mu$$ Now the non vanishing components of extrinsic curvature $K^{\pm}_{ij}$ are\ $$K_{00}^-{=}-(\frac{A^\prime}{AB})_{\Sigma}$$ $$K_{00}^+{=}[(\frac{d^{2}v}{d\tau^{2}})(\frac{dv}{d\tau})^{-1}-(\frac{dv}{d\tau})(\frac{M}{R^{2}}-\frac{Q^{2}}{R^{3}})]_{\Sigma}$$\ $$K_{22}^-{=}(\frac{C{C}^\prime}{B})_{\Sigma}$$ $$K_{33}^-{=}(\frac{D{D}^\prime}{B})_{\Sigma}$$ $$K_{22}^+{=}[R(\frac{dR}{d\tau})-\frac{(dv)}{d\tau}(2M-\frac{Q^{2}}{R})]_{\Sigma}=\lambda ^{-2}K^{+}_{33}$$ \ and\ Hence continuity of the extrinsic curvature together with equations (32) and (33) gives the following relations over $\Sigma$ \[33,34\] $$M(v)\stackrel{\Sigma}{=}\frac{R}{2}[(\frac{\dot{R}}{A})^{2}-(\frac{R^{'}}{B})^{2}]+\frac{Q^{2}}{2R}$$\ $$E\stackrel{\Sigma}{=}\frac{l}{8}+\lambda M$$\ and $$q\stackrel{\Sigma}{=}p_{r}-\frac{2\eta \sigma_{11}}{B^{2}}-\frac{s^{2}}{2\pi c^{4}}(\frac{1}{\lambda^{2}}-1/4 )$$\ Thus equations (39) gives the total mass inside the boundary surface $\Sigma$ while equation (40) shows the linear relationship between the $C$ energy for the cylindrically symmetric space-time with the bounding mass over $\Sigma$. Further, equation (41) shows a linear relationship among the fluid parameters $(p_{r}, \eta, q)$ on the bounding surface $\Sigma$. Hence radial pressure is in general non zero on the bounding surface due to dissipative nature of the fluid and the charge on the bounding surface. But when dissipative components of the fluid are switch off then the above result (uncharged) agrees with the results of Herrera etal \[8\]. Also it should be noted that the radial pressure on the boundary does not depend on the charge bounded by $\Sigma$, it depends only on the charge on the surface $\Sigma$.\ Analysis of Dynamical equations: ================================ From the conservation of energy-momentum i.e. $(T^{\alpha\beta}+E^{\alpha\beta})_{;\beta}=0$ we can have two zero scalars namely $(T^{\alpha\beta}+E^{\alpha\beta});_{\beta}v_{\alpha}~~~and~~~(T^{\alpha\beta}+E^{\alpha\beta});_{\beta}\chi_{\alpha}$\ Using equations (2) and(8) the explicit expressions for these two scalars are $$\frac{\dot{\rho}}{A}+\frac{\dot{B}}{A}(\frac{\rho}{B}+\frac{p_{r}}{B}-2\eta\sigma^{11})+\frac{\dot{C}}{A}(\frac{p_{\bot}}{C}+\frac{\rho}{C}-2\eta\sigma^{22})+\frac{\dot{D}}{A}(\frac{\rho}{D}+\frac{p_{\bot}}{D}-2\eta\sigma^{33})+\frac{q^{'}}{B}+\frac{q}{B}(2\frac{A^{'}}{A}+\frac{C^{'}}{C}+\frac{D^{'}}{D})=0$$ and $$\begin{aligned} (\frac{p_{r}}{B^{2}}-2\eta\sigma^{11})^{'}+\frac{\dot{q}}{AB}+\frac{q}{AB}(\frac{\dot{C}}{C}+\frac{\dot{D}}{D})+\frac{A^{'}}{A}(\frac{\rho}{B^{2}}+\frac{p_{r}}{B^{2}}-2\eta\sigma^{11})+\frac{B^{'}}{B}(\frac{p_{r}}{B^{2}}-2\eta\sigma^{11})+\frac{C^{'}}{C}(\frac{p_{r}}{B^{2}} \nonumber \\ -\frac{p_{\bot}}{B^{2}}-2\eta\sigma^{11}-2\eta\sigma^{22}\frac{C^{2}}{B^{2}})+\frac{D^{'}}{D}(\frac{p_{r}}{B^{2}}-\frac{p_{\bot}}{B^{2}}-2\eta\sigma^{11}+2\eta\sigma^{33}\frac{D^{2}}{B^{2}})-\frac{ss^{'}}{\pi C^{2}D^{2}B}=0 \end{aligned}$$\ Now following the formulation of Misner and Sharp \[2\], we introduce the proper time derivative and proper radial derivative as $$D_{T}=\frac{1}{A}\frac{\delta}{\delta t}~~~~~~and~~~~ D_{R}=\frac{1}{R^{'}}\frac{\delta}{\delta r}$$ so that the fluid velocity in the collapsing situation, can be defined as \[35\] $$U=D_{T}(R)=D_{T}(C) <0 ~~~and~~~ V=D_{T}(Rr)=D_{T}(D) <0$$ Using equations (17)-(22) and(45), we can obtain the acceleration of a collapsing matter inside $\Sigma$ as $$D_{T}(U)=-4\pi R(p_{r}-\frac{4\eta \sigma}{\sqrt{3}})+\tilde{E}\frac{A^{'}}{AB}+\frac{s^{2}}{R^{3}}(2+\frac{1}{2\lambda})-\frac{1}{R^{2}\lambda}(E^{'}-\frac{l}{8})$$ Now combining (43) and (46) we obtain $$\begin{aligned} (\rho+p_{r}-\frac{4\eta\sigma}{\sqrt{3}})D_{T}(U)&=&(\rho+p_{r}-\frac{4\eta\sigma}{\sqrt{3}})[\frac{1}{R^{2}\lambda}(E^{'}-\frac{l}{8})+4\pi R(p_{r}-\frac{4\eta \sigma}{\sqrt{3}})-\frac{s^{2}}{R^{3}}(2+\frac{1}{2\lambda})]-\tilde{E}^{2}[D_{R}(p_{r} \nonumber \\ &-&\frac{4\eta\sigma}{\sqrt{3}})+\frac{2}{R}(p_{r}-p_{\bot}-2\sqrt{3}\eta\sigma)-\frac{s}{\pi R^{4}}D_{R}(s)]-\frac{2q\tilde{E}}{A}(\frac{\dot{B}}{B}+\frac{\dot{C}}{C})-\frac{\dot{q}\tilde{E}}{A}\end{aligned}$$\ Using (22) and the junction condition $D\stackrel{\Sigma}{=}\lambda C$, we write \[24\] $$\tilde{E} =\frac{C^{'}}{B}=[U^{2}+\frac{s^{2}}{\lambda c^{2}}-\frac{2}{\lambda c}(E^{'}-\frac{l}{8})]^{\frac{1}{2}}$$ Hence using the field equations for the interior manifold we obtain the time rate of change of C-energy as $$D_{T}E^{'}=-4\pi R^{2}\lambda[(p_{r}-\frac{4\eta\sigma}{\sqrt{3}})U +q\tilde{E}]+\frac{s^{2}\dot{C}}{R^{2}A}(2\lambda-\frac{1}{2})$$ Also the above equation can be interpreted as the variation of the total energy inside the collapsing cylinder. Note that due to negativity, of the fluid velocity $v$ the first term on the r.h.s will contribute to the energy of the system provided the radial pressure is restricted as $p_{r}>\frac{4\eta\sigma}{\sqrt{3}}$. Due to negativity, the second term indicates an outflow of energy in the form of radiation during the collapsing process. The third term is coulomb-like force term and it will increase the energy of the system provided $\lambda~>~\frac{1}{4}$.\ Further, using the Einstein field equations (16), (20) and the expression for C- energy in equation (22), the radial derivative of the C energy takes the form $$D_{R}E'=4\pi\rho R^{2}\lambda+\frac{s^{2}}{R^{2}}(2\lambda-\frac{1}{2})+\frac{s}{R}D_{R}(s)+\frac{4\pi q BR^{2}\lambda}{R'}D_{T}(C)+\frac{1}{8\rho R'}$$ This radial derivative can be interpreted as the energy variation between the adjacent cylindrical surfaces within the matter distribution. The first term on the r.h.s. is the usual energy density of the fluid element while the second term and third terms are the conditions due to the electromagnetic field. The fourth term represents contribution due to the dissipative heat flux and the last term will increase or decrease the energy of the system during the collapse of the cylinder provided $R^{'}> ~or~<~0$\ Finally, the collapse dynamics is completely characterized by the equation of motion in equation (47). Normally, for collapsing situation $D_{T}U$ should be negative, i.e, indicating an inward radial flow of the system. Consequently, terms on the r.h.s (of eq.(47)) contributing negatively favours the collapse and positive terms oppose the collapsing process. In an extreme situation the system will be in hydrostatic equilibrium if terms of both signs balance each other. Further, from dimensional analysis the factor $(\rho+p_{r}-\frac{4\eta\sigma}{\sqrt{3}})$ can be considered as an inertial mass density, independent of heat flux contribution. The first term on the r.h.s. of eq. (47) can be identified as the gravitational force, indicating the effects of specific length and electric charge in the gravitational contribution. The second term has three contributing components- the pressure gradient (which is negative), local anisotropy of the fluid and electromagnetic field term. The remaining terms represent the heat flux contribution and due to negativity they seem to leave the system along the radial outward streamlines.\ Causal Thermodynamics: The Transport equation ============================================= In causal thermodynamics due to Miller-Israel-Stewart, the transport equation for heat flow is given by \[21\] $$\tau h^{ab}V^{c}q_{b;c}+q^{a}=-\kappa h^{ab}(T_{,b}+a_{b}T)-\frac{1}{2}\kappa T^{2}(\frac{\tau V^{b}}{\kappa T^{2}})_{;b}q^{a}$$ where $h^{ab}=g^{ab}+V^{a}V^{b}$ is the projection tensor of the $3-$surface orthogonal to the unit time-like vector $V^{a}$, $\kappa$ represents the thermal conductivity, $T$ is the temperature, $\tau$ denotes the relaxation time and $a_{b}T$ is the inertial term due to Tolman. Now due to cylindrical symmetry, the above transport equation (51)simplifies to $$\tau\dot{q}=-\frac{1}{2A}\kappa \frac{qT^{2}}{\tau}(\frac{\tau}{\kappa T^{2}})-q[\frac{3U}{2R}+G+\frac{1}{\tau}]-\frac{\kappa \tilde{E}D_{R}T}{\tau}-\frac{\kappa TD_{T}U}{\tau\tilde{E}}-\frac{\kappa T}{\tau\tilde{E}R^{2}}[\frac{1}{\lambda}(E^{'}-\frac{l}{8})+4\pi R^{3}(p_{r}-\frac{4\eta\sigma}{\sqrt{3}})-\frac{S^{2}}{R}(2+\frac{1}{2\lambda})]$$ with $G=\frac{1}{A}(\frac{\dot{B}}{B}-\frac{\dot{C}}{C})$\ Now considering proper derivatives in equation(44) of the above equation and using the field velocity (in eq.(45)), and equation of motion (i.e. eq. (47)) one obtains the effects of heat flux or dissipation in the collapsing process as\ $$\begin{aligned} (1-\alpha)(\rho+ p_{r}-\frac{4\eta\sigma}{\sqrt{3}})D_{T}U =(1-\alpha)F_{grav}+F_{hyd}+ \alpha \tilde{E}^{2}[D_{R}p_{r}+2(p_{r}-p_{\bot}-2\sqrt{3}\eta\sigma)\frac{1}{R} \nonumber \\ -\frac{SD_{R}(S)}{\pi R^{4}\lambda^{2}}]-\tilde{E}[D_{T}q+2qG+\frac{4qU}{R}]+\alpha \tilde{E}[D_{T}q+\frac{4qU}{R}+2qG]\end{aligned}$$\ with $$\alpha=\frac{\kappa T}{\tau}(\rho+p_{r}-\frac{4\eta\sigma}{\sqrt{3}})^{-1}$$ $$F_{grav}=-(\rho+p_{r}-\frac{4\eta\sigma}{\sqrt{3}})[(E^{'}-\frac{l}{8})\frac{1}{\lambda}+4\pi p_{r}R^{3}-(2+\frac{1}{2\lambda})\frac{S^{2}}{R}](\frac{1}{R^{2}})$$ $$F_{hyd}=\tilde{E}^{2}[D_{R}(p_{r}-\frac{4\eta\sigma}{\sqrt{3}})+\frac{2}{R}(p_{r}-p_{\bot}-2\sqrt{3}\eta\sigma)-\frac{S}{\pi R^{4}}D_{R}(S)]$$ The l.h.s. of equation (53) can be interpreted as Newtonian force $F$ with $(\rho+p_{r})(1-\alpha)$ as the inertial mass density. So as $\alpha\rightarrow 1$, $F\rightarrow 0$ i.e. there is no inertial force and collapse will be inevitable due to gravitational attraction. Further, the inertial mass density decreases as long as $0~<~\alpha~<1$ and it increases for $\alpha~>~1$. Moreover, due to equivalence principle the gravitational mass also decrease or increase according as $\alpha~<~or~>~1$ and gives a clear distinction between the expanding and collapsing process due to dynamics of dissipative system. Note that although the gravitational force is affected by the same factor $(1-\alpha)$ but the hydrodynamical force is free from it. Further, combination of all these terms on the r.h.s of equation (53) results the l.h.s i.e. $(1-\alpha)(\rho+p_{r}-\frac{4\pi\sigma}{\sqrt{3}})D_{T}U~<0$, there will be gravitational collapse while there will be expansion if the l.h.s to be positive. Interestingly, if $\alpha$ continuously decreases from a value larger than unity to one less than unity, then there will be a phase transition (collapse to expansion) and bounce will occur. As a result, there will be loss of energy of the system and collapsing cylinder with non-adiabatic source causes emission of gravitational radiation. Therefore, there will be radiation outside the collapsing cylinder and hence the choice of the exterior metric (in eq.(23)) is justified.\ J.R. Oppenheimer and H. Snyder , [Phys.Rev.]{} [56,]{} (1939)455 ; C.W. Misner and D. Sharp, [Phys.Rev.]{} [136]{} (1964) B571; P.C.Vaidya, [Proc.Indian Acad.Sci.A]{} [33]{} (1951) 264; P.S. Joshi and T.P. Singh, [Phys.Rev.D]{} [51]{} (1995) 6778; U. Debnath, S. Nath and S. Chakraborty [Gen. Relt. Grav.]{} [37]{} (2005) 215. T. Levi-Civita, [Rend. Accad. Lincei]{} [28]{} (1919) 101. L. Herrara and N.O. Santos, [Class. Quant. Grav]{} [22]{} (2005) 2407. L. Herrera, N.O. Santos and M.A.H. Maccallum, [Class. Quant. Grav]{} [24]{} (2007) 1033. A. Di Prisco, L. Herrera, M. Maccallum and N.O. Santos, [Phys. Rev. D.]{} [80]{} (2009) 064031. L. Herrera, A. Di Prisco, J. Ospino, [Gen.Relt. Grav.]{} [44]{} (2012) 2645. G. Darmois, Memorial des Sciences Mathematiques (Gautheir-Viuars, Paris,) Fasc. 25. M. Sharif and Z. Ahmed [Mod.Phys.Lett.A]{} [22]{} (2007) 1493 M. Sharif and Z. Ahmed [Mod.Phys.Lett.A]{} [22]{} (2007) 2947. M. Sharif and Z. Ahmed [Gen.Relt. Grav.]{} [39]{} (2007) 1331. L. Herrera , G. Le Denmat, G. Marcilhacy, N.O. Santos [Int. J. Mod. Phys.D]{} [14]{} (2005) 657. Y. Kurita and K. Nakao, [Phys.Rev. D]{} [73]{} (2006) 064022. L. Herrera, A. DiPrisco, J.Martin, J.Ospino, N.O. Santos and O.Troconis [Phys.Rev.D]{} [69]{} (2004) 084026. L. Herrera, N.O. Santos, [Phys. Rev. D.]{} [70]{} (2004) 084004. A. Mitra, [Phys.Rev.D.]{} [74]{} (2006) 024010. R. Chan, [Astron.Astrophys.]{} [368]{} (2001) 325. L. Herrera, [Int. J. Mod Phys.D]{} [15]{} (2006) 2197. L. Herrera, A. Di Prisco, E.Fuenmayor and O. Troconics, [Int. J. Mod. Phys. D]{} [18]{} (2009) 129. M. Sharif and Z. Rehmat, [Gen.Relt.Grav.]{} [42]{} (2010) 1795. M. Sharif and G. Abbas, [Astrophys.Space Sci]{} [335]{} (2011) 515. S. Chakraborty and S. Chakraborty [Gen.Relt. Grav.]{} [46]{}, (2014) 1784; [Annals of Physics]{} [364]{}, (2016) 110 M. Sharif and G. Abbas, [J.Phys.Soc.Jpn]{} [80]{} (2011) 104002. A.Di Prisco etal, [Phys.Rev.D]{} [76]{} (2007) 064017. K.S Throne, [Phys.Rev.]{} [138]{} (1965) B251. T. Chiba, [Prog.Theo.Phys.]{} [95]{} (1996) 321. S.A. Hayward, [Class.Quant.Grav.]{} [17]{} (2000) 1749. M. Sharif and Z. Rehamat [Gen.Relt.Grav]{} [42]{} (2010) 1795. H. Chao-Guang [Acta Phys.Sin.]{} [4]{} (1995) 617. M. Sharif and M. Azam [Jour.of cosmology and Astro.Physics]{} [02]{} (2012) 043 S.Guha and R.Banerji [Int J Theorn Phys.]{} [53]{} (2014)2332 M. Sharif and S. Fatima [Gen.Relt.Grav.]{} [43]{} (2011) 127	{ "pile_set_name": "ArXiv" }
Topological catastrophe and isostructural phase transition in calcium. We predict a quantum phase transition in fcc Ca under hydrostatic pressure. Using density functional theory, we find, at pressures below 80 kbar, the topology of the electron charge density is characterized by nearest neighbor atoms connected through bifurcated bond paths and deep minima in the octahedral holes. At pressures above 80 kbar, the atoms bond through non-nuclear maxima that form in the octahedral holes. This topological change in the charge density softens the C' elastic modulus of fcc Ca, while C44 remains unchanged. We propose an order parameter based on applying Morse theory to the charge density, and we show that near the critical point it follows the expected mean-field scaling law with reduced pressure.	{ "pile_set_name": "PubMed Abstracts" }
// // CenterCell.h // BanTang // // Created by liaoyp on 15/4/22. // Copyright (c) 2015年 JiuZhouYunDong. All rights reserved. // #import "BaseTableViewCell.h" #import "HorizontalScrollCellDeleagte.h" @interface HorizontalScrollCell : BaseTableViewCell <UICollectionViewDataSource, UICollectionViewDelegate> { } @property(nonatomic ,strong)UICollectionView collectionView; @property (weak, nonatomic) id <HorizontalScrollCellDeleagte> delegate; ///* // Control the Collection View of all Content Cells in each horizontally scrolled row // / //@property (strong, nonatomic) UICollectionView horizontalScrollContentsView; // ///** // Set the content cell Class Name // / //@property (weak, nonatomic) NSString contentCellClass; // ///** // Tell the size of Content Cell frame. // Read-only property. // / //@property (nonatomic, readonly) CGSize contentCellSize; // ///* // Store the table-view index path where each ASOXScrollTableViewCell object is attached to. // / @property (strong, nonatomic) NSIndexPath tableViewIndexPath; - (void)reloadData; @end	{ "pile_set_name": "Github" }
Upregulation of VEGF expression is associated with accumulation of HIF-1α in the skin of naïve scleroderma patients. Systemic sclerosis is a disease hallmarked by microangiopathy; the enlargement and leakage of skin capillaries in active stages develops into extensive avascular areas, clinically associated with severe tissue hypoxia and the formation of digital ulcers. Vascular endothelial growth factor (VEGF) is upregulated in all stages of the disease, with little effect on efficient neovascularization. The oxygen-regulated α-subunit of hypoxia-inducible transcription factor-1 (HIF-1α) represents a key mechanism involved in the transcriptional regulation of VEGF. The aim of this study is to investigate expression of the oxygen-regulated α-subunit of HIF-1 and VEGF in naïve scleroderma patients. For this purpose, skin biopsies (dorsal hand surface) from scleroderma patients were analyzed and compared with control skin biopsies. Immunoreactivity for VEGF was enhanced in scleroderma patients, in contrast to restricted positive immunostaining in suprabasal keratinocytes observed in normal skin. In a similar fashion, all skin biopsies from scleroderma patients were strongly HIF-1α reactive, compared with rare immunoreactivity observed in normal skin. The pattern was similar in all stages of scleroderma. These observations for the first time directly connect constitutive hypoxia with VEGF upregulation in scleroderma patients. The sequence of events needs to be precisely mapped, and the pro- and antiangiogenic switches which may interfere with efficient tissue neovascularization identified, in order to provide meaningful therapeutic strategies.	{ "pile_set_name": "PubMed Abstracts" }
(Photo : Veikko Linko, Boxuan Shen and Heini Ijäs/Aalto University) The nanostructures constructed of DNA molecules can be programmed to function at pH-responsive cargo carriers, paving the way towards functional drug-delivery vehicles, according to a new study of the University of Jyvaskyla and Aalto University. University of Jyvaskyla and Aalto University's researchers have developed a customized DNA nanostructure that can perform a predefined task in human body-like conditions. To do so, the group built a capsule-like carrier that opens and closes according to the pH level of the surrounding solution. Now, it is possible to load and pack the nanocapsule with a variety of cargo, closed for delivery and opened again through a subtle pH increase. The function of the DNA nanocapsule has a basis on pH-responsive DNA residues. To this end, this team of researchers designed a capsule-like DNA origami structure functionalized with pH-responsive DNA strands. The simple hydrogen-bonding of two complementary DNA sequences controls such dynamic DNA nano designs. Here, one half of the capsule was equipped with specific double-stranded DNA domains that could further form a DNA triple helix, in other words, a helical structure comprised of three, not just two DNA molecules, by attaching to a suitable single-stranded DNA in the other half. The lead author of the study explained that when the surrounding pH of the solution is right, the triplex formation can happen. Scientists call these pH-responsive strands "pH latches" because when the strands interact, they function similar to their macroscopic counterparts and lock the capsule in a closed state. Also included are the various motifs into the capsule design to facilitate the capsule opening and closing based on the cooperative behavior of the latches. The opening of the capsule is indeed quite rapid and requires only a slight pH increase in the solution. And within the capsules, it is easy to load the nanoparticles and enzymes. The team tied the nanocapsules for carrying molecular payloads or therapeutic substances by designing the capsule with a cavity that could not host different materials. Also, the team demonstrated that both gold nanoparticles and enzymes could be loaded (high pH) and encapsulated within the capsules (low pH) and again displayed (high pH). While monitoring the enzyme activity, the researchers discovered that the cargo remained fully functional throughout the process. Ultimately, the capsules continued to be effective at physiological magnesium and sodium concentrations, and in ten percent blood plasma, and may continue to do at even higher plasma concentrations. Together, these discoveries help pave the way for developing smart and fully programmable drug-delivery vehicles for nanomedicine.	{ "pile_set_name": "OpenWebText2" }
A conventional saw is applied to saw objects, such as woods, plastic pipes, or metal objects etc. While sawing the objects, a handle of the saw is pulled and pushed repeatedly by a user so as to press a saw blade to saw the objects. However, it is exhausted to pull and push the handle repeatedly. The present invention has arisen to mitigate and/or obviate the afore-described disadvantages.	{ "pile_set_name": "USPTO Backgrounds" }
In the United States Court of Appeals For the Seventh Circuit ____________________ No. 17-2526 NICHOLAS WEBB, et al., Plaintiffs-Appellants, v. FINANCIAL INDUSTRY REGULATORY AUTHORITY, INC., Defendant-Appellee. ____________________ Appeal from the United States District Court for the Northern District of Illinois, Eastern Division. No. 1:16-cv-04664 — Andrea R. Wood, Judge. ____________________ ARGUED FEBRUARY 6, 2018 — DECIDED MAY 8, 2018 ____________________ Before RIPPLE, SYKES, and BARRETT, Circuit Judges. BARRETT, Circuit Judge. The parties cast this case as one about arbitral immunity, which is the ground on which the district court dismissed the complaint. It turns out, however, that the case is really about federal jurisdiction. We asked the parties to submit supplemental briefs on this question, and they both contend that subject matter jurisdiction exists. Their strongest argument is grounded in the diversity stat- ute, but the amount in controversy requirement presents an 2 No. 17-2526 obstacle: the complaint satisfies it only if Illinois law permits the plaintiffs to recover their legal expenses from the under- lying arbitration, this suit, or both. We conclude that while Illinois law permits the recovery of legal fees as damages in limited circumstances, those circumstances are not present here. I. In October 2013, brokers Nicholas Webb and Thad Bev- ersdorf were fired by their employer, Jefferies & Company, Inc. (“Jefferies”). They decided to challenge their termina- tion, and, as their employment contracts with Jefferies de- manded, they filed their claims in the Financial Industry Regulatory Authority’s (“FINRA”) arbitration forum. FINRA required them to sign an “Arbitration Submission Agree- ment,” which they did, and their dispute with Jefferies pro- ceeded in arbitration for the next two-and-a-half years. They withdrew their claims before a final decision was rendered. Under FINRA’s rules, that withdrawal constituted a dismis- sal with prejudice. After the arbitration failed, Webb and Beversdorf sued FINRA in the Circuit Court of Cook County, Illinois, alleging that FINRA breached its contract to arbitrate their dispute with Jefferies. They faulted FINRA for a number of things, including failing to properly train arbitrators, failing to pro- vide arbitrators with appropriate procedural mechanisms, interfering with the arbitrators’ discretion, and failing to permit reasonable discovery. They sought damages “in an amount in excess of $50,000” and a declaratory judgment identifying specified flaws in FINRA’s Code of Arbitration Procedure. FINRA removed the dispute to federal court, where it moved to dismiss on multiple grounds, including No. 17-2526 3 arbitral immunity. The district court held that FINRA was entitled to arbitral immunity and dismissed the suit. Webb and Beversdorf appeal this judgment. II. Neither side has raised a jurisdictional challenge, but we have an independent obligation to determine whether we have authority to resolve this dispute. Smith v. American Gen. Life & Acc. Ins. Co., 337 F.3d 888, 892 (7th Cir. 2003) (citing St. Paul Mercury Indem. Co. v. Red Cab Co., 303 U.S. 283, 287 n.10 (1938)). At oral argument, we ordered the parties to submit supplemental briefs on this issue. Both sides argue that di- versity jurisdiction exists, and FINRA argues that federal question jurisdiction exists as well. Because the argument for diversity is the stronger of the two, we begin there. The diversity statute, 28 U.S.C. § 1332, grants jurisdiction when there is complete diversity of citizenship between the parties and the amount in controversy exceeds $75,000, ex- clusive of interest and costs. Complete diversity is not a problem: Webb and Beversdorf are citizens of Illinois and FINRA is a Delaware corporation with its principal place of business in Washington, D.C. Identifying the amount in con- troversy is more complicated. After it removed the case to federal court, FINRA initially claimed that the amount in controversy was satisfied be- cause Webb and Beversdorf sought more than $1,000,000 from Jefferies. The district court properly rejected this argu- ment, because we have held that the amount at stake in an underlying arbitration does not count toward the amount in controversy in a suit between a party to the arbitration and the arbitrator. Caudle v. American Arbitration Ass’n, 230 F.3d 4 No. 17-2526 920, 922–23 (7th Cir. 2000). Jurisdiction turns on what is at stake between the parties to this suit—Webb and Beversdorf, the plaintiffs, and FINRA, the defendant. Webb and Beversdorf paid FINRA $1800 at the start of the arbitration; if that is all they lost, the amount in contro- versy is obviously far short of the jurisdictional mark. They also, however, seek to recover the legal fees that they in- curred both in the course of arbitrating against Jefferies and in preparing this lawsuit against FINRA.1 Webb and Bevers- dorf say that these fees—which exceed $75,000—were a rea- sonably foreseeable consequence of FINRA’s breach of the Arbitration Submission Agreement. See 24 WILLISTON ON CONTRACTS § 64.12 (4th ed. 2017) (“Consequential damages … include those damages that … were reasonably foreseea- ble or contemplated by the parties at the time the contract was entered into as a probable result of a breach.”). The dis- trict court accepted this argument and concluded that it had authority to adjudicate the suit. Legal fees may count toward the amount in controversy if the plaintiff has a right to them “based on contract, statute, or other legal authority.” Ross v. Inter-Ocean Ins. Co., 693 F.2d 659, 661 (7th Cir. 1982), abrogated on other grounds by Hart v. 1 In their supplemental briefs, Webb and Beversdorf stress the legal fees they incurred in “preparing to litigate” against FINRA, presumably because they recognize that the amount in controversy requirement must be satisfied at the time the lawsuit is filed in or removed to federal court. Gardynski-Leschuck v. Ford Motor Co., 142 F.3d 955, 958 (7th Cir. 1998) (“[J]urisdiction depends on the state of affairs when the case begins; what happens later is irrelevant.”). Even if they seek recovery of legal fees incurred after the case was removed, those fees cannot count toward the amount in controversy. No. 17-2526 5 Schering-Plough Corp., 253 F.3d 272, 274 (7th Cir. 2001). Webb and Beversdorf do not contend that FINRA assumed a con- tractual obligation to cover either the fees that they incurred in arbitration or those that they incurred in this lawsuit. That leaves statute or other authority. The parties agree that Illi- nois law governs, so we look there to determine whether Webb and Beversdorf could plausibly recover any of these legal fees as damages. It is clear that Webb and Beversdorf cannot recover the money spent preparing to litigate against FINRA. Illinois generally adheres to the American Rule that each party bears its own litigation costs. Duignan v. Lincoln Towers Ins. Agency, Inc., 667 N.E.2d 608, 613 (Ill. App. Ct. 1996). Its common law does not authorize a prevailing party to recover attorneys’ fees from an opponent. Ritter v. Ritter, 46 N.E.2d 41, 43 (Ill. 1943); see also Keefe-Shea Joint Venture v. City of Evanston, 845 N.E.2d 689, 702 (Ill. App. Ct. 2005). Any right to recovery must derive from contract or statute, Ritter, 46 N.E.2d at 43; Fednav Int’l Ltd. v. Cont’l Ins. Co., 624 F.3d 834, 839 (7th Cir. 2010), and Webb and Beversdorf have not identified any contractual or statutory provision giving them that right. They are thus stuck with the longstanding rule that they must bear their own litigation expenses in this suit against FINRA, even if they ultimately win. But Webb and Beversdorf do not just seek recovery of the legal fees they have incurred litigating against FINRA; they also seek recovery of the legal fees they incurred arbitrating against Jefferies. This is a more plausible ground for recov- ery, because Illinois recognizes a “third party litigation ex- ception” to the American Rule. The Illinois Supreme Court has held that “where the wrongful acts of a defendant in- 6 No. 17-2526 volve the plaintiff in litigation with third parties or place him in such relation with others as to make it necessary to incur expense to protect his interest, the plaintiff can then recover damages against such wrongdoer, measured by the reasona- ble expenses of such litigation, including attorney fees.” Rit- ter, 46 N.E.2d at 44; see also RESTATEMENT (SECOND) OF TORTS § 914 (“One who through the tort of another has been re- quired to act in the protection of his interests by bringing or defending an action against a third person is entitled to re- cover reasonable compensation for loss of time, attorney fees, and other expenditures thereby suffered or incurred in the earlier action.”). While the exception arises more fre- quently in the context of torts than contracts, we assume that Illinois courts would recognize it in the latter context as well. See Colvin v. Monticello Communications, Inc., No. 91–C–2498, 1994 WL 113051, at 8–9 (N.D. Ill. Apr. 1, 1994) (allowing the recovery of legal fees when the defendant’s breach of con- tract placed the plaintiff in litigation with a third party); see also City of Cedarburg Light & Water Comm’n v. Glen Falls Ins. Co., 166 N.W.2d 165, 168 (Wis. 1969) (“[A] breach of contract as well as tort may be a basis for allowing the present plain- tiff to recover reasonable third party litigation expenses.”). FINRA—whose desire to be in federal court has motivated it to argue vigorously for a proposition otherwise against its interest—also insists that the “third party litigation excep- tion” to the American Rule applies here and could obligate it to pay for Webb and Beversdorf’s legal expenses if it breached the arbitration agreement. Webb and Beversdorf’s effort to recover expenses in- curred in an arbitration proceeding begun for its own pur- poses—to assert a wrongful termination claim against Jeffer- ies—distinguishes this case from those in which Illinois No. 17-2526 7 courts have applied the exception. Illinois courts have not applied the exception when the defendant caused the legal fees to increase in an already existing third-party suit; they have applied it when the defendant caused the third-party suit in the first place. The Illinois courts have invariably de- scribed the exception as applying when the defendant’s wrong forced the plaintiff into litigation with a third party. See, e.g., Ritter, 46 N.E.2d at 44 (holding that the exception applies “where the natural and proximate consequences of a wrongful act have been to involve the plaintiff in litigation with others” (emphasis added)); Philpot v. Taylor, 75 Ill. 309, 311 (Ill. 1874) (applying exception where the consequence of the defendant’s wrongful act “has been to plunge the plaintiff into a chancery suit” (emphasis added)); see also Champion Parts, Inc. v. Oppenheimer & Co., 878 F.2d 1003, 1006 (7th Cir. 1989) (noting that the plaintiff can recover attorneys’ fees if “one consequence of the tortfeasor’s actions is to involve a person in litigation with others” (emphasis added)). For example, Illi- nois courts have permitted plaintiffs to recover legal fees spent settling with an insurance company when the defend- ant wrongfully caused the company to cancel the plaintiff’s policy, Duignan, 667 N.E.2d at 613; obtaining refunds of tax penalties that were assessed on the plaintiff due to the de- fendant’s negligence, Sorenson v. Fio Rito, 413 N.E.2d 47, 52 (Ill. App. Ct. 1980); and filing a second divorce petition when the defendant’s legal malpractice resulted in the dismissal of the plaintiff’s first petition, Nettleton v. Stogsdill, 899 N.E.2d 1252, 1259 (Ill. App. Ct. 2008). In all of these instances, the third-party litigation existed because of the defendant’s al- leged wrong.2 And when the party seeking the recovery of 2 The dissent cites Certain Underwriters at Lloyd’s, London v. Johnson & 8 No. 17-2526 fees was the plaintiff in the third-party litigation, as Webb and Beversdorf were here, the third-party litigation has been undertaken to “cure the damage caused by the defendant.” Duignan, 667 N.E.2d at 613. Webb and Beversdorf did not undertake the arbitration to cure FINRA’s breach of contract; they undertook it to re- solve an employment dispute with Jefferies. FINRA’s al- leged breach of the arbitration agreement did not force Webb and Beversdorf into arbitration; it allegedly increased Bell, Ltd., No. 10–C–7151, 2011 WL 3757179 (N.D. Ill. Aug. 25, 2011), as persuasive authority for the proposition that Illinois law would permit the recovery of fees not only when the defendant forced the plaintiff into litigation, but also when the defendant increased the plaintiff’s expenses in otherwise existing litigation. It is, of course, the decisions of Illinois courts that control our interpretation of Illinois law. In any event, how- ever, Certain Underwriters is consistent with our view of Illinois law. There, an insurer brought a legal malpractice action against a law firm that represented it in two underlying suits. The district court held that Illinois law would permit the plaintiff to recover attorneys’ fees in one of the underlying suits based on the plaintiff’s allegation that “it would not have undertaken its representation of [the insured] in the underlying … lawsuit but for defendants’ advice.” In other words, but for the defend- ants’ negligence, the plaintiff would not have been involved in the third- party litigation. Id. at 5. The district court also held that Illinois law would permit the plaintiff to recover the cost of hiring new counsel to correct the defendants’ failure to sue a necessary party in both of the un- derlying suits. Id. at 6. Certain Underwriters tracks the Illinois cases be- cause it permits recovery of attorneys’ fees paid to new counsel in an attempt to “cure the damage,” Duignan, 667 N.E.2d at 613. Like the plain- tiffs in Nettleton v. Stogsdill and Sorenson v. Fio Rito—and unlike Webb and Beversdorf here—the plaintiffs in Certain Underwriters did not seek recovery of inflated expenses incurred in the course of the initial, flawed litigation; they sought recovery of fees paid to replacement counsel hired to fix the defendants’ mistakes. No. 17-2526 9 the costs of arbitration they had already begun. The straight- forward causal connection that justified application of the third-party litigation exception in other cases is not present in this suit. Even, then, if FINRA breached its contract with Webb and Beversdorf, that breach would not alleviate Webb and Beversdorf’s obligation to shoulder the legal costs asso- ciated with their decision to pursue a wrongful termination claim against Jefferies. See Buckhannon Bd. & Care Home, Inc. v. West Virginia Dep’t of Health & Human Res., 532 U.S. 598, 602 (2001) (“In the United States, parties are ordinarily re- quired to bear their own attorney's fees….”). Illinois courts have consistently described and applied the exception in a way that precludes its application here.3 When a defendant removes to federal court, as FINRA did here, its plausible and good faith estimate of the amount in controversy establishes jurisdiction unless it is a “legal certainty” that the plaintiffs’ claim is for less than the requi- site amount. St. Paul Mercury Indem. Co., 303 U.S. at 288–89; 3 We do not reach this conclusion simply because the cases have all involved a defendant whose wrong forced the plaintiff to bring or de- fend a third-party lawsuit. See Dissenting Op. at 16–17 (observing that the “frequent occurrence of a fact pattern does not impose an analytical limitation on a principle unless some animating component of that prin- ciple limits application to the particular fact pattern.”). While we do not think the uniform occurrence of this fact pattern irrelevant, our conclu- sion is driven by the way that the Illinois courts (and, for that matter, the RESTATEMENT (SECOND) OF TORTS, see supra at 6) state the rule governing the recovery of third-party litigation expenses: they invariably include this limitation. The limit is not irrational; indeed, we can imagine reasons why Illinois might want to draw a line between attorneys’ fees clearly attributable to the defendant’s breach and those that are harder to sort out. 10 No. 17-2526 Roppo v. Travelers Commercial Ins. Co., 869 F.3d 568, 579 (7th Cir. 2017). Here, Illinois law makes it a “legal certainty” that Webb and Beversdorf’s claim is for less than the requisite amount.4 Diversity jurisdiction does not exist. III. Webb and Beversdorf leave it at diversity, but FINRA makes an additional argument for federal question jurisdic- 4 The dissent argues that the “legal certainty” standard, St. Paul Mer- cury Indem. Co., 303 U.S. at 289, requires a federal court, where possible, to construe state law to allow the recovery of damages. Dissenting Op. at 19–20. That is not how the “legal certainty” standard works. The court first decides whether, assuming the facts the plaintiff alleges are true, state law allows recovery of the damages the plaintiff seeks. If state law forecloses recovery of the damages, it is certain that the claim is for less than the jurisdictional amount. Otherwise, the court accepts the plain- tiff’s good faith valuation of the claim. See Anthony v. Sec. Pac. Fin. Servs., Inc., 75 F.3d 311, 315 (7th Cir. 1996) (applying this two-step inquiry); see also St. Paul Mercury Indem. Co., 303 U.S. at 288 (“The rule governing dismissal for want of jurisdiction in cases brought in the federal court is that, unless the law gives a different rule, the sum claimed by the plain- tiff controls.”). The point of the “legal certainty” test is not to guide the court’s interpretation of state law, but to save the court from having to make difficult predictions about whether and how much the plaintiff is likely to win. Meridian Sec. Ins. Co. v. Sadowski, 441 F.3d 536, 543 (7th Cir. 2006) (“[U]ncertainty about whether the plaintiff can prove its substan- tive claim, and whether damages (if the plaintiff prevails on the merits) will exceed the threshold, does not justify dismissal.”). To that end, the test distinguishes between the law (which can render a claim’s value cer- tain) and the facts (which, if plausible, cannot). So far as we can tell, the suggestion that the “legal certainty” standard requires a federal court to accept the plaintiff’s good-faith characterization of the law, as opposed to the plaintiff’s good-faith valuation of his claim, is novel. No. 17-2526 11 tion.5 According to FINRA, this dispute is one of the rare state-law causes of action that gives rise to federal question jurisdiction under Grable & Sons Metal Products, Inc. v. Darue Engineering & Manufacturing, 545 U.S. 308 (2005); see also Merrill Lynch, Pierce, Fenner & Smith v. Manning, 136 S. Ct. 1562, 1566 (2016) (holding that the Grable & Sons test deter- mines the reach of “arising under” jurisdiction for purposes of the jurisdictional grant in the Securities Exchange Act of 1934).6 Its theory is that the presence of an issue of federal securities law transforms this state-law contract claim into one arising under federal law. Under Grable & Sons, a state-law claim may satisfy the “arising under” jurisdictional test if a federal issue is: (1) necessarily raised, (2) actually disputed, (3) substantial, and (4) capable of resolution in a federal court without dis- rupting the federal-state balance. Gunn v. Minton, 568 U.S. 251, 258 (2013) (citing Grable & Sons, 545 U.S. at 314); see also Evergreen Square of Cudahy v. Wisconsin Hous. & Econ. Dev. Auth., 776 F.3d 463, 466 (7th Cir. 2015). Federal jurisdiction is rarely established on this basis. Hartland Lakeside Joint No. 3 School Dist. v. WEA Ins. Corp., 756 F.3d 1032, 1033 (7th Cir. 2014). For a state-law claim to arise under a federal securities 5 FINRA invoked both diversity and federal question jurisdiction in its notice of removal. Because the district court concluded that diversity jurisdiction existed, it did not reach the question of federal question ju- risdiction. 6 FINRA invokes both the general federal question statute, 28 U.S.C. § 1331, and the exclusive jurisdictional provision in the Securities Ex- change Act of 1934, 15 U.S.C. § 78aa. Because the Supreme Court held in Manning, 136 S. Ct. at 1566, that the Grable & Sons test applies in both contexts, we do not consider the two statutes separately. 12 No. 17-2526 claim, an issue of federal law must be the “cornerstone” of the plaintiff’s complaint. Manning, 136 S. Ct. at 1569. This dispute does not make it past the first factor of the Grable & Sons test. FINRA contends that because the plain- tiffs’ suit implicates FINRA’s SEC-approved Code of Arbitra- tion Procedure, this case requires us to decide whether FINRA breached a duty it owed Webb and Beversdorf under the securities laws. But FINRA fails to identify a single pro- vision of federal law that we would have to interpret to re- solve this case. The question is whether FINRA breached its arbitration agreement, and no “inescapable” provision of federal law drives that analysis. Hartland, 756 F.3d at 1035. To be sure, FINRA is regulated by the SEC, and its duties under the federal securities laws might come up. But that does not make federal law the “cornerstone” of the plaintiff’s com- plaint. Manning, 136 S. Ct. at 1569. The Supreme Court has emphasized that a “federal role” is not enough. Id. As for the rest of the Grable & Sons test, an issue not raised cannot be actually disputed or substantial, and with- out any federal question necessarily in play, we need not consider how taking the question would affect the federal- state balance. This is a state-law contract claim, and FINRA’s effort to pull it within federal question jurisdiction fails. IV. We VACATE the judgment for lack of jurisdiction and REMAND the case to the district court with instructions to remand to state court. No. 17-2526 13 RIPPLE, Circuit Judge, concurring in part and dissenting in part. I agree with the majority that federal question jurisdic- tion is lacking. However, I reach a different conclusion with respect to diversity jurisdiction. Specifically, I cannot agree that we know, to a “legal certainty,” that Messrs. Webb and Beversdorf cannot recover the damages that they allege, in- cluding the attorneys’ fees expended in the earlier arbitration. A defendant seeking removal of a state action to federal court must file a notice of removal “containing a short and plain statement of the grounds for removal.” 28 U.S.C. § 1446(a). “By design, § 1446(a) tracks the general plead- ing requirement stated in Rule 8(a) of the Fed- eral Rules of Civil Procedure.” As the Supreme Court explained in Dart Cherokee Basin Operating Co., “Congress, by borrowing the familiar ‘short and plain statement’ standard from Rule 8(a), intended to ‘simplify the “pleading” require- ments for removal’ and to clarify that courts should ‘apply the same liberal rules [to removal allegations] that are applied to other matters of pleading.’” Roppo v. Travelers Commercial Ins. Co., 869 F.3d 568, 578 (7th Cir. 2017) (alteration in original) (quoting Dart Cherokee Basin Operating Co., LLC v. Owens, 135 S. Ct. 547, 553 (2014)). There- fore, “[j]ust as we generally accept the plaintiff’s good-faith allegations of the amount in controversy to establish diversity jurisdiction, ‘when a defendant seeks federal-court adjudica- tion, the defendant’s amount-in-controversy allegation should be accepted when not contested by the plaintiff or 14 No. 17-2526 questioned by the court.’” Id. at 579 (footnote omitted) (quot- ing Dart Cherokee Basin Operating Co., 135 S. Ct. at 553). “Once this has been done, and supported by proof of any contested jurisdictional facts, the presumption is the one stated in St. Paul Mercury [Indemnity Co v. Red Cab Co., 303 U.S. 283, 291 (1938)]: the estimate of the dispute’s stakes advanced by the proponent of federal jurisdiction controls unless a recovery that large is legally impossible.” Back Doctors Ltd. v. Metro. Prop. & Cas. Ins. Co., 637 F.3d 827, 830 (7th Cir. 2011). We also have observed that the legal certainty test sets a high bar for excluding federal subject matter jurisdiction “for good reason: District courts should not get bogged down at the time of removal in evaluating claims on the merits to de- termine if jurisdiction exists.” Carroll v. Stryker Corp., 658 F.3d 675, 681 (7th Cir. 2011). Thus, typical examples of claims con- sidered “‘legally impossible’ for jurisdictional purposes” in- volve “statutory or contractual cap[s] on damages.” Id. With this principle in mind, we must turn to Illinois state law. Here, it is important not to get off on the wrong foot by how we characterize this action. It is not an attorneys’ fees ac- tion; it is a damages action based on the breach of a contract. This distinction is very important. Illinois normally would not allow the recoupment of attorneys’ fees for success in main- taining the present action. It does recognize, however, that at- torneys’ fees incurred in an earlier action can be a measure of damages for an individual’s misfeasance in that earlier action. See Duignan v. Lincoln Towers Ins. Agency, 667 N.E.2d 608, 613 (Ill. App. Ct. 1996). The Illinois appellate court explained the principles un- derlying this rule, and demonstrated their application, in Sorenson v. Fio Rito, 413 N.E.2d 47 (Ill. App. Ct. 1980). In No. 17-2526 15 Sorenson, a widow had retained an attorney, Fio Rito, to han- dle her husband’s estate. Rather than attending to it, however, the attorney let it languish in his office; taxes went unpaid, and tax authorities imposed penalties. Sorenson then retained a new attorney to handle the estate, and through that attor- ney’s unsuccessful attempts to obtain refunds of penalties and interest, she incurred attorneys’ fees. See id. at 50. Sorenson then brought an action against the first attorney, Fio Rito, for damages. Among the damages that she claimed were fees paid to her second attorney for challenging the penalties. The trial court ruled that Sorenson could recover these damages from Fio Rito. Fio Rito maintained in the state appellate court that the American Rule, which generally precludes a plaintiff from re- covering attorneys’ fees expended to bring a lawsuit against a wrongdoer, foreclosed such damages. See id. at 51. The ap- pellate court disagreed. It explained that Fio Rito was “con- fus[ing] the exception with the general rule. The general rule in Illinois is that one who commits an illegal or wrongful act is liable for all of the ordinary and natural consequences of his act.” Id. The American Rule governing attorneys’ fees limited this general rule, but only in situations “where a successful lit- igant seeks to recover his costs in maintaining the lawsuit”; it was not “intended to preclude a plaintiff from recovering losses directly caused by the defendant’s conduct simply be- cause those losses happen to take the form of attorneys’ fees.” Id. at 51–52. Applying these principles to Sorenson’s claim, the court stated: The plaintiff here is not attempting to recover the attorneys’ fees she expended in bringing this 16 No. 17-2526 lawsuit. Rather, she seeks to recover losses in- curred in trying to obtain refunds of tax penal- ties which were assessed against her solely as a result of the defendant’s negligence. Had the plaintiff been forced to hire an accountant to re- pair the damage caused by the defendant’s con- duct, she would undoubtedly have been enti- tled to recover the accountant’s fee as an ordi- nary element of damages. There is no basis in logic for denying recovery of the same type of loss merely because the plaintiff required an at- torney instead of an accountant to correct the situation caused by the defendant’s neglect. In holding the defendant liable for the plaintiff’s losses, we are not violating the policy against “penalizing” a litigant for defending a lawsuit. We are simply following the general rule of re- quiring a wrongdoer to bear the consequences of his misconduct. Id. at 52. The facts of our case are different. Here, the plaintiffs are demanding that the arbitrator in the underlying matter re- imburse them for the attorney fees that they incurred because of the arbitrator’s alleged lapse. The principle nevertheless re- mains the same. As the majority notes, most cases addressing the recovery of attorneys’ fees involve situations in which “the defendant’s wrong forced the plaintiff into litigation with a third party”— “when the defendant caused the third-party suit” as opposed to simply “caus[ing] the legal fees to increase in an already existing third-party suit.” See Majority Opinion 6–7 (collecting cases). However, the frequent occurrence of a fact pattern No. 17-2526 17 does not impose an analytical limitation on a principle unless some animating component of that principle limits applica- tion to the particular fact pattern. Here, the majority points to no such consideration. Nor does Illinois case law suggest any such limitation. Indeed, a colleague on the district court has written that it demonstrates the opposite. In Certain Under- writers at Lloyd’s, London v. Johnson & Bell, Ltd., No. 10 C 7151, 2011 WL 3757179 (N.D. Ill Aug. 25, 2011), the underwriters had hired Johnson & Bell to analyze their coverage responsi- bilities in two lawsuits and “to prepare and file complaints for declaratory judgment as necessary in connection with both suits.” Id. at 1. The underwriters later brought an action in federal court asserting state law malpractice claims against Johnson & Bell related to its representation in the two earlier actions. Specifically, the underwriters alleged that it incurred unnecessary attorneys’ fees based on Johnson & Bell’s han- dling of two underlying actions, the Lewis action and the Zarndt action. One of Johnson & Bell’s alleged missteps was providing negligent advice to the underwriters that they had a duty to provide representation in the Lewis lawsuit. With respect to those fees, the underwriters contended that “it would not have undertaken its representation of the defendants in the underlying Lewis lawsuit but for defendants’ advice.” Id. at 5. The underwriters did not make an equivalent claim with re- spect to the Zarndt action. A separate failure, however, was that Johnson & Bell neg- ligently had failed to name a necessary party in both the Zarndt and Lewis actions. Consequently, they had to hire re- placement counsel in those lawsuits and to incur unnecessary attorneys’ fees to correct the errors. Relying on Sorenson and 18 No. 17-2526 other Illinois cases, the district court held that Illinois law did not bar the underwriters’ claims: “Defendants’ omission of FCC as a defendant in the … declaratory judgment actions al- legedly necessitated correction of the pleadings at a fixed cost to plaintiff. At the time the fees were incurred, it was clear that the fees were directly attributable to counsel’s neglect.” Id. at 7 (citing Sorenson, 413 N.E.2d at 52). The court saw no analyt- ical significance to the fact that the underwriters had incurred the fees in existing litigation, rather than incurred in a sepa- rate lawsuit. Moreover, the court made no distinction be- tween fees incurred in the Lewis action, which would not have been undertaken absent Johnson & Bell’s negligence, and those incurred in the Zarndt action, the defense of which the underwriters did not challenge. Here, Messrs. Webb and Beversdorf do not seek damages from FINRA in the form of attorneys’ fees expended in this action. Instead, they seek damages from FINRA that include the expenditure of attorneys’ fees in the underlying arbitra- tion. They claim that these damages are “the direct result” of FINRA’s failure to create fair procedures and of FINRA’s in- terference in the arbitral process.1 Illinois law does not pre- clude a plaintiff from “recovering losses directly caused by the defendant’s conduct simply because those losses happen to take the form of attorneys’ fees.” Sorenson, 413 N.E.2d at 52. Moreover, the court inquired, and plaintiffs’ counsel repre- sented on the record, that the fees paid to FINRA and to arbi- tral counsel exceeded $75,000.2 See Rising-Moore v. Red Roof 1 R.1-1 at 7. 2 See R.35-2 at 3–4. No. 17-2526 19 Inns, Inc., 435 F.3d 813, 816 (7th Cir. 2006) (finding that plain- tiff’s counsel’s settlement demand could support a finding that the amount in controversy had been satisfied); cf. Work- man v. United Parcel Serv., Inc., 234 F.3d 998, 1000 (7th Cir. 2000) (observing that a plaintiff’s refusal to stipulate that his claim is less than $75,000 raises an inference that he believes his claim is worth more). Consequently, the district court properly determined that the amount in controversy was not in question. As noted at the outset of this separate opinion, we have said, straightforwardly and firmly, that “[t]he legal-certainty test sets the bar high for excluding federal subject-matter ju- risdiction, and for good reason: District courts should not get bogged down at the time of removal in evaluating claims on the merits to determine if jurisdiction exists.” Carroll, 658 F.3d at 681. This rule, rooted in the long-standing jurisprudence of the Supreme Court, see St. Paul Mercury Indem. Co., 303 U.S. at 289, is followed faithfully throughout the Country, see, e.g., Colavito v. New York Organ Donor Network, Inc., 438 F.3d 214, 221 (2d Cir. 2006). When the applicable state law definitively precludes recovery of the jurisdictional amount, we have not hesitated to say that the federal court is without jurisdiction. See, e.g., Anthony v. Sec. Pac. Fin. Servs., Inc., 75 F.3d 311, 317– 18 (7th Cir. 1996). However, when state law is “unsettled,” we will not engage in guesswork to resolve the issue of state law prematurely. Geschke v. Air Force Ass’n, 425 F.3d 337, 341 (7th Cir. 2005).3 3 We note in passing, however, that when a claim for punitive damages comprises the vast bulk of the amount necessary to reach the jurisdictional threshold, we have proceeded with a heightened degree of caution. See 20 No. 17-2526 Here, the majority opinion, quite admittedly, see Majority Opinion 9, engages in such guesswork. Frankly admitting that it cannot say with any certainty how Illinois courts would resolve the plaintiffs’ substantive claims, it ignores the court’s teaching in Geschke. Taking a guess on the content of state law, it denies the defendants their rightful federal forum. In doing so, it effectively chides the district court for having followed the established law of the circuit and tells future district courts to ignore Geschke and to follow its example today of becoming bogged down in reading “tea leaves” on the content of state law. It departs from the established practice of accepting ju- risdiction and of confronting the content of state law by later employing other federal practice devices that are far better suited to addressing, sometimes with the help of the state court, the intractable problems inherent in the “Erie guess.”4 See, e.g., Colavito, 438 F.3d at 231-35 (deciding the jurisdic- tional amount issue and then determining through motions for summary judgment, for dismissal for failure to state a claim, and by certification whether the plaintiff could state a viable cause of action). Because I believe that the district court followed estab- lished practice, grounded in well-settled case law across the Nation, I respectfully dissent from the dismissal for want of subject matter jurisdiction. Del Vecchio v. Conseco, Inc., 230 F.3d 974, 978–79 (7th Cir. 2000); see also Packard v. Provident Nat’l Bank, 994 F.2d 1039, 1046 (3d Cir. 1993). 4 See generally Dolores K. Sloviter, A Federal Judge Views Diversity Jurisdic- tion Through the Lens of Federalism, 78 Va. L. Rev. 1671 (1992).	{ "pile_set_name": "FreeLaw" }
Q: How to test ServerEndPoint, ClientEndPoint? I have implemented ServerEndPoint and ClientEndPoint, how can i test it? For example, i have Connection wrappers over Session and i want to test it behavior which depends on session data, also i want to test messaging between client and server. Note that i don't have any war or any of application configuration such as web.xml, web-sockets infrastructure going to be used in another place, all what i have is mapped ServerEndPoint and ClientEndPoint implementations. A: The Tyrus reference implementation has a test tools package which contains a test server that can be used with a client: http://mvnrepository.com/artifact/org.glassfish.tyrus.tests/tyrus-test-tools/1.10 The samples on Github are a good usage guide: https://github.com/tyrus-project/tyrus/blob/master/archetypes/echo/src/main/resources/archetype-resources/src/test/java/EchoTest.java	{ "pile_set_name": "StackExchange" }
From Bed To Couch is the debut release from Berlin transplant (via Rome) Jacopo Carreras. Over the course of eleven tracks that run almost exactly an hour in length, he at times locks into a massive techno groove that I simply haven't heard anyone else compete with lately. With meaty basslines that grind the temples and kick drums that slam off the solar plexus, there are a handful of tracks on here that should drive dancefloors into sweaty convulsions. Opening track "Rox Tox" isn't even the best starting point, as it grinds away with a sort of shuffling Amon Tobin-esque slam of fuzzy synths, strings, and breakbeats, but everything opens up soon thereafter. In fact, "One Sentence" might be one of the better dance tracks that I've heard this year, starting out with a hollow kick and some warbling electronics before locking into an intestine-churning burner that wires filtered vocals and sub-woofer rippling bass into something that approaches pop. "Gentle Touch" is nearly as solid, even though it's not gentle at all, with squishy beats that bounce off cavern walls and an acidic bassline that just keeps throwing more squelch on the fire. The biggest lapse on the release comes about halfway through, as tracks like "Il Vuoto Non EŽ" and "Drying Water" seem more focused on filters and neat sounds than actually developing and following through with the promise hinted at. Fortunately, there are several bangers that help rub down the back end of the release as well, with "Y2K" ramping up a manic-nervosa repetitive melody over the top of a huge kick drum while "Anarko-F" meshes some rave-style old-school build ups with evil-sounding muffled vocals and loads of dirty synth lines. The high points are very high here, with a few other places that simply don't quite carry the same weight. Simply running too long in places, From Bed To Couch could have probably been a barn-burner at about two-thirds the length. As it stands, Carreras is definitely someone to keep an eye on.	{ "pile_set_name": "Pile-CC" }
I asked him if we could go to a party together He said "too late, I already adopted a dog." 214 shares	{ "pile_set_name": "OpenWebText2" }
Q: strange output of STL map C programmer trying to call a C++ map (to use the functionality of an associated array or hashing). The string is just a beginning, will go on to hash binary string. Got stuck on the first step. Wonder why the output of this program will only return 0. #include <string.h> #include <iostream> #include <map> #include <utility> #include <stdio.h> using namespace std; extern "C" { int get(map<string, int> e, char* s){ return e[s]; } int set(map<string, int> e, char* s, int value) { e[s] = value; } } int main() { map<string, int> Employees; printf("size is %d\n", sizeof(Employees)); set(Employees, "jin", 100); set(Employees, "joe", 101); set(Employees, "john", 102); set(Employees, "jerry", 103); set(Employees, "jobs", 1004); printf("value %d\n", get(Employees, "joe")); } Thanks. A: Two bugs found (yet): printf("size is %d\n", sizeof(Employees)); has to be printf("size is %d\n", Employees.size()); sizeof gives you the size of the object, not the count of elements within. int set(map<string, int> e, char* s, int value) has to be int set(map<string, int> &e, char* s, int value) otherwise you give a copy to the function, not the original (as in C).The copy will be discard after leaving the scope of the function. The original is not altered.	{ "pile_set_name": "StackExchange" }
A head-to-toe guide to making the greatest American soup Do the holidays really end after New Year's for most people? Must be fucking nice. Because in my world, the ever-increasing number of discrete gatherings-precipitated by divorces/remarriages, younger cousins/siblings becoming grown-ups and starting their own families, and a chance cluster of January birthdays-means I'm cooking all the time, for a shitload of people, from November straight through till February. I don't mean to sound bitter-I mean it's in the name of love and family and togetherness or whatever the fuck-but practically speaking, I've been at it long enough to have learned to bang out a jail-sized main course with minimal effort. My answer: a huge-ass pot of soup. But the soup has to live up to the "specialness" of these dozens of occasions. So what's a special soup? Well, obviously it has to taste very good, but it should also be a treat, hard to acquire in everyday life due either to geography or because it's a pain to make-ideally both. And then it has to be substantial enough to act as a main course on its own. And I'm not sure if I thought it out this way when I first decided to make it, but the thing I came up with about 10 years ago was gumbo. In case you didn't know, gumbo is one of, if not the, greatest American soup. And it's impossible to find a decent one within a hundred miles of Baltimore. Although it is a complex dish, much of the heavy lifting can be done in advance, leaving just a final assembly that takes less than an hour. So what is gumbo? Seems like a straightforward enough question, right? WRONG. Like with most highly regional dishes (from Louisiana in this case), there's no correct response, or many correct responses, but never a single correct answer. The only qualities that seem to be shared by most permutations of gumbo are that it is roux-based and that the Cajun version of mirepoix, known as "the holy trinity" (onion, celery, and green pepper), is used. Pretty much everything else is up for debate. Maybe the biggest point of contention is okra versus filé powder: The former is a vegetable that produces a mucus-like, protein-filled slime that supposedly thickens the gumbo, while the latter is ground-up sassafras leaves that serve the same function and also contribute flavor. Gumbo filé powder is becoming more common in area supermarkets, and Safeway carries it for sure. A Louisiana-native friend of mine who makes a mean gumbo has a family that's famous for its recipe for season salt, but some folks consider season salt anathema. Others consider it a necessity (the Tony Chachere brand in particular-also getting more common in grocery stores here). Same goes for hot sauce and Worcestershire too. Confused yet? Oh, and there are never tomatoes in gumbo, people. Like, ever. Last year I encountered the rice-versus-potato salad thing. Yes, it really is a thing. I was at the fairly well-regarded Stanley Restaurant in the French Quarter in New Orleans, and one of the side options for gumbo was potato salad. And by side, I mean a scoop of it right in the middle of the gumbo. Our server was like, "Oh yeah, here in New Orleans this is how you do it, nobody from here eats gumbo with rice." I'd never heard of the potato salad thing before that moment, but potato salad totally supplanting rice? Sounded a bit bullshitty to me, and indeed the potato salad was cold (probably necessitated by health code) and way too mustardy. But I could kinda see it as a starch upgrade instead of or in addition to rice. In fact, I served it that way this past Christmas, to favorable reception. Crazy, huh? All of this is to say, you can go a lot of ways with gumbo. What follows is my way, which is, of course, very special. RouxThe thing that gives gumbo much of its identity is the roux. In French cuisine, a roux is butter and flour cooked together and used as a thickener for sauce. Creole dishes often use a butter-based roux (French influence at play), but in gumbo the roux is simply flour mixed with neutral oil, something like canola or corn, or sometimes bacon fat. Aside from thickening, roux greatly influences flavor via how long the flour has been cooked. This can be measured by color: a shorter cook time equals light color and mild flavor, while longer yields a darker hue and deeper, richer, nuttier flavors. It's said that some cooks can differentiate among 20 or more shades of roux, from blond to peanut butter, all the way to a "black" roux, which is just shy of burnt. I like a "brick" roux, which is dark rust in color. Since the roux will be doing most of the thickening, and if you think of a large soup pot as being full of sauce, you will need quite a bit of roux. The general rule of thumb is slightly more flour to oil, about 1 1/2 cups flour to 1 cup of oil, which is enough roux for about 2 gallons of gumbo, or 15-20 servings. The most common way to make a roux, which can be made days or weeks in advance, is on the stovetop, which requires constant stirring to prevent scorching. A much easier way is to bake it. Stir roux, making sure flour and oil are completely combined. Continue to bake, stirring once more at the 25-minute mark, for a total of 40 minutes, then allow to completely cool. Store covered and refrigerated for up to 2 weeks until needed. TrinityThis is the aromatic base for Cajun cooking, which differs from a French mirepoix in that carrots are replaced with green bell peppers. And it's the peppers that really give the final product that distinct but difficult-to-place backdrop of flavor. I like to mix in a few hotter peppers to lend heat to my gumbo. I've stored chopped trinity for a week in a tightly sealed container with no noticeable deterioration in quality. DIRECTIONS Cut bell peppers, celery, and onions into a medium dice (about 1/2-inch squares). Cut stems off serrano peppers, then cut lengthwise and across into small semicircles. Put everything into a large mixing bowl and combine until well mixed-it should total about 8 cups. Store in sealed containers or ziplock bags until needed. ProteinOne of the numerous rules governing gumbo prescribes strict separation of poultry and seafood, but I always mix the two, plus I add sausage. Andouille sausage (highly spiced and smoked pork) is nothing short of mandatory as far as I'm concerned-if you can't even turn up the mass-produced stuff (Aidells, for example), just make something else, seriously. Chicken-based sausage and Johnsonville brand are so far away from the real thing as to not count at all. Most grocery stores will have sausage labeled "andouille," but make sure it's not a company that also makes brats or kielbasa, and make sure it is pork and not chicken or turkey. Also watch out for uncooked or fresh andouille, as this is a different product altogether than the smoked variety. Whole Foods is a good bet for finding decent andouille. Chicken is cheap and it provides bulk protein as well as stock, while shrimp and/or oysters are at least a half-assed stab toward "special occasion" splurging. Pre-cooking the chicken a day before not only saves time and cleanup on the day of, but storing it in its own broth overnight also ensures moist, flavorful meat. In addition, it's easy to skim excess fat and scum off of cold broth. Otherwise wasted onion skins (make sure they're washed) contribute color and perhaps some flavor to the cooking liquid. Shrimp shells definitely add both. DIRECTIONS Add a little oil to a large stockpot (large enough for at least 10 quarts). Heat over medium-high until the oil is hot. Add the trinity, half the garlic, and 1 teaspoon of salt, and mix vigorously. Cook for about 5 minutes, or until onions become translucent. Add all but 1/2 cup of the roux and stir for a minute. Raise heat to high and slowly add all stock, mixing continuously. Add chicken and sausage, and bring to a bare simmer, then reduce heat to low. Season to taste with season salt and sauces, and cook for 2-3 minutes. If the gumbo seems too thin, add the remaining roux and mix thoroughly, making sure roux is dissolved completely; if too thick, add a bit more stock or water. Add remaining garlic and cook at a bare simmer for 15 minutes, or until celery is tender.	{ "pile_set_name": "Pile-CC" }
Depanthus Depanthus is a genus of shrubs in the family Gesneriaceae. The genus is endemic to New Caledonia in the Pacific and contains two species. It is related to Negria and Lenbrassia. List of species Depanthus glaber Depanthus pubescens References Category:Endemic flora of New Caledonia Category:Gesneriaceae Category:Gesneriaceae genera	{ "pile_set_name": "Wikipedia (en)" }
*2 + cl + ol4 + k + ul*3 and give o. 51048 Express (14 + 7r - 14)(-14r*3 - 5r3 + r3)(2 + 0 - 4)(10 + 0 + 1) as d + br + yr*4 + lr*3 + pr*2 and give y. 2772 Rearrange 0a - 9 + 2a - 37 - 4a + 3 to x + ka and give k. -2 Rearrange -126458 + 56a*2 + 63232 + 63228 + 11a to the form ca + o + ua*2 and give o. 2 Rearrange -15064r - 9r3 - 202r*3 + 15063r - 1 to the form hr + mr*3 + ar2 + o and give h. -1 Express 10 + o2 - 8o3 + 4114o + 4106o + 4113o - 12341o as no*2 + h + vo*3 + qo and give n. 1 Rearrange 0b2 + 13b + 67b3 - 175b*3 + 109b*3 + 1 + 0b*2 + 2b*2 to the form tb*3 + db*2 + lb + r and give l. 13 Rearrange (32 - 84 + 43)(-15 - 14 + 7)(0 - 3 + 1)(k2 - k2 + 4k*2) to the form ok + hk2 + f and give h. -1584 Express (-2g*2 - g + g)(1 - 2 + 3 + 5 + 50 - 9 + (-2 - 1 + 2)(-3 - 2 + 7) + 0 - 3 + 6)(6 - 1 - 3) in the form b + cg + lg*2 and give l. -196 Express -2 + 5243l + 0 - 1504l as d + al and give d. -2 Express (1 - 1 + 1)(-1 + 0 + 0)(804j - 13443 + 13443) in the form y + nj and give n. -804 Rearrange -89x3 - 87x*3 + 174x*3 - 7x*2 + 26 + 2x + 11 to vx3 + nx*2 + b + sx and give v. -2 Rearrange k*4 - 2k*2 + 234 + 36 + 2k*3 - 270 - 755k to the form x + pk2 + dk + zk4 + hk*3 and give p. -2 Express -108 + 367z*2 - 110z*2 - 248z*2 in the form uz + y + gz2 and give u. 0 Rearrange -2860m + 0 + 0 + 2672m + 15689m to the form cm + i and give c. 15501 Rearrange (108h*2 + 6h - 4h + 1610h*2 - 2h)(-3 + 2 - 4) - h2 + 0h*2 + 2h*2 to m + th*2 + rh and give t. -8589 Rearrange (13 - 18 + 106 + (0 - 1 + 0)(1 - 3 + 1) + 3 - 3 + 2)(q + 2q - 2q + (10 - 1 + 2)(-2q + 1 - 3 + 0)) to yq + j and give y. -2184 Rearrange (-43n*2 + 79n*2 + 1 - 17n*2)(190n + 151n + 148n) to the form in*2 + vn + un3 + d and give u. 9291 Express -3w + 63w3 + 8w*4 + 6 - 2 + 1 - 62w*3 + 6w*2 - 6w*4 as a + sw*2 + qw + nw3 + rw*4 and give s. 6 Rearrange (-107z*2 + 60 + 48z*2 + 61z*2)(11 + 39z - z2 + 46z - 86z) to yz*2 + d + oz + vz4 + jz*3 and give d. 660 Express -26041500 + 26041500 - 26682m as q + xm and give x. -26682 Rearrange 198p*2 + 927 + 208p*2 - 218p*3 - 406p*2 + 211p*3 to h + qp + fp3 + ap*2 and give h. 927 Rearrange 12s*2 - 2908s + 2907s - 2 - 2s*2 - 4s*2 - 3s*3 to cs*3 + ns*2 + v + rs and give n. 6 Rearrange (3 + 2 + 3)(1 - 2n - 1)(-6 + 2 + 0 + (-3 + 4 + 0)(0 + 1 + 0) + 474 + 372 - 156 + 71) to the form t + an and give a. -12128 Rearrange -636c - 43c3 + 628c - 51c4 + 18c*3 + 10c*3 + 17c*3 to the form f + ac*2 + dc*3 + mc + rc4 and give r. -51 Rearrange -342y*4 - 5y + 4y + y3 - 37 + 339y4 - y2 + 30 to the form jy + c + dy*3 + iy*4 + ry*2 and give c. -7 Rearrange 21s + 13s + 16s - 2s2 - 90 - 50s to the form ds2 + ns + i and give i. -90 Express 9a + 270298a*3 - 270303a*3 - 12a4 + 19 - a2 - 18 in the form sa + u + ka*4 + pa*2 + ha*3 and give u. 1 Rearrange 2p + 2p - 2p + 2p + 2p - 2p + 3p + p - 2p + 2p - p + 0p + (-4 + 4 - 1)(-6p + 3p + p) + 5717p - 39p - 105p to b + lp and give l. 5582 Express 25b + 1259881b2 + b3 - 1259881b2 + 217 in the form jb*3 + tb*2 + f + hb and give f. 217 Express 205827x4 + 14x*2 - 205824x*4 + 3x*3 + 144x*2 as m + zx*4 + sx*3 + wx*2 + vx and give s. 3 Rearrange -880a3 + 1773a*3 - 2a + 117 + a*2 - 892a*3 to the form b + oa*3 + la*2 + ua and give l. 1 Express -a*3 + 3036 + 212a*4 + 3a*2 - 213a*4 - 3080 in the form x + ua*4 + va*3 + ra + wa2 and give w. 3 Rearrange (2 - 2 + j)(0 - 2 - 2)(-55j + 32j + 5j) to the form mj2 + dj + u and give m. 72 Rearrange -5011p - 7128p + 516p + 145p to bp + k and give b. -11478 Rearrange (2k - 2k + 2k)(-4k + 5k - 2k)(-156k*2 - 5086 + 5086) to the form qk*2 + tk*4 + nk*3 + hk + w and give w. 0 Rearrange (-4 + 2 + 3)(1 - 1 - 2s)(1 + 1 + 0)(33818 - 64886 + 26299) to c + fs and give f. 19076 Express (-1 + 0 + 3)((-2 + 1 - 1)(0z + z + 10z) - 13z + 8z + 39z) in the form d + gz and give g. 24 Rearrange 6 + 18v*3 + 10 - 19v3 + v4 - 2v2 + 17 - 2v*2 to the form j + fv*2 + bv*4 + dv*3 + ov and give d. -1 Express (-2 + 6 + 9k2 - 2)(598k + 519k - 945k) in the form ok*2 + zk + v + sk3 and give s. 1548 Rearrange -106r + 4 - 3r2 + 104r + 58r - 15 to the form t + fr*2 + vr and give v. 56 Rearrange (-5 + 1 + 2)(-21798z - 358041660 + 358041660)(7z - 3z - 2z) to the form w + lz + rz*2 and give r. 87192 Express ((0c + c + c)(2 + 0 + 0) + 0c - 2c + 6c)(-5 + 4 + 5)(19c - 287 + 287) in the form pc*2 + yc + s and give p. 608 Express -1423q - 2741q + 802q - 2496q + 936q in the form jq + f and give j. -4922 Rearrange -4507y - 1317y - 2120y + 1564y to l + cy and give c. -6380 Express -85v - 86v + 242v - 81v - 63 in the form ov + a and give o. -10 Express -4132l + 1248l - 2003l in the form vl + w and give v. -4887 Express 4t + 2t2 - 46 + t3 + t*2 - 2t + 92 - 30 - t*4 as yt*3 + q + vt*2 + rt*4 + ct and give v. 3 Rearrange (-6j3 + 5j*3 + 0j*3)(-44j + 88j - 42j) + 1351j*2 - 1353j*2 + 8 - 2j + 4 - j*4 to aj*4 + ij + pj2 + h + dj*3 and give h. 12 Rearrange -127q + 83q - 1 + 82q + 48q - 5 to y + iq and give i. 86 Express (582 - 50 + 270)(-r - 2r + 8r) as i + wr and give w. 4010 Express (-4 + 0 + 3)(5r - 5r + 2r*3) - 16 - 8850r*3 + 33 - 17 - 6258r*3 in the form sr*2 + fr + wr3 + u and give s. 0 Rearrange -3 + 21k*4 - 1 + k - 10k + 2k3 - 19k*4 - 4k to lk3 + u + hk + fk2 + xk*4 and give u. -4 Express -7j2 + j2 - j*2 + (3 - 4 + 2)(2j2 + 0j + 0j) + 4j*2 + 2j*2 - 3j*2 + (-74 + 74 - 97j)(-2j + 1 - 1) as hj2 + kj + s and give h. 192 Express 15d + d2 - 2d*4 + 100d*3 - 292d*3 + 96d*3 - 43d + 97d3 + 2 as s + pd*3 + jd + md2 + xd*4 and give p. 1 Express (5x - 2x - 4x)(4x - x - 2x) - 2185x*2 + 15336x - 46010x + 15340x - 1 + 15338x in the form vx + p + ox2 and give p. -1 Express (8b - 2b - 3b)((0b - 2b + b)(2 - 5 + 1) + 0b + 4b + 0b + 2b - 3 + 3)(-454b - 1146 + 1146) as a + zb + fb*2 + nb*3 and give n. -10896 Rearrange (-2 + 2 + 2r)(-1623 + 3831 + 3375) + 3r + 3r - 5r to t + cr and give c. 11167 Rearrange (-1188t*4 - 1233t*4 + 850t*4)(-4 - 7 + 4) to the form it2 + ct + u + st4 + dt*3 and give s. 10997 Express (-f + f + f)(-293 - 1514 + 108f - 109f) in the form q + gf2 + jf and give g. -1 Rearrange (5s - 3s + 0s)(2534s2 + 6s*3 - 4s + 4 + 2s - 2528s*2) to the form o + zs*2 + as*4 + cs + us3 and give z. -4 Rearrange 11508v*3 - 544v - 4v2 + 11504v*3 - 23010v*3 to the form ov + w + lv3 + yv*2 and give y. -4 Express -191s - 2 + 652s + 343s + 822s + 490s in the form ms + i and give m. 2116 Express ((4 + 1 + 5)(4 - 3 - 2) - 2 + 3 - 2)(100f + 454f - 9f) in the form i + pf and give p. -5995 Express 37758a + 8 - 37907a + 14a*2 - 15a*2 + (-4a + 3a + 3a)(-2a + 7a - 4a) in the form xa2 + na + s and give s. 8 Express -2x4 - 3x*2 + 3x*3 - 5x*3 + 54211 + x - 54209 in the form mx*4 + wx + ox2 + z + nx3 and give o. -3 Rearrange -u3 + 117u2 + 5u + 178u2 - 15 - 292u*2 to cu + i + hu3 + au*2 and give a. 3 Rearrange 7745l4 - l2 - 4l3 + 2 + 7755l*4 - 15597l*4 to vl + bl4 + n + hl*2 + kl*3 and give b. -97 Rearrange -112 + 845k + 2 - 810k - 103 to d + bk and give d. -213 Rearrange r*2 - 38r*3 + 19r - 5r + 2 + 28r*3 - 2r*4 + 8r*3 to gr*3 + o + ir + xr4 + lr*2 and give g. -2 Express (131j - 914j2 + 57j + 911j2)(2 + 0 - 4) as oj + uj*2 + a and give u. 6 Rearrange -24b + 3b2 + 649 + 689 - 1305 to db*2 + ib + o and give d. 3 Express -2924s2 - s3 - 8569s*2 - 1670s*2 - 2307s*2 - 1514s*2 as ws*3 + hs*2 + as + k and give w. -1 Rearrange 3645 - 4o + 0o + o - 3103 to a + lo and give l. -3 Rearrange -323821y*2 + 8y**3	{ "pile_set_name": "DM Mathematics" }
Employment Maintenance and Intimate Partner Violence. Intimate partner violence (IPV) is a major public health problem in the United States. Negative outcomes of IPV affect women's attainment and maintenance of employment. The purpose of this study was to develop a theoretical framework that described and explained the process by which women who have experienced IPV attain and maintain employment. Grounded theory methodology was used to analyze interviews of 34 women who had experienced IPV. Analysis suggested that women who had experienced IPV could attain employment; however, they had difficulty maintaining employment. Entanglement of work and IPV was experienced by all 34 participants because of the perpetrator controlling their appearance, sabotaging their work, interfering with their work, or controlling their finances. Some women described ways in which they disentangled work from IPV through a dynamic unraveling process, with periods of re-entanglement, resulting in job security and satisfaction.	{ "pile_set_name": "PubMed Abstracts" }
In this episode I expose some troubling connections between the Clintons and key figures in the Obamagate spying scandal. I also address Jeff Sessions’ efforts to investigate spying abuses by the Obama team. Finally, I discuss the positive economic news and what it means for you. Show Notes:	{ "pile_set_name": "OpenWebText2" }
There's a certain tension at the heart of every good theme park. As a park owner, you naturally want your punters to have a good time. But as a currency, smiles and laughter only go so far. At some stage, you're going to need them to open their wallets. "It's like a John Lewis advert, right?" says John Laws, art director at Frontier Developments. "I get the exact same feeling when I see the John Lewis advert at the end of each year: 'Oh, that's really nice production design, better than most other ads'. And ultimately they just want me to spend money. But I don't care, because it's nice to watch." Planet Coaster has been under construction for about a year at Frontier, and it's already nice to watch. It's become a cliché for developers to say they're building a game from the ground up, but in this case it's entirely accurate. Though its foundations are not set in stone; rather, they're in constant motion - when they're not queuing, at any rate. "The people are the beginning of the story, the first piece of the puzzle," says lead technical artist, Sam Denney. "When you open your park, these are the first things that start to move. They're the brains and the lifeblood of the park. They drive everything - you pour them in and off they go." Denney's team have done their homework on the rides, researching classic and modern coasters to get the details right and make them more convincing. This explains why Frontier has opted to focus the game's first developer diary on the technical challenge of creating realistic crowds. The studio's proprietary engine has matured to the stage where it's capable of rendering hundreds of individual characters, each of whom will behave like a human being. They will avoid collisions rather than passing through one another as in many previous sims, naturally forming groups when it makes sense to do so. The goal, says Laws, is to make each punter more believable than any previous coaster game, which Frontier believes is important for a variety of reasons. "Sam's team is working on the rides, and they're beautiful. It might sound like bullshit, but they really are lovely, each one feels solid, like a really heavy metal object. But it's when you put the people on there that they suddenly come to life." He hopes, too, that the effort invested in individualising each visitor will encourage players to care for their well-being, and to fulfil their needs. Whether you're following a family group looking for the kid-friendly attractions, or a thrill-seeking teenager searching for the most intense rides, you'll feel a greater sense of urgency in designing the arteries of the park to guide them there. "They're not just little butterfly particles that are avoiding stuff. They do actually care about what's going on and they do react to what you're doing." It's also about readability - being able to instantly spot a problem without the need to wait for a series of sad-face emoticons telling you what's wrong. "You can [gauge] their behaviours and their emotions," Denney chips in, "whether they're hungry, excited, tired or scared. It's that human element you connect with when you look at the park." At the finest level of detail, Frontier says you'll be able to see the individual motors, pulleys and gears on each ride. If all this is an incentive to shift the camera to ground level more often, Frontier is well aware that most players are likely to spend the vast majority of their time viewing their park from a much higher perspective. "You could say [it's] incredibly wasteful to show these low shots of how the crowd simulation works and watching that granularity when 80% of the game can be spent looking down from above. And yeah, we totally get that - you're going to be building scenery, coasters and amusement rides and you can only really do that from a position where everyone is a tiny little grain on the screen. But because you're aware that each person is an individual that's being tracked, and you get this mental image of who they are and how they emote, when you're placing things down and you see that wave of reaction that makes it more fun for you as a player." There is, adds Denney, a simple voyeuristic appeal to people watching that should, in theory, immerse the player more deeply in the simulation. "We've built our assets to a high level of detail, so when you [zoom in] you can see that we could push into a first-person mode and it would be quite acceptable. It's the reason why I like skeleton watches, because I can see that almost infinite detail - I can get in close and look at all the little mechanisms and appreciate the craftsmanship. I think people really enjoy that level of fidelity and detail." If there's a concern, it's that this apparent focus on the physical simulation could potentially come at the cost of the depth and scope of the game itself. After all, Maxis' 2013 reboot of SimCity drew as much criticism for its mechanical limitations as its litany of technical problems. Though Frontier says it has absorbed lessons and ideas from the likes of Thrillville and last year's Screamride, it's acutely aware that it has a balance to strike between accessibility and complexity. Indeed, the spirit of Planet Coaster hews much closer to the evergreen Rollercoaster Tycoon 3 - and may, in fact, go one step further in terms of systemic depth. Night and the City Chris Donlan plays through L.A. Noire with his dad, who grew up in the city in the 1940s. "Well, we're certainly not planning on dumbing down the design," says Laws. "Quite the opposite," adds Denney, who reveals that many of the original team on Rollercoaster Tycoon 3 are working on Planet Coaster, from designers to artists and coders. If one of the studio's biggest successes (the iOS version continues to sell well) is a strong influence, that isn't to say that the current team accepts that it already has a solid structure for the management elements. "Trying to emulate what's been done previously is no good," says Denney. "What we're trying to do is rebuild from the basic concept of building a park that suits a simulation. Our systems are far more complex than they were in RCT3, because a lot of that stuff wouldn't really fit into the traditional framework. We've reimagined the whole thing." Planet Coaster is being developed primarily for PC, though discussions about other platforms are ongoing. The pair bristle slightly when I observe that its stylised aesthetic could be described as 'console friendly'. "It's far from a console-friendly game," laughs Denney. "I always hate the way the word 'cartoon' is used as a perverse insult half the time," adds Laws, and that 'console friendly' [tends to] mean simplistic. If anybody told me that Mario was a kids' game... my child cries playing Mario. It's a tough game! I mean, Planet Coaster looks immediate, it's got a friendly face. But I don't see that as a problem. Like, when we made LostWinds, we had hard-arse core gamers thanking us. It showed you can present something which is accessible but on a gameplay level is really deep and very detailed. It doesn't follow that it shouldn't be sophisticated." It's clear Frontier is keen to be open and candid as Planet Coaster develops, and we should expect to see more on the management side in upcoming video diaries. But the sense of excitement at the studio is already tangible. Like a good park owner, Frontier naturally wants us to spend money on Planet Coaster. But it's especially keen to ensure its punters are having a great time.	{ "pile_set_name": "OpenWebText2" }
Scitex Vision Scitex Vision was an Israel-based company that specialized in producing equipment for large- and very-large-format printing on both paper and specialty materials. It was part of Scitex Corporation Ltd. The operations of Scitex Vision, together with rights to the name Scitex were acquired by Hewlett-Packard in 2005 (and renamed HP Scitex). History Scitex Vision was incorporated as Idanit Technologies Ltd. on 19 May 1994. It was acquired by Scitex on 25 February 1998 and changed its name to Scitex Wide Format Printing Ltd. on 24 February 1998. In October 1998, its operations were expanded by the purchase of the super-wide format product line of the Matan group of companies. On 21 August 2000, it adopted the name Scitex Vision. In 2003 Scitex Vision Ltd. merged with Aprion Digital Ltd., which was formed in 1999 as a spin-off of Scitex's Advanced Printing Products Division, and developed drop-on-demand inkjet technologies and products. The merger positioned the company as a market leader in the industrial digital printing arena. On February 29, 2008, Hewlett-Packard completed the acquisition of NUR Macroprinters Ltd, another Israeli manufacturer of super-wide format industrial printers. The NUR Macroprinters business was merged into the brands of HP Scitex. Brand name ownership Hewlett-Packard's acquisition of Scitex Vision included also the Scitex brand name rights. Because of this, in January 2006 the Scitex Corporation changed its name to Scailex Corporation. The Scitex brand name is used by Hewlett-Packard for its wide format industrial printers product line. References External links HP Scitex Category:Electronics companies of Israel Category:Hewlett-Packard acquisitions Category:Companies based in Netanya Category:Electronics companies established in 1994 Category:1994 establishments in Israel	{ "pile_set_name": "Wikipedia (en)" }
Image 1 of 6 Mark Cavendish (Omega Pharma-Quick Step) made it three in a row at the Tour of Qatar (Image credit: AFP) Image 2 of 6 Mark Cavendish (Omega Pharma-Quickstep) (Image credit: ASO) Image 3 of 6 Mark Cavendish (Omega Pharma-Quick Step) made it three in a row at the Tour of Qatar (Image credit: AFP) Image 4 of 6 Mark Cavendish (Omega Pharma-Quick Step) wins stage 5 of the Tour of Qatar (Image credit: AFP) Image 5 of 6 Mark Cavendish was all smiles as he pulled on another leader's jersey (Image credit: AFP) Image 6 of 6 Taylor Phinney (BMC) in the white jersey (Image credit: AFP) Mark Cavendish moved a step closer to claiming overall victory at the Tour of Qatar when he reeled off his third win in as many days on stage 5 to Madinat Al Shamal. The Omega Pharma-QuickStep rider saw off the brisk challenge of Yauheni Hutarovich (Ag2r-La Mondiale) to take the bunch sprint and extend his overall lead to 15 seconds ahead of Brent Bookwalter (BMC). After having to fend largely for himself in the final kilometre on the previous two days, Cavendish was able to count on an impeccable lead-out from his Omega Pharma-QuickStep team on this occasion. Dutch champion Niki Terpstra acted as the last man, and performed the unfamiliar role with considerable aplomb, moving aside 250 metres from home for Cavendish to apply the finish. From there, the result was never in doubt. Hutarovich, who surprised Cavendish on the opening road stage of the 2010 Vuelta a España, looked to repeat the feat here, but the Manxman had enough in reserve to kick once more in sight of the line to ensure victory. Aidis Kruopis (Orica-GreenEdge) claimed 3rd ahead of Adam Blythe (BMC), while another Briton, Luke Rowe (Sky) finished 5th. Afterwards, Cavendish was typically fulsome in his praise for his new teammates and he acknowledged their role in helping him overcome the most significant obstacle to his bid to take overall honours in Doha on Friday. “I’ve always had commitment from the guys these last two days, but today they rode like a unit like I know QuickStep can, and I was so proud to be at the back of that,” Cavendish said afterwards. “We knew from last year that if we could get through this stage, we would be in with a very good chance of winning the Tour of Qatar. The guys just stayed there at the front and controlled it, controlled it, controlled it. I had four of five guys surrounding me the whole day, just keeping me sheltered. They’re big guys, I never saw the wind and they just rode perfectly.” Terpstra’s efforts on Cavendish’s behalf were a particular highlight of the finale on three laps of a 13km circuit around the seaside town of Madinat Al Shamal. First, Terpstra set up Cavendish to win the intermediate sprint with 26km to go, and he then latched onto a dangerous move from Taylor Phinney (BMC) and Bernhard Eisel (Sky) which ghosted off the front immediately afterwards. When that trio was swept up with one lap to go, Terpstra duly took up arms once again as part of the Omega Pharma-QuickStep train, and launched Cavendish towards victory in the finishing straight. “He led me out for the first sprint, so I sprinted and then he carried on,” Cavendish said of Terpstra’s policing of the Eisel-Phinney move. “He’s strong like that and he’s up there on GC as well, so we have options.” Fast start Before the start at Al Zubara Fort, Team Sky gathered under a canopy for a tactical briefing from directeur sportif Servais Knaven, and once the flag dropped, the squad was on the offensive in a bid to break Omega Pharma-QuickStep’s stranglehold on the race. Surprisingly, it was Norwegian champion Edvald Boasson Hagen who was the first attacker, bringing Marco Haller (Katusha) clear with him inside 15km. Puffed along by a slight breeze, the pair built up a buffer of 1:30 at one point, but once they turned back into a headwind, their effort petered out and they were reeled in after 45km. Soon afterwards, a five-man move featuring Martin Elmiger (IAM Cycling) was allowed to sally clear, although the pace behind remained high, and the bunch duly fractured into three groups when the race returned to Al Zubara Fort and swung sharp right into a stretch of crosswinds. Although BMC looked to seize the initiative, Cavendish and his phalanx of Omega Pharma-QuickStep footmen were placed safely in the front echelon, and it was clear that the golden jersey would not be changing hands at the day’s end. Undeterred, however, Phinney went on the offensive once again on the finishing circuit, after the break had been reeled in and the peloton had regrouped. Third across the line in the second intermediate sprint with 26km to go, Phinney never sat up and simply powered clear with Eisel and Terpstra for company. The American’s efforts brought their advantage to 30 seconds at one point, before Omega Pharma-QuickStep dutifully shut down the move. “I found a good group going up the road with Eisel and Terpstra, but unfortunately Terpstra wasn't working, which makes sense since his team has the jersey and he's not going to work to put me in the jersey,” Phinney said. “Bernie and I had a go, but we needed a couple of more horse powers. Still, it's better to give it a go rather than just sit back and let Cav take it.” Overall, Cavendish now holds a lead of 15 seconds over Brent Bookwalter (BMC), while Phinney lies a further 5 seconds back in 3rd. Barring disaster, Cavendish is on course to claim the second stage race victory of his career and he explained afterwards that he has been able to rely on some expert advice from the absent Tom Boonen, four times a winner of the race. “I was texting with him last night and he said to just bring it home. I was like, ‘that’s easy for some to say,’” Cavendish smiled. “I was a bit nervous actually but he was giving me tips yesterday.” Full results 1 Mark Cavendish (GBr) Omega Pharma-Quick-Step Cycling Team 3:11:11 2 Yauheni Hutarovich (Blr) Ag2R La Mondiale 3 Aidis Kruopis (Ltu) Orica-GreenEdge 4 Adam Blythe (GBr) BMC Racing Team 5 Luke Rowe (GBr) Sky Procycling 6 John Degenkolb (Ger) Team Argos-Shimano 7 Alexander Kristoff (Nor) Katusha 8 Nacer Bouhanni (Fra) FDJ 9 Heinrich Haussler (Aus) IAM Cycling 10 Roger Kluge (Ger) Team NetApp-Endura 11 Davide Appollonio (Ita) Ag2R La Mondiale 12 Filippo Fortin (Ita) Bardiani Valvole-CSF Inox 13 Sonny Colbrelli (Ita) Bardiani Valvole-CSF Inox 14 Elia Viviani (Ita) Cannondale Pro Cycling 15 Blaz Jarc (Slo) Team NetApp-Endura 16 Jonathan Cantwell (Aus) Team Saxo-Tinkoff 17 Tony Gallopin (Fra) RadioShack Leopard 18 Jens Keukeleire (Bel) Orica-GreenEdge 19 Niki Terpstra (Ned) Omega Pharma-Quick-Step Cycling Team 20 Juan Antonio Flecha Giannoni (Spa) Vacansoleil-DCM Pro Cycling Team 21 Greg Van Avermaet (Bel) BMC Racing Team 22 Bernhard Eisel (Aut) Sky Procycling 23 Jacopo Guarnieri (Ita) Astana Pro Team 24 Baden Cooke (Aus) Orica-GreenEdge 25 Luka Mezgec (Slo) Team Argos-Shimano 26 Andrea Guardini (Ita) Astana Pro Team 27 Dominique Rollin (Can) FDJ 28 Kenny Robert Van Hummel (Ned) Vacansoleil-DCM Pro Cycling Team 29 Marco Canola (Ita) Bardiani Valvole-CSF Inox 30 Tom Veelers (Ned) Team Argos-Shimano 31 Brent Bookwalter (USA) BMC Racing Team 32 Pirmin Lang (Swi) IAM Cycling 33 Valentin Iglinskiy (Kaz) Ag2R La Mondiale 34 Yoann Offredo (Fra) FDJ 35 Murilo Antoniobil Fischer (Bra) FDJ 36 Fabio Sabatini (Ita) Cannondale Pro Cycling 37 Sébastien Hinault (Fra) IAM Cycling 38 Taylor Phinney (USA) BMC Racing Team 39 Michael Schär (Swi) BMC Racing Team 40 Soupe Geoffrey (Fra) FDJ 41 Ramon Sinkeldam (Ned) Team Argos-Shimano 42 Dmitriy Muravyev (Kaz) Astana Pro Team 43 Tiziano Dall’Antonia (Ita) Cannondale Pro Cycling 44 David Boucher (Fra) FDJ 45 Zdenek Stybar (Cze) Omega Pharma-Quick-Step Cycling Team 46 Markus Eichler (Ger) Team NetApp-Endura 47 Zakkari Dempster (Aus) Team NetApp-Endura 48 Kristof Goddaert (Bel) IAM Cycling 49 Geraint Thomas (GBr) Sky Procycling 50 Edvald Boasson Hagen (Nor) Sky Procycling 51 Martin Elmiger (Swi) IAM Cycling 52 Barry Markus (Ned) Vacansoleil-DCM Pro Cycling Team 53 Yuzuru Suzuki (Jpn) Japan 54 Maciej Bodnar (Pol) Cannondale Pro Cycling 55 Kazuhiro Mori (Jpn) Japan 56 Hugo Houle (Can) Ag2R La Mondiale 57 Alexander Porsev (Rus) Katusha 58 Gatis Smukulis (Lat) Katusha 59 Jonas Aaen Jorgensen (Den) Team Saxo-Tinkoff 60 Ian Stannard (GBr) Sky Procycling 61 Gregory Rast (Swi) RadioShack Leopard 62 Gabriel Rasch (Nor) Sky Procycling 63 Roy Curvers (Ned) Team Argos-Shimano 64 Pengda Jiao (Chn) Champion System Pro Cycling Team 65 Andriy Grivko (Ukr) Astana Pro Team 66 Kristijan Koren (Slo) Cannondale Pro Cycling 67 Yaroslav Popovych (Ukr) RadioShack Leopard 68 Taiji Nishitani (Jpn) Japan 69 Guillaume Boivin (Can) Cannondale Pro Cycling 70 Yannick Eijssen (Bel) BMC Racing Team 71 Matthieu Ladagnous (Fra) FDJ 72 Fumeaux Jonathan (Swi) IAM Cycling 73 Reto Hollenstein (Swi) IAM Cycling 74 Dmitriy Gruzdev (Kaz) Astana Pro Team 75 Marco Haller (Aut) Katusha 76 Markel Irizar (Spa) RadioShack Leopard 77 Paul Voss (Ger) Team NetApp-Endura 78 Lawrence Warbasse (USA) BMC Racing Team 79 Marco Bandiera (Ita) IAM Cycling 80 Pavel Brutt (Rus) Katusha 81 Chan Jae Jang (Kor) Champion System Pro Cycling Team 0:00:13 82 Stijn Vandenbergh (Bel) Omega Pharma-Quick-Step Cycling Team 83 Guillaume Van Keirsbulck (Bel) Omega Pharma-Quick-Step Cycling Team 84 Vladimir Isaichev (Rus) Katusha 85 Matteo Trentin (Ita) Omega Pharma-Quick-Step Cycling Team 86 Matthias Friedemann (Ger) Champion System Pro Cycling Team 87 Nikias Arndt (Ger) Team Argos-Shimano 88 Fumiyuki Beppu (Jpn) Orica-GreenEdge 89 Rob Ruijgh (Ned) Vacansoleil-DCM Pro Cycling Team 90 Johan Le Bon (Fra) FDJ 91 Jens Mouris (Ned) Orica-GreenEdge 92 Anders Lund (Den) Team Saxo-Tinkoff 93 Julien Berard (Fra) Ag2R La Mondiale 94 Sergey Lagutin (Uzb) Vacansoleil-DCM Pro Cycling Team 95 Arman Kamyshev (Kaz) Astana Pro Team 96 Junya Sano (Jpn) Japan 97 Russell Downing (GBr) Team NetApp-Endura 0:00:21 98 Wouter Mol (Ned) Vacansoleil-DCM Pro Cycling Team 0:00:23 99 Andrea Pasqualon (Ita) Bardiani Valvole-CSF Inox 100 Yusuke Hatanaka (Jpn) Japan 0:00:27 101 Christian Delle Stelle (Ita) Bardiani Valvole-CSF Inox 0:00:31 102 Marko Kump (Slo) Team Saxo-Tinkoff 0:00:37 103 Sébastien Minard (Fra) Ag2R La Mondiale 104 Martin Velits (Svk) Omega Pharma-Quick-Step Cycling Team 105 Marco Coledan (Ita) Bardiani Valvole-CSF Inox 106 Steve Chainel (Fra) Ag2R La Mondiale 107 Andrea Di Corrado (Ita) Bardiani Valvole-CSF Inox 108 Matti Breschel (Den) Team Saxo-Tinkoff 109 Matt Brammeier (Irl) Champion System Pro Cycling Team 110 Stephen Cummings (GBr) BMC Racing Team 0:00:47 111 Matteo Tosatto (Ita) Team Saxo-Tinkoff 112 Brett Daniel Lancaster (Aus) Orica-GreenEdge 113 Daniele Bennati (Ita) Team Saxo-Tinkoff 0:00:50 114 Muhamad Adiq Husainie Othman (Mas) Champion System Pro Cycling Team 115 Chun Kai Feng (Chn) Champion System Pro Cycling Team 116 Christopher Sutton (Aus) Sky Procycling 0:00:57 117 Hayden Roulston (NZl) RadioShack Leopard 118 Tom Stamsnijder (Ned) Team Argos-Shimano 119 Wesley Kreder (Ned) Vacansoleil-DCM Pro Cycling Team 120 Nelson Santos Oliveira (Por) RadioShack Leopard 121 Kohei Uchima (Jpn) Japan 122 Evan Huffman (USA) Astana Pro Team 0:00:59 123 Rüdiger Selig (Ger) Katusha 124 Borut Bozic (Slo) Astana Pro Team 0:01:02 125 Iljo Keisse (Bel) Omega Pharma-Quick-Step Cycling Team 0:01:22 126 Daniele Ratto (Ita) Cannondale Pro Cycling 0:01:28 127 Marco Marcato (Ita) Vacansoleil-DCM Pro Cycling Team 128 Stijn Devolder (Bel) RadioShack Leopard 0:01:36 129 Aliaksandr Kuchynski (Blr) Katusha 130 Allan Davis (Aus) Orica-GreenEdge 131 Fabian Cancellara (Swi) RadioShack Leopard 132 Daniel Schorn (Aut) Team NetApp-Endura 133 Andreas Schillinger (Ger) Team NetApp-Endura 134 Gediminas Bagdonas (Ltu) Ag2R La Mondiale 0:02:09 135 Bobbie Traksel (Ned) Champion System Pro Cycling Team 136 Alessandro De Marchi (Ita) Cannondale Pro Cycling 0:02:26 DNS Miyataka Shimizu (Jpn) Japan DNS Koen De Kort (Ned) Argos-Shimano DNS Mathew Hayman (Aus) Sky Procycling Sprint 1 - Al Zubara 1 Martin Elmiger (Swi) IAM Cycling 3 pts 2 Andrea Di Corrado (Ita) Bardiani Valvole-CSF Inox 2 3 Sergey Lagutin (Uzb) Vacansoleil-DCM Pro Cycling Team 1 Sprint 2 - Madinat Al Shamal (1st crossing) 1 Mark Cavendish (GBr) Omega Pharma-Quick-Step Cycling Team 3 pts 2 Bernhard Eisel (Aut) Sky Procycling 2 3 Taylor Phinney (USA) BMC Racing Team 1 Points - Madinat Al Shamal 1 Mark Cavendish (GBr) Omega Pharma-Quick-Step Cycling Team 15 pts 2 Yauheni Hutarovich (Blr) Ag2R La Mondiale 12 3 Aidis Kruopis (Ltu) Orica-GreenEdge 9 4 Adam Blythe (GBr) BMC Racing Team 7 5 Luke Rowe (GBr) Sky Procycling 6 6 John Degenkolb (Ger) Team Argos-Shimano 5 7 Alexander Kristoff (Nor) Katusha 4 8 Nacer Bouhanni (Fra) FDJ 3 9 Heinrich Haussler (Aus) IAM Cycling 2 10 Roger Kluge (Ger) Team NetApp-Endura 1 Young riders 1 Adam Blythe (GBr) BMC Racing Team 3:11:11 2 Luke Rowe (GBr) Sky Procycling 3 John Degenkolb (Ger) Team Argos-Shimano 4 Nacer Bouhanni (Fra) FDJ 5 Davide Appollonio (Ita) Ag2R La Mondiale 6 Filippo Fortin (Ita) Bardiani Valvole-CSF Inox 7 Sonny Colbrelli (Ita) Bardiani Valvole-CSF Inox 8 Elia Viviani (Ita) Cannondale Pro Cycling 9 Blaz Jarc (Slo) Team NetApp-Endura 10 Tony Gallopin (Fra) RadioShack Leopard 11 Jens Keukeleire (Bel) Orica-GreenEdge 12 Luka Mezgec (Slo) Team Argos-Shimano 13 Andrea Guardini (Ita) Astana Pro Team 14 Marco Canola (Ita) Bardiani Valvole-CSF Inox 15 Taylor Phinney (USA) BMC Racing Team 16 Soupe Geoffrey (Fra) FDJ 17 Ramon Sinkeldam (Ned) Team Argos-Shimano 18 Barry Markus (Ned) Vacansoleil-DCM Pro Cycling Team 19 Hugo Houle (Can) Ag2R La Mondiale 20 Guillaume Boivin (Can) Cannondale Pro Cycling 21 Yannick Eijssen (Bel) BMC Racing Team 22 Fumeaux Jonathan (Swi) IAM Cycling 23 Marco Haller (Aut) Katusha 24 Lawrence Warbasse (USA) BMC Racing Team 25 Chan Jae Jang (Kor) Champion System Pro Cycling Team 0:00:13 26 Guillaume Van Keirsbulck (Bel) Omega Pharma-Quick-Step Cycling Team 27 Matteo Trentin (Ita) Omega Pharma-Quick-Step Cycling Team 28 Nikias Arndt (Ger) Team Argos-Shimano 29 Johan Le Bon (Fra) FDJ 30 Arman Kamyshev (Kaz) Astana Pro Team 31 Andrea Pasqualon (Ita) Bardiani Valvole-CSF Inox 0:00:23 32 Christian Delle Stelle (Ita) Bardiani Valvole-CSF Inox 0:00:31 33 Marko Kump (Slo) Team Saxo-Tinkoff 0:00:37 34 Marco Coledan (Ita) Bardiani Valvole-CSF Inox 35 Andrea Di Corrado (Ita) Bardiani Valvole-CSF Inox 36 Muhamad Adiq Husainie Othman (Mas) Champion System Pro Cycling Team 0:00:50 37 Chun Kai Feng (Chn) Champion System Pro Cycling Team 38 Wesley Kreder (Ned) Vacansoleil-DCM Pro Cycling Team 0:00:57 39 Nelson Santos Oliveira (Por) RadioShack Leopard 40 Kohei Uchima (Jpn) Japan 41 Evan Huffman (USA) Astana Pro Team 0:00:59 42 Rüdiger Selig (Ger) Katusha 43 Daniele Ratto (Ita) Cannondale Pro Cycling 0:01:28 44 Daniel Schorn (Aut) Team NetApp-Endura 0:01:36 Teams 1 Orica Greenedge 9:33:33 2 Ag2R La Mondiale 3 Bardiani Valvole-Csf Inox 4 Bmc Racing Team 5 Team Argos-Shimano 6 Omega Pharma-Quick Step 7 Fdj 8 Team Netapp-Endura 9 Sky Procycling 10 Iam Cycling 11 Astana Pro Team 12 Cannondale 13 Vacansoleil-Dcm 14 Katusha Team 15 Radioshack Leopard 16 Japan 17 Team Saxo-Tinkoff 0:00:13 18 Champion System 0:00:26 General classification after stage 5 1 Mark Cavendish (GBr) Omega Pharma-Quick-Step Cycling Team 13:30:59 2 Brent Bookwalter (USA) BMC Racing Team 0:00:15 3 Taylor Phinney (USA) BMC Racing Team 0:00:20 4 Adam Blythe (GBr) BMC Racing Team 0:00:22 5 Bernhard Eisel (Aut) Sky Procycling 0:00:24 6 Greg Van Avermaet (Bel) BMC Racing Team 0:00:25 7 Michael Schär (Swi) BMC Racing Team 8 Edvald Boasson Hagen (Nor) Sky Procycling 0:00:29 9 Luke Rowe (GBr) Sky Procycling 0:00:30 10 Geraint Thomas (GBr) Sky Procycling 11 Niki Terpstra (Ned) Omega Pharma-Quick-Step Cycling Team 0:00:35 12 Zdenek Stybar (Cze) Omega Pharma-Quick-Step Cycling Team 13 Tony Gallopin (Fra) RadioShack Leopard 0:00:36 14 Alexander Kristoff (Nor) Katusha 0:00:38 15 Aidis Kruopis (Ltu) Orica-GreenEdge 0:00:40 16 Marco Haller (Aut) Katusha 17 Alexander Porsev (Rus) Katusha 18 Jacopo Guarnieri (Ita) Astana Pro Team 0:00:42 19 Andriy Grivko (Ukr) Astana Pro Team 0:00:47 20 Baden Cooke (Aus) Orica-GreenEdge 0:00:48 21 Jens Keukeleire (Bel) Orica-GreenEdge 22 Matthieu Ladagnous (Fra) FDJ 23 Elia Viviani (Ita) Cannondale Pro Cycling 0:00:49 24 Tiziano Dall’Antonia (Ita) Cannondale Pro Cycling 25 Jonas Aaen Jorgensen (Den) Team Saxo-Tinkoff 0:00:51 26 Ian Stannard (GBr) Sky Procycling 27 John Degenkolb (Ger) Team Argos-Shimano 0:00:53 28 Martin Elmiger (Swi) IAM Cycling 29 Dominique Rollin (Can) FDJ 0:00:54 30 Tom Veelers (Ned) Team Argos-Shimano 0:00:55 31 Yoann Offredo (Fra) FDJ 0:00:57 32 Markel Irizar (Spa) RadioShack Leopard 33 Roger Kluge (Ger) Team NetApp-Endura 0:00:58 34 Gatis Smukulis (Lat) Katusha 35 Heinrich Haussler (Aus) IAM Cycling 0:01:02 36 Paul Voss (Ger) Team NetApp-Endura 0:01:09 37 Stijn Vandenbergh (Bel) Omega Pharma-Quick-Step Cycling Team 38 Reto Hollenstein (Swi) IAM Cycling 0:01:13 39 Juan Antonio Flecha Giannoni (Spa) Vacansoleil-DCM Pro Cycling Team 0:01:16 40 Roy Curvers (Ned) Team Argos-Shimano 41 Guillaume Van Keirsbulck (Bel) Omega Pharma-Quick-Step Cycling Team 0:01:21 42 Matti Breschel (Den) Team Saxo-Tinkoff 0:01:28 43 Rob Ruijgh (Ned) Vacansoleil-DCM Pro Cycling Team 0:01:29 44 Kenny Robert Van Hummel (Ned) Vacansoleil-DCM Pro Cycling Team 0:01:36 45 Yaroslav Popovych (Ukr) RadioShack Leopard 0:01:38 46 Gregory Rast (Swi) RadioShack Leopard 0:01:47 47 Zakkari Dempster (Aus) Team NetApp-Endura 0:01:51 48 Murilo Antoniobil Fischer (Bra) FDJ 0:02:00 49 Sergey Lagutin (Uzb) Vacansoleil-DCM Pro Cycling Team 0:02:01 50 Daniele Bennati (Ita) Team Saxo-Tinkoff 0:02:02 51 Matteo Tosatto (Ita) Team Saxo-Tinkoff 0:02:20 52 Matt Brammeier (Irl) Champion System Pro Cycling Team 0:02:29 53 Sébastien Minard (Fra) Ag2R La Mondiale 54 Pavel Brutt (Rus) Katusha 0:02:34 55 Sébastien Hinault (Fra) IAM Cycling 0:02:35 56 Ramon Sinkeldam (Ned) Team Argos-Shimano 0:02:42 57 Johan Le Bon (Fra) FDJ 0:02:43 58 Yauheni Hutarovich (Blr) Ag2R La Mondiale 0:03:04 59 Gabriel Rasch (Nor) Sky Procycling 0:03:07 60 Martin Velits (Svk) Omega Pharma-Quick-Step Cycling Team 0:03:12 61 Dmitriy Muravyev (Kaz) Astana Pro Team 0:03:32 62 Fabian Cancellara (Swi) RadioShack Leopard 63 Iljo Keisse (Bel) Omega Pharma-Quick-Step Cycling Team 0:03:41 64 Nikias Arndt (Ger) Team Argos-Shimano 0:03:53 65 Pirmin Lang (Swi) IAM Cycling 0:05:11 66 Andreas Schillinger (Ger) Team NetApp-Endura 0:05:12 67 Rüdiger Selig (Ger) Katusha 0:05:21 68 Daniel Schorn (Aut) Team NetApp-Endura 0:05:49 69 Tom Stamsnijder (Ned) Team Argos-Shimano 0:08:27 70 Steve Chainel (Fra) Ag2R La Mondiale 0:09:15 71 Soupe Geoffrey (Fra) FDJ 0:16:50 72 Andrea Guardini (Ita) Astana Pro Team 0:16:57 73 Maciej Bodnar (Pol) Cannondale Pro Cycling 0:16:59 74 Lawrence Warbasse (USA) BMC Racing Team 75 Blaz Jarc (Slo) Team NetApp-Endura 0:17:00 76 Davide Appollonio (Ita) Ag2R La Mondiale 77 Jens Mouris (Ned) Orica-GreenEdge 0:17:03 78 Fumiyuki Beppu (Jpn) Orica-GreenEdge 79 Kristof Goddaert (Bel) IAM Cycling 0:17:04 80 Barry Markus (Ned) Vacansoleil-DCM Pro Cycling Team 0:17:06 81 Yannick Eijssen (Bel) BMC Racing Team 82 Nacer Bouhanni (Fra) FDJ 0:17:10 83 Fabio Sabatini (Ita) Cannondale Pro Cycling 0:17:21 84 Luka Mezgec (Slo) Team Argos-Shimano 0:17:24 85 Filippo Fortin (Ita) Bardiani Valvole-CSF Inox 0:17:26 86 Marco Canola (Ita) Bardiani Valvole-CSF Inox 87 Sonny Colbrelli (Ita) Bardiani Valvole-CSF Inox 0:17:49 88 Andrea Pasqualon (Ita) Bardiani Valvole-CSF Inox 89 Russell Downing (GBr) Team NetApp-Endura 0:17:50 90 Chan Jae Jang (Kor) Champion System Pro Cycling Team 0:17:54 91 Kristijan Koren (Slo) Cannondale Pro Cycling 0:17:58 92 David Boucher (Fra) FDJ 0:18:02 93 Marco Coledan (Ita) Bardiani Valvole-CSF Inox 0:18:03 94 Markus Eichler (Ger) Team NetApp-Endura 0:18:12 95 Nelson Santos Oliveira (Por) RadioShack Leopard 96 Stijn Devolder (Bel) RadioShack Leopard 0:18:14 97 Taiji Nishitani (Jpn) Japan 0:18:15 98 Kazuhiro Mori (Jpn) Japan 99 Wouter Mol (Ned) Vacansoleil-DCM Pro Cycling Team 0:18:23 100 Wesley Kreder (Ned) Vacansoleil-DCM Pro Cycling Team 101 Pengda Jiao (Chn) Champion System Pro Cycling Team 0:18:25 102 Marco Bandiera (Ita) IAM Cycling 103 Valentin Iglinskiy (Kaz) Ag2R La Mondiale 0:18:29 104 Matthias Friedemann (Ger) Champion System Pro Cycling Team 105 Yuzuru Suzuki (Jpn) Japan 0:18:30 106 Arman Kamyshev (Kaz) Astana Pro Team 0:18:33 107 Hayden Roulston (NZl) RadioShack Leopard 0:18:50 108 Matteo Trentin (Ita) Omega Pharma-Quick-Step Cycling Team 0:18:52 109 Chun Kai Feng (Chn) Champion System Pro Cycling Team 0:19:05 110 Gediminas Bagdonas (Ltu) Ag2R La Mondiale 0:19:09 111 Hugo Houle (Can) Ag2R La Mondiale 0:19:12 112 Vladimir Isaichev (Rus) Katusha 113 Yusuke Hatanaka (Jpn) Japan 0:19:14 114 Guillaume Boivin (Can) Cannondale Pro Cycling 0:19:20 115 Andrea Di Corrado (Ita) Bardiani Valvole-CSF Inox 0:19:22 116 Dmitriy Gruzdev (Kaz) Astana Pro Team 0:19:29 117 Daniele Ratto (Ita) Cannondale Pro Cycling 0:19:31 118 Junya Sano (Jpn) Japan 0:19:33 119 Borut Bozic (Slo) Astana Pro Team 0:19:41 120 Fumeaux Jonathan (Swi) IAM Cycling 0:19:43 121 Brett Daniel Lancaster (Aus) Orica-GreenEdge 0:19:48 122 Bobbie Traksel (Ned) Champion System Pro Cycling Team 0:19:52 123 Muhamad Adiq Husainie Othman (Mas) Champion System Pro Cycling Team 0:20:05 124 Christian Delle Stelle (Ita) Bardiani Valvole-CSF Inox 0:20:10 125 Jonathan Cantwell (Aus) Team Saxo-Tinkoff 126 Stephen Cummings (GBr) BMC Racing Team 0:20:29 127 Kohei Uchima (Jpn) Japan 0:20:31 128 Marko Kump (Slo) Team Saxo-Tinkoff 0:20:32 129 Anders Lund (Den) Team Saxo-Tinkoff 0:20:53 130 Evan Huffman (USA) Astana Pro Team 0:21:53 131 Aliaksandr Kuchynski (Blr) Katusha 0:22:17 132 Allan Davis (Aus) Orica-GreenEdge 0:23:05 133 Marco Marcato (Ita) Vacansoleil-DCM Pro Cycling Team 0:23:37 134 Julien Berard (Fra) Ag2R La Mondiale 0:23:39 135 Christopher Sutton (Aus) Sky Procycling 0:24:46 136 Alessandro De Marchi (Ita) Cannondale Pro Cycling 0:24:53 Points classification 1 Mark Cavendish (GBr) Omega Pharma-Quick-Step Cycling Team 55 pts 2 Barry Markus (Ned) Vacansoleil-DCM Pro Cycling Team 24 3 Aidis Kruopis (Ltu) Orica-GreenEdge 21 4 Brent Bookwalter (USA) BMC Racing Team 15 5 Martin Elmiger (Swi) IAM Cycling 15 6 Nacer Bouhanni (Fra) FDJ 14 7 Bernhard Eisel (Aut) Sky Procycling 13 8 Alexander Kristoff (Nor) Katusha 12 9 Yauheni Hutarovich (Blr) Ag2R La Mondiale 12 10 Adam Blythe (GBr) BMC Racing Team 10 11 John Degenkolb (Ger) Team Argos-Shimano 10 12 Heinrich Haussler (Aus) IAM Cycling 10 13 Gregory Rast (Swi) RadioShack Leopard 9 14 Andrea Guardini (Ita) Astana Pro Team 9 15 Filippo Fortin (Ita) Bardiani Valvole-CSF Inox 9 16 Taylor Phinney (USA) BMC Racing Team 8 17 Edvald Boasson Hagen (Nor) Sky Procycling 8 18 Andriy Grivko (Ukr) Astana Pro Team 6 19 Luke Rowe (GBr) Sky Procycling 6 20 Elia Viviani (Ita) Cannondale Pro Cycling 6 21 Roger Kluge (Ger) Team NetApp-Endura 5 22 Jonathan Cantwell (Aus) Team Saxo-Tinkoff 5 23 Matti Breschel (Den) Team Saxo-Tinkoff 4 24 Gatis Smukulis (Lat) Katusha 3 25 Pirmin Lang (Swi) IAM Cycling 3 26 Chan Jae Jang (Kor) Champion System Pro Cycling Team 2 27 Andrea Di Corrado (Ita) Bardiani Valvole-CSF Inox 2 28 Matthieu Ladagnous (Fra) FDJ 1 29 Sergey Lagutin (Uzb) Vacansoleil-DCM Pro Cycling Team 1 30 Soupe Geoffrey (Fra) FDJ 1 31 Davide Appollonio (Ita) Ag2R La Mondiale 1 32 Dmitriy Gruzdev (Kaz) Astana Pro Team 1 Young rider classification 1 Taylor Phinney (USA) BMC Racing Team 13:31:19 2 Adam Blythe (GBr) BMC Racing Team 0:00:02 3 Luke Rowe (GBr) Sky Procycling 0:00:10 4 Tony Gallopin (Fra) RadioShack Leopard 0:00:16 5 Marco Haller (Aut) Katusha 0:00:20 6 Jens Keukeleire (Bel) Orica-GreenEdge 0:00:28 7 Elia Viviani (Ita) Cannondale Pro Cycling 0:00:29 8 John Degenkolb (Ger) Team Argos-Shimano 0:00:33 9 Guillaume Van Keirsbulck (Bel) Omega Pharma-Quick-Step Cycling Team 0:01:01 10 Ramon Sinkeldam (Ned) Team Argos-Shimano 0:02:22 11 Johan Le Bon (Fra) FDJ 0:02:23 12 Nikias Arndt (Ger) Team Argos-Shimano 0:03:33 13 Rüdiger Selig (Ger) Katusha 0:05:01 14 Daniel Schorn (Aut) Team NetApp-Endura 0:05:29 15 Soupe Geoffrey (Fra) FDJ 0:16:30 16 Andrea Guardini (Ita) Astana Pro Team 0:16:37 17 Lawrence Warbasse (USA) BMC Racing Team 0:16:39 18 Blaz Jarc (Slo) Team NetApp-Endura 0:16:40 19 Davide Appollonio (Ita) Ag2R La Mondiale 20 Barry Markus (Ned) Vacansoleil-DCM Pro Cycling Team 0:16:46 21 Yannick Eijssen (Bel) BMC Racing Team 22 Nacer Bouhanni (Fra) FDJ 0:16:50 23 Luka Mezgec (Slo) Team Argos-Shimano 0:17:04 24 Filippo Fortin (Ita) Bardiani Valvole-CSF Inox 0:17:06 25 Marco Canola (Ita) Bardiani Valvole-CSF Inox 26 Sonny Colbrelli (Ita) Bardiani Valvole-CSF Inox 0:17:29 27 Andrea Pasqualon (Ita) Bardiani Valvole-CSF Inox 28 Chan Jae Jang (Kor) Champion System Pro Cycling Team 0:17:34 29 Marco Coledan (Ita) Bardiani Valvole-CSF Inox 0:17:43 30 Nelson Santos Oliveira (Por) RadioShack Leopard 0:17:52 31 Wesley Kreder (Ned) Vacansoleil-DCM Pro Cycling Team 0:18:03 32 Arman Kamyshev (Kaz) Astana Pro Team 0:18:13 33 Matteo Trentin (Ita) Omega Pharma-Quick-Step Cycling Team 0:18:32 34 Chun Kai Feng (Chn) Champion System Pro Cycling Team 0:18:45 35 Hugo Houle (Can) Ag2R La Mondiale 0:18:52 36 Guillaume Boivin (Can) Cannondale Pro Cycling 0:19:00 37 Andrea Di Corrado (Ita) Bardiani Valvole-CSF Inox 0:19:02 38 Daniele Ratto (Ita) Cannondale Pro Cycling 0:19:11 39 Fumeaux Jonathan (Swi) IAM Cycling 0:19:23 40 Muhamad Adiq Husainie Othman (Mas) Champion System Pro Cycling Team 0:19:45 41 Christian Delle Stelle (Ita) Bardiani Valvole-CSF Inox 0:19:50 42 Kohei Uchima (Jpn) Japan 0:20:11 43 Marko Kump (Slo) Team Saxo-Tinkoff 0:20:12 44 Evan Huffman (USA) Astana Pro Team 0:21:33	{ "pile_set_name": "OpenWebText2" }
La Crosse Dating for the La Crosse Single Meet thousands of La Crosse singles through one of the best La Crosse online dating sites. Matchmaker.com has great instant messenger and live video La Crosse chat service for our members. La Crosse dating has never been easier with our show interest feature that will allow you to break the ice with attractive local singles. Matchmaker.com has some great services for La Crosse singles looking for a longer term relationship. Besides our great La Crosse chat product with live video matchmaker users can send email messages to people in the area. The La Crosse dating scene can be hard to find the right person at times; however, we are here to help and our La Crosse online dating service is free to register. Looking For Something New - So let me start out by saying that i am an intellegent well spoken educated women. I am someone who is laid back & loves life and plans on living life to the fullest. My family and friends are the most important to me. I speak my mind, i don't play games. Im someone who will cook dinner and let you more tall, handsome... not dark - I'm a music lover. very laid back. adventurous. disease free... except I have jungle fever!!!! haha. I like to think that i have a good sense of humor. others may not. i like to attend concerts, camp, kayak, and travel. im in a band, mike golden and friends. i dont know what else to say. ive got mor more I am an independent person and loves to have mature (except politics) or silly conversations. I enjoy doing different fun things, like traveling and hanging out in different spots around town. I don't like ignorant and immature people. I am shy but once I am comfortable around someone, I can be a ve more looking for friend and maybe m - name is ben 24 and im looking for someone who likes me for who i am and doesnt care about looks but i care about looks a little. i love sports movies and music dont drive and have a mental disability. its all about inside that counts and im looking for friends maybe more later and just to have fun. more Easy going very honest and open person very committed n dont believe n cheating im too old for games n dont like my time wasted bisexual so like females as well luv my kids n my family always comes first im a nurse and enjoy helping others. About me? I am a lover? I love to complement things even if u'r a good looking guy. I'd say hey! what's up pretty boy! LOL I'm not gay. I just have to clear that. We guys know who is good looking or not we just don't want to say it because a lot of us are Showoff...Hehe... We don't want to compar more Hello - Well am new to this online dating stuff an am honest, caring, faithful, passionate, I'm a very easy going person, doesn't take much to please me, I prefer the simple things in life. Having fun with someone I care about, friend.I've always want to take good care of my love and have a good relationshi more II am a young man that is down to Earth and have the flexibility to communicate with anyone. Because of my background and past experiences, I place a high importance on education. I believe that education allows an individual to discover their desire to impact society. Because I come from a family w more Looking for THE ONE - Well, im very straight forward. I value my time, so I dont like to waste it. Im very hard working and like to be kept occupied, but at the same time Im always a fun person to be around with, I personally think I have a good sense of humor and am very playful. Im 25, and am currently a Personal Ban more Looking - I run a successful painting business. I work extremely a lot of hours because I have a goal that I'm aiming for but I'm looking for someone that's like to travel , Funny, likes to be active, Caring and a lot other things. I know I'm picky Try our La Crosse dating service today. Matchmaker.com is one of the oldest La Crosse online dating services on the Internet and has brought thousands of couples together from the area. Test drive our La Crosse Chat room with one of the best online communities for the La Crosse single person. Also, keep in mind that we have a huge member base of La Crosse singles and that we also cater to members of the many backgrounds. Still not convinced that matchmaker is the free La Crosse dating service for you? Once you've filled out the quick registration process you will be to see full size photos and profiles of thousands of La Crosse singles. Did you know that free La Crosse dating is a few clicks away? Find love and romance in La Crosse at matchmaker today!	{ "pile_set_name": "Pile-CC" }
Rosie Huntington-Whiteley in Transformers: Dark of the Moon. Photo: Paramount Pictures When you’re creating a female character for your film, you’ve got a lot of choices. For instance, do you make her a lithe, leggy blonde — or a lithe, leggy brunette? That’s a joke, but it’s also not really a joke, as producer Ross Putman’s new Twitter account @femscriptintros attests. The account tweets out horrible character descriptions of the female leads in movie scripts Putman reads, in which the women are described as sexual props first, and actual interesting characters second. (For privacy’s sake, he changes every name to “Jane.”) Read some of the lowlights below, just as soon as you get done dancing naked on your bed. You know, for fun. JANE stands next to it (30's) dressed in a paramedic's uniform - blonde, fit, smokin' hot. — Ross Putman (@femscriptintros) February 10, 2016 A gorgeous woman, JANE, 23, is a little tipsy, dancing naked on her big bed, as adorable as she is sexy. *BONUS PTS FOR BEING THE 1ST LINE — Ross Putman (@femscriptintros) February 10, 2016 All heads turn to find JANE (28) in the doorway: stunning and trying her best to hide it. — Ross Putman (@femscriptintros) February 10, 2016 Behind a steamy shower door is the indistinguishable but sexy silhouette of JANE showering. — Ross Putman (@femscriptintros) February 10, 2016 This is JANE. She’s lithe, leggy, spirited, outgoing, not afraid to speak her mind, with a sense of humor as dry as the Sonoran Desert. — Ross Putman (@femscriptintros) February 10, 2016 His wife JANE is making dinner and watching CNN on a small TV. She was model pretty once, but living an actual life has taken its toll. — Ross Putman (@femscriptintros) February 10, 2016 JANE (late 20s) sits hunched over a microscope. She’s attractive, but too much of a professional to care about her appearance. — Ross Putman (@femscriptintros) February 10, 2016 She turns and we see her face for the first time. This is the very beautiful, very troubled JANE. — Ross Putman (@femscriptintros) February 10, 2016	{ "pile_set_name": "OpenWebText2" }
; RUN: not llvm-as < %s -disable-output 2>&1 \| FileCheck %s ; CHECK-NOT: error: !0 = !GenericDINode(tag: 65535) ; CHECK: <stdin>:[[@LINE+1]]:26: error: value for 'tag' too large, limit is 65535 !1 = !GenericDINode(tag: 65536)	{ "pile_set_name": "Github" }
[Unit] Description=Web2py daemon After=network.target [Service] Type=simple ExecStart=/var/www/web2py/web2py.py --nogui -a '<recycle>' -i 0.0.0.0 -p 8000 User=www-data [Install] WantedBy=multi-user.target	{ "pile_set_name": "Github" }
Oznámenie predsedníctva Predseda Dámy a páni, chcel by som predniesť nasledujúce oznámenie. Keďže sa dnes počas hlasovania konal nácvik evakuácie, všetky vysvetlenia pozícií prijatých na dnešnom hlasovaní budú vypočuté zajtra - budú vypočuté spolu so zajtrajšími vysvetleniami hlasovania. Zajtra ukončíme aj hlasovanie, ktoré bolo naplánované na dnes, ale nekonalo sa. Týka sa to prebiehajúceho hlasovania, ktoré bolo prerušené a v ktorom budeme pokračovať presne od bodu prerušenia, aby sme zachovali úplnú kontinuitu.	{ "pile_set_name": "EuroParl" }
The Many Benefits of Replacing Coal With Wood Pellet Fuel Electricity generated from pellets in converted coal plants is almost the same cost as electricity generated from natural gas, by far the cheapest way to make new, low-carbon power. By William Strauss \| August 12, 2014 ADVERTISEMENT Use of fossil fuels is driving a rapid increase in the concentrations of CO2 in the atmosphere and oceans. The combustion of coal, petroleum products and natural gas, as well as land use changes are, in a matter of a few centuries, releasing carbon that was captured over hundreds of millions of years. There is overwhelming consensus that if we are to mitigate the impacts of increasing CO2 concentrations, we need to change how we create energy. But there is also fear that in doing so we will inhibit economic growth and harm business. There is a simple and ready-to-deploy way of mitigating carbon from power generation that is good for growth and business. It is by converting older coal power plants to wood pellets. The cost of power from the converted plants is about the same as power generated from natural gas, and the strategy results in creating, rather than destroying, jobs. As a bonus, the strategy also provides a motivation to sustain and expand our working forests. One might think that there is no way that using wood pellets for fuel in a power plant can compete with fossil fuels. That would be true if the cost of the fuel were the only input to the total cost of generation. If only fuel cost mattered, utility-scale wind and solar power would be free, and nuclear power would be cheap. There are four key components to the equation that calculates the total cost of generation: repayment of the capital cost to build the plant, the fixed and variable operation and maintenance (O&M) costs, the fuel cost, and the plant’s capacity factor. For nuclear plants, there is a fifth component: decommissioning costs. The capacity factor is a ratio of how much power the plant actually generates versus what it could generate if it ran at 100 percent output every day of the year. Capacity factor matters because the cost of each megawatt-hour generated has to contain a portion of the repayment of the capital cost. Lower capacity factors, such as those for wind and solar, put a higher capital cost repayment burden on each megawatt-hour. Conversion of a pulverized coal plant to a pulverized wood pellet plant is relatively straightforward. Coal plants grind the coal into dust and then pneumatically transport that dust to wall-mounted burners in the boiler. The coal dust combusts very rapidly; almost like a liquid fuel. Grinding pellets into dust and using them in essentially the same hardware has been proven to be technically feasible. For example, England’s largest power plant has converted two of its six 650-MW boilers to use wood pellet fuel instead of coal. That plant is generating reliably and just as many megawatts are being generated from pellet fuel as from coal. The U.S. has 428 pulverized coal power plants larger than 50 MW, typically aged. For those plants to keep running, most will have to upgrade pollution control systems to meet sulfur, mercury and NOx emissions limits. The good news is that all of those older plants are fully paid for. That means that the initial capital cost component of the total cost equation can be ignored. The amortized capital cost is by far the largest contributor to the total cost of generation. Assuming that plants older than 35 years are fully paid for, even with pellet fuel 2.9 times more expensive per million Btu than coal, a converted coal plant generating power with pellets creates electricity at a rate that is less than one-third of a cent more expensive per kilowatt-hour than natural gas. Electricity generated from pellets in converted coal plants is almost the same cost as electricity generated from natural gas, by far the cheapest way to make new, low-carbon power. Not only does this strategy provide new low-cost, low-carbon capacity, it also has a very positive impact on job creation. It takes 2,540 jobs to provision a 500-MW coal plant with coal. To provision the same-sized power plant with pellet fuel takes 3,480 jobs. Long-term demand for sustainable refined pellet fuel will motivate the preservation of existing working forests. It will provide a strong market signal for investment in improving forest management and expanding the stock of trees in our forested lands. This is a strategy for decarbonization of the power sector that does not increase the cost of power, and actually adds jobs. It also incentivizes the expansion of our working forests, which will increase the amount of carbon sequestered. All of the fears about economic harm that typically paralyze the political process are missing. Our policymakers need to know that there is a way to be proactive on carbon without raising power rates and creating jobs.	{ "pile_set_name": "Pile-CC" }
2010 Best Places to Work - Valkyrie Enterprises When Gary Lisota started Valkyrie Enterprises in 2007, he knew that if the fledgling engineering and technical services firm was going to thrive in the highly competitive defense industry, it would need to attract the best staff possible. So Lisota decided early on that Valkyrie Enterprises, based in Virginia Beach, would differentiate itself by providing financial and insurance benefits usually found in large companies, while maintaining the personal contact typical of a small business. “It was a definite challenge,” says Lisota, who founded AMSEC LLC, a multibillion-dollar engineering services firm. Under his direction, that company grew to 5,000 employees and 74 locations worldwide. “I mean, on Day 1, when you’ve got three employees, you can’t be group-rated for any type of insurance policies,” Lisota says. “So it was a question of: How are we going to offer great benefits without having the cost so high for the employees that it’s completely unattractive to them or so high for the company that it makes it hard to compete?” Lisota persuaded Joanne Brooks, his former human-resources executive at AMSEC, to leave retirement and join his new venture. They found a benefits broker that could help them join up with a larger group and achieve their employee compensation goals. Among the current benefits package: Valkyrie offers all employees, on their very first day of work, full family health, dental, prescription, vision and life insurance benefits and pays 75 percent of the premium and a 3 percent company contribution to a 401(k) retirement plan. It also offers both short-term and long-term disability coverage. In addition, employees are eligible for an accrued bonus program that rewards exceptional performance and leadership. Lisota says that this upfront commitment “enabled us to have early success in attracting really great employees and then we became really known for our people,” he explains. “That fact then feeds on itself and becomes a snowball rolling downhill in terms of our ability to attract best-of-breed talent.” That reputation also enabled Valkyrie to grow rapidly. Shortly after its founding, the company captured the Seaport-e Small Business Prime Contract, the Navy’s electronic platform for acquiring support services in 22 functional areas, including engineering, system safety and logistics. The company now has sub-contractual relationships with 60 other defense contractors. Valkyrie took in more than $15 million in revenues in 2010. It currently has 128 employees and plans to hire at least another 40 in 2011. As part of the company’s culture, Lisota and Brooks also put in place a number of perks designed to make employees feel appreciated. Valkyrie, for example, hosts social get-togethers, including a monthly birthday potluck or picnic for employees. It provides special-recognition awards and unexpected, on-the-spot financial rewards, such as a prepaid credit card. In addition, Valkyrie communicates with employees through a monthly newsletter, which, besides company news, profiles individuals and organizations. Lisota says that although he expects that Valkyrie will continue its rapid growth, with a goal to reach $100 million and 1,000 employees by 2015, he doesn’t want the company to lose its small-business feel. “It will be a challenge to maintain that approach, but it can be done if you stay focused on it and make it a priority,” Lisota states. “The key… as we become more decentralized is to make sure I hire executives and managers who understand what our culture is and what our secret sauce is: For us, that’s to hire the best to be the best, to care about the employee as much as we do the customer and to stay close to both.”	{ "pile_set_name": "Pile-CC" }
45 F.3d 140 UNITED STATES of America, Plaintiff-Appellee,v.Keith BOLEN, Defendant-Appellant. No. 94-1568. United States Court of Appeals,Seventh Circuit. Argued Nov. 29, 1994.Decided Jan. 6, 1995. Andrew B. Baker, Jr., Ronald J. Kurpiers, Asst. U.S. Attys., Joseph Alexis Cooley (argued), Office of the U.S. Atty., Dyer, IN, for plaintiff-appellee. Steven L. Mullins, William L. Touchette (argued), Merrillville, IN, for defendant-appellant. Before CUMMINGS, ESCHBACH, and KANNE, Circuit Judges. ESCHBACH, Circuit Judge. 1 Defendant Keith Bolen appeals from his conviction for retaliating against a federal witness in violation of 18 U.S.C. Sec. 1513. Bolen contends that the evidence presented at trial was insufficient to support his conviction. We affirm. I. 2 On June 25, 1993, Keith Bolen got into a fight with Gary Young in the parking lot of Holiday Liquors in Cedar Lake, Indiana. It was a Friday night, and Bolen had been out drinking beer with a group of friends. Ron Hummel, one of Bolen's friends, was driving them around in his jeep. Hummel stopped at Holiday Liquors and ran into the store to buy more beer. While Bolen and his friends were waiting in the jeep, Gary Young coincidentally pulled into the liquor store parking lot on his way home from work. Young had testified against Bolen in a federal criminal case less than four months earlier.1 3 As Young made his way from the parking lot to the liquor store, a fight broke out between him and Bolen. Although various witnesses at trial provided conflicting testimony as to how the fight started, it is undisputed that Bolen ultimately caused bodily injury to Young. The record indicates that the fight lasted for several minutes and that Young suffered a bloody nose and other facial injuries. The fight ended when Young entered the liquor store and Bolen returned to Hummel's jeep. 4 On September 8, 1993, a grand jury indicted Bolen on one count of retaliating against a federal witness in violation of 18 U.S.C. Sec. 1513. A jury trial commenced on November 10, 1993. Bolen moved for a judgment of acquittal at the close of the government's case, but the motion was denied. Bolen subsequently failed to renew his motion for judgment of acquittal at the close of his case or at the close of all the evidence. On November 12, 1993, the jury returned a verdict of guilty. Bolen filed a timely appeal, claiming that his conviction should be vacated because it was not supported by sufficient evidence. We have jurisdiction pursuant to 28 U.S.C. Sec. 1291. II. 5 Bolen's sole contention is that the evidence presented at trial was insufficient to support the jury's verdict finding him guilty of retaliating against a federal witness. In general, a verdict will withstand a sufficiency of the evidence challenge as long as the prosecution presented some evidence from which the jury could find guilt beyond a reasonable doubt. United States v. Villagrana, 5 F.3d 1048, 1051 (7th Cir.1993); United States v. Caudill, 915 F.2d 294, 297 (7th Cir.1990). In the case at bar, however, Bolen conceded at oral argument that he failed to preserve the issue of insufficient evidence for direct appellate review because he did not renew his motion for judgment of acquittal at the close of all the evidence in the trial court. Under such circumstances, "an appellate court may reverse a conviction for insufficiency of the evidence only where the defendant demonstrates a manifest miscarriage of justice." Caudill, 915 F.2d at 297; see United States v. Goulding, 26 F.3d 656, 663 (7th Cir.), cert. denied, --- U.S. ----, 115 S.Ct. 673, 130 L.Ed.2d 605 (1994). Here, the jury's verdict against Bolen did not result in a manifest miscarriage of justice.2 6 In order to prove that Bolen retaliated against a federal witness in violation of 18 U.S.C. Sec. 1513, the government must show that Bolen caused bodily harm to Young "with the intent to retaliate" against Young for his attendance as a witness at Bolen's federal criminal trial in March, 1993. See 18 U.S.C. Sec. 1513(b).3 Bolen acknowledges that he caused bodily harm to Young, but he contends that the evidence presented at trial was insufficient to show that he acted with the requisite intent to retaliate against a witness. See United States v. Torres, 977 F.2d 321, 326 (7th Cir.1992) (stating that in a conviction under 18 U.S.C. Sec. 1513, "the government was required to establish that [the defendant] acted not only knowingly, but also with an intent to retaliate"). In reviewing sufficiency of the evidence challenges, we review the evidence in a light most favorable to the government and we defer to the jury's evaluation of the credibility of witnesses. United States v. Martinez, 937 F.2d 299, 303 (7th Cir.1991); Caudill, 915 F.2d at 297. 7 At trial, the government provided evidence that Bolen instigated the fight against Young and that references were made to Young "ratting" on Bolen. Young testified that as he was walking from the parking lot to the liquor store entrance, he was called over to the jeep in which Bolen and his friends were sitting. According to Young's testimony, he started to back away from the jeep as soon as he recognized Bolen's presence, and Bolen then jumped out of the jeep, confronted Young, and started beating him. Danny Miller, a government witness who had been standing next to the jeep in the Holiday Liquors parking lot when this incident occurred, testified that he heard someone from inside the jeep yell: "There's the guy that ratted on you." Miller further testified that he heard Bolen repeatedly ask Young: "Why did you rat on me?" 8 Not surprisingly, Bolen's witnesses at trial provided a different version of what transpired. They testified that Young had instigated the fight and that there was never any mention of Young's participation as a witness in Bolen's previous criminal trial. On appeal, Bolen argues in effect that the testimony of his witnesses was stronger and more credible than that of the prosecution; however, this is clearly a jury question. Viewing the evidence in a light most favorable to the government, and allowing the jury to evaluate the credibility of the witnesses, we are satisfied that there was sufficient evidence to support Bolen's conviction. Accordingly, there was no manifest miscarriage of justice. III. 9 For the foregoing reasons, the defendant's conviction is AFFIRMED. 1 On March 3, 1993, Young testified on behalf of the government in United States v. Bolen, No. HCR 92-138. Bolen had been charged with discharging a firearm at a civil aircraft in violation of 18 U.S.C. Sec. 32, and Young testified that he had heard shots from an automatic or semi-automatic weapon. Bolen was subsequently acquitted because of insufficient evidence 2 Even if Bolen had properly preserved the issue of insufficient evidence by renewing his motion for judgment of acquittal at the close of all the evidence, we would still find under the normal standard of review that there was sufficient evidence to support the jury's verdict in this case 3 Section 1513(b) provides: Whoever knowingly engages in any conduct and thereby causes bodily injury to another person ... with intent to retaliate against any person for-- (1) the attendance of a witness or party at an official proceeding, or any testimony given or any record, or other object produced by a witness in an official proceeding; or attempts to do so, shall be fined not more than $250,000 or imprisoned not more than ten years, or both.	{ "pile_set_name": "FreeLaw" }
LAS VEGAS, NV, January 8, 2018 – Xeros Technologies (LN:XSG), the developer of polymer technologies which radically improve the sustainability and performance in water-intensive consumer and industrial processes, today announced XFiltra™, a new technology that removes microfibers from home laundry wastewater. Xeros is showcasing this transformational home laundry technology at Booth #42552 in the Sands Expo, Level 2, at the Consumer Electronics Show, January 9-12, 2018, in Las Vegas, Nevada. Xeros will also be demonstrating its innovations at the ShowStoppers event at the Wynn Hotel on January 9, 2018. Today, about 60% of our clothing contains synthetic fibers including yoga pants, fleece coats, workout gear, and even dress shirts to name a few. Synthetic fibers enhance the look and the performance of these garment but new research indicates that these fibers may cause an environmental risk. Every time these garments are washed, they shed tiny plastic microfibers. A 2016 study pioneered by Patagonia Outfitters and conducted by the Bren School of Environmental Science & Management found that a single fleece jacket can shed up to 250,000 microfibers during a single wash. The fibers are so small that they pass through wastewater treatment facilities and enter our streams, rivers, lakes and oceans where they make their way into the food chain. Rather than require wastewater treatment plants to spend on massive capital improvement projects, Xeros’ filtering innovation, XFiltra, greatly reduces microfibers from entering the environment by addressing the problem directly where the microfibers are created, in the home washing machine. XFiltra Filtration Technology XFiltra is compatible with any home washing machine and features a clever and elegant design for easy cleaning and hassle-free maintenance by homeowners. Filtering home washing machine water has two benefits; protects the environment from harmful microfibers and protects your garments by ensuring they are always washed with cleaner water. The XFiltra includes an integrated pump, filter and dewatering device. Unfiltered water enters the XFiltra where the microfibers are trapped and are spun dry into a solid disk for easy removal. When the XFiltra is ready for cleaning, just open it up, remove the dry microfiber disk, and place it with your everyday trash. About Xeros Technology Group Xeros Technology Group plc (LN: XSG) is a platform technology company that is reinventing water intensive industrial and consumer processes by reducing water and chemistry usage with its polymer technologies. Its patented technologies have the capacity to provide material, economic, operational and sustainability improvements that are unattainable with traditional processes. The Group is currently commercializing its intellectual property in three areas: Cleaning Technologies, Tanning Technologies, and Textile Technologies. Xeros has a number of agreements in place with such international organizations as BASF, Hilton, and Wollsdorf Leder. For more information, please visit www.xerostech.com. The Xeros Logo, Xeros, XOrb, XFiltra, and XDrum are trademarks of the Xeros group of companies.	{ "pile_set_name": "Pile-CC" }
Q: Beginner's query: unable to reverse char array in C First up: sincere apologies for bringing up such a basic problem requesting attention. I intend to reverse a char array with a user input string by using getchar() & display its reverse using putchar(). [I understand that there may be easier or more elegant ways using printf() & scanf(), but I am keen to find the flaw in my logic below with getchar() & putchar():] #include <stdio.h> #include <stdlib.h> #define EOL '\n'; /* Reversing a character array / int main() { int arr_char[10]; int i=0; / reading char elements into the array / printf("Please input the array\n"); arr_char[0]= getchar(); while(arr_char[i]!= EOL && i<=9) { i=i+1; arr_char[i]=getchar(); printf("\ni=%d\n",i); } / display reverse */ while(i>=0) { putchar(arr_char[i]); i--; } return 0; } 1) I get an error message: reversing char array\main.c\|15\|error: expected ')' before ';' token\| \|\|=== Build finished: 1 errors, 0 warnings (0 minutes, 0 seconds) ===\| FYI: Line 15 is the while(arr_char[i]!= EOL && i<=9) 2) I am also trying to print the counter "i" as to see whether it is being incremented on pressing "Enter" after a character is input and it seems that it does. 3) I have defined the arr_char array as int arr_char[10]; with the intention that if someone inputs "-1" as EOF/EOL, then a char array will perhaps not be of much help. Am I right? Any explanations in helping get my bearings back on'll be greatly appreciated. Thanks! A: Remove the ; from the end of the #define. Macros are done using text substitution, so with the semicolon, while(arr_char[i]!= EOL && i<=9) will become: while(arr_char[i]!= '\n'; && i<=9) which is wrong. You also have an additional problem in that your code can write to arr_char[10], which is past the end of the array. You need to increase the array size, or change i<=9 to i<9.	{ "pile_set_name": "StackExchange" }
New Clariion overlaps with Celerra, scales almost as high as Symmetrix EMC has launched its new Clariion arrays, which now do many of the same things as its Celerra NAS and scale close to its high-end Symmetrix. The company denies these similarities point to product consolidation. By submitting your personal information, you agree to receive emails regarding relevant products and special offers from TechTarget and its partners. You also agree that your personal information may be transferred and processed in the United States, and that you have read and agree to the Terms of Use and the Privacy Policy. As we reported last week, EMC today rolled out its CX4-120, CX4-240, CX4-480 and CX4-960 systems. The CX4 platform brings features, such as solid-state disk (SSD), virtual provisioning and disk spin-down, which are already featured in Symmetrix and other EMC systems, into the midrange Clariion. Some features in the Clariion CX4 also overlap with those of the Celerra NAS family, prompting speculation that EMC may be quietly laying the groundwork for merging some of its disk arrays down the road. "It seems they're expanding the market [for Clariion] whenever and wherever they can," said Illuminata Inc. analyst John Webster. "But in the long run, if you're EMC, you have to be concerned about the number of platforms you're supporting. At what point do you say, 'I've got too many here?'" But according to Barry Ader, EMC's senior director of storage product marketing, EMC has no plans for consolidating platforms. "We got the same question when we came out with the CX3," he said. "Capacity is just one piece of the overall package. Symmetrix has a very different architecture from Clariion." Symmetrix has a multicontroller, high-availability architecture, more flexible cache options and can hold more cache (up to 512 GB) than the new Clariion CX4-960 (up to 32 GB). It also supports mainframe connectivity, while Clariion is for open systems. However, recent Clariion refreshes have added features that were previously exclusive to Symmetrix, such as active-active controllers and quality of service controls. Today's release adds persistent write cache to Clariion, as well as a boost in high-performance, Tier 0 capacity with support for SSDs coming to the CX4-960 in October. "Clariion does run at five 9s [of availability]," Ader said. "But Symmetrix's dynamic cache controls allow high-end customers to meet performance requirements in multiple ways -- it's at a different level from Clariion's quality of service." Asked if there was anything architecturally preventing Clariion from getting similar fine-grained cache controls over time, Ader responded, "I don't' have an architectural answer for that right now." EMC has also given the Clariion CX-4 line its own embedded replication software in the form of a RecoverPoint splitter that allows customers to manage EMC's heterogeneous asynchronous replication without a separate network device. Users will still need MirrorView if they want synchronous replication. Users welcome more capacity, mull Clariion vs. Symmetrix While the highest of high-end shops won't replace Symmetrix with Clariion anytime soon, the CX4 may postpone a move to the more expensive DMX for some rapidly growing midrange shops. David Dulek, storage administration lead for Fastenal Company Purchasing, said a new disk array is not in his current plans but would probably go with a CX4 for his next storage expansion. "I'd like to go with a DMX for the performance," he said. "The price/performance isn't quite there for me yet, though. The acquisition cost is too high." That's the common perception among midrange shops, Dulek said. "No one can afford DMX, though the average life of a DMX is two to three times greater than Clariion. The Clariion only lasts between three and five years, while there are still Symmetrix arrays running from the late 90s," he said. Charles Shepard, director of systems architecture for EMC customer MGM Mirage, said he's looking to the CX4 to boost disk and cache capacity over his "maxed-out" CX700. "Looks like EMC has finally realized the potential of the Clariion platform and its flexibility," he said. "This is a gap-filler and tier-extender all in one." Though CX4 doubles capacity of the CX3 line, customers said they could need even more capacity down the road. "We actually have an Exchange 2007 project coming up, and we are contemplating giving 500 MB to 2 GB mailboxes to every one of our 16,000 active users," said Michael Passe, storage architect for Beth Israel-Deaconess Hospital in Boston. "I will need the [maximum] number of drives these new arrays can handle just to get that much capacity." Multiprotocol, backup use cases also overlap Another customer said he was unsure whether to go with a CX4 or EMC's Celerra multiprotocol NAS platform, which already has virtual provisioning (EMC's term for thin provisioning). "What we have been looking at is what EMC refers to as their Unified Storage platform using [the] Celerra product," said Michael Biedermann, systems analyst at the University of New Mexico Hospital. "[It] would give us options to use NAS or Fibre Channel SAN on the same array, allowing us to use any combination of iSCSI or Fibre Channel protocols. I'm not sure if CX4 will integrate a lot of the feature sets that Celerra brings to the table." The CX4's new spin-down feature, while not available until 2009, is being positioned for "appropriate application workloads like backup to disk [and] disk-based archiving," according to EMC. However, spin-down is already available for the EMC Disk Library backup system based on Clariion hardware. EMC needs time to test and qualify CX4 spin-down, Ader said. "We have tested and qualified [spin-down] with our own backup technologies, such as the EMC Disk Library," Ader said. "But for broader backup to disk applications, we will be exposing the right level of API to other more general backup applications." EMC's spin-down will be managed differently from the MAID technology that Copan pioneered in its high-density archival boxes, Ader said, noting that while Copan's array only allows 25% of the disks to be spun up at a given time, the CX4 will be able to spin up 100% of its disks at once.	{ "pile_set_name": "Pile-CC" }
Looking for Spanish Recipes? Spain-recipes, as its name says, is devoted to offer you the best selection of Spanish recipes, along with a careful selection of ingredients to match. If you're looking for authentic paella recipe, or the real sangria, Spanish tapas, or even the true gazpacho, look no further! You'll be able to find them all on spain-recipes! Is that all? Certainly not. In the Mediterranean area, there is no good meal without its complements: wine, olive oil, tapas, and so on. All this can also be found at spain-recipes.com, as well as the best cookbooks and kitchenware, in order to provide you with a unique experience in the Mediterranean diet.	{ "pile_set_name": "Pile-CC" }
2 - 7d. Suppose -9 = -3s + 15. Let l be u(s). What is l rounded to the nearest 10000? -130000 Suppose 7 = 4n + 3. Suppose 0 = 3t + 12, 3i - n = 2t - 23. What is i rounded to 0 decimal places? -10 Let m = -175280 - -176406.01. Let z = m - 1131. Round z to zero decimal places. -5 Let f(y) = -472y - 17. Let d be f(-5). Suppose -a = 260 - 2017. Let n = d + a. Round n to the nearest 1000. 4000 Let z be 51875(409 + (-36)/4). What is z rounded to the nearest one hundred thousand? 20800000 Let m = -0.799 + 0.089. Let d = m + 5.01. Round d to the nearest ten. 0 Let f = 31.96 + -38. What is f rounded to 0 dps? -6 Let a = -2.788 + 23.244. Let y = 0.156 - a. What is y rounded to 0 dps? -20 Let j(u) = 55u2 + 9u. Let i(g) = g*2 + g. Let o(l) = -5i(l) + j(l). Let f be o(5). What is f rounded to the nearest 100? 1300 Let i(z) = z*2. Let y(x) = -4x*2 - 5x - 4. Let t(w) = -3i(w) - y(w). Let p be t(-3). Let r be (p - -5)/(10/(-70)). Round r to the nearest 10. -20 Suppose -8v + 13 = -27. Suppose -4913882 = vb - 213882. Round b to the nearest one hundred thousand. -900000 Suppose j - 5827 = -b, 5j = -2b + 4j + 11650. Let v = -32737 + -12440. Let y = v - b. What is y rounded to the nearest ten thousand? -50000 Let x = 15 + -2. Let h = -14 + x. Let d be (h - -94501)(-80)/12. What is d rounded to the nearest 100000? -600000 Let o = 4393.51 - 4372. Round o to 0 dps. 22 Let k = 118.038 + 2.262. What is k rounded to the nearest one hundred? 100 Let r be 5/(28/8 + -1). Suppose 5758 = rd - 2402. Round d to the nearest one thousand. 4000 Let c = -80.077 - 0.123. What is c rounded to the nearest ten? -80 Let l = -13 - -13. Let u = -0.03 - -0.0304. Let r = l - u. What is r rounded to three dps? 0 Let g = -14944.8489 + 14944. Round g to one decimal place. -0.8 Let b = 1.57 - -0.13. Let m = -1.22 + b. What is m rounded to 1 decimal place? 0.5 Let u = 0.6 - 0.8. Let c = u + 0.20000044. What is c rounded to 7 dps? 0.0000004 Let p = 21.4 + 4.5. Let t = -2170.38081 + 2144.482. Let v = t + p. What is v rounded to 4 decimal places? 0.0012 Let v = 14.2 - 14.152. What is v rounded to two dps? 0.05 Let j = -2579.7378009 + 2578.6978. Let f = -1.04 - j. Round f to 6 decimal places. 0.000001 Let y(m) = 1529m - 60. Let v be y(10). Round v to the nearest one thousand. 15000 Let o = 4235 + -4234.7659. What is o rounded to two dps? 0.23 Let h = 2.841 + -0.036. Let z = -3 + h. Round z to two dps. -0.2 Suppose -2o + 6o - 16 = -2h, 0 = -4h + 5o - 7. Suppose -18 - 7 = -p. Suppose 4z + 0d = -hd + 51190, 0 = -5d - p. What is z rounded to the nearest 1000? 13000 Let r = 153.83 - -3.17. Let l = r + -156.99999777. Round l to 6 dps. 0.000002 Let o = -2424869465 + 2424809028.84029. Let z = o + 60470.16. Let y = 34 - z. What is y rounded to 4 dps? -0.0003 Let l(z) = 2z2 - 2z - 1. Let r be l(2). Suppose rf = 40 + 74. Suppose -5p = -0p + 5t + 70, 5p + f = 3t. Round p to the nearest ten. -10 Let m = 68.98 - 74.5. Round m to the nearest integer. -6 Let l = -19 + 40. Let c = l - 18. Let b = 5.6 + c. What is b rounded to the nearest integer? 9 Let u(q) = 27808q + 526q + 3 - 7. Let o be u(6). What is o rounded to the nearest 100000? 200000 Let l = 11 + -9. Suppose -8 = s + c, 2s - 6c - 14 = -lc. Let v(n) = 2022223n*2 + 3n + 2. Let q be v(s). Round q to the nearest 1000000. 18000000 Let o = -8 - -4. Let g = -4.02 - o. What is g rounded to 2 dps? -0.02 Let i = 715.3 - 722. Let q = -161689933.6999943 - -161689927. Let f = i - q. Round f to 6 decimal places. -0.000006 Let h = -108922 - -108968.0116. Let a = h + -46. What is a rounded to three dps? 0.012 Let p = 0.09 + -0.0900002012. What is p rounded to seven decimal places? -0.0000002 Let n(w) = 53w + 23. Suppose -6z + 11z = 50. Let s be (-4)/z + (-371)/35. Let h be n(s). Round h to the nearest one hundred. -600 Let l = -2591949 - -2591952.449026. Let j = 2.949 - l. Let q = j - -0.5. Round q to 5 dps. -0.00003 Let t = 33.021 - 0.021. Let g = 32.99988 - t. What is g rounded to 4 decimal places? -0.0001 Let x = -236.2476 - -41.1506. Let d = -205 + 400. Let a = d + x. What is a rounded to two decimal places? -0.1 Let z = -412 - -211. Let b = -201.00162 - z. What is b rounded to three decimal places? -0.002 Let k(n) = -3n*2 + 4n - 5. Let f(l) = l*2 - 14l + 17. Let o be f(13). Let a be k(o). Round a to the nearest 10. -40 Suppose 3h - 255f - 49 = -256f, 33 = h - 3f. Round h to zero dps. 18 Let g(d) = -d - 546000. Let k be (28/(-18))/7 - (-2)/9. Let p be g(k). What is p rounded to the nearest 100000? -500000 Suppose -15h = -14h - 446000. Round h to the nearest 100000. 400000 Let t = 3.58 + 2.29. Let c = -0.07 + t. What is c rounded to the nearest integer? 6 Suppose -2i + 0l - 4l = -2168, 0 = -4i + 2l + 4336. Suppose -5a - i = 1966. Round a to the nearest 100. -600 Let y = 20.3 + -20.299839. What is y rounded to 5 decimal places? 0.00016 Let y be (1459266/15 + 6)/(2/(-505)). Let d = y - -5265826. What is d rounded to the nearest one million? -19000000 Let f(v) = 2481v + 135. Let x be f(-5). Round x to the nearest one thousand. -12000 Let t = 10 + -71. Let d = -1.3073894 + 62.3076994. Let n = d + t. Round n to 4 dps. 0.0003 Let u be -32/(-15) + 1678/5. Let g = -566 + u. What is g rounded to the nearest 10? -230 Let d = -2025.270691 - -2025.08. Let y = d + -12.808789. Let w = -13 - y. Round w to 4 decimal places. -0.0005 Let c = 0.073 + -2.973. Let i = -6.9 - c. Let k = 4.00000009 + i. What is k rounded to seven decimal places? 0.0000001 Let g = -544.659998 + 486.44637999. Let l = g + 61.3836163. Let p = 3.17 - l. Round p to 7 dps. 0.0000017 Let p be (-2)/5 + 294/(-15). Let a be p(200-13)/1. Suppose 3z = z + a. What is z rounded to the nearest 10000? 30000 Let z(r) = -r3 - 7r*2 - 2r - 5. Let n be (7/4)/(9/(-36)). Let u = n - -2. Let i be z(u). What is i rounded to the nearest ten? -50 Let c = -20404 - -20392.179. Let f = c + -0.079. What is f rounded to zero decimal places? -12 Let t = 14 + -18. Let r be (-2)/(t/64000 + 0). Round r to the nearest 10000. 30000 Let z = -598 + 843. Suppose -5445 = 4p - z. What is p rounded to the nearest one hundred? -1300 Let x be (-2308)/8-1-4. Suppose h = 4c - 44834, 0 = -2h + 3h + 3c + 44855. Let g = x + h. Round g to the nearest ten thousand. -50000 Let y = 16077 + -5503. Let b = y + -10550.004. Let i = b - 24. Round i to two decimal places. 0 Suppose -5 = -5r, -2a + 10016 = -0a - 4r. What is a rounded to the nearest 100? 5000 Let u = 0.945 - -0.015. Let c = 48.96 - u. Let k = -48.84 + c. What is k rounded to 1 decimal place? -0.8 Let s = 15.81 + 0.19. Let h = -16.0000053 + s. What is h rounded to 6 decimal places? -0.000005 Let v = 11.205 - 11. Let o = -0.205194 + v. What is o rounded to five decimal places? -0.00019 Suppose -52 = -7f + 11. Let j = -7 + f. Let k be 2180005 - j - (4 + -1). Round k to the nearest one hundred thousand. 2200000 Let b = 8781 + -8780.95689. Round b to 3 decimal places. 0.043 Let t be 56438 - ((-11 - (0 + -6)) + 3). Round t to the nearest one thousand. 56000 Let a(z) = 135z2 - 18z + 9. Let c(v) = -v*2 + v + 1. Let x(i) = -a(i) + 2c(i). Suppose n - 2n + 13 = 0. Let p be x(n). Round p to the nearest 1000. -23000 Let a = -98.128 + -0.172. What is a rounded to the nearest ten? -100 Suppose 2m - 20028 = 4h, -m = 3m + h - 40047. Suppose -2b + m = w, -4w = b - 6b + 25017. Suppose 5j - b = 2645. What is j rounded to the nearest 100? 1500 Let u = 206654 - 206654.02200037. Let y = u + 0.022. What is y rounded to 7 dps? -0.0000004 Let d = -12.14 - -7.71. What is d rounded to zero decimal places? -4 Let w = 0.631 - -290.369. Let j = w + -290.9999739. What is j rounded to 6 dps? 0.000026 Suppose 0 = -a - 1 + 3. Suppose -8162 = -3r - ap, 2r = 5r - 3p - 8157. Round r to the nearest 100. 2700 Let f(y) = -5y - 1. Let b be f(-1). Let r be (260/(-15))/(b/(-6)). Let g be ((-1)/(-2)*r)/(-1). What is g rounded to the nearest ten? -10 Let j = 505.0081 - 505. Round j to one decimal place. 0 Let j = -696375023.62038 + 696986310.62. Let k = -611325 + j. Let p = -38 - k. Round p to 4 dps. 0.0004 Let p = 4 - -76. Let f = 80.00000051 - p. What is f rounded to seven decimal places? 0.0000005 Let j = 10397270 - 10397270.1	{ "pile_set_name": "DM Mathematics" }
9 Wn. App. 834 (1973) 515 P.2d 523 DALE A. McANULTY, Respondent, v. SNOHOMISH SCHOOL DISTRICT NO. 201, Appellant. No. 1668-1. The Court of Appeals of Washington, Division One. October 29, 1973. 835 Robert E. Schillberg, Prosecuting Attorney, Darrell L. Syferd and Elmer E. Johnston, Jr., Deputies, for appellant. Bovy, Graham, Cohen & Wampold and Norman W. Cohen, for respondent. FARRIS, J. Snohomish School District No. 201 appeals the trial court's award of damages to Dale McAnulty, a teacher, in his action for improper discharge from employment. On June 3, 1970, McAnulty, then a fifth-grade teacher for the predecessor of Snohomish School District No. 201, was informed by letter that he had been discharged by the school board. Thomas P. Graham, an attorney, replied to this discharge letter over McAnulty's signature informing the board that he would represent McAnulty, requesting a hearing, and asking that all further communication in this matter be directed to him. Subsequent to the hearing, at which Graham represented McAnulty, the board offered McAnulty a new contract subject to certain rules of conduct. The board received a letter signed by both Graham and McAnulty, dated August 5, 1970, which accepted the contract and agreed to abide by its conditions. On September 22, 1970, Paul Carboneau, the principal of McAnulty's school, sent a letter to McAnulty concerning his alleged violation of one of the conditions of the contract. Graham responded to that letter for McAnulty. On November 19, 1970, the board determined that there was cause to discharge McAnulty. The next day Carboneau called McAnulty to his office and told him without elaboration not to return to work on Monday; he would be sent an explanatory letter. Carboneau wrote a letter (salutation to McAnulty) dated November 20, 1970, detailing the reasons for his discharge. A copy of that letter was sent by registered mail to Graham, but neither the original nor a copy 836 was ever mailed to McAnulty. On November 25, 1970, McAnulty went to Graham's office and there read Graham's copy of the discharge letter. McAnulty filed suit in Snohomish County Superior Court for damages arising from his discharge. The court found that McAnulty had not been served with notice of discharge within the meaning of RCW 28A.58.450, and for that reason entered judgment for McAnulty. This appeal followed. We first consider the school district's contention that McAnulty was served with notice of discharge within the meaning of RCW 28A.58.450, which provides that a school board finding probable cause for the discharge of an employee shall notify such employee in writing of its decision, which notification shall specify the probable cause or causes for such action. Such notices shall be served upon that employee personally, or by certified or registered mail, or by leaving a copy of the notice at the house of his . .. usual abode ... The school district argues that since McAnulty had designated Graham as his agent to receive service, was immediately orally informed of his discharge, and within a week read Graham's copy of the discharge notice, the statutory service requirements were met. The record establishes that Graham had acted as McAnulty's attorney in the matter of the June 1970 discharge. McAnulty had requested at that time that further communication "in this matter" be directed to Graham. Exhibit No. 9. The school district argues that McAnulty was discharged primarily for violations of the probationary contract which was the upshot of that June discharge, and that the November 1970 discharge was part of the earlier discharge. Therefore, the school district argues, Graham continued to be McAnulty's agent and service on him was good service on McAnulty. [1] The trial court found that McAnulty was not served with notice of his discharge either personally or by certified or registered mail. That fact is not disputed. The court also 837 found that the matter of the June 1970 discharge had terminated and that the November 1970 discharge was a new matter. We may not substitute our own findings of fact for those of the trial court, if there is substantial evidence to support those findings. Thorndike v. Hesperian Orchards, Inc., 54 Wn.2d 570, 343 P.2d 183 (1959). Here, the trial court reasonably found that the November 1970 discharge was a different, if related, matter from the June 1970 discharge. Neither McAnulty nor Graham had a duty to give notice of the termination of the agency, since the school board had an absolute statutory duty to serve McAnulty himself unless the November 1970 discharge was in fact the culmination of the single matter of the June 1970 discharge. [2, 3] The school district argues that even if Graham was not McAnulty's agent, RCW 28A.58.450 is not a service statute and under the circumstances its intent was satisfied by the actual notice of his discharge that McAnulty received. In State ex rel. Miller v. Tacoma, 177 Wash. 689, 33 P.2d 88 (1934), the court held that where an employee had received actual notice of the reasons for his discharge, the purpose of the statutory notice requirements had been satisfied despite deviations from the letter of the statute and the discharge was upheld. However, the statute at issue in Miller provided only for the furnishing of a statement in writing of the reasons for his discharge to a discharged employee. Here, RCW 28A.58.450 explicitly provides that notice of the reasons for discharge shall be "served upon that employee ..." (Italics ours.) Where a statute explicitly requires service and spells out the allowable methods for accomplishing such service, no deviation can be excused by the giving of actual notice; cf. Schultz v. Pasco, 39 Wn.2d 262, 235 P.2d 168 (1951). McAnulty cross-appeals for a jury trial, for an increase in attorney fees, for an increase in damages beyond the trial court's award of the remainder of his 1970-71 teaching salary, for reversal of the trial court's summary judgment 838 on his claim of defamation and interference with contractual relations, and for double damages under RCW 49.52.070. In view of the ruling of this court on the discharge question, the jury trial issue is moot. [4] The grant or denial of attorney fees is within the sound discretion of the trial court. Lande v. South Kitsap School Dist. 402, 2 Wn. App. 468, 469 P.2d 982 (1970). We find no abuse of discretion in the award made. [5] Although an improperly discharged teacher should recover all damages caused by his discharge, Foster v. Carson School Dist. 301, 63 Wn.2d 29, 385 P.2d 367 (1963), the mere expectancy of employment is not sufficient to award contract damages for the distant future. Moore v. Knowles, 466 F.2d 531 (5th Cir.1972). Here the trial judge's award of the balance of the year's wages was a reasonable limitation of recovery. The award of partial summary judgment on September 3, 1971, on the issue of defamation and interference with contractual relations was a final order within the meaning of CR 54(b). See Crosthwaite v. Crosthwaite, 56 Wn.2d 838, 358 P.2d 978 (1960). No appeal was taken from that order until May 15, 1972; it is now barred under CAROA 33(1). [6] Finally, RCW 49.52.070, the double damages statute, does not apply here. That statute provides double damages only for a willful withholding of wages. There is no testimony in the record to indicate that appellant school district did not have a genuine belief that McAnulty had been legitimately discharged and thus that his wages could properly be discontinued. An employer does not willfully withhold wages within the meaning of RCW 49.52.070 where he has a bona fide belief that he is not obligated to pay them. See State ex rel. Nilsen v. Lee, 251 Ore. 284, 444 P.2d 548 (1968). Here there was no willful wrongdoing; RCW 49.52.070 does not apply. Affirmed. SWANSON, C.J., and CALLOW, J., concur.	{ "pile_set_name": "FreeLaw" }
<?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> <plist version="1.0"> <dict> <key>CFBundleDevelopmentRegion</key> <string>en</string> <key>CFBundleExecutable</key> <string>$(EXECUTABLE_NAME)</string> <key>CFBundleIdentifier</key> <string>$(PRODUCT_BUNDLE_IDENTIFIER)</string> <key>CFBundleInfoDictionaryVersion</key> <string>6.0</string> <key>CFBundleName</key> <string>$(PRODUCT_NAME)</string> <key>CFBundlePackageType</key> <string>APPL</string> <key>CFBundleShortVersionString</key> <string>1.0</string> <key>CFBundleSignature</key> <string>????</string> <key>CFBundleVersion</key> <string>1</string> <key>LSRequiresIPhoneOS</key> <true/> <key>UILaunchStoryboardName</key> <string>LaunchScreen</string> <key>UIMainStoryboardFile</key> <string>Main</string> <key>UIRequiredDeviceCapabilities</key> <array> <string>armv7</string> </array> <key>UISupportedInterfaceOrientations</key> <array> <string>UIInterfaceOrientationPortrait</string> <string>UIInterfaceOrientationLandscapeLeft</string> <string>UIInterfaceOrientationLandscapeRight</string> </array> <key>UISupportedInterfaceOrientations~ipad</key> <array> <string>UIInterfaceOrientationPortrait</string> <string>UIInterfaceOrientationPortraitUpsideDown</string> <string>UIInterfaceOrientationLandscapeLeft</string> <string>UIInterfaceOrientationLandscapeRight</string> </array> </dict> </plist>	{ "pile_set_name": "Github" }
One last bit about the Rose Bowl and then we can turn toward Tampa and hoops. But I can't move on without mentioning it: Penn State fans, you got the true Big Ten Pasadena experience this time in all its gory Technicolor detail. By that, I mean you were initiated into the conference brotherhood of heartbreak at the hands of USC. It's a birthright for anyone at Michigan or Ohio State, losing an excruciating game to the Trojans at the world's most enchanting athletic venue. There is no more bittersweet experience in sports than attending a Rose Bowl, gazing agape at the vividness of the beauty all around you. The colors all seem richer even when it's cloudy, the air like velvet even when it's chilly. The Rose Bowl Then your team makes a valiant effort, you think victory is at hand and at the very end it's snatched away by the Evil Empire in cardinal and gold. Ask anyone in Ann Arbor or Columbus. This is a rerun they've lived through over and over. As a kid back in the 1960s and '70s, I watched Woody Hayes take four different teams into the Rose Bowl to meet USC. Two of those ended in just such a painful manner. Then, when I was an OSU undergrad, yet another narrow defeat at the very end in the post-1979 game. Michigan folks can tick off the Pasadena losses to USC: 1969, 1976, 1978, 1989, 2003, 2005. Northwestern (1995) fans of a certain age know the feeling, too. And though they never play at the Rose Bowl, Notre Dame folks know all about it. Like some of the OSU and Michigan defeats, I don't think Penn State's post-2008 loss qualifies because it was never in doubt. Which is sort of a prerequisite for real agony and the unique pain yet to come. And what's that nadir moment? The sound of the Trojan band in their war-helmeted outfits piping up when their triumph is clear. And I don't mean the little ditty they play the whole game after defensive stops like Florida State's tomahawk chop tune. Or the Fight On song they strike up after touchdowns (both in the video below). I mean their victory march. Just hearing it brings on dark memories from my childhood, recollections I keep in the back of the mind's bottom drawer with moving days and dying pets. It's the dirge from a recurring nightmare. USC's band only plays the song when they know they've won. It's called Conquest and the reason it sounds like the soundtrack out of a 20th Century Fox epic from the '40s is that's exactly where it came from. It's their version of Red Auerbach's victory cigar and the I Believe chant begun by Navy midshipmen. It's worse, though. Because it drips with a special arrogance. And as much as you hate it, you know it's a great piece of music. The conductor uses as his baton a gilded gladius, the stubby sword of ancient Greek and Roman foot soldiers, stabbing it in the air with the marching cadence. In the back of your mind you know this is the band that played Tusk behind Fleetwood Mac. It's the band that crossed over into the record industry and show business. All the while the damn horse is prancing around. He's not just a horse, of course. He has to be white. Like Dr. Evil's cat. But you know what the very worst part is? You take in the whole scene in despondence, the USC fans mimicking the trumpet flourishes with their "Oh-oo-oh-ooooo" and the incomparable Song Girls in their white sweaters calmly punching the air with a V for victory in all their confident perfection. And you allow yourself the fleeting thought: If you'd been born into their tribe and their golden land, you'd love being one of them. That's the worst part! That's the part that drives you nuts. Because you'll have to think about this loss for nine months. You're flying home the next day. Winter has only begun. Meanwhile, they'll be in California. And they'll probably forget about it tomorrow when they leave work early for the beach. God, I hate that song.	{ "pile_set_name": "OpenWebText2" }
This invention relates to devices for anchoring a tubing string to a surrounding well casing. Tubing anchors have a variety of uses in oilfield operations. For example, when an oil well is produced with a downhole rod pump, during the pumping cycle the weight of the fluid in the tubing string shifts between a load on the rod string on the upstroke to a load on the tubing on the downstroke. For installations which do not have an anchor, during the downstroke the weight of the fluid in the tubing causes the tubing to stretch, but on the upstroke the load is transferred to the rod string so the tubing contracts. In an unanchored installation, this cycle causes wear in the rods and tubing because of the rubbing of the rods and rod boxes against the inner wall of the tubing. In unanchored installations the pump efficiency is decreased by the decrease in the effective stroke length. A tubing anchor maintains the tubing in tension, thereby lengthening the effective stroke length of the pump and preventing the stretching/contracting cycle of the tubing string. Tubing anchors generally operate by the urging of slips against the interior wall of the production casing of the well by the application of mechanical or hydraulic force. Anchors which are activated hydraulically typically have a “live slip” or “floating slip” (hereinafter “live slip”) which is urged outwardly against the interior of the casing wall upon the application of hydraulic pressure to a piston which drives the live slip radially outward. The piston may have a relatively large diameter and is capable of providing a substantial applied force to the live slip thereby maintaining the position of the anchor in the casing and keeping the tubing string in tension. When tubing needs to be pulled from the well, the tubing anchor needs to be released. The releasing procedures usually involve pulling up on the tubing string or rotating the tubing string. However, during this process, it is not uncommon for the live slip or other anchor components to separate from the tubing anchor and fall downhole, either to the well bottom or to be stopped by casing restrictions or by a smaller diameter casing/liner below the set point of the anchor. The loss of the live slip downhole is problematic. Anchor slips are typically manufactured from hardened steel and can form an obstruction requiring an expensive fishing job or, alternatively, can be left downhole with the potential for causing problems in the future.	{ "pile_set_name": "USPTO Backgrounds" }
What we define as fashion is different than clothing. Clothing is the production of materials that can be worn. “Fashion is a way of behaving that is popular in a particular time and place [1]“ Our fashion clothing choice shows who we are. It is readable according to a certain system. Different cultures have different systems and we need to keep notion of the signs our clothes give. This blog is about how we as humans can be good for the world by making and using fashion. Some people think it is the responsibility of companies to produce ‘good’ products and services. Others think it is the task of the consumer to ask for ‘good’ products, because as long as they do not ask, companies will not produce it. I think neither one of these options is the solution, it is about the correlation with one another. A consumer does not know what is possible at this moment. A company does not know what is desired. I do know that we have to make and use fashion differently than what we are doing now, and I will call this innovation. The more radical innovations focus on consumption patterns. They bring the biggest benefits because they are based on cultural change and shifts in consumer consciousness. In contrast, changes to products or processes can be introduced more quickly as they generally involve familiar technologies and require little change to established behaviour, but they bring smaller scale improvements.	{ "pile_set_name": "Pile-CC" }
Features Item details There are a Million Fish in the Sea but I'm a Mermaid - for vinyl cutting machines: Silhouette Studio and Cricut Explore. NOTE: This design may not be suitable for small projects (under 3-5 inches). If attempting to create this on a small item, I recommend slowing your blade's cut speed to 1-3 for best results. File formats: SVG, PNG and Silhouette Studio Document (.studio) This download contains the following designs:1. There are a Million Fish in the Sea but I'm a Mermaid Please be advise that this order is a Instant DIGITAL DOWNLOAD and no physical product will be shipped to you . This is not a true type font or open type font; it has already been converted to vector outline. Please ensure that your machine takes the above format prior to purchase, as we regret that due to the nature of digital files we are unable to accept refunds. You are welcome to use this design on personal items or items for sale in small amounts (less than 500 pieces) No mass producing allowed. You MAY NOT upload this file to any print on demand sites such as but not limited to Cafe Press or Zazzle. You MAY NOT sell, share, trade, or give this file away. You may not use any un-watermarked pictures of this design. If you wish to advertise the design on your website, Facebook, Etsy, Instagram or any other digital platform you MUST ONLY USE THE WATERMARKED PICTURE! You MAY NOT resell this design or use any part of it to create other designs for purchase. If you have any questions, feel free to message me! See more... FAQs SVG files are extremely flexible when it comes to size. Most often, SVG files can be resized to any size you need. However, going too small with a file size can cause issues with the cutting process. Files that are too small are sometimes lifted/picked up by the blade during cutting and can stick to the blade or the vinyl sheet. Resizing an image too large for your vinyl cutting machine will cause the design to have incomplete cut lines because your machine only registers specific parameters. For more information regarding the size and/or cutting parameters of your machine, I recommend visiting their official website. Due to the "instant download" feature of this listing, I am unable to offer returns/refunds. Once payment has been approved, you automatically receive the file - which is out of my control. If you purchased the same file more than once, I am happy to offer you a credit for the equal amount of the file purchased. However, you must purchase the same file from the same medium (Etsy) in order for me to accommodate the credit. I REALLY enjoy being creative and designing custom things. However, I do not create specific/custom designs that cannot be resold (this includes names, initials/monograms, dates, etc.). I am open to ideas and requests other than that! Simply message me with your ideas and requests! During the conversion process, the layers are converted to black and white. Once you open the file in your desired software program, you will be able to edit your layers into the colors of your choice. This isn't a big deal since you must load the color/material into your cutting machine. As long as THAT is the color you want, you will be good to go! If you are unhappy with your order, please send me a message via Etsy. I am more than happy to work with you to figure out what issues you are having or why you aren't happy. Having said that, I do not issue refunds. I have a 5-star average review and go above and beyond to try and help my customers that have issues/questions. And due to the "instant download" nature of the listings and files that were purchased, there is no way to return them. Once you gain access, they are your files forever. If you have separated "black and white" images in your zipped folder, those are PNG files. These are most common for those who "trace" the design in software rather than uploading a vector-formated design. The separated files makes it easier to trace and make "layers." Not many people take this approach, but it is there in case you need it. If the listing picture shows ONE color, then the design is created to be ONLY ONE color. Most software programs have features that allow you to "cut" designs and regroup the parts you want together. If you are unfamiliar with this, I recommend looking for some YouTube videos to better explain how to do this. In some software programs, the SVG is opened and is "one" grouped design. If you take the "black" color out and make cut lines colored, that should help you see. You can also ungroup/group the design as well. Again, YouTube videos are out there and can help explain this further. SVG files are extremely flexible when it comes to size. Most often, SVG files can be resized to any size you need. However, going too small with a file size can cause issues with the cutting process. Files that are too small are sometimes lifted/picked up by the blade during cutting and can stick to the blade or the vinyl sheet. Resizing an image too large for your vinyl cutting machine will cause the design to have incomplete cut lines because your machine only registers specific parameters. For more information regarding the size and/or cutting parameters of your machine, I recommend visiting their official website. Due to the "instant download" feature of this listing, I am unable to offer returns/refunds. Once payment has been approved, you automatically receive the file - which is out of my control. If you purchased the same file more than once, I am happy to offer you a credit for the equal amount of the file purchased. However, you must purchase the same file from the same medium (Etsy) in order for me to accommodate the credit. I REALLY enjoy being creative and designing custom things. However, I do not create specific/custom designs that cannot be resold (this includes names, initials/monograms, dates, etc.). I am open to ideas and requests other than that! Simply message me with your ideas and requests! During the conversion process, the layers are converted to black and white. Once you open the file in your desired software program, you will be able to edit your layers into the colors of your choice. This isn't a big deal since you must load the color/material into your cutting machine. As long as THAT is the color you want, you will be good to go! If you are unhappy with your order, please send me a message via Etsy. I am more than happy to work with you to figure out what issues you are having or why you aren't happy. Having said that, I do not issue refunds. I have a 5-star average review and go above and beyond to try and help my customers that have issues/questions. And due to the "instant download" nature of the listings and files that were purchased, there is no way to return them. Once you gain access, they are your files forever. If you have separated "black and white" images in your zipped folder, those are PNG files. These are most common for those who "trace" the design in software rather than uploading a vector-formated design. The separated files makes it easier to trace and make "layers." Not many people take this approach, but it is there in case you need it. If the listing picture shows ONE color, then the design is created to be ONLY ONE color. Most software programs have features that allow you to "cut" designs and regroup the parts you want together. If you are unfamiliar with this, I recommend looking for some YouTube videos to better explain how to do this. In some software programs, the SVG is opened and is "one" grouped design. If you take the "black" color out and make cut lines colored, that should help you see. You can also ungroup/group the design as well. Again, YouTube videos are out there and can help explain this further.	{ "pile_set_name": "Pile-CC" }
/* This file is part of PyMesh. Copyright (c) 2015 by Qingnan Zhou */ #include "ElementWiseIsotropicMaterial.h" #include <cassert> #include <sstream> #include <Core/Exception.h> #include "Material.h" using namespace PyMesh; ElementWiseIsotropicMaterial::ElementWiseIsotropicMaterial( Float density, MeshPtr material_mesh, const std::string& young_field_name, const std::string& poisson_field_name) : ElementWiseMaterial(density, material_mesh), m_young_field_name(young_field_name), m_poisson_field_name(poisson_field_name) { if (!m_material_mesh->has_attribute(m_young_field_name)) { std::stringstream err_msg; err_msg << "Cannot find attribute: " << m_young_field_name; throw RuntimeError(err_msg.str()); } if (!m_material_mesh->has_attribute(m_poisson_field_name)) { std::stringstream err_msg; err_msg << "Cannot find attribute: " << m_young_field_name; throw RuntimeError(err_msg.str()); } update(); } void ElementWiseIsotropicMaterial::update() { const size_t dim = m_material_mesh->get_dim(); if (dim == 2) { update_2D(); } else if (dim == 3) { update_3D(); } else { std::stringstream err_msg; err_msg << "Unknow dimention: " << dim; throw NotImplementedError(err_msg.str()); } } void ElementWiseIsotropicMaterial::update_2D() { const size_t num_faces = m_material_mesh->get_num_faces(); const VectorF& young = m_material_mesh->get_attribute(m_young_field_name); const VectorF& poisson = m_material_mesh->get_attribute(m_poisson_field_name); assert(young.size() == num_faces); assert(poisson.size() == num_faces); m_materials.resize(num_faces); for (size_t i=0; i<num_faces; i++) { m_materials[i] = Material::create_isotropic(2, m_density, young[i], poisson[i]); } } void ElementWiseIsotropicMaterial::update_3D() { const size_t num_voxels = m_material_mesh->get_num_voxels(); const VectorF& young = m_material_mesh->get_attribute(m_young_field_name); const VectorF& poisson = m_material_mesh->get_attribute(m_poisson_field_name); assert(young.size() == num_voxels); assert(poisson.size() == num_voxels); m_materials.resize(num_voxels); for (size_t i=0; i<num_voxels; i++) { m_materials[i] = Material::create_isotropic(3, m_density, young[i], poisson[i]); } }	{ "pile_set_name": "Github" }
Q: LCD module with backlight I am using COG-C144MVGI. I am trying to turn it on with my Raspberry Pi. I am not sure if I am following the "power on sequence" correctly. Does this kind of LCD modules work without backlight? I am wondering if I am supposed to get some kind of reaction on the screen even without backlight. Thank you. Here is the datasheet : https://www.avrfreaks.net/sites/default/files/COG-C144MVGI-08%20Full%20Spec.pdf A: Probably you will see information on the display when the backlight is off, but not when it is dark (or not so light). (Also, there exist LCD displays without backlight). However, a reason to switch backlight off, is to preserve current (especially useful in a battery operated system). Page 6/7 show information about LED A/LED K how to control the backlight.	{ "pile_set_name": "StackExchange" }
Q: Can I use Amazon SQS as a delay queue before sending to SNS? My system run on an Amazon autoscaling group and one feature allows user to user messaging and I have the following use case to resolve. A new message is sent in my application between users. A message to notify the the user by e-mail is dropped into a queue with a 60 second delay. This delay allows time for a realtime chat client (faye/angularjs) to see the message and mark it as viewed. After the delay the message is picked up, the "read" status is checked and if it has not been read by the client an e-mail is dispatched. Originally I was going to use a cronjob on each application server poll the message queue however it occurs to me it would be more efficient to use SNS to call some kind of e-mail sending endpoint (perhaps in Lambda). I can't see any way to have SNS poll SQS however, can anybody suggest how this could be done? Essentially I want SNS with a delay so that I don't spam somebody in a "live" chat with e-mail alerts. Thanks A: Unfortunately this is not yet available out of the box. The missing part is the generation of Amazon SNS notifications on message arrival/visibility by an Amazon SQS queue, be it via push (similar to Amazon S3 notifications, or via poll similar to Amazon Kinesis subscriptions (see The Pull/Push Event Models for more on the difference), which would both allow to directly connect an AWS Lambda function to the resp. SQS delay queue events, see e.g.: Lambda with SQS That being said, you can work around this limitations in a few ways, for example: trigger your Lambda function on schedule (e.g. once per minute), and poll your SQS delay queue from there scheduled Lambda functions are an eagerly awaited missing Lambda feature in turn, but it is more easily worked around, be it either by a cron job of yours, or Eric Hammond's Unreliable Town Clock (UTC) for example The AWS Lambda team has delivered many/most similar feature requests over recent month' btw., so I would expect them to offer both SQS event handling and scheduled Lambda functions over the course of the year still.	{ "pile_set_name": "StackExchange" }
Topic Notification Receive notification of new arrivals in your topics of interest. Hemingway, Ernest. The Enduring Hemingway: An Anthology of a Lifetime in Literature. New York: Scribners, 1974. First Printing of the First US Edition. A Near Fine tight copy with previous owner inscription on the flyleaf in a Near Fine price clipped dust jacket. This anthology spans the works of Hemingway from his first collection of stories up through "Islands in the Stream." The contents track Hemingway's life and writing career, chronologically and open with two chapters from "A Movealbe Feast" followed by the complete story collection "In Our Time", novel and story excerpts about the First World War, Hemingway's discovery of bullfighting followed by his experiences huinting in Africa and his Spanish Civil War writings, and lastly his sea stories culminating with part III of "Islands in the Stream.", 864 pages. Item #22029 ISBN: 0684137178	{ "pile_set_name": "Pile-CC" }
%s:4 PhanTypeMismatchArgumentNullableInternal Argument 2 ($cmp_function) is $closure of type ?\Closure but \usort() takes callable(mixed,mixed):int (expected type to be non-nullable)	{ "pile_set_name": "Github" }
// // echoprint-codegen // Copyright 2011 The Echo Nest Corporation. All rights reserved. // #ifndef CODEGEN_H #define CODEGEN_H // Entry point for generating codes from PCM data. #define ECHOPRINT_VERSION 4.12 #include <string> #include <vector> #ifdef _MSC_VER #ifdef CODEGEN_EXPORTS #define CODEGEN_API __declspec(dllexport) #pragma message("Exporting codegen.dll") #else #define CODEGEN_API __declspec(dllimport) #pragma message("Importing codegen.dll") #endif #else #define CODEGEN_API #endif class Fingerprint; class SubbandAnalysis; struct FPCode; class CODEGEN_API Codegen { public: Codegen(const float* pcm, unsigned int numSamples, int start_offset); std::string getCodeString(){return _CodeString;} int getNumCodes(){return _NumCodes;} static double getVersion() { return ECHOPRINT_VERSION; } private: Fingerprint* computeFingerprint(SubbandAnalysis *pSubbandAnalysis, int start_offset); std::string createCodeString(std::vector<FPCode> vCodes); std::string compress(const std::string& s); std::string _CodeString; int _NumCodes; }; #endif	{ "pile_set_name": "Github" }
At the heart of all the fretting over populism there is a dispute about the essential meaning of citizenship. Populism is often defended by reference to its root, populus, and presented as ordinary people taking control. The reality is that the last thing on earth that a supporter of populism wants is control over their own or the affairs of the republic; they are passive citizens. When thinking people complain of the lies and simplicities which fuel populist campaigns, they fail to appreciate that this content is not directed at them. They are irrelevant onlookers to a play for the support of fellow citizens who have a fundamentally different outlook. Crucially it is journalists who ensure that content reaches its intended target. You see, one view of citizenship pays little or no heed to meaningful participation – to deliberation – and cedes thinking to an elite. Because adherents complain about elites (variously labelled the establishment, the government or the political class) a fake anti-authoritarian image can appear; in truth it is more like petulant but dependent children complaining about their parents. It is a view that reduces citizenship to a desire to be well managed or led by a patriarchy which the dependent, passive citizen hopes will be benign.* There is competition then for the support of these citizens. Competition for the votes of such citizens is characterised by political communication which plays down, ignores or lies about risk. The most recent example is Brexit. Passive citizens were told that they could leave the EU without fear of adverse consequences. They could have been asked to assess the risks and decide on balance what would be best but that would not have served them. It would have made them unhappy and prompted cries for “leadership”. The first Syriza election win in Greece was another example. Frightened citizens were told that everything would be fine, that they could be delivered unproblematically from austerity. It turns out that a whole swathe of the coalition that was Syriza was fully aware of the risks, were talking among themselves about the Drachma and an isolated fresh start but they stayed quiet rather than perturb the simplicity. In Ireland we are burdened with the same authoritarian nonsense. When our entirely predictable property crash finally arrived, citizens who would prefer to be untroubled by risk assessment were offered a wide choice of potential parents. All said that there was an easy way out of austerity, that a country in desperate need of loans to pay welfare and state salaries could refuse to accept the conditions imposed by its one remaining lender and that there would be no adverse consequence. It is difficult to imagine a political controversy which does not involve the consideration of consequences, of advantages for some and disadvantages for others. However, the idea that a controversy over matters as large as the above could be presented by anyone as having small or few consequences is not merely absurd. It is an authoritarian gambit. The citizen who doesn’t want to be troubled with participation, argument, evaluation, judgement is a willing target for the authoritarian who will reassure, will relieve them of meaningful citizenship by offering leadership. This is the authoritarian who tells them not to worry, that nothing bad will happen, who talks in terms of being in touch with the people, who will likely even try to identify as anti-establishment. Crucially, complex argument and possible consequences will be dismissed as “scaremongering”, while expertise will be spurned as “establishment”. Familiar? Of course it’s familiar; it’s the parody of political discourse that has become not merely acceptable but normal. If you are not a citizen in need of a leader but one who wants to participate in the affairs of the republic, wants to have all the information and arguments in order to discuss what matters before coming to your decision, you may wonder how the repeated lies and simplicities could gather supporters. You may even have a haughty disdain for your fellow citizens, questioning their intelligence. The reality is that many citizens seek soothing codology because they prefer a quiet life. Moreover, the populist leader knows this and has no intention of wasting time in addressing the republican citizen. Indeed, there is no need to do so because the number of passive citizens is sufficient for success at the polls and may constitute a majority, even a large majority There’s nothing new about concern over citizen passivity. It has a track record from before J.S. Mill’s fear of the herd, through the Frankfurt Marxists, on even into music with Roger Waters , inspired by Neil Postman’s Amusing Ourselves to Death, and on it goes. In short, it’s a staple in theorising about democracy and the nature of citizenship. * Finally, where do journalists come into this? Well, they have a problem and a decision to make: they cannot at the same time serve the republican citizen while holding the passive citizen’s attention or serve the passive citizen without dismissing the needs of the republican citizen. Generally they stay out of trouble by covering everything in a fair, objective, impartial way and that’s one reason why public discourse and republican participation are threatened. _________________________ * A note to leftists who might be tempted to lead populism: The citizen who wants to be patronised is working class only in the way that the term is used by pollsters.	{ "pile_set_name": "Pile-CC" }
All relevant data is contained in the paper and supporting information files. Code used in this study is included in the Supporting Information files. 1 Introduction {#sec001} ============== Oscillatory neural activity is ubiquitous and covers a wide spatial and temporal scale from single neural cells to whole brain regions and from milliseconds to days. Neural oscillations are believed to be relevant for a wide range of brain activities from sensory information processing to consciousness \[[@pone.0174304.ref001]\]. It is believed that the phase of low frequency theta oscillations (4-8 Hz) drives the pyramidal cells and is used for information processing in the hippocampus \[[@pone.0174304.ref002]--[@pone.0174304.ref004]\]. Visual stimuli binding is believed to be related to the phase resetting of the fast frequency gamma band (30-70 Hz) \[[@pone.0174304.ref005]\]. Positive phase correlations between the theta rhythm and the amplitude of gamma oscillations were found during visual stimuli processing and learning \[[@pone.0174304.ref001], [@pone.0174304.ref006], [@pone.0174304.ref007]\] and during fear-related information processing \[[@pone.0174304.ref008], [@pone.0174304.ref009]\]. Theta rhythm resetting also drives cognitive processes \[[@pone.0174304.ref010]\]. Theoretical studies suggested that phase resetting could explain cross-frequency phase-locking of gamma rhythm within a theta cycle \[[@pone.0174304.ref011]\], which is the hallmark of successful memory retrieval \[[@pone.0174304.ref012], [@pone.0174304.ref013]\]. The phase of neural oscillations is also used to bridge a much wider frequency range from slow theta rhythms of large neural networks, such as those in the hippocampus, up to the individual fast spiking neurons used for speech decoding \[[@pone.0174304.ref014]\]. It was found that speech resets background (rest) oscillatory activity in specific frequency domains corresponding to the sampling rates optimal for phonemic and syllabic sampling \[[@pone.0174304.ref014], [@pone.0174304.ref015]\]. Phase resetting is also critical in the functioning of suprachiasmatic nucleus that produces a stable circadian oscillation by light-induced resetting of endogeneous rhythm \[[@pone.0174304.ref016], [@pone.0174304.ref017]\]. It was also shown that single sensory stimulus \[[@pone.0174304.ref018], [@pone.0174304.ref019]\] and periodic train of inputs \[[@pone.0174304.ref020], [@pone.0174304.ref021]\] induce phase resetting in electroencephalograms, which manifest as event-related evoked potentials. Most of neurobiologically inspired interval timing theories assume that neural oscillators and their relative phases could be used as internal clocks for biological rhythms \[[@pone.0174304.ref022]\]. It was experimentally and computationally found that noisy neural oscillators could produce accurate timing that also obeys scalar property, i.e. the temporal estimation error increases proportionally with the duration \[[@pone.0174304.ref023]--[@pone.0174304.ref025]\]. The attention mechanism phase resets neural oscillators and can produce either a stop or a delay in conditioned stimuli timing with intrudes such as gaps \[[@pone.0174304.ref026]\] or fear stimuli \[[@pone.0174304.ref027]\]. Recent optogentic experiments shown that the steady gamma rhythm of medial prefrontal cortex can be reset and entrained by light stimuli and modulated by amphetamines \[[@pone.0174304.ref028]\]. Delay embedding reconstruction of the phase space gave a low dimensional attractor suggesting a phase coupled model of medial prefrontal cortex that is reset by light stimuli \[[@pone.0174304.ref029]\]. Unidirectional coupling between neural oscillators, i.e. a master-slave system, suggests the simplest possible synchronization mechanism that uses phase resetting to drive a neural population to a desired phase-locked firing pattern. Phase resetting methodology has been successfully used for predicting one-to-one entrainment in networks where the receiving population always follows the driving population \[[@pone.0174304.ref030]--[@pone.0174304.ref032]\]. It was recently shown that unidirectional coupling also allows for "anticipated synchronization" \[[@pone.0174304.ref033]\] in which the receiving population anticipates the states of the driving population \[[@pone.0174304.ref034]\]. It has been analytically proven and numerically verified that time-delayed feedback can force coupled dynamical systems onto a synchronization manifold that involves the future state of the drive system, i.e. "anticipating synchronization" \[[@pone.0174304.ref033]\]. Such a result is counterintuitive since the future evolution of the drive system is anticipated by the response system despite the unidirectional coupling. It has been suggested that delayed coupling in dynamical systems separated by some distance can still promote synchronization despite the slow signal transmission and the unidirectional coupling. The first anticipating synchronization study of excitable systems was done by Ciszak et al \[[@pone.0174304.ref035]\], followed by more recent behavioral-related investigations \[[@pone.0174304.ref036], [@pone.0174304.ref037]\]. Synaptic delay and synaptic plasticity was recently extensively investigated as potential control parameters that can lead to tunable delayed and anticipating synchronization in neural networks \[[@pone.0174304.ref038]--[@pone.0174304.ref040]\]. We investigated analytically and numerically a three-neuron master-slave system with a dynamic inhibitory loop that was previously shown experimentally to exhibit anticipating synchronization \[[@pone.0174304.ref041], [@pone.0174304.ref042]\]. The three-neuron network investigated here was shown to produce both delayed synchronization, in which pre-synaptic neuron fires a spike before post-synaptic neuron, and anticipating synchronization. It was argued that the delayed synchronization is a possible mechanism for spike-timing dependent plasticity \[[@pone.0174304.ref040]\], whereas anticipating synchronization could contribute to long term depression of synaptic couplings \[[@pone.0174304.ref040]--[@pone.0174304.ref042]\]. This study focuses on deriving analytic criteria for the existence and the stability of phase-locked modes in a three-neuron network that was found to generate both delayed and anticipated synchronization. For this purpose, we used the method of phase response curve (PRC) \[[@pone.0174304.ref032], [@pone.0174304.ref043]--[@pone.0174304.ref050]\]. The novelties of this study are (1) the generalization of PRC to multiple inputs per cycle and (2) the prediction of phase-locked modes in a neural network that is no longer limited to one-to-one firing patterns. 2 Phase response curve method {#sec002} ============================= The phase response curve (PRC) method has been extensively used for predicting phase-locked modes in neural networks \[[@pone.0174304.ref051]--[@pone.0174304.ref054]\]. It assumes that the only effect of a stimulus is to reset the phase of the ongoing oscillation of a neuron. Traditionally, the PRC tabulates the transient change in the firing frequency of a neural oscillator in response to one external stimulus per cycle of oscillation. The term PRC has been used almost exclusively in regard to a single stimulus per cycle of neural oscillators. Recently, we suggested a generalization of the PRC that allowed us to account for the overall resetting when two or more inputs are delivered during the same cycle \[[@pone.0174304.ref055]\]. As a result, we expanded the PRC theory from the prediction of the traditional one-to-one phase-locked modes to arbitrary phase-locked firing patterns. Here we present the first quantitative application of such generalized PRC approach to a realistic neural network with a dynamic feedback loop. In the case of a single stimulus, the PRC measures the change of the free running period P~i~ of a neural oscillator to a new value P~1~ (see [Fig 1A](#pone.0174304.g001){ref-type="fig"}). The stimulus time t~s~ is measured from an arbitrary phase reference φ = 0. In our numerical simulations, the phase reference was the zero crossing of the membrane potential with a positive slope. The relative change in the duration of the current cycle, i.e. the cycle that contains the perturbation, with respect to the unperturbed duration P~i~ determines the first order PRC in response to a single stimulus (for detailed mathematical definitions see [Appendix 1](#sec011){ref-type="sec"}). As a result of the perturbation, the new firing period becomes P~1~ = P~i~(1 + F^(1)^(φ)), where F^(1)^ represents the relative shortening/lengthening of the intrinsic firing period P~i~ due to the stimulus applied at phase φ = t~s~/P~i~ \[[@pone.0174304.ref047], [@pone.0174304.ref048], [@pone.0174304.ref050]\]. ![Typical PRCs for different classes of excitable cells.\ (A) The free running neural oscillator (continuous line) with an intrinsic period P~i~ is perturbed at stimulus time t~s~ by a brief current pulse (see shaded rectangle). As a result, the membrane potential is perturbed (dashed line) and the period of oscillation is transiently modified to P~1~, which induces a phase shift of all subsequent spikes. The time it takes a neuron to recover from a stimulus until it reaches the arbitrary zero phase reference again is called recovery time t~r~. Higher order PRCs measure the relative change in the firing period of the second and subsequent cycles (not shown). (B) Class I excitable cells can fire with arbitrarily low frequency by adjusting a bias current (solid circles), whereas class II excitable cells can only start firing at a minimum frequency (solid squares). The experimentally observed class I/class II distinction between neural oscillators translates in an (almost) one-to-one correspondence in type 1 (unimodal) PRCs (C) and, respectively, type 2 (bimodal) PRCs (D). The vertical arrow indicates a stimulus delivered at phase φ ≈ 0.2 that produces a 5% shortening of the intrinsic firing period in a type 1 (C) and 1% resetting in a type 2 (D) neural oscillator. The neural network for which we used the PRC to predict the phase-locked modes has three neurons: \#1 is the pacemaker (master) of the network as it receives no feedback and drive the half-center formed with neurons \#2 and \#3; neuron \#2 (slave) receives two inputs: one forward excitatory (open triangle) from the master neuron \#1 and the other inhibitory (solid circle) from the interneuron \#3; the interneuron \#3 only receives one excitatory input (open triangle) from neuron \#2 (slave) (E).](pone.0174304.g001){#pone.0174304.g001} A saddle-node bifurcation, which presents a continuous frequency versus bias current (f-I) curve that extends to arbitrarily low frequencies (see solid circles in [Fig 1B](#pone.0174304.g001){ref-type="fig"}) usually leads to a type 1 PRC that looks unimodal as in [Fig 1C](#pone.0174304.g001){ref-type="fig"} (although for counterexamples see \[[@pone.0174304.ref049], [@pone.0174304.ref056]\]). [Fig 1C](#pone.0174304.g001){ref-type="fig"} shows a typical type 1 PRC in response to a brief excitatory current perturbation that produces only phase advances (period shortening), i.e. negative resettings. A type 1 PRC looks unimodal and is often associated with a class I excitable cell, i.e. a cell that can produce stable oscillatory activity with arbitrarily low frequency \[[@pone.0174304.ref057], [@pone.0174304.ref058]\]. Usually, such excitable cells produce stable oscillations via a saddle node bifurcation on an invariant circle \[[@pone.0174304.ref059]\]. A type 2 PRC looks bimodal (see [Fig 1D](#pone.0174304.g001){ref-type="fig"}) and is often associated with a class II excitable cell \[[@pone.0174304.ref057], [@pone.0174304.ref058]\]. Class II oscillations usually emerge through a Hopf bifurcation \[[@pone.0174304.ref059]\] (see [Fig 1B](#pone.0174304.g001){ref-type="fig"}). As a side note, it was recently shown that type 1 (unimodal) PRCs do not always come from a class I excitable cell \[[@pone.0174304.ref056]\] and in fact all PRCs are bimodal with varying degrees \[[@pone.0174304.ref049], [@pone.0174304.ref050]\]. Close to the bifurcation point, accurate analytical formulas called normal forms describe the PRCs (see \[[@pone.0174304.ref057]\] and [Appendix 1](#sec011){ref-type="sec"} for mathematical details), which we used in this study to get some analytical insights into the general behavior of the three-neuron network with a dynamic loop shown in [Fig 1E](#pone.0174304.g001){ref-type="fig"}. The key assumption in generalizing the PRC method to multiple inputs per cycle was that the resetting induced by one stimulus takes effect "almost" instantaneously, i.e. before the arrival of the next stimulus \[[@pone.0174304.ref055]\]. Therefore, the effects of two stimuli applied during the same cycle are independent of each other. As a result, we used the single stimulus PRCs (F^(1)^) shown in [Fig 1C and 1D](#pone.0174304.g001){ref-type="fig"} to compute the phase resetting in response to two or more stimuli (see [Appendix 1](#sec011){ref-type="sec"} for the detailed mathematical derivation of F^(2)^ and its generalization). Briefly, the first stimulus delivered at stimulus phase φ~a~ = t~sa~/P~i~ produces a transient change in the firing period to P~a~ = P~i~(1 + F^(1)^(φ~a~)). The second stimulus that arrives at a stimulus phase φ~b~ = t~sb~/P~a~ \> φ~a~ further changes the firing period to P~b~ = P~a~(1 + F^(1)^(φ~b~)) (see [Appendix 1](#sec011){ref-type="sec"}). Combining the above effects of the two stimuli applied at phases φ~a~ and φ~b~, the new firing period P~b~ becomes P~b~ = P~i~(1 + F^(2)^(φ~a~, φ~b~)) (see [Appendix 1](#sec011){ref-type="sec"} for a detailed mathematical derivation). A typical two stimuli protocol (see [Fig 2A](#pone.0174304.g002){ref-type="fig"}) and the corresponding phase resetting F^(2)^ are shown in [Fig 2B](#pone.0174304.g002){ref-type="fig"}, where the three-dimensional surface is given by [Eq (22)](#pone.0174304.e100){ref-type="disp-formula"} in Appendix 1 and a two-dimensional contour plot also shows the contours of equal phase resetting. For this plot we used the analytical normal form of the PRC (see [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} in [Appendix 1](#sec011){ref-type="sec"}) where P~2i~ = 70 ms and the coupling strengths from neuron 1 to neuron 2 was g~12~ = 0.015 (excitatory) and from neuron 3 to neuron 2 was g~32~ = 0.002 (inhibitory) (see section 3 for a detailed description of the neural model and the synaptic couplings). ![Typical two stimuli PRC.\ (A) Two brief stimuli delivered at stimulus times t~sa~ and, respectively, t~sb~. The first stimulus transiently modifies the intrinsic firing period P~i~ to a new value P~a~ = P~i~(1 + F^(1)^(φ~a~)), where φ~a~ = t~sa~/P~i~. The second stimulus arrived at a new phase φ~b~ = t~ab~/P~a~ that found a modified firing period P~a~ and, therefore, further reset the firing period to P~b~ = P~a~(1 + F^(1)^(φ~b~)). (B) A typical two stimuli phase response surface for a class I excitable cell.](pone.0174304.g002){#pone.0174304.g002} 3 The neural model {#sec003} ================== In their seminal work on giant squid axon, Hodgkin and Huxley \[[@pone.0174304.ref060]--[@pone.0174304.ref064]\] experimentally identified three classes, or types, of axonal excitability: class I, where the repetitive firing is controlled by the intensity of an external stimulus; class II, where the firing frequency is almost independent on stimulus intensity; and class III, where there are no endogenous bursters regardless of stimulus intensity or duration. Our simulations were performed using a class I, single compartment, neural oscillator described by a standard conductance-based, or Hodgkin-Huxley (HH), mathematical model \[[@pone.0174304.ref064]--[@pone.0174304.ref066]\]. The rate of change of membrane potential is: $$\begin{array}{rcl} {dV/dt} & = & {- I_{Ca} - I_{K} - I_{Leak} + I_{0}} \\ & = & {- {\overline{g}}_{Ca}m\left( V \right)\left( V - E_{Ca} \right) - {\overline{g}}_{K}w\left( V - E_{K} \right) - {\overline{g}}_{Leak}\left( V - E_{Leak} \right) + I_{0},} \\ \end{array}$$ where V is the membrane potential, ${\overline{g}}_{ch}$ and E~ch~ are the maximum conductance and, respectively, the reversal potential for ionic channel ch (only calcium, potassium and leak were considered), w is the instantaneous probability that a potassium channel is open, and I~0~ is a constant bias current. Each ionic current is the product of a voltage-dependent conductance and a driving force I~ch~ = g~ch~(V)(V − V~ch~) where g~ch~(V) is the product of the maximum conductance for that channel and a specific voltage-dependent gating variable. Morris and Lecar (ML) mathematical model has two non-inactivating voltage-sensitive gating variables: one instantaneous, voltage-dependent, calcium activation m(V) and a delayed voltage-dependent potassium w given by a first order differential equation \[[@pone.0174304.ref067]\]: $$\begin{array}{r} {dw/dt = \phi\left( w_{\infty}\left( V \right) - w \right)/\tau\left( V \right),} \\ \end{array}$$ where ϕ is a temperature-dependent parameter, and a voltage-dependent relaxation time constant is defined by τ(V) = cosh^−1^((V − V~w,1/2~)/(2V~w,slope~)). All open-state probability functions, or steady-state gating variables x, have a sigmoidal form \[[@pone.0174304.ref067]\]: $$\begin{array}{r} {x\left( V \right) = \left( 1 + \tanh\left( \left( V - V_{x,1/2} \right)/V_{x,slope} \right) \right)/2,} \\ \end{array}$$ where V~x,1/2~ is the half-activation voltage and V~x,slope~ is the slope factor for the gating variable x. The ML model is widely used in computational neuroscience because it captures relevant biological processes and, at the same time, by changing only a small subset of parameters it can behave either as a type 1 or a type 2 neural oscillator. The dimensionless parameters for a type 1 ML neuron are: V~m,1/2~ = −0.01, V~m,slope~ = 0.15, V~w,1/2~ = 0.1, V~w,slope~ = 0.145, V~K~ = −0.7, V~Leak~ = −0.5, V~Ca~ = 1.0, ${\overline{g}}_{Ca} = 1.33$, ${\overline{g}}_{K} = 2.0$, ${\overline{g}}_{Leak} = 0.5$, I~0~ = 0.070, and ϕ = 0.6 (Ermentrout, 1996). The model's equations and its parameters are in dimensionless form with all voltages divided by the calcium reversal potential V~Ca0~ = 120 mV, all conductances divided by ${\overline{g}}_{Ca0} = 4$ mS/cm^2^, and all currents normalized by ${V_{Ca0}{\overline{g}}_{Ca0} = 480}\mspace{600mu}\mu\text{A}/\text{cm}^{2}$ (Ermentrout, 1996). For example, a dimensionless reversal potential for a leak current of V~Leak~ = −0.5 means V~Leak~ = −0.5V~Ca0~ = −0.5 × 120 mV = -60 mV. The Synaptic Model. We implemented fast chemical synapses between neurons given by a synaptic current $I_{syn} = {\overline{g}}_{syn}s\left( t \right)\left( V_{post} - E_{syn} \right)$, where ${\overline{g}}_{syn}$ is the maximum synaptic conductance, s(t) is the fraction of channels activated by neurotransmitters, V~post~ is the membrane potential of the postsynaptic neuron, and E~syn~ is the reversal potential of the synaptic coupling. We used E~syn~ = 0 for excitatory and E~syn~ = −0.6 for inhibitory coupling. The synapses activation was described by a first order kinetics s′ = αT(1 − s) − βs, where α = 15, β = 1.5, and neurotransmitter binding was described by a sigmoidal function T(V~pre~) = 1/(1 + e^(−V~pre~\ −\ 0.2)120/5)^) where V~pre~ is the membrane potential of the presynaptic neuron. We numerically computed the PRCs in open loop setup, i.e. by injecting a single synaptic input from a corresponding presynaptic neuron for neurons 2 and 3 shown in [Fig 3](#pone.0174304.g003){ref-type="fig"} for our neural network configuration. ![Typical phase-locked mode with one neuron receiving two inputs per cycle.\ Neuron \#1 is the driver of the entire network and its intrinsic firing period P~1i~ was used as reference duration for all other intrinsic periods. The neuron's spike is represented by a thick vertical line. The coupling between the neurons is marked by vertical dashed lines that terminate either with an excitatory (empty triangle) or a inhibitory (solid circle) synapse. Neuron \#2 receives 2 inputs during one cycle: the first is an inhibition at stimulus time t~2sa~ from the interneuron \#3 and later on it receives an excitatory input from neuron \#1 at stimulus time t~2sb~. The neuron recovers from the last stimulus after t~2r~ and fires again. Neuron \#3 only receives one excitatory input per cycle from neuron \#2.](pone.0174304.g003){#pone.0174304.g003} 4 The neural network model {#sec004} ========================== In order to use the PRC method (see section 2) for predicting the relative phases of neurons in a phase-locked firing pattern, we assumed a fixed firing order of the three neurons with the goal of determining if such a pattern exists and if it is stable. Based on the neural network model proposed for delayed and anticipated synchronization by Matias et al \[[@pone.0174304.ref040]--[@pone.0174304.ref042]\], we identified the following definitions for the firing period of each neuron (see [Fig 3](#pone.0174304.g003){ref-type="fig"}): $$\begin{array}{rcl} P_{1} & = & {t_{2r}\left\lbrack n - 1 \right\rbrack + t_{2sb}\left\lbrack n \right\rbrack,} \\ P_{2} & = & {t_{2sb}\left\lbrack n \right\rbrack + t_{2r}\left\lbrack n \right\rbrack,} \\ P_{3} & = & {t_{2sb}\left\lbrack n \right\rbrack - t_{2sa}\left\lbrack n \right\rbrack + t_{2r}\left\lbrack n \right\rbrack + t_{2sa}\left\lbrack n + 1 \right\rbrack,} \\ \end{array}$$ where t~2r~ is the recovery time of neuron \#2 after its last input, t~2sa~ and t~2sb~ are the corresponding stimulus times for the first and, respectively, the second input to neuron \#2, and the index of the cycle is marked with the square brackets \[...\]. The subscript index refers to the neural oscillator index according to [Fig 3](#pone.0174304.g003){ref-type="fig"}. From [Eq (4)](#pone.0174304.e012){ref-type="disp-formula"} we eliminated t~2r~\[n − 1\] = P~1i~ − t~2sb~\[n\] and substituted it into the other two equations, which led to: $$\begin{array}{rcl} P_{2} & = & {t_{2sb}\left\lbrack n \right\rbrack + P_{1i} - t_{2sb}\left\lbrack n + 1 \right\rbrack,} \\ P_{3} & = & {t_{2sb}\left\lbrack n \right\rbrack - t_{2sa}\left\lbrack n \right\rbrack + P_{1i} - t_{2sb}\left\lbrack n + 1 \right\rbrack + t_{2sa}\left\lbrack n + 1 \right\rbrack.} \\ \end{array}$$ Based on the definitions of the PRCs (see Eqs ([16](#pone.0174304.e093){ref-type="disp-formula"}) and ([22](#pone.0174304.e100){ref-type="disp-formula"}) in [Appendix 1](#sec011){ref-type="sec"}), we further expanded [Eq (5)](#pone.0174304.e013){ref-type="disp-formula"} the transiently modified firing period in terms of experimentally determined PRCs: $$\begin{array}{rcl} {P_{2i}\left( 1 + F^{(2)}\left( t_{2sa}\left\lbrack n \right\rbrack,t_{2sb}\left\lbrack n \right\rbrack \right) \right)} & = & {t_{2sb}\left\lbrack n \right\rbrack + P_{1i} - t_{2sb}\left\lbrack n + 1 \right\rbrack,} \\ {P_{3i}\left( 1 + F^{(1)}\left( t_{s3}\left\lbrack n \right\rbrack \right) \right)} & = & {t_{2sb}\left\lbrack n \right\rbrack - t_{2sa}\left\lbrack n \right\rbrack + P_{1i} - t_{2sb}\left\lbrack n + 1 \right\rbrack + t_{2sa}\left\lbrack n + 1 \right\rbrack.} \\ \end{array}$$ The above system of two recursive equations has two unknowns, i.e. t~2sa~ and t~2sb~, that describe the temporal evolution of the relative phase of neural oscillators from the firing cycle \[n\] to \[n + 1\]. 5 The existence of phase-locked modes {#sec005} ===================================== Let us assume that there is a steady state solution $\left( t_{2sa}^{},t_{2sb}^{} \right)$ for the recursive [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"} that mimics the activity of the neural network shown in [Fig 3](#pone.0174304.g003){ref-type="fig"}, i.e. the following limits exist $\lim\limits_{n\infty}t_{2sa}\left\lbrack n \right\rbrack = t_{2sa}^{}$ and $\lim\limits_{n\infty}t_{2sa}\left\lbrack n \right\rbrack = t_{2sa}^{}$. By substituting the steady state, i.e. phase-locked mode, solution $\left( t_{2sa}^{},t_{2sb}^{} \right)$ into [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"} one obtains: $$\begin{array}{rcl} {P_{2i}\left( 1 + F_{2}^{(2)}\left( t_{2sa}^{},t_{2sb}^{} \right) \right)} & = & {P_{1i},} \\ {P_{3i}\left( 1 + F_{3}^{(1)}\left( P_{1i} - t_{2sa}^{} \right) \right)} & = & {P_{1i},} \\ \end{array}$$ where we used the fact that $t_{3s}^{} = t_{2sb}^{} - t_{2sa}^{} + t_{2r}^{}$ and that t~2r~\[n* − 1\] = P~1i~ − t~2sb~\[n\], which led to $t_{3s}^{} = t_{2sb}^{} - t_{2sa}^{} + P_{1i} - t_{2sb}^{} = P_{1i} - t_{2sa}^{}.$ As we notice from the second equation in [Eq (7)](#pone.0174304.e019){ref-type="disp-formula"}, the steady state value $t_{2sa}^{}$ could be immediately determined and it only depends on P~1i~, P~3i~, and the PRC of the third neuron, which depends on the coupling strength g~23~. It results that the steady state value $t_{2sa}^{}$ is given by: $$\begin{array}{r} {F_{3}^{(1)}\left( P_{1i} - t_{2sa}^{} \right) = \frac{P_{1i}}{P_{3i}} - 1.} \\ \end{array}$$ Since the coupling from neuron \#2 to neuron \#3 is excitatory, the PRC is negative (only advances the next spike), i.e. $F_{3}^{(1)}\left( \varphi \right) < 0$. As a result of [Eq (8)](#pone.0174304.e024){ref-type="disp-formula"}, the steady states $t_{2sa}^{}$ can only exist for P~1i~ \< P~3i~ which means that the interneuron (neuron \#3) must be slower than the pacemaker (neuron \#1) of the network. Moreover, since a type 1 PRC in response to excitatory inputs has only one negative minimum ($F_{3,min}^{(1)}$) that determines the magnitude of the strongest possible resetting, then $\frac{P_{1i}}{P_{3i}} - 1 \geq F_{3,min}^{(1)}$, which means the the interneuron intrinsic period is bounded by $P_{1i} < P_{3i} < P_{1i}/\left( 1 + F_{3,min}^{(1)} \right).$ Once we determined the steady state $t_{2sa}^{}$ from [Eq (8)](#pone.0174304.e024){ref-type="disp-formula"}, then we plugged it into the first [Eq (7)](#pone.0174304.e019){ref-type="disp-formula"} and found $t_{2sb}^{}.$ Using the PRC definition (see [Eq (22)](#pone.0174304.e100){ref-type="disp-formula"} from [Appendix 1](#sec011){ref-type="sec"}) we obtained: $$\begin{array}{r} {P_{2i}\alpha\left( 1 + F_{2}^{(1)}\left( \frac{t_{2sb}^{}}{\alpha} \right) \right) = P_{1i},} \\ \end{array}$$ where $\alpha = 1 + F_{2}^{(1)}\left( t_{2sa}^{} \right).$ The above equation can be reduced to: $$\begin{array}{r} {F_{2}^{(1)}\left( \frac{t_{2sb}^{}}{\alpha} \right) = \frac{P_{1i}}{P_{2i}\alpha} - 1,} \\ \end{array}$$ We must emphasize that $F_{2}^{(1)}\left( t_{2sa}^{} \right)$ and $F_{2}^{(1)}\left( t_{2sb}^{} \right)$ are two different single stimulus PRCs for the same neuron. Here $F_{2}^{(1)}\left( t_{2sa}^{} \right)$ is the single stimulus phase response curve of the second neuron to an input received from the third neuron, i.e. $F_{2}^{(1)}\left( t_{2sa}^{} \right)$ is determined by g~32~. Similarly, $F_{2}^{(1)}\left( t_{2sb}^{} \right)$ is the single stimulus phase response curve of the second neuron in response to an input received from the first neuron, i.e. $F_{2}^{(1)}\left( t_{2sb}^{} \right)$ is determined by g~12~. 5.1 Explicit steady state solutions using normal form generic type 1 PRCs {#sec006} ------------------------------------------------------------------------- In order to get insights into the general existence criteria for steady state (phase-locked modes) derived above, we assumed that the single stimulus and the generalized PRCs are quite well approximated by the corresponding normal forms given by [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"} and, respectively, by [Eq (22)](#pone.0174304.e100){ref-type="disp-formula"} in Appendix 1. Then the steady state solution $t_{2sa}^{}$ of [Eq (8)](#pone.0174304.e024){ref-type="disp-formula"} can be analytically written as: $$\begin{array}{r} {\cos\left( 2\pi\left( \frac{P_{1i}}{P_{3i}} - \frac{t_{2sa}^{}}{P_{3i}} \right) \right) = 1 - \frac{1}{c_{23}P_{3i}}\left( \frac{P_{1i}}{P_{3i}} - 1 \right).} \\ \end{array}$$ By least square fitting the numerically generated PRCs for each neuron in response to a single spike from its corresponding presynaptic neuron with the theoretical formula of the normal form given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"}, we found a quantitative relationship between the abstract coupling strength coefficient c and the physiologically measurable maximum synaptic couplings $\overline{g}$ (see [Appendix 1](#sec011){ref-type="sec"}). Therefore, in order to simplify the mathematical notation, throughout the rest of the paper we only write, for example, c~23~ when referring to the coefficient of the theoretical normal form of the PRC with the understanding that it is a known function of the synaptic conductance, i.e. c~23~ = c~23~(g~23~). Since −1 ≤ cos(x)≤1, it results that $0 \leq \frac{1}{c_{23}\left( g_{23} \right)P_{3i}}\left( \frac{P_{1i}}{P_{3i}} - 1 \right) \leq 2$, which determines the minimum coupling strength g~23~ for a given ratio of the two intrinsic firing periods $\frac{P_{1i}}{P_{3i}}$ to attain a phase-locked mode pattern. Based on the above relationship, for excitatory coupling, i.e. E~syn~ = 0, the master (pacemaker) neuron \#1 (see [Fig 3](#pone.0174304.g003){ref-type="fig"}) must be faster than the interneuron \#3, i.e. P~1i~ \< P~3i~. At the same time, the coupling strength g~23~ must also be strong enough to reset the longer intrinsic period P~3i~ to match the shorter period of the network's pacemaker, i.e. to ensure that $P_{3i} < P_{1i}/\left( 1 + F_{3,min}^{(1)} \right)$. The above relationship allowed us to estimate that, if the coupling is very strong (g~23~∞), then the steady state from [Eq (11)](#pone.0174304.e042){ref-type="disp-formula"} has the solution $t_{2sa}^{} = P_{1i} + kP_{3i}$ with k* = 0,±1,±2,..., which is marked by vertically downward arrows in [Fig 4](#pone.0174304.g004){ref-type="fig"}. Furthermore, if the two firing periods are approximately equal (P~1i~ ≈ P~3i~), then from [Eq (11)](#pone.0174304.e042){ref-type="disp-formula"} it results that $t_{2sa}^{} = kP_{1i}$ with k* = 0, 1, 2, ... (see also [Fig 4](#pone.0174304.g004){ref-type="fig"}). [Fig 4](#pone.0174304.g004){ref-type="fig"} also shows that for each intrinsic period ratio P~3i~/P~1i~ there is a minimum coupling strength g~23~ that ensures appropriate resetting of the interneuron. For example, the minimum coupling for P~3i~/P~1i~ = 1.5 (dotted red line in [Fig 4](#pone.0174304.g004){ref-type="fig"}) is g~23~ = 0.024. A stronger coupling of g~23~ = 0.036 is necessary for a larger ratio P~3i~/P~1i~ = 2 (dashed blue line in [Fig 4](#pone.0174304.g004){ref-type="fig"})). ![Minimum coupling strength g~23~ required for a given phase-locked mode time $t_{2sa}^{}$.\ (a) There are multiple possible solutions for $t_{2sa}^{}$ for the same coupling strength between neurons \#2 and \#3 due to the PRC periodicity. In the limit case of a very strong coupling (g~23~∞) the phase-locked stimulus time becomes $t_{2sa}^{} = P_{1i} + kP_{3i}$ (see the vertically downward arrows).](pone.0174304.g004){#pone.0174304.g004} The phase-locked modes $\left( t_{2sa}^{},t_{2sb}^{} \right)$ given by [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"} depend on three intrinsic periods P~1i~, P~2i~, P~3i~ and three synaptic conductances g~12~, g~23~, and g~32~. Since the master neuron receives no input, all durations were measured relative to P~1i~. The bias current for the computational model was set such that P~1i~ = 60 ms, P~2i~ = 70 ms and P~3i~ = 80 ms (see section 3 for details and supplemental files for a computational implementation). Intuitively, the phase-locked solution $t_{2sa}^{}$ is the stable interspike interval between neurons \#2 and \#3 (the interneuron). The other phase-locked solution $t_{2sb}^{}$ is the stable interspike interval between neurons \#2 and \#1 (network's driver). However, this simplification only reduces the parameter space to five dimensions. In order to reduce the parameter space to four dimensions, we only show examples of phase-locked modes for a fixed inhibitory coupling with g~32~ = 0.002 (arb. units). For a fixed intrinsic period of the second neuron P~2i~/P~1i~ = 70/60, the parameter space further reduces to three dimensions, which allowed us to visualize the phase-locked modes. The solution $t_{2sa}^{}$ of the second equation in [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"} only depends on P~3i~/P~1i~ and the coupling strength g~23~ (see the green surface in [Fig 5](#pone.0174304.g005){ref-type="fig"}). ![Phase-locked solutions $t_{2sa}^{}$ and $t_{2sb}^{}$ (vertical axes) versus the intrinsic period of the interneuron P~3i~ and the coupling strength g~23~.\ (A) The first stimulus time $t_{2sa}^{}$ only depends on P~3i~/P~1i~ and g~23~---see green surface. For a fixed intrinsic period ratio P~2i~/P~1i~ = 70/60, the second stimulus time $t_{2sb}^{}$ depends also on the coupling strength g~12~ = 0.012 (red surface) and g~12~ = 0.05 (blue surface). (B) For a fixed coupling g~12~ = 0.015, the second stimulus time $t_{2sb}^{}$ dependence on the intrinsic firing periods P~2i~/P~1i~ = 60/60 (red surface) and P~2i~/P~1i~ = 70/60 (blue surface) shows that the solution space is wider for shorter intrinsic periods.](pone.0174304.g005){#pone.0174304.g005} However, the phase locked solution $t_{2sb}^{}$ of the first equation in [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"} depend on the additional coupling g~12~. Therefore, to gain insight into how g~12~ affects the solution $t_{2sb}^{}$, we used the same axis P~3i~/P~1i~ and g~23~ as for $t_{2sa}^{}$, but with different constant values of coupling g~12~ = 0.012 (red surface) and g~12~ = 0.05 (blue surface) in [Fig 5A](#pone.0174304.g005){ref-type="fig"}. We notice from [Fig 5A](#pone.0174304.g005){ref-type="fig"} that increasing the strength of the excitatory coupling g~12~ leads to an increased stimulus time $t_{2sb}^{}$ and a wider parameter domain of the phase-locked solution. Similarly, if we hold constant the synaptic coupling g~12~ = 0.015 (arb. units) between the master and the slave neurons, then we could visualize the phase-locked solution for variable intrinsic period of the second neuron P~2i~/P~1i~ = 60/60 (red surface in [Fig 5B](#pone.0174304.g005){ref-type="fig"}) and P~2i~/P~1i~ = 70/60 (blue surface in [Fig 5B](#pone.0174304.g005){ref-type="fig"}). We notice that for smaller intrinsic periods P~2i~ the range of control parameters P~3i~/P~1i~ and g~23~ is broader. This is because for more similar firing frequencies it is easier to bring the driven neuron to the firing frequency of the driving neuron. 6 The stability of phase-locked modes {#sec007} ===================================== The possible phase-locked modes given by [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"} may not all be stable and, therefore, they may not be all experimentally observable. To determine the stability of the steady solutions $\left( t_{2sa}^{},t_{2sb}^{} \right)$, we assume small perturbations: $$\begin{array}{rcl} {t_{2sa}\left\lbrack n \right\rbrack} & = & {t_{2sa}^{} + \delta t_{2sa}\left\lbrack n \right\rbrack,} \\ {t_{2sb}\left\lbrack n \right\rbrack} & = & {t_{2sb}^{} + \delta t_{2sb}\left\lbrack n \right\rbrack,} \\ \end{array}$$ where the n^th^ cycle perturbation $\delta t_{2s}\left\lbrack n \right\rbrack < < t_{2s}^{}$ is assumed very small for both stimuli. By substituting [Eq (12)](#pone.0174304.e066){ref-type="disp-formula"} into the existence criteria from [Eq (7)](#pone.0174304.e019){ref-type="disp-formula"} and using a Taylor series expansion one obtains: $$\begin{array}{rcl} {m_{2a}\left( 1 + F_{2}^{(1)}\left( \varphi_{2b}^{} \right) - \varphi_{2b}^{} \right)\delta t_{2sa}\left\lbrack n \right\rbrack + m_{2b}\delta t_{2sb}\left\lbrack n \right\rbrack} & = & {\delta t_{2sb}\left\lbrack n \right\rbrack - \delta t_{2sb}\left\lbrack n + 1 \right\rbrack,} \\ {m_{3}\left( \delta t_{2sb}\left\lbrack n \right\rbrack - \delta t_{2sa}\left\lbrack n \right\rbrack - \delta t_{2sb}\left\lbrack n + 1 \right\rbrack \right)} & = & {\delta t_{2sb}\left\lbrack n \right\rbrack - \delta t_{2sa}\left\lbrack n \right\rbrack} \\ & = & {- \delta t_{2sb}\left\lbrack n + 1 \right\rbrack + \delta t_{2sa}\left\lbrack n + 1 \right\rbrack,} \\ \end{array}$$ where $m_{2a} = \left( \frac{\partial F_{2}^{(1)}}{\partial\varphi} \right)_{\varphi_{2a}^{}}$ is the slope of the second neuron's PRC at the phase of the first stimulus $\varphi_{2a}^{} = \frac{t_{s2a}^{}}{P_{2i}}$, $m_{2b} = \left( \frac{\partial F_{2}^{(1)}}{\partial\varphi} \right)_{\varphi_{2b}^{}}$ is the slope of the second neuron's PRC at the phase of the second stimulus $\varphi_{2b}^{} = \frac{t_{s2b}^{}}{P_{2i}\left( 1 + F_{2}^{(1)}\left( t_{2sa}^{} \right) \right)}$, $m_{3} = \left( \frac{\partial F_{3}^{(1)}}{\partial\varphi} \right)_{\varphi_{3}^{}}$ is the slope of the third neuron's PRC at the phase of the stimulus $\varphi_{2}^{} = \frac{t_{s3}^{}}{P_{3i}}$. The stability [Eq (13)](#pone.0174304.e068){ref-type="disp-formula"} can be rewritten in a matrix form as: $$\begin{array}{r} {\begin{pmatrix} 0 & {- 1} \\ 1 & {m_{3} - 1} \\ \end{pmatrix}\begin{pmatrix} {\delta t_{s2a}} \\ {\delta t_{s2b}} \\ \end{pmatrix}_{\lbrack n + 1\rbrack} = \begin{pmatrix} {m_{2a}\left( 1 + F_{2}^{(1)}\left( \varphi_{2b}^{} \right) - \varphi_{2b}^{} \right)} & {m_{2b} - 1} \\ {1 - m_{3}} & {m_{3} - 1} \\ \end{pmatrix}\begin{pmatrix} {\delta t_{s2a}} \\ {\delta t_{s2b}} \\ \end{pmatrix}_{\lbrack n\rbrack},} \\ \end{array}$$ which led us to a first order recursive relationship for the perturbations: $$\begin{array}{r} {\begin{pmatrix} {\delta t_{s2a}} \\ {\delta t_{s2b}} \\ \end{pmatrix}_{\lbrack n + 1\rbrack} = \begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \\ \end{pmatrix}\begin{pmatrix} {\delta t_{s2a}} \\ {\delta t_{s2b}} \\ \end{pmatrix}_{\lbrack n\rbrack},} \\ \end{array}$$ where a~11~ = (1 − m~3~)(1 − b), a~12~ = (m~3~ − 1)m~2b~, a~21~ = −b, and a~22~ = 1 − m~2b~ with $b = m_{2a}\left( 1 + F_{2}^{(1)}\left( \varphi_{2b}^{} \right) - m_{2b}\varphi_{2b}^{} \right).$ The stability of the steady state is determined by the eigenvalues of [Eq (15)](#pone.0174304.e076){ref-type="disp-formula"} (see the [Appendix 2](#sec014){ref-type="sec"} for the general stability conditions in a two-dimensional recursive map). We also must keep track of the third stability condition as the original recursive system in [Eq (4)](#pone.0174304.e012){ref-type="disp-formula"} contained three variables, which were reduced to two coupled recursive equations (see [Eq (5)](#pone.0174304.e013){ref-type="disp-formula"}) by eliminating the third variable, i.e. t~2r~\[n − 1\] = P~1i~ − t~2sb~\[n\]. As a result, the steady state of the previous substitution gives $t_{2r}^{} = P_{1i} - t_{2sb}^{}$ and the corresponding infinitesimal perturbation is δt~2r~\[n − 1\] = −δt~2sb~\[n\]. Therefore, the stability of $t_{2r}^{}$ solution is determined by the stability of δt~2sb~\[n\], which is already covered by [Eq (15)](#pone.0174304.e076){ref-type="disp-formula"} without involving additional control parameters. The general stability conditions for any first order recursion of two variables is discussed in details in the Appendix 2. Briefly, the trace Tr(A) = a~11~ + a~22~ and the determinant Det(A) = a~11~ a~22~ − a~12~ a~21~ of the recursion matrix in [Eq (15)](#pone.0174304.e076){ref-type="disp-formula"} determine the stability of each steady state obtained by solving [Eq (7)](#pone.0174304.e019){ref-type="disp-formula"}. 7 Numerical validation of the existence and the stability criteria {#sec008} ================================================================== The analytically derived criteria for the existence (see section 5) and stability (see section 6) of phase-locked modes in a master-slave network with a dynamic loop (see [Fig 3](#pone.0174304.g003){ref-type="fig"}) were only based on PRCs in response to a single stimulus. We checked our theoretical predictions based on open loop PRCs against the numerical simulations of the actual neural networks implemented according to the model presented in section 3, i.e. closed loop (fully connected neural network). The analytical normal form PRC formulas (see [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} in [Appendix 1](#sec011){ref-type="sec"}) were convenient analytical tools and even led us to some analytical results in the preceding sections. However, for the actual comparison between the multiple stimuli PRC-based phase-locked mode prediction (open loop) and the numerical simulations results of the fully coupled neural network (see [Fig 3](#pone.0174304.g003){ref-type="fig"}) we used numerically generated open lopp PRCs. The reason is that, although the analytical normal form of type 1 PRC given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} (see dashed red line in [Fig 6A](#pone.0174304.g006){ref-type="fig"}) is close to the numerically (experimentally) generated open loop PRC (see dotted blue curve in [Fig 6A](#pone.0174304.g006){ref-type="fig"}), we wanted a more accurate prediction based on the real-world PRC as it is generated in wet lab/numerical experiments. ![Phase-locked modes in fully coupled neural network.\ (A) The numerically generated PRC in open loop setup in response to a single triangularly shaped stimulus (solid circles) was fitted to the theoretical PRC given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} to determined the conversion factor between the model-dependent coupling constant c* in [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} and the synaptic coupling g~syn~. (B) A typical stable phase locked mode in which neuron \#2 (dashed line) receives two inputs during a single cycle: first from neuron \#3 (dotted line) at $t_{2sa}^{}$ and then from neuron \#1 (continuous line) at $t_{2sb}^{}$. The experimental values for the phase locked mode as measured from panel (B) were $t_{2sa}^{} = 15.2$ ms and $t_{2sb}^{} = 40.2$ ms whereas the PRC-based predictions were $t_{2sa}^{} = 18.0$ ms and $t_{2sb}^{} = 44.1$ ms. The network's firing period was P = 60 ms = P~1i~.](pone.0174304.g006){#pone.0174304.g006} We also used the least square minimization to fit actual PRCs (see dotted curve in [Fig 6A](#pone.0174304.g006){ref-type="fig"}) with the theoretical formula given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} in order to establish the conversion factor between the model-dependent coupling constant c in the theoretical formula given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} and the synaptic constant g~syn~ used in our numerical simulations. The Mathematica file that contains the implementation of the neural network shown in [Fig 3](#pone.0174304.g003){ref-type="fig"} based on the model equations provided in section 3 is available in supplemental files section. The synaptic couplings used for the example shown in [Fig 6B](#pone.0174304.g006){ref-type="fig"} were g~12~ = 0.015, g~32~ = 0.002, and g~23~ = 0.0275, which led to a phase locked mode with $t_{2sa}^{} = 15.2$ ms and $t_{2sb}^{} = 40.2$ ms. The PRC-based predictions were $t_{2sa}^{} = 18.0$ ms (about 18% error) and $t_{2sb}^{} = 44.1$ ms (about 10% error). We found that the eigenvalues of the stability matrix were λ~1~ = 0.489, and λ~2~ = 0.779, which indicated that the predicted mode was stable. Discussion {#sec009} ========== Since even for a small unidirectionally coupled three-neuron network the parameter space is six-dimensional, i.e. three intrinsic firing periods (P~1i~, P~2i~, and P~3i~), one unidirectional synaptic coupling between master-slave neurons (g~12~), and two coupling constants for the feedback loop (g~23~ and g~32~), we reduced it to manageable dimensions in order to visualize the phase-locked solution. Since the master neuron receives no feedback from the network, its intrinsic firing period P~1i~ was considered the reference duration, which reduces the parameter space to five dimensions. We further reduced the parameter space to four dimensions using a fixed value for the inhibitory coupling of the interneuron, i.e. g~32~ = 0.002 (arb. units). We numerically found the phase locked modes $\left( t_{2sa}^{},t_{2sb}^{} \right)$ by considering two separate cases: (1) fixed period of slave neuron \#2, of which we only show two examples with P~2i~/P~1i~ = 60/60 and P~2i~/P~1i~ = 70/60 in [Fig 5A](#pone.0174304.g005){ref-type="fig"} and (2) fixed master-slave synaptic coupling, of which we only showed two examples with g~12~ = 0.012 and g~12~ = 0.05 in [Fig 5B](#pone.0174304.g005){ref-type="fig"}. In all numerical simulations, the free parameters were the intrinsic period of the interneuron P~3i~ and the excitatory synaptic coupling to that neuron (g~23~). The reason is that it was previously shown that the interneuron through its intrinsic properties and its synaptic coupling can lead to either delayed or anticipating synchronization in this neural network \[[@pone.0174304.ref040], [@pone.0174304.ref042]\] and our goal was to closely match previous experimental findings using the newly developed generalized PRC method. Based on [Fig 5](#pone.0174304.g005){ref-type="fig"}, an increase in the strength of the master-slave synaptic coupling g~12~ leads to a larger phase difference between the two steady states $t_{2sa}^{}$ and $t_{2sb}^{}$. At the same time, the parameter space of the interneuron (P~3i~, g~22~) becomes wider. Another possibility for broadening the parameter space was to bring the intrinsic firing period of the slave neuron \#2 closer the the master neuron \#1, i.e. by reducing network heterogeneity. All out numerical simulations are in agreement with previously observed firing patterns in this type of neural network \[[@pone.0174304.ref040], [@pone.0174304.ref042]\]. Conclusions {#sec010} =========== We used a phase response curve method to predict the existence and the stability of phase-locked modes in a master-slave networks with a dynamic feedback loop. This study brings two novel solutions to phase-locked mode prediction in neural networks. First, we generalized the the phase response curve definition to include the more realistic case when neural oscillators receive more than one input per cycle. Secondly, we applied the generalized phase resetting definition to a biologically relevant neural network that has been shown to produce both delayed and anticipated synchronization. Predicting phase-locked modes in large neural networks usually requires as a first step a complexity reduction to manageable subnetworks of two neurons \[[@pone.0174304.ref068], [@pone.0174304.ref069]\] or, whenever possible, reduces the entire network to a two-population network \[[@pone.0174304.ref070]\]. Our PRC generalization to multiple inputs per cycle is a significant advance in phase resetting theory that allows investigation of large networks in which individual neurons receive multiple inputs per cycle without assuming special network connectivity. Furthermore, our generalization of phase response curve and its proof of concept application to predicting phase-locked modes existence and stability in a biologically relevant three-neuron network with a dynamic feedback loop is not limited to weak coupling nor to only one-to-one firing patterns. Indeed, the coupling strengths used were quite large such that it reset the firing period of the interneuron \#3 by 25% from 80 ms to 60 ms. Appendix 1 {#sec011} ========== Single stimulus phase response curve method {#sec012} ------------------------------------------- There are two main experimental protocols for measuring the single stimulus PRC in isolated cells: (1) single stimulus and (2) recurring (periodic) stimuli. In the case of a single stimulus protocol, a free running neural oscillator with the intrinsic period P~i~ is perturbed at a certain instant called stimulus time t~s~, which is measured from an arbitrary phase reference φ = 0, e.g. zero crossing of the membrane potential with a positive slope. As a result of the perturbation, the length of the current cycle that contains the stimulation (see [Fig 1A](#pone.0174304.g001){ref-type="fig"}) may be transiently shortened or lengthened to a new duration P~1~. The relative change in the duration of the current cycle with respect to the unperturbed duration P~i~ determines the first order PRC in response to a single and nonrecurring stimulus: $$\begin{array}{r} {F^{(1)}\left( \varphi \right) = P_{1}/P_{i} - 1,} \\ \end{array}$$ where the superscript ^(1)^ emphasizes that the resetting is due to a single input per cycle, which has been used as the "classical" definition of PRC. Based on [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"}, a negative value of the PRC means that the next spike is advanced, otherwise it is delayed. Others \[[@pone.0174304.ref058], [@pone.0174304.ref071]\] prefer to flip the sign in [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"} and associate a positive sign to a phase advance. Oftentimes, the effect of a single stimulus extends to subsequent cycles and is measured by higher order PRCs \[[@pone.0174304.ref047], [@pone.0174304.ref048], [@pone.0174304.ref050]\]. Usually, one records at least five cycles until the neural oscillatory returns back to its unperturbed oscillatory activity \[[@pone.0174304.ref031], [@pone.0174304.ref032]\]. Afterwards another single stimulus is applied at a different phase to quantify its effect on the isolated neuron (open loop experimental setup). In the case of recurring external stimuli, the interpretation of the phase resetting and its usage in phase-locked mode prediction is complicated by (1) the fact that the measured resetting compounds multiple PRC orders in a potentially nonlinear manner and (2) the activation of slow currents and/or long term potentiation (see \[[@pone.0174304.ref072]\] for examples and \[[@pone.0174304.ref032]\] for higher order PRC applications). Normal Forms of Single Stimulus Phase Response Curves. A saddle-node bifurcation, which presents a continuous frequency versus bias current (f-I) curve that extends to arbitrarily low frequencies (see solid circles in [Fig 1B](#pone.0174304.g001){ref-type="fig"}) usually leads to a type 1 PRC that looks unimodal as in [Fig 1C](#pone.0174304.g001){ref-type="fig"} (although for counterexamples see \[[@pone.0174304.ref049], [@pone.0174304.ref056]\]). Close to the bifurcation point, type 1 unimodal PRCs are described analytically by the following equation \[[@pone.0174304.ref057]\]: $$\begin{array}{r} {F^{(1)}\left( \varphi \right) = \frac{c_{SN}}{\omega}\left( 1 - \cos\left( 2\pi\varphi \right) \right),} \\ \end{array}$$ where c~SN~ is a constant determined by the neural model and ω = 2π/P~i~ is the intrinsic angular frequency of the oscillator. In this study, we used the simplified analytical form given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"} to get analytical insights into the general behavior of the three-neuron network with a dynamic loop shown in [Fig 3](#pone.0174304.g003){ref-type="fig"}. By least square fitting the numerically generated PRCs for each neuron in response to a single spike from its corresponding presynaptic neuron with the theoretical formula of the normal form PRC given by [Eq (17)](#pone.0174304.e094){ref-type="disp-formula"}, we found coupling strengths c are proportional to the maximum synaptic couplings $\overline{g}$: c~12~ = −6.1733g~12~ − 0.0003, c~23~ = −6.9555g~23~ − 0.0005, and c~32~ = 7.2764g~32~ + 0.0002. Phase resetting in response to multiple stimuli {#sec013} ----------------------------------------------- Assuming that the resetting induced by one stimulus takes effect "almost" instantaneously, i.e. before the arrival of the second stimulus, then the effects of two stimuli applied during the same cycle are independent of each other and we could use the single stimulus PRC defined by [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"} (shown in [Fig 1C and 1D](#pone.0174304.g001){ref-type="fig"}) to compute the phase resetting in response to two or more stimuli. In order to compute the phase resetting induced by the second stimulus based on [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"} we need to correctly compute its phase (see [Fig 2A](#pone.0174304.g002){ref-type="fig"}). The phase of the first stimulus that arrives at a stimulus time t~sa~ is φ~a~ = t~sa~/P~i~. The first stimulus produces an "almost" instantaneously phase resetting and changes the firing period to: $$\begin{array}{r} {P_{a} = P_{i}\left( 1 + F^{(1)}\left( \varphi_{a} \right) \right) = P_{i}\left( 1 + F^{(1)}\left( \frac{t_{a}}{P_{i}} \right) \right).} \\ \end{array}$$ When the second stimulus arrives at a stimulus time t~sb~ \> t~sa~, the neuron already has a different firing period P~a~ due to the previous stimulus. As a result, the phase of the second stimulus is φ~b~ = t~sb~/P~a~ and the new firing period due to the second stimulus is: $$\begin{array}{r} {P_{b} = P_{a}\left( 1 + F^{(1)}\left( \varphi_{b} \right) \right) = P_{a}\left( 1 + F^{(1)}\left( \frac{t_{b}}{P_{a}} \right) \right),} \\ \end{array}$$ where we used the same definition of the first order phase resetting for a single stimulus as in [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"}. By substituting [Eq (18)](#pone.0174304.e096){ref-type="disp-formula"} into [Eq (19)](#pone.0174304.e097){ref-type="disp-formula"} one obtains: $$\begin{array}{r} {P_{b} = P_{a}\left( 1 + F^{(1)}\left( \varphi_{b} \right) \right) = P_{i}\left( 1 + F^{(1)}\left( \frac{t_{a}}{P_{i}} \right) \right)\left( 1 + F^{(1)}\left( \frac{t_{b}}{P_{i}\left( 1 + F^{(1)}\left( \frac{t_{a}}{P_{i}} \right) \right)} \right) \right),} \\ \end{array}$$ which could be rewritten in a form that resembles [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"} as: $$\begin{array}{r} {P_{b} = P_{i}\left( 1 + F^{(2)}\left( \varphi_{a},\varphi_{b} \right) \right),} \\ \end{array}$$ where the superscript ^(2)^ emphasizes that the new transient period P~b~ is computed in response to two stimuli arriving at phases φ~a~ and, respectively, φ~b~ \> φ~a~ during the same cycle. By comparing the definition from [Eq (21)](#pone.0174304.e099){ref-type="disp-formula"} against the derived resetting from [Eq (20)](#pone.0174304.e098){ref-type="disp-formula"}, we found that: $$\begin{array}{r} {F^{(2)}\left( t_{sa},t_{sb} \right) = \left( 1 + F^{(1)}\left( \frac{t_{a}}{P_{i}} \right) \right)\left( 1 + F^{(1)}\left( \frac{t_{b}}{P_{i}\left( 1 + F^{(1)}\left( \frac{t_{a}}{P_{i}} \right) \right)} \right) \right) - 1,} \\ \end{array}$$ which has the advantage that can predict the phase resetting in response to two stimuli by recursively using the single stimulus PRC defined in [Eq (16)](#pone.0174304.e093){ref-type="disp-formula"}. A typical two stimuli phase response curve F^(2)^ is shown in [Fig 2B](#pone.0174304.g002){ref-type="fig"}. Furthermore, our novel derivation of PRC in response to two stimuli given by [Eq (22)](#pone.0174304.e100){ref-type="disp-formula"} generalizes to an arbitrary number of inputs per cycle as follows: $$\begin{array}{r} {P_{n}\left( t_{s1},t_{s2},\ldots,t_{sn} \right) = P_{i}\prod\limits_{k = 1}^{n}\left( 1 + F^{(1)}\left( \frac{t_{sk}}{P_{k - 1}} \right) \right),} \\ \end{array}$$ where P~0~ = P~i~ is the intrinsic firing period of the isolated neuron, t~sk~ \> t~s(k\ +\ 1)~, and t~sk~ \< P~k−1~ (stimulus k still falls inside the transiently modified period due to the previous stimulus). Appendix 2 {#sec014} ========== Stability Conditions for Two-Dimensional Recursive Maps. The characteristic polynomial of any first order recursive equation of two variables, such as [Eq (6)](#pone.0174304.e014){ref-type="disp-formula"}, is: $$\begin{array}{r} {P\left( \lambda \right) = \lambda^{2} - \left( Tr\left( A \right) \right)\lambda + Det\left( A \right),} \\ \end{array}$$ where Tr(A) and Det(A) are the trace and, respectively, the determinant of the recursion matrix of the perturbations (δt~2sa~, δt~2sb~), such as the [Eq (15)](#pone.0174304.e076){ref-type="disp-formula"}. The first order recursions have the following solution: $$\begin{array}{r} {\delta t\left\lbrack n \right\rbrack = C_{1}\lambda_{1}^{n} + C_{2}\lambda_{2}^{n},} \\ \end{array}$$ where C~1~ and C~2~ are some constants determined from the initial conditions and λ~i~ (with i = 1, 2) are the solutions of the characteristic polynomial [Eq (24)](#pone.0174304.e102){ref-type="disp-formula"}. For the perturbations to die out, all characteristic roots must be less than unit, i.e. \\|λ~i~\\|\<1 for both i = 1, 2. To ensure stability, there are two possibilities: (1) the roots of the characteristic polynomial are real and both less than the unit, or (2) the roots are complex conjugated with a magnitude less than the unit. Real characteristic roots. In this case, the following conditions must be met $$\begin{array}{rcl} {P\left( - 1 \right) = 1 + Tr\left( A \right) + Det\left( A \right)} & > & {0,} \\ {P\left( + 1 \right) = 1 - Tr\left( A \right) + Det\left( A \right)} & > & {0,} \\ {Det\left( A \right) - \left( Tr\left( A \right) \right)^{2}/4} & > & {0.} \\ \end{array}$$ The region where all three conditions are met is shown in [Fig 7](#pone.0174304.g007){ref-type="fig"} with crossed hashing, i.e. the region below the parabolic curve and above the two straight, tangent, lines. ![Stability regions of the two-dimensional recursive maps.\ The stability condition for any recursive maps requires that all roots of the characteristic polynomial are less than unit (\\|λ\\| \< 1). For a two-dimensional, first order, recursive there are only two parameters that control the stability conditions above, i.e. the trace x = Tr(A) and the determinant y = Det(A) of the characteristic matrix. The parabolic curve in (x, y) plane separates real from imaginary roots of characteristic polynomial. For real roots, i.e. below the parabolic curve, the stability region is only limited to the areas above the two tangent lines to the parabola (see 45 degree hashed areas). For imaginary roots, i.e. above the parabolic curve, the stability region is also limited to the area below the unit value since $\left\| \lambda \right\| = \sqrt{y} < 1$ (see hashed area with horizontal lines).](pone.0174304.g007){#pone.0174304.g007} Imaginary characteristic roots. In this case, the discriminant of the characteristic polynomial is negative, i.e. −Det(A) + (Tr(A))^2^/4 \< 0. At the same time, the magnitude of each complex conjugated characteristic root is $\left\| \lambda \right\| = \sqrt{Det\left( A \right)} < 1$, i.e. Det(A) \< 1. As a result, the stability region in the case of complex characteristic root is above the parabolic shape shaded with horizontal lines in [Fig 7](#pone.0174304.g007){ref-type="fig"}. Supporting information {#sec015} ====================== ###### Mathematica code. The Mathematica code simulates the driven-driver neural network with adaptive feedback. It uses Morris-Lecar type 1 neurons and chemical couplings between neurons to produce a stable phase-locked firing pattern. (NB) ###### Click here for additional data file. We are grateful to the reviewers for their constructive comments that allowed us to improve the computational implementation of the neural network and the overall quality of the manuscript. This research was supported by US National Science Foundation Career Award IOS-1054914 to SAO. [^1]: Competing Interests:The authors have declared that no competing interests exist. [^2]: Conceptualization: SAO.Data curation: SAO.Formal analysis: SAO.Funding acquisition: SAO.Investigation: SAO DIA.Methodology: SAO DIA.Project administration: SAO.Resources: SAO.Software: SAO DIA.Supervision: SAO.Validation: SAO.Visualization: SAO.Writing -- original draft: SAO.Writing -- review & editing: SAO DIA.	{ "pile_set_name": "PubMed Central" }
Nerve fibres containing gastrin-releasing peptide around pial vessels. Nerve fibres containing immunoreactive gastrin-releasing peptide (GRP) were demonstrated around pial blood vessels of cat, guinea pig, rat, and mouse. A sparse supply was found around spinal cord blood vessels, whereas the choroid plexus seemed to be devoid of GRP fibres. Sympathectomy did not affect the number or distribution of the GRP fibres. The administration of neither GRP nor its closely related analogue, bombesin, contracted or dilated feline pial arteries in vitro.	{ "pile_set_name": "PubMed Abstracts" }
170th Infantry Brigade (United States) The 170th Infantry Brigade was an infantry formation of the United States Army. From 2009 to 2012, as part of its third period of existence, it was based at Baumholder in the Federal Republic of Germany. World War I The 170th Infantry Brigade was first activated 25 August 1917 at Camp Custer, Michigan. Commanded initially by Julius Penn, it was one of two brigades of the 85th Infantry Division, National Army. Headquarters, 170th Brigade 339th Infantry Regiment 340th Infantry Regiment 330th Machine Gun Battalion After a year of training the division left the U.S. for England. When the American Expeditionary Force North Russia was formed to be sent to Arkhangelsk, Russia, the 339th Infantry Regiment provided the infantry component, with support units also taken from the 85th Division sent along as well. While there, the 339th saw combat against the Bolsheviks. The 340th Infantry Regiment and the remainder of the Brigade was stationed in Lorraine, on the Western Front in France where the 85th served as a depot division and did not participate in any combat operations. Interwar to 1970 The brigade, along with its parent unit the 85th Infantry Division, was reestablished as part of the Organized Reserves in 1921. However, the 85th Infantry Division was reactivated on 15 May 1942, it was as a triangular division with direct control of the 337th, 338th, and 339th Infantry Regiments. Thus the brigade was disestablished. With the reestablishment of brigades in the TOE of divisions in the 1960s following the short-lived experiment with pentomic organization, the 2nd Brigade, 24th Infantry Division was in 1963 assigned the heritage of the 170th Infantry Brigade. The 24th Division was inactivated in 1970, then reactivated from 1975 to 1996. When the 24th was reactivated again in 1999 it was as a headquarters unit only with separate National Guard brigades attached and no organic brigades of its own. It was inactivated again on 1 August 2006. From 2009-2012 The 170th Infantry Brigade of the United States Army was reestablished 15 July 2009 at U.S. Army Garrison Baumholder in Germany as part of the Grow the Army Plan. The 170th Infantry Brigade was formed by reflagging the 2nd Brigade, 1st Armored Division. The soldiers and equipment will remain in place but the 2d Brigade flag will transfer to Ft. Bliss, Texas, joining other elements of the 1st Armored Division. The 170th Infantry Brigade is organized as an enlarged hybrid of the Army XXI Heavy Division Infantry Brigade and modular brigade designs, as it incorporates both organic artillery and engineer battalions together with three infantry and armor units. Afghanistan In late 2010 part of the unit deployed to Northern Afghanistan (RC-N)to take part in a NATO training mission in conjunction with the ANA and ANP. In early 2011, the 170th IBCT deployed in support of Operation Enduring Freedom 11-12 to Regional Command North. During the brigade's deployment, it partnered with the 303rd Afghan Uniformed Police and the Afghan Border Police's 5th Zone. Key highlights of the deployment include the handover of security responsibilities for Mazar E Sharif from the International Security Assistance Force to the Government of the Islamic Republic of Afghanistan by the Germans. The brigade also deployed two of its battalions for separate missions in support of other regional commands. The 3d Battalion, 4th Infantry Regiment deployed in November 2010 to Regional Command Capital where it initially assumed part of the NTMA training mission in and around Kabul. It later transitioned to a security force mission across Afghanistan, ensuring various NTMA elements and VIPs were able to accomplish their tasks in a secure environment. The brigade's 4th Battalion, 70th Armor Regiment deployed to Regional Command South where it operated under Combined Team Uruzgan, partnered with the Australian Army. The brigade is redeployed back to Baumholder, Germany in early 2012. A total of eight brigade soldiers died during the deployment. The 170th Infantry Brigade included the following subordinate units in 2011: Headquarters and Headquarters Company, 170th Infantry Brigade Troop D, 5th Cavalry Regiment 4th Battalion, 70th Armor Regiment 2nd Battalion, 18th Infantry Regiment 3rd Battalion, 4th Infantry Regiment 1st Battalion, 84th Field Artillery Regiment 40th Engineer Battalion (in addition to engineer companies, also controls the below units) 589th Signal Company 502nd Military Intelligence Company 2nd Platoon, 501st Military Police Company 23d Military Police Platoon 24th Brigade Support Battalion In February 2012, Military.com announced that the brigade would be inactivated by the summer of 2012. Over the course of the year, 4,000 of the brigade's 4,500 soldiers were reassigned. On 9 October 2012, the 170th Infantry Brigade was inactivated in Germany, with the remaining 500 soldiers present for the event. References External links Brigade Website https://web.archive.org/web/20101003065725/http://www.170infantry.army.mil/ Mark St.Clair, and John Vandiver, Name changes set for 2 Germany-based units, Stars and Stripes, Friday, 7 March 2008 Stars and Stripes "1st AD brigade gets new colors" 170 Category:United States military in Germany Category:Military units and formations established in 1917 Category:Military units and formations disestablished in 2012	{ "pile_set_name": "Wikipedia (en)" }
StartFontMetrics 2.0 Comment Generated by pfaedit Comment Creation Date: Fri Nov 22 10:56:43 2002 FontName NimbusSanL-ReguCond FullName Nimbus Sans L Regular Condensed FamilyName Nimbus Sans L Weight Regular Notice (Copyright (URW)++,Copyright 1999 by (URW)++ Design & Development; Cyrillic glyphs added by Valek Filippov (C) 2001-2002) ItalicAngle 0 IsFixedPitch false UnderlinePosition -100 UnderlineThickness 50 Version 1.06 EncodingScheme AdobeStandardEncoding FontBBox -136 -282 893 959 CapHeight 718 XHeight 523 Ascender 718 Descender -207 StartCharMetrics 558 C 0 ; WX 228 ; N .notdef ; B 0 0 0 0 ; C 32 ; WX 228 ; N space ; B 0 0 0 0 ; C 33 ; WX 228 ; N exclam ; B 74 0 153 718 ; C 34 ; WX 291 ; N quotedbl ; B 57 463 234 718 ; C 35 ; WX 456 ; N numbersign ; B 23 0 434 688 ; C 36 ; WX 456 ; N dollar ; B 26 -115 427 775 ; C 37 ; WX 729 ; N percent ; B 32 -19 697 703 ; C 38 ; WX 547 ; N ampersand ; B 36 -15 529 718 ; C 39 ; WX 182 ; N quoteright ; B 43 462 129 718 ; C 40 ; WX 273 ; N parenleft ; B 56 -207 245 733 ; C 41 ; WX 273 ; N parenright ; B 28 -207 217 733 ; C 42 ; WX 319 ; N asterisk ; B 32 431 286 718 ; C 43 ; WX 479 ; N plus ; B 32 0 447 505 ; C 44 ; WX 228 ; N comma ; B 71 -147 157 107 ; C 45 ; WX 273 ; N hyphen ; B 36 232 237 322 ; C 46 ; WX 228 ; N period ; B 71 0 157 107 ; C 47 ; WX 228 ; N slash ; B -14 -19 242 737 ; C 48 ; WX 456 ; N zero ; B 30 -19 426 703 ; C 49 ; WX 456 ; N one ; B 83 0 294 703 ; C 50 ; WX 456 ; N two ; B 21 0 416 703 ; C 51 ; WX 456 ; N three ; B 28 -19 428 703 ; C 52 ; WX 456 ; N four ; B 20 0 429 703 ; C 53 ; WX 456 ; N five ; B 26 -19 421 688 ; C 54 ; WX 456 ; N six ; B 31 -19 425 703 ; C 55 ; WX 456 ; N seven ; B 30 0 429 688 ; C 56 ; WX 456 ; N eight ; B 31 -19 424 703 ; C 57 ; WX 456 ; N nine ; B 34 -19 421 703 ; C 58 ; WX 228 ; N colon ; B 71 0 157 516 ; C 59 ; WX 228 ; N semicolon ; B 71 -147 157 516 ; C 60 ; WX 479 ; N less ; B 39 10 440 496 ; C 61 ; WX 479 ; N equal ; B 32 115 447 390 ; C 62 ; WX 479 ; N greater ; B 39 10 440 496 ; C 63 ; WX 456 ; N question ; B 46 0 403 727 ; C 64 ; WX 832 ; N at ; B 121 -19 712 737 ; C 65 ; WX 547 ; N A ; B 11 0 536 718 ; C 66 ; WX 547 ; N B ; B 61 0 514 718 ; C 67 ; WX 592 ; N C ; B 36 -19 558 737 ; C 68 ; WX 592 ; N D ; B 66 0 553 718 ; C 69 ; WX 547 ; N E ; B 71 0 505 718 ; C 70 ; WX 501 ; N F ; B 71 0 478 718 ; C 71 ; WX 638 ; N G ; B 39 -19 577 737 ; C 72 ; WX 592 ; N H ; B 63 0 530 718 ; C 73 ; WX 228 ; N I ; B 75 0 154 718 ; L J IJ ; C 74 ; WX 410 ; N J ; B 14 -19 351 718 ; C 75 ; WX 547 ; N K ; B 62 0 544 718 ; C 76 ; WX 456 ; N L ; B 62 0 440 718 ; C 77 ; WX 683 ; N M ; B 60 0 624 718 ; C 78 ; WX 592 ; N N ; B 62 0 530 718 ; C 79 ; WX 638 ; N O ; B 32 -19 606 737 ; C 80 ; WX 547 ; N P ; B 71 0 510 718 ; C 81 ; WX 638 ; N Q ; B 32 -56 606 737 ; C 82 ; WX 592 ; N R ; B 72 0 561 718 ; C 83 ; WX 547 ; N S ; B 40 -19 508 737 ; C 84 ; WX 501 ; N T ; B 11 0 490 718 ; C 85 ; WX 592 ; N U ; B 65 -19 528 718 ; C 86 ; WX 547 ; N V ; B 16 0 531 718 ; C 87 ; WX 774 ; N W ; B 13 0 761 718 ; C 88 ; WX 547 ; N X ; B 16 0 531 718 ; C 89 ; WX 547 ; N Y ; B 11 0 535 718 ; C 90 ; WX 501 ; N Z ; B 19 0 482 718 ; C 91 ; WX 228 ; N bracketleft ; B 52 -196 205 722 ; C 92 ; WX 228 ; N backslash ; B -14 -19 242 737 ; C 93 ; WX 228 ; N bracketright ; B 23 -196 176 722 ; C 94 ; WX 385 ; N asciicircum ; B -11 264 396 688 ; C 95 ; WX 456 ; N underscore ; B 0 -125 456 -75 ; C 96 ; WX 182 ; N quoteleft ; B 53 469 139 725 ; C 97 ; WX 456 ; N a ; B 30 -15 435 538 ; C 98 ; WX 456 ; N b ; B 48 -15 424 718 ; C 99 ; WX 410 ; N c ; B 25 -15 391 538 ; C 100 ; WX 456 ; N d ; B 29 -15 409 718 ; C 101 ; WX 456 ; N e ; B 33 -15 423 538 ; C 102 ; WX 228 ; N f ; B 11 0 215 728 ; L l fl ; L i fi ; C 103 ; WX 456 ; N g ; B 33 -220 409 538 ; C 104 ; WX 456 ; N h ; B 53 0 403 718 ; C 105 ; WX 182 ; N i ; B 55 0 127 718 ; L j ij ; C 106 ; WX 182 ; N j ; B -13 -210 127 718 ; C 107 ; WX 410 ; N k ; B 55 0 411 718 ; C 108 ; WX 182 ; N l ; B 55 0 127 718 ; C 109 ; WX 683 ; N m ; B 53 0 631 538 ; C 110 ; WX 456 ; N n ; B 53 0 403 538 ; C 111 ; WX 456 ; N o ; B 29 -14 427 538 ; C 112 ; WX 456 ; N p ; B 48 -207 424 538 ; C 113 ; WX 456 ; N q ; B 29 -207 405 538 ; C 114 ; WX 273 ; N r ; B 63 0 272 538 ; C 115 ; WX 410 ; N s ; B 26 -15 380 538 ; C 116 ; WX 228 ; N t ; B 11 -7 211 669 ; C 117 ; WX 456 ; N u ; B 56 -15 401 523 ; C 118 ; WX 410 ; N v ; B 7 0 403 523 ; C 119 ; WX 592 ; N w ; B 11 0 581 523 ; C 120 ; WX 410 ; N x ; B 9 0 402 523 ; C 121 ; WX 410 ; N y ; B 9 -214 401 523 ; C 122 ; WX 410 ; N z ; B 25 0 385 523 ; C 123 ; WX 274 ; N braceleft ; B 34 -196 239 722 ; C 124 ; WX 213 ; N bar ; B 77 -19 137 737 ; C 125 ; WX 274 ; N braceright ; B 34 -196 239 722 ; C 126 ; WX 479 ; N asciitilde ; B 50 181 429 322 ; C 161 ; WX 273 ; N exclamdown ; B 97 -195 176 523 ; C 162 ; WX 456 ; N cent ; B 42 -115 421 623 ; C 163 ; WX 456 ; N sterling ; B 27 -16 442 718 ; C 164 ; WX 137 ; N fraction ; B -136 -19 273 703 ; C 165 ; WX 456 ; N yen ; B 2 0 453 688 ; C 166 ; WX 456 ; N florin ; B -9 -207 411 737 ; C 167 ; WX 456 ; N section ; B 35 -191 420 737 ; C 168 ; WX 456 ; N currency ; B 23 99 433 603 ; C 169 ; WX 157 ; N quotesingle ; B 48 463 108 718 ; C 170 ; WX 273 ; N quotedblleft ; B 31 469 252 725 ; C 171 ; WX 456 ; N guillemotleft ; B 80 108 376 446 ; C 172 ; WX 273 ; N guilsinglleft ; B 72 108 201 446 ; C 173 ; WX 273 ; N guilsinglright ; B 72 108 201 446 ; C 174 ; WX 410 ; N fi ; B 11 0 356 728 ; C 175 ; WX 410 ; N fl ; B 11 0 354 728 ; C 177 ; WX 456 ; N endash ; B 0 240 456 313 ; C 178 ; WX 456 ; N dagger ; B 35 -159 421 718 ; C 179 ; WX 456 ; N daggerdbl ; B 35 -159 421 718 ; C 180 ; WX 228 ; N periodcentered ; B 63 190 166 315 ; C 182 ; WX 440 ; N paragraph ; B 15 -173 408 718 ; C 183 ; WX 287 ; N bullet ; B 15 202 273 517 ; C 184 ; WX 182 ; N quotesinglbase ; B 43 -149 129 107 ; C 185 ; WX 273 ; N quotedblbase ; B 21 -149 242 107 ; C 186 ; WX 273 ; N quotedblright ; B 21 462 242 718 ; C 187 ; WX 456 ; N guillemotright ; B 80 108 376 446 ; C 188 ; WX 820 ; N ellipsis ; B 94 0 726 107 ; C 189 ; WX 820 ; N perthousand ; B 6 -19 815 703 ; C 191 ; WX 501 ; N questiondown ; B 75 -201 432 525 ; C 193 ; WX 273 ; N grave ; B 11 593 173 734 ; C 194 ; WX 273 ; N acute ; B 100 593 262 734 ; C 195 ; WX 273 ; N circumflex ; B 17 593 256 734 ; C 196 ; WX 273 ; N tilde ; B -3 606 276 722 ; C 197 ; WX 273 ; N macron ; B 8 627 265 684 ; C 198 ; WX 273 ; N breve ; B 11 595 263 731 ; C 199 ; WX 273 ; N dotaccent ; B 99 604 174 706 ; C 200 ; WX 273 ; N dieresis ; B 33 604 240 706 ; C 202 ; WX 273 ; N ring ; B 61 572 212 756 ; C 203 ; WX 273 ; N cedilla ; B 37 -225 212 0 ; C 205 ; WX 273 ; N hungarumlaut ; B 25 593 335 734 ; C 206 ; WX 273 ; N ogonek ; B 60 -225 235 0 ; C 207 ; WX 273 ; N caron ; B 17 593 256 734 ; C 208 ; WX 820 ; N emdash ; B 0 240 820 313 ; C 225 ; WX 820 ; N AE ; B 7 0 780 718 ; C 227 ; WX 303 ; N ordfeminine ; B 20 304 284 737 ; C 232 ; WX 456 ; N Lslash ; B -16 0 440 718 ; C 233 ; WX 638 ; N Oslash ; B 32 -19 607 737 ; C 234 ; WX 820 ; N OE ; B 30 -19 791 737 ; C 235 ; WX 299 ; N ordmasculine ; B 20 304 280 737 ; C 241 ; WX 729 ; N ae ; B 30 -15 695 538 ; C 245 ; WX 228 ; N dotlessi ; B 78 0 150 523 ; C 248 ; WX 182 ; N lslash ; B -16 0 198 718 ; C 249 ; WX 501 ; N oslash ; B 23 -22 440 545 ; C 250 ; WX 774 ; N oe ; B 29 -15 740 538 ; C 251 ; WX 501 ; N germandbls ; B 55 -15 468 728 ; C -1 ; WX 547 ; N Adieresis ; B 11 0 536 901 ; C -1 ; WX 547 ; N Aacute ; B 11 0 536 929 ; C -1 ; WX 547 ; N Agrave ; B 11 0 536 929 ; C -1 ; WX 547 ; N Acircumflex ; B 11 0 536 929 ; C -1 ; WX 547 ; N Abreve ; B 11 0 536 926 ; C -1 ; WX 547 ; N Atilde ; B 11 0 536 917 ; C -1 ; WX 547 ; N Aring ; B 11 0 536 944 ; C -1 ; WX 547 ; N Aogonek ; B 11 -225 567 718 ; C -1 ; WX 592 ; N Ccedilla ; B 36 -225 558 737 ; C -1 ; WX 592 ; N Cacute ; B 36 -19 558 903 ; C -1 ; WX 592 ; N Ccaron ; B 36 -19 558 929 ; C -1 ; WX 592 ; N Dcaron ; B 66 0 553 929 ; C -1 ; WX 547 ; N Edieresis ; B 71 0 505 901 ; C -1 ; WX 547 ; N Eacute ; B 71 0 505 929 ; C -1 ; WX 547 ; N Egrave ; B 71 0 505 929 ; C -1 ; WX 547 ; N Ecircumflex ; B 71 0 505 929 ; C -1 ; WX 547 ; N Ecaron ; B 71 0 505 929 ; C -1 ; WX 547 ; N Edotaccent ; B 71 0 505 901 ; C -1 ; WX 547 ; N Eogonek ; B 71 -225 536 718 ; C -1 ; WX 638 ; N Gbreve ; B 39 -19 577 926 ; C -1 ; WX 228 ; N Idieresis ; B 11 0 218 901 ; C -1 ; WX 228 ; N Iacute ; B 75 0 240 903 ; C -1 ; WX 228 ; N Igrave ; B -11 0 154 929 ; C -1 ; WX 228 ; N Icircumflex ; B -5 0 234 929 ; C -1 ; WX 228 ; N Idotaccent ; B 75 0 154 901 ; C -1 ; WX 456 ; N Lacute ; B 62 0 440 903 ; C -1 ; WX 456 ; N Lcaron ; B 62 0 440 718 ; C -1 ; WX 592 ; N Nacute ; B 62 0 530 903 ; C -1 ; WX 592 ; N Ncaron ; B 62 0 530 929 ; C -1 ; WX 592 ; N Ntilde ; B 62 0 530 917 ; C -1 ; WX 638 ; N Odieresis ; B 32 -19 606 901 ; C -1 ; WX 638 ; N Oacute ; B 32 -19 606 929 ; C -1 ; WX 638 ; N Ograve ; B 32 -19 606 929 ; C -1 ; WX 638 ; N Ocircumflex ; B 32 -19 606 929 ; C -1 ; WX 638 ; N Otilde ; B 32 -19 606 917 ; C -1 ; WX 638 ; N Ohungarumlaut ; B 32 -19 606 929 ; C -1 ; WX 592 ; N Racute ; B 72 0 561 903 ; C -1 ; WX 592 ; N Rcaron ; B 72 0 561 929 ; C -1 ; WX 547 ; N Sacute ; B 40 -19 508 903 ; C -1 ; WX 547 ; N Scaron ; B 40 -19 508 929 ; C -1 ; WX 547 ; N Scedilla ; B 39 -225 508 737 ; C -1 ; WX 501 ; N Tcaron ; B 11 0 490 929 ; C -1 ; WX 592 ; N Udieresis ; B 65 -19 528 901 ; C -1 ; WX 592 ; N Uacute ; B 65 -19 528 929 ; C -1 ; WX 592 ; N Ugrave ; B 65 -19 528 929 ; C -1 ; WX 592 ; N Ucircumflex ; B 65 -19 528 929 ; C -1 ; WX 592 ; N Uring ; B 65 -19 528 951 ; C -1 ; WX 592 ; N Uhungarumlaut ; B 65 -19 528 929 ; C -1 ; WX 547 ; N Yacute ; B 11 0 535 929 ; C -1 ; WX 501 ; N Zacute ; B 19 0 482 903 ; C -1 ; WX 501 ; N Zcaron ; B 19 0 482 929 ; C -1 ; WX 501 ; N Zdotaccent ; B 19 0 482 901 ; C -1 ; WX 547 ; N Amacron ; B 11 0 536 879 ; C -1 ; WX 501 ; N Tcommaaccent ; B 11 -282 490 718 ; C -1 ; WX 547 ; N Ydieresis ; B 11 0 535 901 ; C -1 ; WX 547 ; N Emacron ; B 71 0 505 879 ; C -1 ; WX 228 ; N Imacron ; B -15 0 242 879 ; C -1 ; WX 228 ; N Iogonek ; B 10 -225 185 718 ; C -1 ; WX 547 ; N Kcommaaccent ; B 62 -282 544 718 ; C -1 ; WX 456 ; N Lcommaaccent ; B 62 -282 440 718 ; C -1 ; WX 592 ; N Ncommaaccent ; B 62 -282 530 718 ; C -1 ; WX 638 ; N Omacron ; B 32 -19 606 879 ; C -1 ; WX 592 ; N Rcommaaccent ; B 72 -282 561 718 ; C -1 ; WX 638 ; N Gcommaaccent ; B 39 -282 577 737 ; C -1 ; WX 592 ; N Umacron ; B 65 -19 528 879 ; C -1 ; WX 592 ; N Uogonek ; B 65 -225 528 718 ; C -1 ; WX 456 ; N adieresis ; B 30 -15 435 706 ; C -1 ; WX 456 ; N aacute ; B 30 -15 435 734 ; C -1 ; WX 456 ; N agrave ; B 30 -15 435 734 ; C -1 ; WX 456 ; N acircumflex ; B 30 -15 435 734 ; C -1 ; WX 456 ; N abreve ; B 30 -15 435 731 ; C -1 ; WX 456 ; N atilde ; B 30 -15 435 722 ; C -1 ; WX 456 ; N aring ; B 30 -15 435 769 ; C -1 ; WX 456 ; N aogonek ; B 30 -225 466 538 ; C -1 ; WX 410 ; N cacute ; B 25 -15 391 734 ; C -1 ; WX 410 ; N ccaron ; B 25 -15 391 734 ; C -1 ; WX 410 ; N ccedilla ; B 25 -225 391 538 ; C -1 ; WX 496 ; N dcaron ; B 29 -15 516 718 ; C -1 ; WX 456 ; N edieresis ; B 33 -15 423 706 ; C -1 ; WX 456 ; N eacute ; B 33 -15 423 734 ; C -1 ; WX 456 ; N egrave ; B 33 -15 423 734 ; C -1 ; WX 456 ; N ecircumflex ; B 33 -15 423 734 ; C -1 ; WX 456 ; N ecaron ; B 33 -15 423 734 ; C -1 ; WX 456 ; N edotaccent ; B 33 -15 423 706 ; C -1 ; WX 456 ; N eogonek ; B 33 -225 423 538 ; C -1 ; WX 456 ; N gbreve ; B 33 -220 409 731 ; C -1 ; WX 228 ; N idieresis ; B 11 0 218 706 ; C -1 ; WX 228 ; N iacute ; B 78 0 240 734 ; C -1 ; WX 228 ; N igrave ; B -11 0 151 734 ; C -1 ; WX 228 ; N icircumflex ; B -5 0 234 734 ; C -1 ; WX 182 ; N lacute ; B 55 0 217 903 ; C -1 ; WX 212 ; N lcaron ; B 55 0 232 718 ; C -1 ; WX 456 ; N nacute ; B 53 0 403 734 ; C -1 ; WX 456 ; N ncaron ; B 53 0 403 734 ; C -1 ; WX 456 ; N ntilde ; B 53 0 403 722 ; C -1 ; WX 456 ; N odieresis ; B 29 -14 427 706 ; C -1 ; WX 456 ; N oacute ; B 29 -14 427 734 ; C -1 ; WX 456 ; N ograve ; B 29 -14 427 734 ; C -1 ; WX 456 ; N ocircumflex ; B 29 -14 427 734 ; C -1 ; WX 456 ; N otilde ; B 29 -14 427 722 ; C -1 ; WX 456 ; N ohungarumlaut ; B 29 -14 427 734 ; C -1 ; WX 273 ; N racute ; B 63 0 272 734 ; C -1 ; WX 410 ; N sacute ; B 26 -15 380 734 ; C -1 ; WX 410 ; N scaron ; B 26 -15 380 734 ; C -1 ; WX 410 ; N scommaaccent ; B 26 -282 380 538 ; C -1 ; WX 248 ; N tcaron ; B 11 -7 268 718 ; C -1 ; WX 456 ; N udieresis ; B 56 -15 401 706 ; C -1 ; WX 456 ; N uacute ; B 56 -15 401 734 ; C -1 ; WX 456 ; N ugrave ; B 56 -15 401 734 ; C -1 ; WX 456 ; N ucircumflex ; B 56 -15 401 734 ; C -1 ; WX 456 ; N uring ; B 56 -15 401 756 ; C -1 ; WX 456 ; N uhungarumlaut ; B 56 -15 427 734 ; C -1 ; WX 410 ; N yacute ; B 9 -214 401 734 ; C -1 ; WX 410 ; N zacute ; B 25 0 385 734 ; C -1 ; WX 410 ; N zcaron ; B 25 0 385 734 ; C -1 ; WX 410 ; N zdotaccent ; B 25 0 385 706 ; C -1 ; WX 410 ; N ydieresis ; B 9 -214 401 706 ; C -1 ; WX 228 ; N tcommaaccent ; B 11 -282 211 669 ; C -1 ; WX 456 ; N amacron ; B 30 -15 435 684 ; C -1 ; WX 456 ; N emacron ; B 33 -15 423 684 ; C -1 ; WX 228 ; N imacron ; B -15 0 242 684 ; C -1 ; WX 410 ; N kcommaaccent ; B 55 -282 411 718 ; C -1 ; WX 182 ; N lcommaaccent ; B 50 -282 133 718 ; C -1 ; WX 456 ; N ncommaaccent ; B 53 -282 403 538 ; C -1 ; WX 456 ; N omacron ; B 29 -14 427 684 ; C -1 ; WX 273 ; N rcommaaccent ; B 57 -282 272 538 ; C -1 ; WX 456 ; N umacron ; B 56 -15 401 684 ; C -1 ; WX 456 ; N uogonek ; B 56 -225 432 523 ; C -1 ; WX 273 ; N rcaron ; B 44 0 283 734 ; C -1 ; WX 410 ; N scedilla ; B 26 -225 380 538 ; C -1 ; WX 456 ; N gcommaaccent ; B 33 -220 409 813 ; C -1 ; WX 182 ; N iogonek ; B -17 -225 158 718 ; C -1 ; WX 547 ; N Scommaaccent ; B 40 -282 508 737 ; C -1 ; WX 592 ; N Eth ; B 0 0 553 718 ; C -1 ; WX 592 ; N Dcroat ; B 0 0 553 718 ; C -1 ; WX 547 ; N Thorn ; B 71 0 510 718 ; C -1 ; WX 456 ; N dcroat ; B 29 -15 456 718 ; C -1 ; WX 456 ; N eth ; B 29 -15 428 737 ; C -1 ; WX 456 ; N thorn ; B 48 -207 424 718 ; C -1 ; WX 510 ; N Euro ; B 0 -12 495 730 ; C -1 ; WX 273 ; N onesuperior ; B 35 281 182 703 ; C -1 ; WX 273 ; N twosuperior ; B 3 280 265 714 ; C -1 ; WX 273 ; N threesuperior ; B 4 270 266 714 ; C -1 ; WX 328 ; N degree ; B 44 411 284 703 ; C -1 ; WX 479 ; N minus ; B 32 216 447 289 ; C -1 ; WX 479 ; N multiply ; B 32 0 447 506 ; C -1 ; WX 479 ; N divide ; B 32 -19 447 524 ; C -1 ; WX 820 ; N trademark ; B 38 306 740 718 ; C -1 ; WX 479 ; N plusminus ; B 32 0 447 561 ; C -1 ; WX 684 ; N onehalf ; B 35 -19 634 703 ; C -1 ; WX 684 ; N onequarter ; B 60 -19 620 703 ; C -1 ; WX 684 ; N threequarters ; B 37 -19 664 714 ; C -1 ; WX 273 ; N commaaccent ; B 95 -282 178 -60 ; C -1 ; WX 604 ; N copyright ; B -11 -19 617 737 ; C -1 ; WX 604 ; N registered ; B -11 -19 617 737 ; C -1 ; WX 405 ; N lozenge ; B 15 0 382 740 ; C -1 ; WX 502 ; N Delta ; B 5 0 499 688 ; C -1 ; WX 479 ; N notequal ; B 32 10 447 495 ; C -1 ; WX 450 ; N radical ; B -5 -74 433 927 ; C -1 ; WX 479 ; N lessequal ; B 39 0 439 594 ; C -1 ; WX 479 ; N greaterequal ; B 39 0 439 594 ; C -1 ; WX 479 ; N logicalnot ; B 32 108 447 390 ; C -1 ; WX 585 ; N summation ; B 12 -123 570 752 ; C -1 ; WX 405 ; N partialdiff ; B 21 -10 379 753 ; C -1 ; WX 213 ; N brokenbar ; B 77 -19 137 737 ; C -1 ; WX 456 ; N mu ; B 56 -207 401 523 ; C -1 ; WX 547 ; N afii10017 ; B 11 0 536 718 ; C -1 ; WX 551 ; N afii10018 ; B 61 0 514 718 ; C -1 ; WX 547 ; N afii10019 ; B 61 0 514 718 ; C -1 ; WX 489 ; N afii10020 ; B 61 0 468 718 ; C -1 ; WX 666 ; N afii10021 ; B 21 -120 645 718 ; C -1 ; WX 537 ; N afii10022 ; B 61 0 495 718 ; C -1 ; WX 537 ; N afii10023 ; B 61 0 495 901 ; C -1 ; WX 902 ; N afii10024 ; B 9 0 893 718 ; C -1 ; WX 541 ; N afii10025 ; B 42 -19 510 737 ; C -1 ; WX 596 ; N afii10026 ; B 61 0 529 718 ; C -1 ; WX 596 ; N afii10027 ; B 61 0 529 878 ; C -1 ; WX 552 ; N afii10028 ; B 61 0 543 718 ; C -1 ; WX 581 ; N afii10029 ; B 21 -10 514 718 ; C -1 ; WX 692 ; N afii10030 ; B 61 0 625 718 ; C -1 ; WX 595 ; N afii10031 ; B 61 0 528 718 ; C -1 ; WX 638 ; N afii10032 ; B 32 -19 606 737 ; C -1 ; WX 595 ; N afii10033 ; B 61 0 528 718 ; C -1 ; WX 547 ; N afii10034 ; B 61 0 500 718 ; C -1 ; WX 588 ; N afii10035 ; B 32 -19 554 737 ; C -1 ; WX 503 ; N afii10036 ; B 12 0 491 718 ; C -1 ; WX 548 ; N afii10037 ; B 12 0 536 718 ; C -1 ; WX 737 ; N afii10038 ; B 34 0 703 718 ; C -1 ; WX 539 ; N afii10039 ; B 12 0 527 718 ; C -1 ; WX 627 ; N afii10040 ; B 61 -120 599 718 ; C -1 ; WX 567 ; N afii10041 ; B 62 0 500 718 ; C -1 ; WX 698 ; N afii10042 ; B 61 0 631 718 ; C -1 ; WX 723 ; N afii10043 ; B 61 -120 702 718 ; C -1 ; WX 711 ; N afii10044 ; B 12 0 674 718 ; C -1 ; WX 723 ; N afii10045 ; B 61 0 656 718 ; C -1 ; WX 537 ; N afii10046 ; B 61 0 500 718 ; C -1 ; WX 590 ; N afii10047 ; B 32 -19 554 737 ; C -1 ; WX 813 ; N afii10048 ; B 61 -19 781 737 ; C -1 ; WX 554 ; N afii10049 ; B 42 0 487 718 ; C -1 ; WX 456 ; N afii10065 ; B 30 -15 435 538 ; C -1 ; WX 442 ; N afii10066 ; B 25 -14 424 776 ; C -1 ; WX 444 ; N afii10067 ; B 54 0 420 524 ; C -1 ; WX 337 ; N afii10068 ; B 51 0 325 523 ; C -1 ; WX 536 ; N afii10069 ; B 21 -125 515 523 ; C -1 ; WX 456 ; N afii10070 ; B 33 -15 423 538 ; C -1 ; WX 456 ; N afii10071 ; B 33 -15 423 706 ; C -1 ; WX 656 ; N afii10072 ; B 8 0 646 523 ; C -1 ; WX 410 ; N afii10073 ; B 24 -15 378 538 ; C -1 ; WX 455 ; N afii10074 ; B 53 0 403 524 ; C -1 ; WX 455 ; N afii10075 ; B 53 0 403 739 ; C -1 ; WX 417 ; N afii10076 ; B 53 0 409 523 ; C -1 ; WX 439 ; N afii10077 ; B 21 -10 387 523 ; C -1 ; WX 539 ; N afii10078 ; B 53 0 487 523 ; C -1 ; WX 455 ; N afii10079 ; B 53 0 403 525 ; C -1 ; WX 456 ; N afii10080 ; B 29 -14 427 538 ; C -1 ; WX 455 ; N afii10081 ; B 53 0 403 523 ; C -1 ; WX 456 ; N afii10082 ; B 48 -207 424 538 ; C -1 ; WX 410 ; N afii10083 ; B 25 -15 391 538 ; C -1 ; WX 336 ; N afii10084 ; B 12 0 324 523 ; C -1 ; WX 409 ; N afii10085 ; B 8 -214 400 523 ; C -1 ; WX 748 ; N afii10086 ; B 32 -207 716 628 ; C -1 ; WX 410 ; N afii10087 ; B 8 0 401 523 ; C -1 ; WX 474 ; N afii10088 ; B 53 -125 455 523 ; C -1 ; WX 443 ; N afii10089 ; B 53 0 391 525 ; C -1 ; WX 589 ; N afii10090 ; B 53 0 537 523 ; C -1 ; WX 606 ; N afii10091 ; B 53 -125 589 523 ; C -1 ; WX 512 ; N afii10092 ; B 17 0 497 524 ; C -1 ; WX 585 ; N afii10093 ; B 53 0 533 524 ; C -1 ; WX 444 ; N afii10094 ; B 53 0 419 524 ; C -1 ; WX 410 ; N afii10095 ; B 25 -15 391 538 ; C -1 ; WX 597 ; N afii10096 ; B 53 -14 568 538 ; C -1 ; WX 447 ; N afii10097 ; B 24 0 410 524 ; C -1 ; WX 537 ; N uni0400 ; B 61 0 495 959 ; C -1 ; WX 688 ; N afii10051 ; B 12 0 651 718 ; C -1 ; WX 489 ; N afii10052 ; B 61 0 468 919 ; C -1 ; WX 588 ; N afii10053 ; B 32 -19 554 737 ; C -1 ; WX 547 ; N afii10054 ; B 40 -19 508 737 ; C -1 ; WX 213 ; N afii10055 ; B 67 0 146 718 ; C -1 ; WX 341 ; N afii10056 ; B 67 0 274 901 ; C -1 ; WX 410 ; N afii10057 ; B 14 -19 351 718 ; C -1 ; WX 581 ; N afii10058 ; B 21 0 514 718 ; C -1 ; WX 924 ; N afii10059 ; B 61 0 887 718 ; C -1 ; WX 622 ; N afii10060 ; B 12 0 569 718 ; C -1 ; WX 552 ; N afii10061 ; B 61 0 543 919 ; C -1 ; WX 596 ; N uni040D ; B 61 0 529 959 ; C -1 ; WX 546 ; N afii10062 ; B 11 0 535 878 ; C -1 ; WX 595 ; N afii10145 ; B 61 0 528 718 ; C -1 ; WX 456 ; N uni0450 ; B 33 -15 423 764 ; C -1 ; WX 526 ; N afii10099 ; B 12 0 501 523 ; C -1 ; WX 337 ; N afii10100 ; B 51 0 325 748 ; C -1 ; WX 426 ; N afii10101 ; B 29 -15 395 538 ; C -1 ; WX 410 ; N afii10102 ; B 26 -15 380 538 ; C -1 ; WX 182 ; N afii10103 ; B 55 0 127 718 ; C -1 ; WX 317 ; N afii10104 ; B 55 0 262 706 ; C -1 ; WX 182 ; N afii10105 ; B -13 -210 127 718 ; C -1 ; WX 439 ; N afii10106 ; B 21 0 387 523 ; C -1 ; WX 722 ; N afii10107 ; B 53 0 697 525 ; C -1 ; WX 535 ; N afii10108 ; B 12 0 482 718 ; C -1 ; WX 417 ; N afii10109 ; B 53 0 409 748 ; C -1 ; WX 455 ; N uni045D ; B 53 0 403 764 ; C -1 ; WX 416 ; N afii10110 ; B 12 -214 404 741 ; C -1 ; WX 455 ; N afii10193 ; B 53 0 403 523 ; C -1 ; WX 537 ; N uni048C ; B 61 0 500 718 ; C -1 ; WX 444 ; N uni048D ; B 53 0 419 524 ; C -1 ; WX 547 ; N uni048E ; B 61 0 500 718 ; C -1 ; WX 456 ; N uni048F ; B 48 -207 424 538 ; C -1 ; WX 499 ; N afii10050 ; B 67 0 474 799 ; C -1 ; WX 344 ; N afii10098 ; B 55 0 329 591 ; C -1 ; WX 489 ; N uni0492 ; B 61 0 468 718 ; C -1 ; WX 337 ; N uni0493 ; B 51 0 325 523 ; C -1 ; WX 489 ; N uni0494 ; B 61 0 468 718 ; C -1 ; WX 337 ; N uni0495 ; B 51 0 325 523 ; C -1 ; WX 902 ; N uni0496 ; B 9 0 893 718 ; C -1 ; WX 658 ; N uni0497 ; B 8 0 650 523 ; C -1 ; WX 541 ; N uni0498 ; B 42 -19 510 737 ; C -1 ; WX 410 ; N uni0499 ; B 24 -15 378 538 ; C -1 ; WX 552 ; N uni049A ; B 61 0 543 718 ; C -1 ; WX 417 ; N uni049B ; B 53 0 409 523 ; C -1 ; WX 552 ; N uni049C ; B 61 0 543 718 ; C -1 ; WX 417 ; N uni049D ; B 53 0 409 523 ; C -1 ; WX 552 ; N uni049E ; B 61 0 543 718 ; C -1 ; WX 417 ; N uni049F ; B 53 0 409 523 ; C -1 ; WX 552 ; N uni04A0 ; B 61 0 543 718 ; C -1 ; WX 417 ; N uni04A1 ; B 53 0 409 523 ; C -1 ; WX 595 ; N uni04A2 ; B 61 0 528 718 ; C -1 ; WX 455 ; N uni04A3 ; B 53 0 403 525 ; C -1 ; WX 595 ; N uni04A4 ; B 61 0 528 718 ; C -1 ; WX 455 ; N uni04A5 ; B 53 0 403 525 ; C -1 ; WX 595 ; N uni04A6 ; B 61 0 528 718 ; C -1 ; WX 455 ; N uni04A7 ; B 53 0 403 523 ; C -1 ; WX 588 ; N uni04A8 ; B 32 -19 554 737 ; C -1 ; WX 410 ; N uni04A9 ; B 25 -15 391 538 ; C -1 ; WX 588 ; N uni04AA ; B 32 -19 554 737 ; C -1 ; WX 410 ; N uni04AB ; B 25 -15 391 538 ; C -1 ; WX 503 ; N uni04AC ; B 12 0 491 718 ; C -1 ; WX 336 ; N uni04AD ; B 12 0 324 523 ; C -1 ; WX 547 ; N uni04AE ; B 11 0 535 718 ; C -1 ; WX 410 ; N uni04AF ; B 7 0 403 523 ; C -1 ; WX 547 ; N uni04B0 ; B 11 0 535 718 ; C -1 ; WX 410 ; N uni04B1 ; B 7 0 403 523 ; C -1 ; WX 539 ; N uni04B2 ; B 12 0 527 718 ; C -1 ; WX 410 ; N uni04B3 ; B 8 0 401 523 ; C -1 ; WX 645 ; N uni04B4 ; B 61 -120 624 718 ; C -1 ; WX 501 ; N uni04B5 ; B 53 -125 480 523 ; C -1 ; WX 547 ; N uni04B6 ; B 62 0 480 718 ; C -1 ; WX 406 ; N uni04B7 ; B 52 0 371 525 ; C -1 ; WX 547 ; N uni04B8 ; B 62 0 480 718 ; C -1 ; WX 406 ; N uni04B9 ; B 52 0 371 525 ; C -1 ; WX 547 ; N uni04BA ; B 62 0 480 718 ; C -1 ; WX 406 ; N uni04BB ; B 53 0 372 525 ; C -1 ; WX 588 ; N uni04BC ; B 32 -19 554 737 ; C -1 ; WX 410 ; N uni04BD ; B 25 -15 391 538 ; C -1 ; WX 588 ; N uni04BE ; B 32 -19 554 737 ; C -1 ; WX 410 ; N uni04BF ; B 25 -15 391 538 ; C -1 ; WX 228 ; N uni04C0 ; B 75 0 154 718 ; C -1 ; WX 902 ; N uni04C1 ; B 9 0 893 954 ; C -1 ; WX 658 ; N uni04C2 ; B 8 0 650 759 ; C -1 ; WX 552 ; N uni04C3 ; B 61 0 543 718 ; C -1 ; WX 417 ; N uni04C4 ; B 53 0 409 523 ; C -1 ; WX 595 ; N uni04C7 ; B 61 0 528 718 ; C -1 ; WX 455 ; N uni04C8 ; B 53 0 403 525 ; C -1 ; WX 547 ; N uni04CB ; B 62 0 480 718 ; C -1 ; WX 406 ; N uni04CC ; B 52 0 371 525 ; C -1 ; WX 547 ; N uni04D0 ; B 11 0 536 954 ; C -1 ; WX 456 ; N uni04D1 ; B 30 -15 435 759 ; C -1 ; WX 547 ; N uni04D2 ; B 11 0 536 920 ; C -1 ; WX 456 ; N uni04D3 ; B 30 -15 435 725 ; C -1 ; WX 820 ; N uni04D4 ; B 7 0 780 718 ; C -1 ; WX 729 ; N uni04D5 ; B 30 -15 695 538 ; C -1 ; WX 537 ; N uni04D6 ; B 61 0 495 954 ; C -1 ; WX 456 ; N uni04D7 ; B 33 -15 423 759 ; C -1 ; WX 588 ; N uni04D8 ; B 32 -19 554 737 ; C -1 ; WX 410 ; N afii10846 ; B 25 -15 391 538 ; C -1 ; WX 588 ; N uni04DA ; B 32 -19 554 920 ; C -1 ; WX 410 ; N uni04DB ; B 25 -15 391 725 ; C -1 ; WX 902 ; N uni04DC ; B 9 0 893 920 ; C -1 ; WX 658 ; N uni04DD ; B 8 0 650 725 ; C -1 ; WX 541 ; N uni04DE ; B 42 -19 510 920 ; C -1 ; WX 410 ; N uni04DF ; B 24 -15 378 725 ; C -1 ; WX 541 ; N uni04E0 ; B 42 -19 510 737 ; C -1 ; WX 410 ; N uni04E1 ; B 24 -15 378 538 ; C -1 ; WX 596 ; N uni04E2 ; B 61 0 529 875 ; C -1 ; WX 455 ; N uni04E3 ; B 53 0 403 680 ; C -1 ; WX 596 ; N uni04E4 ; B 61 0 529 920 ; C -1 ; WX 455 ; N uni04E5 ; B 53 0 403 725 ; C -1 ; WX 638 ; N uni04E6 ; B 32 -19 606 920 ; C -1 ; WX 456 ; N uni04E7 ; B 29 -14 427 725 ; C -1 ; WX 638 ; N uni04E8 ; B 32 -19 606 737 ; C -1 ; WX 456 ; N uni04E9 ; B 29 -14 427 538 ; C -1 ; WX 638 ; N uni04EA ; B 32 -19 606 920 ; C -1 ; WX 456 ; N uni04EB ; B 29 -14 427 725 ; C -1 ; WX 590 ; N uni04EC ; B 32 -19 554 920 ; C -1 ; WX 410 ; N uni04ED ; B 25 -15 391 725 ; C -1 ; WX 548 ; N uni04EE ; B 12 0 536 875 ; C -1 ; WX 409 ; N uni04EF ; B 8 -214 400 680 ; C -1 ; WX 548 ; N uni04F0 ; B 12 0 536 920 ; C -1 ; WX 409 ; N uni04F1 ; B 8 -214 400 725 ; C -1 ; WX 548 ; N uni04F2 ; B 12 0 536 959 ; C -1 ; WX 409 ; N uni04F3 ; B 8 -214 400 764 ; C -1 ; WX 547 ; N uni04F4 ; B 62 0 480 920 ; C -1 ; WX 406 ; N uni04F5 ; B 52 0 371 725 ; C -1 ; WX 783 ; N uni04F8 ; B 61 0 716 920 ; C -1 ; WX 585 ; N uni04F9 ; B 53 0 533 725 ; C -1 ; WX 592 ; N Ccircumflex ; B 36 -19 558 959 ; C -1 ; WX 410 ; N ccircumflex ; B 25 -15 391 764 ; C -1 ; WX 592 ; N Cdotaccent ; B 36 -19 558 920 ; C -1 ; WX 410 ; N cdotaccent ; B 25 -15 391 725 ; C -1 ; WX 547 ; N Ebreve ; B 71 0 505 954 ; C -1 ; WX 456 ; N ebreve ; B 33 -15 423 759 ; C -1 ; WX 638 ; N Gcircumflex ; B 39 -19 577 959 ; C -1 ; WX 456 ; N gcircumflex ; B 33 -220 409 764 ; C -1 ; WX 638 ; N Gdotaccent ; B 39 -19 577 920 ; C -1 ; WX 456 ; N gdotaccent ; B 33 -220 409 725 ; C -1 ; WX 592 ; N Hcircumflex ; B 63 0 530 959 ; C -1 ; WX 456 ; N hcircumflex ; B -30 0 403 959 ; C -1 ; WX 592 ; N Hbar ; B 63 0 530 718 ; C -1 ; WX 456 ; N hbar ; B 53 0 403 718 ; C -1 ; WX 228 ; N Itilde ; B -25 0 254 934 ; C -1 ; WX 228 ; N itilde ; B -26 0 253 739 ; C -1 ; WX 228 ; N Ibreve ; B -12 0 240 954 ; C -1 ; WX 228 ; N ibreve ; B -12 0 240 759 ; C -1 ; WX 644 ; N IJ ; B 75 -19 566 718 ; C -1 ; WX 308 ; N ij ; B 55 -210 254 718 ; C -1 ; WX 410 ; N Jcircumflex ; B 14 -19 431 959 ; C -1 ; WX 182 ; N jcircumflex ; B -27 -210 211 786 ; C -1 ; WX 417 ; N kgreenlandic ; B 53 0 409 523 ; C -1 ; WX 456 ; N Ldot ; B 62 0 440 718 ; C -1 ; WX 410 ; N ldot ; B 55 0 348 718 ; C -1 ; WX 456 ; N napostrophe ; B 53 0 403 538 ; C -1 ; WX 592 ; N Eng ; B 62 0 530 718 ; C -1 ; WX 456 ; N eng ; B 53 0 403 538 ; C -1 ; WX 638 ; N Obreve ; B 32 -19 606 954 ; C -1 ; WX 456 ; N obreve ; B 29 -14 427 759 ; C -1 ; WX 547 ; N Scircumflex ; B 40 -19 508 959 ; C -1 ; WX 410 ; N scircumflex ; B 26 -15 380 764 ; C -1 ; WX 501 ; N uni0162 ; B 11 -225 490 718 ; C -1 ; WX 228 ; N uni0163 ; B 11 -232 227 669 ; C -1 ; WX 501 ; N Tbar ; B 11 0 490 718 ; C -1 ; WX 228 ; N tbar ; B 11 -7 211 669 ; C -1 ; WX 592 ; N Utilde ; B 65 -19 528 934 ; C -1 ; WX 456 ; N utilde ; B 56 -15 401 739 ; C -1 ; WX 592 ; N Ubreve ; B 65 -19 528 954 ; C -1 ; WX 456 ; N ubreve ; B 56 -15 401 759 ; C -1 ; WX 774 ; N Wcircumflex ; B 13 0 761 959 ; C -1 ; WX 592 ; N wcircumflex ; B 11 0 581 764 ; C -1 ; WX 547 ; N Ycircumflex ; B 11 0 535 959 ; C -1 ; WX 410 ; N ycircumflex ; B 9 -214 401 764 ; C -1 ; WX 228 ; N longs ; B 11 0 215 728 ; EndCharMetrics StartKernData StartKernPairs 978 KPX quoteright A -60 KPX quoteright AE -63 KPX quoteright Aacute -60 KPX quoteright Adieresis -60 KPX quoteright Aring -60 KPX quoteright comma -48 KPX quoteright d -16 KPX quoteright o -24 KPX quoteright period -48 KPX quoteright r -15 KPX quoteright s -13 KPX quoteright t -3 KPX quoteright w 1 KPX comma one -83 KPX comma quotedblright -22 KPX comma quoteright -33 KPX hyphen A -3 KPX hyphen AE -4 KPX hyphen Aacute -3 KPX hyphen Adieresis -3 KPX hyphen Aring -3 KPX hyphen T -61 KPX hyphen V -29 KPX hyphen W -9 KPX hyphen Y -67 KPX period one -83 KPX period quotedblright -22 KPX period quoteright -33 KPX zero four 5 KPX zero one -31 KPX zero seven -21 KPX one comma -54 KPX one eight -46 KPX one five -49 KPX one four -59 KPX one nine -47 KPX one one -90 KPX one period -54 KPX one seven -64 KPX one six -44 KPX one three -51 KPX one two -50 KPX one zero -43 KPX two four -38 KPX two one -29 KPX two seven -14 KPX three four 8 KPX three one -34 KPX three seven -15 KPX four four 8 KPX four one -65 KPX four seven -39 KPX five four 4 KPX five one -56 KPX five seven -16 KPX six four 6 KPX six one -31 KPX six seven -13 KPX seven colon -47 KPX seven comma -95 KPX seven eight -15 KPX seven five -22 KPX seven four -72 KPX seven one -34 KPX seven period -95 KPX seven seven 3 KPX seven six -24 KPX seven three -14 KPX seven two -14 KPX eight four 6 KPX eight one -36 KPX eight seven -16 KPX nine four 1 KPX nine one -31 KPX nine seven -19 KPX A C -28 KPX A Ccedilla -29 KPX A G -30 KPX A O -27 KPX A Odieresis -27 KPX A Q -28 KPX A T -74 KPX A U -29 KPX A Uacute -29 KPX A Ucircumflex -29 KPX A Udieresis -29 KPX A Ugrave -29 KPX A V -56 KPX A W -39 KPX A Y -78 KPX A a -3 KPX A c -10 KPX A ccedilla -10 KPX A comma 5 KPX A d -11 KPX A e -14 KPX A g -14 KPX A guillemotleft -40 KPX A guilsinglleft -36 KPX A hyphen -2 KPX A o -13 KPX A period 5 KPX A q -11 KPX A quotedblright -37 KPX A quoteright -48 KPX A t -15 KPX A u -12 KPX A v -27 KPX A w -21 KPX A y -27 KPX B A -15 KPX B AE -14 KPX B Aacute -15 KPX B Acircumflex -15 KPX B Adieresis -15 KPX B Aring -15 KPX B Atilde -15 KPX B O -3 KPX B Oacute -3 KPX B Ocircumflex -3 KPX B Odieresis -3 KPX B Ograve -3 KPX B V -25 KPX B W -14 KPX B Y -31 KPX C A -25 KPX C AE -24 KPX C Aacute -25 KPX C Adieresis -25 KPX C Aring -25 KPX C H -6 KPX C K -5 KPX C O -4 KPX C Oacute -4 KPX C Odieresis -4 KPX D A -33 KPX D Aacute -33 KPX D Acircumflex -33 KPX D Adieresis -33 KPX D Agrave -33 KPX D Aring -33 KPX D Atilde -33 KPX D J -1 KPX D T -30 KPX D V -32 KPX D W -18 KPX D X -38 KPX D Y -44 KPX F A -55 KPX F Aacute -55 KPX F Acircumflex -55 KPX F Adieresis -55 KPX F Agrave -55 KPX F Aring -55 KPX F Atilde -55 KPX F J -50 KPX F O -15 KPX F Odieresis -15 KPX F a -26 KPX F aacute -26 KPX F adieresis -26 KPX F ae -26 KPX F aring -26 KPX F comma -102 KPX F e -19 KPX F eacute -19 KPX F hyphen -12 KPX F i -8 KPX F j -8 KPX F o -17 KPX F oacute -17 KPX F odieresis -17 KPX F oe -17 KPX F oslash -17 KPX F period -102 KPX F r -32 KPX F u -28 KPX G A -4 KPX G AE -2 KPX G Aacute -4 KPX G Acircumflex -4 KPX G Adieresis -4 KPX G Agrave -4 KPX G Aring -4 KPX G Atilde -4 KPX G T -30 KPX G V -36 KPX G W -20 KPX G Y -47 KPX J A -22 KPX J AE -21 KPX J Adieresis -22 KPX J Aring -22 KPX K C -37 KPX K G -40 KPX K O -37 KPX K OE -33 KPX K Oacute -37 KPX K Odieresis -37 KPX K S -27 KPX K T 22 KPX K a -6 KPX K adieresis -6 KPX K ae -7 KPX K aring -6 KPX K e -26 KPX K hyphen -38 KPX K o -26 KPX K oacute -26 KPX K odieresis -26 KPX K u -21 KPX K udieresis -21 KPX K y -52 KPX L A 18 KPX L AE 20 KPX L Aacute 18 KPX L Adieresis 18 KPX L Aring 18 KPX L C -28 KPX L Ccedilla -32 KPX L G -31 KPX L O -29 KPX L Oacute -29 KPX L Ocircumflex -29 KPX L Odieresis -29 KPX L Ograve -29 KPX L Otilde -29 KPX L S -11 KPX L T -81 KPX L U -25 KPX L Udieresis -25 KPX L V -78 KPX L W -50 KPX L Y -92 KPX L hyphen -110 KPX L quotedblright -105 KPX L quoteright -116 KPX L u -9 KPX L udieresis -9 KPX L y -47 KPX N A -4 KPX N AE -2 KPX N Aacute -4 KPX N Adieresis -4 KPX N Aring -4 KPX N G -1 KPX N O 1 KPX N Oacute 1 KPX N Odieresis 1 KPX N a -1 KPX N aacute -1 KPX N adieresis -1 KPX N ae -1 KPX N aring -1 KPX N comma -4 KPX N e 1 KPX N eacute 1 KPX N o 1 KPX N oacute 1 KPX N odieresis 1 KPX N oslash 4 KPX N period -4 KPX O A -29 KPX O AE -29 KPX O Aacute -29 KPX O Adieresis -29 KPX O Aring -29 KPX O T -27 KPX O V -30 KPX O W -14 KPX O X -35 KPX O Y -42 KPX P A -62 KPX P AE -64 KPX P Aacute -62 KPX P Adieresis -62 KPX P Aring -62 KPX P J -70 KPX P a -21 KPX P aacute -21 KPX P adieresis -21 KPX P ae -21 KPX P aring -21 KPX P comma -123 KPX P e -24 KPX P eacute -24 KPX P hyphen -28 KPX P o -24 KPX P oacute -24 KPX P odieresis -24 KPX P oe -22 KPX P oslash -22 KPX P period -123 KPX R C -7 KPX R Ccedilla -7 KPX R G -9 KPX R O -6 KPX R OE -3 KPX R Oacute -6 KPX R Odieresis -6 KPX R T -12 KPX R U -8 KPX R Udieresis -8 KPX R V -22 KPX R W -15 KPX R Y -29 KPX R a -6 KPX R aacute -6 KPX R adieresis -6 KPX R ae -6 KPX R aring -6 KPX R e -5 KPX R eacute -5 KPX R hyphen 4 KPX R o -5 KPX R oacute -5 KPX R odieresis -5 KPX R oe -5 KPX R u -4 KPX R uacute -5 KPX R udieresis -5 KPX R y -1 KPX S A -15 KPX S AE -14 KPX S Aacute -15 KPX S Adieresis -15 KPX S Aring -15 KPX S T -14 KPX S V -25 KPX S W -17 KPX S Y -31 KPX S t -2 KPX T A -78 KPX T AE -76 KPX T Aacute -78 KPX T Acircumflex -78 KPX T Adieresis -78 KPX T Agrave -78 KPX T Aring -78 KPX T Atilde -78 KPX T C -27 KPX T G -31 KPX T J -80 KPX T O -26 KPX T OE -22 KPX T Oacute -26 KPX T Ocircumflex -26 KPX T Odieresis -26 KPX T Ograve -26 KPX T Oslash -27 KPX T Otilde -26 KPX T S -15 KPX T V 17 KPX T W 19 KPX T Y 19 KPX T a -79 KPX T ae -79 KPX T c -73 KPX T colon -95 KPX T comma -80 KPX T e -77 KPX T g -76 KPX T guillemotleft -100 KPX T guilsinglleft -96 KPX T hyphen -60 KPX T i -2 KPX T j -2 KPX T o -76 KPX T oslash -72 KPX T period -80 KPX T r -77 KPX T s -74 KPX T semicolon -93 KPX T u -75 KPX T v -79 KPX T w -80 KPX T y -79 KPX U A -32 KPX U AE -32 KPX U Aacute -32 KPX U Acircumflex -32 KPX U Adieresis -32 KPX U Aring -32 KPX U Atilde -32 KPX U comma -24 KPX U m -1 KPX U n -1 KPX U period -22 KPX U r -6 KPX V A -58 KPX V AE -60 KPX V Aacute -58 KPX V Acircumflex -58 KPX V Adieresis -58 KPX V Agrave -58 KPX V Aring -58 KPX V Atilde -58 KPX V C -31 KPX V G -34 KPX V O -30 KPX V Oacute -30 KPX V Ocircumflex -30 KPX V Odieresis -30 KPX V Ograve -30 KPX V Oslash -27 KPX V Otilde -30 KPX V S -26 KPX V T 18 KPX V a -47 KPX V ae -47 KPX V colon -41 KPX V comma -73 KPX V e -46 KPX V g -44 KPX V guillemotleft -68 KPX V guilsinglleft -64 KPX V hyphen -29 KPX V i -5 KPX V o -46 KPX V oslash -41 KPX V period -73 KPX V r -37 KPX V semicolon -41 KPX V u -35 KPX V y -12 KPX W A -42 KPX W AE -43 KPX W Aacute -42 KPX W Acircumflex -42 KPX W Adieresis -42 KPX W Agrave -42 KPX W Aring -42 KPX W Atilde -42 KPX W C -15 KPX W G -18 KPX W O -14 KPX W Oacute -14 KPX W Ocircumflex -14 KPX W Odieresis -14 KPX W Ograve -14 KPX W Oslash -12 KPX W Otilde -14 KPX W S -19 KPX W T 20 KPX W a -29 KPX W ae -29 KPX W colon -31 KPX W comma -46 KPX W e -26 KPX W g -24 KPX W guillemotleft -48 KPX W guilsinglleft -44 KPX W hyphen -9 KPX W i -3 KPX W o -26 KPX W oslash -21 KPX W period -46 KPX W r -26 KPX W semicolon -31 KPX W u -24 KPX W y -2 KPX X C -33 KPX X O -33 KPX X Odieresis -33 KPX X Q -33 KPX X a -12 KPX X e -31 KPX X hyphen -40 KPX X o -31 KPX X u -27 KPX X y -42 KPX Y A -80 KPX Y AE -82 KPX Y Aacute -80 KPX Y Acircumflex -80 KPX Y Adieresis -80 KPX Y Agrave -80 KPX Y Aring -80 KPX Y Atilde -80 KPX Y C -43 KPX Y G -47 KPX Y O -43 KPX Y Oacute -43 KPX Y Ocircumflex -43 KPX Y Odieresis -43 KPX Y Ograve -43 KPX Y Oslash -44 KPX Y Otilde -43 KPX Y S -33 KPX Y T 20 KPX Y a -73 KPX Y ae -73 KPX Y colon -60 KPX Y comma -92 KPX Y e -74 KPX Y g -73 KPX Y guillemotleft -103 KPX Y guilsinglleft -99 KPX Y hyphen -68 KPX Y i -3 KPX Y o -74 KPX Y oslash -69 KPX Y p -48 KPX Y period -92 KPX Y semicolon -60 KPX Y u -54 KPX Y v -31 KPX Z v -24 KPX Z y -25 KPX quoteleft A -52 KPX quoteleft AE -55 KPX quoteleft Aacute -52 KPX quoteleft Adieresis -52 KPX quoteleft Aring -52 KPX quoteleft T 5 KPX quoteleft V 13 KPX quoteleft W 20 KPX quoteleft Y 3 KPX a j -5 KPX a quoteright -10 KPX a v -19 KPX a w -14 KPX a y -20 KPX b v -13 KPX b w -8 KPX b y -15 KPX c h 2 KPX c k 1 KPX e quoteright -5 KPX e t -8 KPX e v -16 KPX e w -11 KPX e x -19 KPX e y -18 KPX f a -9 KPX f aacute -9 KPX f adieresis -9 KPX f ae -9 KPX f aring -9 KPX f e -12 KPX f eacute -12 KPX f f 17 KPX f i -5 KPX f j -5 KPX f l -5 KPX f o -12 KPX f oacute -12 KPX f odieresis -12 KPX f oe -12 KPX f oslash -8 KPX f quoteright 12 KPX f s -4 KPX f t 17 KPX g a 1 KPX g adieresis 1 KPX g ae 1 KPX g aring 1 KPX g e 4 KPX g eacute 4 KPX g l 4 KPX g oacute 4 KPX g odieresis 4 KPX h quoteright -3 KPX h y -14 KPX i T -2 KPX k a -5 KPX k aacute -5 KPX k adieresis -5 KPX k ae -5 KPX k aring -5 KPX k comma 1 KPX k e -19 KPX k eacute -19 KPX k g -18 KPX k hyphen -31 KPX k o -19 KPX k oacute -19 KPX k odieresis -19 KPX k period 1 KPX k s -9 KPX k u -3 KPX k udieresis -3 KPX l v -3 KPX l y -3 KPX m p 4 KPX m v -13 KPX m w -7 KPX m y -13 KPX n T -75 KPX n p 4 KPX n quoteright -3 KPX n v -14 KPX n w -8 KPX n y -14 KPX o T -77 KPX o quoteright -8 KPX o t -7 KPX o v -15 KPX o w -9 KPX o x -18 KPX o y -17 KPX p t -6 KPX p y -15 KPX q c 6 KPX q u 1 KPX r a -3 KPX r aacute -3 KPX r acircumflex -3 KPX r adieresis -3 KPX r ae -3 KPX r agrave -3 KPX r aring -3 KPX r c -6 KPX r ccedilla -3 KPX r colon -5 KPX r comma -48 KPX r d -4 KPX r e -10 KPX r eacute -10 KPX r ecircumflex -10 KPX r egrave -10 KPX r f 23 KPX r g -4 KPX r h 2 KPX r hyphen -30 KPX r i 1 KPX r k 1 KPX r l 1 KPX r m 2 KPX r n 2 KPX r o -11 KPX r oacute -11 KPX r ocircumflex -11 KPX r odieresis -11 KPX r oe -7 KPX r ograve -11 KPX r oslash -7 KPX r p 4 KPX r period -48 KPX r q -4 KPX r quoteright 14 KPX r r -3 KPX r s 2 KPX r semicolon -5 KPX r t 23 KPX r v 24 KPX r w 22 KPX r x 19 KPX r y 23 KPX r z 6 KPX s quoteright -5 KPX s t -5 KPX t S -8 KPX t a 1 KPX t aacute 1 KPX t adieresis 1 KPX t ae 1 KPX t aring 1 KPX t colon -13 KPX t e -10 KPX t eacute -10 KPX t h 1 KPX t o -10 KPX t oacute -10 KPX t odieresis -10 KPX t quoteright 10 KPX t semicolon -13 KPX u quoteright 5 KPX v a -16 KPX v aacute -16 KPX v acircumflex -16 KPX v adieresis -16 KPX v ae -16 KPX v agrave -16 KPX v aring -16 KPX v atilde -16 KPX v c -12 KPX v colon -8 KPX v comma -50 KPX v e -16 KPX v eacute -16 KPX v ecircumflex -16 KPX v egrave -16 KPX v g -15 KPX v hyphen -3 KPX v l -2 KPX v o -16 KPX v oacute -16 KPX v odieresis -16 KPX v ograve -16 KPX v oslash -12 KPX v period -50 KPX v s -10 KPX v semicolon -8 KPX w a -13 KPX w aacute -13 KPX w acircumflex -13 KPX w adieresis -13 KPX w ae -13 KPX w agrave -13 KPX w aring -13 KPX w atilde -13 KPX w c -5 KPX w colon -10 KPX w comma -37 KPX w e -9 KPX w eacute -9 KPX w ecircumflex -9 KPX w egrave -9 KPX w g -8 KPX w hyphen 3 KPX w l -4 KPX w o -9 KPX w oacute -9 KPX w odieresis -9 KPX w ograve -9 KPX w oslash -5 KPX w period -37 KPX w s -7 KPX w semicolon -10 KPX x a -10 KPX x c -13 KPX x e -17 KPX x eacute -17 KPX x o -17 KPX x q -14 KPX y a -16 KPX y aacute -16 KPX y acircumflex -16 KPX y adieresis -16 KPX y ae -16 KPX y agrave -16 KPX y aring -16 KPX y atilde -16 KPX y c -13 KPX y colon -9 KPX y comma -49 KPX y e -17 KPX y eacute -17 KPX y ecircumflex -17 KPX y egrave -17 KPX y g -15 KPX y hyphen -2 KPX y l -3 KPX y o -16 KPX y oacute -16 KPX y odieresis -16 KPX y ograve -16 KPX y oslash -12 KPX y period -49 KPX y s -11 KPX y semicolon -9 KPX quotedblleft A -41 KPX quotedblleft AE -44 KPX quotedblleft Aacute -41 KPX quotedblleft Adieresis -41 KPX quotedblleft Aring -41 KPX quotedblleft T 16 KPX quotedblleft V 24 KPX quotedblleft W 31 KPX quotedblleft Y 14 KPX guilsinglright A -38 KPX guilsinglright AE -39 KPX guilsinglright Aacute -38 KPX guilsinglright Adieresis -38 KPX guilsinglright Aring -38 KPX guilsinglright T -96 KPX guilsinglright V -64 KPX guilsinglright W -43 KPX guilsinglright Y -98 KPX quotedblbase A 24 KPX quotedblbase AE 25 KPX quotedblbase T -60 KPX quotedblbase V -53 KPX quotedblbase W -25 KPX quotedblbase Y -71 KPX quotedblright A -49 KPX quotedblright AE -52 KPX quotedblright Aacute -49 KPX quotedblright Adieresis -49 KPX quotedblright Aring -49 KPX quotedblright T 11 KPX quotedblright V 16 KPX quotedblright W 23 KPX quotedblright Y 9 KPX guillemotright A -42 KPX guillemotright AE -43 KPX guillemotright Aacute -42 KPX guillemotright Adieresis -42 KPX guillemotright Aring -42 KPX guillemotright T -101 KPX guillemotright V -68 KPX guillemotright W -48 KPX guillemotright Y -102 KPX Oslash A -27 KPX ae v -17 KPX ae w -11 KPX ae y -19 KPX Adieresis C -28 KPX Adieresis G -30 KPX Adieresis O -27 KPX Adieresis Q -28 KPX Adieresis T -74 KPX Adieresis U -29 KPX Adieresis V -56 KPX Adieresis W -39 KPX Adieresis Y -78 KPX Adieresis a -3 KPX Adieresis c -10 KPX Adieresis comma 5 KPX Adieresis d -11 KPX Adieresis g -14 KPX Adieresis guillemotleft -40 KPX Adieresis guilsinglleft -36 KPX Adieresis hyphen -2 KPX Adieresis o -13 KPX Adieresis period 5 KPX Adieresis q -11 KPX Adieresis quotedblright -37 KPX Adieresis quoteright -48 KPX Adieresis t -15 KPX Adieresis u -12 KPX Adieresis v -27 KPX Adieresis w -21 KPX Adieresis y -27 KPX Aacute C -28 KPX Aacute G -30 KPX Aacute O -27 KPX Aacute Q -28 KPX Aacute T -74 KPX Aacute U -29 KPX Aacute V -56 KPX Aacute W -39 KPX Aacute Y -78 KPX Aacute a -3 KPX Aacute c -10 KPX Aacute comma 5 KPX Aacute d -11 KPX Aacute e -14 KPX Aacute g -14 KPX Aacute guillemotleft -40 KPX Aacute guilsinglleft -36 KPX Aacute hyphen -2 KPX Aacute o -13 KPX Aacute period 5 KPX Aacute q -11 KPX Aacute quoteright -48 KPX Aacute t -15 KPX Aacute u -12 KPX Aacute v -27 KPX Aacute w -21 KPX Aacute y -27 KPX Agrave C -28 KPX Agrave G -30 KPX Agrave O -27 KPX Agrave Q -28 KPX Agrave T -74 KPX Agrave U -29 KPX Agrave V -56 KPX Agrave W -39 KPX Agrave Y -78 KPX Agrave comma 5 KPX Agrave period 5 KPX Acircumflex C -28 KPX Acircumflex G -30 KPX Acircumflex O -27 KPX Acircumflex Q -28 KPX Acircumflex T -74 KPX Acircumflex U -29 KPX Acircumflex V -56 KPX Acircumflex W -39 KPX Acircumflex Y -78 KPX Acircumflex comma 5 KPX Acircumflex period 5 KPX Atilde C -28 KPX Atilde G -30 KPX Atilde O -27 KPX Atilde Q -28 KPX Atilde T -74 KPX Atilde U -29 KPX Atilde V -56 KPX Atilde W -39 KPX Atilde Y -78 KPX Atilde comma 5 KPX Atilde period 5 KPX Aring C -28 KPX Aring G -30 KPX Aring O -27 KPX Aring Q -28 KPX Aring T -74 KPX Aring U -29 KPX Aring V -56 KPX Aring W -39 KPX Aring Y -78 KPX Aring a -3 KPX Aring c -10 KPX Aring comma 5 KPX Aring d -11 KPX Aring e -14 KPX Aring g -14 KPX Aring guillemotleft -40 KPX Aring guilsinglleft -36 KPX Aring hyphen -2 KPX Aring o -13 KPX Aring period 5 KPX Aring q -11 KPX Aring quotedblright -37 KPX Aring quoteright -48 KPX Aring t -15 KPX Aring u -12 KPX Aring v -27 KPX Aring w -21 KPX Aring y -27 KPX Ccedilla A -28 KPX Odieresis A -29 KPX Odieresis T -27 KPX Odieresis V -30 KPX Odieresis W -14 KPX Odieresis X -35 KPX Odieresis Y -42 KPX Oacute A -29 KPX Oacute T -27 KPX Oacute V -30 KPX Oacute W -14 KPX Oacute Y -42 KPX Ograve T -27 KPX Ograve V -30 KPX Ograve Y -42 KPX Ocircumflex T -27 KPX Ocircumflex V -30 KPX Ocircumflex Y -42 KPX Otilde T -27 KPX Otilde V -30 KPX Otilde Y -42 KPX Udieresis A -32 KPX Udieresis comma -24 KPX Udieresis m -1 KPX Udieresis n -1 KPX Udieresis period -22 KPX Udieresis r -6 KPX Uacute A -32 KPX Uacute comma -24 KPX Uacute m -1 KPX Uacute n -1 KPX Uacute period -22 KPX Uacute r -6 KPX Ugrave A -32 KPX Ucircumflex A -32 KPX adieresis v -19 KPX adieresis w -14 KPX adieresis y -20 KPX aacute v -19 KPX aacute w -14 KPX aacute y -20 KPX agrave v -19 KPX agrave w -14 KPX agrave y -20 KPX aring v -19 KPX aring w -14 KPX aring y -20 KPX eacute v -16 KPX eacute w -11 KPX eacute y -18 KPX ecircumflex v -16 KPX ecircumflex w -11 KPX ecircumflex y -18 KPX odieresis t -7 KPX odieresis v -15 KPX odieresis w -9 KPX odieresis x -18 KPX odieresis y -17 KPX oacute v -15 KPX oacute w -9 KPX oacute y -17 KPX ograve v -15 KPX ograve w -9 KPX ograve y -17 KPX ocircumflex t -7 EndKernPairs EndKernData EndFontMetrics	{ "pile_set_name": "Github" }
An increase in the number of Societies: so what. How the intensity of my forebodings grew at the beginning of spring. Although it was I that, ha, foresaw the effect of our Balkanese plot to promote coffee not tea, I did not even dream that the Western alliance will retaliate with an aerial campaign – that bombardment, presumably, that Tomas was expecting with some dim joy during our drive from the seaside to Beograd. He, and others from the firm, exposed themselves every day to possible missile attacks by walking to the city center, where in the main pedestrian-only square were held protest concerts which to me looked mostly like a ritual of glorification of war and destruction of the nicest buildings, rituals at which instead of cattle people contribute themselves for sacrifice. I had a similar impression about the gatherings at Brankov Most, the Sava bridge most directly in continuation of the city center. A bombardment of Brankov Most was also planned by Western alliance. That is where my colleagues pinned paper targets to their lapels and, perhaps to make it utterly clear to the attackers from the English-speaking countries just what is expected from them, they added the largely printed word TARGET on those same pieces of paper. What’s more, even those of my colleagues who lived in the immediate vicinity of the military targets did not go down into the atomic shelters. Osvald and Maks reported themselves for volunteer military service and awaited a land invasion, when they will participate with slave-like obedience in chest to chest combat which will give them an easy opportunity to get killed and thus shrug all obligations off themselves. What amazed me most, in those days, was that not only the known suicidal types, but also quite ordinary people, exposed themselves to danger; and faces such as the pop and folk musicians and singers; yes, and even those really influential. (I kept in my mind that text about the President: in my seaside days I was too filled with remorse to take it seriously.) And to crown everything, they all went serenely: holding plastic cups with instant coffee and sipping it leisurely - which was their only privilege in those days - for those Yugoslav television companies that were not yet bombed out, also for foreign media, politicians made statements hugely provoking the powerful ones from the air and those who give orders for attacks. What does that mean? Perhaps all of them too are slyly contriving to demonstrate false courage and false faith. Besides… There is no problem if the other side, the guys who blast the military and non-military targets – and hit more than thousand civilians too, with or without a “target” leaflet on the forehead – do not know that their aerial action helps some people to do what they really believe in doing: to make unpunishable attempts at heroic suicide, as only one of the forms of civilian suffering (the bombarded population went through some other forms also, such as hunger, and had some other chances to act heroically). If that is the case, then there is only one side which is right and justified, in this conflict (and that is how things are supposed to be). But I noticed some indications that things might stand differently. The pilots were also offering themselves for sacrifice, no doubt, because, to my boundless amazement, they were prepared to neglect their personal problems in order to mollify the disturbances between nations so remote to them as Serbs and Albanians. And if they saw themselves, after real serious thinking, as doctors for the Serbian and Schiptari soul, that would be proof enough that they are also blinded by The Cross. Not to mention that pilots did get killed too; the population on the bridges diligently celebrated the shooting down of quite a number of helicopters and planes, including the until-then unshootable F-117 A. The crowds probably thought that this would be enough to win the war. But if both sides are right in a war like this, then there are no rules any more. Yes? If they are all suicidal types, then I feel much more isolated today then when I was a perfectly serious candidate for suicide. Practically half of globe is against me! Although I never turned on the radio and TV any more, I could not tune myself out of these things even at home. For instance, I noticed that civil-defense men on duty loved to make similar the two sounds of air-raid sirens – the sound for the beginning and the sound for the end of air peril. The first was supposed to announce, by its wavy, snaking up-and-down tones, that a period begins in which the peace-time rules will be violated; this means chaos, hell; but the other sound, in a flatter, monotonous tone, but of precisely the same “color” of sound failed to return peace to our souls, which was its proclaimed intent. So, the siren, even when it says that the airplanes have gone away, still blares to the people warningly of chaos, and they are, naturally, supposed to find some way out of chaos. But how? By attaching targets on our chest. Oh really? All of this made me uneasy, and I easily could have gone really insane. Fortunately, I was otherwise preoccupied. Like crisscrossing my windows with adhesive-tape X-es, each X twice, double layer, so that the glass would not fly at me during detonation; stockpiling tea, green apples, and oranges such that their meat makes a burning sensation on the lips. As the inter-city telephone lines were overloaded, it took me some twenty minutes to establish connection with my mother and to obtain the information that no bombs had yet fallen on the little town in which she remained. That was not all I did: I transferred the text from my notes-booklet into the computer, but in a disorderly manner. The airy blue rectangle of the monitor screen, gleaming as if wet, did not seem to be infinite; rather, it seemed to be crammed full, right down to its fictive bottom, with all the deceptions I was noticing. So I stuffed the cubical space in front of me, until the laptop, maltreated by frequent power-failures (blackouts) in our electrical grid, finally died. What have I been typing in? – Aphorisms that had an ambition to grow into some serious prose, but without a clear context; heaps of cataractous-eyed sentences not encircled by a clear conclusion. Such as: “Always have I vacillated between wishes and possibilities, female principle and male principle, the material and the spiritual, the urban and the rural, the accumulated sexual and the empty post-coital. If, in addition to that, I measure up the pleasure I feel before getting into bed with a girl, against the panicky efforts to maintain an erection during the sex itself, I will see to what extent the kitsch-contrasts have always clashed in me.” Or: “As one of the crucial criteria we should respect the irrationality, the quality which people often attack because they mix it up with non-pragmatism, which they cannot tolerate. Radio-esthesia is man’s ability to receive from his environment the information which is not available to his regular senses, but which can be measured by the motions of the radio-esthetic equipment. There is some cognition in that too. I do not believe in accidents. What I want to believe in, apparently is not able to help me. What the people around me believe, is full of various redundancies. Fear of god as somebody’s only Christian trait is a recidive of paganism” - there, I wrote that too. And this: “From vast oceanic surfaces water keeps evaporating under the influence of solar heat. Steam so created is then carried by winds over the landmasses, where it is dumped on the ground. A part of it evaporates again, but another part flows in brooks and rivers over the surface or accumulates temporarily in lakes; and yet another part sinks into the earth, all the way to the water-impermeable strata, and there amasses as subterranean water or creates subterranean waterflows which may break out onto the surface again as freshwater springs. To make this circulation even more senseless, all water eventually returns to the sea." I should have written something opposite to theory, I was expected to sail into the practicing of prose. And all that I wrote was known to me already, anyway. 9 I stopped going to work, or into the now overcrowded air-raid shelter; as I lived in one of the more passive parts of town, I concluded that my building is in a relatively safe place. When the sound of distant explosions bounced off my always-shut windows, it resembled, to my mind, thumps on some titanic bass drum with an echo like a tide, which rolls in close and then suddenly stops. What upset me (almost) more than these big, were the little sounds, which passed through the thin walls of the garsonyera: I mean the howling of the vacuum cleaners, crackling of floors, and tinkling of other people’s phones, which seemed to emanate from my kitchen. Around midnight, almost every night, somebody phoned me. But only a hissing and rustling sound was heard from the other side, waterfall-like, as if it were an international call or the sound of a long final trajectory of the needle at the end of an LP record. I thought that it was some nonsense. For one thing, nobody uses vinyl LPs any more: CD won the battle, a long time ago. But when I pressed in proper order several of the plastic buttons on the phone, the busy signal always revealed that someone in my firm is talking exactly then. A little later I would call my firm again, the phone would ring and ring there but he or she, whoever it was, did not pick up the receiver. This done, I would go to sleep. I did not wish to feel a wavelet of air, so I bent the blanket tightly under my knees, neck and feet. So tucked in, I placed one soft pillow on the back of my head and suffered from that direction the blunt, feathery pulsing in the rhythm of a heart. At dawn I would find myself in a true Calvary of sounds. Except for the muffled, varied, interesting events in my again-irritated lungs, I also heard the whooshing of aircraft overhead, rapid bup-bup-buppings of the anti-aircraft defenses, and faint detonations from afar; and some vague water-gurglings, and a strengthening thump of shoes on the staircase. I stopped answering the phone. And opening the door too. But one day, when Robert, escorted by half-asleep Adam, lay down on my doorbell and remained so, I knew that it would be pointless to continue simulating my own absence. They walked in, and I asked them why they did that. - Tomorrow evening – said Robert, taking up the volume of space in one corner of my two-seater piece of furniture – Tomas is making a celebration. He converted the cellar of his house into a super shelter from bombardment. You were absent a long time, so he thought that the opening of the shelter is a good occasion for you to show up… - I’ll see – was my tense promise, and he, practically the next moment, showered me with provocative glorifications of his association of spiritual gutter-cases. - Easy-to-drink metaphysics: the metaphysics that will be dissipated by a single cup of coffee. Well yes: you love coffee – that was my nasty, sweaty reply. He responded with a sour little laughter, while Adam laughed heartily. Robert waved a hand sideways, maybe to indicate that he did not want any coffee. So the better. Silence followed. I could hardly wait to be left alone, and Bert probably wanted to stay for some ten minutes more, and only then leave, just so that it wouldn’t seem that he is leaving because he is angry with me. - What’s with Manya? – said I, tearing a gash in the silence. - Tormented by the last look. - What last look? – said I. - Ahh, some nonsense – said he, gesticulating. – I wonder why she did not talk to you about it, considering the fact that you two are intimate. - So intimate that she did not yet tell me how Tomas manages to turn any money these days. - Same way as before: by his doings with the government. Everyone must, who wants to make any serious money, in this country. Why else would I, a philosopher, work in a merchant firm? No need for a secretary to tell me; everybody knows it, except political idiots – answered Robert, and joyfully poked Adam - who was now slumped - in the ribs. - Philosopher? Well yes: as far as I can judge, you are all mal-using theoretical knowledge – said I calmly, and felt the air become tense. Robert snorted, and suppressed his impulse to get up and go. He quickly said: - Manya is being chased by Osvald, or at least she thinks so. Last time I saw her, she complained that he was at her the whole day, miffed that she had slept with everyone in the firm except with him. Well, with almost everyone – he added, sighed, and then, controlling himself fully, he continued: - After that, she phoned me and said that, as soon as she had left your place, she quickly went home, so as not to spoil the so-called “last look”. That ‘s what I’m telling you about, that is the name of some ritual foolishness. Manya will look at some person, now, concretely, at you, and ascribe sacral values to her looking. When she has seen you for the last time in one day, she will be careful not to look, until midnight, at anything that might spoil, in her head, your image as obtained by that last look. But as she was going home after being with you, one tall man – that’s what she told me on the phone – one tall man followed her all the time. - Osvald? – I ventured. - Her thought too. She did not dare to turn and see if it was really Osvald, because in doing so she would have dirtied the last look. But at some crossroads another man walked towards her, one who resembled Osvald even more than the guy behind her. Fearing the two fictive Osvalds, who were getting closer to each other, Manya stepped off the pavement, walked right through the Beograd-Podgoritza freeway traffic, and, paying no attention, crossed to the other side – he concluded, obviously hoping that his narration about Manya was lengthy enough for him to walk out of my apartment painlessly now. Indeed he left, but Adam did not budge. I knew he is momentarily silent because he has in fact spent himself in outpourings of intelligence or in some other outpourings. I did not like to spend time with someone who is excessively succeptible to inspiration, but right now this guy, moldy from the twilight of my room (his eyes red with a network of swollen little blood-vessels), was sitting on my little three-legged chair and floating in the air. His eyes suddenly bulging out, he established for a fact that I would be really interested in knowing the details of his forty eight hours of non-stop smoking marihuana and listening to music. - What sort of music you listen, Adam? – I wanted to know. - Sixties. - Futile business. Try listening to post-punk or Les Negresses Vertes, but, if you insist on the bad sixties, try hearing the numbers “In a Gadda Da Vida” and “In Fear of Fear” of The Iron Butterfly – I proposed. - Why? Good music? – he asked me, took out a little box of medicines from his black shirt, and wrote these musical remedies down on it. - Kills. Guaranteed. 10 Although I distanced myself, I did not, even in the war conditions, forget Fani; nor did I forget Manya, who had an understanding attitude to my capriciousness, perhaps because she herself did not have too much time. On the other hand, Fani’s frequent visits to me (and her swinging and flopping which went on and on until air in the room boiled) told me that she wants a more permanent relationship. The two of us even celebrated the New Year together, and, on her initiative, the Serbian Orthodox Christmas, on 13th January. She ornamented the saint badnyak oak blanches and leaves by little pieces of paper in which she wrote her rather ordinary wishes. When my home gowns lost all smell, and when the body began to feel her and Manya’s absence, circumstances conspired to make it impossible for me to be with them: Manya had an abdominal problem, because of which she was (from some time before the war) going to bed alone, ashamed of herself; and Fani, a catastrophe took Fani. Without any illusions that my girls wish to become intimate with me again, I decided to devote some attention to them, hoping that it will be returned in some small way at least – by both, or by one of them. The thing to do was to go see Fani and then go to the party in Tomas’s hideout. Loosely dressed, forgetting that it would be decent to appear at least shaven-faced in the hospital, in fact on the party too, I carefully packed my laptop into the wide inner pocket of my leather jacket, and pushed my both gowns into a plastic rubbish bag. Dumped them in the nearest rubbish container in the street, and as for the computer, took it to repairs in the next building. A technician installed the new chip and, for that service, took practically the last shards of my savings. Yet I felt relieved. Facing a springtime afternoon, which was haughtily spreading the smell of a freshly baked pogatchitza, I decided to take a bus to hospital. Because of the war conditions, the number of vehicles was reduced: at the station in front of an all-purpose shop a bus would come, but only one in each forty minutes, and full. Waiting in line for this transportation was made more difficult by the presence of another line, a thick one, for cigarettes, cutting across the mass of waiting potential passengers. In war, people make a bigger effort for a brief luxury than in peace for lasting gains that could make their existence easier. This I was not able to comprehend, nor did I try to. In the busses, young people seemed to enjoy the compression, they watched laughingly as the skin of their arms pressed and deformed against the glass. By pure luck I got into one private bus. On the slippery step just inside the bus door, a middle-aged woman stood holding a child and looking from time to time at the one free square foot of the metal floor; I hopped in behind her, next to a metal rod, the driver engaged the gears, and the woman, happy that she is no longer the last passenger, moved a little and grasped more firmly the butt and the thighs of the pale, merry child. The child – a little girl – then laid her cheek on the mother’s shoulder, and started to sing, in a very low little voice, lines from a hit song about fast cars. This produced a glad smile on the mother’s face. I was pressed with my back against the unyielding door, which was partly glass, and I felt the moisture spreading there, hardening the cloth, as if a wet blackboard was fastened to my shoulders. The closer we got to the hospital, the more strongly was the woman’s sizable butt pressing into my stomach, and the little girl just smiled, showing her spaced-apart teeth; her large, hazel-color eyes looked at me self-confidently, those were the eyes of a keeper of some secret; the secret, I suppose, of my suffering. The two of them got off the bus together with most of the other humble passengers, at the station near the City Hospital on the large Zvezdara hill. The soles of my shoes parted squeakingly from the green rubber floor of the staircase, and then corridor, in the hospital. Each sole would complain audibly while uniting with the floor and then equally audibly while separating from it. Me, I gazed at the nicely formed knees of the hurried fem nurses. They were practically running, because in the corridors there were the new wounded, and from moment to moment some of them were wheeled into the operation rooms. One of the screams, though, was distinct; I heard a certain erotic patina in it. I went into the room wherefrom it emerged. A heavy smell of a sick person resided in there; a smell difficult to remove by airing. It took me some effort to recognize Fani; her skin looked as if it had been painted black, thoroughly, and then washed off by rain. Forehead scraped and skinned badly, penetrated by some white lichen, and both sides of the nose broadened by ghastly black outgrowths or splotches – from several meters away, it was not easy to see which. Only after my second attempt to talk to her, she noticed that I was there, gave me a brief look-over, and murmured something that might have been a hello. A catastrophe, I say, happened to Fani. As I discerned from the conversations of her parents and a doctor, the fatal element was probably her love for a darkish complexion. After a summer extravaganza of sunbathing in Perast, she attended the solariums in Beograd. Now her black hair hang loose, and her worry was a skin cancer, something she never thought of while enjoying, at the seaside, the Sun – at the time when she wrote (with her own skin, then attractive) homages to that star. She was turning over in her hands the corners of a beige jute gown, similar to the one I recently threw away. Then she crumpled parts of it, and dropped it on the floor. Then she flung a nail-cutter at her parents; and a green apple, one of the several fruits they had brought her as present. She was trying to hit them with it. - I don’’ wanna diiiie! – shouted Fani like a spoiled child. She was covered from feet to throat with a stained hospital bedsheet. She was one of the few Beograd inhabitants not at all interested in aerial bombardment. - Maybe you won’t –her father consoled her partly. - You almost surely will not – consoled her the smiling, baldish doctor. – We are going to remove this from the face of our Fanika by a surgical excision. - So at best I will look like a horror case – she said snivelingly, but with an (auto)ironic smile. This was supposed to be her reproach to her parents for not having warned her in good time about the dangers of overexposing herself to light. But, if they had tried, this unfortunate devotee of the solar cult would have shouted them down, almost certainly; she would have chased them off the beach; she was a girl impossible to please. The doctor took the parents aside and quietly told them: If this is only because of the sun and the solariums, she will be cured to some extent. Then he spoke several phrases in Latin. – Something else has me worried – he continued. – Fanika said recently that she is tired and has headache, as was the case in Perast. Tell me, how long before the moving to Beograd did she sleep in one and the same place in the flat? - When she slept at home, she always slept in the same place, for the last five, six years – answered Fani’s father. The doctor turned his head left-right. - If it is what I think, then…………………………… - he murmured. I can record that part of their conversation because at that time they were not aware of my presence. I already totally regretted Fani’s susceptibility, as well as the futility of my compassion. I walked out of the room without saying goodbye to any of them. I descended to the inter-city road Beograd-Podgoritza (and vice versa). I waved my palm and a dark Opel Vectra taxi appeared and stopped. The taxi driver passed through a pedestrians-only zone; the far headlights spilled over the beginning of a nearby park. He checked his tires, then he headed for the Glassmakers’ quarter, where the shelter was. I was already fed up with ordinary taxi drivers who keep slyly quiet when they ought to explain why they are shortchanging me; equally fed up with those who like to burden you with their own problems when they should be silent. Such drivers seem to charge for the ride and for the lecture. This driver was my kind. The ride would have passed, in all probability, without any sound, if the radio had not been turned on, but it was, and it spewed commercials for pendulums, the rashlye, L antennas and biotensors. I looked more closely at that driver: darkish skin complexion, prominent jaw, jinxy look – it was probably the same one who drove me, from Perast to the motel. I asked him something, and he replied in poor Serbian. For consolation I said to myself that maybe, maybe it is not the same man, and I remembered a text from some State-controlled newspaper which said that all Albanians are alike (something like: unfortunately, it is difficult to differentiate those Albanians who are loyal to Serbia from those who are mal-using the Western support and the unjustified Albanian numerical predominance in Kosovo for the purpose of seceding from Serbia). A racist remark which, so I hoped, referred only to physical similarity. When we got near the firm where I worked, and a little farther, to Tomas’s house, the driver got out of his car and walked inside with me; my skin crawled. Together we descended into the cellar. Into the roomy concrete-lined air-raid shelter, fitted with modern equipment. It even had a wooden bar inside. Near the bar were installed a TV, a music “tower” (line) and the loudspeaker boxes that practically hopped up and down in their places, so loud was their music. I allowed the taxi driver to walk off in the direction of the television set. He passed through a group of rather young participants who danced in harmony with each other. Especially noticeable among them was the editor of SeasideWeekly/Daily, who smiled politely at me. He was the first man in that shelter who noticed me. Other dancers did not; maybe they were concentrating too strongly on their attempts to promote some of their own strong points. Adam swung his head decorated by a big bush of hairdo; Robert raised his arms to draw attention to his flaky black gloves whose finger ends he had cut off by scissors; two fem journalists of the Seaside Weekly, wearing shirts tied in knots under the chest, were “mixing”, turning and swaying with their naked bellies. Finally, the editor himself gesticulated with his forearms, not often, but sharply, up, down, because he hoped that somebody might notice his ropy muscles there. I regretted not having completed the text. I noticed Maks next to Tomas and with a slight unease thought that this crowd seemed to be gathered at the stratum of their presence in my meditations. I looked around at the shelter, trying, unsuccessfully, to estimate how safe it really is. I felt even heavier around the heart when I realized that everyone inside is acting joyously as though we were not in a war. The only gloomy figure was Osvald, dressed in black; he swam through the sweaty crowd and materialized next to me. I felt a little easier when it became clear that he intends to stay with me. - This taxi driver, is he Albanian? – said I. - I think he is. His name is Agron. Maks hired him – he told me, hopping a little. - And he is not afraid to work in Serbia, today, and for a boss who is a Serbian military volunteer? - Well you heard, I suppose, that Schiptari are used to living in the hardest conditions – said he. – But: what say you about this shelter? Really in, ha? Perfect topic for newspapers! - Not a good thought – said I, reaching for a krempita, and thinking some things over. - People who do not have enough love, eat sweets – remarked Osvald. Determined to understand, but outside of the interpretation forced on me, what is really happening, I felt my unease suddenly turn inside out. - Where’s Manya? – I said through clenched teeth. In fear, I reached inside my leather jacket, felt the swollen pocket; yes, the laptop was in place. I surrendered myself to a fit of coughing, and stomped one sole of my shoe, once, on the floor. - Quartzing herself – he answered calmly, pouring a dose of water from a little beaker into his glass with whisky. Perhaps his hand caught on somebody else, the six-sided glass fell on its side and a tea-colored liquid splashed over the wooden surface of the bar. Manya finally entered the restaurant. She elbowed her way through the sweaty mass, passed me by, took a juice-vodka and stood at Robert’s side. In the instantly changed atmosphere people stopped having fun. Manya and Robert vanished into the crowd and about fifteen minutes later they returned from the WC in which, on the toilet seat, rested my acquaintance from the Spiritual Paupers’ Society. At a table sat Tomas, answered calls from a mobile phone, wrote out new financial constructions and sipped new coffees. During a string of Iron Butterfly songs Adam approached the slightly jumping sound-box, under which stood Osvald, Maks held a continuing oration for the greater glory of war, and Agron watched him with unconcealed approval, around them crowded members of Ptolemy the First and Spiritual Paupers’ Society; the air-raid danger-alert siren began and, to the sound of this, on the TV screen a piece of red ribbon sprouted, meaning air danger also; with an unhurried house-owner’s steady hand Tomas opened a window and began to call up to the pilots, requesting a series of bombs to be hurled into this shelter, and then continued to blab into his mobile phone, while some young men stuck paper targets onto their foreheads. Robert separated from Manya, leaned his elbows onto the bar and frowningly gazed at Oskar Zvitzer, Manya interposed herself between them and started pinching the young body-builder’s belly, the two of them started a conversation, such that Robert’s big blue veins in the neck swelled even bigger; Maks started to foam at the mouth; Tomas rolled his bulged-out eyes round and round; Adam cried; Manya shivered, and Osvald hopped in place, impatient. Music stopped. Screen blacked out. The murmur died down and became silence, water stopped flowing behind the bar. Glasses were tinklingly put down on the tables. Hands stilled. And only then happened that which I’ve been expecting from the very beginning of this story: about a hundred eyes, calm and cold, looked at me.	{ "pile_set_name": "Pile-CC" }
San Ysidro Land Port of Entry San Ysidro Land Port of Entry (2011-2014) Client: Hensel Phelps Construction Company Work Performed: Building Desconstruction Asbestos & Lead Abatement Salvage & Recycling Mass Excavation & Site Grading Project Description: The San Ysidro Land Port of Entry (SYLPOE) is the busiest land port in the world located on the Mexico-United States Border. The existing, outdated 30-year-old 24/7 facility can no longer support, nor enforce the missions of the U.S. Customs and Border Protection (CBP) operations. The Port currently processes an average of 50,000 northbound vehicles and 25,000 northbound pedestrians per day. The San Diego Association of Governments (SANDAG) predicts an increase in vehicle traffic at San Ysidro of up to 70% by the year 2030. SANDAG’s recentstudy indicates substantial economic impacts of $8.4 billion in lost revenue to the region resulting from increased wait times at the border. Given the delays at current traffic volumes, capacity of the Port must be increased to accommodate regional growth. (reference http://hp-sylpoe.org/) To make way for the new construction, AMG was contracted to “turnkey” the building demolition, asbestos remediation, and earthwork. Phase 1b consists of over 100,000 sq. ft. of existing building demolition and handling close to 80,000 cubic yards of soil for earthwork and grading operations over a three year period. As though working at the busiest land crossing in the world and not disturbing the 24/7 operation wasn’t hard enough. AMG had the challenging and difficult task of deconstructing & dismantling the Administration Building, which serves as the heart of the entire project. The Administration Building is a 2-Story 45,000 sq. ft. structural steel building standing 50 feet off the ground, which serves as the Port’s main building of operation. This building has an 18 foot clearance from the ground floor and allows 50,000 cars per day to cross from Mexico into the United States. AMG’s challenge was to dismantle this enormous building while 50,000 cars pass underneath it, while simultaneously not disrupting the Port’s 24/7 operation. For this, AMG erected a tower crane to dismantle the steel structure and roof section of this building. AMG crews were committed to working multiple shifts around the clock using torches, chop saws, skidsteers, and scissor lifts to remove the 45,000 sq. ft. of metal pandeck and roofing material. To prevent any debris from falling 50′ onto oncoming traffic below, AMG installed an engineered, suspended “dancefloor” scaffolding system. With the tower crane installed, hundreds of 40 cy dumpsters were craned onto the 2nd floor to be loaded with roofing and construction debris and lowered to the ground floor to be hauled off to landfills and recycling plants. The careful dismantling and deconstruction of removing the structural steel roof system finished in an impressive six weeks period.	{ "pile_set_name": "Pile-CC" }
--- abstract: 'We show that one can decide if a rational equivalence relation can be given as the equivalence kernel of a sequential letter-to-letter transduction. This problem comes from the setting of games with imperfect information. In [@BerwangerD18 p. 6] the authors propose to model imperfect information by a rational equivalence relation and leave open the problem of deciding if one can synthesize a sequential letter-to-letter transducer (Mealy machine) which maps equivalent histories to the same sequence of observations. We also show that knowing if an equivalence relation can be given as the equivalence kernel of a sequential transducer is undecidable, even if the relation is given as a letter-to-letter transducer.' author: - Paulin Fournier - Nathan Lhote bibliography: - 'biblio.bib' title: Equivalence kernels of sequential functions and sequential observation synthesis --- Introduction {#introduction .unnumbered} ============ ##### Motivation: games with imperfect information The motivation for the present article comes from the paper: Observation and Distinction. Representing Information in Infinite Games by Dietmar Berwanger and Laurent Doyen, submitted to the arXiv in 2018 [@BerwangerD18]. The authors propose an alternative way of representing imperfect information in games. The standard way to model imperfect information for a player is through a Mealy machine which transforms a sequence of game locations (a history) into a sequence of observations, which we call in the following an observation function. The proposed model of [@BerwangerD18 p. 6] is to give instead a transducer recognizing an indistinguishability relation, i.e. an equivalence relation over game histories which recognizes those pairs of histories that are indistinguishable from the player’s perspective. This new model is actually more expressive than the standard one (composing a Mealy machine with its inverse yields a transducer recognizing the indistinguishability relation), and one of the problems left open in [@BerwangerD18 p. 22] is to decide when an indistinguishability relation can be transformed into an observation function, given as a Mealy machine. Given a class R of equivalence relations and a class F of functions we define the R,F-observation synthesis problem as the problem of deciding if an equivalence relation in R can be expressed as the equivalence kernel[^1] of a function in F, and if possible computing such a function. The main goal of this article is to solve this problem for rational relations and functions given by Mealy machines. Moreover, we also consider the problem of constructing an observation function given, not as a Mealy machine but, as a sequential transducer, i.e. the outputs are not restricted to single letters but can be arbitrary words. In terms of observations, Mealy machines characterize the fact that each game move produces exactly one piece of observation (in some finite alphabet), while for sequential transducers, a move might produce several observations, or even none, in which case this step is invisible to the player. ##### Contributions We don’t use the vocabulary of games, but that of transducers, which is actually more suited to this problem: most of the proof techniques that we use stem from the theory of transducers. We consider several subclasses of [[RatEq]{}]{}, the set of rational equivalence relations, that is relations realized by transducers. The equivalence kernel of a total function $f$, is the equivalence relation defined by having the same image under $f$. The class ${{\bf KerSeq }\xspace}$ contains the equivalence relations that are the equivalence kernels of sequential transductions (a transducer is sequential if it is deterministic with respect to the input). The subclass ${{\bf KerSeq }\xspace}^{{ll}}$ is the set of equivalence relations that are the equivalence kernel of a transduction given as a sequential letter-to-letter transducer (also known as a Mealy machine). We start by studying the simpler class of ${{\bf KerSeq }\xspace}^{{ll}}$ in Sec. \[sec:ltl\] and then consider the class ${{\bf KerSeq }\xspace}$ in Sec. \[sec:seq\]. Our main contribution is to give explicit characterizations for both classes ${{\bf KerSeq }\xspace}$ and ${{\bf KerSeq }\xspace}^{{ll}}$. For relations satisfying these properties, we exhibit a construction of a sequential, resp. letter-to-letter sequential, transducer whose kernel is the original relation. Finally we show that for rational equivalence relations, membership in ${{\bf KerSeq }\xspace}^{{ll}}$ is decidable. In contrast, membership in ${{\bf KerSeq }\xspace}$ is undecidable even for letter-to-letter rational relations (also known as automatic, synchronous or regular relations). Note that while the characterization of ${{\bf KerSeq }\xspace}^{{ll}}$, as well as the construction were already given in [@BerwangerD18 Thm. 29, p. 19], the decidability status was left open. We reprove these results in our framework. Moreover, while extending the construction from ${{\bf KerSeq }\xspace}^{{ll}}$ to ${{\bf KerSeq }\xspace}^{{lp}}$ is rather straightforward, obtaining the characterization for this class is difficult and actually the most challenging part of this article. Words, relations, automata and transducers ========================================== ##### Words, languages and relations An alphabet $A$ is a set of symbols called letter. A word is a finite sequence of letters and we denote by $A^$ the set of finite words with $\epsilon$ denoting the empty word. The length of a word $w$ is denoted by $\|w\|$ with $\|\epsilon\|=0$. Given a non-empty word $w$ and an integer $1\leq i\leq \|w\|$ we denote by $w(i)$ the $i$th letter of $w$, by $w{{({:}i)}}$ the prefix of $w$ up to position $i$ included, and by $w{{(i{:})}}$ the suffix of $w$ from position $i$ included. Given two words $u,v$ we write $u\preceq v$ (resp. $u\prec v$) to denote that $u$ is a (resp. strict) prefix of $v$, and we write $u^{-1}v$ the unique word $w$ such that $uw=v$. A language* over an alphabet $A$ is a subset of $A^$. A word relation* $R$ (or transduction) over alphabets $A,B$ is a subset of $A^\times B^$ and we often write $uRv$ to denote $(u,v)\in R$. Let $R(u)={\left\{v\mid\ uRv \right\}}$, and if $R$ is a partial function from $A^$ to $B^$, we rather write $R(u)=v$ instead of $R(u)={\left\{v \right\}}$. The composition of two relations $R$ and $S$ is $R\circ S={\left\{(u,w)\|\ \exists v,\ uSv\text{ and } vRw \right\}}$. The inverse of a relation $R$ is $R^{-1}={\left\{(v,u)\|\ uRv \right\}}$. The identity relation over an alphabet $A$ is ${Id}={\left\{(u,u)\|\ u\in A^* \right\}}$. The domain and range of a relation $R$ are respectively: ${\mathrm{dom}}(R)={\left\{u\|\ \exists v,\ uRv \right\}}$ and ${\mathrm{ran}}(R)={\left\{v\|\ \exists u,\ uRv \right\}}$. We say that a relation $S$ is finer than $R$ (or that $R$ is coarser than $S$) if for any words $u,v$, $uSv \Rightarrow uRv$, which we denote by $S\subseteq R$. An equivalence relation $R$ over alphabet $A$ is a relation over alphabets $A,A$ such that it is reflexive (${Id}\subseteq R$), symmetric ($R^{-1}\subseteq R$) and transitive ($R\circ R \subseteq R$). Taking the terminology of [@Johnson86 Sec. 2], the (equivalence) kernel of a total function $f:A^\rightarrow B^$ is the equivalence relation $\ker(f)={\left\{(u,v)\|\ f(u)=f(v) \right\}}=f^{-1}\circ f$. A canonical function for an equivalence relation $R$ is a function $f$ such that $\ker (f)=R$. The transitive closure of a relation $R$, denoted by $R^+$, is the finest transitive relation coarser than $R$. Given two equivalence relations $S \subseteq R$ then any equivalence class of $R$ is a union of equivalence classes of $S$ and the index of $S$ with respect to $R$ is the supremum of the number of equivalence classes of $S$ included in a unique equivalence class of $R$. We extend the notion of index to arbitrary relations $S\subseteq R$: the index of $S$ with respect to $R$ is the value $\sup_{\begin{smallmatrix} {u,T\subseteq R(u)}\\ \forall v\neq w\in T,\ v{\cancel S}w \end{smallmatrix}} \|T\|$. We denote by $S\subseteq_k R$ that the index of $S$ with respect to $R$ is at most $k$, by $S\subseteq_{\mathit{ fin}}R$ that the index of $S$ with respect to $R$ is finite, and by $S\subseteq_\infty R$ that the index of $S$ with respect to $R$ is infinite. The valuedness of a relation $R$ is the supremum of the cardinal of the image set of a word, [i.e. ]{}$\sup_{u}\|R(u)\|$. ##### Automata and transducers A finite automaton (or just automaton) over an alphabet $A$ is a tuple ${\mathcal A}={\left(Q,\Delta, I, F \right)}$ where $Q$ is a finite set of states, $\Delta\subseteq Q\times A\times Q$ is a finite transition relation and $I,F\subseteq Q$ are the sets of initial states and final states, respectively. A run of ${\mathcal A}$ over a word $w\in A^$ is a word $r\in Q^$ of length $\|w\|+1$ such that for $1\leq i\leq \|w\|$, ${\left(r(i),w(i),r(i+1) \right)}\in \Delta$. We use the notation $p\xrightarrow{w}_{\mathcal A}q$ (or just $p\xrightarrow{w} q$ when ${\mathcal A}$ is clear from context) to denote that there exists a run $r$ of ${\mathcal A}$ over $w$ such that $r(1)=p$ and $r(\|r\|)=q$. Let $r$ be a run of ${\mathcal A}$, if $r(1)\in I$ then $r$ is called initial, if $r(\|r\|)\in F$ then $r$ is called final and a run which is both initial and final is called accepting. A word $w$ is accepted by ${\mathcal A}$ if there is an accepting run over it and the set of words accepted by ${\mathcal A}$ is called the language recognized by ${\mathcal A}$ and denoted by ${ \llbracket {\mathcal A}\rrbracket}$. A language is called rational if it is recognized by some automaton. An automaton is called deterministic if it has a unique initial state, and for any pair of transitions $(p,a,q_1),(p,a,q_2)\in \Delta$ we have $q_1=q_2$. A finite transducer over alphabets $A,B$ is an automaton over $A^\times B^$. We define the natural projections $\pi_A:(A^\times B^)^\rightarrow A^$ and $\pi_B:(A^\times B^)^\rightarrow B^$. We say that a pair of words $(u,v)\in A^\times B^$ is realized by a transducer ${\mathcal T}$ if there exists a word $w$ such that ${\mathcal T}$ has an accepting run $r$ over $w$, $\pi_A(w)=u$ and $\pi_B(w)=v$, and we write $(u,v)\in { \llbracket {\mathcal T}\rrbracket}$ with ${ \llbracket {\mathcal T}\rrbracket}$ denoting the relation realized by ${\mathcal T}$. A relation realized by a transducer is called rational. Given a transducer ${\mathcal T}={\left(Q,\Delta,I,F \right)}$ we define $\pi_A({\mathcal T})$ the input automaton of ${\mathcal T}$ by ${\left(Q,\pi_A(\Delta),I,F \right)}$, where $\pi_A(\Delta)={\left\{(p,a,q)\|\ \exists b\in B^\ (p,a,b,q)\in \Delta \right\}}$. A transducer is called real-time* if its transitions are over the alphabet $A\times B^$ and letter-to-letter* if its transitions are over $A\times B$. A real-time transducer whose input automaton is deterministic is called sequential and the function it realizes is also called sequential. We say that a relation $R$ is length-preserving if for any words $u,v$, $uRv \Rightarrow \|u\|=\|v\|$. A letter-to-letter transducer realizes a length-preserving relation and it is known that any length-preserving rational relation can be given as a letter-to-letter transducer. However, one can easily see that a sequential length-preserving function cannot in general be given as a letter-to-letter sequential transducer. For instance the function mapping $aa$ to $aa$ and $ab$ to $bb$ is sequential and length-preserving yet cannot be given as a sequential letter-to-letter transducer. ##### Classes of rational equivalence relations We define classes of equivalence relations: [[RatEq]{}]{}the class of all rational equivalence relations, [[KerRat]{}]{}the class of relations which are kernels of rational functions and [[KerSeq ]{}]{}the class of relations which are kernels of sequential functions. For each of the previous classes $\mathbf C$, we define $\mathbf C^{{lp}}$ as the class of length-preserving relations of $\mathbf C$. Similarly we define $\mathbf C^{{ll}}$ by restricting to letter-to letter transducers, and we have obviously that $\mathbf C^{{ll}}\subseteq \mathbf C^{{lp}}$. For instance ${{\bf RatEq}\xspace}^{{ll}}$ is the class of equivalence relations which are given by letter-to-letter transducers while ${{\bf KerSeq }\xspace}^{{ll}}$ is the class of relations which are kernels of letter-to-letter sequential transducers. Fig. \[fig:classes\] gives the relative inclusions of the classes considered in this article, and a similar one can be found in [@Johnson86 Fig. 1]. at (0,1) ; at (0,0) ; at (0,-.5) ; at (0,-1) ; at (0,-1.5) ; at (0,-2) ; (1.5,1) -> (1.5,-2.5); (-1,.7) -> (6,.7); at (4,1) ; at (4,0) ; at (4,-.5) ; at (4,-1) ; at (4,-1.5) ; at (4,-2) ; It is not known whether the classes [[RatEq]{}]{}and [[KerRat]{}]{}are equal or not. The generic problem we want to study is: given a rational equivalence relation, can we effectively decide if it is in [[KerSeq ]{}]{}? Let $R$ be a length-preserving equivalence relation given by a transducer ${\mathcal T}$, we know (e.g. from [@Johnson85 Thm. 5.1]) that there is a canonical function given by a transducer which maps any word to the minimum, for the lexicographic order, of its equivalence class. Hence we have that ${{\bf RatEq}\xspace}^{{ll}}={{\bf RatEq}\xspace}^{{lp}}={{\bf KerRat}\xspace}^{{ll}}={{\bf KerRat}\xspace}^{{lp}}$ and ${{\bf KerSeq }\xspace}^{{ll}}\varsubsetneq {{\bf KerSeq }\xspace}^{{lp}}$, as we have seen above. \(0) at (0,0) ; (1) at (2,0) ; \(0) edge node\[above\] (1); (0) edge\[loop above\] node\[above\] (0); (1) edge\[loop above\] node\[above\] (1); (1) edge\[bend left\] node\[below\] (0); (0) edge +(-.5,0); (0) edge +(0,-.5); \(0) at (0,0) ; (1) at (2,-.9) ; (2) at (2,.9) ; (0) edge node\[above,sloped\] (1); (1) edge\[bend left\] node\[below\] (0); (0) edge\[\] node\[above,sloped\] (2); \(0) edge\[loop above\] node\[above\] (0); (1) edge\[loop above\] node\[above\] (1); (2) edge\[loop above\] node\[above\] (2); \(0) edge +(-.5,0); (2) edge +(-.5,0); (2) edge +(.5,0); \(0) at (0,0) ; (1) at (2,0) ; \(0) edge\[\] node\[above\] (1); (0) edge\[loop above\] node\[above\] (0); (1) edge\[loop above\] node\[above\] (1); (1) edge\[bend left\] node\[below\] (0); (0) edge +(-.5,0); (0) edge +(0,-.5); \(0) at (0,0) ; (1) at (2,0) ; (0) edge\[bend left\] node\[above\] (1); (1) edge\[bend left\] node\[below\] (0); \(0) edge\[loop above\] node\[above\] (0); (1) edge\[loop above\] node\[above\] (1); \(0) edge +(-.5,0); (0) edge +(.5,0); (1) edge +(.5,0); We give in Fig. \[fig:lasta\] an example of length-preserving rational equivalence relation $R$, and we exhibit a rational canonical function for it. This equivalence relation is not in ${{\bf KerSeq }\xspace}$ and this can be shown using the characterization we prove in Sec. \[sec:seq\]. Intuitively, one has to guess when reading an $a$ if it is the last one or not, which cannot be done sequentially. In Fig. \[fig:evena\], we exhibit an equivalence relation which is length-preserving and is the kernel of a sequential function. However it is not the kernel of a letter-to-letter sequential function, which we will be able to show using the characterization from Sec. \[sec:ltl\]. Kernels of sequential letter-to-letter functions {#sec:ltl} ================================================ The goal of this section is to characterize relations which are kernels of sequential letter-to-letter functions. First, in Sections \[subsec:synt\] and \[subsec:pref-close\] we give two necessary conditions for a relation to be in ${{\bf KerSeq }\xspace}^{{ll}}$. Then in Sec. \[subsec:cons-seq-ltl\] we provide an algorithm to construct a sequential letter-to-letter canonical function when the two aforementioned conditions are satisfied, showing that they are indeed sufficient and thus characterize ${{\bf KerSeq }\xspace}^{{ll}}$. Finally in Sec. \[subsec:dec-seq-ltl\], we state the characterization established before and show that it is decidable. Syntactic congruence {#subsec:synt} -------------------- We start by introducing a notion of syntactic congruence associated with an equivalence relation, which will prove crucial throughout the paper. Given a relation $R$, we define $S_R$ the syntactic congruence of $R$ by $uS_Rv$ if for any word $w$, we have $uwRvw$. In particular $S_R$ is finer than $R$ and $S_R$ is a (right) congruence meaning that if $uSv$ then for any letter $a$ we have $uaS_Rva$. Furthermore, if $R$ is an equivalence relation then so is $S_R$. We now exhibit a first necessary condition to be in ${{\bf KerSeq }\xspace}$, and a fortiori in ${{\bf KerSeq }\xspace}^{{ll}}$. \[prop:finite-index\] Let $R$ be an equivalence relation. If $R\in {{\bf KerSeq }\xspace}$ then $S_R$ has finite index with respect to $R$. Let ${\mathcal T}$ be a sequential transducer realizing a function $f$ whose kernel is $R$, and let $n$ be the number of states of ${\mathcal T}$. Let $uRv$, then we have $f(u)=f(v)$. Furthermore, if $u,v$ reach the same state in ${\mathcal T}$, since ${\mathcal T}$ is sequential, $f(uw)=f(vw)$ for any word $w$ which means that $uS_Rv$. Let $u_1Ru_2R\ldots R u_{n+1}$. By a pigeon-hole argument, there must be two indices $1\leq i<j\leq n+1$, such that $u_{i}$ and $u_{j}$ reach the same state in ${\mathcal T}$, hence $u_{i}S_Ru_{j}$. Thus we have shown that the index of $S_R$ with respect to $R$ is less than $ n$, and is thus finite. \(0) at (0,0) ; (1) at (2,-.9) ; (2) at (2,.9) ; \(0) edge node\[below\] (1); (0) edge\[loop above\] node\[above\] (0); (1) edge\[loop above\] node\[above\] (1); (0) edge node\[above,sloped\] (2); (2) edge\[loop above\] node\[right\] (2); (0) edge +(-.5,0); (0) edge +(0,-.5); (1) edge +(.5,0); (2) edge +(.5,0); We give in Fig. \[fig:indexinf\] an example of a length-preserving equivalence relation such that its syntactic congruence does not have a finite index with respect to it. Two different words are never syntactically equivalent, however two words of same length without any $c$s are equivalent. Thus by Prop. \[prop:finite-index\], this relation is not in [[KerSeq ]{}]{}. In the next two propositions, we show that 1) the syntactic congruence can be computed for a relation in ${{\bf RatEq}\xspace}^{{lp}}$ and 2) that the finiteness of its index can also be decided. \[prop:comp-synt\] Let $R$ be an equivalence relation given as a pair-deterministic letter-to-letter transducer. One can compute a transducer recognizing its syntactic congruence in [<span style="font-variant:small-caps;">PTime</span>]{}. Let $R$ be given by a letter-to-letter pair-deterministic transducer ${\mathcal R}$, and let $S_R$ denote its syntactic congruence. Let $(u,v)$ be a pair of words of equal length, and let us denote by $p$ the state reached in ${\mathcal R}$ after reading $(u,v)$. Then $uS_Rv$ if and only if the automaton ${\mathcal R}_p$ (obtained by taking $p$ as initial state) recognizes a reflexive relation. This property can be easily checked and thus $S_R$ is obtained by taking ${\mathcal R}$ and restricting the final states to states $p$ such that ${\mathcal R}_p$ recognizes a reflexive relation. \[prop:dec-fin-index\] Let $R$ be a rational relation given as a transducer ${\mathcal R}$, and let $f$ be a rational function given by a transducer ${\mathcal F}$ such that $S=\ker(f)$ is finer than $R$. Then one can decide if $S$ has finite index with respect to $R$ in [<span style="font-variant:small-caps;">PTime</span>]{}. Let $f$ be a rational function such that $\ker(f)=S$. We show that the index of $S$ with respect to $R$ is equal to the valuedness of $T=f \circ R$. We want to show that for any $u$, $\|T(u)\|=\max_{\begin{smallmatrix} {u,X\subseteq R(u)}\\ \forall v\neq w\in X,\ v{\cancel S}w \end{smallmatrix}} \|X\|$. Let $X\subseteq R(u)$ be such that $\forall v\neq w\in X,\ v{{\cancel S}}w$. Then $f$ is injective over $X$ since $f$ maps words to the same value if and only if they are $S$ equivalent, thus $\|X\|=\|f(X)\|$. Moreover $f(X)\subseteq T(u)$, which means that $\|T(u)\|\geq\max_{\begin{smallmatrix} {u,X\subseteq R(u)}\\ \forall v\neq w\in X,\ v{\cancel S}w \end{smallmatrix}} \|X\|$. For each $v\in T(u)$, we can find a word $v'\in f^{-1}(v)$ (for instance the minimum word in the lexicographic order). Let $X$ be the set of these words, we have by construction $\|X\|=\|T(u)\|$. Moreover, for each pair of distinct words $v',w'\in X$, we have $f(v')\neq f(w')$ and thus in particular $v' {{\cancel S}} w'$. Thus we have shown $\|T(u)\|\leq\max_{\begin{smallmatrix} {u,X\subseteq R(u)}\\ \forall v\neq w\in X,\ v{\cancel S}w \end{smallmatrix}} \|X\|$. Hence the index of $S$ with respect to $R$ is equal to the valuedness of $T$. Since finite valuedness can be decided in [<span style="font-variant:small-caps;">PTime</span>]{}[@Weber89 Thm. 3.1], then one can decide if $S$ has finite index with respect to $R$, also in [<span style="font-variant:small-caps;">PTime</span>]{}. \[cor:dec-finite-index\] Let $R\in {{\bf RatEq}\xspace}^{{lp}}$, one can decide if its syntactic congruence $S_R$ has finite index with respect to it. From Prop. \[prop:comp-synt\] we can compute a transducer realizing $S_R$. According to [@Johnson85 Thm. 5.1], we can even compute a transducer realizing a function whose kernel is $S_R$. Hence from Prop. \[prop:dec-fin-index\] we can decide the finiteness of the index of $S_R$ with respect to $R$. Prefix closure {#subsec:pref-close} -------------- Here we consider a second necessary condition of relations in ${{\bf KerSeq }\xspace}^{{ll}}$, namely that they are prefix-closed. The prefix closure of a relation $R$ is the relation $P_R$ defined by $uP_Rv$ if there exists $u',v'$, with $\|u'\|=\|v'\|$, such that $uu'Rvv'$. A relation is called prefix-closed if it is equal to its prefix closure. We often say that $u,v$ are equivalent in the future when $uP_R v$. \[prop:prefix-closed\] Let $R$ be an equivalence relation. If $R\in {{\bf KerSeq }\xspace}^{{ll}}$ then $R$ is prefix-closed. Let $R$ be an equivalence relation, let $f$ be realized by a transducer in ${{\bf KerSeq }\xspace}^{{ll}}$ such that $\ker f=R$ and let $P_R$ denote the prefix closure of $R$. Let $uP_Rv$, then there exist $u',v'$ with $\|u'\|=\|v'\|$ such that $f(uu')=f(vv')$. Since $f$ is letter-to-letter sequential, we have $f(u)\preceq f(uu')$, $f(v)\preceq f(vv')$ and $\|f(u)\|=\|f(v)\|$ which means that $f(u)=f(v)$. Hence $uRv$, $R=P_R$ and $R$ is prefix-closed. The equivalence relations given in Figures \[fig:lasta\] and \[fig:evena\] are not prefix-closed, which explains why they are not in ${{\bf KerSeq }\xspace}^{{ll}}$, according to Prop. \[prop:prefix-closed\]. Construction of a canonical function {#subsec:cons-seq-ltl} ------------------------------------ The main technical lemma of this section says that the two necessary conditions given above are sufficient: \[lem:cons-seq\] Let $R\in {{\bf RatEq}\xspace}^{{lp}}$ be prefix-closed with a finite index syntactic congruence with respect to it. Then we can construct a sequential letter-to-letter transducer whose kernel is $R$. Let $R\in {{\bf RatEq}\xspace}^{{lp}}$ be given by a transducer ${\mathcal R}={\left(Q,\Delta_R, I, F_R \right)}$ which is letter to letter, over the alphabet $A\times A$, and such that $S_R\subseteq_k R = P_R$ for some $k\in{\mathbb N}$. Without loss of generality, we assume that ${\mathcal R}$ is deterministic. A state of ${\mathcal R}$ will be called diagonal if the identity is accepted from that state, and let $D\subseteq F_R$ be the set of diagonal states. According to Prop. \[prop:comp-synt\], we can obtain a letter-to-letter transducer ${\mathcal S}$ realizing $S$ (just by setting $D$ as the set of final states). Our goal is to define a sequential letter-to-letter transducer ${\mathcal T}$ whose kernel is the relation $R$. The main idea to obtain this construction is to distinguish three kinds of relationships between two words: 1) $uSv$ 2) $u{{\cancel S}}v$ and $uRv$ and 3) $u{\cancel R} v$. Then the key idea, as seen in the proof of Prop. \[prop:finite-index\], is that two words in case number 2) cannot end up in the same state in ${\mathcal T}$. Two words in situation number 1) might as well reach the same state in ${\mathcal T}$ since they have the exact same behavior. Then two words in situation 3) may or may not reach the same state, it does not matter since their image by ${\mathcal T}$ should be different. For each equivalence class of $R$ containing $l\leq k$ different $S$-equivalence classes we define $l$ distinct states. The states will be pairs ${\left(M,i \right)}$ where $M\in {\mathcal M}_l(Q)$ is an $l\times l$ square matrix with values in $Q$, the state space of ${\mathcal R}$, and $i\in {\left\{1,\ldots,l \right\}}$. Let $u_1,\ldots, u_l$ be the least lexicographic representatives of the $l$ $S$-equivalence classes, in lexicographic order. Then $M(i,j)=p$ if $p$ is the state reached in ${\mathcal R}$ after reading $(u_i,u_j)$. Then the state ${\left(M,i \right)}$ is supposed to be the state reached after reading $u_i$, or any other $S$-equivalent word. Let us remark that the reachable states will only contain matrices where all states are accepting, [i.e. ]{}with values in $F_R$. Moreover, all values on the diagonal are in $D$. Let us define a sequential transducer ${\mathcal T}={\left(Q_{\mathcal M},\Delta,{\left\{(M_0,1) \right\}} \right)}$ whose kernel will be the relation $R$ (we don’t specify the final states since all states are final). As we have seen, we define $Q_{\mathcal M}=\bigcup_{l\in{\left\{1,\ldots,k \right\}}}{\mathcal M}_l(Q)\times {\left\{1,\ldots,l \right\}}$. Since the word $\epsilon$ is the only word of length $0$, it is alone in its $R$ and $S$-equivalence classes, hence $M_0$ is the $1\times 1$ matrix with value $q_0$ the initial state of ${\mathcal R}$. We have left to define $\Delta$ and then show that the construction is correct. This will be done by induction on the length of the words. More precisely, let us state the induction hypothesis for words of length $n$: - Let $u_1,\ldots,u_l$ be the minimal representatives of the $S$-equivalence classes of some $R$-equivalence class, of words of length $\leq n$. Then any word $uSu_i$ with $i\in {\left\{1,\ldots,l \right\}}$, reaches the state $(M,i)$ where $M(j,j')$ is the state reached in ${\mathcal R}$ by reading the pair $(u_j,u_{j'})$. - Two words, of length $\leq n$, are $R$-equivalent if and only if their outputs in ${\mathcal T}$ are equal. This trivially holds for the word of length $0$, and let us assume that it holds for words of length $\leq n$. Let $u_1,\ldots,u_l$ be the minimal representatives of the $S$-equivalence classes of some $R$-equivalence class, of words of length $n$. Let us consider the corresponding matrix $M\in {\mathcal M}_l(Q)$. Let us define an equivalence relation $\sim_R$ over ${\left\{1,\ldots,l \right\}}\times A$ which will separate word which are no longer $R$-equivalent. Let $q_{i,j,a,b}$ be the state reached in ${\mathcal R}$ from $M(i,j)$ by reading $(a,b)$. Two pairs $(i,a),(j,b)$ are $\sim_R$-equivalent if $q_{i,j,a,b} \in F_R$. By $Hn.1$ we know that this is indeed an equivalence relation. We define a second equivalence relation $\sim_S$. Two pairs $(i,a),(j,b)$ are equivalent if $q_{i,j,a,b} \in D$. Finally, we consider a linear order on ${\left\{1,\ldots,l \right\}}\times A$ which is just the lexicographic order (with some fixed order over $A$). Let $(i,a)\in {\left\{1,\ldots,l \right\}}\times A$, let us consider the set of minimal $\sim_S$-representatives of the $\sim_R$-equivalence class of $(i,a)$: $$I_R={\left\{(j,b)\|\ (j,b)\sim_R (i,a)\text{ and }\forall (j',b')<(j,b),\ (j,b)\mathrel{{\cancel \sim}_S}(j',b') \right\}}$$ Let $l'$ denote the cardinal of $I_R$, [i.e. ]{}the number of $\sim_S$ equivalence classes in the $\sim_R$-equivalence class of $i$. We define the state $(N,j)$ and the output $b\in B$ such that $((M,i),(a,b),(N,j))\in \Delta$. The output $b$ is defined by $\min I_R$. The matrix $N$ has dimension $l'$ and let $(i_1,a_1),\ldots, (i_{l'},a_{l'})$ be the elements of $I_R$ in increasing order. The matrix $N$ is defined by $N(j,j')=p$ where $p$ is the state reached from $M(i_j,i_{j'})$ by reading $(a_j,a_{j'})$. Let $j$ be the index such that $(i,a)\sim_S (i_j,a_j)$, then we have $((M,i),(a,b),(N,j))\in \Delta$. Let us show $Hn+1.1$. Let $uSu_ja$, we need to show that $u$ reaches the state $(N,j)$. Let $vc=u$, with $c\in A$. Since $vcSu_ja$, we have $vcSu_ja$, which means that $vRu_j$, since $R$ is prefix closed. hence there exists $u_{j'}$ such that $vS u_{j'}$. This means that we have $u_{j'}cSu_ja$ and $u_{j'}c\geq u_ja$ in the lexicographic order. By induction hypothesis, $v$ reaches the state $(M,j')$, and by construction we have $((M,j'),(c,b),(N,j))\in \Delta$. We now show $Hn+1.2$. Let $v_1=w_1a_1,v_2=w_2a_2$ be two words of length $n+1$, with $a_1,a_2\in A$. If $v_1Rv_2$, then $w_1Rw_2$ since $R$ is prefix closed. By induction hypothesis, the outputs over $w_1$ and $w_2$ are the same. Moreover, by construction of $\Delta$, the final outputs reading $a_1$ and $a_2$, respectively, are the same. If $w_1{{\cancel R}}w_2$, then by induction, their outputs are different, and so are the outputs over $v_1,v_2$. The only remaining case is when $w_1Rw_2$ and $v_1{{\cancel R}}v_2$. By induction, we have that the outputs over $w_1,w_2$ are the same, hence we need to show that the outputs from the letters $a_1$, $a_2$ are different. By the construction of $\Delta$, the outputs are linked with $\sim_R$ equivalence classes, which means that the outputs corresponding to $w_1,a_1$ and $w_2,a_2$ are different. Characterization of ${{\bf KerSeq }\xspace}^{{ll}}$ and decidability {#subsec:dec-seq-ltl} -------------------------------------------------------------------- As a corollary we obtain a characterization of ${{\bf KerSeq }\xspace}^{{ll}}$. \[thm:char-seq\] Let $R\in {{\bf RatEq}\xspace}$. The following are equivalent: 1. $R\in {{\bf KerSeq }\xspace}^{{ll}}$ 2. $R$ is length-preserving and $S_R\subseteq_{\mathit{ fin}}R = P_R$ 1.$\Rightarrow$2. comes from the results of Prop. \[prop:finite-index\] and Prop. \[prop:prefix-closed\]. To obtain 2.$\Rightarrow$1. we use the construction of Lem. \[lem:cons-seq\]. From the previous result we get an algorithm deciding if an equivalence relation is in ${{\bf KerSeq }\xspace}^{{ll}}$. \[thm:dec-ltl\] The following problem is decidable. 1. Input: ${\mathcal R}$ a transducer realizing an equivalence relation $R$. 2. Question: Does $R$ belong to ${{\bf KerSeq }\xspace}^{{ll}}$? Without loss of generality, we can assume that ${\mathcal R}$ is a letter-to-letter pair-deterministic transducer. From Cor. \[cor:dec-finite-index\] we can decide if $S_R$ has finite index with respect to $R$. Deciding if $R$ is prefix-closed, is easy: just check if a reachable state is not final. According to Thm. \[thm:char-seq\], we thus have an algorithm to decide the problem. Kernels of sequential functions {#sec:seq} =============================== We turn to the problem of deciding membership in ${{\bf KerSeq }\xspace}^{{lp}}$. To tackle this we introduce another kind of transducers called subsequential, which are transducers allowed to produce a final output at the end of a computation. A subsequential transducer over alphabets $A,B$ is a pair $({\mathcal T}, {\mathit{t}})$, where $ {\mathit{t}}:F\rightarrow B$ is called the final output function ($F$ being the set of final states of ${\mathcal T}$). We denote by [[KerSub]{}]{}the class of equivalence relations which are kernels of subsequential functions. Our results are obtained in two steps. First we exhibit sufficient conditions for being in ${{\bf KerSub}\xspace}^{{ll}}$ very similar to the characterization of ${{\bf KerSeq }\xspace}^{{ll}}$. Second we show that ${{\bf KerSub}\xspace}^{{ll}}={{\bf KerSeq }\xspace}^{{lp}}={{\bf KerSub}\xspace}^{{lp}}$. Construction for ${{\bf KerSub}\xspace}^{{ll}}$ ----------------------------------------------- When studying relations in ${{\bf KerSub}\xspace}^{{ll}}$, we lose the property of being prefix-closed. We have to consider instead the transitive closure of the prefix closure. \[thm:cons-kersseq\] Let $R\in {{\bf RatEq}\xspace}^{{lp}}$, let $P_R$ be the prefix closure of $R$ such that $S_R$ has finite index with respect to $P_R^+$. Then we can construct a subsequential letter-to-letter transducer whose kernel is $R$. From Prop. \[prop:comp-synt\], we can obtain a transducer ${\mathcal S}$ realizing $S_R$. Let ${\mathcal P}$ be a transducer realizing $P_R^+$. Without loss of generality, we assume that ${\mathcal R},{\mathcal S},{\mathcal P}$ are letter-to-letter and deterministic. Let us assume that $S_R\subseteq_k P_R^+$. We use the algorithm defined in the proof of Lem. \[lem:cons-seq\] to obtain a transducer which realizes $P_R^+$, with state space $\bigcup_{l\leq k}{\mathcal M}_l(Q)$, where $Q=Q_{\mathcal R}\times Q_{\mathcal P}$, the product of the state spaces of ${\mathcal R}$ and ${\mathcal P}$. Using the same construction we can obtain a sequential transducer realising $P_R^+$ with the following properties: - Let $u_1,\ldots,u_l$ be the minimal representatives of the $S_R$-equivalence classes of some $P_R^+$-equivalence class. Then any word $uS_Ru_i$ with $i\in {\left\{1,\ldots,l \right\}}$, reaches the state $(M,i)$ where $M(j,j')$ is the state reached in ${\mathcal R}\times{\mathcal P}$ by reading the pair $(u_j,u_{j'})$. - Two words are $P_R^+$ equivalent if and only if their outputs in ${\mathcal T}$ are equal. We only need to define a final output function $t:Q_{\mathcal R}\times Q_{\mathcal P}\rightarrow B$ which will differentiate words that are $P_R^+$ equivalent but not $R$ equivalent. Let $u_1,\ldots,u_l$ be the minimal representatives of the $S_R$-equivalence classes of some $P_R^+$-equivalence class, and let $M\in {\mathcal M}_l(Q)$ be the corresponding matrix such that $M(i,j)$ is the state reached by reading $(u_u,u_{j})$ in ${\mathcal R}\times{\mathcal P}$. Then let us consider the equivalence relation $\sim_R$ over ${\left\{1,\ldots,l \right\}}$ defined by $i\sim_Rj$ if and only if $u_iRu_j$. Then we define $t(M,i)=\min_{j\sim_R i}j$. According to $H.1$ we only need to show that this construction is correct for minimal lexicographic representatives of $S$ classes. Let $u,v$ be two words of same length, and let us assume that $u {\cancel {P_R^+}}v$. Then the images of $u$ and $v$ are already different, even without taking the final output into account. Let us assume that $u P_R^+ v$, then $u,v$ have the same image by ${\mathcal T}$. If $u {\cancel R}v$ considering that $u, v$ are representatives of their respective $S$ class, we have by definition that $t(M,i_u)\neq t(M,i_v)$, where $(M,i_u)$ and $(M,i_v)$ are the states reached by reading $u$ and $v$, respectively. Similarly, we show that if $uRv$, then final outputs are the same which means that the image of $u,v$ by $({\mathcal T},t)$ is the same. Equality of classes ------------------- Let us start by stating the obvious inclusions which are just obtained by syntactic restrictions: ${{\bf KerSub}\xspace}^{{ll}}\subseteq {{\bf KerSub}\xspace}^{{lp}}$ and ${{\bf KerSeq }\xspace}^{{lp}}\subseteq {{\bf KerSub}\xspace}^{{lp}}$. We now show that one can remove the final outputs by adding modulo counting. \[lem:sseq-seq\] ${{\bf KerSub}\xspace}^{{ll}}\subseteq {{\bf KerSeq }\xspace}$ Let $({\mathcal T}, {\mathit{t}})$ with ${\mathcal T}={\left(Q,\Delta, {\left\{q_0 \right\}}, F \right)}$ be a subsequential letter-to-letter transducer over $A,B$ realizing a function $f$, and let $g$ be the function realized by ${\mathcal T}$. Let $\sim_{\mathit{t}}$ be an equivalence relation defined over $F$ by $p\sim_{\mathit{t}}q$ if ${\mathit{t}}(p)={\mathit{t}}(q)$. Let $u,v$ be two words that reach states $p,q$ respectively from $q_0$. Then, $f(u)=f(v)$ if and only if $g(u)=g(v)$ and $p\sim_{\mathit{t}}q$. We know that the number of equivalence classes of $\sim_{\mathit{t}}$ is less than $n=\|B\|$, so we number the equivalence classes from $1$ to $n$. The main idea is to consider $g^n$ which multiplies in $g$ every occurrence of each letter by $n$, except for the last letter. Then, the number of occurrences of the last letter encodes, modulo $n$, the equivalence class of the state. Hence for any words $u,v$ we have $g^n(u)=g^n(v)$ if and only if $g(u)=g(v)$ and $p\sim_{\mathit{t}}q$ if and only if $f(u)=f(v)$, which means that the equivalence kernel of $f$ is equal to that of $g^ n$. Let us now show that $g^n$ is sequential. We extend the equivalence relation $\sim_{\mathit{t}}$ arbitrarily to non final states, and to simplify things, we assume that the equivalence class of the initial state is $n$. Let us define a transducer ${\mathcal T}^n={\left( Q\times B,\Delta^n, {\left\{(q_0,b_0) \right\}}, F\times B \right)}$ realizing $g^n$ (where $b_0$ is some fixed letter in $B$). Let $p,q\in Q$ with respective equivalence classes $i,j\in {\left\{1,\ldots, n \right\}}$ such that $(p,(a,b),q)\in \Delta$. For any $c\in B$ we have $((p,c),(a,c^{n-i}b^{j}),(q,b))\in \Delta^n$. We only have left to show that relations in ${{\bf KerSeq }\xspace}^{{lp}}$ satisfy the sufficient conditions to be in ${{\bf KerSub}\xspace}^{{ll}}$. We need a few technical results before showing the main lemma. The next claim is quite simple and just says that if two words can be equivalent in the future, then they can be equivalent in a near future. \[lem:fut-close\] Let $R\in {{\bf RatEq}\xspace}^{{ll}}$ and let $P_R$ be the prefix closure of $R$. There exists $D\geq 0$ such that for all $u,v$ with $uP_Rv$ there exists $w_1,w_2$ with $\|w_1\|=\|w_2\|\leq D$ and $uw_1Ruw_2$. Let ${\mathcal R}$ be a letter-to-letter transducer recognizing $R$. We assume without loss of generality that ${\mathcal R}$ is pair-deterministic. Then the relation $P_R$ is recognized by ${\mathcal R}'$ which is just ${\mathcal R}$ where all states that can reach a final state become final. Let $D$ be the number of states of ${\mathcal R}$. If $uP_Rv$ there exists $w_1,w_2$ with $\|w_1\|=\|w_2\|\leq D$ and $uw_1Ruw_2$. This next statement is a quite simple consequence of the previous one. If two words are equivalent in the future, then their images by a subsequential kernel function have to be close too. \[lem:fut-out-close\] $R\in {{\bf KerSub}\xspace}^{{lp}}$, let $f$ be a subsequential function such that $\ker(f)=R$ and let $P_R$ be the prefix closure of $R$. There exists $\delta\geq 0$ such that for all $u,v$ with $uP_Rv$, $\|\|f(u)\|-\|f(v)\|\|\leq \delta$. $R\in {{\bf KerSub}\xspace}^{{lp}}$, let $f$ be a subsequential function such that $\ker(f)=R$ and let $P_R$ be the prefix closure of $R$. Let $({\mathcal T},{\mathit t})$ be a subsequential transducer realizing $f$ and let $K$ be the maximal size of an output of $({\mathcal T},{\mathit t})$. According to Lem. \[lem:fut-close\], we know that there exists $D$ such that, if $uP_Rv$, then there exists $w_1,w_2$ with $\|w_1\|=\|w_2\|\leq D$ and $uw_1Ruw_2$. This means that $f(uw_1)=f(vw_2)$, and thus $\|\|f(u)\|-\|f(v)\|\|\leq 2KD$. The next lemma is the most technical part of this section, and its proof is given in App. \[app:fplus-close\] due to a lack of space. It says that if two words are transitively future equivalent, then their images by a subsequential canonical function have to be close. \[lem:fplus-close\] $R\in {{\bf KerSub}\xspace}^{{lp}}$, let $f$ be a subsequential function such that $\ker(f)=R$ and let $P_R$ be the prefix closure of $R$. There exists $D\geq 0$ such that for all $u,v$ with $uP_R^+v$, $\|\|f(u)\|-\|f(v)\|\|\leq D$. The previous lemma shows that two words that are transitively future equivalent must have close output from a subsequential canonical function. By a pigeon-hole argument we obtain in the next corollary that a relation in ${{\bf KerSub}\xspace}^{{lp}}$ must have finite index with respect to the transitive closure of the future equivalence. \[cor:char-kerseq\] Let $R\in {{\bf KerSub}\xspace}^{{lp}}$, and let $P_R$ denote the prefix closure of $R$. Then $S_R$ has finite index with respect to $P_R^+$. Let $({\mathcal T},{\mathit{t}})$ be a subsequential transducer realizing $f$ such that $\ker f=R$, and let $n$ be the number of states of ${\mathcal T}$. According to Lem. \[lem:fplus-close\], there exists $D$ such that for all $u,v$ with $uP_R^+v$, $\|\|f(u)\|-\|f(v)\|\|\leq D$. Let $N=\|B\|^{D+1}$ and let $u_1P_R^+u_2P_R^+\ldots P_R^+ u_{(n+1)N}$. For all $i,j\in{\left\{1,\ldots,(n+1)N \right\}}$, $\|\|f(u_i)\|-\|f(u_j)\|\|\leq D$. This means that the set ${\left\{f(u_i)\|\ 1\leq i\leq (n+1)N \right\}}$ has cardinality less than $N$. Thus there exists $i_1<\ldots<i_{n+1}$ such that $f(u_{i_1})=\ldots=f(u_{i_{n+1}})$. One can see that there must be two indices $1\leq j<k\leq n+1$, such that $u_{i_{j}}$ and $u_{i_{k}}$ reach the same state in ${\mathcal T}$, hence $u_{i}Ru_{j}$, and even $u_{i}S_Ru_{j}$. Thus we have shown that the index of $S_R$ with respect to $P_R^+$ is less than $ (n+1)N$, and is thus finite. \[prop:eq-classes\] The following classes of equivalence relations are identical: 1. ${{\bf KerSeq }\xspace}^{{lp}}$ 2. ${{\bf KerSub}\xspace}^{{ll}}$ 3. ${{\bf KerSub}\xspace}^{{lp}}$ The proof is given in Fig. \[fig:proof\]. The arrows represent class inclusion. Black arrows are trivial syntactic restrictions. (sl) at (0,0) ; (p) at (4,0) ; (sp) at (2,2) ; (sl) edge\[\] (sp); (p) edge\[\] (sp); (sp) edge\[bend right\] node\[above left\] (sl); (sl) edge\[\] node\[above\] (p); Deciding membership in [[KerSeq ]{}]{} ========================================== We show here that knowing if a rational equivalence relation is in ${{\bf KerSeq }\xspace}$ is an undecidable problem, and this even if the relation is length-preserving. The trouble lies with computing the equivalence relation $P_R^+$. Indeed, transitive closures of even very simple relations are known not to be computable (the next configuration of a Turing machine can be computed by a simple transduction). Let us first state a characterization of ${{\bf KerSeq }\xspace}^{{lp}}$, by combining the results of the previous subsections. \[thm:char-seq2\] Let $R\in {{\bf RatEq}\xspace}^{{ll}}$. The following are equivalent: 1. $R\in {{\bf KerSeq }\xspace}$ 2. $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R^+$ 3. $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R$ and $\exists k\ P_R^k=P_R^{k+1}$ $1\rightarrow 2$. Let $R\in {{\bf RatEq}\xspace}^{{ll}}$. Let us first assume that $R\in {{\bf KerSeq }\xspace}$. Then according to Cor. \[cor:char-kerseq\], we have $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R^+$. $2\rightarrow 1$. Conversely, let us assume that $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R^+$. According to Theorem \[thm:cons-kersseq\], we can construct a subsequential letter-to-letter transducer whose kernel is $R$. From Lem. \[lem:sseq-seq\], we have $R\in {{\bf KerSeq }\xspace}$. $2\rightarrow 3$. Let us assume $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R^+$. In particular $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R$. Let us assume that $S_R\subseteq_N P_R^+$. Let $uP_R^+ v$ and let $u=u_0P_Ru_1\ldots P_R u_m=v$ be a chain of minimal length $m$. If we assume $m>N$, then there must exist $i,j\leq m$ such that $u_iS_Ru_j$. Since $u_i$ and $u_j$ are syntactically equivalent, this means that $u_iP_Rw \Leftrightarrow u_jP_Rw$. Thus we can obtain a strictly smaller chain, which contradicts the assumption, thus $P_R^N=P_R^{N+1}$. $3\rightarrow 2$. Finally, let us assume $S_R\subseteq_{\mathit{ fin}}R\subseteq_{\mathit{ fin}}P_R$ and $\exists k\ P_R^k=P_R^{k+1}$. Let us assume that $S\subseteq_N P_R$. We only have to show $S_R\subseteq_{N^k}P_R^k$ to conclude the proof. Let us assume that for some $i$ we have $S_R\subseteq_{N^i}P_R^i$. We want to show that $S_R\subseteq_{N^i}P_R^{i+1}$. Let $u\in A^+$, let $T= P_R^{i}(u)$. Let $T'\subseteq T$ be such that $\forall v\in T,\ \exists! w\in T',\ vS_Rw$. Thus we have $P_R(T)=P_R(T')$ since $S_R$ is the syntactic equivalence relation of $R$. Moreover, we have $\|T'\|\leq N^i$ by assumption, since for all words $v,w\in T'$, $v{{\cancel S_R}}w$. For each $v\in T'$, for each $X\subseteq P_R(v)$ verifying $\forall x,y\ x{\cancel{S}_R}y$, we know by assumption that $\|X\|\leq N$. Thus for any $Y\subseteq P_R(T)=P_R(T')$ verifying $\forall x,y\ x{\cancel{S}_R}y$, we know that $\|Y\|\leq \|T'\|\cdot N\leq N^{i+1}$, which concludes the proof. From this characterization we obtain two decidability results, one negative and one positive. \[thm:undec-seq\] The following problem is undecidable: Input: ${\mathcal R}$ a letter-to-letter transducer realizing an equivalence relation $R$. Question: Does $R$ belong to ${{\bf KerSeq }\xspace}$? The proof of this theorem relies on a reduction of the mortality problem, see [@Hooper66 p. 226] and is given in App. \[app:undec-seq\]. The next theorem shows that we are able to identify exactly where the undecidability comes from: computing the transitive closure of the relation $P_R$. The following problem is decidable: Input: ${\mathcal R},{\mathcal P}$ two transducers realizing equivalence relations $R,P$, respectively, such that $P$ is the transitive closure of the prefix closure of $R$. Question: Does $R$ belong to ${{\bf KerSeq }\xspace}^{{lp}}$? To show this we rely on the characterization from Thm .\[thm:char-seq2\]. We proceed as in the proof of Thm. \[thm:dec-ltl\], except that we want to check whether $S_R$ has finite index with respect to $P=P_R^+$ instead of $R$. First we can compute a transducer realizing $S_R$, according to Prop. \[prop:comp-synt\]. Then from [@Johnson85 Thm. 5.1], we know we can obtain a transducer realizing a function $f$ whose kernel is $S_R$. Then, using Prop. \[prop:dec-fin-index\], we can decide if $S_R$ has finite index with respect to $P$. We sum up the decidability of the problem for different classes of equivalence relations in the table of Fig. \[fig:table\]. New results are shown in red. $\quad$Relations $\backslash$ Kernels$\quad$ $\quad {{\bf KerSeq }\xspace}^{{ll}}\quad$ $\quad{{\bf KerSeq }\xspace}\quad$ $\quad {{\bf KerRat}\xspace}\quad$ ------------------------------------------------- -------------------------------------------- ------------------------------------ ------------------------------------ ${{\bf RatEq}\xspace}^{{ll}}$ (Thm. \[thm:undec-seq\]) ${{\bf RatEq}\xspace}^{{\color{white} {{ll}}}}$ (Thm. \[thm:dec-ltl\]) Conclusion {#conclusion .unnumbered} ========== We have studied the observation synthesis problem for two classes of observation functions: ${{\bf KerSeq }\xspace}$ and ${{\bf KerSeq }\xspace}^{{ll}}$. A natural question would be to consider the same problem for different classes of functions. However, the term observation function is only justified (and related to games with imperfect information) if the functions considered are monotone meaning that if $h_1\prec h_2$ denotes that history $h_1$ is a prefix of history $h_2$, then any reasonable class of observation function should ensure that $f(h_1)\prec f(h_2)$, for any function $f$. Since bounded memory and monotonicity somehow characterize the sequential functions, this means that such a class of observation functions would have to use unbounded memory, for instance the class of regular function, i.e. functions realized by two-way transducers. In terms of observations, this would mean that a single game step could give an arbitrary long (actually linear in the size of the history) sequence of observations. Acknowledgements {#acknowledgements .unnumbered} ================ We would like to thank Bruno Guillon for his help in obtaining the undecidability result. Proof of Lem. \[lem:fplus-close\] {#app:fplus-close} ================================= $R\in {{\bf KerSub}\xspace}^{{lp}}$, let $f$ be a subsequential function such that $\ker(f)=R$ and let $P$ be the prefix closure of $R$. Let $({\mathcal T},{\mathit t})$ be a subsequential transducer realizing $f$ and let $K$ be the maximal size of an output of $({\mathcal T},{\mathit t})$ . Let us remark that there are no loops in ${\mathcal T}$ that produce nothing. Indeed, if we assume otherwise, then we can find a loop in ${\mathcal T}$ producing nothing, contradicting the fact that $R$ is length-preserving. Hence let $k$ be the smallest ratio of output length over input length for a simple loop in ${\mathcal T}$. Thus we have for any words $u, v$, $k\|v\|-b\leq \|\|f(uv)\|-\|f(u)\|\|\leq K\|v\|$. Let us assume towards a contradiction that the statement does not hold. This means that for any $D$, we can find a sequence $u_0Pu_1P\ldots Pu_N$, such that $\|\|f(u_0)\|-\|f(u_N)\|\|\geq D$. Without loss of generality, let us assume that $\|f(u_0)\|$ is minimal among ${\left\{\|f(u_i)\|\ \mid\ 0\leq i\leq N \right\}}$. According to Lem. \[lem:fut-out-close\] there exists $\delta$ such that $\|\|f(u_{i-1})\|-\|f(u_{i})\|\|\leq \delta$, for any $i\in{\left\{1,\ldots,N \right\}}$. Thus, for any integer $M\in {\left\{\|f(u_0)\|,\|f(u_0)\|+1,\ldots, \|f(u_N)\| \right\}}$, there exists $i\in{\left\{0,\ldots,N \right\}} $ and $d\in {\left\{0,\ldots, \delta \right\}}$ such that $\|f(u_i)\|+d=M$. Let $C> \max(3,K,\frac {2K} k,\delta,b)$ be a large enough integer. We extract a subsequence of the $u_i$s defined in the following way. Let $i\geq 0$ be such that $\|f(u_0)\|+C^i+\delta \leq \|f(u_N)\|$, then there exists $u\in {\left\{u_0,\ldots,u_N \right\}}$ such that $\|f(u)\|=C^i+d_i$, with $d_i\in {\left\{0,\ldots, \delta \right\}}$, and we set $v_i=u$. Let $v_i'$ be the smallest prefix of $v_i$ such that $\|f(v_{i}')\|= \|f(u_0)\|+d_i'$ with $d_i'\in {\left\{0,\ldots, \delta \right\}}$. Then we obtain: $$\begin{array}{rcccl} k{ \lVert v_i,v_i' \rVert}-b &\leq& { \lVert f(v_{i}),f(v_{i}') \rVert} &\leq & K{ \lVert v_i,v_i' \rVert}\\ k{ \lVert v_i,v_i' \rVert}-b &\leq & C^i+d_i-d_i' &\leq& K{ \lVert v_i,v_i' \rVert}\\ \end{array}$$ Using these inequalities for $i+1$ and $i$ we have: $$\begin{array}{rllllll} { \lVert v_{i+1},v_{i+1}' \rVert} &\geq & \frac{C}{K}C^i+\frac{d_{i+1}-d_{i+1}'}{K} \\ &\geq & \frac{C}{K}(k{ \lVert v_i,v_i' \rVert}-b+d_i'-d_i)+\frac{d_{i+1}-d_{i+1}'}{K} \\ &\geq & C\frac{k}{K}{ \lVert v_i,v_i' \rVert}+\frac{C(-b+d_i'-d_i)+d_{i+1}-d_{i+1}'}{K} \\ &\geq & C\frac{k}{K}{ \lVert v_i,v_i' \rVert}-\frac{C(b+\delta)+\delta}{K} \\ &> & C\frac{k}{K}{ \lVert v_i,v_i' \rVert}-\frac{2C^2+C}{K} \\ \end{array}$$ It suffices to show $C\frac{k}{K}{ \lVert v_i,v_i' \rVert}-\frac{2C^2+C}{K}\geq { \lVert v_i,v_i' \rVert}$ in order to obtain ${ \lVert v_{i+1},v_{i+1}' \rVert}> { \lVert v_i,v_i' \rVert}$. $$\begin{array}{rrrllll} &C\frac{k}{K}{ \lVert v_i,v_i' \rVert}-\frac{2C^2+C)}{K} &\geq &{ \lVert v_i,v_i' \rVert}\\ \Longleftrightarrow\quad &Ck{ \lVert v_i,v_i' \rVert}-(2C^2+C) &\geq &K{ \lVert v_i,v_i' \rVert}\\ \Longleftrightarrow\quad & { \lVert v_i,v_i' \rVert} &\geq &\frac{2C^2+C}{Ck-K} \end{array}$$ Since $C>\frac{2K}{k}$, we only have to show ${ \lVert v_i,v_i' \rVert} \geq 2C^2+C$. Moreover, we know that ${ \lVert v_i,v_i' \rVert} \geq \frac{C^i-\delta}{K} $. Thus it suffices to show that $\frac{C^i-C}{C}\geq 2C^2+C$, since $C$ is larger than both $K$ and $\delta$. The inequality holds, as long as $i\geq 4$, since $C$ is larger than 3. This means that ${ \lVert v_{i+1},v_{i+1}' \rVert}> { \lVert v_i,v_i' \rVert}$ for any $i>3$. Since all $v_i$s have the same length, this means that all $v_i'$s have different length, for $i>3$. For $D$ large enough, we can assume that there are more than $B^{\delta+1}$ $v_i'$s of different lengths. Thus there must exist two with the same image, which contradicts the assumption that $R$ is length-preserving. Proof of Thm. \[thm:undec-seq\] {#app:undec-seq} =============================== We use a reduction from the following problem, which well call the bounded configuration problem: Input: $M$ a reversible Turing machine Question: Is there a computation $c_1\rightarrow c_2 \rightarrow \ldots$ which visits an infinite number of configurations. We first give the reduction and then show that the problem is actually undecidable. Let $M$ be a Turing machine with alphabet $\Sigma$, a state space $Q$ and a transition function $\delta:Q\times\Sigma\rightarrow Q\times \Sigma\times {\left\{\mathrm{left}, \mathrm{right} \right\}}$. A configuration is a word over $\Sigma\cup Q$, with exactly one occurrence of a letter in $Q$. We define a letter-to-letter transducer ${\mathcal R}$ recognizing an equivalence relation $R$, with a prefix closure $P$. Let $c_1,c_2$ be a pair of consecutive configurations, then ${\mathcal R}$ recognizes the pairs $(c_1\sharp1,c_2\sharp2)$, and $(c_2\sharp2,c_1\sharp1)$ by symmetry. Note that these equivalence classes of $R$ have size $2$. Words of the shape $c\sharp$, with $c$ a configuration are only equivalent to themselves. Words that are strict prefixes of words of the shape $c\sharp$ are all equivalent, if they have the same size. All other words are only equivalent to themselves. On can easily see that there exists $k$ such that $P^k=P^{k+1}$ if and only if computations of $M$ visit at most $k+1$ different configurations. We only have left to check that there are computations of unbounded size if and only if there is an infinite computation. Let $c_1,c_2,\ldots$ be configurations sur that from $c_n$, the machine $M$ visits at least $n$ distinct configurations. Then we can extract a subsequence $d_1,d_2,\ldots$ such that all configurations start in the same state. Extracting a subsequence we can assume that all cells of the tape at distance $1$ from the reading head agree. Repeating the operation, we end up with a configuration which visits more than $n$ configurations for any $n$, i.e. is infinite. The bounded configuration problem is undecidable. This is shown by a reduction from the mortality problem which amounts to deciding if a Turing machine has an infinite computation. Note that this is different from the halting problem, because we ask if the machine halts on all possible configurations. This problem was shown to be undecidable in [@Hooper66 p. 226] for Turing machines and in [@KariO08 Thm. 7] for reversible Turing machines. Assume that the bounded configuration problem is decidable. Given a reversible machine $M$, if is has a computation visiting an infinite number of configurations, then it has an infinite computation. If there is no computation visiting an infinite number of distinct configurations then there is a uniform bound on the number of configurations that a computation can visit. This bound $k$ can be computed, just by simulating the machine on larger and larger configurations. Then, on can easily see if one of the computations loops, and thus decide if the machine has an infinite computation. [^1]: The equivalence kernel of a total function $f$ is defined by $x\sim y \Leftrightarrow f(x)=f(y)$	{ "pile_set_name": "ArXiv" }
Two letters picked without replacement from sspsoskspssrrrsosoc. What is prob of picking 2 s? 4/19 Three letters picked without replacement from {u: 2, y: 1, v: 4, g: 1, t: 1, a: 3}. What is prob of picking 3 v? 1/55 Calculate prob of picking 4 u when four letters picked without replacement from uuuuccucuucc. 7/99 What is prob of picking 1 g, 1 i, and 1 w when three letters picked without replacement from {y: 1, a: 1, j: 1, i: 1, g: 2, w: 1}? 2/35 Three letters picked without replacement from vvvvvvv. Give prob of picking 3 v. 1 What is prob of picking 2 c and 2 t when four letters picked without replacement from {m: 7, t: 3, l: 7, c: 3}? 3/1615 Calculate prob of picking 1 h and 2 b when three letters picked without replacement from rzbrzzh. 0 What is prob of picking 2 l and 1 s when three letters picked without replacement from {s: 8, l: 2}? 1/15 Two letters picked without replacement from lqgg. Give prob of picking 1 l and 1 q. 1/6 What is prob of picking 2 q and 1 k when three letters picked without replacement from tcykyttttqcyfc? 0 Three letters picked without replacement from gggkgksgsksr. Give prob of picking 1 g, 1 s, and 1 k. 9/44 What is prob of picking 1 u, 1 q, and 2 i when four letters picked without replacement from {u: 4, o: 1, i: 10, q: 1, p: 4}? 12/323 Two letters picked without replacement from dpdpjpwmjpdjd. Give prob of picking 1 m and 1 p. 2/39 Calculate prob of picking 2 f and 1 r when three letters picked without replacement from hrzhzuuzfrzrzfzu. 3/560 Two letters picked without replacement from {f: 3, q: 3}. What is prob of picking 2 f? 1/5 Calculate prob of picking 3 n and 1 c when four letters picked without replacement from cncnncncccccccnc. 11/182 Three letters picked without replacement from {i: 1, a: 1, m: 1, h: 1, g: 1}. Give prob of picking 3 m. 0 Calculate prob of picking 1 f, 2 l, and 1 v when four letters picked without replacement from ptlplfvtvpptvt. 3/1001 Two letters picked without replacement from zkzkkkkzzkkpphzk. Give prob of picking 1 h and 1 p. 1/60 Four letters picked without replacement from bfejffbgfjejeij. What is prob of picking 1 g, 2 j, and 1 i? 2/455 Two letters picked without replacement from {t: 2, s: 3, k: 4}. Give prob of picking 2 k. 1/6 What is prob of picking 2 f when two letters picked without replacement from qqcjwjjwqjjjcjcjfqf? 1/171 Calculate prob of picking 2 f and 1 w when three letters picked without replacement from {f: 4, w: 1, t: 1, e: 4}. 1/20 Two letters picked without replacement from pjixyxxiyixxpi. What is prob of picking 1 j and 1 x? 5/91 Two letters picked without replacement from {h: 6, i: 3, g: 1, x: 7}. What is prob of picking 2 i? 3/136 Calculate prob of picking 1 y and 1 q when two letters picked without replacement from {q: 7, y: 2}. 7/18 What is prob of picking 2 e and 1 n when three letters picked without replacement from eenennenenneennneene? 15/38 Two letters picked without replacement from kkzzkkkkkkzkkkkkzkk. Give prob of picking 1 k and 1 z. 20/57 Three letters picked without replacement from nhnnnnnnnnnnnnnnnnnn. Give prob of picking 2 n and 1 h. 3/20 Four letters picked without replacement from {b: 1, l: 1, u: 1, w: 2, i: 2, f: 1}. What is prob of picking 1 i, 1 u, 1 f, and 1 l? 1/35 Three letters picked without replacement from {k: 14, p: 4}. Give prob of picking 3 k. 91/204 What is prob of picking 2 z and 1 o when three letters picked without replacement from mbmdmzmzzzmo? 3/110 Calculate prob of picking 1 f and 3 k when four letters picked without replacement from ffffkfkkffffffff. 1/140 What is prob of picking 1 f and 1 m when two letters picked without replacement from fffffffffffmffffffm? 34/171 What is prob of picking 2 o and 1 x when three letters picked without replacement from ouxxxouoooonox? 3/13 What is prob of picking 4 w when four letters picked without replacement from {y: 5, w: 14}? 1001/3876 Calculate prob of picking 1 b and 1 v when two letters picked without replacement from {v: 6, a: 4, b: 2}. 2/11 Four letters picked without replacement from {s: 4, d: 2}. What is prob of picking 4 s? 1/15 What is prob of picking 3 o when three letters picked without replacement from {x: 4, o: 6, m: 7}? 1/34 What is prob of picking 2 s, 1 n, and 1 o when four letters picked without replacement from {s: 5, q: 1, k: 1, o: 2, n: 1}? 2/21 Three letters picked without replacement from ppp. Give prob of picking 3 p. 1 Four letters picked without replacement from {f: 1, a: 1, o: 1, w: 1, d: 2, b: 2}. Give prob of picking 1 b, 2 a, and 1 f. 0 Calculate prob of picking 1 d, 1 r, and 2 p when four letters picked without replacement from {z: 6, d: 1, p: 2, r: 2}. 1/165 What is prob of picking 1 e and 1 u when two letters picked without replacement from {e: 2, p: 3, u: 15}? 3/19 Three letters picked without replacement from dbduthuuhtdddduuiu. Give prob of picking 1 u, 1 i, and 1 t. 1/68 Two letters picked without replacement from {e: 1, u: 3, x: 9, a: 4, o: 2}. Give prob of picking 1 x and 1 o. 2/19 What is prob of picking 3 n when three letters picked without replacement from {i: 2, y: 1, k: 2, n: 1, d: 2, q: 1}? 0 Four letters picked without replacement from {e: 5, q: 7}. Give prob of picking 2 q and 2 e. 14/33 Calculate prob of picking 2 y when two letters picked without replacement from {a: 5, y: 2}. 1/21 Two letters picked without replacement from aaabbb. Give prob of picking 2 a. 1/5 Calculate prob of picking 1 t and 3 u when four letters picked without replacement from tttcuuuucuuu. 7/33 Three letters picked without replacement from ttaaa. Give prob of picking 3 a. 1/10 What is prob of picking 2 i when two letters picked without replacement from ihhhihioh? 1/12 Two letters picked without replacement from {j: 4, g: 3, d: 2}. Give prob of picking 1 g and 1 j. 1/3 What is prob of picking 1 p and 2 t when three letters picked without replacement from dtdptddddttddddpptp? 40/969 Three letters picked without replacement from {n: 2, s: 7, f: 2, w: 1}. What is prob of picking 1 s and 2 f? 7/220 Calculate prob of picking 4 h when four letters picked without replacement from ooooohoohhh. 1/330 Calculate prob of picking 1 y and 1 v when two letters picked without replacement from yyyvyvvyvv. 5/9 Three letters picked without replacement from {c: 7, f: 12}. What is prob of picking 1 c and 2 f? 154/323 Calculate prob of picking 4 t when four letters picked without replacement from tttttthhhh. 1/14 What is prob of picking 3 j when three letters picked without replacement from jjjjjjkjkjjj? 6/11 Calculate prob of picking 3 p when three letters picked without replacement from pppmnmmummbpumpm. 1/56 Four letters picked without replacement from {o: 6, m: 9, s: 2}. Give prob of picking 2 m and 2 o. 27/119 What is prob of picking 1 u and 1 i when two letters picked without replacement from iiuvivi? 4/21 What is prob of picking 2 y and 2 i when four letters picked without replacement from {y: 14, i: 5}? 455/1938 Four letters picked without replacement from {r: 4, y: 4, f: 3}. Give prob of picking 3 y and 1 r. 8/165 Calculate prob of picking 2 t and 2 u when four letters picked without replacement from {u: 3, t: 12}. 66/455 What is prob of picking 2 x when two letters picked without replacement from {x: 2, v: 3, c: 4}? 1/36 Calculate prob of picking 2 d when two letters picked without replacement from {d: 2, s: 8}. 1/45 Four letters picked without replacement from {m: 4, p: 6, n: 1, w: 4}. What is prob of picking 1 p, 1 n, 1 m, and 1 w? 32/455 Two letters picked without replacement from madrw. What is prob of picking 1 m and 1 a? 1/10 Calculate prob of picking 1 x and 1 d when two letters picked without replacement from {c: 1, i: 1, l: 2, d: 2, n: 1, x: 2}. 1/9 What is prob of picking 1 b and 3 m when four letters picked without replacement from {m: 5, b: 12, y: 2}? 10/323 Two letters picked without replacement from {y: 10}. Give prob of picking 2 y. 1 Calculate prob of picking 1 a and 1 c when two letters picked without replacement from sjsyjsbcacjysa. 4/91 Four letters picked without replacement from ffoffofffqfsoqfsfqso. What is prob of picking 1 o and 3 s? 4/4845 Two letters picked without replacement from {l: 8, c: 4, v: 8}. Give prob of picking 2 l. 14/95 Three let	{ "pile_set_name": "DM Mathematics" }
Unless the life chances of children raised by single mothers suddenly improve, the explosive growth of the U.S. Hispanic population over the next couple of decades does not bode well for American social stability. Hispanic immigrants bring near–Third World levels of fertility to America, coupled with what were once thought to be First World levels of illegitimacy. (In fact, family breakdown is higher in many Hispanic countries than here.) Nearly half of the children born to Hispanic mothers in the U.S. are born out of wedlock, a proportion that has been increasing rapidly with no signs of slowing down. Given what psychologists and sociologists now know about the much higher likelihood of social pathology among those who grow up in single-mother households, the Hispanic baby boom is certain to produce more juvenile delinquents, more school failure, more welfare use, and more teen pregnancy in the future. The government social-services sector has already latched onto this new client base; as the Hispanic population expands, so will the demands for a larger welfare state. Since conservative open-borders advocates have yet to acknowledge the facts of Hispanic family breakdown, there is no way to know what their solution to it is. But they had better come up with one quickly, because the problem is here—and growing. The dimensions of the Hispanic baby boom are startling. The Hispanic birthrate is twice as high as that of the rest of the American population. That high fertility rate—even more than unbounded levels of immigration—will fuel the rapid Hispanic population boom in the coming decades. By 2050, the Latino population will have tripled, the Census Bureau projects. One in four Americans will be Hispanic by mid-century, twice the current ratio. In states such as California and Texas, Hispanics will be in the clear majority. Nationally, whites will drop from near 70 percent of the total population in 2000 to just half by 2050. Hispanics will account for 46 percent of the nation’s added population over the next two decades, the Pew Hispanic Center reports. But it’s the fertility surge among unwed Hispanics that should worry policymakers. Hispanic women have the highest unmarried birthrate in the country—over three times that of whites and Asians, and nearly one and a half times that of black women, according to the Centers for Disease Control. Every 1,000 unmarried Hispanic women bore 92 children in 2003 (the latest year for which data exist), compared with 28 children for every 1,000 unmarried white women, 22 for every 1,000 unmarried Asian women, and 66 for every 1,000 unmarried black women. Forty-five percent of all Hispanic births occur outside of marriage, compared with 24 percent of white births and 15 percent of Asian births. Only the percentage of black out-of-wedlock births—68 percent—exceeds the Hispanic rate. But the black population is not going to triple over the next few decades. As if the unmarried Hispanic birthrate weren’t worrisome enough, it is increasing faster than among other groups. It jumped 5 percent from 2002 to 2003, whereas the rate for other unmarried women remained flat. Couple the high and increasing illegitimacy rate of Hispanics with their higher overall fertility rate, and you have a recipe for unstoppable family breakdown. The only bright news in this demographic disaster story concerns teen births. Overall teen childbearing in the U.S. declined for the 12th year in a row in 2003, having dropped by more than a third since 1991. Yet even here, Hispanics remain a cause for concern. The rate of childbirth for Mexican teenagers, who come from by far the largest and fastest-growing immigrant population, greatly outstrips every other group. The Mexican teen birthrate is 93 births per every 1,000 girls, compared with 27 births for every 1,000 white girls, 17 births for every 1,000 Asian girls, and 65 births for every 1,000 black girls. To put these numbers into international perspective, Japan’s teen birthrate is 3.9, Italy’s is 6.9, and France’s is 10. Even though the outsize U.S. teen birthrate is dropping, it continues to inflict unnecessary costs on the country, to which Hispanics contribute disproportionately. To grasp the reality behind those numbers, one need only talk to people working on the front lines of family breakdown. Social workers in Southern California, the national epicenter for illegal Hispanic immigrants and their progeny, are in despair over the epidemic of single parenting. Not only has illegitimacy become perfectly acceptable, they say, but so has the resort to welfare and social services to cope with it. Dr. Ana Sanchez delivers babies at St. Joseph’s Hospital in the city of Orange, California, many of them to Hispanic teenagers. To her dismay, they view having a child at their age as normal. A recent patient just had her second baby at age 17; the baby’s father is in jail. But what is “most alarming,” Sanchez says, is that the “teens’ parents view having babies outside of marriage as normal, too. A lot of the grandmothers are single as well; they never married, or they had successive partners. So the mom sends the message to her daughter that it’s okay to have children out of wedlock.” Sanchez feels almost personally involved in the problem: “I’m Hispanic myself. I wish I could find out what the Asians are doing right.” She guesses that Asian parents’ passion for education inoculates their children against teen pregnancy and the underclass trap. “Hispanics are not picking that up like the Asian kids,” she sighs. Conservatives who support open borders are fond of invoking “Hispanic family values” as a benefit of unlimited Hispanic immigration. Marriage is clearly no longer one of those family values. But other kinds of traditional Hispanic values have survived—not all of them necessarily ideal in a modern economy, however. One of them is the importance of having children early and often. “It’s considered almost a badge of honor for a young girl to have a baby,” says Peggy Schulze of Chrysalis House, an adoption agency in Fresno. (Fresno has one of the highest teen pregnancy rates in California, typical of the state’s heavily Hispanic farm districts.) It is almost impossible to persuade young single Hispanic mothers to give up their children for adoption, Schulze says. “The attitude is: ‘How could you give away your baby?’ I don’t know how to break through.” The most powerful Hispanic family value—the tight-knit extended family—facilitates unwed child rearing. A single mother’s relatives often step in to make up for the absence of the baby’s father. I asked Mona, a 19-year-old parishioner at St. Joseph’s Church in Santa Ana, California, if she knew any single mothers. She laughed: “There are so many I can’t even name them.” Two of her cousins, aged 25 and 19, have children without having husbands. The situation didn’t seem to trouble this churchgoer too much. “They’ll be strong enough to raise them. It’s totally okay with us,” she said. “We’re very close; we’re there to support them. They’ll do just fine.” As Mona’s family suggests, out-of-wedlock child rearing among Hispanics is by no means confined to the underclass. The St. Joseph’s parishioners are precisely the churchgoing, blue-collar workers whom open-borders conservatives celebrate. Yet this community is as susceptible as any other to illegitimacy. Fifty-year-old Irma and her husband, Rafael, came legally from Mexico in the early 1970s. Rafael works in a meatpacking plant in Brea; they have raised five husky boys who attend church with them. Yet Irma’s sister—a homemaker like herself, also married to a factory hand—is now the grandmother of two illegitimate children, one by each daughter. “I saw nothing in the way my sister and her husband raised her children to explain it,” Irma says. “She gave them everything.” One of the fathers of Irma’s young nieces has four other children by a variety of different mothers. His construction wages are being garnished for child support, but he is otherwise not involved in raising his children. The fathers of these illegitimate children are often problematic in even more troubling ways. Social workers report that the impregnators of younger Hispanic women are with some regularity their uncles, not necessarily seen as a bad thing by the mother’s family. Alternatively, the father may be the boyfriend of the girl’s mother, who then continues to stay with the grandmother. Older men seek out young girls in the belief that a virgin cannot get pregnant during her first intercourse, and to avoid sexually transmitted diseases. The tradition of starting families young and expand- ing them quickly can come into conflict with more modern American mores. Ron Storm, the director of the Hillview Acres foster-care home in Chino, tells of a 15-year-old girl who was taken away from the 21-year-old father of her child by a local child-welfare department. The boyfriend went to jail, charged with rape. But the girl’s parents complained about the agency’s interference, and eventually both the girl and her boyfriend ended up going back to Mexico, presumably to have more children. “At 15, as the Quinceañera tradition celebrates, you’re considered ready for marriage,” says Storm. Or at least for childbearing; the marriage part is disappearing. But though older men continue to take advantage of younger women, the age gap between the mother and the father of an illegitimate child is quickly closing. Planned Parenthood of Orange and San Bernardino Counties tries to teach young fathers to take responsibility for their children. “We’re seeing a lot more 13- and 14-year-old fathers,” says Kathleen Collins, v.p. of health education. The day before we spoke, Scott Montoya, an Orange County sheriff’s deputy, arrested two 14-year-old boys who were bragging about having sexual relations with a cafeteria worker from an Olive Garden restaurant. “It’s now all about getting girls pregnant when you’re age 15,” he says. One 18-year-old in the Planned Parenthood fathers’ program has two children by two different girls and is having sex with five others, says health worker Jason Warner. “A lot of [the adolescent sexual behavior] has to do with getting respect from one’s peers,” observes Warner. Normally, the fathers, of whatever age, take off. “The father may already be married or in prison or doing drugs,” says Amanda Gan, director of operations for Toby’s House, a maternity home in Dana Point, California. Mona, the 19-year-old parishioner at St. Joseph’s Church, says that the boys who impregnated her two cousins are “nowhere to be found.” Her family knows them but doesn’t know if they are working or in jail. Two teen mothers at the Hillview Acres home represent the outer edge of Hispanic family dysfunction. Yet many aspects of their lives are typical. Though these teenagers’ own mothers were unusually callous and irresponsible, the social milieu in which they were raised is not unusual. Irene’s round, full face makes her look younger than her 14 years, certainly too young to be a mother. But her own mother’s boyfriend repeatedly forced sex on her, with the mother’s acquiescence. The result was Irene’s baby, Luz. Baby Luz has an uncle her own age, Irene’s new 13-month-old brother. Like Irene, Irene’s mother had her first child at 14, and produced five more over the next 16 years, all of whom went into foster care. Irene’s father committed suicide before she was old enough to know him. The four fathers of her siblings are out of the picture, too: one of them, the father of her seven-year-old brother and five-year-old sister, was deported back to Mexico after he showed up drunk for a visit with his children, in violation of his probation conditions. Irene is serene and articulate—remarkably so, considering that in her peripatetic early life in Orange County she went to school maybe twice a week. She likes to sing and to read books that are sad, she says, especially books by Dave Pelzer, a child-abuse victim who has published three best-selling memoirs about his childhood trauma. She says she will never get married: “I don’t want another man in my life. I don’t want that experience again.” Eighteen-year-old Jessica at least escaped rape, but her family experiences were bad enough. The large-limbed young woman, whose long hair is pulled back tightly from her heart-shaped face, grew up in the predominantly Hispanic farming community of Indio in the Coachella Valley. She started “partying hard” in fifth grade, she says—at around the same time that her mother, separated from her father, began using drugs and going clubbing. By the eighth grade, Jessica and her mother were drinking and smoking marijuana together. Jessica’s family had known her boyfriend’s family since she was four; when she had her first child by him—she was 14 and he was 21—her mother declared philosophically that she had always known that it would happen. “It was okay with her, so long as he continued to give her drugs.” Jessica originally got pregnant to try to clean up her life, she says. “I knew what I was doing was not okay, so having a baby was a way for me to stop doing what I was doing. In that sense, the baby was planned.” She has not used drugs since her first pregnancy, though she occasionally drinks. After her daughter was born, she went to live with her boyfriend in a filthy trailer without plumbing; they scrounged food from dumpsters, despite the income from his illegal drug business. They planned to get married, but by the time she got pregnant again with a son, “We were having a lot of problems. We’d be holding hands, and he’d be looking at other girls. I didn’t want him to touch me.” Eventually, the county welfare agency removed her and put her in foster care with her two children. Both Jessica and her caddish former boyfriend illustrate the evanescence of the celebrated Hispanic “family values.” Her boyfriend’s family could not be more traditional. Two years ago, Jessica went back to Mexico to celebrate her boyfriend’s parents’ 25th wedding anniversary and the renewal of their wedding vows. Jessica’s own mother got married at 15 to her father, who was ten years her senior. Her father would not let his wife work; she was a “stay-at-home wife,” Jessica says. But don’t blame the move to the U.S. for the behavior of younger generations; the family crack-up is happening even faster in Latin America. Jessica’s mother may have been particularly negligent, but Jessica’s experiences are not so radically different from those of her peers. “Everybody’s having babies now,” she says. “The Coachella Valley is filled with girls’ pregnancies. Some girls live with their babies’ dads; they consider them their husbands.” These cohabiting relationships rarely last, however, and a new cohort of fatherless children goes out into the world. Despite the strong family support, the prevalence of single parenting among Hispanics is producing the inevitable slide into the welfare system. “The girls aren’t marrying the guys, so they are married to the state,” Dr. Sanchez observes. Hispanics now dominate the federal Women, Infants, and Children free food program; Hispanic enrollment grew over 25 percent from 1996 to 2002, while black enrollment dropped 12 percent and white enrollment dropped 6.5 percent. Illegal immigrants can get WIC and other welfare programs for their American-born children. If Congress follows President Bush’s urging and grants amnesty to most of the 11 million illegal aliens in the country today, expect the welfare rolls to skyrocket as the parents themselves become eligible. Amy Braun works for Mary’s Shelter, a home for young single mothers who are homeless or in crisis, in Orange County, California. It has become “culturally okay” for the Hispanic population to use the shelter and welfare system, Braun says. A case manager at a program for pregnant homeless women in the city of Orange observes the same acculturation to the social-services sector, with its grievance mongering and sense of victimhood. “I’ll have women in my office on their fifth child, when the others have already been placed in foster care,” says Anita Berry of Casa Teresa. “There’s nothing shameful about having multiple children that you can’t care for, and to be pregnant again, because then you can blame the system.” The consequences of family breakdown are now being passed down from one generation to the next, in an echo of the black underclass. “The problems are deeper and wider,” says Berry. “Now you’re getting the second generation of foster care and group home residents. The dysfunction is multigenerational.” The social-services complex has responded with barely concealed enthusiasm to this new flood of clients. As Hispanic social problems increase, so will the government sector that ministers to them. In July, a New York Times editorial, titled young latinas and a cry for help, pointed out the elevated high school dropout rates and birthrates among Hispanic girls. A quarter of all Latinas are mothers by the age of 20, reported the Times. With the usual melodrama that accompanies the pitch for more government services, the Times designated young Latinas as “endangered” in the same breath that it disclosed that they are one of the fastest-growing segments of the population. “The time to help is now,” said the Times—by which it means ratcheting up the taxpayer-subsidized social-work industry. In response to the editorial, Carmen Barroso, regional director of International Planned Parenthood Federation/Western Hemisphere Region, proclaimed in a letter to the editor the “urgent need for health care providers, educators and advocates to join the sexual and reproductive health movement to ensure the fundamental right to services for young Latinas.” Wherever these “fundamental rights” might come from, Barroso’s call nevertheless seems quite superfluous, since there is no shortage of taxpayer-funded “services” for troubled Latinas—or Latinos. The schools in California’s San Joaquin Valley have day care for their students’ babies, reports Peggy Schulze of Chrysalis House. “The girls get whatever they need—welfare, medical care.” Advocates for young unwed moms in New York’s South Bronx are likewise agitating for more day-care centers in high schools there, reports El Diario/La Prensa. A bill now in Congress, the Latina Adolescent Suicide Prevention Act, aims to channel $10 million to “culturally competent” social agencies to improve the self-esteem of Latina girls and to provide “support services” to their families and friends if they contemplate suicide. The trendy “case management” concept, in which individual “cases” become the focal point around which a solar system of social workers revolves, has even reached heavily Hispanic elementary and middle schools. “We have a coordinator, who brings in a collaboration of agencies to deal with the issues that don’t allow a student to meet his academic goals, such as domestic violence or drugs,” explains Sylvia Rentria, director of the Family Resource Center at Berendo Middle School in Los Angeles. “We can provide individual therapy.” Rentria offers the same program at nearby Hoover Elementary School for up to 100 students. This July, Rentria launched a new session of Berendo’s Violence Intervention Program for parents of children who are showing signs of gang involvement and other antisocial behavior. Ghady M., 55 and a “madre soltera” (single mother), like most of the mothers in the program, has been called in because her 16-year-old son, Christian, has been throwing gang signs at school, cutting half his classes, and ending up in the counseling office every day. The illegal Guatemalan is separated from her partner, who was “muy malo,” she says; he was probably responsible for her many missing teeth. (The detectives in the heavily Hispanic Rampart Division of the Los Angeles Police Department, which includes the Berendo school, spend inordinate amounts of time on domestic violence cases.) Though Ghady used to work in a factory on Broadway in downtown L.A.— often referred to as Little Mexico City—she now collects $580 in welfare payments and $270 in food stamps for her two American-born children. Christian is a husky smart aleck in a big white T-shirt; his fashionably pomaded hair stands straight up. He goes to school but doesn’t do homework, he grins; and though he is not in a gang, he says, he has friends who are. Keeping Ghady and Christian company at the Violence Intervention Program is Ghady’s grandniece, Carrie, a lively ten-year-old. Carrie lives with her 26-year-old mother but does not know her father, who also sired her 12-year-old brother. Her five-year-old brother has a different father. Yet for all these markers of social dysfunction, fatherless Hispanic families differ from the black underclass in one significant area: many of the mothers and the absent fathers work, even despite growing welfare use. The former boyfriend of Jessica, the 18-year-old mother at the Hillview Acres foster home, works in construction and moonlights on insulation jobs; whether he still deals drugs is unknown. Jessica is postponing joining her father in Texas until she finishes high school, because once she moves in with him, she will feel obligated to get a job to help the family finances. The mother of Hillview’s 14-year-old Irene used to fix soda machines in Anaheim, California, though she got fired because she was lazy, Irene says. Now, under court compulsion, she works in a Lunchables factory in Santa Ana, a condition of getting her children back from foster care. The 18-year-old Lothario and father of two, whom Planned Parenthood’s Jason Warner is trying to counsel, works at a pet store. The mother of Carrie, the vivacious ten-year-old sitting in on Berendo Middle School’s Violence Intervention Program, makes pizza at a Papa John’s pizza outlet. How these two value systems—a lingering work ethic and underclass mating norms—will interact in the future is anyone’s guess. Orange County sheriff’s deputy Montoya says that the older Hispanic generation’s work ethic is fast disappearing among the gangbanging youngsters whom he sees. “Now, it’s all about fast money, drugs, and sex.” It may be that the willingness to work will plummet along with marriage rates, leading to even greater social problems than are now rife among Hispanics. Or it may be that the two contrasting practices will remain on parallel tracks, creating a new kind of underclass: a culture that tolerates free-floating men who impregnate women and leave, like the vast majority of black men, yet who still labor in the noncriminal economy. The question is whether, if the disposition to work remains relatively strong, a working parent will inoculate his or her illegitimate children against the worst degradations that plague black ghettos. From an intellectual standpoint, this is a fascinating social experiment, one that academicians are—predictably—not attuned to. But the consequences will be more than intellectual: they may severely strain the social fabric. Nevertheless, it is an experiment that we seem destined to see to its end. Tisha Roberts, a supervisor at an Orange County, California, institution that assists children in foster care, has given up hope that the illegitimacy rate will taper off. “It’s going to continue to grow,” she says, “until we can put birth control in the water.”	{ "pile_set_name": "OpenWebText2" }
Q: html hyperlink download file issue I use absolute path <a href='N:\myName\test.xlsx'>download</a>to download file from file folder. However, when I click it, the file is open directly instead of downloading it. If I use relative path <a href='js/template/test.xlsx'>download</a>, the file is downloaded before opening it. My question is that how I can download the file instead of directly opening it using absolute path like <a href='N:\myName\test.xlsx'>download</a> Thanks, Peter A: That absolute path is stored on your computer, which means it's a link to that file. You can't download something that's stored on your computer - it has to be stored on the web to download.	{ "pile_set_name": "StackExchange" }
5? 0.4 Which is the closest to -2/3? (a) 10723 (b) -3 (c) -21 b Which is the closest to -1/2? (a) -69 (b) 0.5 (c) 70 b Which is the closest to -1? (a) 5 (b) -432/11 (c) 4 (d) -3 (e) -5 d What is the nearest to -1/3 in 104, -2, -111, 6? -2 What is the nearest to -1 in -60, 0.6, 2/17, 0.3? 2/17 Which is the closest to 0.15? (a) 13 (b) -1/3 (c) -0.3 (d) 0.2 d Which is the closest to -3/19? (a) -7 (b) 2.95 (c) 4/5 c Which is the nearest to -2/1349? (a) -0.5 (b) 4 (c) 25 (d) -1/9 (e) -0.03 e What is the nearest to 20 in -1/4, 1/21, 0.5, -2? 0.5 Which is the nearest to -2? (a) 4 (b) 0.07 (c) 13/212 c What is the closest to -4/9 in 0.5, 2/4353, -0.1? -0.1 Which is the closest to -11? (a) -2/11 (b) -1/9 (c) -3.1 c What is the closest to -2.2 in 167, -9, -0.5, 1? -0.5 What is the closest to -1.07 in 2/21, 1/2, -5/2, -3? 2/21 Which is the nearest to -13? (a) -0.3 (b) -1/13 (c) 0.2 (d) -1/4 a What is the closest to -0.1 in -4788, 0, 1, 0.3? 0 Which is the nearest to -6/47? (a) 3 (b) -0.2 (c) -450 (d) -0.5 b Which is the closest to 4/3? (a) 2/9 (b) -5 (c) -15 (d) 0 a Which is the nearest to 0.1? (a) 5 (b) 1/2 (c) -90 (d) 3 (e) 1 b What is the closest to -1 in 0.5, -3.9572, 22? 0.5 Which is the nearest to -2? (a) 0.4 (b) -5 (c) 2010 (d) -1/9 d Which is the closest to -4? (a) 1.3 (b) -49 (c) 4.8 a Which is the closest to 1? (a) -1/7 (b) -2/3 (c) -21781 (d) -2/5 (e) 3 a Which is the closest to 0? (a) 15 (b) 51/4 (c) 1 (d) 0.5 d Which is the nearest to 0.2? (a) -0.3 (b) 1 (c) -2 (d) 3 (e) -35/11 a Which is the closest to -1? (a) 1/5 (b) -0.2 (c) -1 (d) 0.1 c Which is the nearest to 1? (a) 4 (b) -1/5 (c) 1/6 (d) -43 c What is the closest to -0.51 in -1, -0.1, -4, -6? -0.1 What is the closest to -0.1 in 2, -1/8, 4/5, 34? -1/8 Which is the closest to -1/4? (a) 3/4 (b) 1/5 (c) -0.1 (d) 4 (e) -0.052 c What is the nearest to 3 in 8/9, 18.8, 5, 2/7? 5 What is the closest to 0 in 0.02, 1/5, 202/7, -2? 0.02 What is the nearest to 7/4 in 0.07, -1/8, -6? 0.07 What is the nearest to 5 in -418, -2/7, 1/4? 1/4 Which is the closest to 0.1? (a) -0.4 (b) 0.3 (c) -365 (d) -47 (e) 2/7 e Which is the closest to 12? (a) 53/12 (b) 0.3 (c) 1 (d) 5 (e) -0.4 d What is the closest to 1/10 in 368, 2, 0.5? 0.5 Which is the closest to 3.9? (a) 5 (b) 0 (c) 0.2 (d) 2 (e) -6 a Which is the closest to 1124/7? (a) -2 (b) -1/7 (c) -3 b Which is the nearest to 1? (a) -1.4 (b) -2/895 (c) -1.6 b What is the closest to 0.1 in -1/603, -4, -5.3? -1/603 What is the closest to 0 in 0, 19/165, 0.11? 0 What is the closest to 0.1 in 2, 54, -2.9, -2/13? -2/13 Which is the closest to -23/2? (a) -5 (b) 0 (c) -2/21 a Which is the closest to 211/3? (a) 10 (b) 5 (c) -2 a What is the nearest to -1 in -1/8, 107, 35? -1/8 Which is the nearest to -14.8? (a) -2 (b) -29 (c) -3/8 (d) 0.3 a What is the closest to -2 in 0.1, 4/3, 7, 220? 0.1 Which is the closest to 2? (a) -5 (b) -2/3 (c) 0 (d) 2/15 d Which is the nearest to -0.08? (a) -1.18 (b) -5 (c) 0 (d) -0.06 d Which is the nearest to -53? (a) 2 (b) -0.4 (c) 5 (d) -19/2 (e) -55 e Which is the nearest to 2? (a) -1/9 (b) 1/6 (c) -1/3094 b What is the nearest to -0.1 in 0.11, 0.3, 8/31? 0.11 What is the nearest to 1/7 in -5, 3, -3/8, -63, 1.28? -3/8 Which is the closest to 0.1? (a) 4 (b) 2 (c) 1001 b What is the closest to 14 in -4, 0, -69, -2? 0 What is the nearest to 2/9 in -15, 2, -1.5, 0.3, 27/5? 0.3 Which is the closest to 2? (a) -2/13 (b) 2 (c) 83 (d) 6 b Which is the closest to -2? (a) -2 (b) -0.2 (c) 38801 a What is the closest to 1/2 in -1/157, -1, -0.05? -1/157 What is the nearest to 56/61 in 0.6, -3, 0.3? 0.6 Which is the nearest to -2? (a) -4 (b) -48.1 (c) -1/4 c What is the nearest to -0.11 in -27, -2/9, 1? -2/9 What is the closest to 0.19 in 9, -2, -5, -0.7? -0.7 Which is the closest to 3? (a) -0.58 (b) -0.1 (c) -0.351 (d) 2 (e) -4 d What is the closest to -13.3 in 2, -128, -1/9, 0.2, -2/5? -2/5 Which is the closest to 3/49? (a) 36 (b) -15 (c) 1 c Which is the closest to 2? (a) -128 (b) 1/9 (c) -13 b What is the nearest to 10.26 in -2/3, -5, -0.4, 0.5, 3? 3 Which is the closest to 2/7? (a) -1/4 (b) -0.827 (c) -2/77 (d) -3 c What is the closest to 0.1 in -1, 0.5, 2, 3/191? 3/191 What is the nearest to -0.3 in 0.2, -3, -1, -2947? 0.2 What is the closest to 9 in -2/5, 55, -2/3? -2/5 Which is the closest to -6? (a) 3/14 (b) 2/1539 (c) 4 b Which is the nearest to 3? (a) 0.5 (b) -0.3 (c) 18 (d) -3/7 a What is the closest to -1 in -6, 5/3, 1, -4, -1? -1 What is the closest to -0.13 in 11, -8, -7/6? -7/6 Which is the nearest to 779.2? (a) 0.1 (b) -5 (c) -0.8 a Which is the closest to -1? (a) -1/5 (b) -2 (c) -4/5 (d) 101/2 c What is the nearest to -9 in -1/3, 3, -0.18, -0.1? -1/3 Which is the nearest to -0.2? (a) 2 (b) 0.143 (c) 5 (d) 2/7 b Which is the nearest to 2/5? (a) 368 (b) 6 (c) 14 b Which is the closest to -0.071? (a) -6 (b) 7 (c) -0.5 (d) 1/7 d Which is the nearest to 58/3? (a) 3/5 (b) -2/5 (c) 0 (d) 3/4 d Which is the nearest to -392? (a) 5 (b) -0.4 (c) 0.4 b Which is the closest to 2? (a) -18 (b) -16 (c) -0.5 (d) -4 c What is the closest to -2 in 384/5, 5, 1/3, 0.2, -0.03? -0.03 What is the closest to -1/6 in 55, 0.2, 13? 0.2 What is the nearest to -0.2 in -168, 82, 0.1? 0.1 What is the closest to 10 in -18, -45, -0.1, 4? 4 What is the closest to -2 in 5, 0.28, -0.4, 0.5, -21? -0.4 Which is the nearest to 2/7? (a) -2 (b) 0.5 (c) -0.59 (d) -16/3 (e) -0.3 b What is the nearest to 1/4 in -2/1179, 0.17, 0.11? 0.17 Which is the closest to -27/7? (a) 3/5 (b) -458 (c) -0.4 c Which is the nearest to 1/3? (a) -0.3 (b) -52 (c) -581/4 a Which is the nearest to -0.2? (a) 0 (b) -2/7 (c) -603 (d) -0.084 (e) 0.5 b Which is the nearest to -22? (a) -0.2 (b) -0.201 (c) -2 c Which is the nearest to 1? (a) 2/9 (b) -5 (c) -8 (d) 88/15 (e) -4 a Which is the closest to -0.2? (a) 32.47 (b) 0.1 (c) 5 (d) 6 (e) -5 b Which is the closest to 0? (a) 4 (b) -1/4 (c) 1 (d) 35 (e) -0.08 e Which is the closest to -3? (a) -33 (b) 0.5 (c) 0.2 (d) -5 (e) 3 d Which is the nearest to -2/9? (a) -0.17 (b) 0.8 (c) -3 (d) 7 (e) -4 a What is the nearest to 1 in 1097, -0.4, 11, 5? -0.4 Which is the closest to -1.2? (a) 0.3 (b) -1 (c) 4/5 (d) -1/75 b Which is the closest to 4? (a) -3 (b) -5 (c) -0.1 c What is the closest to 1/3 in 2/3, -56, -1/5, 2? 2/3 What is the closest to -2 in -1, 0.17, 0, -2/13, -2.1? -2.1 What is the closest to -5/4 in 3, -0.4, 4? -0.4 What is the closest to 2 in -3, -61.94, 0? 0 What is the closest to 2/2147 in 2/5, 0, -5? 0 What is the nearest to -7/54 in -0.1, -6/5, 5, -1/3? -0.1 What is the closest to 1 in 22, 1/5, -4, -429? 1/5 What is the nearest to 3 in 26, -1/2, -2/437? -2/437 What is the nearest to 3 in -609, 1.2, 2? 2 Which is the nearest to -1/3? (a) -2 (b) 5495 (c) 5 (d) -3/2 d Which is the closest to -2? (a) 5 (b) -13/3 (c) -0.1 (d) -1/4 (e) -15 d Which is the closest to 2/9? (a) -0.5 (b) -3.1 (c) -3 (d) 2/21 d Which is the closest to 2? (a) -25 (b) -117 (c) -0.2 c Which is the closest to 441? (a) 0.09 (b) 0 (c) 2/23 (d) -2/3 a What is the nearest to 2/7 in 4, -1/2, 5, -0.7? -1/2 Which is the closest to 80/13? (a) 0.08 (b) 3 (c) 1/6 b What is the nearest to -0.15 in 0, -264, -2, 3/7? 0 Which is the closest to 2? (a) -44/7 (b) 121 (c) -2/9 c Which is the closest to 1/6? (a) 12 (b) 0.03 (c) -3/7 (d) 1.99 (e) 3 b What is the closest to 0.094 in 0, 4, 0.94? 0 Which is the closest to 2/7? (a) 5 (b) -159665 (c) 0.4 c What is the nearest to 1 in -17289, 0.4, 4, 5? 0.4 Which is the nearest to 0? (a) -0.012 (b) 1/2 (c) 0.3 (d) -25/3 (e) -1/5 a What is the nearest to 4 in 34/25, 0.4, 10? 34/25 Which is the closest to -0.3? (a) -3/5 (b) 5 (c) -0.161 (d) -1 (e) 3/7 c Which is the closest to -2? (a) -28 (b) -3/4 (c) 0.4 (d) -3/7 b What is the closest to 15 in -30, 0.6, -100, -3? 0.6 Which is the closest to -0.2? (a) 0.2404 (b) 1/4 (c) -0.2 c Which is the closest to 3? (a) -35 (b) 3 (c) -2/19 (d) 0.9 b What is the nearest to 2/5 in 0.2, 3, -0.4, -12, -38? 0.2 What is the close	{ "pile_set_name": "DM Mathematics" }
const EMAIL_PATTERN = /^[A-Za-z0-9\u4e00-\u9fa5]+@[a-zA-Z0-9_-]+(\.[a-zA-Z0-9_-]+)+$/ const ID_CARD_PATTERN = /^(^[1-9]\d{7}((0\d)\|(1[0-2]))(([0\|1\|2]\d)\|3[0-1])\d{3}$)\|(^[1-9]\d{5}[1-9]\d{3}((0\d)\|(1[0-2]))(([0\|1\|2]\d)\|3[0-1])((\d{4})\|\d{3}[Xx])$)$/ function doubleCheck (rule, value, callback) { if (!rule.hasOwnProperty('target')) { return callback(new Error('请填写 target')) } if (rule.target !== value) { return callback(new Error()) } callback() } function checkPhone (rule, value, cb) { if (!value) { return cb(new Error('未填写手机号码')) } else if (!(/^1(3\|4\|5\|7\|8)\d{9}$/.test(value))) { return cb(new Error('嗨，这不是手机号码')) } else { cb() } } function checkEmail (rule, value, cb) { if (!value) { return cb(new Error('未填写邮箱')) } else if (!(EMAIL_PATTERN.test(value))) { return cb(new Error('嗨，这不是邮箱')) } else { cb() } } function checkIdCardNumber (rule, value, cb) { if (!value) { return cb(new Error('未填写身份证号码')) } else if (!(ID_CARD_PATTERN.test(value))) { return cb(new Error('嗨，身份证号码格式不正确')) } else { if (value.length === 18) { let idCardWi = [7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2] // 将前17位加权因子保存在数组里 let idCardY = [1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2] // 这是除以11后，可能产生的11位余数、验证码，也保存成数组 let idCardWiSum = 0 // 用来保存前17位各自乖以加权因子后的总和 for (let i = 0; i < 17; i++) { idCardWiSum += parseInt(value.substring(i, i + 1)) * idCardWi[i] } let idCardMod = idCardWiSum % 11 // 计算出校验码所在数组的位置 let idCardLast = value.substring(17) // 得到最后一位身份证号码 // 如果等于2，则说明校验码是10，身份证号码最后一位应该是X // 用计算出的验证码与最后一位身份证号码匹配，如果一致，说明通过，否则是无效的身份证号码 if ((idCardMod === 2 && idCardLast.toLowerCase() !== 'x') \|\| (idCardMod !== 2 && parseInt(idCardLast) !== idCardY[idCardMod])) { return cb(new Error('嗨，身份证号码错误')) } } else { return cb(new Error('嗨，身份证号码错误')) } cb() } } export default { install (Vue) { Vue.validator = Vue.prototype.$validator = { doubleCheck, checkPhone, checkEmail, checkIdCardNumber } } }	{ "pile_set_name": "Github" }
to glorify and praise God together as a group A Muslim leader said the gathering allowed for A street outside Lakemba Mosque was closed for hours to Tens of thousands of Muslims have gathered at Lakemba Mosque in Sydney to honour a man's willingness to sacrifice his only son in God's name. Muslim residents caused road closures outside Lakemba Mosque, in Sydney's south-west, as they participated in the Eid Al Adha prayer, which marks the end of the annual pilgrimage or Hajj to the Saudi holy city of Mecca. Between 20,000 and 30,000 men and women were pictured standing stoically on prayer mats laid across Wangee Road, which was closed between 5am and 9am, with sounds of prayers echoing through the streets as an Imam lead the service from inside the mosque. Scroll down for video Thousands of devoted Muslims have gathered in the streets of Western Sydney to honour a man's willingness to sacrifice his only son in God's name Muslim residents caused road closures outside Lakemba mosque as they participated in the Eid Al Adha prayer, which marks the end of the annual pilgrimage to the holy city of Mecca A police spokespersons said the single road was closed for around four hours, with extra police deployed to direct traffic around Punchbowl Road during the service. Men and women mingled outside the mosque before and after prayer time, however they were segregated as they offered their Eid Al Adha prayer. Muslim community spokesperson Keysar Trad, who led prayers in Zetland, south of Sydney's CBD, said the celebrations were one of the biggest events in the Islamic calendar and marked the breaking of a nine day fast. 'The Eid Al Adha prayer has an additional prayer and a sermon - the rest of the time you are supposed to glorify and praise God together,' he told Daily Mail Australia. Men and women mingled outside the mosque before and after prayer time, however they were segregated as they offered their Eid Al Adha prayer Some gathered in a nearby rugby ground (pictured) to offer their Eid Al Adha prayer The men stood in neat rows and bowed their heads as an Imam lead the sermon They knelt on prayer mats during the service which is one of the biggest in the Islamic calendar 'Many people would have been fasting for the last nine days between the break of dawn and sunset,' he added. He said his sermon touched on examples about the prophet Ibrahim who was willing to sacrifice his only son at God's request. The celebration is observed internationally, with pictures of Filipino Muslims at Luneta Park in Manila emerging that show women offering their prayers to commemorate Ibrahim's faith. The women were seen in head scarves bowing on prayer mats behind a barbed wire fence outside the Blue Mosque, some with young children laying or praying beside them. Animals were slaughtered and split into three parts during the 'Feast of the Sacrifice', with worshippers honouring tradition by offering one portion to their family, one to friends and another for the poor or needy. The celebration, also known as the 'Feast of the Sacrifice', is observed internationally (Pictured: Women in Manila) Thousands gathered at the Blue Mosque in Taguig city, east of Manila, in the Philippines, on Monday morning A young child suckles on a bottle of milk as his mother kneels beside worshippers at Eid al-Adha in the Philippines The women were seen in head scarves bowing on prayer mats behind a barbed wire fence, some with young children laying or praying beside them Many children were seen participating in the service which makes the holies of the two Muslim annual holidays A woman uses her smart phone to take a 'selfie' after attending the morning prayers near Manila A Muslim spokesperson said his sermon touched on examples about the prophet Abraham who was willing to sacrifice his only son at God's request The service was projected on to a large screen so the Imam's instructions were visible to worshippers outside the mosque Mr Trad said between 20 and 30 thousand worshippers travelled to Lakemba Mosque (pictured) for the event Volunteers offered to help clean the space on Sunday before the sacred prayers took place The sun shone down on worshippers who gathered early Monday morning Police stand watch as thousands of Chinese worshippers line the streets in preparation for the Eid Al-Adha prayer A woman in Shanghai with a lace veil over her head holds her phone to her ear before the sacred annual prayer commences Chinese Muslims sit in neat rows as a police dog circles worshippers on a street outside a mosque in Shanghai Three Indonesian Muslims use their prayer mats to shelter from the rain as they arrive for morning prayers to mark Eid al-Adha on the sand-dunes of Parangkusumo beach, in Yogyakarta, on the island of Java Many women in Yogyakarta wore crisp white veils for the occasion which is one of two Islamic holidays celebrated worldwide Worshippers are required to place their hands over their ears during the Eid al-Adha prayer, which differs from the daily routine Men and women on the sand dunes of Parangkusumo are separated as they offer their prayer during Eid al-Adha Acehnese men stand beside a reflective pool of water as they lay out their mats in preparation for prayers at Blang Padang Park, Banda Aceh, Indonesia Thousands gathered at Malang, the second largest city in East Java, Indonesia for Eid al-Adha or 'the feast of sacrifice' Indonesian Muslims bow their heads during prayer in Medan, North Sumatra, Indonesia, as a balloon floats in the crowd The women are dressed in modest veils, many choosing to wear white, during the Muslim holiday of Eid Al-Adha Technology and tradition meet in Blang Padang Park, Indonesia, as women take 'selfies' to commemorate the occasion A mosque in Jakarta is inundated with devoted worshippers who have risen early to pray for the end of fasting A child peeks through the railings from an upper level of Istiqlal Mosque, the largest mosque in Southeast Asia The sheer volume of worshippers could not be contained and some must line up on adjoining road to take part in the prayer Women and men are divided as they take the time to glorify God as a group on the holiday of Eid Al-Adha Worshippers observing the holiday also sacrifice animals and distribute meat to the poor during the sacred day A cat bolts past the line of people as they sit on mats during the Eid al-Adha holiday at Jakarta's Senen Market in Indonesia Muslims can be seen crossing their arms across their navel - which is a part of the practice during Eid al-Adha Controversial figure Salim Mehajer posted a pictured outside Lakemba Mosque on Monday morning, offering his followers wishes of 'Eid mubarak' - which is a traditional Muslim greeting that means 'blessed celebration' in Arabic. He posted an image reading from the Quran to his Instagram account on Sunday. 'Whist the pilgrims go to Arafat from Mina, for the most important part of the Hajj; we sit back and try to redeem the importance of this day,' he wrote. Controversial figure Salim Mehajer posted a pictured outside Lakemba mosque (pictured) on Monday morning, offering his followers wishes of 'Eid mubarak' - a traditional Muslim greeting that means 'blessed celebration' in Arabic	{ "pile_set_name": "OpenWebText2" }
set(LLVM_LINK_COMPONENTS support) set(BUILDVARIABLES_SRCPATH ${CMAKE_CURRENT_SOURCE_DIR}/BuildVariables.inc.in) set(BUILDVARIABLES_OBJPATH ${CMAKE_CURRENT_BINARY_DIR}/BuildVariables.inc) # Add the llvm-config tool. add_llvm_tool(llvm-config llvm-config.cpp ) # Compute the substitution values for various items. get_property(SUPPORT_SYSTEM_LIBS TARGET LLVMSupport PROPERTY LLVM_SYSTEM_LIBS) get_property(WINDOWSMANIFEST_SYSTEM_LIBS TARGET LLVMWindowsManifest PROPERTY LLVM_SYSTEM_LIBS) foreach(l ${SUPPORT_SYSTEM_LIBS} ${WINDOWSMANIFEST_SYSTEM_LIBS}) if(MSVC) set(SYSTEM_LIBS ${SYSTEM_LIBS} "${l}.lib") else() if (l MATCHES "^-") # If it's an option, pass it without changes. set(SYSTEM_LIBS ${SYSTEM_LIBS} "${l}") else() # Otherwise assume it's a library name we need to link with. set(SYSTEM_LIBS ${SYSTEM_LIBS} "-l${l}") endif() endif() endforeach() string(REPLACE ";" " " SYSTEM_LIBS "${SYSTEM_LIBS}") # Fetch target specific compile options, e.g. RTTI option get_property(COMPILE_FLAGS TARGET llvm-config PROPERTY COMPILE_FLAGS) # The language standard potentially affects the ABI/API of LLVM, so we want # to make sure it is reported by llvm-config. # NOTE: We don't want to start extracting any random C/CXX flags that the # user may add that could affect the ABI. We only want to extract flags # that have been added by the LLVM build system. string(REGEX MATCH "-std=[^ ]\+" LLVM_CXX_STD_FLAG ${CMAKE_CXX_FLAGS}) string(REGEX MATCH "-std=[^ ]\+" LLVM_C_STD_FLAG ${CMAKE_C_FLAGS}) # Use configure_file to create BuildVariables.inc. set(LLVM_SRC_ROOT ${LLVM_MAIN_SRC_DIR}) set(LLVM_OBJ_ROOT ${LLVM_BINARY_DIR}) set(LLVM_CPPFLAGS "${LLVM_DEFINITIONS}") set(LLVM_CFLAGS "${LLVM_C_STD_FLAG} ${LLVM_DEFINITIONS}") set(LLVM_CXXFLAGS "${LLVM_CXX_STD_FLAG} ${COMPILE_FLAGS} ${LLVM_DEFINITIONS}") set(LLVM_BUILD_SYSTEM cmake) set(LLVM_HAS_RTTI ${LLVM_CONFIG_HAS_RTTI}) set(LLVM_DYLIB_VERSION "${LLVM_VERSION_MAJOR}${LLVM_VERSION_SUFFIX}") set(LLVM_HAS_GLOBAL_ISEL "ON") # Use the C++ link flags, since they should be a superset of C link flags. set(LLVM_LDFLAGS "${CMAKE_CXX_LINK_FLAGS}") set(LLVM_BUILDMODE ${CMAKE_BUILD_TYPE}) set(LLVM_SYSTEM_LIBS ${SYSTEM_LIBS}) string(REPLACE ";" " " LLVM_TARGETS_BUILT "${LLVM_TARGETS_TO_BUILD}") llvm_canonicalize_cmake_booleans( LLVM_BUILD_LLVM_DYLIB LLVM_LINK_LLVM_DYLIB LLVM_HAS_RTTI LLVM_HAS_GLOBAL_ISEL BUILD_SHARED_LIBS) configure_file(${BUILDVARIABLES_SRCPATH} ${BUILDVARIABLES_OBJPATH} @ONLY) # Set build-time environment(s). add_definitions(-DCMAKE_CFG_INTDIR="${CMAKE_CFG_INTDIR}") if(LLVM_ENABLE_MODULES) target_compile_options(llvm-config PUBLIC "-fmodules-ignore-macro=CMAKE_CFG_INTDIR" ) endif() # Add the dependency on the generation step. add_file_dependencies(${CMAKE_CURRENT_SOURCE_DIR}/llvm-config.cpp ${BUILDVARIABLES_OBJPATH}) if(CMAKE_CROSSCOMPILING AND NOT LLVM_CONFIG_PATH) set(LLVM_CONFIG_PATH "${LLVM_NATIVE_BUILD}/bin/llvm-config" CACHE STRING "") add_custom_command(OUTPUT "${LLVM_CONFIG_PATH}" COMMAND ${CMAKE_COMMAND} --build . --target llvm-config --config $<CONFIGURATION> DEPENDS ${LLVM_NATIVE_BUILD}/CMakeCache.txt WORKING_DIRECTORY ${LLVM_NATIVE_BUILD} COMMENT "Building native llvm-config..." USES_TERMINAL) add_custom_target(NativeLLVMConfig DEPENDS ${LLVM_CONFIG_PATH}) add_dependencies(NativeLLVMConfig CONFIGURE_LLVM_NATIVE) add_dependencies(llvm-config NativeLLVMConfig) endif()	{ "pile_set_name": "Github" }
Conference XP ConferenceXP is an open source video conferencing platform designed to address the needs of academic distance learning / multi-institutional instruction and advanced collaboration scenarios. Overview ConferenceXP is intended to be both a tool for end users and a platform for developing solutions for specific vertical applications as well as distributed applications. It supports advanced capabilities including: handwriting and 'ink' input through Tablet PCs; high definition video sharing up to 1080p; and desktop conferencing via USB and IEEE 1394 cameras. ConferenceXP was originally conceived in 2001 by the Microsoft Research Learning Science and Technology team and released under a shared source license. In July 2007 Microsoft Research External Research and Programs announced the funding of the Center for Collaborative Technologies at the University of Washington for a duration of 3 years. The primary mission of the Center was to continue development and deployment support for ConferenceXP. In December 2010, both Microsoft and the University of Washington assigned rights to the Outercurve Foundation, and a new open-source license was applied, the Apache License version 2.0. After the transition to open source, the University of Washington continues to support the main ConferenceXP Website, and the source code repository for the project, and will act as central point of contact for contributors to the project. Higher Education Involvement The following Universities in the United States and Ireland have been involved in research, development and/or innovative deployment with ConferenceXP: Northern Illinois University Brown University Cornell University Indiana University Purdue University Indianapolis - (IUPUI) - The Donald Tavel Arts and Technology Lab University of California at Berkeley University of Washington University of California at Santa Cruz University of Nebraska - Lincoln National University of Ireland, Galway University of Massachusetts Boston University University of Sydney Texas Christian University There are other institutions which have invested resources in development on this platform: University of Michigan (School of Public Health) MERIT University of Rochester (Eastman School of Music) The platform ConferenceXP is a platform supporting applications and services for low-latency, high fidelity conferencing applications. A complete description of the architecture and services available is available through the ConferenceXP website. Jay Beavers from Microsoft was the architect and lead developer for the ConferenceXP platform. Given the n-way nature of multi-party conferencing, the platform is optimised for use on multicast networks, generally supported by academic, government and research networks like Internet2 rather than the commodity Internet. However, Reflector Services accommodate unicast clients in ConferenceXP multicast sessions. The only publicly available reflectors current reside on the Pacific Northwest Gigapop (University of Washington) and at the Northern Illinois University School of Music. One of the most notable applications is Classroom Presenter developed by a team of researchers at University of Washington, led by Richard Anderson. See also Distance education Video conferencing Internet2 Multicast References External links ConferenceXP Website GitHub - conferencexp/conferencexp: Open source video conferencing and collaboration platform Category:Distance education software Category:Free and open-source software Category:Microsoft free software Category:Microsoft Research Category:Software using the Apache license	{ "pile_set_name": "Wikipedia (en)" }
Dual catalysis: new approaches for the polymerization of lactones and polar olefins. Recently catalytic systems combining Al, In or Zn Lewis acids with organic bases (amines, phosphines, N-heterocyclic carbenes) have been shown to efficiently promote the polymerization of lactones and polar olefins. In this frontier article, such dual approaches of polymerization catalysis are presented. Special attention is devoted to the mode of action of the dual systems and the underlying cooperative effects.	{ "pile_set_name": "PubMed Abstracts" }
Differing roles of the N- and C-terminal zinc fingers in human immunodeficiency virus nucleocapsid protein-enhanced nucleic acid annealing. The replication process of human immunodeficiency virus requires a number of nucleic acid annealing steps facilitated by the hybridization and helix-destabilizing activities of human immunodeficiency virus nucleocapsid (NC) protein. NC contains two CCHC zinc finger motifs numbered 1 and 2 from the N terminus. The amino acids surrounding the CCHC residues differ between the two zinc fingers. Assays were preformed to investigate the activities of the fingers by determining the effect of mutant and wild-type proteins on annealing of 42-nucleotide RNA and DNA complements. The mutants 1.1 NC and 2.2 NC had duplications of the N- and C-terminal zinc fingers in positions 1 and 2. The mutant 2.1 NC had the native zinc fingers with their positions switched. Annealing assays were completed with unstructured and highly structured oligonucleotide complements. 2.2 NC had a near wild-type level of annealing of unstructured nucleic acids, whereas it was completely unable to stimulate annealing of highly structured nucleic acids. In contrast, 1.1 NC was able to stimulate annealing of both unstructured and structured substrates, but to a lesser degree than the wild-type protein. Results suggest that finger 1 has a greater role in unfolding of strong secondary structures, whereas finger 2 serves an accessory role that leads to a further increase in the rate of annealing.	{ "pile_set_name": "PubMed Abstracts" }
1. Field of the Invention This invention relates to a host controller for the Universal Serial Bus (USB) and more particularly to monitoring of USB activity. 2. Description of the Related Art The Universal Serial Bus (USB) provides a way to attach and access peripheral devices through a common interface over a serial bus in a personal computer (PC) system. The USB was intended to reduce overall cost and simplify the attachment and configuration of peripheral devices from the end-user perspective. In older (also referred to as legacy) personal computer systems, peripheral devices were typically mapped into the central processing unit's (CPU's) input/output space and assigned a specific interrupt request (IRQ) line. In some cases, the peripheral device also received a direct memory access (DMA) channel. These system resources were assigned to particular peripheral devices by various personal computer manufacturers and became the standard input/output locations, IRQs and DMA channels used by software developers to access a given device. The USB breaks away from the resource problems associated with legacy PC input/output implementations. Instead, the USB provides an input/output port where several types of devices can be connected simultaneously and occupy the same hardware resources. The devices range from keyboards to printers to cameras. The USB relies heavily on system software to transfer data between the peripheral device and applications programs requiring use of the peripheral device. Each device on the USB is assigned an address known only to the USB software and thus does not consume additional hardware system resources in the manner typical of legacy PC architectures. In many computer systems, power savings features are utilized to reduce power consumption to extend battery life in e.g., laptop systems or to reduce power consumption to reduce operating costs of the system. Systems incorporating such power saving features typically operate in several reduced power modes where one or more parts of the system are turned off. In typical existing low power designs, hardware which is not controlled by the operating system, monitors system activity and determines the appropriate power state for the computer system. Systems typically measure system activity by monitoring peripheral activity including interrupts and accesses to specific input/output locations. System hardware uses such system activity to appropriately enter and exit from various power states. For example, when the PC is in a low power state, keyboard activity typically causes the PC to wake up from its low power state. On the other hand, many notebook computers are designed to automatically suspend when no activity is detected. Thus, inactivity of the mouse and keyboard, along with other inactive resources, cause the system to go into a low power state. In a legacy system, the specific input/output location, IRQs and DMA channels can be readily monitored by hardware to determine activity. However, in a USB system, only software and the actual peripherals connected to the USB know where USB transactions are directed. So there is no way for the hardware to readily identify which particular USB device, if any, is active. From a power management perspective, one solution is to ignore USB activity. However, that can result in the computer system suspending in the middle of a mouse or keyboard operation. Another solution is to have activity on the USB cause the system to wake up. However, because the hardware cannot distinguish activity on the bus that is relevant to power management from activity that is not, such a solution may prevent the system from entering a low power state. For example, if the system wakes up from a low power state because of any USB activity, even such activity as unacknowledged interrupts will cause the system to wake up. That is because on the USB, the USB host controller periodically polls devices to see if an interrupt is pending on the device. If so, the polled device will acknowledge the interrupt. If the device has no interrupt pending, then the device will not acknowledge the interrupt. If any activity on the USB causes a wake up operation, then even unacknowledged interrupts from the keyboard indicating no keyboard activity, would be considered USB activity and an unwanted wake up operation would occur. It can be seen, therefore, that it is desirable to integrate the USB into power management in a more useful manner.	{ "pile_set_name": "USPTO Backgrounds" }
SHIELDS UP “ILIAD” BOOK 7, lines 224-254 Translated by Richmond Lattimore Narrator: “Telamonian Aias... So he spoke, and balanced the spear far-shadowed, and threw it, and struck the seven-fold-ox-hide terrible shield of Aias in the uttermost bronze, which was the eighth layer upon it, and the unwearying bronze spearhead shore its way through six folds but was stopped in the seventh ox-hide. Then after him Aias the illustrious in turn cast with his spear far-shadowing and struck the shield of Priam’s son on its perfect circle. All the way through the glittering shield went the heavy spearhead, and crashed its way through the intricately worked corselet; straight ahead by the flank the spearhead shore through his tunic, yet he bent away to one side and avoided the dark death. Leah Himmelhoch by Mary LeClair For nearly a decade, Associate Professor of Classics Leah Himmelhoch has invited her students to do a close reading of the great classics such as Homer’s epic poem Iliad. At first the translated text written in dactylic hexameters can seem foreign to students until she asks them to stand, grab a spear and practice the warrior’s maneuvers from the great Greek battles. “The Iliad is hard enough to read; it can intimidate,” she says. “I want to teach students to connect with the writings; these were people and I want my students to have sympathy and empathy for their experiences. I want them to see that the text is lively, the characters are engaging, and the stories are head scratchers. I want them to ask themselves ‘What would I do?’ as they read about the dilemmas of the ages.” Throughout her education—first as an undergraduate at Yale University and then at the University of Texas at Austin for her masters and Ph.D.—Himmelhoch has learned by doing. Starting her career as an archeologist, she is drawn to historical artifacts that reveal the story of past lives and how people actually lived. Her third-floor office in Smith Hall contains bookshelves filled with a library of the classics but also swords, shields and statues. “I believe if I am teaching about the weapon, I should be able to use it. When you read about a spear in literature, I think, “How do you use the spear? How does it work?” says Himmelhoch, who in addition to teaching Greek and Latin Literature, Greek Archaeology and Ancient Gender and Sexuality, is also a martial artist. For example, after studying the warrior Achilles’ adventures during the last year of the Trojan War, Himmelhoch brought her students closer to Dark Ages and Archaic warfare, and their understanding of the first great book of warfare, by taking them to Smith Lawn to form a phalanx. As once a contingent of 8,000- 10,000 warriors would form a line of defense, students in her “Ancient Warfare” class stood shoulder to shoulder with long wooden spears drawn, and their wooden shields overlapped to reenact the ancient battle scenes. They also experiment, trying out the different proposed theories about what an ancient phalanx may actually have looked or functioned. What drives her work? She has a natural curiosity about where everything comes from, a determination to do empirical research, and a passion for ancient language. “Poetry is also history, written so it could be memorized and repeated,” she explains. “By reading ancient texts, we can talk to dead people. So when I started teaching I approached it with my students as taking a look at how we speak to each other.” The texts are engrossing. “Iliad, the first text written in the West is about war, why?” Himmelhoch asks. “The hero is Achilles and the text celebrates his death. We learn from the Iliad about class and gender issues, and we learn that warfare is a means to immortality.” And what drives her teaching? “I consider myself a liberal arts professor. Classics were once the only educational degree of the time, imparting the skill sets of citizenship which included the ability to write and critique. Learning those things requires brain push-ups. I want my students to know what the liberal arts are.” “Literature talks about things that are foundationally important in life, such as death and love. By the Iliad’s end, Achilles, the greatest warrior ever, only wants his dead friend, Patroklos, back, but he especially wants to go home to his father, whom he has just realized he will never see again. So I ask myself, how do I get students to read closely? Well, there are only two ways to communicate – through speech and touch.”	{ "pile_set_name": "Pile-CC" }
--- abstract: 'Within the Glauber formalism and a BUU transport model we analyze the $\eta$-photoproduction data from nuclei and evaluate the in-medium $\eta N$ cross section. Our results indicate that the $\eta N$ cross section is almost independent of the $\eta$ energy up to 200 MeV.' author: - \| M. Effenberger and A. Sibirtsev\ Institut für Theoretische Physik, Universität Giessen\ D-35392 Giessen, Germany date: title: 'The energy dependence of the in-medium $\eta N$ cross section evaluated from $\eta$-photoproduction [^1]' --- =-10mm Introduction ============ For a long time $\eta$-meson production in nuclei has been of interest as a source of information about the $\eta$-nucleus final state interaction. The present knowledge about the $\eta N$ interaction even in the vacuum comes from either simple analysis of the inverse $\pi N \to \eta N$ reaction or as a free parameter fitted to experimental data by theoretical calculations [@Liu; @Wilkin; @Chiavassa; @Sibirtsev1]. Note that the value of the $\eta N$ scattering length is still an open problem and there is not actual agreement between a bulk of theoretical investigations. The analysis of $\eta$-production from $pA$ collisions indicated strong sensitivity of the calculations to the prescription of the $\eta$-meson final state interaction [@Chiavassa; @Golubeva; @Sibirtsev2]. It was found that the $\eta$-energy spectrum [@Chiavassa2] is mostly influenced by the variation of the $\eta N$ cross section [@Golubeva; @Sibirtsev2]. However the experimental data [@Chiavassa2] had large uncertainties and there was no continuation of the systematical studies. Recent measurements on $\eta$-meson photoproduction in nuclei [@Krusche] are more detailed and accurate. Among the theoretical investigations [@Lee; @Carrasco; @Effenberger] only the calculations within the Distorted Wave Impulse Approximation (DWIA) from Lee et al.[@Lee] are able to reproduce the experimental data by incorporating the $\eta$-nucleus potential proposed by Bennhold and Tanabe [@Ben]. The present paper is organized as follows. In section \[glauber\] we use the Glauber formalism to extract the in-medium $\eta N$ cross section from the experimental data. In section \[buu\] these results are compared to Boltzmann-Uehling-Uhlenbeck transport model calculations. The sensitivity of the theoretical results to the prescription of $\eta N$ scattering is investigated. Analysis within the Glauber Model {#glauber} ================================= In an incoherent approximation the cross section of $\eta$-meson photoproduction off nuclei is given by $$\label{app1} {\sigma}_{\gamma \eta}^A = {\sigma}_{\gamma \eta }^p \times \left[ Z + \zeta (A-Z) \right]$$ with $A$, $Z$ being the mass and charge of the target,respectively, while the factor $\zeta=2/3$ [@Krusche2] stands for the ratio of the elementary $\eta$-photoproduction cross sections from $\gamma n$ and $\gamma p$ reactions. In nuclei the cross section differs from the approximation (\[app1\]) due to nuclear effects. ([i]{}) The Fermi motion of nucleons as well as ([ii]{}) Pauli blocking are important at energies below and close to the reaction threshold in free space [@Cassing1; @Salcedo]. We should also take into account [(iii)]{} the modification of the $N^$-resonance by the nuclear medium [@Carrasco; @Effenberger]. However the most important effect is [(iv)]{} the strong final state interaction of $\eta $-mesons in nuclear matter. The deviation of the $A$-dependence of the ${\sigma}_{\gamma A \rightarrow \eta X}$ from $A^1$ mostly reflects the strength of the final state interaction. Here we present an analysis of the experimental data on $\gamma A \rightarrow \eta X$ reactions in order to extract the in-medium cross section ${\sigma}_{\eta N}$. Our approach is based on the Glauber model [@Glauber] and first was developed by Margolis [@Margolis1] for evaluation of the $\rho N$ cross section from both incoherent and coherent $\rho$-meson photoproduction off nuclei. The most detailed description and application of the Glauber model to photoproduction reactions may be found from review of Bauer, Spital and Yennie [@Bauer]. A similar formalism is adopted for studying color transparency [@Bertch; @Kopeliovich1], where the in-medium cross sections is treated as a function of a transverse separation of the hadronic wave function. In the Glauber model the cross section of the incoherent $\eta$-meson photoproduction reads $$\label{fact} {\sigma}_{\gamma \eta }^A= {\sigma}_{\gamma \eta }^p \frac {Z + \zeta (A-Z)} { A} \times A_{eff}$$ where $$\label{aef} A_{eff} = \frac {1} {2 \pi} \int_0^{+\infty} d{\bf b} \int_{-\infty}^{+\infty} dz \ {\rho}({\bf b},z) \int_0^{2\pi} d\phi \ exp \left[-{\sigma}_{\eta N} \oint d\xi \ {\rho}({\bf r}_{\xi}) \right]$$ Here ${\rho}(r)$ is the single particle density function, which was taken of Fermi type with parameters for each nucleus from [@Jager]. The last integration in Eq. (\[aef\]) being over the path of the produced $\eta$-meson $$r_{\xi}^2 = (b+ \xi cos\phi sin\theta)^2+(\xi sin\phi sin\theta )^2 +(z + \xi cos\theta )^2$$ Here $\theta$ is the emission angle of the $\eta$-meson relative to $\gamma$-momentum. Eq. (\[aef\]) is similar to those from [@Vercellin; @Hufner] and in the low energy limit, i.e. by integration over the $\eta$-emission angle $\theta$ becomes as [@Benhar] $$\label{ave} A_{eff} = \int_0^{+\infty} d{\bf b} \int_{-\infty}^{+\infty} dz \ {\rho}({\bf b},z) exp \left( -{\sigma}_{\eta N} \int_z^{\infty} d\xi \ {\rho}({\bf b}, \xi) \right)$$ In the high energy limit, i.e. with the small angle scattering approximation $\theta =0$, Eq. (\[aef\]) reduces to simple formula from [@Margolis2] $$\label{eq2} A_{eff}= \frac {1} {{\sigma}_{\eta N}} \int_0^{\infty} d{\bf b} \ \left( 1- exp \left[ -{\sigma}_{\eta N} \ \int_{-\infty}^{+\infty} dz \ {\rho}({\bf b},z) \right] \right)$$ The nuclear transparency is defined now as $$T^A = \frac {{\sigma}_{\gamma \eta }^A } {{\sigma}_{\gamma \eta }^p \times \left[ Z + \zeta (A-Z) \right]}$$ and in the Glauber model it is simply given by $$T^A = A_{eff} / A$$ being the function of the target mass $A$, emission angle $\theta$ and in-medium $\eta N$ cross section ${\sigma}_{\eta N}$. Note that this model neglect the in-medium effects [(i-iii)]{}, and takes only the final state interactions into account. We analyze now the recent MAMI data [@Krusche] on $\eta$-photoproduction from $^{12}C$, $^{40}Ca$, $^{93}Nb$ and $^{207}Pb$ at $E_{\gamma}<$800 MeV in order to resolve the dependence (\[aef\]) with respect to the target mass. The $\eta$-production threshold on a free nucleon lies at $\simeq$706 MeV, thus our analysis is expected to be valid for $E_{\gamma} \geq 750$ MeV, in order to minimize effects [(i-ii)]{}. Moreover, to minimize the uncertainties related to [(iii)*]{}, which also are valid at high $E_{\gamma}$, we analyze the ratios of the differential cross sections integrated over the $\eta$-meson emission angle as $$\label{rat} R(A/^{12}C) = \frac{d{\sigma}_{\gamma \eta }^A} {dT} \left( \frac {d{\sigma}_{\gamma \eta }^{^C}}{dT} \right)^{-1}$$ We thus assume that the medium modifications of the $N^{\star}$-resonance are almost the same for all nuclear targets. The ratios (\[rat\]) are shown in Fig. \[fi1\] for several kinetic energies of $\eta$-mesons and as a function of the target mass. The lines indicate our calculations performed for different $\eta N$ cross sections. The model results are integrated over the $\theta$. Note that for ${\sigma}_{\eta N}$=0 the ratio (\[rat\]) saturates at $R=A/C$ as was expected neglecting the final state interaction. We now fit the experimental ratios for each $T_{\eta}$ by minimizing the ${\chi}^2$ in order to evaluate ${\sigma}_{\eta N}$. A similar analysis was perfomed recently by Kharzeev et al. [@Kharzeev] for the evaluation of the $J/\Psi$-nucleon cross section. Fig.\[fi2\] illustrates the minimization procedure and shows sensitivity of the data to the variation of $\eta N$ cross section. We fixed the confidence level that gives the value of the reduced ${\chi}^2/n >2$ can be expected no more than 10% of the time. With respect to the statistical errors of the experimental data the minimization produces three types of results. Namely, 1) with extraction of ${\sigma}_{\eta N}$ and indication its uncertainty, 2) with evaluation only the lower limit for ${\sigma}_{\eta N}$ or 3) with obtaining the minima behind the confidence level. Fig. \[fi3\] shows our final results in comparison with the experimental data and illustrate excellent agreement for wide range of the $\eta$-energies. Nevertheless we keep in mind the uncertainties in evaluating of $\eta N$ cross section and collect the ${\sigma}_{\eta N}$ in Fig. \[fi4\] as function of the $\eta$ energy and indication of confidence level. Note that within present analysis we evaluate the inelastic (or absorption) $\eta$-nucleon cross section, because the elastic scattering does not remove the $\eta$-meson from the total flux, which was detected experimentally. Our results indicate almost constant in-medium $\eta N$ cross section as function of the $\eta$-energy in strong contradiction with the ${\sigma}_{\eta N}$ from the scattering in vacuum. To make a more definite conclusion about the suppression of the $\eta N$ cross section in nuclear matter we need an accurate data on the coherent $\eta$-photoproduction off nuclei. The coherent reactions are more sensitive to the nuclear transparency ($\propto A_{eff}^2$ [@Bauer; @Margolis2; @Bochman]) and might solve the uncertanties of the present analysis performed with the Glauber model. Results from BUU calculations {#buu} ============================= In order to verify the results from the previous section we use a BUU transport model [@Cassing1; @Bertsch1; @Teis1] to calculate energy differential $\eta$-photoproduction cross sections in nuclei. This allows to drop several assumptions needed for the Glauber calculations. Fermi motion and Pauli blocking are taken into account as well for the primary $\eta$-production process as for the final state interaction of the produced particles. In Ref. [@Effenberger] the BUU model was used to calculate $\eta$-photoproduction in nuclei with the resonance model for the $\eta$ final state interaction from Ref. [@Teis1]. Here the $\eta$-rescattering was described by intermediate excitations of N(1535) resonances. The elastic and inelastic $\eta N$ cross sections calculated with this model are shown in Fig. \[abs\] with the solid lines. It turned out that this model was able to describe the total $\eta$-photoproduction cross sections reasonably well but failed in the description of angular and energy differential cross sections. Compared to the experimental data the calculated cross sections were shifted to smaller angles and larger $\eta$-energies for all considered target nuclei and all photon energies up to 800 MeV. In Fig. \[new\] the solid line shows the calculation of an energy differential $\eta$-photoproduction cross section on $^{40}$Ca with this model. It was already reported in Ref. [@Effenberger] that the discrepancy to the experimental data is cured by using an energy independent $\eta N$ cross section. The corresponding result is shown in Fig. \[new\] by the line labelled ’constant cross sections (1)’ where an inelastic cross section $\sigma^\eta_{in}=30\,$mb and an elastic cross section $\sigma^\eta_{el}=20\,$mb was used. Now we want to study the influence of different prescriptions for $\eta N$ scattering. The dashed line in Fig. \[new\] indicates the results calculated with a modified $\eta$-rescattering model: $$\begin{aligned} \label{modi} {\sigma}_{\eta N \to \pi N} &=& \frac{q_{\pi}}{q_{\eta}s} \ \frac{c^2 }{c^2+q_{\eta}^2} \ 40 \, {\rm mb \,GeV^2} \, ,\, c=0.3\,{\rm GeV} \\ {\sigma}_{\eta N \to \eta N} &=& \frac{45 \, {\rm mb\,GeV^2}}{s} \nonumber\end{aligned}$$ where $q_{\pi}$, $q_{\eta}$ are the cms momenta of the $\pi$- and $\eta$-meson, respectively, and $s$ stands for the squared invariant energy. The inelastic cross section was obtained by fitting the experimental data for the reaction $\pi N \to \eta N$, while the elastic cross section was assumed to be equal to the one in the resonance model at an $\eta$-energy of 125 MeV. The resulting elastic and inelastic cross sections are shown in Fig. \[abs\] with the dashed line. As can be seen from Fig. \[new\] (dashed line) this model improves the description of the energy differential cross section for small $\eta$-energies but still overestimates the cross section for higher energies. We have also used the $\eta N$ cross sections from Green and Wycech [@Green] and Lee et al. [@Lee]. The calculation of Green and Wycech is based on the K-matrix method and includes the $S_{11}(1535)$ and $S_{11}(1650)$ resonances. Following the authors this model is valid up to an invariant energy of about 100 MeV from $\eta N$ threshold which corresponds to an $\eta$ kinetic energy in the nucleon rest frame of 160 MeV. Lee et al. use a parameterization of the $\eta N$ scattering amplitude that is based on the calculation of Bennhold and Tanabe [@Ben]. This model contains the $P_{11}(1440)$, $D_{13}(1520)$ and $S_{11}(1535)$ resonances and might therefore be limited to an $\eta$ kinetic energy of about 100 MeV. The total cross sections within these models are shown in Fig. \[abs\]. Both models give about the same inelastic cross section which is basically due to the fact that in both models the dominating inelastic channel is given by the process $\eta N \to N \pi$. The experimental data [@Landolt] for this reaction, obtained by detailed balance from $\pi^- p \to \eta n$, are also shown. But one should note that the theoretical curves contain additional, even though small, contributions from $\eta N \to N \pi \pi$ and therefore can not directly be compared to these data points. The elastic $\eta N$ cross section in both models is very different which is an indication for the large theoretical uncertainties in the models for $\eta N$ scattering even in the vacuum. The corresponding results of the BUU calculations for photoproduction are given in Fig. \[new\]. As in the calculations within the resonance model and the model from Eq. (\[modi\]) we again fail to describe the shape of the energy differential cross section. The same holds for all target nuclei and photon energies as well as for the angular differential cross sections. Apart from the resonance model [@Teis1] all models give a satisfactory description of the cross section for $\eta$-energies below 50 MeV. The failure of the resonance model is due to the fact that this model was fitted to a larger class of elementary processes and a wider kinematical range and overestimated the cross section for $\eta N \to N \pi$ in the considered energy range. In Fig. \[new\] we also show the result of a model calculation with a constant inelastic cross section $\sigma_{in}^\eta=30\,$mb where we neglected elastic $\eta N$ scattering (curve labelled ’constant cross sections (2)’). Compared to the previous calculation with constant cross sections that included an elastic cross section the energy differential cross section is shifted to larger energies and fails to describe the data. Moreover the integrated cross section is slightly larger because the elastic cross section increases, in average, the length of the path of the produced etas through the nucleus and therefore reduces the number of etas that escape from the nucleus. One sees that in our model a constant inelastic $\eta N$ cross section alone is not sufficient to describe the data but an elastic cross section is also needed. Since the models for $\eta N$ scattering in the vacuum show a rather strong decrease of the total $\eta N$ cross section with $\eta$-energy we are not able to reproduce the data for $\eta$-photoproduction with any of these models within our transport model approach. For $\eta$-energies larger than 100 MeV we need an $\eta N$ cross section that is significantly larger than the one from the vacuum models while for lower energies our calculations are not very sensitive to the size of the cross section. A possible explanation is that the vacuum models [@Green; @Ben] are simply not applicable to the considered energy range. After all, due to the Fermi motion of the nucleons, the $\eta N$ cross section up to an invariant energy of $\sqrt{s}=1.74\,$GeV ($T_\eta=446\,$MeV in the nucleon rest frame) enters the calculations for an eta with a kinetic energy of 250 MeV in the rest frame of the nucleus. Our findings are in line with the Glauber analysis from section \[glauber\] and Ref. [@Krusche] which need a constant inelastic cross section of 30 mb in order to describe the mass dependence of the energy differential cross sections. However, Lee et al. [@Lee] were able to reproduce energy differential cross sections within the DWIA framework by using vacuum $\eta N$ cross sections. One crucial difference to our calculation is that in their calculation the outgoing nucleon in the elementary photoproduction process $\gamma N \to N \eta$ is set on-shell while in our semi-classical treatment the elementary process takes place instantaneously with following propagation of the produced particles through the nucleus. The potential energy which is needed to set the nucleon on-shell clearly shifts the $\eta$-spectrum to lower energies. A priori it is not obvious which of the two prescriptions is better suited to model the physical reality. Only a DWIA calculation along the line of Ref. [@Li] without the local approximation of Ref. [@Lee] could clarify this question. An indication for a larger $\eta N$ cross section at higher energies is the fact that we are able to describe energy and angular differential cross section for $\eta$-photoproduction simultaneously by using a constant cross section [@Effenberger] while in the calculations of Lee et al. the angular differential cross sections are shifted to smaller angles compared to the data. Summary ======= We have analyzed the $\eta$-photoproduction in nuclei within the framework of the Glauber model and a BUU transport model approach. Using the standard Glauber theory we investigate the $A$-dependence of the reaction $\gamma A \to \eta X$ in order to extract the data on $\eta$-meson final state interaction in nuclei. It was found that the in-medium $\eta N$ cross section is almost energy independent from $\eta N \to \pi N$ threshold up to $\eta$-kinetic energy of 130 MeV. Within a BUU transport model calculation we are able to reproduce energy and angular differential data for $\eta$ photoproduction only by using an energy independent $\eta N$ cross section but not with any available $\eta N$ vacuum cross section. However, the effect of the nucleon potential that can not be treated in our semi-classical calculation in a correct way might have an impact on that conclusion. Acknowledgement =============== The authors are grateful to B. Krusche and H. Stroeher for productive discussions. They especially like to thank U. Mosel for valuable suggestions and a careful reading of the manuscript. [99]{} R.S. Bhalerao and L.C. Liu, Phys. Rev. Lett. 54 (1985) 865. C. Wilkin, Phys. Rev. C 47 (1993) R938. E. Chiavassa et al. Z. Phys. A 344 (1993) 345. A.A. Sibirtsev, Phys. Scr. RS 21 (1993) 167. Ye.S. Golubeva, A.S. Ilijnov, E.Y. Paryev and I.A. Pshenichnov, Z. Phys. A 345 (1993) 223. A.A. Sibirtsev, Phys. At. Nucl. 56 (1993) 608. E. Chiavassa et al., Nuovo Cim. A 107 (1994) 1195. M. Roebig-Landau, J. Ahrens, G. Anton et al., Phys. Lett. B 373 (1996) 45. F.X. Lee, L.E. Wright, C. Bennhold and L. Tiator, Nucl. Phys. A 603 (1996) 345. R.C. Carrasco, Phys. Rev. C 48 (1993) 2333. M. Effenberger, A. Hombach, S. Teis and U. Mosel, Nucl. Phys. A 614 (1997) 501. C. Bennhold and H. Tanabe, Nucl. Phys. A 530 (1991) 625. B. Krusche et al., Phys. Lett. B 358 (1995) 40. W. Cassing, V. Metag, U. Mosel and K. Niita, Phys. Rep. 188 (1990) 363. L.L. Salcedo, E. Oset, M.J. Vicente-Vacas and C. Garcia-Recio, Nucl. Phys. A 484 (1988) 557. R.J. Glauber and J. Mathiae, Nucl. Phys. B 21 (1970) 135. B. Margolis, Phys. Lett. B 26 (1968) 254. T.H. Bauer, R.D. Spital and D.R. Yennie, Rev. Mod. Phys. 50 (1978) 261. J. Bertch, S.J. Brodsky, A.S. Golhaber and J.G. Gunion, Phys. Rev. Lett. 47 (1981) 297. B.Z. Kopeliovich and B.G. Zakharov, Phys. Lett. 264 (1991) 434. C.W. Jager, C. Vries and H. Vries, At. Data Nucl. Data Tables 14 (1974) 480. E. Vercellin, E. Chiavassa, G. Dellacasa et al., Nuovo Cim. A 106 (1993) 861. J. Hüfner, B. Kopeliovich and J. Nemchik, nucl-th/9605007 (1996) O. Benhar, B.Z. Kopeliovich, C. Mariotti, N.N. Nikolaev and B.G. Zaharov, Phys. Rev. Lett. 69 (1992) 1156. K.S. Kölbig and B. Margolis, Nucl. Phys. B 6 (1968) 85. D. Kharzeev, C. Lourenco, M. Nardi and H. Satz, Z. Phys. C 74 (1997) 307. G. Bochman, B. Margolis and C.L. Tang, Phys. Lett. B 30 (1969) 254. G.F. Bertsch, H. Kruse and S. Das Gupta, Phys. Rev. C 29 (1984) 673. S. Teis, W. Cassing, M. Effenberger, A. Hombach, U. Mosel and Gy. Wolf, Z. Phys. A 356 (1997) 421. A.M. Green and S. Wycech, Phys. Rev. C 55 (1977) 2167. Baldini et al., Landolt-Börnstein, Band 12 (Springer, Berlin, 1987). X. Li et al., Phys. Rev. C 48 (1993) 816. [^1]: Supported by Forschungszentrum Jülich, GSI, BMBF and DFG	{ "pile_set_name": "ArXiv" }
[In vitro activity of the echinocandins. How should it be evaluated?]. Echinocandins are a novel class of antifungal drugs. They have good activity against Candida spp and Aspergillus spp. Their low selective toxicity allows their administration at high doses with few secondary side effects. We have reviewed the available data on the endpoints for these drugs in their in vitro susceptibility testing on yeasts and moulds. The microdilution broth method is the most commonly used technique and MIC-1 (80% of growth inhibition) seems to be the most reliable endpoint when yeasts are tested. This endpoint also seems to be the most appropriate for the different drugs when they are combined with echinocandins using the checkerboard method for testing yeasts. By contrast, in the case of moulds, the minimum effective concentration (MEC) correlates better with the in vivo activity than the MIC when echinocandins are tested, and when these drugs are combined with other antifungals, MIC-2 (50% of growth inhibition) seems the most appropriate endpoint. Criteria based on drug pharmacodynamics is the most useful to define the echinocandin endpoints that best correlate with their in vivo efficacy.	{ "pile_set_name": "PubMed Abstracts" }
The goal of this research is to develop novel, biologically functional DNA nanostructures that dramatically enhance the reproducibility, sensitivity, and spatial density of chip-based DNA assays. These nanostructures will improve applications ranging from point-of-care diagnosis to genomic arrays used in basic research by enabling the development of next generation screening technologies that are faster, more sensitive, more reliable, and possibly more cost effective than those presently available in the life sciences market. To accomplish the stated goals, Nanolnk will develop a DNA patterning methodology based on Dip Pen Nanolithography (DPN) to generate sub-micron sized features of DNA on solid surfaces. This multidisciplinary effort will involve life and physical scientists at Nanolnk, MEMs and instrumentation engineers at our fabrication facility, in addition to support from outside experts in the fields of DNA microarrays and microfabrication. DPN, built upon the technique of Atomic Force Microscopy (AFM), allows one to deposit materials uniformly in a direct-write fashion on surfaces with nanoscale spatial precision. This strategy offers significant advantages over current microarray printing technologies that suffer from poor spot to spot reproducibility in terms of size, shape, and oligonucleotide density, as well as reproducibility across microarray slides. Preliminary work has demonstrated that the DPN technique can be used to deposit 12mer synthetic oligonucleotides on surfaces with extremely uniform sub-100 nm to several micron scale features. The DNA nanostructures formed robust films and exhibited selectivity in binding to complementary oligonucleotides. Thus, DPN can be used to generate uniform features of synthetic DNA far smaller than can be obtained with other spotting or photolithography techniques. In Phase I, Nanolnk will demonstrate feasibility of the DPN-based approach for generating sub-micron scale DNA nanostructures on glass surfaces. The resulting nanostructures will be analyzed using existing fluorescence probe technology to provide benchmarking standards for comparison to conventional microarray assays. In addition, for applications in life sciences and biomedicine, it is desirable and advantageous in terms of speed and throughput to extend the serial patterning capability of DPN to a parallel methodology. Thus, concurrent with ink development and patterning optimization, microfabricated parallel multipen arrays will be explored as a means for faster, simultaneous writing of multiple DNA inks.	{ "pile_set_name": "NIH ExPorter" }
Jessica Baran encapsulates the St. Louis art scene Newly ReviewedAhmet Ogut: Underestimated Zones Amsterdam-based Turkish artist Ahmet Ogut stages a number of interventions that blend political activism with Buster Keaton-esque slapstick, highlighting the too-fine distinction between absurdity and moral efficacy. In one series of photographs, the artist has hung a sign, guerrilla-style, in undisclosed but distinctly urban St. Louis locations. The sign reads: "Under 23 Hour Surveillance," the Orwellian aura of ubiquitous intrusion undermined by the potential for a random hour of unsupervised chaos. Elsewhere, a dual slide projection transforms two unsuspecting commuter cars into a taxi and a police vehicle, via awkward paper appliqués the artist affixes surreptitiously. In spliced-together videos, Ogut reconfigures a sign that says "Amsterdam" so that it reads "Dreams," "Desert" and "Damned"; human figures slither through the life-size letters in a manner that suggests animals, or pestilence. And in a notable real-time infiltration, Ogut has paved one of Laumeier's galleries in fresh asphalt. The resurfaced space is as succinct in effect as it is multivalent: appearing like an urban spoof of Walter De Maria's "Earth Rooms," the black granulated material glimmers like spilled precious stones and exudes a distinctly pungent scent that, to the modern senses, is as redolent as seasonal flowers. Also showing:Things We Count, a short dream-like film that pans through a boneyard of defunct WWII aircraft in the Arizona desert: The abandoned fighter planes look harrowingly gorgeous, like a collection of ominous antiques. Through January 9, 2011, at Laumeier Sculpture Park, 12580 Rott Road, Sunset Hills; 314-615-5278 or www.laumeier .org. Fall-winter hours: 10 a.m.-5 p.m. Wed.-Fri., noon-5 p.m. Sat.-Sun. (Outdoor grounds open daily from 8 a.m. to a half-hour past sunset.) James Rosen: The Artist and the Capable Observer With pieces selected from the artist's six-decade career, this exhibition of oil paintings and ink-on-paper sketches is a double homage: to the art-historical references Rosen draws from, and to the rarefied art of the figure. Focusing on liturgical masterworks of the Italian and Northern Renaissance (altarpieces by Giotto, Grunewald and Duccio, among others), Rosen paints diaphanous canvases that re-present the original compositions — literally — through the gauzy lens of memory. Rosen's modus operandi is a distinct one: He layers each canvas in nearly 60 "veils" of oil paint and wax, in successively less intense gradations of pigment, resulting in a ghostlike image of almost watery depth, where the more extreme hues surface and hint at the otherwise submerged imagery. The result is a work that straddles abstraction and realism: Given patient scrutiny, the nearly opaque gray surface reticently conveys a fully realized figural work. Several collections of works on paper accompany the paintings, illustrating Rosen's dedication to drawing as a means of homing in on his subjects. In their linear delicacy, these small studies may equal the impact of the completed works; here the dynamic of the paintings is reversed, as Rosen reveals himself to be a near supplicant to the faces, bodies, landscapes and shadowy details of the things he trains his eyes on. Through December 12 at the Museum of Contemporary Religious Art, 3700 West Pine Boulevard (on the Saint Louis University campus); 314-977-7170 or http://mocra.slu.edu. Hours: 11 a.m.-4 p.m. Tue.-Sun. OngoingA Day Like Any Other This mid-career survey by 42-year-old Brazilian artist Rivane Neuenschwander features a suite of works that function like trenchantly clever pop refrains. The media are wildly diverse — installations, video, drawing, painting — but the constant is a core engine of simple play. In Rain Rains, silver buckets filled with water hang from the ceiling, dripping into buckets placed below. Holes punched from the text of 1001 Arabian Nights are scattered on black pages of paper, creating constellations made to mark every day of the exhibition. A soap bubble is filmed as it eludes bare light bulbs, hallway corners and kitchen cabinets in an empty urban apartment, in a poetical homage to Roman Polanski's paranoiac 1976 film The Tenant. Viewers are invited to make an appointment with a police sketch artist to whom they can describe their first love and have that love rendered, in a piece after Samuel Beckett's early novella First Love. And in Involuntary Sculptures (Speech Acts), the twisted tin labels and paper straw wrappers wadded in the hands of nervous bargoers are displayed in white vitrines. Time, perception and the bare inevitability of gravity, weather and idle hands are the operable mechanics, here, creating an elegantly blithe portrait of the weighty elements that encumber us. Through January 10, 2011, at the Mildred Lane Kemper Art Museum, Forsyth and Skinker boulevards (on the campus of Washington University); 314-935-4523 or www.kemperartmuseum.wustl.edu. Hours: 11 a.m.-6 p.m. daily (closed Tue., open till 8 p.m. Fri.). Elad Lassry: Sum of Limited Views Israeli-born, Los Angeles-based artist Elad Lassry repurposes our collective sense of stock photography to bizarre and uncanny effect, creating still lifes and portraits that straddle popular advertising and surreal conceptualism. With their intimate, domestic scale, the pieces inhabit a snapshot realm even as they swerve away from the familiar. A series of open, pink lipsticks set on small green pedestals are presented against a green background within a green-painted frame. A well-groomed young man with a large white smile appears poised for product placement, but the image is double-exposed, giving him four eyes. The works appear simultaneously static and shaken — or on the verge of some subtle movement — an effect Lassry explores further in a series of sixteen-millimeter films. Also showing —Richard Artschwager: Hair A former furniture maker, Artschwager has employed rubberized horsehair of the type used in upholstery to create works that exist in a realm of inconclusiveness like that of Lassry's photos, where hard lines of exclamation points, thrones, tables and figural silhouettes blur in the frayed surface of their hirsute material. These pieces, made over the past three decades and rarely exhibited, expose a new dimension of this elusive artist's large and varied canon: an effort to soften the cerebral nature of the principal mid-century art movements. Through January 2, 2011, at the Contemporary Art Museum St. Louis, 3750 Washington Boulevard; 314-535-4660 or www.contemporarystl.org. Hours: 10 a.m.-5 p.m. Tue.-Sat., 11 a.m.-4 p.m. Sun. Exposure 13 Concise and spare, this year's annual exhibition of notable local talent focuses on the work of Martin Brief, Joe Chesla and Asma Kazmi. Brief's pencil drawings trace the bare outlines of the entries on dictionary pages revealing empty shapes reminiscent of bar graphs or, perhaps floor plans. Joe Chesla's installation involves a gridwork of small plastic bags filled with water and affixed to a massive, transparent plastic sheet; the sheet is bound at its lower corners with rope, which peels the piece partially from the wall and toward the ceiling, revealing an underlayer of watery light. Asma Kazmi crafted several dozen clay pinch pots — or kashkol, hand-formed ceramic begging bowls — that rest on an unfinished pine table like a collection of autumn leaves or discarded half-shells. Taken together, the three artists amplify one another's interest in absence, resulting in a suite of frames for words, substances or currency that isn't there. Through December 4 at Gallery 210, TeleCommunity Center, University of Missouri-St. Louis, 1 University Boulevard (at Natural Bridge Road); 314-516-5976 or www.umsl.edu/~gallery. Gallery hours 11 a.m.-5 p.m. Tue.-Sat. Rick Egea; galvanized steel bucket riddled with rusty nails. Perfectly Fucked Up for You Locally based painter RJ Messineo inaugurates Los Caminos — a new apartment gallery co-run by Cole Root and Francesca Wilmott — with a suite of abstract works that speak directly to the space's hybrid identity as a home and an exhibition venue. Stacked, a sculpture comprising three mirrored sides on a plywood base, stands roughly at human height and confronts the viewer upon entry; its edges are painted with primary-color enamel in hues reminiscent of children's blocks or jungle-gym equipment. A swath of window screen hangs adjacent to a row of street-side windows, its center carved out and stapled with white-painted poster board. An assemblage of wooden lattice, also painted white, divides the living room from the kitchen. Messineo's work communicates in a language of absences and presences, extracted from each piece's composite parts and reconfigured within it and among its neighbors. The works' material grammar of household items resonates as a fractured abstraction of domesticity, a homage to the elemental, familiar comforts of home and their more lurid Freudian subtexts. Through November 20 at Los Caminos, 2649 Cherokee Street; 314-629-8769 or www.loscaminosart.com. Hours: by appointment. Smarter/Faster/Higher A clutch of wire-woven human forms crawl, run and gaze at their own images displayed on video screens in Elizabeth Keithline's site-specific installation. Wire-formed trees sprout from the hexagonal white tiles that carpet the areas on which the figural armatures pose. It's a skeletal world of reductive shapes and symbolic forms, suggesting a kind of Darwinian attrition from wildlife and infancy to the technocratic and ostensibly "adult." In this case maturity equals self-reflection, which is either an act of heightened consciousness or narcissism. Either way, whatever these characters discern in themselves must be yet one more reduction of humanity, like the hollow and de-gendered objects they are, despite their finely knotted nuance. Which is to say that this is one direly cynical diorama, lovingly handcrafted. Through January 16, 2011, at the Craft Alliance Gallery (Grand Center), 501 North Grand Boulevard; 314-534-7528 or www.craftalliance.org. Hours: noon-6 p.m. Wed.-Sat., noon-5 p.m. Sun. stylus Ann Hamilton's poetic and site-specific installation addresses the history and scope of modes of communication. Upon entering one is invited to choose a record drawn from the St. Louis Public Library that plays in concert with the otherworldy soundtrack (composed by Shahrokh Yadegari) that otherwise consumes the installation. Mumblings of words, some of them discernible, echo through the wide gallery corridors, many of them recited by Hamilton (a printed transcription is available) and integrating words from William James' Varieties of Religious Experience and phrases from contemporary news RSS feeds. The liturgical and the political (or the spiritual and the pragmatic) could be described as the conscience of this exhibition, which envelops you with sound, implicates you with participatory choices and confronts you with engrossing but temporal imagery. In short, Hamilton has created a kind of weather, one whose stormy ruptures and angelic calms are both within viewers' reach to affect, and, simultaneously, to be subjected to. A table covered in jumping beans resides in what becomes the Pulitzer's choir loft, the sound of the beans amplified by microphones that hover above them. Their wordless chatter feels as elemental as the soaring crescendos of a classical soprano voice, which occasionally intervenes in the soundscape. As the signal and noise of today's news streams past, verbally and in visual projection, the viewer is moved to reflect on all that can't be said. Through January 22, 2011, at the Pulitzer Foundation for the Arts, 3716 Washington Boulevard; 314-754-1850 or www.pulitzerarts.org. Hours: noon-5 p.m. Wed., 10 a.m.-4 p.m. Sat. Tiny Content "Content is a glimpse of something, an encounter like a flash. It's very tiny — very tiny, content," said Willem de Kooning. Taking its title from the epigraph to Susan Sontag's pivotal essay "Against Interpretation," this small group show, sensitively curated by Bevin Early, explores art's capacity for earnestness and failure. And an essay it is, in the English sense of the word — a small exegesis on a subject — and the French, in which it means "an attempt." Recent Washington University M.F.A. graduates John Early and Dan Solberg contribute works that mine the aesthetics of inconclusiveness. Early's Swivel Swing invites viewers to sit, take a pencil and draw a parenthetical arc around themselves on the gallery wall, describing their arms' reach. Solberg displays a series of failed faxes from a colleague, who was attempting to send him the text of a lecture by Michel Foucault. Half-eaten by digital noise, the pages are an apt analogue to the heading from beneath which they were extracted: poststructuralism. Peter Pranschke displays a suite of delicate sculptures wrought in used erasers, meticulously wadded dental floss, cut-up notebooks and the detritus of other "ordinary materials" used to correct or improve upon aspects of daily human well-being. The small pieces are meaningfully laid out on a shiny white tabletop that resembles the blank expanse of a dry-erase board, suggesting a quixotic diagram or an abstract solution to an abstract problem. Mike Schuh inhabits a small alcove of the gallery with pieces of linoleum tile torn out of his studio in Banff, Alberta; the rough-edged and worn-out squares reaffirm the artist's absence and the objects' displaced use. Taken as a whole, the collection of spare artworks seems to function as a mumbling chorus of stripped-down materials, most of them commonplace, estranged from their typical purpose and made elegant by their simplicity. Through December 5 at Snowflake, 3156 Cherokee Street or www.snowflakecitystock.com. Hours: noon-6 p.m. Uncommon Objects/Personal Views: The Collections of Rick Ege and John Foster Canvas carnival "punks"; a galvanized steel bucket riddled with rusty nails; a massive cross crafted in sharp-faceted bits of scrap metal; a miniature steam boat scrupulously assembled from old linoleum tiles, painted wood pieces and swaths of window screen: This exhibit of folk art and anonymously crafted or found oddities is a study in looking closely at the world, with an eye for incidental splendor. The two local collectors featured — Rick Ege, a noted antiques dealer, and John Foster, a graphic designer at TOKY — have together amassed a peculiar museum of regional wonders, from geodes that resemble intricately weathered marble busts to assorted hands, roughly wrought in steel or elegantly detached from turn-of-the-century haberdasher's models. A painting of Hell's layered firmaments by Howard Finster and a stacked assemblage of yellowed napkins detailing plane crashes by savant George Widener, among other pieces of notable American outsider art, suggest alliances between meticulous, if unwitting, aesthetic brilliance and what might otherwise be overlooked as bizarre detritus. But detritus this is not: The objects here are not merely uncommon. Their wondrous beauty equals or exceeds that of more deliberate, schooled and cerebrated "art." A rare gem of an exhibition, beseeching you to behave like the artists exhibited: lean in, get lost in details and overlook nothing. Through January 8, 2011, at the Sheldon Art Galleries, 3648 Washington Boulevard; 314-533-9900 or www.sheldonconcerthall.org. Hours: noon-8 p.m. Tue., noon-5 p.m. Wed.-Fri., 10 a.m.-2 p.m. Sat	{ "pile_set_name": "Pile-CC" }
Meet the career of your dreams. Do you have your eye on the future and want to make a difference? We can help you turn knowledge gained through your education into limitless career potential. NOTICE TO THIRD PARTY AGENCIES:Please note that AECOM does not accept unsolicited resumes from recruiters or employment agencies. In the absence of a signed Recruitment Fee Agreement, AECOM will not consider or agree to payment of any referral compensation or recruiter fee. In the event a recruiter or agency submits a resume or candidate without a previously signed agreement, AECOM explicitly reserves the right to pursue and hire those candidate(s) without any financial obligation to the recruiter or agency. Any unsolicited resumes, including those submitted to hiring managers, are deemed to be the property of AECOM.	{ "pile_set_name": "Pile-CC" }
Synergism of chronic alcoholism and hepatitis B infection in liver disease. One hundred and fifty-seven patients with alcoholic liver disease were studied. Hepatitis B surface antigen (HBsAg) was positive in 20.4% of the patients. Those who were positive for the HBsAg presented at an earlier age, had a lower albumin level, a higher globulin level, a more prolonged prothrombin time, were more likely to have features of cirrhosis in the liver biopsy, and were probably more likely to suffer from hepatic encephalopathy in the follow-up compared with those negative for HBsAg. The mortality of subjects was low both on admission and during follow-up. It is concluded that chronic alcoholism and hepatitis B virus infection act synergistically in producing more severe liver damage and causing cirrhosis at a younger age compared with chronic alcoholism alone. One possible reason for the low mortality of the patients might have been their relatively good nutritional status.	{ "pile_set_name": "PubMed Abstracts" }
This invention relates to an improvement for a conventional automotive vehicle side view mirror which will enable the vehicle driver to quickly and accurately adjust the vehicle mirror into positions for either viewing a normal or conventional reflection of the area at the side of the vehicle or, optionally, viewing the side blind spot area which normally is not reflected in the conventional mirror setting. Conventional side view mirrors that are mounted on either the driver""s side or the passenger""s side of an automotive type vehicle, such as an automobile, truck, or bus, generally comprise a housing which supports and provides a frame about a reflective mirror element. The mirror element or member typically is mounted within the housing or frame for angular adjustment around a horizontal axis or vertical axis or both. The vehicle driver may manually, by grasping or pushing the mirror member itself, turn it until it reflects the area to the side of, and rearwardly of that side, of the vehicle. Alternatively, in many vehicles, the adjustment of the mirror element is made by the vehicle driver manually moving or pushing a control button or lever which, in turn, operates a motor driven mechanism that responsively moves or turns the mirror into a driver desired angular position relative to the horizontal and the vertical. Either way, whether the adjustment of the mirror is performed by hand pressure applied directly upon the mirror member or by a mirror moving mechanism which is hand controlled by the driver, such manual adjustments typically are used to arrange the mirror at an angle which reflects the area closely adjacent the side of the vehicle. In normal use, the side view mirror that is conventionally located at the passenger side of the vehicle, is set by turning the mirror so that a reflection of a portion of the vehicle side is visible to the driver while the reflection also shows the area which extends rearwardly and along the side of the vehicle. This enables the driver to see vehicles that are at the passenger side, but not in the blind spot. The conventional setting may also enable the driver to see the adjacent road edge or curb edge or the like for parking the vehicle. The mirror located at the driver""s side of the vehicle similarly is normally adjusted by the driver to reflect the side of the vehicle and the area at the far rear and side of the vehicle. In normal operation, the angularity of the mirror, is set by the driver when the driver is seated within the vehicle and then the mirror remains at that setting. The normal purpose of the permissible mirror adjustment is to enable different drivers within a particular vehicle to arrange the angle of the mirror to display the best rear and side view for a particular driver. In the normal or conventional use of side view mirrors, the so called xe2x80x9cblind spotxe2x80x9d, which is an area generally at the driver or passenger side of, and somewhat laterally spaced from the side of, a vehicle, is normally not visible in the reflection that appears on the mirror when the mirror angularity is conventionally set. Therefore, there are accidents and near accidents that occur because a driver, relying upon the side view mirrors and, in addition, to the rear view mirror which is within the vehicle, is unable to see in the mirrors a following vehicle which is located in the vehicle blind spot. In such conditions as changing lanes, or turning across a lane, an unseen vehicle that is located in a blind spot is the cause of numerous accidents or near accidents. Further, the angular adjustment of a side view mirror is normally a matter of trial and error. That is, a driver when sitting in the driver""s seat behind the steering wheel, must look at the side view mirrors on either side of the vehicle and adjust the angle for that particular driver""s best view of the rear and side of the vehicle. Various attempts have been made to assist the driver in initially setting the particular angle of the side view mirror which is most comfortable and practical for that particular driver and later resetting the angle whenever the mirror angle has been changed. Examples of devices provided for the purpose of enabling a driver to re-set the mirror angle at a pre-selected or pre-determined position are illustrated and described in U.S. Pat. No. 4,989,966 issued Feb. 5, 1991 to Kim for an xe2x80x9cAdjustable Vehicle Side View Mirrorxe2x80x9d and U.S. Pat. No. 5,500,773 issued Mar. 19, 1996 to Easter for a xe2x80x9cVehicle Mirror Alignment Devicexe2x80x9d. The first patent provides a flexible frame around the mirror member that grasps the mirror edges and clamps the mirror which may be set at markings located within the frame. Constriction of the frame around the mirror member is provided by a locking or adjustment mechanism which either tightens the frame around the mirror to maintain its desired angular position or, alternatively, is loosened to allow the mirror to be angularly adjusted. In the second patent mentioned above, a sighting or aiming device is applied upon the mirror, somewhat like a gun sight, which enables the driver to set the angle of the mirror by looking through the aiming device. In both of these patented devices, once the mirror is pre-set for conventional viewing, it remains that way for a particular driver until the mirror is reset by a different driver who wants a different angular viewing position. Then the mirror may again be re-set by the first driver. In the patent to Thomas, U.S. Pat. No. 1,879,592 of Sep. 27, 1932, an interior or rear view vehicle mirror is provided with distance indicator markings. The driver may form markings on the mirror surface which visually correspond to objects located at varying distances behind the vehicle. In addition, a gage is provided for enabling a driver to angle the interior mirror to predetermined positions by aligning an edge of the mirror with the markings. This structure is designed for pre-setting the mirror and maintaining it in a fixed position for a particular driver who will then rely upon the markings formed on the mirror to estimate the distance of a following vehicle behind the driver""s vehicle. Attempts have been made to provide mechanisms by which a mirror may be adjusted, in some cases automatically, to view not merely the normal or conventional area behind the vehicle but also side areas which would include the blind spot area. An example of such a mechanism is illustrated in U.S. Pat. No. 5,914,824 issued Jun. 22, 1999 to Valentino for a xe2x80x9cRear View Mirror Apparatus And Method For Vehicle Lane Changingxe2x80x9d. This illustrates an automatic system for adjusting the angle of the mirror temporarily when the vehicle, such as a large truck, turns. Thus, the driver is provided with an image of the blind spot or area along the side of the truck as it makes a wide turn. The present applicant""s previously filed patent application, U.S. Ser. No. 09/294,579 filed Apr. 20, 1999, now U.S. Pat. No. 6,193,380 issued Feb. 27, 2001, similarly focuses on an automatic system for temporarily viewing a reflection of the blind spot area, when a following vehicle enters the blind spot area of a leading vehicle. Another example is disclosed in U.S. Pat. No. 5,097,362 issued Mar. 17, 1992 to Lynas for a mechanism for automatically changing the position of the mirror in response to the activation of the vehicle""s turn indicator. But, this system is ineffective for viewing a vehicle""s blind spot when the driver wishes to determine whether a vehicle is located in the blind spot during normal driving conditions. The various devices contemplated for enabling a driver to temporarily view a blind spot area are relatively complex and contemplate changing or replacing the presently available side view mirror mechanisms or devices used on vehicles. The present invention contemplates providing an add-on device which can be utilized on pre-existing mirror constructions, whether those that are adjustable by direct hand pressure or by a hand controlled mechanism, to initially reflect a pre-determined side view area convenient to a particular driver and when desired, to temporarily view the blind spot area relative to the vehicle. The improvement may also be used reversely, that is, to normally view the blind spot area and temporarily view the conventionally viewed areas at either the driver""s side or the passenger""s side of the vehicle. Thus, little if any change is required for adopting the normal or conventionally available side view mirror to achieve these results. This invention contemplates modifying a conventional vehicle side view mirror, which has a reflective mirror member positioned within a frame. The frame may be part of a housing that is mounted on the side of a vehicle. A series of horizontally spaced apart indicium or markings are formed upon the vertical portion of the frame which is most remote from the vehicle and which is visible to the driver. These markings form indicia in which the individual markings are spaced apart horizontally. The vertical edge portion of the mirror element, which is adjacent the frame portion, is arranged into alignment with one or another of the individual indicium. Since the mirror member can be angularly adjusted by the driver, either by directly manually moving it or by moving it manually through the use of a conventional hand operated control that operates a moving mechanism, as is common in many vehicles today, the vertical edge of the mirror can be aligned with one or another of the marks. Thus, alignment with one of the marks that is more to the rearward relative to the vehicle can be used to appropriately align the mirror edge to reflect the conventionally viewed rear and side area relative to the vehicle. However, angularly moving the edge of the mirror member into alignment into one of the more forward markings causes the mirror to reflect the blind spot area along the side of the vehicle. Consequently, in that position the presence of any following vehicles located in the blind spot would be visible to the driver. The driver, upon entering the vehicle, may initially pre-set the mirror angle, if it is not already pre-set, to reflect either the conventional rear-side view or the blind spot view. Preferably, where the driver has an unobstructed rear view on the conventional interior rear view mirror that is normally located at the upper portion of the vehicle windshield in front of the. driver, as is common in most vehicles, the driver could set the side view mirrors to normally view the blind spots on either side of the vehicle. In that case, the driver may only use the interior rear view mirror to see the rear of the vehicle and simultaneously use the side view mirrors to see the blind spots. When desired the driver may reset the side view mirrors, by turning them into alignment with the particular mark or indicium that the driver had pre-selected. An object of this invention is to provide a simple, inexpensive, system by which a vehicle driver may temporarily adjust the side view mirrors of a vehicle for viewing, either the blind spot area or the conventional side view area of the vehicle, without any substantial modification of the mirror structure. Another object of this invention is to provide a means by which the driver of a vehicle may normally, if desired, view the blind spot areas of a vehicle, while relying upon the.inner or interior mirror to view the rear of the vehicle, and to preset the mirror into the best viewing position for the particular driver for blind spot viewing or alternatively for normal side viewing. Still another object of this invention is to provide a simplified modification which inexpensively provides a system by which a driver of a vehicle may accurately and quickly reset the driver""s or passenger""s side view mirrors by simply adjusting the angularity of the mirror, within its frame, to visually align an edge of the mirror with a pre-selected visible marking applied upon the mirror frame.	{ "pile_set_name": "USPTO Backgrounds" }
About Empire Removals Empire Removals Removal of House, Flat & Office Office & Home Removals Local and international Removals anywhere Intercity- City to City We beat any Price and all prices are always negotiable!! Moving on a budget? Contact us for a quick, easy and free quote. (Pensioners Discount) Removal Services We Offer: - Free wrapping of furniture and all Items of value as per customer needs. - Special Bubble wrapping of goods on request. (Extra Charge) – Collection of appliances/furniture purchased - Collection of goods purchased on auction - General collection and assistance with removals of just about anything. - Free bed covers whilst in transit - Free Couch covers whilst in transit - Cheapest rates (We Beat Any Price!) *All quotes include labor. No charge for weekends, overtime or public holiday* - Enclosed Trucks (Raining or not your goods are protected) - Quality Service - Free quotes – (We will come to your doorstep to quote on request) - Cleaning Service (additional Cost) - Packing help (Additional Cost) - Courier services *Operating in All areas of the Cape Town Western Cape and surrounding Regions with successful moves as far as Durban KZN* - Goods in Transit Insurance included - Removal of Piano’s and other heavy items (Additional Costs) - Cold Food Courier Services now available! - Storage can be arranged.	{ "pile_set_name": "Pile-CC" }
1. Field of the Invention The invention relates to ball grid array devices, more particularly to an adapter for a ball grid array device. 2. Description of the Related Art The central processing unit (CPU) of most computers is generally used with an integrated circuit socket for establishing electrical connection with a computer motherboard. Because most commercially available integrated circuit sockets comply with a certain standard, they are only suitable for use with specific types of central processing units. In other words, due to differences in the specifications of central processing units made by different manufacturers, current central processing units are not adopted for use with a wide variety of integrated circuit sockets, thereby inconveniencing computer manufacturers. In addition, pin grid array (PGA) packaging currently employed for central processing units is being gradually replaced by ball grid array (BGA) packaging. Since BGA devices generally adopt surface mounting techniques for installation on a circuit board, replacement after installation is often difficult to conduct. Moreover, it is difficult to inspect visually and repair poor connection between a BGA device and a circuit board after the former has been mounted on the latter.	{ "pile_set_name": "USPTO Backgrounds" }
Introduction {#sec1-1} ============ What was known? A fixed combination of an antimicrobial and retinoid is effective in the management of mild to moderate acne. Nadifloxacin, an antimicrobial and adapalene, a retinoid have frequently been used separately by dermatologists in the management of acne. A fixed combination of an antimicrobial and retinoid is effective in the management of mild to moderate acne. Nadifloxacin, an antimicrobial and adapalene, a retinoid have frequently been used separately by dermatologists in the management of acne. Acne vulgaris is a chronic inflammatory dermatosis which is notable for open and/or closed comedones (blackheads and whiteheads) and inflammatory lesions including papules, pustules, or nodules.\[[@ref1]\] It is the most common problem among both males and females, between puberty and 30 years and greatly affects the quality of life (QoL) life and psychosocial development.\[[@ref2]\] The update from global alliance to improve outcomes in acne supports the use of fixed combination of topical retinoid and topical antibiotic (Level 1 evidence) with the combination being the first choice in the treatment of mild to moderate acne.\[[@ref3]\] The India acne alliance consensus document also recommends that a combination of topical retinoid and topical antimicrobial be employed early in the treatment of mild to moderate acne.\[[@ref2]\] Nadifloxacin, a topical fluoroquinolone, is reported to have potent action against P. acne, S. epidermidis and methicillin-resistant Staphylococcus aureus (MRSA), with no cross-resistance with any other antibiotic or with another fluoroquinolone. Previous studies have reported that topical application of nadifloxacin cream exhibited excellent efficacy and tolerability, and did not induce resistance in P. acnes strains.\[[@ref4][@ref5][@ref6][@ref7]\] Adapalene, a topical retinoid is known to modulate keratinization and possesses anti-inflammatory action.\[[@ref8]\] Previous studies have reported adapalene to be safe and well tolerated as compared with other retinoids.\[[@ref9][@ref10][@ref11]\] The present study evaluated the efficacy and safety of the topical premixed formulation of nadifloxacin 1% and adapalene 0.1% in the treatment of acne vulgaris. The study protocol was approved by respective Institutional Ethics Committees and Independent Ethics Committee (Ethics R U, Mumbai, for the sites other than institutional sites) and was conducted in accordance with the Declaration of Helsinki and good clinical practice guidelines. The clinical trial registry (CTRI) number of the study is CTRI/2013/05/003616. Materials and Methods {#sec1-2} ===================== Male or female subjects (≥12 years) suffering from mild to moderate acne on the face, with mixed non-inflammatory comedones and inflammatory papulo-pustular lesions were enrolled in the present study. Subjects with known hypersensitivity to individual ingredients or any other closely related agent from quinolone or retinoid class, those suffering from severe acne requiring systemic drugs for management or any severe concomitant diseases, patients receiving any systemic antibiotics during two weeks prior to study, pregnant women and nursing mothers were excluded from the study. This was an 8 week (Sep 2010-May 2011), non-randomized, open-labeled, prospective study conducted at five centers (B J Medical college and Civil Hospital, Asarwa Ahmedabad, Mukhi Skin Clinic Nagpur, Rajiv Gandhi Medical College and Chhatrapati Shivaji Maharaj Hospital, Kalwa, Thane, M. S. Ramaiah Medical College, MSR Nagar, Bangalore, and Lokmanya Tilak Municipal General Hospital and Lokmanya Tilak Municipal Medical College Mumbai) across India. The study consisted of three follow up visits- end of week 2 (Day 14 ± 2), end of week 4 (Day 28 ± 2), and end of week 8 (Day 56 ± 2). All subjects were screened after obtaining a written informed consent for participation in the study. Eligible subjects were asked to apply 1% nadifloxacin and 0.1% adapalene gel (manufactured by Wockhardt Ltd, Aurangabad, Aug 2010, batch no: SSD (546)-03-09, expiry: July 2012) over the affected area of the face once daily in the night after washing face and before going to bed. The drugs were supplied by the investigator. The efficacy parameters were evaluated at each visit. At the end of week-8, the subjects were also investigated for laboratory parameters - complete blood count (CBC), liver profile \[Serum Glutamic Oxaloacetic Transaminase (SGOT) and Serum Glutamic Pyruvate Transaminase (SGPT)\], and renal profile \[Blood Urea Nitrogen (BUN)\] and serum creatinine. The efficacy of the 1% nadifloxacin and 0.1% adapalene gel was evaluated based on the reduction from baseline in the number of non-inflammatory lesions (comedones), reduction in the number of inflammatory lesions (papules, pustules, nodules), reduction in the total number of acne lesions, reduction in the severity of acne as per combined acne severity classification,\[[@ref12]\] and improvement in global assessment scale of acne toward normal clear skin. For this study, 30 subjects were planned to be enrolled at each center to arrive at a sample size of 100 analyzable subjects. Descriptive statistics was used for demographic variables. For total, inflammatory and non-inflammatory lesion counts, Friedman test was used for a comparison from baseline. For the comparison of acne severity scores, global assessment score from baseline to end of week 8, gamma statistics was used. Gamma statistics measures the strength of association of the cross tabulated data (baseline and end of week-8 data in this case) with variables when both are measured at the ordinal level. The laboratory parameters were analyzed using Wilcoxon\'s signed rank test. Data was analyzed using SPSS analytic software 9.2, (USA, Enterprise Guide version 4.2). Results {#sec1-3} ======= Overall, 119 subjects were enrolled (Ahmedabad-30, Nagpur-30, Bangalore-30, Thane-18, and Mumbai-11) in the present study. Of these, two subjects were lost to follow-up and one was withdrawn from the study due to "flare-up of lesions" and was considered as a treatment failure. Thus, 116 (97.5%) subjects completed the study. A total of 117 subjects (intention to treat population) were considered for efficacy analysis including the incomplete but evaluable subject who was withdrawn from the study \[[Figure 1](#F1){ref-type="fig"}\]. The baseline demographic characteristics of the subjects are presented in [Table 1](#T1){ref-type="table"}. The age of the patients ranged from 13 to 41 years; a majority were females (60%) and most of the subjects had an oily skin (79%). ![Disposition of subjects](IJD-59-385-g001){#F1} ###### Demographic characteristics of subjects ![](IJD-59-385-g002) A statistically significant progressive reduction in non-inflammatory lesion counts, inflammatory lesion counts, and total lesion counts were seen at the end of week 2, end of week 4 and end of week 8. Reduction and percentage change in acne count from baseline is presented in [Table 2](#T2){ref-type="table"}. ###### Percentage reduction and lesion count analysis at baseline and at end of week 2, 4 and 8 ![](IJD-59-385-g003) Overall, of the 117 subjects, 115 subjects (98.3%) showed improvement. Treatment failure was noted in two subjects (1.7%) as the 1% nadifloxacin and 0.1% adapalene gel did not work effectively. A progressive reduction in acne severity was also observed. Of the total four subjects with severe acne at baseline, three had severe acne at week 4 (25% reduction) and only one had severe acne at week 8 (75% reduction; P \< 0.001) \[[Table 2](#T2){ref-type="table"}\]. A progressive reduction in physician\'s global assessment scores of acne severity was noted (P \< 0.001 for within group comparison at week 8 with respect to baseline, [Figure 2](#F2){ref-type="fig"}). The laboratory parameters at the baseline and at the end of week 8 did not show any clinically significant difference. ![Global Assessment of Acne Severity at baseline and at weeks 2, 4 and 8 (\Indicates P* \< 0.001 for within group comparison at week 8 with respect to baseline) (Total 117 subjects \[ITT\] were evaluated)](IJD-59-385-g004){#F2} All AEs reported in the study were mild to moderate in severity. Overall, 24 AEs were reported from three centers (15 subjects). No serious adverse events (SAEs) whether expected or unexpected were reported from any participating centers \[[Table 3](#T3){ref-type="table"}\]. The most frequent AE was application site dryness. ###### AEs observed during the study ![](IJD-59-385-g005) Discussion {#sec1-4} ========== The results of the present study demonstrate a significant reduction in both the inflammatory and non-inflammatory acne lesions over an 8-week period of treatment with a fixed dose combination of 1% nadifloxacin and 0.1% adapalene gel. This reduction in the total acne lesions over the entire treatment period correlates well with the simultaneous decrease in the severity of acne. Thus, by the end of 8 weeks, 74% of the patients were in the mild severity acne group with 71.5% of the patients having their score approaching to that of normal healthy skin by the end of week 8. Similarly, progressive reduction in acne severity (69.2%) and physician\'s global assessment score for acne severity (75.0%) at the end of week 8 was also noted. Acne vulgaris is a chronic inflammatory disease with a complex pathogenesis. As multifactorial effects are demanded from acne therapy, combination therapy is often recommended.\[[@ref13][@ref14]\] According to recent guidelines regarding acne therapy, oral antibiotics should not be used alone, and combination with a topical retinoid is highly recommended in cases of an inflammatory disease. Topical retinoids target the microcomedones, which are the precursor of acne lesions, and are the preferred drugs for maintenance therapy. Adapalene is a third-generation topical retinoid, which is safe, efficient, well tolerated.\[[@ref15][@ref16]\] Adapalene is a synthetic naphthoic acid derivative with retinoid activity, and it interacts with unique receptors because of its different chemical structure as compared with other retinoids. This property makes adapalene a potent modulator of cellular differentiation, keratinization, and inflammatory processes.\[[@ref17]\] Several published studies have established the efficacy and safety of nadifloxacin in the management of acne.\[[@ref18][@ref19][@ref20]\] A combination of retinoid and an antibiotic is effective in acne patients as antibiotics can penetrate up to deeper layers of skin given their property of comedonal drainage (which facilitates the penetration of other topical agent) and the thinning effect of retinoids on stratum corneum.\[[@ref2][@ref21]\] Nadifloxacin is a synthetic bactericidal fluoroquinolone with a broad spectrum antibacterial activity against aerobic Gram-positive and Gram-negative and anaerobic bacteria, including P. acnes and S. epidermidis.\[[@ref5][@ref6][@ref20]\] In recent years, antibiotic-resistant propionibacteria have been isolated with increasing frequency and carriage of resistant strains has been associated with antibiotic treatment failure.\[[@ref22]\] A systematic review identified 12 studies that investigated the presence of resistant P. acnes in the skin of people who had received topical or systemic antibiotics.\[[@ref23]\] Nadifloxacin, by virtue of its proven potent action and tolerability and relative newness, is a newer alternative to clindamycin for the management of acne. A 10-year surveillance study (n = 4274) in the UK found that resistance of P. acnes to erythromycin and clindamycin increased from 34.5% in 1991 to 55.5% in 2000 (peaking at 64% in 1997).\[[@ref24]\] Such high risk of antibiotic resistance necessitates the search for newer potent antibiotics that can be judiciously combined with retinoids to ensure better efficacy. Several published studies have established the efficacy and safety of nadifloxacin in the management of acne.\[[@ref18][@ref19][@ref20][@ref25]\] A comparative analysis of the efficacy and safety of the combination of antibiotic and retinoid (adapalene) with adapalene monotherapy in patients with moderate to severe acne showed that the combination therapy led to a significantly greater reduction in the number of acne lesions after 8 weeks than adapalene monotherapy. The combination therapy improved inflammatory acne earlier than adapalene along with a 40% reduction in the lesions by week 2 with the combination compared to about 19% reduction with adapalene alone.\[[@ref26]\] Similarly, the results of the present study show 98.2% reduction in the lesions by the end of week 8. In the global assessment score for acne severity, an aggravation in acne severity was observed at week 2 among the patients with score 5. This could be due to the unmasking of underlying micro-comedones caused by adapalene in the combination. Initial flare up of acne is a common observation with retinoids. In the present study, only 15 subjects reported 25 AEs, which were mild to moderate in severity. Thus, the results of the current study have demonstrated that once daily use of fixed dose combination of 1% nadifloxacin and 0.1% adapalene gel is a safe and well-tolerated topical treatment for mild to moderate acne. In conclusion, the combination of nadifloxacin (1%) and adapalene (0.1%) has been found to be effective in the treatment of mild to moderate acne with good tolerability. However, the lack of a control group and non-comparative design of study limits the utility of these results. We cannot also deny any bias in the study due to its open labeled design. These findings should be considered as preliminary findings and further research is needed in the form of well-designed, adequately powered trials with a control group to understand the efficacy of fixed combination of nadifloxacin (1%) and adapalene (0.1%) treatment in Indian subjects. What is new? Though these two products are being used separately in the management of acne, this is the first time that this fixed combination is formulated and evaluated in Indian patients The fixed combination of adapalene (0.1%) and nadifloxacin (1%) could be a safe and effective treatment for mild to moderate acne vulgaris. "All authors participated in analysis and interpretation of data and critical revision of the manuscript. The authors acknowledge Knowledge Isotopes (professional medical writing company, [www.knowledgeisotopes.com](htt://www.knowledgeisotopes.com)) for writing this manuscript and subsequently revising the draft by incorporating author comments." Source of Support: This Study was supported financially by Wockhardt Ltd, Mumbai Conflict of Interest: Authors BJS, TKS, RSD, RGT, VV, and JIM have received research funding for the conduct of this trial from Wockhardt Ltd, Mumbai. Authors GK, PPA are employees and are stake holders by means of salaries at Wockhardt Ltd, which sponsored the study.	{ "pile_set_name": "PubMed Central" }
--- author: - title: Making Use of Affective Features from Media Content Metadata for Better Movie Recommendation Making ---	{ "pile_set_name": "ArXiv" }
While the decision to adopt 2011's population statistics can be debated and argued over, as done so by Karnataka chief minister Siddaramaiah, who urged his south Indian counterparts to resist, to give it political colour is not healthy A lot has been written about the North versus South divide since the constitution of the 15th Finance Commission. Several commentators have argued that one of the terms of reference (ToR), which mandates that figures from the 2011 Census be used instead of the 1971 Census, will benefit north Indian states at the expense of their south Indian counterparts. This is a departure from the ToRs for previous Finance Commissions which made recommendations on the basis of the 1971 Census. It's being argued vociferously that such a move creates a clear divide between southern states, which have adopted population control measures, and north Indian states which have burgeoning populations because they failed to implement family planning measures. As per the 2011 Census, the south Indian states will receive a smaller chunk of central revenues on account of their low population growth. While the fairness of adopting 2011 population figures for devolution of funds can be argued on economic grounds, to suggest that such a move is politically motivated and intentionally discriminatory against southern states is stretching it a bit too far. To begin with, at Para 7 (ii), the ToR notes that the Commission may consider efforts and progress made towards achieving replacement rate of growth. Clearly, this works in favour of many south Indian states and has been duly reported. Most south Indian states have achieved replacement rate of growth and this ToR will actually work in favour of these states. Also, contrary to what is being argued, nothing in the language of this reference suggests that states which have already achieved the replacement rate of growth will not benefit and that only those states which are moving towards it will stand to gain. The 14th Finance Commission had specifically taken note of this issue and was of the view that the population figure for 2011 is a better criteria. Page 97 of the report noted: "Though we are of the view that the use of dated population data is unfair, we are bound by our ToR and have assigned a 17.5 percent weight to the 1971 population." By "dated population data", the commission was referring to figures from the 1971 Census. In fact, for purposes of grants to local bodies, the Commission recommended the use of 2011 population figures to determine grants to each state and also gave a 10 percent weightage to 2011 figures for horizontal devolution of central taxes. It is clear from a reading of the report that there is a strong economic rationale for adopting 2011 population figures as criteria for determining devolution of funds. This is not to deny that opposing arguments are not worthy of consideration and deserve acknowledgement. However, given the repeated assertion by the last Finance Commission on the unfairness of using 1971 data can be seen as sufficient evidence of the apolitical reasoning behind the move. This is further proved by the fact that contrary to what is being argued, this policy measure is likely to create winners and losers on either side of the Vindhyas and has no exclusive beneficial impact on the northern states to the exclusion of those from the South. A look at the report of the 14th Finance Commission puts things in perspective and refutes any such claims with substantial authority. Annex 8.1 of the report also provides responses of all states on this question of choosing 1971 population figures over 2011's figures. Several states from the North actually wanted the population figures of 1971 to be the basis and not 2011. These states include Jammu and Kashmir, Himachal Pradesh and Punjab. From the West, both Maharashtra and Goa were in favour of census data of 1971 as opposed to 2011. So clearly, a switch to 2011 will not sit nicely with the interests of these states who may also lose out on quantum of devolved funds, even though they are not situated in the southern part of the country. Punjab's share, for instance, as per the 2011 Census, was at 2.330 percent as compared to 2.495 percent as per 1971 Census, as reported in Annex 8.2 of the report. On the other hand, Telangana's share actually increased from 2.913 percent to 2.956 percent going by the 2011 Census. In the world of policy making and implementation, it is almost axiomatic to assert that every policy creates some winners and some losers, and the move to use the 2011 Census figures instead of 1971 Census is no different. It's clear that the move creates winners and losers in pretty much every part of the country and therefore cannot be said to be targeted specifically at south Indian states. To reiterate, while the decision to adopt 2011's population statistics can be debated and argued over, and will no doubt be highlighted before the 15th Finance Commission as well — as done so by Karnataka chief minister Siddaramaiah, who urged his counterparts in Andhra Pradesh, Tamil Nadu, Kerala and Puducherry to resist — to give it a political colour and claim it to be an exercise in discrimination is not healthy. Such pernicious presentation sows seeds of discontent among south Indian states, which are not founded in rational analysis. The author is a master in public policy candidate at LKY School of Public Policy, National University of Singapore	{ "pile_set_name": "OpenWebText2" }
Ricordare gli uomini e le donne che durante la dittatura nazi-fascista e in altre situazioni drammatiche di guerra, persecuzione e violazione di diritti umani, hanno scelto la strada della solidarietà e del coraggio è il senso della Giornata europea dei Giusti istituita nel 2012, ribadito anche dalla recentissima legge del Parlamento italiano che ha dichiarato il 6 marzo “Giornata in memoria dei Giusti dell’umanità”. Se l’Italia è il primo Paese ad aderire ufficialmente alla Giornata europea dei Giusti, il Comune di Rimini attraverso il progetto di Attività di Educazione alla Memoria già da diversi anni promuove il valore della scelta politica e morale di ogni individuo ha la possibilità di compiere, anche in situazioni estreme come le dittature e le guerre. Nel 2014 il Comune di Rimini ha creato all’interno del Parco XXV aprile un giardino dedicato ai Giusti del proprio territorio, erigendo un monumento in memoria di Ezio Giorgetti (albergatore di Bellaria) Osman Carugno (maresciallo dei Carabinieri) e Guido Morganti (sarto di Cattolica), nominati Giusti fra le Nazioni dallo Yad Vashem di Gerusalemme e che insieme ad altri cittadini della Romagna e del Montefeltro dall’autunno 1943 fino ad ottobre 1944 salvarono decine di famiglie ebree in fuga dalle deportazioni verso i centri di messa a morte. Grazie alle ricerche effettuate dagli storici, tra cui Liliana Picciotto per il CDEC (Centro di Documentazione Ebraica Contemporanea) – che per prima ha ricostruito la vicenda – e Patrizia Di Luca per l’Università di San Marino, è stato possibile accertare che tra Bellaria, Cattolica-Gabicce e Mondaino, 41 ebrei jugoslavi e 13 ebrei mantovani e ferraresi, furono salvati da morte sicura dal coraggio di semplici cittadini che di fronte all’emergenza di vite in pericolo non esitarono a prestare soccorso in ogni modo, coinvolgendo amici e concittadini nell’azione di salvataggio e rifugio. Il programma delle iniziative Un ricco programma di iniziative celebrerà i Giusti a Rimini, coinvolgendo gli studenti delle scuole cittadine e l’intera città attraverso conferenze e proiezioni a tema, incontri e dibattiti. A causa delle condizioni meteo avverse degli ultimi giorni, sono stati rinviati i primi due appuntamenti in calendario, inizialmente previsti per domani, giovedì 1 marzo: slitta infatti a giovedì 12 aprile l’incontro con Liliana Picciotto, fra le più importanti storiche italiane della Shoah che alla Sala del Giudizio del Museo della Città presenterà le sue ricerche sugli ebrei italiani che si salvarono dalle deportazioni, ispirandosi al suo recente libro “Salvarsi. Gli ebrei d’Italia sfuggiti alla Shoah, 1943-1945” (Einaudi, 2017). Se due terzi della comunità ebraica italiana poté sfuggire alle retate non fu solo per la bontà di quei cittadini che diedero loro rifugio e protezione, ma per ragioni complesse di cui la ricercatrice discuterà alla presenza di Laura Fontana, responsabile per l’Attività di Educazione alla Memoria del Comune di Rimini, Antonio Mazzoni, dell’Istituto storico per la Resistenza di Rimini e Patrizia Di Luca, dell’Università degli Studi di San Marino. Rinviata anche la visita degli studenti della Scuola Dante Alighieri di Rimini che saranno ricevuti in Consiglio Comunale venerdì 9 marzo dalla Presidente Sara Donati e da una rappresentanza di amministratori comunali per presentare il frutto delle loro ricerche sui Giusti del territorio ma anche per condividere le loro riflessioni sul valore politico-morale di comportarsi da giusti nel presente. Un’occasione preziosa, fortemente voluta dalla stessa Presidente Donati che ha seguito tutto il lavoro di studio degli studenti, per aprire un dialogo tra giovani e adulti e sottolineare la vicinanza tra generazioni nel tenere vivo l’impegno della memoria storica e della sua declinazione in azioni concrete nel presente. Martedì 6 marzo, Giornata in memoria dei Giusti dell’umanità, alle 11 si terrà la cerimonia solenne al Giardino dei Giusti all Parco XXV Aprile, alla presenza dei rappresentanti delle istituzioni e associazioni cittadine e di una rappresentanza di studenti. Nel pomeriggio alle 16.15, la dottoressa Patrizia Di Luca terrà una conferenza dal titolo “Rispondere al male con coraggio e solidarietà. Le donne ricordate nella Giornata dei Giusti”. L’incontro rientra tra gli appuntamenti di un seminario di formazione per gli insegnanti promosso dall’Istituto storico per la Resistenza, ma è aperto alla cittadinanza e a tutti coloro che sono interessati.	{ "pile_set_name": "OpenWebText2" }
Q: Error(6,1): PLS-00103: Encountered the symbol "CREATE" Hi friends i am gettting this error my query is i tried by applying / after declaration of package Create or Replace Package PACKAGE1 as TYPE Page is REF CURSOR; Procedure GetPage(PageSize IN int, PageIndex IN INT, PageData OUT Page); End PACKAGE1; CREATE OR REPLACE package body PACKAGE1 as Procedure GetPage(PageSize IN int, PageIndex IN INT, PageData OUT Page) IS FirstIndex int; LastIndex int; BEGIN LastIndex := PageSize * (PageIndex +1); FirstIndex := LastIndex - PageSize +1; Open PageData for Select * from ( select a., rownum as rnum from (select from MyTable) a where rownum <= LastIndex ) where rnum >= FirstIndex; END GetPage; END PACKAGE1; A: As the commentators pointed, '/' is need for both CREATE statements. Create or Replace Package PACKAGE1 as TYPE Page is REF CURSOR; Procedure GetPage(PageSize IN int, PageIndex IN INT, PageData OUT Page); End PACKAGE1; / CREATE OR REPLACE package body PACKAGE1 as Procedure GetPage(PageSize IN int, PageIndex IN INT, PageData OUT Page) IS FirstIndex int; LastIndex int; BEGIN LastIndex := PageSize * (PageIndex +1); FirstIndex := LastIndex - PageSize +1; Open PageData for Select * from ( select a., rownum as rnum from (select from MyTable) a where rownum <= LastIndex ) where rnum >= FirstIndex; END GetPage; END PACKAGE1; /	{ "pile_set_name": "StackExchange" }
June 30, 2017 Today, medical doctor in family practice Henry Bello injured six and murdered one at Bronx-Lebanon Hospital. When cornered by the police, he killed himself. Two years ago that medical facility had fired him. Was that the stressor which turned him from a seemingly troubled professional to one of those monsters pursued on "Criminal Minds?" And what should employers be re-thinking about their termination policies? Carnage by former employees who had been axed is becoming too frequent in the media headlines. Bello had shown signs of mental instability even before whatever precipitated his firing. In 2004 and 2009 there had been arrests. Details are sketchy but sexual misconduct seems to have been involved. Those arrests are big red flags. Why would a highly credentialed professional with so much to lose allegedly give in to such a lack of impulse control? A lot invested in a career is often what keeps human beings on the straight and narrow. If the hospital had been aware of that record, what could its human resources, security and legal departments have done differently in the termination process to prevent today's tragedy? Even for more emotionally centered professionals, the loss of a job can trigger a downward trajectory. They may never be able to put together The Next. In response, their mindset could come to mirror that of the king in Shakespeare's drama "King Lear." They perceive themselves as more sinned against than sinning. Attacking whatever seems to them to make sense. May the loved ones of the unemployed reach out to them during this long long weekend. Unfortunately, they have too much time to think about the past and perhaps too little hope about the future. In The Atlantic, Peter Beinart attempts to pack the complex Donald Trump into The Grudge Box. That need to take action on his enemies characterizes him, posits Beinart. Well, that also applies to so many of us who grew up on the mean streets of urban areas like 1950s Jersey City, New Jersey. For us that was The Old Neighborhood. The nostalgia for it hangs heavy because it was a place where justice was swift, effective and forever. No one who grew up there ever considered becoming a lawyer or a cop. Punk Joe from the O'Brien family on Bay Street in downtown Jersey City puts the moves on the Maria from the Balasco family. Joe gets badly roughed up. To today, the O'Briens and the Balascos find reason to make trouble for each other. That's even though they currently live on different continents. Trump came of age in a higher-income version of Jersey City - Queens. In those days it still operated like any of the millions of urban neighborhoods. The ethos there, I would assume, called for immediate punishment for crimes such as parking in front of your neighbor's house. After the windshield was broken, the two parties never talked again. To generations growing up in suburbs, The Grudge wasn't part of their value system. They were socialized to handle things through proper channels and then move on. That's what the Anderson family did on the popular national television program "Father Knows Best." Head of the household Jim didn't tell his son to round up bats and they'd go after the thugs who allegedly stole bicycles from the backyard. What would have taken place was a cordial visit from a police officer. The episode might end with the younger daughter Kitten declaring around the dinner table (which prefigured the one in "Blue Bloods") that she wanted to join the police force. Everyone smiles. No grudges. Many of us, including Trump, reloated from The Old Neighborhood. But embedded in us might still be that notion of how conflicts get resolved. Click on the link and the Grabein News covers the speculations that the president of the United States - Donald Trump - is, yes, crazy. And becoming more so. There is even the phrase "criminally insane." The Drudge Report is #2 in digital media. It knows its influence. The question we have is if this headline was meant to be straight reporting. Or are the gang at the Drudge Report smirking about those who invest their time playing psychiatrist in public. After all, that's crazy to do. An authentic psychiatric diagnosis entails a series of in-person interviews. We bore witness to plenty of those on the old crime shows such as 'Law & Order." Dr. Emil Skoda would sit down with the defendants to make a determination about their grasp of reality. But even he makes mistakes. In a recent rerun he told the court that the oncologist being tried for murder was feigning mental illness. Turns out she wasn't. In their heyday, the gossip publications such as Globe leveraged the tactic of a crazy smear - based only on the opinion of a supposed mental health expert who had never met the person. Also, first year majors in psychology would make it their business to put negative labels on personalities in the news. And the many in psychotherapy would take on the role of therapist, informing their inner circles about their mental health problems. My hunch is that Matt Drudge et al. at this news site is too smart to take seriously the crazy talk. The behavior necessary to get and hold power may appear irrational. But every aspect of it might have an agenda. "Blue Bloods" started in September 2010. It has been renewed for another season. Yet there are aspects of the series which just aren't credible. At the top of the list is that the youngest son in the Reagan family - Jamie - would work as a cop. He had earned a JD from Harvard Law School and has the student loan debt to show for it. In one episode he was moonlighting painting houses because he couldn't make ends meet. Yes, being a New York City cop is the family business. But, come on, it seems bizarre that Jamie would not follow his sister Erin into the career path of practicing law. She is a prosecutor. In a future episode, Jamie should be pushed by a love interest to see a therapist about this strange career option. In digging around his psyche Jamie might discover that he is trying to fill the gap his brother Joe left. When Joe was doing an undercover assignment he was murdered. The family hasn't gotten over that. Post-therapy, it would be interesting if Jamie joins a law firm as a criminal defense lawyer. In his memoir 'Nevertheless," Alec Baldwin recounts that he assumed that he was going to become a lawyer. That was when he left New York and enrolled in George Washington University in D.C. His grandfather Alexander Baldwin had been an assistant DA in Brooklyn. Baldwin adds that gramps had been indicted for allegedly taking a bribe. Although acquitted, he was disbarred. Quickly he lost everything and turned to drink. Perhaps that negative family legacy was what provided the wiggle room in Baldwin's career planning. When doing some acting at GW, he had the epiphany that finally he found heaven. Up until then, he was just another lost soul from a dysfunctional low-income family. He transferred to New York University. That had and still has a well-respected acting program. Just when he was running out of money at NYU, the universe smiled on him. From nowhere, he was invited to audition for the the part of cad on the soap opera "The Doctors." Since audiences prefer cads over good guys, that was exactly the break Baldwin needed. As they say, the rest is history. What Baldwin hammers early in the memoir is how his Dickensian childhood shaped the personality traits he needed to be a first-rate actor. For example, he took refuge from the unhappy house inside himself. There, he could inspect his feelings. Another refuge was watching plenty of television. He also lived inside the small screen. In addition, he got it that he had to run his own show. Both his parents were ineffectual. The book is a useful read for anyone who can't ferret out purpose in their pain. The Drudge Report has swung right again. For several months it has been cooler or even critical of the Trump Administration. Today it headlines with the news that two bills passed the House which will make it tougher for illegal immigrants. One has the catchy moniker of "Kate's Law." That honors Kate Steinle who had been murdered by illegal immigrant Juan Lopez-Sanchez. Repeatedly he had been deported from the U.S. but kept re-entering. Kate's Law would impose stiffer penalties for re-entry after deportation. The other bill would yank federal grant to states and other locations which provide sanctuary to illegal immigrants. That is a pocketbook issues that many states can't afford to play around with. Of course, the House passage of these two bills is a solid victory for the Trump Administration. In itself it can reinforce support for his policies and lead a lot of folks to ignore his Twitter rants. Anyway, those digital temper tantrums have been so standard that mostly it is only the members of the the media who pay attention to each and every one. Come on, hasn't it become irrelevant that late night show comics continually focus their monologues on what the Trump Administration did or did not do that day? So what that he's not "presidential." If Trump can give the majority of Americans what they want the crazed side of him will be shrugged off. That's how political machines get voted in and hold on to power. The idealistic should read the history of Hudson County, New Jersey. There the head of the machine, Frank Hague, declared he was the law. He was. And, at the time Hague got away with it. He built the area a brand new maternity hospital he named after his mother Margaret Hague. Can the Trump Administration also get away with being the law? Time will tell. June 29, 2017 There was a magic at Fox News in the era of media genius Roger Ailes. Let's forget for now his alleged negative personal behavior with employees. On air personalities such as Greta Van Susteren and Megyn Kelly became stars and sustained that high wattage. Both have legal backgrounds which usually don't make for a powerful connection with audiences. But thrive the two did. That was then. Now, Van Susteren announced on Twitter that she is "out" at MSNBC. She fled there after Ailes, whom she supported, was squeezed out. There were four months between jobs. Then she joined MSNBC. Currently its rankings are on an upward trajectory. However, that momentum didn't help Van Susteren. In her six months at MSNBC, her show couldn't pull out in front of her competition on CNN and Fox News. Here are the details from the Daily Mail. Since she is 63 - old in television time - she may have difficulty finding another on air spot. Television can be especially cruel to females. Meanwhile, at NBC, Kelly has failed to catch on in prime time (7:00 P.M. Sunday). In the four weeks that her "Sunday Night" has been on, the ratings keep declining each week. She can't pull ahead of '60 Minutes" and "America's Funniest Home Videos." The problem, I have a hunch, is that Kelly can't make the transition from a partisan cable venue to an old-line network. Kelly's on air persona seems too glam, too blonde, too distant and unable to enter the homes of the audience. At Fox News, Ailes had invented the formula of the beautiful blonde with the long longs as on air personality. Back then it worked. But times change. Also, these two former celebrities have changed their channel, literally speaking. My prediction is that Kelly will fare even worse in the 9 A.M. slot in the fall. She's not the kind of person we want to share our second cup of coffee with. Is the unthinkable thinkable now: Kelly could get the boot from NBC? That could be possible, couldn't it? She also is no spring chicken. She could always return to practicing law, as can Van Susteren. Kelly had been an associate at the high-profile law firm Jones Day. Or both can teach media law at a law school. In his concurrence on "U.S. v. Perez-Silvan," 9th Circuit Judge John Owens leverages a reference to pop culture. Specifically it was to locating the Well of the Souls in "Raiders of the Lost Ark." Here are details from lawyer-journalist Kathryn Rubino at Abovethelaw.com. But, others in the legal sector who don't have Owens' title and power should be aware of the risks involved with the use of pop-culture allusions in the procedure-bound, traditional context of law. Such a creative act, without solid justification, could be perceived as inappropriate - even disrespectful. The legal sector is not the only profession in which this practice could get the "Mad Man" type in the soup. Even in the communications departments of corporations, it could be frowned on. That happens often when the head of the group and those above feel threatened about job security. There will be a rigid sticking to the old-line rhetoric. Where pop culture references and images are usually welcome are in some kinds of marketing. That gets proved out in A/B testing. For example, the message of the email blast is that the content creator is focused on outcomes, that is, leading the prospect to take the Call To Action (CTA). Not posting beautiful prose. That is reinforced with the analogy that the creative is a "Mad Man," not a William Shakespeare. Yes, there will be a 'Mad Men" visual posted in the email. Framing the pitch in that manner frequently brings in more business than sales material without a play on pop culture. But, that's marketing per se. And it's only in certain niches. In other contexts, it's smart to calculate the risk before alluding to a film, television program, comic book series or song. A few years ago I cited a hit television show to some money men at a social gathering. Both snapped that they "didn't have time for that." Sure, social media has made it seem like all communication is an anything-goes. But that assumption is way off. As many had learned in Freshman Composition in college, the tone, modes of persuasion, organization and length depend on who the audience is. What also has to be factored in is who you are. Those without title, power and influence tend to err on the side of caution. The Drudge Report beat out Fox News, HuffPost, The New York Times and The Wall Street Journal in digital rankings. The most recent metrics - May 2017 - indicate that the Drudge Report is #2 in digital page views. Only MSN is ahead of it. What is still winning the clickbait game is the Drudge tabloid formula of presenting news. Gone is the flashing blue light which used to signal that a news item was supposed to be big. But there are the quickly changing headlines in the center of the layout which scream bad or supposedly shocking developments. On the left hand corner are sub-headlines which also are intended to make us miserable that day. The rest of what is curated ranges from the scary to the bizarre. It, too, is regularly updated. What should cause special alarm appears in red ink. And, heck, who cares about objective. During the Campaign 2016 debates Drudge ran a poll for readers to vote on who won. Since it's a conservative news site, of course, those voting tilted right. The voting results showed that. For instance, Donald Trump did way better than Hillary Clinton. But Drudge provided no disclaimer to explain that. In general, in digital, the non-branded keywords which attracted the most eyeballs during May 2017 were: trump Donald trump chris cornell north korea Ariana grande james comey covfefe manchester The takeaway here is obvious: Those wanting eyeballs should simplify the content and embed a theatrical tone. In short, don't get too sophisticated. That really never sold in the U.S. of A. "Cardinal George Pell, 76, is chief financial adviser to Pope Francis and the highest ranking Vatican official to be charged in the church's ongoing sex abuse scandal that goes back decades." Pell has been based in Australia. And he will appear on these charges on July 18 for a hearing in Melbourne, Australia. He is due to make a statement tomorrow. It had been the Boston Globe which broke the story of sexual abuse of young boys by Boston Metro Catholic priests in 2002. Among the priests outed had been John Geoghan. In prison, he had been murdered. That coverage generated a global crisis as other cases of sexual abuse were disclosed. The Roman Catholic Church had once been among the most enduring global brands. Continually, it is losing market share. There had been optimism that the man of the people Pope Francis could restore trust in that institution. Initially, he was a charmer. But he was unwise in embracing too many causes and supporting them with aggressive rants. He also turned off powerful conservatives in the U.S. when he attacked capitalism. They could have been influential supporters. Also, Pope Francis hasn't brought the old-line policies such as no women priests into the 21st century. With this latest development, since it is associated with the Vatican, there will be further tarnishing of the global Roman Catholic brand.	{ "pile_set_name": "Pile-CC" }
Changes in the expression of matrix extracellular genes and TGFB family members in rotator cuff tears. Lack of synthesis of extracellular matrix compounds may contribute to degeneration of the tendons. Thus, we aimed to evaluate the expression of extracellular matrix and TGFB family members in ruptured and non-ruptured tendons of the rotator cuff, as well as the effect of clinical factors on gene expression in tendon samples, and the relationship between histological findings and altered gene expression. Injured and non-injured supraspinatus tendon samples and subscapular non-injured tendon samples were collected from 38 patients with rotator cuff tears. Non-injured supraspinatus tendons were obtained from eight controls. Specimens were used for histological evaluation, quantification of collagen fibers, and mRNA and protein expression analyses. Increased COL1A1, COL1A2, COL3A1, COL5A1, FN1, TNC, and TGFBR1 mRNA expression was observed in the tear samples (p < 0.05). Duration of symptoms was correlated with the levels of collagen type I/III fibers (p = 0.032; ρ = 0.0447) and FN1 immunostaining (p = 0.031; ρ = 0.417). Smoking was associated with increased frequency of microcysts, myxoid degeneration, and COL5A1, FN1, TNC, and TGFB1 mRNA expression (p < 0.05). FN1 immunostaining was correlated with the number of years of smoking (p = 0.048; ρ = 0.384). Lower levels of collagen type I/III fibers were detected in samples with fissures (0 = 0.046). High frequency of microcysts was associated with increased COL5A1, FN1, and TNC expression (p < 0.05, for all comparisons). Neovascularization was associated with reduced FN1 (p = 0.035) and TGFBR1 expression (p = 0.034). Our findings show differential expression of matrix extracellular genes and TGFB family members in the degeneration process involved in rotator cuff tears. These molecular alterations are influenced by clinical factors. © 2018 Orthopaedic Research Society. Published by Wiley Periodicals, Inc. J Orthop Res 36:2542-2553, 2018.	{ "pile_set_name": "PubMed Abstracts" }
Amplified spontaneous emission (ASE) noise is one of the main noise sources in optical amplifiers. ASE is initiated by spontaneous decay of electrons, creating photons which could travel in any direction. In modern optical amplified systems, after propagating multiple spans, accumulated ASE noise is not negligible compared to wavelength division multiplexed (WDM) signals. For both constant power and constant gain amplifier control, if ASE power is not considered in the total target output power at each network node, a system will take penalty due to lower than expected channel launch power since significant ASE will share the total output power of the amplifier with the WDM signals. With state-of-the-art amplifier control schemes, ASE compensation has been implemented; however, this ASE compensation assumes ASE is evenly distributed across each channel. This assumption was valid for traditional optical networks which include fixed optical add-drop multiplexers. In a normal amplified system, noise across channel is either evenly distributed or filtered down by channelized devices. However, the addition of reconfigurable optical add-drop multiplexers (ROADMs) alters this assumption. ROADMs are a form of optical add-drop multiplexer that adds the ability to remotely and dynamically switch traffic from a WDM system at the wavelength layer. This allows individual wavelengths carrying data channels to be added and dropped from a fiber without the need to convert the signals on all of the WDM channels to electronic signals and back again to optical signals. Referring to FIG. 1, an exemplary embodiment of a micro-electromechanical system (MEMS)-based wavelength-selective switch (WSS) 10 is illustrated. An input fiber including multiple wavelengths λ1, λ2, . . . λn of optical signals is input into a de-multiplexer 11, such as a diffraction grating. The de-multiplexer 11 separates each wavelength from the common input, and optionally a variable optical attenuator (VOA) 14 can be included following the de-multiplexer 11. VOAs 14 are configured to provide variable attenuation to the wavelength, and the VOAs 14 can be remotely and dynamically set to a range of values. The WSS 10 includes a MEMS mirror 12 for each of the wavelengths λ1, λ2, . . . λn. The MEMS mirror 12 is a micro-mirror that deflects the optical signal to an appropriate output port 13. Advantageously, the WSS 10 is fully reconfigurable for adding, dropping, and expressing through optical signals. Since there is a MEMS mirror 12 for each of the optical signals, any signal can be dropped to any of the output ports 13. Additionally, multiple wavelengths including all wavelengths can be dropped to a single port 13, such as an express port. Referring to FIGS. 2a and 2b, WSSs 15,16 are configured to direct each wavelength from a common input port to any one of multiple (e.g., “N”) output ports. To indicate device fan out, these devices are often classified as “1×N” devices, with a “1×9” WSS meaning a 10 port device, with 1 common input and 9 output ports. For example, the WSS 15 is a 1×9 WSS with a common input, eight drop ports, and one express port. The WSS 15 can be utilized at a node where up to eight optical signals need to be dropped, with the remaining optical signals pass through as express signals. Alternatively, the WSS 16 utilizes the same hardware configured for multiple express ports, such as where a node has multiple degree interconnection. Advantageously, the WSS 15,16 provides nodal flexibility to add, drop, and express optical signals with the same MEMS-based hardware. Disadvantageously, MEMS-based WSSs have side-lobes for each channel. The side-lobes are a passband distortion caused by channel attenuation or filter cascading. Currently the designs of ROADM are either based on MEMS tilting mirror array or liquid-crystal modulators (LCM). Note, the passband sag at the edges are possible in both technologies. Furthermore, in practice, both MEMS and LCM devices may require that a finite gap exist between adjacent pixels. The edge effects are known to cause attenuation dependent passband side-lobe. Generally, the side-lobes are located out of signal bandwidth, leading to more noise pass through in the WSS than a traditional system (without WSS), which has an evenly distributed ASE across channel. In this case, even with current ASE migration compensation scheme, the total ASE power can still be under-estimated. When multiple ROADMs are present in a network, the cascading effect will lead the side-lobes to grow along the spans, and the accumulated noise power can increase much faster than traditional flat-noise system. The severe under-estimating accumulated ASE power will cause unexpected signal power drop and lead to OSNR penalty in the system. The OSNR penalty introduced by WSS side-lobes is mainly caused by launching lower than expected signal power into the system along the amplifier chain, due to larger than expected ASE and under-estimated amplifier target power, i.e. side-lobes utilize amplifier power designated for the signal bandwidth. Further, if a WSS is used to realize a dynamic gain equalization (DGE) function in networks, large dynamic range of attenuation on every channel through WSS is needed. Meanwhile, the size of side-lobes of a WSS is dependent on the attenuation of the WSS. Normally, the higher of the attenuation of the WSS, the bigger the side-lobes, and the more unexpected ASE can accumulate along the system. Referring to FIG. 3, graph 19 illustrates a study showing a network of up to 16 spans with a ROADM at every network node (noise figure=9, span loss=20 dB). With a typical WSS side-lobe, when WSS attenuation is set at 0 dB (no side-lobe), 4 dB (typical) and 8 dB (worst case), and assuming all the channels have same attenuation, optical signal-to-noise ratio (OSNR) migration in the network has been calculated. In a typical WSS scenario (i.e., WSS attenuation=4 dB) more than ½ dB OSNR penalty has been observed after propagation through 16 ROADMs; and for the highest attenuation (i.e., 8 dB), more than 4 dB OSNR penalty can be incurred by the system. This study was performed assuming each WSS is working at typical conditions. Alternatively, if the WSSs are working at the worst-case condition in their specification, the system has to take even more OSNR penalty due to the side-lobes. Accordingly, side-lobes due to WSS ROADMs significantly impair network performance, and current systems and methods are inadequate for compensation. Thus, systems and methods are needed to compensate for the OSNR penalty caused by the side-lobe of MEMS-based ROADMs.	{ "pile_set_name": "USPTO Backgrounds" }
There has been well-known heat-sensitive recording materials which utilizing the colorforming reaction between a colorless or pale colored electron donating dye and an organic or inorganic electron accepting compound, in which color images are produced by heating to contact with each other of the electron donating dye and the electron accepting compound. Recently, a considerable progress has been made in the field of heat-sensitive recording systems, and heat-sensitive facsimiles, heat-sensitive printers and the like become possible to make the recording speed very higher. For example, in heat-sensitive facsimiles a recording speed of not more than 10 seconds for a sheet of A4 size can be achieved and in heat-sensitive printers a recording speed of 120 letters per second or more can be achieved. With the improvement of hardware fields as described above, it is required for the available heat-sensitive recording material to be superior in adaptability for a high-speed recording. As means for improving the recording sensitivity of the heat-sensitive recording material, there has been a well-known method in which a heat-fusible material having a melting point lower than that of each of the electron donating dye and the electron accepting compound is added as shown in Japanese Laid-Open Patent Publication No. 34,842 of 1974, Japanese Laid-Open Patent Publication No. 39,139 of 1978 and the like. However, it is difficult to obtain one kind of the heat-fusible material which can dissolve both of the electron donating dye and the electron accepting compound. Further, when two or more kinds of heat-fusible materials are used together, there occurs such a problem as the initiation temperature of developing color is lowered by the depression of melting point owing to the eutectic phenomenon and resultantly the whiteness is lowered. Furthermore, Japanese Laid-Open Patent Publication No. 15,394 of 1981 discloses a method for improving the record sensitivety of a heat-sensitive recording material by finely pulverizing the mixture of an electron donating dye, an electron accepting compound and a heat-fusible material. Japanese Laid-Open Patent Publication No. 69,089 of 1983 or U.S. Pat. No. 4,717,593 discloses a method for producing an improved heat-sensitive recording material in which a horizontal sand mill is used to finely pulverize an aqueous dispersion of an electron donating dye or an electron accepting compound. Additionally, Japanese Laid-Open Patent Publication No. 15, 394 of 1981 teaches that the pulverization degree of dye composition strongly effects upon the recording sensitivity of a heat-sensitive recording material. However, it has been found that any particularly remarkable pulverizing effect can not be obtained even if a fatty acid amide which is a heat-fusible material used in the above methods is pulverized together with the dye with a horizontal sand mill. Further, when the particle size of media used in the horizontal sand mill is relatively large such as 1.0 mm to 3.0 mm, the pulverizing efficiency becomes bad. Therefore, those methods are not practical. The dye, electron accepting compound and heat-fusible material used for producing a heat-sensitive recording material are generally used after pulverizing until the particle size is not more than a few microns. However, as described above, a remarkable improvement of the recording sensitivity is required with the remarkable speed-up of the recording instrument and the like and recently the requirement of the pulverization becomes strong. The object of the invention is, therefore, to provide a method for producing a heat-sensitive recording material and particularly to a method for efficiently producing a heat-sensitive recording material superior in adaptability for a high-speed recording. We have been studied methods for pulverizing the dye which affects the recording sensitivity, particularly methods for simultaneously pulverizing the dye and the heat-fusible material to obtain more improved recording sensitivity. Resultantly, it has been found that a great difference appears in the pulverizing efficiency by the kind of the heat-fusible materials used together with the dye. Particularly, the difference is remarkable in the case of the horizontal sand mill. Further, by widely studying the heat-fusible materials pulverized together with the dye and the pulverizing methods, it has been found that desired mixture dispersions having a volume average particle size of not more than 1.0 .mu.m, preferably 0.5.about.1.0 .mu.m, is obtained efficiently with use of a specific heat-fusible material in the condition of that the heat-fusible material is mixed with a dye dispersion and the dispersion is pulverized with a horizontal sand mill. In this way, the invention has been achieved.	{ "pile_set_name": "USPTO Backgrounds" }
Otological aspects and surgical outcome in a consanguineous family with a novel ANKH gene mutation. To report the hearing impairment in a new autosomal recessive metabolic disorder due to a mutation in the ANKH gene and to report the outcomes of exploratory tympanotomy. Retrospective chart study. Tertiary referral center. One large consanguineous family was examined. Three patients underwent exploratory tympanotomy. Exploratory tympanotomies in three patients. Medical and otological histories; postoperative hearing outcomes. In the patients who received tympanotomies, a postoperative hearing gain of between 5 and 20 dB was noted, with a residual air-bone gap of between 6 and 35 dB (follow-up between 4 and 67 months). The sensorineural component of the hearing impairment varies greatly, between 4 and 23 dB, and this factor might also affect the final hearing outcome. Exploratory tympanotomy might improve the hearing outcome in patients with this syndrome and therefore surgery has a limited audiometric benefit in general. Based on anatomical findings, a congenital origin for the ossicular chain anomaly seems likely. It remains unclear whether the sensorineural component of the hearing impairment is progressive and this should be investigated further.	{ "pile_set_name": "PubMed Abstracts" }
"Thin your paints." "Remember to thin your paints." – Duncan Rhodes "THIN YOUR PAINTS" is far and away the most commonly offered painting-related criticism seen on /tg/, mostly seen in reference to some new Warhammer 40,000 player's fuzzy photographs of his first attempts to paint a model. The second most common appears to be "YOU PUT THE FUCKING PAULDRONS ON THE WRONG WAY ROUND", since new players are inevitably playing Space Marines. Trolling or not, "thin your paints!" is almost always good advice to give a new painter. However, the phrase has reached the point where it gets posted whenever something badly painted is shown on /tg/. THINNING YOUR PAINTS FOR DUMMIES [ edit ] In all seriousness, the most basic paint thinner for your miniature needs is tap water. Really, that's it. Thinner paint basically means lesser consistency. The less the paint's consistency is, the less messy it looks and the easier it is to manipulate while brushing. Alternatively some window cleaner (the blue stuff) works equally well whilst being quicker to dry. The water-to-paint ratio pretty much depends on your preferences and needs; painting a single, normal-sized mini would probably just require you to dip your brush into a cup of water every time you apply a stroke of paint, while painting entire squads or armies may warrant a bit of experimentation with the ratios and the creation of some sizable batches for convenience. Also, note that more water means thinner paint and a longer drying time, and too much water can ruin your paint's consistency entirely, so be careful when thinning large amounts or else you could be wasting time and money. It's a good idea to apply the water to the paint with an eye dropper one drip at a time so you can carefully control how thin it gets. The more intermediate thinners for painting minis are extenders and flow improvers, which are available in most art stores. They'll also cost you quite a bit if you're planning to paint an entire army. But on the upside, those products warrant much better results than ordinary tap water. Regardless of how you choose to thin your paint, an important step people always forget to mention is that you should go on to use your palette to control the amount of paint on your brush. This way, you avoid putting too much paint on the model all at once. As a last resort, you may actually save some of the details of an over-painted mini by using Nuln Oil shader or something similar. Ultimately if you feel like it's not worth the effort, some first aid alcohol and a toothbrush may help you bring your mini back to its unpainted state without destroying it in the process. Alternatively, a good option is Castrol Super Clean (You can even pretend you're manlier than you are and say it's for your car. Look in the automotive section), since it doesn't harm the plastic, and even dissolves super-glue (For those times when you go "Ill just put a little bit here on the ar-FUCK!) Be careful though and wear gloves - it causes blisters. Otherwise you might get hands covered Grandpappy Nurgle's gifts. Alternatively, alternatively, methylated spirits (AKA Denatured Alcohol in the US) is perfectly safe for plastic and metal, and has no real harmful side-effects if occasionally handled with bare hands. It does dry out and crack skin over time, however, being a highly pure alcohol, so try not to handle it with bare skin too much. Pop your minis in, pluck them out with a glove or a clothes peg, then give them a scrub with a brush. Vastly superior to alternatives like Castrol or Dettol as it's not harmless unless you chug it, and it's so foul-tasting you'd never want to swallow any anyway. You can also re-use it literally infinitely, so long as you filter out the paint flakes! You'll only ever run out after several years, as a result of natural alcohol evaporation while in use. And now we bring to you the 1d4chan's Assembling, Painting and Basing Guide Games Workshop Agrees! [ edit ] As of 7th Edition, Games Workshop has begun a series of "How to Paint" tutorials with their newest models and factions, helping newcomers into the art of thinning their paints. Everything in the videos are, of course, GW equipment, but at least Duncan Rhodes, the painter in question, shows the audience how to use it properly, and what paints need a little work to get to work well. The videos are fairly simple, but utilize a lot of different paints to get a great result (and earn some money for the Man). Duncan is also a great believer of THINNING YOUR PAINTS, as his mantra goes: "Put sum paint on ya palet, and then add a lil' drop of water, ya dun't need very much, just a lil' dip, just. Like... that." and: "You don't need very much, just...yeah...so that it goes nice and smoothly on your miniature." The real reason for this belief has finally been revealed, thanks to the new Warhammer Community website. Duncan botched up his first model he painted (a custom chapter called the Void Bringers) because "Clearly, I did not thin my paint, nor did I apply multiple thin coats!" Look upon the article, ye mighty, and despair: http://www.warhammer-community.com/2016/11/14/my-first-model-part-1-our-own-duncan-rhodes/ Duncan also made a tutorial on how to thin yer feckin paints! Painting Protip [ edit ] Don't know how much you should thin your paints? Unsure how a pair of colors will layer? Having trouble controlling your hands from drinking too much Mtn Dew? Practice painting on sprue after you cut out your models. Gallery [ edit ] This wonderfully crafted video depicts the correct way to react to these works of art. Post your own fails here!	{ "pile_set_name": "OpenWebText2" }
Sub-surface laser nanostructuring in stratified metal/dielectric media: a versatile platform towards flexible, durable and large-scale plasmonic writing. Laser nanostructuring of pure ultrathin metal layers or ceramic/metal composite thin films has emerged as a promising route for the fabrication of plasmonic patterns with applications in information storage, cryptography, and security tagging. However, the environmental sensitivity of pure Ag layers and the complexity of ceramic/metal composite film growth hinder the implementation of this technology to large-scale production, as well as its combination with flexible substrates. In the present work we investigate an alternative pathway, namely, starting from non-plasmonic multilayer metal/dielectric layers, whose growth is compatible with large scale production such as in-line sputtering and roll-to-roll deposition, which are then transformed into plasmonic templates by single-shot UV-laser annealing (LA). This entirely cold, large-scale process leads to a subsurface nanoconstruction involving plasmonic Ag nanoparticles (NPs) embedded in a hard and inert dielectric matrix on top of both rigid and flexible substrates. The subsurface encapsulation of Ag NPs provides durability and long-term stability, while the cold character of LA suits the use of sensitive flexible substrates. The morphology of the final composite film depends primarily on the nanocrystalline character of the dielectric host and its thermal conductivity. We demonstrate the emergence of a localized surface plasmon resonance, and its tunability depending on the applied fluence and environmental pressure. The results are well explained by theoretical photothermal modeling. Overall, our findings qualify the proposed process as an excellent candidate for versatile, large-scale optical encoding applications.	{ "pile_set_name": "PubMed Abstracts" }
A rhinoceros (/ r aɪ ˈ n ɒ s ər ə s /, from Greek rhinokeros, meaning 'nose-horned', from rhinos, meaning 'nose', and kerato/keras, meaning 'horn'), commonly abbreviated to rhino, is one of any five extant species of odd-toed ungulates in the family Rhinocerotidae, as well as any of the numerous extinct species. The black rhinoceros or hook-lipped rhinoceros (Diceros bicornis) is a species of rhinoceros, native to eastern and southern Africa including Botswana, Kenya, Malawi, Mozambique, Namibia, South Africa, Swaziland, Tanzania, Zambia, and Zimbabwe. Black Rhino Taxonomy/Description The Black rhino's scientific name is Diceros bicornis, which means "two-horned, two-horn". The Black rhinoceros is a member of the rhino family, Rhinoceridae in the Mammalian Order of Perissodactyla. What Is the Adaptation of the Rhinoceros? Thanks to their facial horns, bulk and thick skin, adult rhinoceroses have very few predators. These adaptations, which are elements that animals evolve in order to thrive in their habitats, are very important for their survival while living amid the ... Rhinoceros unicornis Rhinoceros sondaicus The genus Rhinoceros of the family Rhinocerotidae includes the one-horned rhinoceroses , of which there are two extant species: the Indian rhinoceros ( R. unicornis ) and the Javan rhinoceros ( R. sondaicus ). The Rhinoceros beetle is best identified by the presence of a horn protruding form its head. ... This particular species of Rhinoceros Beetles is found in woodlands west of the Rocky Mountains. ... Material presented throughout this website is for entertainment value and should not to be construed as usable for scientific research or medical ... The naming (taxonomy) of HRV and its relationship to other organisms (phylogeny)... Taxonomic Classification. ... The taxonomy described above examines how the organism is classified so that its relationship to other organisms can be determined. It also breaks down the names of these classification levels to explain the general characteristics ...	{ "pile_set_name": "Pile-CC" }
Archer says he appeals ‘to all walks of life’ In the race for Iowa’s newly redrawn 2nd Congressional District, Bettendorf attorney John Archer is considered a “young gun.” In his race to defeat third-term incumbent Democratic U.S. Congressman Dave Loebsack, the 40-year-old Archer has received extra assistance throughout his campaign from the Republican National Committee’s program to back candidates who are facing what it sees as a weak incumbent. Archer is originally from Springfield, Ill., and received his undergraduate degree in political science and business administration from Illinois Wesleyan University and his law degree from Southern Illinois University. He has been the senior legal counsel at John Deere & Co. for the past 11 years while earning his MBA for the University of Iowa’s Tippie College of Business. Archer has visited Newton and Jasper County noticeably less than his opponent during the 2012 campaign, but the three-year Pleasant Valley School Board member has developed a competitive ground game in Newton and the 2nd Congressional District. “I think I appeal to all walks of life,” Archer said in a Newton Daily News interview April 11. “Although I’m sitting here in a suit and tie today out of respect for you, I feel much more comfortable in a pair of blue jeans in a shirt with my sleeves rolled up working out on the farm.” The Congressional hopeful has shied away from social issues during the campaign, not even including the issues on his website. He has stated publicly that he is attempting to keep the focus on job and economic growth but also has said publicly that he favors the traditional view of marriage between a man and a woman. In the abortion debate, he said he believes life begins at conception. Unlike Loebsack, who has been fighting in Congress for a long-term extension of the wind production tax credit that subsidizes wind energy production and affects parts suppliers such as Newton’s TPI Composites and Trinity Towers, Archer argues for a short-term extension of the federal incentives over the next five to seven years. Although he touts an “all-of-the-above” energy strategy embraced by President Obama, Archer aligns with the RNC platform advocating the removal of government assistance from the energy sector. “We have to slowly wean these industries off all subsidies and let them stand and compete on their own,” he said in April. “We shock the system, so we have to give them a long enough runway — 5, 6, 7 years — in order to alter their business practices.” Although Archer also has seen less of a need for farm subsidies in recent years, the Congressional hopeful also holds the stance that the federal government still needs to assist U.S. farmers to “mitigate risks inherent in this business that allow our country to have food security.” Archer recently spoke at the Republican National Convention in Tampa Bay, Fla., in August. In a Cook Report political poll released last week, the Republican candidate has gained some ground against Loebsack in Newton’s new district but still is trailing going into the last six weeks of the campaign.	{ "pile_set_name": "Pile-CC" }
COURT OF APPEALS SECOND DISTRICT OF TEXAS FORT WORTH NO. 2-09-300-CR JAMES DEAN GRAYSON APPELLANT V. THE STATE OF TEXAS STATE ------------ FROM THE 396TH DISTRICT COURT OF TARRANT COUNTY ------------ MEMORANDUM OPINION1 Appellant James Dean Grayson appeals his conviction for theft, contending in six points that the evidence is legally and factually insufficient to show that he intended to deprive anyone of property, that he unlawfully appropriated property, 1 See Tex. R. App. P. 47.4. 1 and that the complaining witness was the owner of the property. See Tex. Penal Code Ann. ' 31.03(a) (Vernon Supp. 2009). We affirm. Background Facts In 2008, the First Baptist Church of Euless (FBCE) needed a new digital mixing board and other equipment for its music department. Under FBCE=s policy, Alton LaGrappe, a church employee, collected three bids for the price of the equipment. The church eventually chose a bid for $15,510.59 from All A-Round Video and Sound (AAVS). AAVS submitted an invoice to the church. In February 2008, Gary Phillips, the church‘s administrative pastor who was responsible for its financial matters, authorized the church to purchase the equipment from AAVS through an internal purchase order. Phillips signed a check made out to AAVS from the church‘s Chase Bank account for the amount in AAVS=s invoice, and LaGrappe delivered the check to AAVS. Appellant, who had previously been employed and fired by the church, is the sole proprietor of AAVS. The church=s employees had been instructed to not do business with appellant.2 AAVS‘s $15,510.59 bid to the church for the equipment that the church was looking for was based on a deal that appellant had brokered 2 Appellant‘s counsel said during his opening statement that appellant had worked for the church‘s music department but was fired because he allowed someone to repossess property from the church after being instructed not to. The trial court excluded evidence about appellant‘s employment with the church. 2 with Nomad Productions, which is operated by Paul Glasgow. Glasgow told appellant that appellant would need to pay cash for the equipment. Appellant went to a Chase Bank branch and attempted to cash the check that LaGrappe had given him; the bank refused to do so. But then, appellant opened a checking account for AAVS at that same bank and deposited the check. Once appellant made the deposit, he immediately withdrew $3,510.59 and left the bank.3 In the meantime, an employee of the bank called FBCE to verify the legitimacy of the check and find out who had authorized it. Through the bank=s contacting the church, Phillips eventually became aware that appellant is the sole proprietor of AAVS. The church asked the bank to stop payment on the check, but that request came too late because the funds had already been deposited in AAVS‘s account. The bank also never placed a hold on AAVS‘s account. In the latter part of February 2008, seven days after his first withdrawal from his sole proprietor account, appellant withdrew $11,900, which was $100 less than the balance of the purchase price, from the account. He still did not purchase the 3 Appellant=s counsel theorized during his opening argument at trial that the initial withdrawal represented appellant=s commission for brokering the deal between the church and Nomad Productions. The invoice that was submitted by AAVS to the church does not reference appellant=s commission. 3 equipment for the church. On March 4, appellant sent Phillips an e-mail that stated the following: Gary, Through the grapevine I have heard that YOU intend on pressing charges against my company for fraud. I assure you that this is not the case. I had ordered parts and supplies to be delivered to the [FBCE] campus from Nomad Productions which is the company you told your staff to deal with after You had recognition that I was involved. . . .[4] There are issues that popped up after my departure from FBCE. . . . Please, as I have told ALTON to tell you, AAVS will have the church‘s funds back to the FBC CAMPUS. By March 18. Phillips responded to appellant=s e-mail on March 10 and informed appellant that if the funds were not returned to FBCE by March 18, Phillips would turn the matter over to legal counsel. March 18 came and went but no equipment or money arrived. On March 20, appellant e-mailed Phillips to inform him that he could not refund the church=s money because the money was not in his possession and that he could not deliver the promised equipment because it was Ano longer available at the price that was quoted.@ The next day, appellant e-mailed Phillips again and promised to refund the church=s money. 4 Glasgow testified that no one from FBCE ever contacted him about the equipment. 4 Appellant e-mailed Phillips yet again on March 26. He told Phillips that the original mixing board he had quoted was Aliquidated to another buyer before [he] could get the funds because of the fraud [allegations].@ Appellant went on to state that he had located similar equipment (although at a higher price) and promised to credit FBCE on its next purchase. In the end, FBCE did not receive the equipment or a refund of its money. Phillips contacted the police to allege that appellant had committed theft, and he learned at that time that appellant had withdrawn all of the church‘s money from AAVS‘s bank account. A grand jury indicted appellant for theft.5 Appellant waived his right to a jury and pled not guilty. The trial court found appellant guilty and pronounced a sentence of two years= confinement, but the court suspended that sentence, placed appellant on community supervision for five years, and ordered appellant to pay restitution of $15,510.59. Appellant filed notice of this appeal. Evidentiary Sufficiency Appellant claims that the evidence is legally and factually insufficient to support his conviction. In a theft case, the State must prove that (1) a person (2) with intent to deprive the owner (3) unlawfully appropriated (4) property. See Tex. 5 Theft of property valued between $1,500 and $20,000 is a state jail felony that carries punishment of up to two years= confinement. Tex. Penal Code Ann. '' 12.35(a), 31.03(e)(4) (Vernon Supp. 2009). 5 Penal Code Ann. ' 31.03(a); Ex parte Luna, 784 S.W.2d 369, 371 (Tex. Crim. App. 1990) (op. on reh‘g); Bokor v. State, 114 S.W.3d 558, 560 (Tex. App.CFort Worth 2002, no pet.). Elements of theft may be proved by direct or circumstantial evidence. See Bryant v. State, 627 S.W.2d 180, 182 (Tex. Crim. App. [Panel Op.] 1982); Christensen v. State, 240 S.W.3d 25, 32 (Tex. App.CHouston [1st Dist.] 2007, pet. ref=d) (op on reh‘g). Standards of review In reviewing the legal sufficiency of the evidence to support a conviction, we view all of the evidence in the light most favorable to the prosecution in order to determine whether any rational trier of fact could have found the essential elements of the crime beyond a reasonable doubt. Jackson v. Virginia, 443 U.S. 307, 319, 99 S. Ct. 2781, 2789 (1979); Clayton v. State, 235 S.W.3d 772, 778 (Tex. Crim. App. 2007). This standard gives full play to the responsibility of the trier of fact to resolve conflicts in the testimony, to weigh the evidence, and to draw reasonable inferences from basic facts to ultimate facts. Jackson, 443 U.S. at 319, 99 S. Ct. at 2789; Clayton, 235 S.W.3d at 778. The trier of fact is the sole judge of the weight and credibility of the evidence. See Tex. Code Crim. Proc. Ann. art. 38.04 (Vernon 1979); Brown v. State, 270 S.W.3d 564, 568 (Tex. Crim. App. 2008), cert. denied, 129 S. Ct. 2075 (2009). Thus, when performing a legal sufficiency review, we may not re-evaluate the 6 weight and credibility of the evidence and substitute our judgment for that of the factfinder. Dewberry v. State, 4 S.W.3d 735, 740 (Tex. Crim. App. 1999), cert. denied, 529 U.S. 1131 (2000). Instead, we Adetermine whether the necessary inferences are reasonable based upon the combined and cumulative force of all the evidence when viewed in the light most favorable to the verdict.@ Hooper v. State, 214 S.W.3d 9, 16–17 (Tex. Crim. App. 2007). We must presume that the factfinder resolved any conflicting inferences in favor of the prosecution and defer to that resolution. Jackson, 443 U.S. at 326, 99 S. Ct. at 2793; Clayton, 235 S.W.3d at 778. The standard of review is the same for direct and circumstantial evidence cases; circumstantial evidence is as probative as direct evidence in establishing the guilt of an actor. Clayton, 235 S.W.3d at 778; Hooper, 214 S.W.3d at 13. When reviewing the factual sufficiency of the evidence to support a conviction, we view all the evidence in a neutral light, favoring neither party. Steadman v. State, 280 S.W.3d 242, 246 (Tex. Crim. App. 2009); Watson v. State, 204 S.W.3d 404, 414 (Tex. Crim. App. 2006). We then ask whether the evidence supporting the conviction, although legally sufficient, is nevertheless so weak that the factfinder=s determination is clearly wrong and manifestly unjust or whether conflicting evidence so greatly outweighs the evidence supporting the conviction that the factfinder=s determination is manifestly unjust. Steadman, 280 S.W.3d at 7 246; Watson, 204 S.W.3d at 414B15, 417. To reverse under the second ground, we must determine, with some objective basis in the record, that the great weight and preponderance of all the evidence, although legally sufficient, contradicts the judgment. Watson, 204 S.W.3d at 417. 8 Unless we conclude that it is necessary to correct manifest injustice, we must give due deference to the factfinder=s determinations, Aparticularly those determinations concerning the weight and credibility of the evidence.@ Johnson v. State, 23 S.W.3d 1, 9 (Tex. Crim. App. 2000); see Steadman, 280 S.W.3d at 246. Evidence is always factually sufficient when it preponderates in favor of the conviction. Steadman, 280 S.W.3d at 247; see Watson, 204 S.W.3d at 417. Intent to deprive and unlawful appropriation In his first four points, appellant contends that the evidence is legally and factually insufficient to prove that he intended to deprive anyone of property or that he unlawfully appropriated property. Appellant briefed his contentions regarding intent to deprive and unlawful appropriation together. Because, under the facts of this case, the intent to deprive and unlawful appropriation elements both require the State to show that appellant had no intent to perform AAVS‘s agreement with the church at the time that he took the church‘s check, we will examine the elements together.6 A defendant ―deprives‖ someone of property by ―withhold[ing] property from the owner permanently or for so extended a period of time that a major portion of the value or enjoyment of the property is lost to the owner.‖ Tex. Penal Code Ann. 6 Appellant concedes in his brief that ―evidence of deception would generally tend to show an intent to deprive.‖ 9 ' 31.01(2)(A) (Vernon Supp. 2009). ―Relevant intent to deprive the owner of property is the accused‘s intent at the time of the taking.‖ Peterson v. State, 645 S.W.2d 807, 811 (Tex. Crim. App. 1983) (op. on reh‘g). ―It is well settled that intent to commit theft can be inferred from the surrounding circumstances.‖ Roper v. State, 917 S.W.2d 128, 132 (Tex. App.CFort Worth 1996, pet. ref=d) (citing Coronado v. State, 508 S.W.2d 373, 374 (Tex. Crim. App. 1974)). A person acts intentionally ―with respect to the nature of his conduct . . . when it is his conscious objective or desire to engage in the conduct.‖ Tex. Penal Code Ann. ' 6.03(a) (Vernon 2003). In determining whether the evidence is sufficient to establish that appellant had criminal intent to commit theft, we may consider whether he personally gained from what was taken, whether he partially performed on any of the representations that were made, and whether any inferences can properly be drawn from the combined force of the circumstantial evidence. Christensen, 240 S.W.3d at 32. Under the facts of this case, for appellant=s appropriation of property to have been unlawful, he must have taken the property without its owner‘s effective consent. See Tex. Penal Code Ann. ' 31.03(b)(1); 7 Schmitz v. State, 952 S.W.2d 922, 924 (Tex. App.CFort Worth 1997, pet. ref=d). Consent is not 7 Appropriation includes acquiring or exercising control over property. Tex. Penal Code Ann. ' 31.01(4)(B). 10 effective when it is Ainduced by deception or coercion.@ Tex. Penal Code Ann. § 31.01(3)(A). Thus, to show unlawful appropriation, the State must prove that at the time that appellant got the church=s check, he did so by deception or coercion. See Wilson v. State, 663 S.W.2d 834, 836B37 (Tex. Crim. App. 1984). Deception means the following: (A) creating or confirming by words or conduct a false impression of law or fact that is likely to affect the judgment of another in the transaction, and that the actor does not believe to be true; (B) failing to correct a false impression of law or fact that is likely to affect the judgment of another in the transaction, that the actor previously created or confirmed by words or conduct, and that the actor does not now believe to be true; [or] .... (E) promising performance that is likely to affect the judgment of another in the transaction and that the actor does not intend to perform or knows will not be performed, except that failure to perform the promise in issue without other evidence of intent or knowledge is not sufficient proof that the actor did not intend to perform or knew the promise would not be performed. Tex. Penal Code Ann. ' 31.01(1). Therefore, when an owner gives property or money voluntarily and in pursuit of a contractual agreement and there is insufficient evidence to show deception, the owner has given its effective consent and there is therefore no unlawful appropriation. See Peterson, 645 S.W.2d at 812; Phillips v. State, 640 S.W.2d 293, 294 (Tex. Crim. App. [Panel Op.] 1982); Roper, 917 S.W.2d at 131B32; see also Jacobs v. State, 230 S.W.3d 225, 229B30 11 (Tex. App.CHouston [14th Dist.] 2006, no pet.) (explaining that the Amere fact that one fails to return funds paid in advance after failing to perform a contract does not constitute theft‖ and that A[i]n sum, the State must show a rational factfinder could have found appellant had no intention of fulfilling his obligation under the agreement@). Here, Phillips voluntarily authorized the check=s delivery to AAVS under the parties= agreement. Thus, appellant=s nonperformance of AAVS‘s part of the bargain does not by itself show his unlawful appropriation. See Tex. Penal Code Ann. '' 31.01(1)(E), (3)(A), 31.03(b)(1). Instead, the State is required to prove that appellant did not intend to purchase the equipment for the church at the time that he received the check and therefore acquired Phillips=s consent by deception. Appellant‘s intent to steal the money and unlawfully appropriate it by deception may be inferred from the following facts: appellant did not disclose to Phillips that he was the proprietor of AAVS when he submitted the bid to the church through AAVS‘s invoice even though the church had previously fired him; appellant tried to cash the church‘s entire check upon receiving it; despite withdrawing $3,510.59 from the account on the day that he deposited the check, appellant did not buy any of the church‘s equipment that day or use the withdrawn money as a deposit for the equipment; despite withdrawing almost the entire remaining amount of money that was given to him by the church approximately one week later, appellant still did not buy the equipment even though Glasgow still had it; 12 after depositing the check in AAVS‘s account, appellant did not answer calls from one of the church‘s employees to the telephone number that appellant had listed on his AAVS invoice; appellant told Glasgow in an e-mail that the church had stopped payment on its check although, in fact, the church did not stop payment and the bank never placed a hold on AAVS‘s account; appellant promised to refund the church‘s money on several occasions and was given time by the church to do so, but he never returned the money; and appellant deceived the church by telling Phillips that the ―console that was in question [was] no longer available‖ and that it had been ―liquidated to another buyer before [he] could get the funds‖ when, in fact, Glasgow still had the console and never told appellant that the console had been sold. We recognize that some of the evidence in the record weighs against the trial court‘s decision to convict appellant. For example, Glasgow testified that he and appellant had multiple conversations in which they talked about the specific equipment that the church needed, including a mixing console, preamps, and a digital input/output card. Glasgow also said that after appellant received the church‘s check, appellant called Glasgow to tell him that appellant would meet him to pick up the equipment but that appellant never actually did so. While Glasgow‘s testimony about his communication with appellant before and after appellant received the church‘s check could imply that appellant intended to complete AAVS‘s transaction with the church at the time that he received the check, we conclude that because of appellant‘s misrepresentations regarding returning the church‘s money and regarding the equipment‘s alleged unavailability, 13 the trial court could have reasonably inferred that the communication was a ruse to cover up appellant‘s theft. Also, appellant‘s attempt to cash the church‘s check could imply that he was trying to complete AAVS‘s agreement with the church at that time since Glasgow required cash before transferring the equipment. However, the trial court could have also reasonably inferred appellant‘s intent to steal from his attempt to cash the check. Finally, witnesses testified that appellant has a good, dependable business reputation. But some of those witnesses conceded that they did not have any knowledge about the facts related to AAVS‘s agreement with the church. Appellant relies on Peterson and Roper to contend that the evidence is insufficient to convict him. In Peterson, the court of criminal appeals held that the evidence was legally insufficient to show that the defendant appropriated $58,000 by deception from a warehouse owner under a construction contract because, in part, the defendant completed between 75% and 95% of the construction work, there was a dispute between the defendant and the owner about terms of their agreement, and there were disputes between the defendant and construction material suppliers about how much he owed them or whether the suppliers had given him the correct materials for the job. 645 S.W.2d at 807–12. Unlike the defendant in Peterson, appellant did not partially perform his agreement with the church even though he had the funds to do so and the equipment was available to 14 be purchased. Also, unlike the construction agreement in Peterson, the record in this case does not show a dispute about the terms of AAVS‘s agreement with the church that contributed to appellant‘s failure to perform the agreement. In Roper, we held that the evidence was legally insufficient to prove theft because the defendant had consent to sell a farmer‘s hay and the defendant testified that he believed he was entitled to keep the money he made while selling the hay since the farmer owed him money for a commission and wages. 917 S.W.2d at 130–33. Here, appellant did not have any basis to believe that he was entitled to keep the church‘s money without providing any of the promised equipment. Rather, he deceived the church about whether he would return the money and whether he could have purchased the equipment from Nomad Productions with the money that the church had given him. Appellant‘s deception provided the trial court with circumstantial evidence that he intended to steal the church‘s money rather than perform the agreement. See Ellis v. State, 877 S.W.2d 380, 383 (Tex. App.—Houston [1st Dist.] 1994, pet. ref‘d); Webb v. State, 752 S.W.2d 208, 210 (Tex. App.—Houston [1st Dist.] 1988, pet. ref‘d); Henke v. State, 730 S.W.2d 117, 118 (Tex. App.—Corpus Christi 1987, pet. ref‘d). In our legal sufficiency review, we must defer to the trial court‘s resolution of conflicting inferences that may be drawn from the evidence. See Jackson, 443 U.S. at 326, 99 S. Ct. at 2793; Clayton, 235 S.W.3d at 778. We conclude that, in 15 giving such deference in this case, the trial court could have rationally found that appellant did not intend to perform his agreement with the church at the time that he took its check, and the court therefore could have justifiably found the intent to deprive and unlawful appropriation elements beyond a reasonable doubt. Thus, we overrule appellant‘s first and third points. Similarly, while we have recognized that some inferences that could be drawn from the evidence conflict with the trial court‘s decision to convict appellant, we cannot conclude that the weight of those inferences is so great to make the trial court‘s judgment manifestly unjust. See Steadman, 280 S.W.3d at 246; Watson, 204 S.W.3d at 414B15, 417. We may not hold that the evidence is factually insufficient merely because we ―harbor a subjective level of reasonable doubt to overturn [the] conviction.‖ Watson, 204 S.W.3d at 417. Thus, we hold that the evidence is factually sufficient to prove the elements of intent to deprive and unlawful appropriation, and we overrule appellant‘s second and fourth points. Phillips’s ownership of the money In his fifth and six points, appellant contends that the evidence is legally and factually insufficient to prove that Phillips was the owner of the money that he took. An owner is someone who has a ―greater right to possession of the property than the actor.‖ Tex. Penal Code Ann. ' 1.07(a)(35)(A). 16 Appellant‘s argument that Phillips was not the owner of the money seems to be dependent on a positive resolution of his first four points; appellant succinctly contends in his brief that the ―trial record establishes only the existence of a civil contract dispute. Consequently, the evidence is legally and factually insufficient to prove beyond a reasonable doubt that the complaining witness had a greater right to possession‖ of the money. We have upheld the trial court‘s implicit findings that appellant intended to deprive Phillips of the money and unlawfully appropriated it; the evidence shows more than a civil contract dispute. Furthermore, the evidence shows that Phillips has authority to spend money on the church‘s behalf. Phillips testified that he is responsible for overseeing all of the church‘s fiduciary matters and keeping records of business purchases. Also, Phillips signed the purchase order that authorized the delivery of the church‘s check to appellant. We hold that this evidence, coupled with appellant‘s unlawful appropriation of the money, shows that Phillips had a greater right to possession of the $15,510.59 than appellant. See Jordan v. State, 707 S.W.2d 641, 644 (Tex. Crim. App. 1986) (holding that a store manager who had ―control and managerial authority over the store and its money‖ qualified as an owner under the statutory definition). In other words, the evidence is sufficient to show that Phillips qualifies as the church‘s ―special owner.‖ Liggens v. State, 50 S.W.3d 657, 660 (Tex. App.—Fort Worth 2001, pet. ref‘d) (holding that a store 17 manager had a greater right to possession than the defendant and explaining that a ―‗special owner‘ is an individual, such as an employee, who is in care, custody, or control of the property belonging to another person or a corporation‖); see also Jackson v. State, 270 S.W.3d 649, 657 (Tex. App.—Fort Worth 2008, pet. ref‘d) (holding that a car dealership‘s employee qualified as the owner of a car because he had a greater right of possession than the defendant). For these reasons, viewing the evidence in the light most favorable to the verdict, we hold that the trial court could have rationally found beyond a reasonable doubt that Phillips was the owner of the money; thus, the evidence is legally sufficient as to that element. See Clayton, 235 S.W.3d at 778. We have not found any evidence in the record that weighs against Phillips‘s ownership of the money. Viewing the evidence in a neutral light, we cannot conclude that it is so weak concerning Phillips‘s ownership of the money that the trial court‘s verdict is clearly wrong or manifestly unjust. Therefore, the evidence is also factually sufficient as to that element. See Steadman, 280 S.W.3d at 246. We overrule appellant‘s fifth and sixth points. Conclusion Having overruled each of appellant‘s six points, we affirm the trial court‘s judgment. TERRIE LIVINGSTON 18 CHIEF JUSTICE PANEL: LIVINGSTON, C.J.; GARDNER and MEIER, JJ. DO NOT PUBLISH Tex. R. App. P. 47.2(b) DELIVERED: August 5, 2010 19	{ "pile_set_name": "FreeLaw" }
You would be surprised at how many women use a bottle to masturbate with. There was a thread on a well known forum that asked the question “Have you masturbated with a bottle?” almost every women said that yes, they have and they still do. Let’s take this naughty mature slut, she’s home alone and horny. Bored of her dildo she wants something different inside her pussy and she wants to feel like she’s been a naughty girl. So she reaches for an empty bottle, it’s hard, thick and smooth – perfect for fucking her wet pussy with. Diana Ananta is a well known milf, a dirty milf with a hairy pussy, the kind of pussy that needs to be masturbated daily. After a few glasses of wine her pussy starts twitching, she sees the empty bottle and reaches for it. Sitting on the edge of the couch with her legs open – no panties on, just her hairy little twat waiting to be filled – she licks the bottles and slides it in to her pussy. Her eyes are closed as she focuses on the feeling of satisfaction. She keeps her eyes closed as she pushes the bottle in further as deep as she can push it in to her tiny pussy. On the bed now, her toes curl in her sandals as she fucks herself to a massive orgasm. Gallery from: Diana Ananta	{ "pile_set_name": "OpenWebText2" }
Progranulin promotes activation of microglia/macrophage after pilocarpine-induced status epilepticus. Progranulin (PGRN) haploinsufficiency accounts for up to 10% of frontotemporal lobe dementia. PGRN has also been implicated in neuroinflammation in acute and chronic neurological disorders. Here we report that both protein and mRNA levels of cortical and hippocampal PGRN are significantly enhanced following pilocarpine-induced status epilepticus. We also identify intense PGRN immunoreactivity that colocalizes with CD11b in seizure-induced animals, suggesting that PGRN elevation occurs primarily in activated microglia and macrophages. To test the role of PGRN in activation of microglia/macrophages, we apply recombinant PGRN protein directly into the hippocampal formation, and observe no change in the number of CD11b(+) microglia/macrophages in the dentate gyrus. However, with pilocarpine-induced status epilepticus, PGRN application significantly increases the number of CD11b(+) microglia/macrophages in the dentate gyrus, without affecting the extent of hilar cell death. In addition, the number of CD11b(+) microglia/macrophages induced by status epilepticus is not significantly different between PGRN knockout mice and wildtype. Our findings suggest that status epilepticus induces PGRN expression, and that PGRN potentiates but is not required for seizure-induced microglia/macrophage activation.	{ "pile_set_name": "PubMed Abstracts" }
In dynamic print-job environments which process color print jobs for customers, billing is often based on the amount of color content contained in the job to be printed. In order to bill customers for color printing, color detection is a very important feature required in the image path. Color detection is used to analyze print documents for presence as well as amount of color in order to bill customers accordingly. Some systems rely on user input settings for billing information. This can cause incorrect billing especially in the case of a multi-page document having color on some of the pages but not on others. In these case, the print-job operator would have to physically scan every page of the entire multi-page document in order to properly take into account all the color content contain in the document. This can be time consuming and expensive. This is especially problematic in dynamic print-job environments where print-job processing time and throughput must be maximized in order to maintain profitability. In some instances, if a large multi-page document contains any color at all, the customer is charged for the whole document as being a color. This can be problematic for the customer if their large multi-page document really only contains very little color content and the price differential between a black/white print-job differs substantially from the price of a color print-job. Also, billing has traditionally been only a 2-tier billing model. In other words, as long as any single color pixel (C, M, or Y) is turned on, the entire page is billed at the higher rate for reproducing a page of color content. With the need to go with multi-tier color billing, there is a need in this art to examine all 4 color planes (CMYK) quickly and efficiently. However, all four color planes may not always be synchronized when the image path hardware examines the color content of the document because the pixels from each of the different color planes may not be looked at simultaneously. Depending on the kind, amount, and type of image content contained in a particular color page, the results can vary significantly if inefficient metrics such as the number of color pixels or percentage coverage of color is used instead. Accordingly, what is needed in this art are increasingly sophisticated applications and advanced methodologies for color management systems which correctly estimate the amount of color content in a multi-page document when all four color planes (CMYK) are not available simultaneously, i.e., there is an offset between the planes while being printed.	{ "pile_set_name": "USPTO Backgrounds" }
1. Field of the Invention The present invention relates to a webbing supporting structure for supporting an occupant restraining webbing on a door for use in a seatbelt system for protecting an occupant. 2. Description of the Prior Art There has been proposed a so-called passive seatbelt system in which one end of an occupant restraining webbing is secured to a door, whereby the webbing is caused to approach or recede from a vehicle seat in accordance with a door opening or closing action, so that the webbing can be automatically fastened to or unfastened from the occupant. In this type of passive seatbelt system, when one end of a lap webbing for restraining a lap of the occupant is engaged with the door, the engaging portion is disposed as high as possible on the door, so that a space for actions of legs of the occupant can be secured when the door is opened. However, in this case, when the webbing is fastened to the occupant upon his closing the door, an anchor point of the lap webbing is disposed high, so that the lap webbing cannot satisfactorily display the occupant restraining performance, thereby presenting such disadvantages that the movement of the occupant in the direction of a collision may cause a secondary collision or damages may be caused to the abdominal region of the occupant.	{ "pile_set_name": "USPTO Backgrounds" }
Process control for industrial automation processes or industrial automation devices is often supervised and regulated by a process control system as a number of control loops including one or more closed loop control processes. A traditional approach in the use of closed loop control is to measure a value of a process output and compare the measured value with a reference value. There are also other objectives of control loop control, including set-point regulation, tracking (time-varying reference path), path following (varying reference independent of time), disturbance attenuation etc. The most common form of control is a Proportional, Integral, Derivative (PID) control for feedback control. In PID control a sensor measurement is used as an input for a feedback control loop, and any difference between the measured sensor value and a reference (setpoint) value or signal is determined by a controller. The controller then in turn sends signals to an actuator connected to the control loop in question, making changes to the process, so that the sensed value approaches the reference value over time. The traditional closed loop feedback system comprises hard-wired communication links. A disadvantage with hard-wired communication links is that changes in position of any component or field device in the closed loop, such as a sensor or actuator, usually requires a stop in production or an extensive shutdown, especially in the case of analogue wired connections, and/or digital wired connections. Alternatively, such changes have to be delayed until a process shutdown may be programmed. In addition, hard wiring may be both expensive to replace and sometimes also technically challenging to replace. Wireless technologies give several advantages to industrial automation in terms of gain in productivity and flexibility. Industrial sites are often harsh environments with stringent requirements on the type and quality of cabling. Moreover large sites often require many thousands of cables and it could be difficult to install or engineer additional wires in an already congested site. Thus wireless communication can save costs and time during an installation phase. At the same time wireless communication can improve reliability with respect to wired solutions by offering several mechanisms of diversity, such as space diversity, frequency diversity and time diversity. Furthermore the ad-hoc nature of wireless networks allows for easy setup and re-configuration when the network grows in size. However, when the field devices such as sensors and/or actuators are part of a closed-loop control system, an industrial application will require hard limits on the maximum delay allowed during the communication, so strict timing requirements have to be applied and consistently achieved. Another requirement is the coexistence of the network with other equipment and competing wireless systems. The WirelessHART standard has been developed to fulfill these demands. WirelessHART is a wireless mesh network communication protocol for process automation applications, including process measurement, control, and asset management applications. It is based on the HART protocol, but it adds wireless capabilities to it enabling users to gain the benefits of wireless technology while maintaining compatibility with existing HART devices, tools and commands. A WirelessHART network may be connected to the plant automation network through a gateway. The plant automation network could be a TCP-based network, a remote I/O system, or a bus such as PROFIBUS. All network devices such as field devices and access points transmit and receive WirelessHART packets and perform the basic functions necessary to support network formation and maintenance. Devices can be deployed in a star topology, that is where all devices are one hop to the gateway, to support a high performance application, or in a multi-hop mesh topology for a less demanding application, or any topology in between. These possibilities give flexibility to WirelessHART technology enabling various applications (both high and low performance) to operate in the same network. WirelessHART specifies the use of IEEE STD 802.15.4-2006 compatible transceivers operating in the 2.4 GHz ISM (Industrial, Scientific, and Medical) radio band. Communications among network devices are arbitrated using TDMA (Time Division Multiple Access) that allows scheduling of the communication link activity. WirelessHART uses TDMA and channel hopping to control access to the network and to coordinate communications between network devices. The basic unit of measure is a time slot which is a unit of fixed time duration commonly shared by all network devices in a network. The duration of a time slot is sufficient to send or receive one packet per channel and an accompanying acknowledgement, including guard-band times for network wide-synchronization. The WirelessHART standard specifies that the duration of the time slot is 10 ms. The TDMA Data Link Layer establishes links specifying the time slot and frequency where 1.3. WirelessHART Standard communication between devices occurs. These links are organized into superframes that periodically repeat to support cyclic and acyclic communication traffic. WirelessHART standard does not specify a particular scheduling algorithm to be used for scheduling communication in a WirelessHART network. However, for all network devices accessed through a WirelessHART gateway, the user has to configure how often each measurement value is to be communicated to the gateway. In order to support multiple superframes for the transfer of process measurements at different rates, the size of superframes should follow a harmonic chain in the sense that all periods should divide into each other, in particular, scan rates should be configured as integer multiples of the fastest update time that will be supported by network devices. The correctness of the process control system behavior depends not only on the logical results of the computations performed in each controller, but also on the physical instant at which these results are produced, in other words, it is a system with explicit deterministic (or probabilistic) timing requirements. Thus the task of making up a schedule for communication links in a control loop may be subject to many conditions and constraints. In addition, in a typical process installation, communication scheduling and formation of superframes may be required for many hundreds or even thousands of control loops. This is a time consuming process for an installer or engineer, and one that also presents opportunities for errors to be made when an installer manually constructs a time schedule or configures a superframe for a control loop based on information for a control diagram or P&I diagram (Piping and Instrumentation). U.S. Pat. No. 7,460,865 entitled Self-configuring communication networks for use with process control systems, assigned to Fisher-Rosemount Systems, Inc., discloses methods for automatically assigning a first and a second wireless link to a first field device, wherein the first wireless link wirelessly couples the first field device to a second field device and wherein the second wireless link wirelessly couples the second wireless field device to a controller; the assignment being dependent on at least one first predetermined signal criterion.	{ "pile_set_name": "USPTO Backgrounds" }
127 Ga. App. 735 (1972) 195 S.E.2d 213 SMITH v. POTEET et al. 47551. Court of Appeals of Georgia. Submitted October 5, 1972. Decided November 17, 1972. Rehearing Denied December 6, 1972. Congdon, Williams & Daniel, W. Barry Williams, Robert C. Daniel, Jr., for appellant. Fulcher, Hagler, Harper & Reed, Wiley S. Obenshain, III, Gould B. Hagler, George B. Rushing, for appellees. CLARK, Judge. Funerals are lachrymose affairs. For the plaintiff, an elderly mourning relative and retired schoolteacher, her sadness was increased when she sustained painful injuries from a fall which occurred as she was walking across the artificial grass cover customarily placed at the burial site. In the complaint filed against both the funeral director and the cemetery the negligence charged against both defendants was "in permitting the hole or depression in the ground to remain in a spot where it would be walked into by complainant and in covering said hole or depression with artificial grass, so that it could not be seen or observed." The funeral firm filed a third-party complaint against Wilbert Burial 736 Vault Co. alleging the fault, if any, to be upon that concern which had prepared the area at the request of the funeral home. This third-party complaint was dismissed on the morning of the trial with the funeral director subsequently defending upon the theory that Wilbert Burial Vault Co. was an independent contractor so that its negligence, if any, would not be chargeable to Poteet. From the antagonistic ambiance concomitant with a hard-fought courtroom battle between capable advocates the jury returned a verdict for both defendants. This was followed by a motion for new trial which as amended was overruled and the instant appeal followed. 1. "Where the owner or occupier of land, by express or implied invitation, induces or leads others to come upon his premises for any lawful purpose, he is liable in damages to such persons for injuries occasioned by his failure to exercise ordinary care in keeping the premises and approaches safe." Code § 105-401. A duty of ordinary care was owed to plaintiff. The "standard is whether a reasonably prudent person at the time and in the circumstances would have foreseen danger and what he reasonably would have done to prevent injury; negligence is defective foresight judged by this standard rather than by hindsight of what actually happened and the effectiveness of the action taken." Shockley v. Zayre of Atlanta, 118 Ga. App. 672 (165 SE2d 179). The facts sub judice are analogous to those in Roberts v. Wicker, 213 Ga. 352 (99 SE2d 84), where a judgment of nonsuit was granted. There plaintiff tripped on a threshold strip, commonly used in other buildings. "One would not necessarily observe the ridge on the metal strip or the groove in it by walking through the door, but one would have to get down on the floor and take a level view of the strip to discern its condition... There is nothing in the evidence to show or indicate the necessity of making such an inspection to ascertain the possible or probable existence of any defect, such as that other people had tripped or fallen while walking over the threshold 737 strip. Ordinary diligence, under such circumstances and the facts of this case, did not require an inspection where the defendants had no reason to think an inspection was necessary." Roberts v. Wicker, supra, pp. 354, 356. "The pedestrian is not entitled to an absolutely level, smooth and unobstructed passageway... Shearman & Redfield on Negligence, Vol. 4, p. 1817, § 795." Butler v. Jones, 85 Ga. App. 158, 162 (68 SE2d 173). "Ordinary care and diligence, as applied to the keeping of premises in safe condition, is a very elastic term, varying the quantum of actual caution to be exercised, according to the nature of the use to which the property is devoted, ... and whether the condition could have been discovered by proper inspection [is a question] for the jury. [Cits.]." Jones v. Hunter, 94 Ga. App. 316, 320 (94 SE2d 384), as cited with approval in Martin v. Henson, 95 Ga. App. 715, 737 (99 SE2d 251). If there were any acts of negligence, who had the duty of care and thereby became liable for breach of this duty? "The employer generally is not responsible for torts committed by his employee when the latter exercises an independent business, and in it is not subject to the immediate direction and control of the employer." Code § 105-501. However, under Code § 105-502 (5) the relationship of master and servant may be created where the contract gives, or the employer assumes "the right to control the time, manner, and method of executing the work, as distinguished from the right merely to require certain definite results in conformity to the contract." Blair v. Smith, 201 Ga. 747, 748 (41 SE2d 133). If there is a "specific contract to do a certain piece of work according to specifications for a stipulated sum, it is inferable that the employer has [not] retained the right to control the manner, method and means of performance of the contract, and that the employee is ... an independent contractor." Golosh v. Cherokee Cab Co., 226 Ga. 636, 638 (176 SE2d 925), as cited recently by the Court 738 of Appeals in Moon v. Georgia Power Co., 127 Ga. App. 524. As against the defendant funeral director, plaintiff emphasizes the provisions of §§ 84-801, 84-803 and 84-804 in Chapter 84-8 of our Code captioned "Funeral Directors and Embalmers," codified from Ga. L. 1950, p. 238 et seq. As is stated in the opening declaration of public policy, this statute is "an exercise of the health powers of the State" with the legislation providing through a State board for licensing of persons as "an embalmer or funeral director" who meet the qualifications specified in § 84-809. The rationale behind this statute is that unless a human body is properly embalmed and buried or cremated, it may become a health hazard. Thus, such services as involve handling the corpse cannot be delegated or contracted to an unlicensed individual. However, one must distinguish between the portions of a funeral director's work which are directly aligned with his statutory professional responsibility of embalming and burial and those responsibilities of embalming and burial and those responsibilities he assumes because of our social mores.[1] The former is fixed by statute to avoid health hazards. The latter is decreed by society because of our culture and customs. Preparations made for relatives and friends to attend funeral services clearly fall under the latter category and no health hazard is involved. Therefore, Wilbert Burial Vault Co. was not forbidden by law from serving as an independent contractor in preparing the burial site including placement of the artificial grass carpeting. The relationship between the parties was for the jury as the trior of fact to determine. That along with other factual issues was properly submitted to the jury for their determination. "After a verdict, the evidence is construed in its light most favorable to the prevailing party, for 739 every presumption and inference is in favor of the verdict." Brown v. Wingard, 122 Ga. App. 544 (1) (177 SE2d 797). Where there is evidence sufficient to support the verdict and it has the approval of the trial judge, the judgment will be affirmed. M. & G. Textile Co. v. West Point-Pepperell, 126 Ga. App. 43 (189 SE2d 878); Dade v. Dade, 213 Ga. 533 (100 SE2d 181). The judgment for the defendants is supported by the evidence and is in accordance with the law. Therefore, enumerations 1, 2, 3 and 11 dealing with the general grounds of the new trial motion are without merit. 3. Enumeration number 4 contends the court erred in permitting counsel for one co-defendant to cross examine the agent of another co-defendant. "This court will not interfere with the action of the trial judge in allowing `double' or `multiple' cross examination of witnesses, particularly in a situation such as here shown involving more than two parties, absent a showing of a manifest abuse of discretion. The clear intent of Code § 38-1705 is to recognize and allow the right of cross examination for witnesses called by other parties, and we consider it quite proper for the trial court to regard such witnesses as witnesses `called against' another party seeking cross examination, unless the absence of any `distinct interests' clearly appears." Gunnells v. Cotton States Mut. Ins. Co., 117 Ga. App. 123, 126 (159 SE2d 730). The defendants sub judice have definite, distinct interests. If negligence is assumed then the jury must determine who committed the negligent act: (1) Westover Memorial Park, Inc., who cared for the grounds and dug the grave; (2) Wilbert Burial Vault Co., who supplied the vault and set up other equipment necessary for a funeral, such as artificial carpet, chairs and tent; (3) the Poteets who, as funeral directors, embalmed the body and arranged for services including the work done by Wilbert. In addition, the jury must determine whether the Poteets had assumed a master-servant relationship with Wilbert Burial Vault, and thus were responsible for its acts. The court 740 did not abuse its discretion as the evidence clearly indicated "distinct interest" among the defendants. See also Akridge v. Atlanta Journal Co., 56 Ga. App. 812 (194 SE 590) and Rainey v. Moon, 187 Ga. 712, 717 (2 SE2d 405). Enumeration number 4 is therefore without merit. 4. Enumeration number 5 contends that the court erred in permitting defendant Howard Poteet to testify concerning his contract with Wilbert Burial Vault Co. This testimony is relevant as it would aid the jury in determining the status of Wilbert Burial Vault Co., and consequently whether the Poteets were liable for Wilbert's acts in addition to their own. "Any evidence is relevant which logically tends to prove or to disprove a material fact which is at issue in the case." McNabb v. State, 70 Ga. App. 798, 799 (29 SE2d 643). "When facts are such that the jury, if permitted to hear them, may or may not make an inference pertinent to the issue, according to the view which they may take of the, in connection with the other facts in evidence, they are such as the jury ought to be permitted to hear." Walker v. Roberts, 20 Ga. 15 (1). Appellant's objection to admissibility was in part based on a contention that appellees had not pleaded the independent contractual relationship as an affirmative defense. Code Ann. § 81A-108 (c) was not applicable as neither agency nor an independent contractual relationship is one of those listed therein as an affirmative defense. Therefore this enumeration is without merit. 5. Enumeration number 6 contends that the court erred in striking the following testimony of defendant Howard Poteet: "Q. And don't you represent to them [family and friends that come to the funeral] that they are going to have a safe place to walk and are not going to fall down and break their arm? A. Yes, Sir. Q. And this is part of your service and you represent that these things are not going to happen?" Defendant's counsel objected and the court sustained the objection on the ground that "He can't foresee what's 741 going or not going to happen. " T. 85-86. "There is no merit in the remaining ground of the amended motion, which complains of the exclusion of testimony as to where the plaintiff spent the night, when it appeared that the testimony of the witness must of necessity be merely a conjecture." Gunnin v. Bankers, &c. Ins. Co., 66 Ga. App. 574, 575 (18 SE2d 563). The right of broad cross examination does not include the admissibility of otherwise inadmissible or irrelevant evidence. Morgan v. State, 211 Ga. 172 (84 SE2d 365). 6. Enumeration number 7 contends the court erred in charging the plaintiff's duty to exercise ordinary care to avoid the consequences of any negligence by defendants when such is apparent or in the exercise of ordinary care should have become apparent to plaintiff. The charge as given was correct as an abstract principle of law. Code § 105-603; Tidwell v. Tidwell, 92 Ga. App. 54 (87 SE2d 657). When the particular language complained of states an abstract principle of law it is then necessary for examination of the record to ascertain if the complaining party has been injured by the giving of such instruction. Troy v. Wright Body Works, 109 Ga. App. 346 (136 SE2d 197); Anderson v. Southern R. Co., 107 Ga. 500 (4) (33 SE 644). "An instruction containing a correct legal principle. though inappropriate to the case, if not prejudicial to the contention of the losing party, affords no sufficient reason for granting a new trial." Turner v. Elliott, 127 Ga. 338 (3) (56 SE 434). See also Rolan v. Rittenhouse, 107 Ga. App. 769 (3) (131 SE2d 112). As was said in Wilson v. Harrell, 87 Ga. App. 793, 795 (75 SE2d 436): "While the giving of this charge may have been inapt and not entirely adjusted to the pleadings or the evidence, it was not reversible error." 7. Enumeration number 8 attacks inclusion in the charge of the legal theory of "accident." The 9th enumeration attacks the failure to include in the jury charge that portion of Code § 105-502 which in subparagraph 4 provides that an employer is liable for the negligence of a contractor 742 "if the wrongful act is the violation of a duty imposed by statute." Both attacks are based upon the contention there was negligence per se through violation of standards contained in Code Ann. Ch. 84-8. As we have heretofore pointed out the work assigned to Wilbert as an independent contractor of preparing the burial site, including placing artificial grass, chairs, and normal burial equipment, would not come within the professional category such as embalming and corpse preparations which must be performed by the individual professional licensee. Furthermore, "`The term (accident) has been used to refer to ... a happening which, although not wholly free from negligence by such person, was not proximately caused by a failure of either of the parties to a case to exercise ordinary care in the situation.' 65 CJS 646, Negligence, § 21 (a) (1), citing Pickering v. Wagnon, 91 Ga. App. 610 (86 SE2d 621) and Boatright v. Sosebee, 108 Ga. App. 19 (132 SE2d 155)." Teppenpaw v. Blaylock, 126 Ga. App. 576, 579 (191 SE2d 466). Where there is evidence of "accident" in the record, it is not error to charge the jury on that subject. Caldwell v. Knight, 94 Ga. App. 827 (96 SE2d 331). See also Trammell v. Williams, 97 Ga. App. 31 (101 SE2d 887). 8. Enumeration number 10 contends the court erred in failing to inform plaintiff's counsel as to the court's proposed action on defendants' requests to charge. Code Ann. § 70-207 (b) states: "The court shall inform counsel of its proposed action upon the requests prior to their arguments to the jury..." As this is similar to Rule 51 of the Federal Rules of Civil Procedure, the application by the Federal courts has persuasive influence in our consideration. Ga. Power Co. v. Maddox, 113 Ga. App. 642 (149 SE2d 393). These cases point out that "an essential purpose of Rule 51 is to permit counsel to argue intelligently upon the evidence, within the framework of the applicable law, and also, by reason of advance notice as to the disposition of requests for instructions, to alert 743 him to take appropriate exceptions following delivery of the charge." Tyrill v. Alcoa Steamship Co., 185 FSupp. 822, 824 (S. D. N. Y. 1960). For reversal to be obtained for such inadvertent oversight, it is necessary to show substantial prejudice to have resulted. Levin v. Joseph E. Seagram & Sons, 158 F2d 55 (7th Cir.); Finkle v. N. Y., N. H. &c. R. Co., 26 FRD 9 (D. C. Conn. 1960). From the manner in which the record shows plaintiff's capable counsel noted his objections to the charge it appears that his client has not been prejudiced. Moreover, as was noted in the Finkle case, supra, p. 10. "when counsel embark upon their summations without any request for such information, the trial judge may usually infer that they envisage no need for such information and treat the requirement as waived." In dealing with procedural rules and the requirement that harmful error must be shown in order to obtain a reversal upon appeal our Fifth Circuit concluded in Dallas R. &c. Co. v. Sullivan, 108 F2d 581, 584 (1940) that "Dialectical perfection, metaphysical nicety, abstract inerrancy, are not expected or required of Federal trial courts." We are constrained to add that this same language is applicable to state trial courts. Judgment affirmed. Eberhardt, P. J., and Deen, J., concur. NOTES [1] In 1963 a noted English writer, Jessica Mitford, dealt interestingly with this subject in The American Way of Death (Simon & Schuster, Inc., New York).	{ "pile_set_name": "FreeLaw" }
"Here Comes the Rain Again" is a 1984 song by British pop duo Eurythmics. It was written by group members Annie Lennox and David A. Stewart and produced by Stewart. The song was released as the third single in the UK from the album Touch and in the United States as the first single. The track is similar in musical style to past Eurythmics singles and its melancholy lyrics draw a comparison between the painful and tragic feelings of unrequited love with falling rain.	{ "pile_set_name": "Pile-CC" }
A JavaScript example of sending an nUSD stablecoin payment with a MetaMask signer This JavaScript library was created to help you get started with the Havven payment engine on Ethereum. You can use it to build your own project that needs to work with payments using a stablecoin. We are constantly interrogating what we can do or build for users that will increase adoption, not just for our systems but for the blockchain space in general. We see user-focused tools and interfaces as being one of the most important steps to wider adoption, and we want to play our part and help you play yours. What can I build on the Havven payment engine? Anything you can think of with programmable money. Havven provides the stability-as-a-service and will soon be offering fx with our multicurrency release. We’ve come up with some thought starters for dApps you could create by integrating Havven’s stable payments into your projects. Crypto Games — lottery, poker, FOMO-nUSD for kicks. Crypto Ecommerce Crypto Loans Crypto Insurance Crypto Payroll Crypto Global Remittance Getting Started The havven-js Library provides a simple pre-packaged API to communicate with Havven contracts. Under the hood, havven-js uses ethers.js library and we’ve packaged some major signers with it, Trezor, Ledger and MetaMask to enable instant wallet integration. This is particularly useful for hackathon teams to quickly “npm install havven-js” and have stable payments integrated into their dApp in just a few minutes. The two main packages to do stable payments with are: StablePayments — for transfer() and payment related functions like transfer() Util — a bunch of handy utility functions for number handling and gas estimation. Some other packages for hacking with: IsssuanceController — for Token swapper/exchange functions such as ETH > HAV & ETH > nUSD Mintr — if you want to build a dApp for minting and burning stablecoins Access the havven-js Docs here havven-js is open source Got any questions? Join our community on Discord! Website \| Reddit \| Twitter \| Discord	{ "pile_set_name": "OpenWebText2" }

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.