??xml version="1.0" encoding="utf-8" standalone="yes"?>ɱƽ:BlogJava - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/<br/><font color="green" style="font-family: 华文行楷;font-size:16px;">化学l构搜烦Q化学信息学Q生物信息学Q实验室信息学等 ?lt;/font><br/><font color="#3C1435">以高U技的生物、化学信息技术实现生命科学领域中专业数据的计和理、提高研发能力、增强在U研和成本效率方面的国际竞争力,为生物、化学、医药和学术机构提供一的解决Ҏ和技术咨询?lt;/font><br/> <br/><font color="green" style="font-family: 华文行楷;font-size:16px;">子曰Q危邦不入,乱邦不居。天下有道则见,无道则隐?lt;/font><font color="#3C1435"></font><br/> zh-cnWed, 16 Oct 2019 03:27:37 GMTWed, 16 Oct 2019 03:27:37 GMT60几家ZHTML5的化学结构式~辑器截?/title><link>//www.lmlez.icu/rain1102/archive/2014/11/06/419617.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Thu, 06 Nov 2014 13:10:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2014/11/06/419617.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/419617.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2014/11/06/419617.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/419617.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/419617.html</trackback:ping><description><![CDATA[1. 首先上的是朋友Tony搞的QJSDrawQ不知道是因为朋友还是因为国人,L觉它q个设计的是最漂亮的,而且非常好用。(商业Q?br /><img src="//www.lmlez.icu/images/blogjava_net/rain1102/jsdraw.png" width="717" height="371" alt="" /><br />2. chemwriterQ这个看h也不错。(商业Q?br /><img src="//www.lmlez.icu/images/blogjava_net/rain1102/chemwriter.png" width="624" height="358" alt="" /><br />3. ChemAxon公司的Marvin4JSQ个Z非专业角度感觉用h比较ȝ。(商业Q?br /><img src="//www.lmlez.icu/images/blogjava_net/rain1102/marvin4js.png" width="598" height="424" alt="" /><br /><br />4. 比较出名的JME的兄弟JSMEQ免费,好用Q功能弱了点而已。个人比较喜Ƣ。(免费Q?br /><img src="//www.lmlez.icu/images/blogjava_net/rain1102/jsme.png" width="554" height="396" alt="" /><br />5. GGA?span style="color: #343030; font-family: Verdana, Geneva, Tahoma, sans-serif; font-size: 12px; line-height: 17px; background-color: #ffffff;">KetcherQ免费,使用有点马马虎虎?/span>Q免费)<br /><span style="color: #343030; font-family: Verdana, Geneva, Tahoma, sans-serif; font-size: 12px; line-height: 17px; background-color: #ffffff;"><img src="//www.lmlez.icu/images/blogjava_net/rain1102/Ketcher.png" width="748" height="504" alt="" /><br /><br /><br /></span><img src ="//www.lmlez.icu/rain1102/aggbug/419617.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2014-11-06 21:10 <a href="//www.lmlez.icu/rain1102/archive/2014/11/06/419617.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>化学试剂电商q_ - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2014/11/03/419451.html周锐周锐Mon, 03 Nov 2014 07:35:00 GMT//www.lmlez.icu/rain1102/archive/2014/11/03/419451.html//www.lmlez.icu/rain1102/comments/419451.html//www.lmlez.icu/rain1102/archive/2014/11/03/419451.html#Feedback1//www.lmlez.icu/rain1102/comments/commentRss/419451.html//www.lmlez.icu/rain1102/services/trackbacks/419451.html
有没有hxq个行业的痛根呢Q到时是什么,如何解决?img src ="//www.lmlez.icu/rain1102/aggbug/419451.html" width = "1" height = "1" />

周锐 2014-11-03 15:35 发表评论
]]>
PACS-与HIS的融合关pd - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2012/02/04/369377.html周锐周锐Sat, 04 Feb 2012 08:26:00 GMT//www.lmlez.icu/rain1102/archive/2012/02/04/369377.html//www.lmlez.icu/rain1102/comments/369377.html//www.lmlez.icu/rain1102/archive/2012/02/04/369377.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/369377.html//www.lmlez.icu/rain1102/services/trackbacks/369377.html

周锐 2012-02-04 16:26 发表评论
]]>
手术麻醉pȝ工作程?/title><link>//www.lmlez.icu/rain1102/archive/2012/02/04/369376.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Sat, 04 Feb 2012 08:20:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2012/02/04/369376.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/369376.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2012/02/04/369376.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/369376.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/369376.html</trackback:ping><description><![CDATA[<div align="center"><img border="0" alt="" src="//www.lmlez.icu/images/blogjava_net/rain1102/手术麻醉pȝ工作程?png" width="816" height="695" /></div><img src ="//www.lmlez.icu/rain1102/aggbug/369376.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2012-02-04 16:20 <a href="//www.lmlez.icu/rain1102/archive/2012/02/04/369376.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>门诊ȝ工作站流E图 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2012/02/04/369372.html周锐周锐Sat, 04 Feb 2012 07:46:00 GMT//www.lmlez.icu/rain1102/archive/2012/02/04/369372.html//www.lmlez.icu/rain1102/comments/369372.html//www.lmlez.icu/rain1102/archive/2012/02/04/369372.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/369372.html//www.lmlez.icu/rain1102/services/trackbacks/369372.html



周锐 2012-02-04 15:46 发表评论
]]>
国家卫生信息化的五大d - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2012/02/02/369266.html周锐周锐Thu, 02 Feb 2012 13:50:00 GMT//www.lmlez.icu/rain1102/archive/2012/02/02/369266.html//www.lmlez.icu/rain1102/comments/369266.html//www.lmlez.icu/rain1102/archive/2012/02/02/369266.html#Feedback1//www.lmlez.icu/rain1102/comments/commentRss/369266.html//www.lmlez.icu/rain1102/services/trackbacks/369266.html
1Q以电子病历为核心的数字?span href="tag.php?name=%E5%8C%BB%E9%99%A2" style="word-wrap: break-word; line-height: normal; cursor: pointer; border-bottom-width: 1px; border-bottom-style: solid; border-bottom-color: #ff0000; white-space: nowrap; ">医院
2Q以电子健康?案ؓ核心的数字化C֌和乡?span href="tag.php?name=%E5%8D%AB%E7%94%9F" style="word-wrap: break-word; line-height: normal; cursor: pointer; border-bottom-width: 1px; border-bottom-style: solid; border-bottom-color: #ff0000; white-space: nowrap; ">卫生?br style="word-wrap: break-word; line-height: normal; " />3Q以信息׃nZ心的区域数据中心、全国通用?#8220;ȝ?#8221;和各U政?span href="tag.php?name=%E7%AE%A1%E7%90%86" style="word-wrap: break-word; line-height: normal; cursor: pointer; border-bottom-width: 1px; border-bottom-style: solid; border-bottom-color: #ff0000; white-space: nowrap; ">理q_
4Q以Zؓ本的公众ȝ卫生服务q_
5Q以国家卫生数字化ؓ目标?span href="tag.php?name=%E6%8A%80%E6%9C%AF" style="word-wrap: break-word; line-height: normal; cursor: pointer; border-bottom-width: 1px; border-bottom-style: solid; border-bottom-color: #ff0000; white-space: nowrap; ">技?/span>标准规范、法规政{和q行机制


周锐 2012-02-02 21:50 发表评论
]]>
LU室 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2012/02/02/369260.html周锐周锐Thu, 02 Feb 2012 11:39:00 GMT//www.lmlez.icu/rain1102/archive/2012/02/02/369260.html//www.lmlez.icu/rain1102/comments/369260.html//www.lmlez.icu/rain1102/archive/2012/02/02/369260.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/369260.html//www.lmlez.icu/rain1102/services/trackbacks/369260.html  LU室旧称辅助诊疗U室Q是指运用专门的诊疗技术和讑֤Q协同床科诊断和治疗疾病的ȝ技术科室。因Z讄床,不收病hQ也UCؓ非床科室。按工作性质和Q务,可分Z诊断Z的或以治疗ؓȝU室Q还有以供应Z的科室。按pȝ的观Ҏ看,LU室是医院系l中的技术支持系l,因此Q是医院的重要组成部分?/span>
  LU室有以下特点:
  ⑴一切工作围l床,面向全院Qؓ各床医疗科服务。医技U室虽自成体p,构成医院的一部分Q但其业务工作主要是为各临床ȝU提供诊疗依据,或配合治疗,直接或间接ؓ门诊、急诊和住院病人提供技术服务,同时也ؓ全院的科研和教学服务。床各U对LU室Q特别是Ҏ用先q的C化诊疗设备的LU室有较强的依赖性。医技U室技术水q的高低、工作质量的优劣、检查报告结果是否准及Ӟ直接影响对疾病的诊断和治疗,同时q媄响着全院ȝ、科研和教学工作的效果。每一个具体的查项目,都关pd某一临床U的诊疗质量。可见,LU室在医院医疗工作中L举轻重的作用?/span>
  ⑵LU室的专业性强Q具有相对独立性。各LU室有自q专业分工Qƈ有自q工作特点和规律。即使同一U室Q不同的仪器讑֤安装在不同的单独戉K里,从操作到出报告都是独立完成,h工作的独立性。这要求技术h员必d备较强的业务技术能力和责Q感,h认真负责、一丝不苟的工作作风?/span>
  ⑶借助专用仪器讑֤和专门技术开展业务工作,为病断治疗提供客观依据。医技U室的工作手D主要是各种仪器讑֤Q工作水q_很大E序上取决于仪器讑֤的先q程序和更新周期的长短,同时也取决于LU室技术h员专业技术水q_知识更新的快慢。在U学技术迅猛发展的今天Q这一特点昑־ؓH出?/span>
  ⑷L各科室拥有诊疗A器设备多、更新周期短、要求条仉。医技U室的A器设备是医院C化的物质基础和重要标志。随着C化科学技术的发展Q医疗设备更新换代越来越快,几年更C代或几代。每个科室、每个专业都拥有多种不同功能的A器设备,同一专业同一功能的A器设备,往往规格型号不一Q操作各异。设备操作自动化、遥控化和电子计机化,构成了医技U室形体各异的特炏V而且每一CA器设备都要求有特定的环境、徏{和保养讑֤Q有相应的专门技术h员操作和l修理?/span>
  LU室Q包括药剂科、检验科、放科、物理诊断科、核dU、理疗科、手术室、供应室、营L疗科、血库、医疗器械管理科?/span>

周锐 2012-02-02 19:39 发表评论
]]>
健康?案基本活动目?/title><link>//www.lmlez.icu/rain1102/archive/2011/11/08/363243.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Tue, 08 Nov 2011 14:45:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2011/11/08/363243.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/363243.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2011/11/08/363243.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/363243.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/363243.html</trackback:ping><description><![CDATA[<div class="znkp"><img border="0" alt="" src="//www.lmlez.icu/images/blogjava_net/rain1102/health/健康?案基本活动目?.png" width="578" height="991" /></div><img src ="//www.lmlez.icu/rain1102/aggbug/363243.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2011-11-08 22:45 <a href="//www.lmlez.icu/rain1102/archive/2011/11/08/363243.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>健康?案基本业务域目?/title><link>//www.lmlez.icu/rain1102/archive/2011/11/08/363239.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Tue, 08 Nov 2011 14:09:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2011/11/08/363239.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/363239.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2011/11/08/363239.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/363239.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/363239.html</trackback:ping><description><![CDATA[<img border="0" alt="" src="//www.lmlez.icu/images/blogjava_net/rain1102/health/健康?案基本业务域目?.png" width="647" height="1023" /><img src ="//www.lmlez.icu/rain1102/aggbug/363239.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2011-11-08 22:09 <a href="//www.lmlez.icu/rain1102/archive/2011/11/08/363239.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>卫生服务实体机构与角色的关系构徏 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/11/08/363235.html周锐周锐Tue, 08 Nov 2011 13:43:00 GMT//www.lmlez.icu/rain1102/archive/2011/11/08/363235.html//www.lmlez.icu/rain1102/comments/363235.html//www.lmlez.icu/rain1102/archive/2011/11/08/363235.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/363235.html//www.lmlez.icu/rain1102/services/trackbacks/363235.html



