Characterization of excimer laser beam parameters

1996 ◽  
Author(s):  
Klaus R. Mann ◽  
J. Ohlenbusch ◽  
Volker Westphal
Keyword(s):  
Laser Beam ◽  
Excimer Laser ◽  
Beam Parameters

High Resolution Displacement of Functional Groups onto Fluorocarbon Resin Surface by Using ArF Excimer Laser

1996 ◽  
Vol 451 ◽  
Author(s):  
T. Shimizu ◽  
M. Murahara
Keyword(s):  
Contact Angle ◽  
High Resolution ◽  
Laser Beam ◽  
Thin Layer ◽  
Functional Groups ◽  
Excimer Laser ◽  
Laser Fluence ◽  
Large Area ◽  
Three Solutions ◽  
Arf Excimer Laser

ABSTRACTA Fluorocarbon resin surface was selectively modified by irradiation with a ArF laser beam through a thin layer of NaAlO2, B(OH)3, or H2O solution to give a hydrophilic property. As a result, with low fluence, the surface was most effectively modified with the NaAlO2 solution among the three solutions. However, the contact angle in this case changed by 10 degrees as the fluence changed only 1mJ/cm2. When modifying a large area of the surface, high resolution displacement could not be achieved because the laser beam was not uniform in displacing functional groups. Thus, the laser fluence was successfully made uniform by homogenizing the laser beam; the functional groups were replaced on the fluorocarbon resin surface with high resolution, which was successfully modified to be hydrophilic by distributing the laser fluence uniformly.

SEARCHING A ROOM BY TWO GUARDS

2002 ◽  
Vol 12 (04) ◽  
pp. 339-352 ◽  
Author(s):  
SANG-MIN PARK ◽  
JAE-HA LEE ◽  
KYUNG-YONG CHWA
Keyword(s):  
Laser Beam ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Polygonal Region

We consider the problem of searching for mobile intruders in a polygonal region with one door by two guards. Given a simple polygon [Formula: see text] with a door d, which is called a room [Formula: see text], two guards start at d and walk along the boundary of [Formula: see text] to detect a mobile intruder with a laser beam between the two guards. During the walk, two guards are required to be mutually visible all the time and eventually meet at one point. We give a characterization of the class of rooms searchable by two guards and an O(n log n)-time algorithm to test if a given room admits a walk, where n is the number of the vertices in [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document