James Palmer
Northern Arizona University
53 Papers
239 Citations
James Palmer is an academic researcher from Northern Arizona University. The author has contributed to research in topics: K shortest path routing & Shortest path problem. The author has an hindex of 10, co-authored 53 publications. Previous affiliations of James Palmer include University of Salford & Balliol College.
Chat about Author
Papers
Immobilization of cellulase on a silica gel substrate modified using a 3-APTES self-assembled monolayer
TL;DR: It was observed that the immobilized cellulase retained 48 % of its initial activity after 4 days, and 22 % even after 14 days, and significant activity over multiple reuses was observed.
Making Extreme Caricatures with a New Interactive 2D Deformation Technique with Simplicial Complexes
Ergun Akleman,James Palmer,Ryan Logan +2 more
- 01 Jan 2006
TL;DR: A new interactive 2D deformation technique to make caricatures with extreme exaggerations using simplices as deformation primitives to transform each vertex of a texture mapped grid.
49
Can Ternary Computing Improve Information Assurance
Bertrand Cambou,Paul G. Flikkema,James Palmer,Donald Telesca,Christopher Philabaum +4 more
- 02 Mar 2018
TL;DR: It is suggested that balanced ternary logic can be valuable to Internet of Things security, authentication of connected vehicles, as well as hardware and software assurance, and a ternaries encryption scheme between a computer and smartcard based on public key exchange through non-secure communication channels is developed.
Microreactors for Syngas Conversion to Higher Alkanes: Characterization of Sol−Gel-Encapsulated Nanoscale Fe−Co Catalysts in the Microchannels
Venkata S. Nagineni,Shihuai Zhao,Avinash Potluri,Yu Liang,Upali Siriwardane,Naidu V. Seetala,Ji Fang,James Palmer,Debasish Kuila +8 more
TL;DR: In this article, a mixture of mixed-metal Fe−Co Fischer−Tropsch catalysts in alumina sol−gel for conversion of syngas (CO + H2) to higher alkanes is described.
25
k -link shortest paths in weighted subdivisions
Ovidiu Daescu,Joseph S. B. Mitchell,Simeon Ntafos,James Palmer,Chee Yap +4 more
- 15 Aug 2005
TL;DR: In this article, the authors studied the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the path.