周锐 2011-11-08 21:43 发表评论
]]>
ȝ卫生服务实体机构目录 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/11/08/363229.html周锐周锐Tue, 08 Nov 2011 13:12:00 GMT//www.lmlez.icu/rain1102/archive/2011/11/08/363229.html//www.lmlez.icu/rain1102/comments/363229.html//www.lmlez.icu/rain1102/archive/2011/11/08/363229.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/363229.html//www.lmlez.icu/rain1102/services/trackbacks/363229.html居民个h?strong style="color: #993300">ȝ卫生服务机构?br />
不同用户对基于健h案的区域卫生信息q_需求有不同的关注点Q具体如下:
居民个hQ主要关注的是如何能获得可及的、优质的卫生服务Q获取连l的健康信息、全E的健康理{方面?br />基层卫生服务机构Q主要关注的是如何更好提供基本医疗、基本公共卫生与理{基本服务?br />专业卫生服务机构Q主要关注的是如何保证服务质量、提高服务效率,如何加强疄理、卫生管理、应急管理、健h育等斚wQ如何有利于针对性的服务的开展、健L理的pȝ化等斚w?br />卫生行政理机构Q主要关注的是如何提高区域资源共享水q뀁强化W效考核、提高监督管理能力、化解疾病风险等斚w?br />其它相关机构Q主要指公安、民ѝh口和计划生育服务{相x构?br />

周锐 2011-11-08 21:12 发表评论
]]>
E序员、设计师、项目经理之间的战争 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/08/11/356300.html周锐周锐Thu, 11 Aug 2011 06:47:00 GMT//www.lmlez.icu/rain1102/archive/2011/08/11/356300.html//www.lmlez.icu/rain1102/comments/356300.html//www.lmlez.icu/rain1102/archive/2011/08/11/356300.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/356300.html//www.lmlez.icu/rain1102/services/trackbacks/356300.html

周锐 2011-08-11 14:47 发表评论
]]>
我来自天?癑ֺ译-I come from China - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/08/01/355504.html周锐周锐Mon, 01 Aug 2011 09:12:00 GMT//www.lmlez.icu/rain1102/archive/2011/08/01/355504.html//www.lmlez.icu/rain1102/comments/355504.html//www.lmlez.icu/rain1102/archive/2011/08/01/355504.html#Feedback1//www.lmlez.icu/rain1102/comments/commentRss/355504.html//www.lmlez.icu/rain1102/services/trackbacks/355504.html


