Browsing by Author "Chang, Chung-Hao"

Now showing 1 - 2 of 2

Design and Fabricate a Contact Lens Sensor with a Micro-Inductor Embedded for Intraocular Pressure Monitoring
(2012)
Tseng, Chien-Kai
;
Huang, Yu-Chieh
;
Tsai, Shang-Wei
;
Yeh, Guan-Ting
;
Chang, Chung-Hao
This paper presents a new type of micro-inductor sensor for intraocular pressure (IOP) measurement on soft contact lens substructure. The sensor was designed and fabricated by using MEMS fabrication technologies. The contact lens is for wearing on a cornea such that a curvature of the contact lens corresponds substantially to that of the cornea, and is preferably made of Hydroxyethylmethacrylate (HEMA) by cast-molding method of soft contact lens for high oxygen permeability and comfortable long-duration wearing. In this paper, we discuss a contact lens with micro-inductor measurement principle followed by a brief description of our sensor design and fabrication. Our first prototype without wireless has been tested in lab-simulation bench. We obtain a simulation and measurement results have good linearity between micro-inductor radius variation and oscillation frequency. In future work will be to optimize the fabrication technology and the design to reach a better resolution, also a radio frequency integrated circuit (RFIC) and antenna will be designed preferably embedded in the contact lens so that inductance value transfers to frequency value via LC oscillator circuit and transmits intraocular pressure sensing signal by wireless telemetry system.
The super spanning connectivity and super spanning laceability of the enhanced hypercubes
(2009-04-01)
Chang, Chung-Hao
;
Lin, Cheng-Kuan
;
Tan, Jimmy J. M.
;
Huang, Hua-Min
;
Hsu, Lih-Hsing
A k -container C(u,v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u,v) of G is a k (*) -container if it contains all vertices of G. A graph G is k (*) -connected if there exists a k (*)-container between any two distinct vertices of G. Therefore, a graph is 1(*)-connected (respectively, 2(*)-connected) if and only if it is Hamiltonian connected (respectively, Hamiltonian). A graph G is super spanning connected if there exists a k (*)-container between any two distinct vertices of G for every k with 1a parts per thousand currency signka parts per thousand currency sign kappa(G) where kappa(G) is the connectivity of G. A bipartite graph G is k (*) -laceable if there exists a k (*)-container between any two vertices from different partite set of G. A bipartite graph G is super spanning laceable if there exists a k (*)-container between any two vertices from different partite set of G for every k with 1a parts per thousand currency signka parts per thousand currency sign kappa(G). In this paper, we prove that the enhanced hypercube Q (n,m) is super spanning laceable if m is an odd integer and super spanning connected if otherwise.