Kevin Houzhi Xu

US Patent:

6643638, Nov 4, 2003

Filed:

Mar 25, 2000

Appl. No.:

09/536343

Inventors:

Kevin Houzhi Xu - Bound Brook NJ 08805

International Classification:

G06F 1730

US Classification:

707 3, 707 2, 707 9, 707 10, 707100

Abstract:

A computer system and method is to store and manage data and to construct application programs. This system accepts uniform input expressions db-terms, by which the stored data can be referenced and user queries can be expressed. A database is a collection of nodes that are connected by a set of directed links. There are three types of links. By ignoring one type of the links, the database can be viewed as a set of trees. All the nodes in databases are viewed as functions; all the db-terms can be computed to their values if they existed against databases and according to computing rules. The tree structures embedded in databases illustrate the dependent relationships among the data, and provide build-in functions in manipulating the database and a theoretical guideline of data distribution. The function-argument-value relationships among the nodes in databases provide a theoretical guideline for a set of useful built-in functions.

US Patent:

8443004, May 14, 2013

Filed:

Mar 30, 2011

Appl. No.:

13/076382

Inventors:

Kevin Houzhi Xu - Bridgewater NJ, US

International Classification:

G06F 17/30

US Classification:

707796, 707790, 715700, 716 50, 717100, 717168, 717174

Abstract:

A computer system and method is to manage business data and logic in a uniformed manner. It is based on the theory of total recursive functions. As a result, it is a monolith consolidating the multiple-component architecture of traditional technologies in the fields of programming language and database management. Secondly, the properties of the theory of total recursive functions are uniquely demonstrated by a set of built-in operators of the system. Therefore, it offers novel approaches to many challenges in the fields of artificial intelligence and knowledge management facing the traditional technologies.

US Patent:

8554809, Oct 8, 2013

Filed:

May 26, 2011

Appl. No.:

13/116913

Inventors:

Yingchao Zhou - Beijing, CN
Wei Kang - Beijing, CN
Weigang Zhong - Beijing, CN
Chen Gong - Beijing, CN
Kevin Xu - Warren NJ, US
Sitaram Pawar - Shrewsbury MA, US

Assignee:

EMC Corporation - Hopkinton MA

International Classification:

G06F 7/00

US Classification:

707821, 707822

Abstract:

An online tree quota check tool computes quota usage of files in a directory tree while the structure of the directory tree keeps changing due to concurrent write access by other applications and clients. The quota check tool computes the quota usage without interfering with the ongoing file access operations that change the directory content and quota usage. A quota check database keeps track of which files have been checked and which have not, so that each file is checked and its quota usage is accumulated once and only once while directories are moved and directory scans are restarted as a result of the changing directory content. File system operations are modified to synchronize with the online tree quota check. The quota check tool can be single threaded or multi-threaded. A multi-threaded tool dispatches idle directory iteration threads to scan subdirectories in the directory tree.

US Patent:

59959584, Nov 30, 1999

Filed:

Sep 8, 1997

Appl. No.:

8/925847

Inventors:

Kevin Houzhi Xu - Ocean NJ

International Classification:

G06F 900

US Classification:

707 3

Abstract:

A computer system and method for storing and managing a database that has lambda-definable functions as its foundation. The database is a collection of nodes that are connected by a set of links, and further it is a directed acyclic graph constructed from the nodes and the links. There are two types of links. By ignoring one type of the links, the database can be viewed as a set of trees; and by ignoring another type of the links, the database can be viewed as another set of trees. The directed acyclic graph and the two sets of trees illustrate the dependent relationships among the data and provide means in manipulating the database. A node has a name for the purpose of identification; and a value that carries an unit of meanings of the database application. The value of a node is selected from a regular data type, user-defined data type, and lambda-definable functions. Managing lambda-definable functions allows a database to support infinite data with finite storage.

US Patent:

20220210655, Jun 30, 2022

Filed:

Mar 21, 2022

Appl. No.:

17/655575

Inventors:

- Basking Ridge NJ, US
Kevin Xu - Warren NJ, US
Robert Belson - Rockville MD, US

Assignee:

Verizon Patent and Licensing Inc. - Basking Ridge NJ

International Classification:

H04W 12/63
H04W 12/08
H04W 4/02
H04W 12/37

Abstract:

A system described herein may provide a technique for selectively granting or revoking/denying access to applications, services, data, etc. to a User Equipment (“UE”) based on location-based policies and a network-determined location of the UE. The network-determined location may be determined by elements of a wireless network, such as a Mobility Management Entity (“MME”), Access and Mobility Management Function (“AMF”), or other suitable element.

US Patent:

20210329534, Oct 21, 2021

Filed:

Apr 20, 2020

Appl. No.:

16/853239

Inventors:

- Arlington VA, US
Kevin Xu - Warren NJ, US
Rashmitha Sirsi - Millburn NJ, US
Valerie Feldmann - Morristown NJ, US
Robert Belson - Rockville MD, US

International Classification:

H04W 48/04
H04W 28/02
H04W 4/021

Abstract:

A system described herein may provide techniques for a geographically-based traffic handling policy. An originating device may mark traffic with geographic restriction information, such as in a header of network traffic, indicating a geographic restriction on the propagation of the traffic. The geographic restriction may indicate a geographic region in which the traffic may be forwarded, or a geographic region in which the traffic is prohibited from being forwarded. Network devices in a path between the originating device and a destination device may determine whether to drop the traffic or perform other policy-related actions based on whether such devices are inside the geographic region in which the traffic may be forwarded. In some implementations a destination device may register as an exception to such policies, based on which an originating device or a router may bypass geographically-based traffic handling policies with respect to marked traffic directed to the destination device.

US Patent:

20200159611, May 21, 2020

Filed:

Jan 14, 2020

Appl. No.:

16/742665

Inventors:

- Hopkinton MA, US
Kevin Xu - Warren NJ, US
Abhinav Duggal - Milpitas CA, US
Atul Avinash Karmarkar - San Jose CA, US

International Classification:

G06F 11/07
G06F 16/27
G06F 9/48

Abstract:

A controller at a source site generates a set of tasks associated with a replication job. Each task includes one or more of copying an object from the source to destination site, or deleting an object from the destination site. The tasks are placed onto a message queue at the source site. Source worker nodes at the source site retrieve the tasks from the source site message queue for processing in conjunction with destination worker nodes at the destination site. A destination worker node, upon receiving a task from a source worker nodes, places the task onto a message queue at the destination site for retrieval by a backend worker node that handles writing to an object store at the destination site.

US Patent:

20200125410, Apr 23, 2020

Filed:

Oct 29, 2019

Appl. No.:

16/667147

Inventors:

- Hopkinton MA, US
Philip Shilane - Newtown PA, US
Kevin Xu - Warren NJ, US
Abhinav Duggal - Milpitas CA, US

International Classification:

G06F 9/50
G06F 16/27
G06F 9/54

Abstract:

A schedule is stored indicating a frequency of replication from source to destination sites. When a replication job is initiated, information identifying one or more objects at the source site to be replicated is copied into a snapshot without pausing user operations against the one or more objects. The snapshot is compared with a previous snapshot to generate replication tasks for the replication job. The replication tasks are placed onto a message queue at the source site, where a worker node at the source site retrieves a replication task from the message queue and processes the replication task in conjunction with a worker node at the destination site.