A5101968542- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Graph theory and applications
- Limits and Structures in Graph Theory
- Synthesis and Properties of Aromatic Compounds
- Interconnection Networks and Systems
- Chaos-based Image/Signal Encryption
- Bluetooth and Wireless Communication Technologies
- Cryptographic Implementations and Security
- Cryptography and Data Security
- Cryptography and Residue Arithmetic
- Information and Cyber Security
- graph theory and CDMA systems
- Security in Wireless Sensor Networks
- Topic Modeling
- Coding theory and cryptography
- Discourse Analysis in Language Studies
- Biomedical Text Mining and Ontologies
- Complexity and Algorithms in Graphs
- History and advancements in chemistry
- Computational and Text Analysis Methods
- Cooperative Communication and Network Coding
- Management and Marketing Education
- Topological and Geometric Data Analysis
- Advanced Research in Systems and Signal Processing
National Institute of Standards and Technology
2015-2024
National Institute of Standards
2020-2024
Huaqiao University
2015-2023
Information Technology Laboratory
2019-2022
Johns Hopkins Medicine
2015
Johns Hopkins University
2012-2015
Nankai University
2011-2014
University of Baltimore
2012
University of Sheffield
2004-2007
The Information Technology Laboratory (ITL) at the National Institute of Standards and (NIST) promotes U.S. economy public welfare by providing technical leadership
// Xinyan Wu 1, 2, * , Muhammad Saddiq Zahari Binyun Ma 6 Ren Liu Santosh Renuse 5 Nandini A. Sahasrabuddhe Lily Chen 3 Raghothama Chaerkady 2 Min-Sik Kim Jun Zhong Christine Jelinek Mustafa Barbhuiya Pamela Leal-Rojas 7 Yi Yang Manoj Kumar Kashyap Arivusudar Marimuthu Min Ling 1 Mary Jo Fackler Vanessa Merino Zhen Zhang Cynthia Zahnow Edward Gabrielson 3, 4 Vered Stearns Juan Carlos Roa 8 Saraswati Sukumar Parkash S. Gill Akhilesh Pandey Department of Biological Chemistry, Johns Hopkins...
This report summarizes study results on pairing-based cryptography. The main purpose of the is to form NIST's position standardizing and recommending cryptography schemes currently published in research literature standardized other standard bodies. reviews mathematical background pairings. includes topics such as pairing-friendly elliptic curves how compute various It a brief introduction existing identity-based encryption (IBE) cryptographic using pairing technology. provides complete...
A quantitative/interpretative approach to the comparative linguistic analysis of media texts is proposed and applied a contrastive from English-language China Daily UK Times look for evidence differences in what Labov calls “evaluation.” These are then correlated roles played by Britain their respective societies. The aim demonstrate that, despite reservations related Chinese not being written journalists' native language, direct comparison British with English can yield valuable insights...
A vertex-colored graph $G$ is rainbow vertex-connected if any pair of distinct vertices are connected by a path whose internal have colors. The vertex-connection number $G$, denoted $rvc(G)$, the minimum colors that needed to make vertex-connected. In this paper we give Nordhaus-Gaddum-type result number. We prove when and $\bar{G}$ both connected, then $2\leq rvc(G)+rvc(\bar{G})\leq n-1$. Examples given show upper bound lower best possible for all $n\geq 5$.
A total-colored path is total rainbow if both its edges and internal vertices have distinct colors.The connection number of a connected graph G, denoted by trc(G), the smallest colors that are needed in total-coloring G order to make connected, is, any two path.In this paper, we study computational complexity graphs.We show deciding whether given makes it NP-Complete.We also prove trc(G) = 3 NP-Complete.