会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • Method of and apparatus for separation by agglomeration
    • 通过附聚分离的方法和装置
    • US5338421A
    • 1994-08-16
    • US100170
    • 1993-08-02
    • Naoki AbeFumio KawaharaNoboru Inoue
    • Naoki AbeFumio KawaharaNoboru Inoue
    • B01D17/06B01D21/00C02F1/463
    • B01D21/0009B01D17/06
    • A method of separating an aqueous colloidal solution by agglomeration into water and agglomerate of colloidal particles by applying voltage to the aqueous colloidal solution to promote the agglomeration of colloidal particles. The frequency of the voltage to be applied to the aqueous colloidal solution is increased to about 10 kHz to improve efficiency of agglomeration and suppress electrolysis of water. As the frequency is increased, hydrogen is generated earlier than the reaction of oxygen generated by the electrolysis of water with the colloidal particles, thus not oxidizing the colloidal particles. Further, as the frequency is increased, the colloidal particles tend to obtain a greater oscillation energy, thus facilitating the agglomeration thereof.
    • 通过向水性胶体溶液施加电压以促进胶体颗粒的聚集,将凝胶状水溶胶分离成水和胶体颗粒团聚体的方法。 施加到水性胶体溶液的电压的频率增加到约10kHz,以提高凝聚效率并抑制水的电解。 随着频率的增加,氢比电解水与胶体粒子产生的氧的反应产生得早,因此不氧化胶体粒子。 此外,随着频率的增加,胶体颗粒倾向于获得更大的振荡能量,从而有助于其凝聚。
    • 43. 发明授权
    • Method and program for file information write processing
    • 文件信息写入处理方法和程序
    • US08468290B2
    • 2013-06-18
    • US12212439
    • 2008-09-17
    • Naoki Abe
    • Naoki Abe
    • G06F17/30
    • G06F3/0643G06F3/0619G06F3/0676G06F3/0679
    • The file information write processing method according to the present invention is a file information write processing method wherein a computer executes a process for outputting instruction corresponding to a file information write instruction from an application to a device driver, wherein: searching clusters which are empty areas within an actual data area of a memory unit of the computer, and obtaining the search result; if clusters which are empty areas exist, writing information to overwrite to one or more clusters within the actual data area of the memory unit which is a target of the write instruction from the application, to the clusters which are empty areas; and freeing clusters which were to be overwritten by the information written to the empty area clusters.
    • 根据本发明的文件信息写入处理方法是文件信息写入处理方法,其中计算机执行用于将与文件信息写入指令相对应的指令从应用程序输出到设备驱动程序的处理,其中:搜索作为空区域的群集 在计算机的存储器单元的实际数据区域内,并获得搜索结果; 如果存在作为空区域的簇,则写入信息以覆盖作为来自应用的写指令的目标的存储器单元的实际数据区域内的一个或多个簇到作为空区域的簇; 并释放被写入空区域的信息覆盖的簇。
    • 46. 发明授权
    • Image forming apparatus
    • 图像形成装置
    • US07978987B2
    • 2011-07-12
    • US12211889
    • 2008-09-17
    • Naoki Abe
    • Naoki Abe
    • G03G15/00
    • G03G15/5008G03G15/0189G03G15/0194G03G2215/0141G03G2215/0158
    • In an image forming apparatus, an image forming portion forms an image on a rotator. A storage portion stores change characteristics information relevant to correction parameters corresponding to phase points of the rotator. A designating portion sequentially designates the correction parameters based on the change characteristics information. A correcting portion corrects an image forming position on the rotator based on the correction parameter designated by the designating portion. When it is determined, based on a detecting phase point of the rotator detected by a detecting portion, that the current phase of the rotator corresponds to a gradual phase point at which the correction parameter changes at a rate equal to or lower than a predetermined value, the designation by said designating portion is shifted to the correction parameter corresponding to the gradual phase point.
    • 在图像形成装置中,图像形成部在旋转体上形成图像。 存储部存储与对应于旋转体的相位点的校正参数相关的变化特性信息。 指定部分根据变化特征信息依次指定校正参数。 校正部根据由指定部指定的校正参数来校正旋转体上的图像形成位置。 当基于由检测部检测到的旋转体的检测相位点确定旋转器的当前相位对应于校正参数以等于或低于预定值的速率变化的逐渐相位点时 ,所述指定部分的指定被移动到对应于逐渐相位点的校正参数。
    • 47. 发明授权
    • Image forming apparatus
    • 图像形成装置
    • US07847810B2
    • 2010-12-07
    • US12401868
    • 2009-03-11
    • Naoki Abe
    • Naoki Abe
    • B41J2/385
    • H04N1/0473G03G15/0194G03G15/043G03G2215/0158H04N2201/04748H04N2201/04767
    • An image forming apparatus is provided. A second photoconductor is disposed at a downstream side of a first photoconductor in a moving direction of a medium. First and second exposure units form first and second electrostatic latent images on the first and second photoconductors line by line at first and second exposure timing intervals in first and second exposure enabling time periods based on successive lines of first and second image data, respectively. A correction unit corrects at least one of the first and second exposure timing intervals. A change unit changes the second exposure enabling time period so as to suppress a difference between the number of the successive lines of the first image data and the number of the successive lines of the second image data.
    • 提供一种图像形成装置。 第二感光体在介质的移动方向上设置在第一感光体的下游侧。 第一和第二曝光单元分别基于第一和第二图像数据的连续行,分别在第一和第二曝光允许时间段中的第一和第二曝光时间间隔上逐行地在第一和第二光电导体上形成第一和第二静电潜像。 校正单元校正第一和第二曝光定时间隔中的至少一个。 改变单元改变第二曝光使能时间段,以便抑制第一图像数据的连续行数与第二图像数据的连续行数之间的差异。
    • 48. 发明申请
    • METHODS AND SYSTEMS FOR COST-SENSITIVE BOOSTING
    • 成本敏感性升高的方法和系统
    • US20100042561A1
    • 2010-02-18
    • US12190325
    • 2008-08-12
    • Naoki AbeAurelie C. Lozano
    • Naoki AbeAurelie C. Lozano
    • G06F15/16
    • G06N99/005
    • Multi-class cost-sensitive boosting based on gradient boosting with “p-norm” cost functionals” uses iterative example weighting schemes derived with respect to cost functionals, and a binary classification algorithm. Weighted sampling is iteratively applied from an expanded data set obtained by enhancing each example in the original data set with as many data points as there are possible labels for any single instance, and where each non-optimally labeled example is given the weight equaling a half times the original misclassification cost for the labeled example times the p−1 norm of the average prediction of the current hypotheses. Each optimally labeled example is given the weight equaling the sum of the weights for all the non-optimally labeled examples for the same instance. Component classification algorithm is executed on a modified binary classification problem. A classifier hypothesis is output, which is the average of all the hypotheses output in the respective iterations.
    • 基于使用“p范数”成本函数梯度提升的多类成本敏感性提升“使用相对于成本函数导出的迭代示例加权方案和二进制分类算法。 通过增加原始数据集中的每个示例获得的扩展数据集,对任何单个实例可能的标签具有尽可能多的数据点,并且每个非最佳标记的示例给出权重等于一半的加权采样 乘以标记示例的原始错误分类成本乘以当前假设的平均预测的p-1范数。 给出每个最佳标记的例子,其权重等于同一实例的所有非最佳标记的示例的权重之和。 对修改的二进制分类问题执行组件分类算法。 输出分类器假设,它是各自迭代中输出的所有假设的平均值。
    • 49. 发明授权
    • Method and apparatus for presenting feature importance in predictive modeling
    • 在预测建模中呈现特征重要性的方法和装置
    • US07561158B2
    • 2009-07-14
    • US11329437
    • 2006-01-11
    • Naoki AbeEdwin Peter Dawson PednaultFateh Ali Tipu
    • Naoki AbeEdwin Peter Dawson PednaultFateh Ali Tipu
    • G06T11/20
    • G06T11/206
    • Feature importance information available in a predictive model with correlation information among the variables is presented to facilitate more flexible choices of actions by business managers. The displayed feature importance information combines feature importance information available in a predictive model with correlational information among the variables. The displayed feature importance information may be presented as a network structure among the variables as a graph, and regression coefficients of the variables indicated on the corresponding nodes in the graph. To generate the display, a regression engine is called on a set of training data that outputs importance measures for the explanatory variables for predicting the target variable. A graphical model structural learning module is called that outputs a graph on the explanatory variables of the above regression problem representing the correlational structure among them. The feature importance measure, output by the regression engine, is displayed for each node in the graph, as an attribute, such as color, size, texture, etc, of that node in the graph output by the graphical model structural learning module.
    • 提供了具有变量之间相关性信息的预测模型中的特征重要度信息,以便企业管理者更灵活地选择行动。 显示的特征重要性信息将预测模型中可用的特征重要性信息与变量之间的相关信息相结合。 所显示的特征重要性信息可以作为图形中的变量之间的网络结构呈现,并且在图中的相应节点上指示的变量的回归系数。 为了生成显示,在一组训练数据上调用回归引擎,该训练数据输出用于预测目标变量的解释变量的重要度量。 一个图形模型结构学习模块被称为输出上述回归问题的解释变量的图表,表示它们之间的相关性结构。 由图形模型结构学习模块输出的图形中的该节点的颜色,大小,纹理等属性显示图形中每个节点的回归引擎输出的特征重要性度量。
    • 50. 发明申请
    • METHODS FOR MULTI-CLASS COST-SENSITIVE LEARNING
    • 多级成本敏感性学习方法
    • US20080065572A1
    • 2008-03-13
    • US11937629
    • 2007-11-09
    • Naoki AbeBianca Zadrozny
    • Naoki AbeBianca Zadrozny
    • G06N3/00
    • G06N99/005G06K9/6256Y10S706/932
    • Methods for multi-class cost-sensitive learning are based on iterative example weighting schemes and solve multi-class cost-sensitive learning problems using a binary classification algorithm. One of the methods works by iteratively applying weighted sampling from an expanded data set, which is obtained by enhancing each example in the original data set with as many data points as there are possible labels for any single instance, using a weighting scheme which gives each labeled example the weight specified as the difference between the average cost on that instance by the averaged hypotheses from the iterations so far and the misclassification cost associated with the label in the labeled example in question. It then calls the component classification algorithm on a modified binary classification problem in which each example is itself already a labeled pair, and its (meta) label is 1 or 0 depending on whether the example weight in the above weighting scheme is positive or negative, respectively. It then finally outputs a classifier hypothesis which is the average of all the hypotheses output in the respective iterations.
    • 多类成本敏感学习的方法基于迭代示例加权方案,并使用二进制分类算法解决多类成本敏感学习问题。 其中一种方法通过迭代地应用来自扩展数据集的加权采样来工作,该扩展数据集通过使用给出每个实例的加权方案来增强原始数据集中具有尽可能多的数据点的数据点与任何单个实例的可能标签而获得的每个示例而获得 标示的重量指定为该实例的平均成本与目前为止的迭代的平均假设之间的差异以及与所标记的示例中的标签相关联的错误分类成本。 然后,对修改后的二进制分类问题调用组件分类算法,其中每个示例本身已经是一个标记对,根据上述加权方案中的示例权重是正还是负,其(元)标签为1或0, 分别。 然后,它最终输出一个分类器假设,它是相应迭代中输出的所有假设的平均值。