HAN SHERWIN has a total of 13 patent applications. It decreased the IP activity by 100.0%. Its first patent ever was published in 2011. It filed its patents most often in United States, WIPO (World Intellectual Property Organization) and China. Its main competitors in its focus markets computer technology are SHENZHEN CORERAINTECHNOLOGIES CO LTD, ALPHAICS CORP and Shandong shanda ouma software co ltd.
# | Country | Total Patents | |
---|---|---|---|
#1 | United States | 10 | |
#2 | WIPO (World Intellectual Property Organization) | 2 | |
#3 | China | 1 |
# | Industry | |
---|---|---|
#1 | Computer technology |
# | Technology | |
---|---|---|
#1 | Specific computer systems | |
#2 | Electric digital data processing | |
#3 | Bioinformatics |
# | Name | Total Patents |
---|---|---|
#1 | Han Sherwin | 13 |
#2 | Zhou Cuifeng | 2 |
#3 | Pan Aihua | 2 |
#4 | Zhu David | 1 |
Publication | Filing date | Title |
---|---|---|
US2017017888A1 | Nondeterministic turing machine computer architecture for efficient processing using spatial relationships | |
US2016063084A1 | Database without structured query language | |
US2015074024A1 | Inverse function method of boolean satisfiability (SAT) | |
CN105190632A | A polynomial method of constructing a non-deterministic (NP) turing machine | |
WO2014152541A1 | Spatial arithmetic method of sequence alignment | |
US2014207839A1 | Spatial Arithmetic Method of Integer Factorization | |
US2012066282A1 | Whole 1 number method of integer factorization | |
US2013179378A1 | Knowledge Reasoning Method of Boolean Satisfiability (SAT) |