周锐 2011-08-01 17:12 发表评论
]]>
利用JPG囄生成高质量的~略?/title><link>//www.lmlez.icu/rain1102/archive/2011/07/26/355029.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Tue, 26 Jul 2011 01:49:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2011/07/26/355029.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/355029.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2011/07/26/355029.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/355029.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/355029.html</trackback:ping><description><![CDATA[<p><span style="color: #003300">如果l出~略囄宽度和高度,那么׃Ҏl出的宽度和高度生~略图,如果只给出宽度或者高度|那么׃Ҏ比例生成~略图?/span><br />package com.founder.common.utils;</p> <p>import java.awt.image.BufferedImage;<br />import java.io.File;<br />import javax.imageio.ImageIO;</p> <p>//生成{比例高质量~略?br />public class ThumbnailUtil {<br /> private static int width;<br /> private static int height;<br /> private static int scaleWidth;<br /> static double support = (double) 3.0;<br /> static double PI = (double) 3.14159265358978;<br /> static double[] contrib;<br /> static double[] normContrib;<br /> static double[] tmpContrib;<br /> static int startContrib, stopContrib;<br /> static int nDots;<br /> static int nHalfDots;</p> <p> public static void saveImage(String fromFileStr, String saveToFileStr, int formatWidth, int formatHeight) throws Exception {<br />  File saveFile = new File(saveToFileStr);<br />  File fromFile = new File(fromFileStr);<br />  saveImage(fromFile, saveFile, formatWidth, formatHeight);<br /> }<br /> <br /> public static void saveImage(File fromFile  , File saveFile, int formatWidth, int formatHeight) throws Exception {<br />  BufferedImage srcImage;<br />  srcImage = javax.imageio.ImageIO.read(fromFile); // construct image<br />  int imageWidth = srcImage.getWidth(null);<br />  int imageHeight = srcImage.getHeight(null);<br />  int changeToWidth = 0;<br />  int changeToHeight = 0;<br />  if (formatWidth > 0 && formatHeight > 0) {<br />   changeToWidth = formatWidth;<br />   changeToHeight = formatHeight;<br />  } else {<br />   if (imageWidth > 0 && imageHeight > 0) {<br />    if (imageWidth / imageHeight >= formatWidth / formatHeight) {<br />     if (imageWidth > formatWidth) {<br />      changeToWidth = formatWidth;<br />      changeToHeight = (imageHeight * formatWidth) / imageWidth;<br />     } else {<br />      changeToWidth = imageWidth;<br />      changeToHeight = imageHeight;<br />     }<br />    } else {<br />     if (imageHeight > formatHeight) {<br />      changeToHeight = formatHeight;<br />      changeToWidth = (imageWidth * formatHeight) / imageHeight;<br />     } else {<br />      changeToWidth = imageWidth;<br />      changeToHeight = imageHeight;<br />     }<br />    }<br />   }<br />  }<br />  <br />  srcImage = imageZoomOut(srcImage, changeToWidth, changeToHeight);<br />  ImageIO.write(srcImage, "JPEG", saveFile);<br /> }</p> <p> public static BufferedImage imageZoomOut(BufferedImage srcBufferImage, int w, int h) {<br />  width = srcBufferImage.getWidth();<br />  height = srcBufferImage.getHeight();<br />  scaleWidth = w;</p> <p>  if (DetermineResultSize(w, h) == 1) {<br />   return srcBufferImage;<br />  }<br />  CalContrib();<br />  BufferedImage pbOut = HorizontalFiltering(srcBufferImage, w);<br />  BufferedImage pbFinalOut = VerticalFiltering(pbOut, h);<br />  return pbFinalOut;<br /> }</p> <p> /**<br />  * 军_囑փ寸<br />  */<br /> private static int DetermineResultSize(int w, int h) {<br />  double scaleH, scaleV;<br />  scaleH = (double) w / (double) width;<br />  scaleV = (double) h / (double) height;<br />  // 需要判断一下scaleHQscaleVQ不做放大操?br />  if (scaleH >= 1.0 && scaleV >= 1.0) {<br />   return 1;<br />  }<br />  return 0;</p> <p> }</p> <p> private static double Lanczos(int i, int inWidth, int outWidth, double Support) {<br />  double x;</p> <p>  x = (double) i * (double) outWidth / (double) inWidth;</p> <p>  return Math.sin(x * PI) / (x * PI) * Math.sin(x * PI / Support)<br />    / (x * PI / Support);</p> <p> }</p> <p> private static void CalContrib() {<br />  nHalfDots = (int) ((double) width * support / (double) scaleWidth);<br />  nDots = nHalfDots * 2 + 1;<br />  try {<br />   contrib = new double[nDots];<br />   normContrib = new double[nDots];<br />   tmpContrib = new double[nDots];<br />  } catch (Exception e) {<br />   System.out.println("init contrib,normContrib,tmpContrib" + e);<br />  }</p> <p>  int center = nHalfDots;<br />  contrib[center] = 1.0;</p> <p>  double weight = 0.0;<br />  int i = 0;<br />  for (i = 1; i <= center; i++) {<br />   contrib[center + i] = Lanczos(i, width, scaleWidth, support);<br />   weight += contrib[center + i];<br />  }</p> <p>  for (i = center - 1; i >= 0; i--) {<br />   contrib[i] = contrib[center * 2 - i];<br />  }</p> <p>  weight = weight * 2 + 1.0;</p> <p>  for (i = 0; i <= center; i++) {<br />   normContrib[i] = contrib[i] / weight;<br />  }</p> <p>  for (i = center + 1; i < nDots; i++) {<br />   normContrib[i] = normContrib[center * 2 - i];<br />  }<br /> }</p> <p> // 处理边缘<br /> private static void CalTempContrib(int start, int stop) {<br />  double weight = 0;</p> <p>  int i = 0;<br />  for (i = start; i <= stop; i++) {<br />   weight += contrib[i];<br />  }</p> <p>  for (i = start; i <= stop; i++) {<br />   tmpContrib[i] = contrib[i] / weight;<br />  }</p> <p> }</p> <p> private static int GetRedValue(int rgbValue) {<br />  int temp = rgbValue & 0x00ff0000;<br />  return temp >> 16;<br /> }</p> <p> private static int GetGreenValue(int rgbValue) {<br />  int temp = rgbValue & 0x0000ff00;<br />  return temp >> 8;<br /> }</p> <p> private static int GetBlueValue(int rgbValue) {<br />  return rgbValue & 0x000000ff;<br /> }</p> <p> private static int ComRGB(int redValue, int greenValue, int blueValue) {</p> <p>  return (redValue << 16) + (greenValue << 8) + blueValue;<br /> }</p> <p> // 行水qxo?br /> private static int HorizontalFilter(BufferedImage bufImg, int startX, int stopX,<br />   int start, int stop, int y, double[] pContrib) {<br />  double valueRed = 0.0;<br />  double valueGreen = 0.0;<br />  double valueBlue = 0.0;<br />  int valueRGB = 0;<br />  int i, j;</p> <p>  for (i = startX, j = start; i <= stopX; i++, j++) {<br />   valueRGB = bufImg.getRGB(i, y);</p> <p>   valueRed += GetRedValue(valueRGB) * pContrib[j];<br />   valueGreen += GetGreenValue(valueRGB) * pContrib[j];<br />   valueBlue += GetBlueValue(valueRGB) * pContrib[j];<br />  }</p> <p>  valueRGB = ComRGB(Clip((int) valueRed), Clip((int) valueGreen),<br />    Clip((int) valueBlue));<br />  return valueRGB;</p> <p> }</p> <p> // 囄水^滤L<br /> private static BufferedImage HorizontalFiltering(BufferedImage bufImage, int iOutW) {<br />  int dwInW = bufImage.getWidth();<br />  int dwInH = bufImage.getHeight();<br />  int value = 0;<br />  BufferedImage pbOut = new BufferedImage(iOutW, dwInH,<br />    BufferedImage.TYPE_INT_RGB);</p> <p>  for (int x = 0; x < iOutW; x++) {</p> <p>   int startX;<br />   int start;<br />   int X = (int) (((double) x) * ((double) dwInW) / ((double) iOutW) + 0.5);<br />   int y = 0;</p> <p>   startX = X - nHalfDots;<br />   if (startX < 0) {<br />    startX = 0;<br />    start = nHalfDots - X;<br />   } else {<br />    start = 0;<br />   }</p> <p>   int stop;<br />   int stopX = X + nHalfDots;<br />   if (stopX > (dwInW - 1)) {<br />    stopX = dwInW - 1;<br />    stop = nHalfDots + (dwInW - 1 - X);<br />   } else {<br />    stop = nHalfDots * 2;<br />   }</p> <p>   if (start > 0 || stop < nDots - 1) {<br />    CalTempContrib(start, stop);<br />    for (y = 0; y < dwInH; y++) {<br />     value = HorizontalFilter(bufImage, startX, stopX, start,<br />       stop, y, tmpContrib);<br />     pbOut.setRGB(x, y, value);<br />    }<br />   } else {<br />    for (y = 0; y < dwInH; y++) {<br />     value = HorizontalFilter(bufImage, startX, stopX, start,<br />       stop, y, normContrib);<br />     pbOut.setRGB(x, y, value);<br />    }<br />   }<br />  }</p> <p>  return pbOut;</p> <p> }</p> <p> private static int VerticalFilter(BufferedImage pbInImage, int startY, int stopY,<br />   int start, int stop, int x, double[] pContrib) {<br />  double valueRed = 0.0;<br />  double valueGreen = 0.0;<br />  double valueBlue = 0.0;<br />  int valueRGB = 0;<br />  int i, j;</p> <p>  for (i = startY, j = start; i <= stopY; i++, j++) {<br />   valueRGB = pbInImage.getRGB(x, i);</p> <p>   valueRed += GetRedValue(valueRGB) * pContrib[j];<br />   valueGreen += GetGreenValue(valueRGB) * pContrib[j];<br />   valueBlue += GetBlueValue(valueRGB) * pContrib[j];<br />  }</p> <p>  valueRGB = ComRGB(Clip((int) valueRed), Clip((int) valueGreen), Clip((int) valueBlue));<br />  <br />  return valueRGB;</p> <p> } </p> <p> private static BufferedImage VerticalFiltering(BufferedImage pbImage, int iOutH) {<br />  int iW = pbImage.getWidth();<br />  int iH = pbImage.getHeight();<br />  int value = 0;<br />  BufferedImage pbOut = new BufferedImage(iW, iOutH,<br />    BufferedImage.TYPE_INT_RGB);</p> <p>  for (int y = 0; y < iOutH; y++) {</p> <p>   int startY;<br />   int start;<br />   int Y = (int) (((double) y) * ((double) iH) / ((double) iOutH) + 0.5);</p> <p>   startY = Y - nHalfDots;<br />   if (startY < 0) {<br />    startY = 0;<br />    start = nHalfDots - Y;<br />   } else {<br />    start = 0;<br />   }</p> <p>   int stop;<br />   int stopY = Y + nHalfDots;<br />   if (stopY > (int) (iH - 1)) {<br />    stopY = iH - 1;<br />    stop = nHalfDots + (iH - 1 - Y);<br />   } else {<br />    stop = nHalfDots * 2;<br />   }</p> <p>   if (start > 0 || stop < nDots - 1) {<br />    CalTempContrib(start, stop);<br />    for (int x = 0; x < iW; x++) {<br />     value = VerticalFilter(pbImage, startY, stopY, start, stop,<br />       x, tmpContrib);<br />     pbOut.setRGB(x, y, value);<br />    }<br />   } else {<br />    for (int x = 0; x < iW; x++) {<br />     value = VerticalFilter(pbImage, startY, stopY, start, stop,<br />       x, normContrib);<br />     pbOut.setRGB(x, y, value);<br />    }<br />   }</p> <p>  }</p> <p>  return pbOut;</p> <p> }</p> <p> static int Clip(int x) {<br />  if (x < 0)<br />   return 0;<br />  if (x > 255)<br />   return 255;<br />  return x;<br /> }<br />}</p><img src ="//www.lmlez.icu/rain1102/aggbug/355029.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2011-07-26 09:49 <a href="//www.lmlez.icu/rain1102/archive/2011/07/26/355029.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>强与小?正在疯传的伟大的故事 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/07/05/353746.html周锐周锐Tue, 05 Jul 2011 13:28:00 GMT//www.lmlez.icu/rain1102/archive/2011/07/05/353746.html//www.lmlez.icu/rain1102/comments/353746.html//www.lmlez.icu/rain1102/archive/2011/07/05/353746.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/353746.html//www.lmlez.icu/rain1102/services/trackbacks/353746.html    强与小?#8212;—正在疯传的伟大的故事

