Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
home > search

Now showing items 113 - 128 of 89406

  • Review of\r Freud\"s Trip to Orvieto

    Gallo   Rubén  

    Download Collect
  • Photoionization of S 3+ using the Breit-Pauli R -matrix method

    Stancalie  

    Download Collect
  • ES&T\r ’s Best Papers of 2017

    Sedlak   David L.  

    Download Collect
  • The Nice Valour\r ’s Anatomy of Shame

    Panek Jennifer  

    Download Collect
  • Essential and density topologies on s\r 2-continuous posets

    LU, CHONGXIA   LI, QINGGUO  

    Download Collect
  • Lorentz St?er\"s\r Geometria et Perspectiva

    Sondow   Jonathan  

    Download Collect
  • (R)-TRIP and (S)-TRIP – Very Recent Applications

    Tiago Menezes Correia, José  

    Download Collect
  • Response to Varol\r et?al\r .\"s letter

    Calvet, David   Laurent, Stéphane   Mas, Jean-Louis  

    Download Collect
  • Teaching S?ren Kierkegaard\"s\r Fear and Trembling

    Malesic   Jonathan  

    Download Collect
  • Introducing\r Modern Italy\r \"s new editors

    Morris, Penelope   Seymour, Mark  

    Download Collect
  • [r, s, t]-Colorings of Graph Products

    Dekar, Lyes   Effantin, Brice   Kheddouci, Hamamache  

    Let G = (V, E) be a graph with vertex set V and edge set E. Given non negative integers r, s and t, an [r, s, t]-coloring of a graph G is a proper total coloring where the neighboring elements of G (vertices and edges) receive colors with a certain difference r between colors of adjacent vertices, a difference s between colors of adjacent edges and a difference t between colors of a vertex and an incident edge. Thus [r, s, t]-colorings generalize the classical colorings of graphs and can have applications in different fields like scheduling, channel assignment problem, etc. The [r, s, t]-chromatic number chi (r,s,t) (G) of G is the minimum k such that G admits an [r, s, t]-coloring. In our paper we propose several bounds for the [r, s, t]-chromatic number of the cartesian and direct products of some graphs.
    Download Collect
  • The Moral Framework of Peter Singer\"s Animal Liberation

    LLORENTE   Renzo  

    Download Collect
  • [r,s,t]-Colorings of Graph Products

    Lyes Dekar   Brice Effantin   Hamamache Kheddouci  

    Let G = (V, E) be a graph with vertex set V and edge set E. Given non negative integers r, s and t, an [r, s, t]-coloring of a graph G is a proper total coloring where the neighboring elements of G (vertices and edges) receive colors with a certain difference r between colors of adjacent vertices, a difference s between colors of adjacent edges and a difference t between colors of a vertex and an incident edge. Thus [r, s, t]-colorings generalize the classical colorings of graphs and can have applications in different fields like scheduling, channel assignment problem, etc. The [r, s, t]-chromatic number chi (r,s,t) (G) of G is the minimum k such that G admits an [r, s, t]-coloring. In our paper we propose several bounds for the [r, s, t]-chromatic number of the cartesian and direct products of some graphs.
    Download Collect
  • Monotonicity of the unified quantum (r,?s)-entropy and (r,?s)-mutual information

    Fan, Ya-Jing   Cao, Huai-Xin  

    Monotonicity of the unified quantum (r, s)-entropy \(E_{r}^{s}(\rho )\) and the unified quantum (r, s)-mutual information \(I_{r}^{s}(\rho )\) is discussed in this paper. Some basic properties of them are explored, and the following conclusions are established. (1) For any \(0<r<1, E_{r}^{s}(\rho )\) is increasing with respect to \(s\in (-\infty ,+\infty )\), and for any \(r\ge 1, E_{r}^{s}(\rho )\) is decreasing with respect to \(s\in (-\infty ,+\infty )\); (2) for any \(s>0\), \(E_{r}^{s}(\rho )\) is decreasing with respect to \(r\in (0,+\infty )\); (3) for any \(r>0, E_{r}^{s}(\rho )\) is convex with respect to \(s\in (-\infty ,+\infty )\); (4) for a product state \(\rho _{AB}\), there are two real numbers a and b such that \(I_{r}^{s}(\rho _{AB})\) is increasing with respect to \(s\in [0,a]\) when \(r\ge 1\) and it is decreasing with respect to \(s\in [b,0]\) when \(0<r<1\); (5) for a product state \(\rho _{AB}\), \(I_{r}^{s}(\rho _{AB})\) is decreasing with respect to \(r\in [r_s,+\infty )\) for each \(s>0\), where \(r_s={\mathrm {max}}\{a_s,b_s\}\), \(m>2\) with \(m-2\ln m=1\) and \({\mathrm {tr}}\rho _{A}^{a_s}={\mathrm {tr}}\rho _{B}^{b_s}=m^{-\frac{1}{s}}\).
    Download Collect
  • Waveguide Bragg Gratings in Ormocer((R))s for Temperature Sensing

    Girschikofsky, Maiko   Rosenberger, Manuel   Foerthner, Michael   Rommel, Mathias   Frey, Lothar   Hellmann, Ralf  

    Embedded channel waveguide Bragg gratings are fabricated in the Ormocer((R)) hybrid polymers OrmoComp((R)), OrmoCore, and OrmoClad by employing a single writing step technique based on phase mask technology and KrF excimer laser irradiation. All waveguide Bragg gratings exhibit well-defined reflection peaks within the telecom wavelengths range with peak heights of up to 35 dB and -3 dB-bandwidths of down to 95 pm. Furthermore, the dependency of the fabricated embedded channel waveguide Bragg gratings on changes of the temperature and relative humidity are investigated. Here, we found that the Bragg grating in OrmoComp((R)) is significantly influenced by humidity variations, while the Bragg gratings in OrmoCore and OrmoClad exhibit linear and considerably high temperature sensitivities of up to -250 pm/C and a linear dependency on the relative humidity in the range of -9 pm/%.
    Download Collect
  • Victoria\"s\r Dirty\r Secrets

    Cervellon   Marie-Cécile  

    Download Collect
3 4 5 6 7 8 9 10 11 12

Contact

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

Submit Feedback