�??xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>&#57;&#49;&#31934;&#21697;&#22269;&#20135;&#32508;&#21512;&#20037;&#20037;&#31934;&#21697;&#44;&#27431;&#32654;&#31934;&#21697;&#20061;&#20061;&#20037;&#20037;&#44;&#26085;&#26412;&#32654;&#22899;&#35270;&#39057;&#19968;&#21306;&#20108;&#21306;</title><link>http://www.aygfsteel.com/decode360/category/39999.html</link><description>业精于勤而荒于嬉    QQ:150355677    MSN:decode360@hotmail.com</description><language>zh-cn</language><lastBuildDate>Sun, 30 Aug 2009 10:37:16 GMT</lastBuildDate><pubDate>Sun, 30 Aug 2009 10:37:16 GMT</pubDate><ttl>60</ttl><item><title>OSI七层模型介绍</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/22/292706.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Fri, 22 May 2009 14:30:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/22/292706.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292706.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/22/292706.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292706.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292706.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: OSI是一个开放性的通行�pȝ��互连参考模型，他是一个定义的非常好的协议规范。OSI模型�?层结构，每层都可以有几个子层。下面我���单的介绍一下这7层及其功能�?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/22/292706.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292706.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-22 22:30 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/22/292706.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>�?�?后缀表达式的转换</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/21/292705.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Thu, 21 May 2009 14:41:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/21/292705.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292705.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/21/292705.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292705.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292705.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 自然表达式�{换�ؓ�?�?后缀表达式，其实是很���单的。首先将自然表达式按照优先���序�Q�构造出与表辑ּ�相对应的二叉树，然后对二叉树�q�行�?�?后缀遍历�Q�即得到�?�?后缀表达式�?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/21/292705.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292705.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-21 22:41 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/21/292705.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>�pȝ��可靠性分�?/title><link>http://www.aygfsteel.com/decode360/archive/2009/05/20/292704.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Wed, 20 May 2009 13:18:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/20/292704.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292704.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/20/292704.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292704.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292704.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 计算机系�l�是一个复杂的�pȝ���Q�而且影响其可靠性的因素也非常繁复，很难直接对其�q�行可靠性分析；但通过建立适当的数学模型，把大�pȝ��分割成若�q�子�pȝ���Q�可以简化其分析�q�程。常见的�pȝ��可靠性数学模型有以下三种�Q?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/20/292704.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292704.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-20 21:18 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/20/292704.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>数据�?amp;mdash;&amp;mdash;嵌入式SQL</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/19/292703.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Tue, 19 May 2009 13:55:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/19/292703.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292703.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/19/292703.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292703.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292703.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 使用嵌入式SQL�Q�必��解军_��下几个问题：
<br>…�?nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/19/292703.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292703.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-19 21:55 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/19/292703.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>���盘存储定w��计算</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/18/292702.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Mon, 18 May 2009 12:30:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/18/292702.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292702.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/18/292702.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292702.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292702.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: ���盘上的数据都存放于���道上。磁道就是磁盘上的一�l�同心圆�Q�其宽度与磁头的宽度相同。�ؓ了避免减���干扎ͼ����道与磁道之间要保持一定的距离(inter-track gap)�Q�沿���盘半径方向�Q�单位长度内���道的数目称之�ؓ道密�?�?英寸,TPI)�Q�最外层�?道。…�?nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/18/292702.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292702.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-18 20:30 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/18/292702.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>汇编基础入门知识</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/17/292040.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Sun, 17 May 2009 15:18:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/17/292040.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292040.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/17/292040.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292040.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292040.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最�q�想初步了解一下汇�~�的内容�Q�在�|�上搜了搜，发现一���写得很不错的文章，特地转过来留存。写得浅显易懂，而且加入了很多个人的见解�Q�比书上写的好懂多了。比较钦佩作者，可惜找了半天没有扑ֈ��q�篇文章的原作者是谁。�{载地址�Q�http://www.zxbc.cn/html/20070611/22772.html&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/17/292040.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292040.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-17 23:18 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/17/292040.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>�~�译原理文法知识</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/16/292701.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Sat, 16 May 2009 14:57:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/16/292701.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292701.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/16/292701.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292701.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292701.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 今天来学习一下编译原理的文法相关知识。这是属于计���机的基���内容�Q�还是比较有用的一块内容，比较�c�M��于数据结构，但是针对计算机的低��语言。一般来讲比较难以理解，暂时���只是了解一下吧。OK开始：
<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/16/292701.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292701.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-16 22:57 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/16/292701.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>软�g设计&amp;ldquo;内聚�?amp;rdquo;&amp;ldquo;耦合�?amp;rdquo;介绍</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/15/292700.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Fri, 15 May 2009 13:08:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/15/292700.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292700.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/15/292700.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292700.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292700.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 当个�E�序�D�|��语句(指��o)引用了其它程序段或语�?指��o)中所定义或��用的数据�?卛_��贮区、地址�{?或代码时�Q�他们之间就发生了联�p�R��一个程序被划分������q�模块时�Q�联�p�L��可存在于模块之间�Q�也可存在于一个模块内的程序段或语句之��_����x��块内部。联�p�d��映了�pȝ��中程序段或语句之间的关系�Q�不同类型的联系构成不同质量的系�l�。因此，联系是系�l�设计必��考虑的重要问题�?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/15/292700.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292700.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-15 21:08 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/15/292700.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>PV原语操作详解</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/10/292697.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Sun, 10 May 2009 13:12:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/10/292697.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292697.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/10/292697.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292697.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292697.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: PV原语通过操作信号量来处理�q�程间的同步与互斥的问题。其核心���是一�D�不可分割不可中断的�E�序。信号量的概�?965�q�由著名的荷兰计���机�U�学家Dijkstra提出�Q�其基本思�\是用一�U�新的变量类�?semaphore)来记录当前可用资源的数量�?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/10/292697.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292697.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-10 21:12 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/10/292697.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>UML设计�?�U�图�?/title><link>http://www.aygfsteel.com/decode360/archive/2009/05/09/292696.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Sat, 09 May 2009 15:21:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/09/292696.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292696.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/09/292696.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292696.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292696.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 对UML不是很了解，���单得了解一下UML设计中有的图例及基本作用。首先对UML中的各个囄���功用做一个简单介�l�：
<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/09/292696.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292696.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-09 23:21 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/09/292696.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>白盒���试中的六种覆盖�Ҏ��</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/08/292695.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Fri, 08 May 2009 15:25:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/08/292695.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292695.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/08/292695.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292695.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292695.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 白盒���试作�ؓ���试人员常用的一�U�测试方法，���来���受到测试工�E�师的重视。白盒测试�ƈ不是���单的按照代码设计用例�Q�而是需要根据不同的���试需求，�l�合不同的测试对象，使用适合的方法进行测试。因为对于不同复杂度的代码逻辑�Q�可以衍生出许多�U�执行�\径，只有适当的测试方法，才能帮助我们从代码的�q�雾���林中找到正���的方向。本文介�l�六�U�白盒子���试�Ҏ���Q�语句覆盖、判定覆盖、条件覆盖、判定条件覆盖、条件组合覆盖、�\径覆盖�?
<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/08/292695.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292695.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-08 23:25 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/08/292695.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>�pȝ�����试概念学习</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/07/292693.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Thu, 07 May 2009 13:03:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/07/292693.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292693.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/07/292693.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292693.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292693.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: �pȝ�����试的�Q务是把��Y件放在实际的����g和网�l�环境中�q�行���试�Q�主要测试��Y件的非功能需求和质量属性是否得到满���뀂系�l�测试通常采用黑盒���试�Q�强调的是功能而不是结构。计���机软�g是基于计���机�pȝ��的一个重要组成部分，在系�l�测试之前，软�g工程师应完成下列工作�Q�　　
<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/07/292693.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292693.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-07 21:03 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/07/292693.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>各类排序�Ҏ������?/title><link>http://www.aygfsteel.com/decode360/archive/2009/05/06/292692.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Wed, 06 May 2009 14:57:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/06/292692.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292692.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/06/292692.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292692.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292692.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 排序一般可以包括以下几�U�：
<br>◆插入排�?直接插入排序,希尔排序)
<br>◆选择排序(���单交换排�?堆排�?
<br>◆交换排�?冒��排序,快速排�?
<br>◆归�q�排�?<br>◆基数排�?<br>下面逐一介绍�Q?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/06/292692.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292692.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-06 22:57 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/06/292692.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>作业的状态及调度</title><link>http://www.aygfsteel.com/decode360/archive/2009/05/05/292691.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Tue, 05 May 2009 13:37:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/05/05/292691.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292691.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/05/05/292691.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292691.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292691.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个作业从交给计算机系�l�到执行�l�束推出�pȝ���Q�一般都要经历提交、后备、执行和完成四个状态。其状态状态�{换如图所�C�：
<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/05/05/292691.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292691.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-05-05 21:37 <a href="http://www.aygfsteel.com/decode360/archive/2009/05/05/292691.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[数据�l�构] �?&amp;amp; �?/title><link>http://www.aygfsteel.com/decode360/archive/2009/04/30/292690.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Thu, 30 Apr 2009 15:17:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/04/30/292690.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292690.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/04/30/292690.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292690.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292690.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 树和图是数据�l�构中最基础的知识，今天来了解一下这部分知识的基本概��c�?nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/04/30/292690.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292690.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-04-30 23:17 <a href="http://www.aygfsteel.com/decode360/archive/2009/04/30/292690.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>TCP和UDP的区�?/title><link>http://www.aygfsteel.com/decode360/archive/2009/04/27/292689.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Mon, 27 Apr 2009 14:16:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/04/27/292689.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292689.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/04/27/292689.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292689.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292689.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 发现对TCP和UDP的认识很是不专业�Q�所以专门上�|�看看，发现分不清楚的�h�q�真挺多�Q�所以搞点详�l�资料看看。以下详�l�内容：
<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/04/27/292689.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292689.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-04-27 22:16 <a href="http://www.aygfsteel.com/decode360/archive/2009/04/27/292689.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>存储���理相关问答[转]</title><link>http://www.aygfsteel.com/decode360/archive/2009/04/26/292688.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Sun, 26 Apr 2009 13:49:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/04/26/292688.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292688.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/04/26/292688.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292688.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292688.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 了解了存储管理的基础知识和原理，但是对于具体的一些情况还是知之甚���，于是又在�|�上���M�����资料，发现下面�q�几道课后问�{�题很是能够加深对存储管理这块内容的理解�Q�特意�{载过来�?<br>&nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/04/26/292688.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292688.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-04-26 21:49 <a href="http://www.aygfsteel.com/decode360/archive/2009/04/26/292688.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>存储���理�Ҏ��详解</title><link>http://www.aygfsteel.com/decode360/archive/2009/04/25/292687.html</link><dc:creator>decode360</dc:creator><author>decode360</author><pubDate>Sat, 25 Apr 2009 13:13:00 GMT</pubDate><guid>http://www.aygfsteel.com/decode360/archive/2009/04/25/292687.html</guid><wfw:comment>http://www.aygfsteel.com/decode360/comments/292687.html</wfw:comment><comments>http://www.aygfsteel.com/decode360/archive/2009/04/25/292687.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/decode360/comments/commentRss/292687.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/decode360/services/trackbacks/292687.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 存储���理是操作系�l�的重要�l�成部分�Q�它负责计算机系�l�内存空间的���理。其目的是充分利用内存空��_��为多道程序�ƈ发执行提供存储基����Q��ƈ���可能地方便用户使用�?nbsp;&nbsp;<a href='http://www.aygfsteel.com/decode360/archive/2009/04/25/292687.html'>阅读全文</a><img src ="http://www.aygfsteel.com/decode360/aggbug/292687.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/decode360/" target="_blank">decode360</a> 2009-04-25 21:13 <a href="http://www.aygfsteel.com/decode360/archive/2009/04/25/292687.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>                                               <footer>
<div class="friendship-link">
<a href="http://www.aygfsteel.com/" title="&#29408;&#29408;&#20037;&#20037;&#20122;&#27954;&#27431;&#32654;&#19987;&#21306;&#95;&#20013;&#25991;&#23383;&#24149;&#20122;&#27954;&#32508;&#21512;&#20037;&#20037;&#50;&#48;&#50;&#95;&#22269;&#20135;&#31934;&#21697;&#20122;&#27954;&#31532;&#20116;&#21306;&#22312;&#32447;&#95;&#26085;&#26412;&#20813;&#36153;&#32593;&#31449;&#35270;&#39057;">&#29408;&#29408;&#20037;&#20037;&#20122;&#27954;&#27431;&#32654;&#19987;&#21306;&#95;&#20013;&#25991;&#23383;&#24149;&#20122;&#27954;&#32508;&#21512;&#20037;&#20037;&#50;&#48;&#50;&#95;&#22269;&#20135;&#31934;&#21697;&#20122;&#27954;&#31532;&#20116;&#21306;&#22312;&#32447;&#95;&#26085;&#26412;&#20813;&#36153;&#32593;&#31449;&#35270;&#39057;</a>

</div>

</footer>


��վ֩���ģ�壺
<a href="http://" target="_blank">�°Ͷ�����</a>|
<a href="http://" target="_blank">崲���</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">մ����</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">��³��</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">��ˮ</a>|
<a href="http://" target="_blank">�ػ���</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">�ʻ���</a>|
<a href="http://" target="_blank">���</a>|
<a href="http://" target="_blank">��Ϸ</a>|
<a href="http://" target="_blank">��ˮ��</a>|
<a href="http://" target="_blank">۶����</a>|
<a href="http://" target="_blank">�����</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">�������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">̨����</a>|
<a href="http://" target="_blank">�»���</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">ͨμ��</a>|
<a href="http://" target="_blank">��ˮ��</a>|
<a href="http://" target="_blank">��ƽ��</a>|
<a href="http://" target="_blank">�¸���</a>|
<a href="http://" target="_blank">���п�ǰ��</a>|
<a href="http://" target="_blank">Ӣɽ��</a>|
<a href="http://" target="_blank">��ˮ��</a>|
<a href="http://" target="_blank">��Զ��</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">̨����</a>|
<a href="http://" target="_blank">�뽭��</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<script>
(function(){
    var bp = document.createElement('script');
    var curProtocol = window.location.protocol.split(':')[0];
    if (curProtocol === 'https') {
        bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
    }
    else {
        bp.src = 'http://push.zhanzhang.baidu.com/push.js';
    }
    var s = document.getElementsByTagName("script")[0];
    s.parentNode.insertBefore(bp, s);
})();
</script>
</body>