Abstract: The invention discloses a method for determining vertical well stratified fracturing crack length based on interlayer equilibrium development. According to the method, interlayer equilibrium development can be achieved by determining the crack length of fracturing of each layer in the condition that an oil well meets the productivity requirements. The method comprises the following steps: 1) a threshold pressure gradient of each layer is determined; 2) a relationship chart of the crack half-length xf and the equivalent well diameter rwe is established; 3) daily oil production rate per unit thickness Qc meeting the production requirements is calculated; 4) the equivalent well diameter rwe of each layer is calculated according to the daily oil production rate Qc; and 5) the crack half-length xf of fracturing of each layer is calculated according to the equivalent well diameter rwe of each layer.

Abstract: The present disclosure provides an arbitration line-based full-duplex SPI communication method. Said method comprises: a communication requester detecting a first arbitration line corresponding to the communication requester and a second arbitration line corresponding to a communication responder, and if both the first arbitration line and the second arbitration line are at a low potential, pulling up the potential of the first arbitration line; when the communication responder detects the first arbitration line is at a high potential, pulling up the potential of the second arbitration line; when the communication requester detects the second arbitration line is at a high potential, determining the communication responder is in a communicating state; the communication requester and the communication responder sending message header data and message text data to each other.

Abstract: The present disclosure relates to a method and system for determining a technical limit well spacing for chemical flooding for a heavy-oil reservoir. This method includes: establishing a reservoir numerical simulation model; setting up injection and production wells according to a set well spacing, and using the reservoir numerical simulation model to calculate an average pressure, an average crude oil viscosity and an average permeability at each grid point between the injection and production wells within m days; calculating a driving pressure gradient of each grid point, and drawing a driving pressure gradient curve; calculating a starting pressure gradient of each grid, and drawing a starting pressure gradient curve; determining a relationship between the driving pressure gradient curve and the starting pressure gradient curve. In this manner the present disclosure calculates the limit well spacing for chemical flooding for the heavy-oil reservoir after steam stimulation.

Abstract: The invention discloses a method for determining vertical well stratified fracturing crack length based on interlayer equilibrium development. According to the method, interlayer equilibrium development can be achieved by determining the crack length of fracturing of each layer in the condition that an oil well meets the productivity requirements. The method comprises the following steps: 1) a threshold pressure gradient of each layer is determined; 2) a relationship chart of the crack half-length xf and the equivalent well diameter rwe is established; 3) daily oil production rate per unit thickness Qc meeting the production requirements is calculated; 4) the equivalent well diameter rwe of each layer is calculated according to the daily oil production rate Qc; and 5) the crack half-length xf of fracturing of each layer is calculated according to the equivalent well diameter rwe of each layer.

Abstract: A distributed transaction network for processing and verifying transactions asynchronously between transaction parties comprising a transferor and a transferee, the transferor having an obligation to transfer control of assets to the transferee. Each transaction party is randomly assigned a verifier upon it joining the network, which verifies the transaction of its transaction party by ensuring the asset of the transferor satisfies the transaction obligation and no fork condition exists. The transaction is executed only upon every verifier verifying and signing the transaction. The distributed transaction network further has a directed acyclic transaction map comprising topologically sorted transactions forming a single transaction path of sequentially executed transactions for each transaction party, to prevent the occurrence of race conditions, double spend, or fork conditions.

Abstract: A transaction network comprising a plurality of party devices interconnected via a communication network, each party device corresponding to a transaction party. The transaction network facilitates localized creation and enforcement of a transferable promise involving an obligor and an owner, the obligor being required to perform an obligatory action upon the owner invoking the transferable promise. The transferable promise is encrypted and signed to protect its integrity, and is invocable only by the owner. The obligor further verifies the transferable promise upon its invocation to prevent a double-spend attempt. The transferable promise contains a continuation executed upon invocation to cause an executing device of the obligor to perform the obligatory action. The transferable promise is adapted to effect the delivery of a digital asset or digital representation of a physical asset, or the performance of a service, and may be transferred, assigned, and sold between transaction parties as an asset.

Abstract: A distributed transaction network for processing and verifying transactions asynchronously between transaction parties comprising a transferor and a transferee, the transferor having an obligation to transfer control of assets to the transferee. Each transaction party is randomly assigned a verifier upon it joining the network, which verifies the transaction of its transaction party by ensuring the asset of the transferor satisfies the transaction obligation and no fork condition exists. The transaction is executed only upon every verifier verifying and signing the transaction. The distributed transaction network further has a directed acyclic transaction map comprising topologically sorted transactions forming a single transaction path of sequentially executed transactions for each transaction party, to prevent the occurrence of race conditions, double spend, or fork conditions.

Abstract: The present invention relates to technical fields of organic chemistry and pharmaceutical chemistry, specifically to water-soluble rapamycin derivatives modified with glutathione. More specifically, the present invention discloses a compound of formula I and the preparation method thereof, wherein R1 and R2 are as defined in the description. The compound of formula I can be used in inducing immunosuppression and in the treatment of diseases such as transplant rejection and solid tumor, etc.

Abstract: The present invention relates to technical fields of organic chemistry and pharmaceutical chemistry, specifically to water-soluble rapamycin derivatives modified with glutathione. More specifically, the present invention discloses a compound of formula I and the preparation method thereof, wherein R1 and R2 are as defined in the description. The compound of formula I can be used in inducing immunosuppression and in the treatment of diseases such as transplant rejection and solid tumor, etc.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: A method is provided for applying a visual classification scheme to a map. A target region comprising a plurality of display units is identified within the map. It is then determined whether all of the display units within the target region can be assigned to the same class based on interpolated data values obtained for only a subset of the display units within the target region. If the determination is positive, then all of the display units within the target region are assigned to the same class and a visual indicator is assigned to each display unit in the target region based on the class to which the display unit was assigned. If the determination is negative, then the target region is divided into a plurality of subdivided target regions and the foregoing method is applied to each of the subdivided target regions.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Abstract: Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.