Patent application number | Description | Published |
20120184733 | CATALYST COMPOSITION AND METHOD FOR PREPARING AMIDE USING THE SAME - The present invention provides a method for preparing an amide. The method includes the steps of performing in a reactor including a catalyst composition having a nitrogen-containing heterocyclic compound and sulfuric acid Beckman rearrangement of a ketoxime to form a product stream having the amide, wherein a molar ratio of the nitrogen-containing heterocyclic compound to the sulfuric acid is from 1:1 to 1:8; and separating an organic phase having the amide and an aqueous phase having the catalyst composition from the product stream. The present invention facilitates the regeneration of the catalyst composition with low water content, so as to increase the conversion rate of a ketoxime and the selectivity of an amide. | 07-19-2012 |
20120209029 | METHOD FOR PREPARING LARGE-SIZED TITANIUM-SILICALITE MOLECULAR SIEVE AND METHOD FOR PREPARING CYCLOHEXANONE OXIME USING THE MOLECULAR SIEVE - The present invention provides a method for preparing a large-sized titanium-silicalite molecular sieve, and a method for preparing cyclohexanone oxime using the large-sized titanium-silicalite molecular sieve. The method for preparing a large-sized titanium-silicalite molecular sieve includes preparing a mixture of a titanium source, a silicon source and a template agent; heating the mixture to form a gel mixture; mixing a colloidal silica with the gel mixture; heating the gel mixture mixed with the colloidal silica in a water bathe; and calcining the gel mixture mixed with the colloidal silica. In the present invention, the average particle size of the large-sized titanium-silicalite molecular sieve is more than 10 um, and the particle size distribution is centralized, so as to avoid the formation of titanium-oxygen-titanium bonding. The method for preparing cyclohexanone oxime using the large-sized titanium-silicalite molecular sieve results in high conversion rate, high selectivity and easy recovery. | 08-16-2012 |
20120271066 | METHOD FOR PREPARING TITANIUM-SILICALITE MOLECULAR SIEVE AND METHOD FOR PREPARING CYCLOHEXANONE OXIME USING THE MOLECULAR SIEVE - The present invention provides a method for preparing a titanium-silicalite molecular sieve, and a method for preparing cyclohexanone oxime using the titanium-silicalite molecular sieve. The method for preparing a titanium-silicalite molecular sieve includes the steps of preparing a mixture of a titanium source, a silicon source and a template agent, wherein the titanium source has a structure of formula (I); | 10-25-2012 |
20120277468 | TITANIUM-SILICALITE MOLECULAR SIEVE, METHOD FOR PREPARING THE SAME AND METHOD FOR PREPARING CYCLOHEXANONE OXIME USING THE MOLECULAR SIEVE - The present invention provides a titanium-silicalite molecular sieve and a method for preparing the same. The method includes the steps of preparing a mixture of a titanium source, a silicon source, a transition metal source, a template agent and water; heating the mixture to form a gel mixture; heating the gel mixture in a water bath; and calcining the gel mixture after the gel mixture in the water bath to form the titanium-silicalite molecular sieve. The present invention further provides a method for preparing cyclohexanone oxime by using the titanium-silicalite molecular sieve as the catalyst which results in high conversion rate, high selectivity and high usage efficiency of hydrogen peroxide. | 11-01-2012 |
20130041181 | TITANIUM-SILICALITE MOLECULAR SIEVE, METHOD FOR PREPARING THE SAME AND METHOD FOR PREPARING CYCLOHEXANONE OXIME USING THE MOLECULAR SIEVE - The present invention provides a titanium-silicalite molecular sieve and a method for preparing the same. The method includes the steps of preparing a mixture of a titanium source, a silicon source, a metal source selected from IIA to IVA elements and a template agent; heating the mixture to form a gel mixture; heating the gel mixture in a water bath; and calcining the gel mixture after the gel mixture in the water bath to form the titanium-silicalite molecular sieve. The present invention further provides a method for preparing cyclohexanone oxime by using the titanium-silicalite molecular sieve as the catalyst which results in high conversion rate, high selectivity and high usage efficiency of hydrogen peroxide. | 02-14-2013 |
20130053575 | CATALYST COMPOSITION AND METHOD FOR PREPARING AMIDE - The present invention provides a catalyst composition and a method for preparing an amide. The catalyst composition of the present invention including a hydroxylamine salt, sulfuric acid, and a nitrogen-containing heterocyclic compound is used for catalyzing a ketoxime to form an amide in the Beckman rearrangement reaction. The preparation of an amide by using the catalyst composition of the present invention has high conversion rate of a ketoxime, high selectivity of an amide and high tolerance to water. | 02-28-2013 |
20140031581 | METHOD FOR PREPARING PYRUVATE ESTER - A method for preparing a pyruvate ester is disclosed. In the method of the present invention, a lactate ester is oxidized by hydrogen peroxide in the presence of a Ti-Si molecular sieve catalyst. In the present invention, the Ti-Si molecular sieve catalyst is easily filtered and recycled, the reaction conditions are mild due to the usage of hydrogen peroxide, the process is simple and easily performed, the conversion rate of the lactate ester is high, and the selectivity of the pyruvate ester is high. | 01-30-2014 |
20140046079 | METHOD FOR PREPARING EPOXIDES - A method for preparing an epoxide is disclosed. The method for preparing an epoxide includes the step of performing a reaction of an alkene and oxidant in the presence of a Ti—Si molecular sieve as a catalyst, and increases the conversion rate of hydrogen peroxide and the yield of the epoxide. | 02-13-2014 |
20140100392 | METHOD FOR HYDROXYLATION OF PHENOL - A method for hydroxylation of phenol is disclosed. The method includes the step of performing a reaction of phenol and hydrogen peroxide to form diphenol in the presence of solid catalyst with zeolite framework, wherein the solid catalyst includes silicon oxide, titanium oxide and cobalt oxide. The solid catalyst used in the preparation of diphenol of the present invention has high conversion rate of diphenol, selectivity of diphenol and higher utilization rate of hydrogen peroxide without using high concentration of hydrogen peroxide. | 04-10-2014 |
20140179937 | METHOD FOR PRODUCING EPOXIDE - A method for producing an epoxide is provided. The method includes a step of performing a reaction of an olefine compound and an oxidant to form the epoxide by using a titanium-silicon molecular sieve as a catalyst, thereby increasing the conversion rate of the oxidant and the yield of the epoxide. | 06-26-2014 |
20140179938 | METHOD FOR PREPARING EPOXIDE - A method for producing an epoxide is disclosed. The method includes performing a reaction of an olefin compound and an oxidant by using a titanium-silicon molecular sieve as a catalyst, in the presence of a silicon oxide containing an alkaline earth metal as a coagent. The selectivity and yield of epoxide are increased by using a silicon oxide containing an alkaline metal as a coagent. | 06-26-2014 |
20140179951 | METHOD FOR PRODUCING KETOXIME - A method for producing a ketoxime is provided. The method includes the step of performing a reaction of a nitrogen-containing compound, ketone and an oxidant by using a titanium-silicon molecular sieve as a catalyst, so as to form the ketoxime, thereby increasing the yield and selectivity of the ketoxime. | 06-26-2014 |
20140179956 | METHOD FOR PREPARING CATECHOL - A method for preparing catechol is provided. The method includes performing hydroxylation of phenol by using zirconium-containing titanium silicalite as a catalyst in the presence of phenol, a solvent and hydrogen peroxide. The method uses zirconium-containing titanium silicalite as a catalyst to increase the selectivity of phenol and utilization of hydrogen peroxide, and thus to increase the overall reaction yield. | 06-26-2014 |
Patent application number | Description | Published |
20110040758 | GRID-BASED DATA CLUSTERING METHOD - A grid-based data clustering method comprises: a parameter setting step, a partition step, a searching step, a seed-classifying step, an extension step, and a termination step. Through the above-mentioned steps, data in a data set are disposed in a plurality of grids, and the grids are classified into dense grids and uncrowded grids for a cluster to extend from one of the dense grid to gradually combine data in other dense grids nearby. Consequently, convenience in parameter setting, efficiency and accuracy in data clustering, and performance in noise filtering are achieved. | 02-17-2011 |
20110055212 | DENSITY-BASED DATA CLUSTERING METHOD - A density-based data clustering method, comprising a parameter-setting step for setting a scanning radius and a minimum threshold value, a dividing step for dividing a space of a plurality of data points according to the scanning radius, a data-retrieving step for retrieving one data point out of the plurality of data points as a core data point, a searching step for calculating a distance between the core data point and each of the query points, a grouping determination step for determining whether a number of the neighboring points is smaller than the minimum threshold value. | 03-03-2011 |
20110072016 | DENSITY-BASED DATA CLUSTERING METHOD - A density-based data clustering method, comprising a parameter-setting step, a first retrieving step, a first determination step, a second determination step, a second retrieving step, a third determination step and first and second termination determination steps. The parameter-setting step sets parameters. The first retrieving step retrieves one data point and defines neighboring points. The first determination step determines whether the number of the data points exceeds the minimum threshold value. The second determination step arranges a plurality of first border symbols. The second retrieving step retrieves one seed data point from the seed list, arranges a plurality of second border symbols and defines seed neighboring points. The third determination step determines whether a data point density of searching ranges of the seed neighboring points is the same. The first termination determination step determines whether the clustering is finished. The second termination determination step determines whether to finish the method steps. | 03-24-2011 |
Patent application number | Description | Published |
20080306715 | Detecting Method Over Network Intrusion - A detecting method over network intrusion comprises: selecting a plurality of features contained within plural statistical data by a data-transforming module; normalizing a plurality of feature values of the selected features into the same scale to obtain a plurality of normalized feature data; creating at least one feature model by a data clustering technique incorporated with density-based and grid-based algorithms through a model-creating module; evaluating the at least one feature model through a model-identifying module to select a detecting model; and detecting whether a new packet datum belongs to an intrusion instance or not by a detecting module. | 12-11-2008 |
20110026830 | CODEBOOK GENERATING METHOD - A codebook generating method comprises a dividing and transforming step dividing an original image into original blocks and transforming each of the original blocks into an original vector; a parameter setting step setting a distortion tolerance and a predetermined number of representative blocks; a single group setting step setting the original vectors as a group; a preliminary grouping step grouping all the original vectors in a group currently having largest distortion into two groups using a grouping algorithm, wherein the preliminary grouping step is repeated until the number of groups is equal to the predetermined number of representative blocks; and a grouping step grouping all the original vectors based on a plurality of initial centroids to obtain final centroids, and storing vectors corresponding to the final centroids in a codebook, wherein the centroids of the groups are treated as the initial centroids. | 02-03-2011 |
20110066580 | CODEBOOK GENERATING METHOD - A codebook generating method comprises a dividing and transforming step dividing an original image into original blocks and transforming the original blocks into original vectors; a dividing step grouping the original vectors to obtain centroids; a first layer neuron training step selecting a portion of the centroids as first-level neurons; a grouping step assigning each of the original vectors to a closest first-level neuron so as to obtain groups; a second layer neuron assigning step assigning a number of second-level neurons in each of the groups, and selecting a portion of the original vectors in each of the groups as the second-level neurons; and a second layer neuron training step defining the original vectors in each of the groups as samples, training the second-level neurons in each of the groups to obtain final neurons, and storing vectors corresponding to the final neurons in a codebook. | 03-17-2011 |
Patent application number | Description | Published |
20090046630 | Data-Transmitting Method for Wireless Sensor Network - A data-transmitting method for wireless sensor network comprises: constructing a wireless sensor network having a plurality of nodes for information sensing and a sink for quest raising and data collecting; clustering the nodes to form a plurality of groups, with one of the nodes in each group being identified as a kernel; identifying one of all the nodes as a summit dissemination node and the kernels in all the groups as first level dissemination nodes; and transmitting data between the quest-raising sink and one of the first level dissemination nodes or summit dissemination node to collect information sensed by a source that is one of the nodes. | 02-19-2009 |
20120296904 | GRID-BASED DATA CLUSTERING METHOD - A grid-based data clustering method is disclosed. A parameter setting step sets a grid parameter and a threshold parameter. A diving step divides a space having a plurality of data points according to the grid parameter. A categorizing step determines whether a number of the data points contained in each grid is larger than or equal to a value of the threshold parameter. The grid is categorized as a valid grid if the number of the data points contained therein is larger than or equal to the value of the threshold parameter, and the grid is categorized as an invalid grid if the number of the data points contained therein is smaller than the value of the threshold parameter. The clustering step retrieves one of the valid grids. If the retrieved valid grid is not yet clustered, the clustering step performs horizontal and vertical searching/merging operations on the valid grid. | 11-22-2012 |
20120296905 | DENSITY-BASED DATA CLUSTERING METHOD - A density-based data clustering method executed by a computer system is disclosed. The method includes a setup step, a clustering step, an expansion step and a termination step. The setup step sets a radius and a threshold value. The clustering step defines a single cluster on a plurality of data points of a data set, and provides and adds a plurality of first boundary marks to a seed list as seeds. The expansion step expands the cluster from each seed of the seed list, and provides and adds at least one second boundary mark to the seed list as seeds. The termination step determines whether each of the data points is clustered, wherein the clustering step is re-performed if the determination is negative. | 11-22-2012 |
20120296906 | GRID-BASED DATA CLUSTERING METHOD - A grid-based data clustering method performed by a computer system includes a setup step, a dividing step, a categorizing step and an expanding/clustering step. The setup step sets a grid quantity and a threshold value. The dividing step divides a space containing a data set having a plurality of data points into a two-dimensional matrix. The matrix has a plurality of grids G(i,j) comprising a plurality of target sequences and a plurality of non-target sequences interlaced with the plurality of target sequences. The indices “i” and “j” of each grid G(i,j) represents the coordinate thereof. The categorizing step determines whether each of the grids is valid based on the threshold value. The expanding/clustering step respectively retrieves each of the grids of the target sequences, performs an expansion operation on each of the grids retrieved and clusters the plurality grids G(i,j). | 11-22-2012 |