Abstract:
Disclosed are a silodosin intermediate and a preparation method thereof. The silodosin intermediate has the structure shown by the formula (A). X is hydrogen or bromide and R1 is hydrogen. The formyl group may be a group having the structure shown by the formula I. R7 is a protecting group of carboxyl, and R2 is 3-hydroxypropyl or a group having the structure shown by the formula II. W is a protecting group of hydroxyl. A compound of the formula (A) according to the present invention may further be used for preparing a compound having the structure shown by the formula (D). By means of the intermediate and the preparation method therefor provided by the present invention, high-purity optically pure silodosin can be obtained, and the optical purity is above 99%.
Abstract:
One embodiment is a method that uses MapReduce and Relation Valued Functions (RVFs) with parallel processing to search a database and obtain search results.
Abstract:
A representation of a flow network having vertices connected by arcs is provided. The vertices include a first set of vertices that provide flow to a second set of vertices over arcs connecting the first set and second set of vertices. A balancing procedure in the network is performed that includes redistributing flows on arcs incident on the second set of vertices. The balancing procedure includes selecting a batch of the vertices in the second set, and redistributing flows on arcs incident on the selected batch of vertices. The selecting and redistributing are repeated for other batches of vertices in the second set.
Abstract:
Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters.
Abstract:
To coordinate tasks executed by a plurality of threads that each includes plural task sections, a call of a mark primitive to mark a first point after a first of the plural task sections is provided. Also, a call of a second primitive is provided to indicate that a second of the plural task sections is not allowed to begin until after the plurality of threads have each reached the first point.
Abstract:
The current application discloses a database management system that provides multiple-input, multiple-output-per-input user-defined-function-based operations. The database management system comprises at least one processor and electronic memory, a database-query processor, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that makes multiple calls to a multiple-input, multiple-output-per-input user-defined-function, in each call transmitting a next input to the multiple-input, multiple-output-per-input user-defined-function, and the multiple-input, multiple-output-per-input user-defined-function, executed on a computer processor controlled by computer instructions stored in a computer-readable memory, that uses three different memory buffers, the contents of which are maintained for three different time periods, to compute and return to the database-query processor multiple outputs in response to at least one of the multiple inputs.
Abstract:
A PET apparatus includes a detector array including individual detectors which receive radiation events from an imaging region. A movement controller controls at least one of relative longitudinal movement between a subject support and the detector array and circumferential movement between the detector array and the subject. A time stamp processor assigns a time stamp to each received radiation event. A list mode event storage buffer stores time stamped events. An event verification processor screens for coincidentally received radiation events, locations at which each pair of corresponding coincidentally received events defining a line of response. A reconstruction processor reconstructs valid events into an image representation of the imaging region.
Abstract:
Embodiments include methods, apparatus, and systems for using range queries in multidimensional data in a database. One embodiment is a method that defines a query box from a search for multidimensional data in a database. The method examines an intersection between a Z-interval and the query box by decomposing the Z-interval into hyper-boxes that are also Z-intervals in Z space. Items in the query box that match the search are discovered.
Abstract:
Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters.