scholarly journals Dual Cellular-Path (MIHP) Healthy Urbanism － Justifying, Peacebuilding Surveillance at Borderlands / Kinmen

2021 ◽  
Author(s):  
Li-Yen Hsu
Keyword(s):  
Wireless Communications ◽  
Electromagnetic Interference ◽  
Wicked Problems ◽  
Information Loss ◽  
Spider Webs ◽  
Hamiltonian Paths ◽  
Dual Sensor ◽  
Sensor Information ◽  
Cube Connected Cycles ◽  
Mutually Independent

Holistic information integrity for managing wicked problems, developing equity is getting attention. Artifitial intelligence based topologies, dual sensor-information nodes, are prototyped to offer more availability, reliability, maintainability for operating healthy urbanism. Bipartite spider-webs, cube-connected cycles are aimed in ‘the radial-ring urban-building skeleton’ and ‘wetlands and sparsely populated areas’, respectively. Furthermore, honeycomb tori, mathematical HT(m), m≥2, for tasks related to wireless communications, are found having two mutually independent Hamiltonian paths (MIHP). This parallelism creates dual cipher-coding, supports logistic privacy, and help prevent information loss, electromagnetic interference, unexpected changes caused by such as clogged water.

Mutually independent hamiltonian paths in star networks

Networks ◽  
2005 ◽  
Vol 46 (2) ◽  
pp. 110-117 ◽  
Author(s):  
Cheng-Kuan Lin ◽  
Hua-Min Huang ◽  
Lih-Hsing Hsu ◽  
Sheng Bau
Keyword(s):  
Hamiltonian Paths ◽  
Star Networks ◽  
Mutually Independent

Sonochemically activated synthesis of gradationally complexed Ag/TEMPO-oxidized cellulose for multifunctional textiles with high electrical conductivity, super-hydrophobicity, and efficient EMI shielding

2020 ◽  
Vol 8 (40) ◽  
pp. 13990-13998 ◽  
Author(s):  
Sunghwan Hong ◽  
Seong Soo Yoo ◽  
Jun Young Lee ◽  
Pil J. Yoo
Keyword(s):  
Electrical Conductivity ◽  
Electromagnetic Interference ◽  
Electronic Device ◽  
Information Loss ◽  
Oxidized Cellulose ◽  
High Electrical Conductivity ◽  
Emi Shielding ◽  
Device Malfunction

With growing concerns over electronic device malfunction and the resulting information loss caused by electromagnetic interference (EMI), extensive studies have been performed in developing EMI shielding techniques.

scholarly journals On mutually independent hamiltonian paths

2006 ◽  
Vol 19 (4) ◽  
pp. 345-350 ◽  
Author(s):  
Yuan-Hsiang Teng ◽  
Jimmy J.M. Tan ◽  
Tung-Yang Ho ◽  
Lih-Hsing Hsu
Keyword(s):  
Hamiltonian Paths ◽  
Mutually Independent

MUTUALLY INDEPENDENT HAMILTONIAN PATHS AND CYCLES IN HYPERCUBES

2006 ◽  
Vol 07 (02) ◽  
pp. 235-255 ◽  
Author(s):  
CHAO-MING SUN ◽  
CHENG-KUAN LIN ◽  
HUA-MIN HUANG ◽  
LIH-HSING HSU
Keyword(s):  
Bipartite Graph ◽  
Hamiltonian Cycle ◽  
Hamiltonian Path ◽  
Hamiltonian Cycles ◽  
Hamiltonian Paths ◽  
Mutually Independent ◽  
Hamiltonian Laceability

Two hamiltonian paths P1 = 〈v1, v2, …, vn(G) 〉 and P2 = 〈 u1, u2, …, un(G) 〉 of G are independent if v1 = u1, vn(G) = un(G), and vi ≠ ui for 1 < i < n(G). A set of hamiltonian paths {P1, P2, …, Pk} of G are mutually independent if any two different hamiltonian paths in the set are independent. A bipartite graph G is hamiltonian laceable if there exists a hamiltonian path joining any two nodes from different partite sets. A bipartite graph is k-mutually independent hamiltonian laceable if there exist k-mutually independent hamiltonian paths between any two nodes from different partite sets. The mutually independent hamiltonian laceability of bipartite graph G, IHPL(G), is the maximum integer k such that G is k-mutually independent hamiltonian laceable. Let Qn be the n-dimensional hypercube. We prove that IHPL(Qn) = 1 if n ∈ {1,2,3}, and IHPL(Qn) = n - 1 if n ≥ 4. A hamiltonian cycle C of G is described as 〈 u1, u2, …, un(G), u1 〉 to emphasize the order of nodes in C. Thus, u1 is the beginning node and ui is the i-th node in C. Two hamiltonian cycles of G beginning at u, C1 = 〈 v1, v2, …, vn(G), v1 〉 and C2 = 〈 u1, u2, …, un(G), u1 〉, are independent if u = v1 = u1, and vi ≠ ui for 1 < i ≤ n(G). A set of hamiltonian cycles {C1, C2, …, Ck} of G are mutually independent if any two different hamiltonian cycles are independent. The mutually independent hamiltonianicity of graph G, IHC(G), is the maximum integer k such that for any node u of G there exist k-mutually independent hamiltonian cycles of G starting at u. We prove that IHC(Qn) = n - 1 if n ∈ {1,2,3} and IHC(Qn) = n if n ≥ 4.

Sign in / Sign up

Export Citation Format

Share Document