1.强每天在村里晃悠,爹妈看着发愁Q心惌孩子来怎么办呀Q小明每日都苦读诗书Q父母喜在心里,村里人都认定他必有出息?br />2.那年Q小强和明都是十九岁。小着村里的外出打工,来到了高速公路的工地Q保底工资三千块Q小明考上了一所重点大学Q读的是道\与桥梁专业,学费每年五千多?br />3.那年Q小强和明都是二十三岁。小强的爹妈l他说个巧媳妇,是邻村的Q特别贤惠;明在大学里谈了个女朋友Q是L的,很有文化?br />4.那年Q小强和明都是二十四岁。小强在老家l了婚,把媳妇带到工CQ来l他z做饭Q恩爱有加;明l于大学毕业Q找了施工单位工作,跟女友分居两圎ͼ朝思暮惟?
5.强每天很快乐,下了班就没事Q吃了饭和媳妇散散步Q晚上便和工友打d看电视;明每天很忙,白天跑遍工地Q晚上还做资料画囄Q好久不见的奛_跟他分手了?br />6.那年Q小强和明都是二十八岁。小强攒下了二十万,已是两个娃娃的爹Q心想着回家盖栋漂亮的楼房;明q了中职称Q还是单w一个hq,心想着再干几年是高了?br />7.强在农村老家盖了两层楼Q装修很漂亮Q剩的钱C一猪仔,让媳妇回家种地养猪;明在城里贷ƾ买了一套新房,按揭三千多,父母l介l了新女朋友Q在城里上班很少见面?br />8. 那年Q小强和明都是三十一岁。小强媳妇从老家打电话来_强Q现在家里有房有存款Q咱喂喂猪,U种圎ͼ很幸了Q家里不能没有男人,你快回来吧;明媛_从城里打电话来说Q小明,孩的借读费要十五万呢Q家里没有存ƾ了Q你看能不能扑օ司借点?
9.强听了媛_的话Q离开了工圎ͼ回老家跟老婆一起养猪,照顾父母孩Q小明听了妻子的话,更努力工作,M偏远又艰苦的工地Q很隑֛家一ơ?br />10.那年Q小强和明都是三十五岁。猪肉h格疯涨,强的一大圈猪成了宝贝,一q赚了十几万Q通货膨胀严重Q小明的公司很难接到目Q很多h都待岗了?br />11.那年Q小强和明都是五十岁了。小强已是三个孙子的LQ天天晒着太阳抽着q在村里{悠;明已是高路桥工程师,天天着太阳q眉头在工地检查?
12.那年Q小强和明都是六十岁了。小六十大寿Q老伴_一家团圆多好呀Q家里的事就让娃们操心吧Q外面有啥好玩的地方咱出去{转;明退休摆酒席Q领DQ回家歇着没意思,q聘回单位做技术顾问吧Q工C有什么问题您l指导指对{?
13.强病了一场,强拉着老伴的手_我活了快七十岁了Q有儿有孙的Q知了Q小明病了一场,明抚着d的手_我在外工作几十年Q让你受苦了Q对不v?
14.……׃长期体力力_Q吃的是自家U的菜、养的猪Q小n体一直很朗Q慢慢就恢复了。由于长期熬夜加班、小明喝酒应酬、工地食堂饭菜也很差Qn上落下很多毛病,很快去世了?
15.八十岁的强y在村头抽着q袋,看着q远的山Q远q的׃有一片公墓,明已在那里静静睡去Q小强在鞋底磕烟灰Q拄着拐杖站vw,望了望那片公墓,自言自语地说Q唉Q都是一辈子呀……
谨以此向工作在大城市Q付Z青春、爱情、亲情甚至生命的人?br />人的一生很短暂Q希望大家给自己多一些时_l家人多一些关?br />



周锐 2011-07-05 21:28 发表评论
]]>
化合物相似?指纹QFingerprintQ?/title><link>//www.lmlez.icu/rain1102/archive/2011/06/30/353435.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Thu, 30 Jun 2011 06:13:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2011/06/30/353435.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/353435.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2011/06/30/353435.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/353435.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/353435.html</trackback:ping><description><![CDATA[<div class="znkp">化合物相似性,有时候也会说分子怼性,是指两个分子或者化合物在结构上的相似程度,而相似化合物一般在化学反应上的效果cMQ以及在生物zL(biological activityQ上面也会有同样的作用?br /> 在计化合物怼性的q程中,使用的是分子指纹Qmolecular fingerprintQ来q行比较。比较两个化合物分子指纹Ӟ最常用的是杰卡L敎ͼTanimoto(or Jaccard) coefficient Q?em>T</em>来度量其怼E度。若两个化学l构的指U的<em>T</em>>0.85Q一般就视ؓ怼的?br /> 以相似性ؓ基础可以q行虚拟{选(virtual screeningQ,是一Uligand-based的虚拟筛选,Z要在上百万中化合物数据库中进行高效的怼性筛选,通过使用指纹比对效率最为高效?/div><img src ="//www.lmlez.icu/rain1102/aggbug/353435.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2011-06-30 14:13 <a href="//www.lmlez.icu/rain1102/archive/2011/06/30/353435.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>28条提高关键字排名的SEO优化Ҏ【{载?/title><link>//www.lmlez.icu/rain1102/archive/2011/06/29/353366.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Wed, 29 Jun 2011 07:44:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2011/06/29/353366.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/353366.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2011/06/29/353366.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/353366.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/353366.html</trackback:ping><description><![CDATA[<span class="Apple-style-span" style="color: #bbbbbb; font-family: arial; font-size: 13px; line-height: 26px; "><h3 style="outline-width: medium; outline-style: none; outline-color: initial; font-size: 14px; font-weight: bold; color: #cccccc; "><span style="color: #000000; ">关键词位|、密度、处?/span></h3></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">1.URL中出现关键词Q英文)<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">2.|页标题中出现关键词Q?-3个)<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">3.关键词标{中出现关键词(1-3个)<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">4.描述标签中出现关键词Q主关键词重?ơ)<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">5.内容中自然出现关键词<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">6.内容W一D和最后一D出现关键词<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">7.H1QH2标签中出现关键词<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">8.导出链接锚文本中包含关键?br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">9.囄的文件名包含关键?br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">10.ALT属性中出现关键?br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">11.关键词密?-8%<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">12.对关键词加粗或斜?br style="outline-width: medium; outline-style: none; outline-color: initial; " /><h3 style="outline-width: medium; outline-style: none; outline-color: initial; font-size: 14px; font-weight: bold; color: #cccccc; "><span style="color: #000000; ">内容质量、更新频率、相x?/span></h3></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">1.原创的内Ҏ佻I切忌被多ơ{载的内容<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">2.内容独立性,与其他页面至?0%互异<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">3.1000-2000字,合理分段<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">4.有规律更斎ͼ最好是每天<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">5.内容围绕面关键词展开Q与整站主题相关<br style="outline-width: medium; outline-style: none; outline-color: initial; " /></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; color: #000000; ">6.h评论功能Q评Z出现关键?br style="outline-width: medium; outline-style: none; outline-color: initial; " /><h3 style="outline-width: medium; outline-style: none; outline-color: initial; font-size: 14px; font-weight: bold; color: #cccccc; "><span style="color: #000000; ">导入链接和锚文本</span></h3></span><span class="Apple-style-span" style="font-family: arial; font-size: 13px; line-height: 26px; "><p style="outline-width: medium; outline-style: none; outline-color: initial; "><span style="color: #000000; ">1.高PR值站点的导入链接</span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">2.内容相关面的导入链?/span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">3.导入链接锚文本中包含面关键?/span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">4.锚文本存在于|页内容?/span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">5.锚文本周围出现相兛_键词</span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">6.导入链接存在3个月以上</span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">7.导入链接所在页面的导出链接于100?/span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">8.导入链接来自不同IP地址</span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">9.导入链接自然增加</span><br style="outline-width: medium; outline-style: none; outline-color: initial; " /><span style="color: #000000; ">10.锚文本多样化Q如QSEO和SEO十万个ؓ什么)<br /></span><span style="color: #000000; ">原文地址Q?div style="display: inline-block; "></div></span></p></span><a ><span style="color: #000000; ">//www.gbin1.com/technology/seo/28waytoseo/</span></a><img src ="//www.lmlez.icu/rain1102/aggbug/353366.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2011-06-29 15:44 <a href="//www.lmlez.icu/rain1102/archive/2011/06/29/353366.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>存储BitSet到MySQL?-怼度搜?/title><link>//www.lmlez.icu/rain1102/archive/2011/06/29/353331.html</link><dc:creator>周锐</dc:creator><author>周锐</author><pubDate>Wed, 29 Jun 2011 02:20:00 GMT</pubDate><guid>//www.lmlez.icu/rain1102/archive/2011/06/29/353331.html</guid><wfw:comment>//www.lmlez.icu/rain1102/comments/353331.html</wfw:comment><comments>//www.lmlez.icu/rain1102/archive/2011/06/29/353331.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>//www.lmlez.icu/rain1102/comments/commentRss/353331.html</wfw:commentRss><trackback:ping>//www.lmlez.icu/rain1102/services/trackbacks/353331.html</trackback:ping><description><![CDATA[分子l构式相似度搜烦使用的是fingerprintq行比较Q?div style="display: inline-block; "></div>fingerprint是一个二q制数据QCDK中用BitSet来存储该信息Q如果要每次比对都去生成BitSetQ那也太耗时间了Q所以我们需要存?div style="display: inline-block; "></div>fingerprint信息到数据库中,比较的时候,直接dQ而MySQL不支持存储BitSet数据Q网站找了一下,有h惛_?div style="display: inline-block; "></div>BitSet转换成Blob信息q行存储Q然后取的时候再转换回来Q不愧是个好的方法。下面来看看代码实现Q?br /><br /><div class="znkp"><div class="znkp">/*</div><div class="znkp"> * Copyright (c) 2010-2020 Founder Ltd. All Rights Reserved.</div><div class="znkp"> *</div><div class="znkp"> * This software is the confidential and proprietary information of</div><div class="znkp"> * Founder. You shall not disclose such Confidential Information</div><div class="znkp"> * and shall use it only in accordance with the terms of the agreements</div><div class="znkp"> * you entered into with Founder.</div><div class="znkp"> *</div><div class="znkp"> */</div><div class="znkp">package com.founder.mysql;</div><div class="znkp"></div><div class="znkp">import java.sql.Blob;</div><div class="znkp">import java.sql.Connection;</div><div class="znkp">import java.sql.SQLException;</div><div class="znkp">import java.util.BitSet;</div><div class="znkp"></div><div class="znkp">public class MySQLUtil {</div><div class="znkp"></div><div class="znkp"><span style="white-space:pre"> </span>public static Blob bitsetToBlob(BitSet myBitSet, Connection con) throws SQLException {</div><div class="znkp"><span style="white-space:pre"> </span>    byte[] byteArray = toByteArray(myBitSet);</div><div class="znkp"><span style="white-space:pre"> </span>    Blob blob = con.createBlob();</div><div class="znkp"><span style="white-space:pre"> </span>    blob.setBytes(1, byteArray);</div><div class="znkp"><span style="white-space:pre"> </span>    return blob;</div><div class="znkp"><span style="white-space:pre"> </span>}</div><div class="znkp"></div><div class="znkp"><span style="white-space:pre"> </span>private static byte[] toByteArray(BitSet bits) {</div><div class="znkp"><span style="white-space:pre"> </span>    byte[] bytes = new byte[bits.length()/8+1];</div><div class="znkp"><span style="white-space:pre"> </span>    for (int i=0; i<bits.length(); i++) {</div><div class="znkp"><span style="white-space:pre"> </span>        if (bits.get(i)) {</div><div class="znkp"><span style="white-space:pre"> </span>            bytes[bytes.length-i/8-1] |= 1<<(i%8);</div><div class="znkp"><span style="white-space:pre"> </span>        }</div><div class="znkp"><span style="white-space:pre"> </span>    }</div><div class="znkp"><span style="white-space:pre"> </span>    return bytes;</div><div class="znkp"><span style="white-space:pre"> </span>}</div><div class="znkp"><span style="white-space:pre"> </span></div><div class="znkp"><span style="white-space:pre"> </span>public static BitSet blobToBitSet(Blob blob) throws SQLException {</div><div class="znkp"><span style="white-space:pre"> </span>    byte[] bytes = blob.getBytes(1, (int)blob.length());</div><div class="znkp"><span style="white-space:pre"> </span>    BitSet bitSet = fromByteArray(bytes);</div><div class="znkp"></div><div class="znkp"><span style="white-space:pre"> </span>    return bitSet;</div><div class="znkp"><span style="white-space:pre"> </span>}</div><div class="znkp"></div><div class="znkp"><span style="white-space:pre"> </span>private static BitSet fromByteArray(byte[] bytes) {</div><div class="znkp"><span style="white-space:pre"> </span>    BitSet bits = new BitSet(1024);  </div><div class="znkp"><span style="white-space:pre"> </span>    for (int i=0; i<bytes.length*8; i++) {</div><div class="znkp"><span style="white-space:pre"> </span>        if ((bytes[bytes.length-i/8-1]&(1<<(i%8))) > 0) {</div><div class="znkp"><span style="white-space:pre"> </span>            bits.set(i);</div><div class="znkp"><span style="white-space:pre"> </span>        }</div><div class="znkp"><span style="white-space:pre"> </span>    }</div><div class="znkp"><span style="white-space:pre"> </span>    return bits;</div><div class="znkp"><span style="white-space:pre"> </span>}</div><div class="znkp">}</div></div><div class="znkp"><br />通过以上代码Q我们就可以把fingerprint的D出来,然后存储到MySQL数据库中了?br />q行怼度搜索的时候,值需要取出已l存储的D行比对就可以了?br /><div class="znkp">float coefficient = Tanimoto.calculate(query, MySQLUtil.blobToBitSet(results.getBlob("bits")));<br />W者测试了187586条结构数据,大概需?2U左叻I基本满一般需求?/div></div><img src ="//www.lmlez.icu/rain1102/aggbug/353331.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="//www.lmlez.icu/rain1102/" target="_blank">周锐</a> 2011-06-29 10:20 <a href="//www.lmlez.icu/rain1102/archive/2011/06/29/353331.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Improved SMILES Substructure Searching-提高子结构搜索速度 - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/06/27/353100.html周锐周锐Mon, 27 Jun 2011 13:50:00 GMT//www.lmlez.icu/rain1102/archive/2011/06/27/353100.html//www.lmlez.icu/rain1102/comments/353100.html//www.lmlez.icu/rain1102/archive/2011/06/27/353100.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/353100.html//www.lmlez.icu/rain1102/services/trackbacks/353100.htmldaylight上面有一文章,讲解如何提高子结构搜索速度Q?a >//www.daylight.com/meetings/emug00/Sayle/substruct.html
其大概意思就是先通过Fingerprintq行{选,q样可以快速的{选掉一部分数据Q对于复杂结构更有效Q另外就是根据原子个数或者特D原子个数进行比较,如果查询l构包含三个“N”原子Q那么所要查询出的结构所含有“N”的个数必d于等?Q这样对于包含一些特D元素的效果是特别的好;q有是Ҏ分子的一些性质q行{选过滤,比如芳香性等Q最后再q行匚wQ这样一来对于复杂结构以及含Ҏ元素的查询速度会提高很多?br />      最后文章中q给出测试数据,从中可以看出Q速度一般提高了三倍左叻I
      
Name SMILES Correct FP Triage Before After Latest
Propane CCC 65337 66352 42411 42.59 17.99 14.34
Selenium [Se] 246 995 225 0.80 0.83 0.52
Benzene c1ccccc1 79426 79486 50893 72.69 27.56 20.29
Methane C 118519 118524 118511 61.29 5.47 4.25
Amido NC=O 25695 26975 14702 18.89 9.84 8.16
Methylbenzene Cc1ccccc1 54529 56869 20490 54.76 35.58 25.90
Carboxy OC=O 33009 34369 17809 23.86 12.48 10.24
Chlorine Cl 19424 23318 19424 11.23 1.38 1.12
Cyclopropane C1CC1 863 4358 484 8.24 7.78 5.02
Biphenyl c1ccccc1c2ccccc2 2967 5142 146 21.94 21.65 11.44
Dopamine NCCc1ccc(O)c(O)c1 829 913 23 1.85 2.09 1.47
Sulfisoxazole 7 8 3 0.50 0.88 0.51
BetaCarotene 2 16 1 0.48 0.68 0.58
Nitrofurantoin 0 0 0 0.42 0.58 0.52



周锐 2011-06-27 21:50 发表评论
]]>
在SQLPlus中执行用Java~写的Oracle存储q程[转蝲] - 4399ɱol|ɱ佫//www.lmlez.icu/rain1102/archive/2011/06/22/352799.html周锐周锐Wed, 22 Jun 2011 04:38:00 GMT//www.lmlez.icu/rain1102/archive/2011/06/22/352799.html//www.lmlez.icu/rain1102/comments/352799.html//www.lmlez.icu/rain1102/archive/2011/06/22/352799.html#Feedback0//www.lmlez.icu/rain1102/comments/commentRss/352799.html//www.lmlez.icu/rain1102/services/trackbacks/352799.html

首先在PL/Sql中分别执行:

create or replace and compile java source named TestJava1 as 
public class TestJava1 

  public static void test() 
  { 
   System.out.println("Hello"); 
  } 
}


create or replace procedure testJava1 as language java name 'TestJava1.test()';

---------------------------------------------------------------------------------------------------------

在SQLPlus?/span>

C:\Windows\System32>sqlplus nc5520110105/nc5520110105@192.168.10.87

SQL*Plus: Release 11.2.0.1.0 Production on Fri Apr 1 14:06:02 2011

Copyright (c) 1982, 2010, Oracle.  All rights reserved.


Connected to:
Oracle Database 10g Enterprise Edition Release 10.2.0.1.0 - 64bit Production
With the Partitioning, OLAP and Data Mining options

SQL> set serveroutput on;
SQL> show serveroutput;
serveroutput ON SIZE UNLIMITED FORMAT WORD_WRAPPED
SQL> call dbms_java.set_output(2000);

Call completed.

SQL>
SQL> show serveroutput;
serveroutput ON SIZE UNLIMITED FORMAT WORD_WRAPPED
SQL> exec testJava1();
Hello

PL/SQL procedure successfully completed.

SQL>

---------------------------------------------------------------------------------------------------------

再看一个例子:

在PL/Sql中执行:

--用Java~写Oracle存储q程?/span>
create or replace and compile java source named test as
public class MyTest
{
    public static void myProc(int a,int b,int[] ret){
       ret[0]=a+b;
    }
    public static int myFunc(int a,int b){
       return a+b;
    }
}

--创徏存储q程
create or replace procedure myProc(a in number, b in number, ret out number) as
language java name 'MyTest.myProc(int,int,int[])';
--创徏函数
create or replace function myFunc(a in number, b in number) return number is
language java name 'MyTest.myFunc(int,int) return int';

然后在SqlPlus中测试存储过E?#8212;—

SQL> set serveroutput on
SQL> DECLARE a INTEGER;
  2  BEGIN
  3  myProc(1, 2, a);
  4  DBMS_OUTPUT.PUT_LINE(a);
  5  END;
  6  /
3

PL/SQL procedure successfully completed.

 

SQL> select myFunc(1,2) from dual;

MYFUNC(1,2)
-----------
          3

SQL>



4399ɱol 2011-06-22 12:38 发表评论
]]>