LEADER 04546nam 22007815 450 001 9910991176903321 005 20250326115255.0 010 $a3-031-77944-4 024 7 $a10.1007/978-3-031-77944-2 035 $a(CKB)38111384500041 035 $a(DE-He213)978-3-031-77944-2 035 $a(MiAaPQ)EBC31975400 035 $a(Au-PeEL)EBL31975400 035 $a(OCoLC)1524420975 035 $a(EXLCZ)9938111384500041 100 $a20250326d2025 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDressed Photons to Revolutionize Modern Physics $eExploring Longitudinal Electromagnetic Waves and Off-Shell Quantum Fields /$fby Motoichi Ohtsu, Hirofumi Sakuma 205 $a1st ed. 2025. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2025. 215 $a1 online resource (XI, 118 p. 48 illus., 31 illus. in color.) 225 1 $aNano-Optics and Nanophotonics,$x2192-1989 311 08$a3-031-77943-6 327 $aHistorical Review of Dressed Photon -- Progresses in Experimental Studies on Dressed Photon -- Preliminary Theoretical Studies and Numerical Simulations -- A Quantum Walk Model for the Dressed Photon Energy Transfer -- Introductory Remarks on Theoretical Chapters -- Brief Review on Generalized Hamiltonian Structure -- O?-shell Electromagnetic Field -- Novel Aspect of Conformal Gravity -- Novel Cosmology to be Opened up by O?-shell Science -- Implications of the Novel Cosmology. 330 $aThis book presents an in-depth review of the recent interdisciplinary studies that have shed light on the mechanisms of the creation, energy transfer, and measurement of the dressed photon. A dressed photon is a type of photon that results from the interaction between light and matter in a confined space, typically on the scale of nanometers. It has been applied to nano-fabrication technologies, energy conversion technologies, and silicon light-emitting devices. Despite its extensive applications in various fields, the dressed photon's off-shell nature has posed challenges in describing it through conventional optical scientific theories. The book explains how, through a mathematical viewpoint, the underlying spatiotemporal vortex dynamics connect the dressed photon, the dark energy field, and the structure of the universe. The canonical equations of motion, which describe the time evolution of dynamical systems with Hamiltonian structure, play a key role in understanding these physical phenomena. In particular, the covariant form of equations of motion, where vortex tensors explicitly appear, corresponds to the transformed canonical equations of motion in the Eulerian representation. This newly augmented view of the equations of motion presents a deeper understanding of the interconnectedness of different physical phenomena, which can enlighten graduate students, junior scientists, and industry engineers engaged or interested in this field. 410 0$aNano-Optics and Nanophotonics,$x2192-1989 606 $aQuantum theory 606 $aNanophotonics 606 $aPlasmonics 606 $aNanotechnology 606 $aGeneral relativity (Physics) 606 $aParticles (Nuclear physics) 606 $aQuantum field theory 606 $aOptoelectronic devices 606 $aQuantum Physics 606 $aNanophotonics and Plasmonics 606 $aNanotechnology 606 $aGeneral Relativity 606 $aElementary Particles, Quantum Field Theory 606 $aOptoelectronic Devices 615 0$aQuantum theory. 615 0$aNanophotonics. 615 0$aPlasmonics. 615 0$aNanotechnology. 615 0$aGeneral relativity (Physics) 615 0$aParticles (Nuclear physics) 615 0$aQuantum field theory. 615 0$aOptoelectronic devices. 615 14$aQuantum Physics. 615 24$aNanophotonics and Plasmonics. 615 24$aNanotechnology. 615 24$aGeneral Relativity. 615 24$aElementary Particles, Quantum Field Theory. 615 24$aOptoelectronic Devices. 676 $a530.12 700 $aOhtsu$b Motoichi$4aut$4http://id.loc.gov/vocabulary/relators/aut$0808116 702 $aSakuma$b Hirofumi$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910991176903321 996 $aDressed Photons to Revolutionize Modern Physics$94349669 997 $aUNINA LEADER 06665nam 22008895 450 001 9910483971503321 005 20251226200559.0 010 $a3-319-21840-9 024 7 $a10.1007/978-3-319-21840-3 035 $a(CKB)3710000000454210 035 $a(SSID)ssj0001558437 035 $a(PQKBManifestationID)16183554 035 $a(PQKBTitleCode)TC0001558437 035 $a(PQKBWorkID)14819387 035 $a(PQKB)10418961 035 $a(DE-He213)978-3-319-21840-3 035 $a(MiAaPQ)EBC6298913 035 $a(MiAaPQ)EBC5594670 035 $a(Au-PeEL)EBL5594670 035 $a(OCoLC)915762923 035 $a(PPN)187688877 035 $a(UkBuK)1595072 035 $a(EXLCZ)993710000000454210 100 $a20150727d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures $e14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings /$fedited by Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege 205 $a1st ed. 2015. 210 1$cSpringer Nature$d2015 215 $a1 online resource (XIII, 646 p. 125 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9214 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-319-21839-5 327 $aContact Graphs of Circular Arcs -- Contact Representations of Graphs in 3D -- Minimizing the Aggregate Movements for Interval Coverage -- Online Bin Packing with Advice of Small Size -- On the Approximability of Orthogonal Order Preserving Layout Adjustment -- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs -- Generation of Colourings and Distinguishing Colourings of Graphs -- Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time -- On Coct-Free Multi-Coloring -- Semi-dynamic connectivity in the plane -- Interval Selection in the Streaming Model -- On the Bounded-Hop Range Assignment Problem -- Greedy Is an Almost Optimal Deque -- A New Approach for Contact Graph Representations and Its Applications -- Communication and Dynamic Networks -- Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm -- Select with Groups of 3 or 4 Approximating Nearest Neighbor Distances -- Linearity is Strictly More Powerful than Contiguity for Encoding Graphs -- On the Complexity of an Unregulated Traffic Crossing -- Finding Pairwise Intersections Inside a Query Range -- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing -- Polylogarithmic Fully Retroactive Priority Queues -- On the Minimum Eccentricity Shortest Path Problem -- Convex polygons in geometric triangulations -- Straight-line Drawability of a Planar Graph Plus an Edge -- Solving Problems on Graphs of High Rank-Width -- The Parametric Closure Problem -- Rooted Cycle Bases -- On the Chain Pair Simplification Problem -- Finding Articulation Points of Large Graphs in Linear Time -- LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design -- Universal Reconstruction of a String -- The complexity of dominating set reconfiguration -- Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes -- Competitive Diffusion on Weighted Graphs -- Sorting and Selection with Equality Comparisons -- Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs -- Fast and simple connectivity in graph timelines -- Dynamic Set Intersection -- Time-Space Trade-of is for Triangulations and Voronoi Diagrams -- A 2k-Vertex Kernel for Maximum Internal Spanning Tree -- Reconfiguration on sparse graphs -- Smoothed Analysis of Local Search Algorithms -- Optimal Shue Code with Permutation Instructions -- Non-Preemptive Scheduling on Machines with Setup Times -- A Moderately Exponential Time Algorithm for k -IBDD Satisfiability -- On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids -- Inferring People's Social Behavior by Exploiting Their Spatiotemporal Location Data -- lastic Geometric Shape Matching for Point Sets under Translations -- Constant Time Enumeration by Amortization -- Computing the Center of Uncertain Points on Tree Networks -- Swapping Colored Tokens on Graphs. 330 $aThis book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9214 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aNumerical analysis 606 $aComputer networks 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aNumerical Analysis 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 615 24$aComputer Communication Networks. 676 $a005.3 700 $aDehne$b Frank$4edt 702 $aDehne$b Frank$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSack$b Jörg-Rüdiger$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aStege$b Ulrike$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483971503321 996 $aAlgorithms and Data Structures$91967417 997 $aUNINA