<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/32379?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/32379?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</guid>
	<pubDate>Fri, 03 Mar 2017 08:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</link>
	<title><![CDATA[MyCC: Accurate binning of metagenomic contigs via automated clustering sequences using information of genomic signatures and marker genes]]></title>
	<description><![CDATA[<p><span>MyCC, an automated binning tool that combines genomic signatures, marker genes and optional contig coverages within one or multiple samples, in order to visualize the metagenomes and to identify the reconstructed genomic fragments.</span></p>
<p><span>More at&nbsp;http://www.nature.com/articles/srep24175</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/sb2nhri/files/MyCC/" rel="nofollow">https://sourceforge.net/projects/sb2nhri/files/MyCC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</guid>
	<pubDate>Mon, 06 Mar 2017 04:03:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</link>
	<title><![CDATA[MaxBin: software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm.]]></title>
	<description><![CDATA[<p><span>MaxBin is software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users can understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page.</span><br><br><span>Users can use MEGAN or similar software on MaxBin bins to find the taxonomy of each bin after the binning process is finished.</span></p>
<p>https://academic.oup.com/bioinformatics/article/32/4/605/1744462/MaxBin-2-0-an-automated-binning-algorithm-to<br><br><span>The most recent version of MaxBin is 2.2, which supports the analysis of coassemblies of multiple samples. It is available at this JBEI downloads sites as well as&nbsp;</span><a href="https://sourceforge.net/projects/maxbin/" target="_blank">MaxBin</a><span>&nbsp;and&nbsp;</span><a href="https://sourceforge.net/projects/maxbin2/" target="_blank">MaxBin 2.0</a><span>&nbsp;sourceforge sites.</span></p><p>Address of the bookmark: <a href="http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html" rel="nofollow">http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</guid>
	<pubDate>Tue, 07 Mar 2017 08:59:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</link>
	<title><![CDATA[GroopM: Metagenomic binning toolset]]></title>
	<description><![CDATA[<p>GroopM is a metagenomic binning toolset. It leverages spatio-temoral<br>dynamics (differential coverage) to accurately (and almost automatically)<br>extract population genomes from multi-sample metagenomic datasets.</p>
<p>GroopM is largely parameter-free. Use: groopm -h for more info.</p>
<p>For installation and usage instructions see : http://ecogenomics.github.io/GroopM/</p><p>Address of the bookmark: <a href="https://github.com/ecogenomics/GroopM" rel="nofollow">https://github.com/ecogenomics/GroopM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32048/json</guid>
	<pubDate>Tue, 04 Apr 2017 08:02:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32048/json</link>
	<title><![CDATA[JSON]]></title>
	<description><![CDATA[<p><strong>JSON</strong>&nbsp;(JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the&nbsp;<a href="http://javascript.crockford.com/">JavaScript Programming Language</a>,&nbsp;<a href="http://www.ecma-international.org/publications/files/ecma-st/ECMA-262.pdf">Standard ECMA-262 3rd Edition - December 1999</a>. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.</p>
<p>JSON is built on two structures:</p>
<ul>
<li>A collection of name/value pairs. In various languages, this is realized as an&nbsp;<em>object</em>, record, struct, dictionary, hash table, keyed list, or associative array.</li>
<li>An ordered list of values. In most languages, this is realized as an&nbsp;<em>array</em>, vector, list, or sequence.</li>
</ul>
<p>These are universal data structures. Virtually all modern programming languages support them in one form or another. It makes sense that a data format that is interchangeable with programming languages also be based on these structures.</p><p>Address of the bookmark: <a href="http://json.org/" rel="nofollow">http://json.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</guid>
	<pubDate>Fri, 05 May 2017 05:58:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</link>
	<title><![CDATA[CLA: Contig-Layout-Authenticator]]></title>
	<description><![CDATA[<p><span>To improve upon the shortcomings associated with the construction of draft genomes with Illumina paired-end sequencing, we developed Contig-Layout-Authenticator (CLA). The CLA pipeline can scaffold reference-sorted contigs based on paired reads, resulting in better assembled genomes. Moreover, CLA also hints at probable misassemblies and contaminations, for the users to cross-check before constructing the consensus draft. The CLA pipeline was designed and trained extensively on various bacterial genome datasets for the ordering and scaffolding of large repetitive contigs. The tool has been validated and compared favorably with other widely-used scaffolding and ordering tools using both simulated and real sequence datasets. CLA is a user friendly tool that requires a single command line input to generate ordered scaffolds.</span></p>
<p><span>Script&nbsp;https://sourceforge.net/projects/c-l-authenticator/files/</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44751/large-language-models-in-bioinformatics-transforming-data-analysis-and-interpretation</guid>
	<pubDate>Thu, 02 Jan 2025 11:26:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44751/large-language-models-in-bioinformatics-transforming-data-analysis-and-interpretation</link>
	<title><![CDATA[Large Language Models in Bioinformatics: Transforming Data Analysis and Interpretation]]></title>
	<description><![CDATA[<p>The integration of artificial intelligence (AI) into bioinformatics has ushered in a new era of computational biology. Among the most transformative advancements are large language models (LLMs), such as GPT and BERT, which leverage deep learning to process and interpret vast amounts of text data. These models are reshaping bioinformatics by enhancing data analysis, hypothesis generation, and literature mining.</p><h3>Understanding Large Language Models</h3><p>LLMs are AI systems trained on extensive datasets of natural language. Their ability to model context, identify patterns, and generate coherent language has proven invaluable across domains, including bioinformatics. By fine-tuning these models on biological datasets, researchers can unlock insights into molecular biology, systems biology, and beyond.</p><h3>Key Applications of LLMs in Bioinformatics</h3><h4>1. <strong>Annotating Biological Data</strong></h4><p>Annotating genomic and proteomic data is fundamental yet labor-intensive. LLMs streamline this process by extracting functional annotations from literature and databases, predicting gene and protein functions, and providing automated insights.</p><h4>2. <strong>Mining Scientific Literature</strong></h4><p>The exponential growth of publications presents a challenge for researchers to stay updated. LLMs can process large volumes of text to extract key findings, summarize papers, and identify trends, thereby facilitating efficient literature reviews.</p><h4>3. <strong>Predicting Gene and Protein Functions</strong></h4><p>By leveraging sequence data and annotations, LLMs can predict the functions of uncharacterized genes and proteins. This capability is particularly useful for studying non-model organisms and orphan genes.</p><h4>4. <strong>Drug Discovery and Repurposing</strong></h4><p>LLMs enable pattern recognition across chemical, genomic, and clinical datasets, identifying novel drug candidates and repurposing existing drugs for new therapeutic targets. They can simulate interactions between drugs and biological molecules, accelerating the discovery pipeline.</p><h4>5. <strong>Generating Hypotheses for Research</strong></h4><p>LLMs analyze complex datasets to propose testable hypotheses. For example, they can predict protein-protein interactions, identify regulatory motifs, or model evolutionary processes in genomes.</p><h3>Advantages of LLMs in Bioinformatics</h3><ul>
<li>
<p><strong>Scalability:</strong> LLMs process massive datasets rapidly, reducing the time required for data analysis.</p>
</li>
<li>
<p><strong>Versatility:</strong> These models adapt to diverse bioinformatics tasks, from genomic annotation to network analysis.</p>
</li>
<li>
<p><strong>Contextual Insights:</strong> By synthesizing information across disparate datasets, LLMs provide integrative insights into biological systems.</p>
</li>
</ul><h3>Challenges in Applying LLMs</h3><p>Despite their promise, LLMs face limitations:</p><ul>
<li>
<p><strong>Data Quality and Bias:</strong> Inaccurate or biased datasets can affect model predictions, necessitating rigorous data curation.</p>
</li>
<li>
<p><strong>Interpretability:</strong> Understanding the decision-making process of LLMs remains a critical challenge, especially in high-stakes fields like genomics and medicine.</p>
</li>
<li>
<p><strong>Resource Intensity:</strong> Training and deploying LLMs require substantial computational power, which can limit accessibility.</p>
</li>
<li>
<p><strong>Ethical Concerns:</strong> Handling sensitive genomic data raises privacy and security issues, emphasizing the need for ethical guidelines.</p>
</li>
</ul><h3>Future Prospects</h3><p>The continued development of LLMs tailored for bioinformatics promises exciting advancements. Specialized models trained on omics data, open-access platforms, and interdisciplinary collaborations will expand the utility of LLMs. Moreover, integrating LLMs with other AI technologies, such as graph neural networks and reinforcement learning, can unlock deeper biological insights.</p><h3>Conclusion</h3><p>Large language models are revolutionizing bioinformatics by addressing longstanding challenges in data annotation, literature mining, and function prediction. Their ability to analyze complex biological datasets efficiently positions them as indispensable tools for modern research. As bioinformatics embraces AI, the synergy between LLMs and biological sciences holds the potential to unravel the complexities of life with unprecedented precision and scale.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4004/33rd-annual-convention-of-indian-association-for-cancer-research-from-13th-to-15th-february-2014</guid>
  <pubDate>Tue, 27 Aug 2013 10:37:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[33rd Annual Convention of Indian Association for Cancer Research from 13th to 15th February 2014]]></title>
  <description><![CDATA[
<p>RGCB is organizing the 33rd Annual Convention of Indian Association for Cancer Research from 13th to 15th February 2014 with the theme "Discovery, Innovation and Translation in Cancer Research"</p>

<p>Kindly log on to conference website http://rgcb.res.in/IACR2014 for further details and timely updates and registration. We shall truly appreciate if the same be circulated among your friends, scholars and students encouraging them to participate in the meet.</p>

<p>http://210.212.237.38/iacrconference/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4100/should-you-get-sequenced-not-all-bad-genes-predict-disease</guid>
	<pubDate>Thu, 29 Aug 2013 15:10:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4100/should-you-get-sequenced-not-all-bad-genes-predict-disease</link>
	<title><![CDATA[Should you get sequenced? Not all bad genes predict disease]]></title>
	<description><![CDATA[<p><span>&ldquo;What we really don&rsquo;t know yet is whether the predictive aspects of the genome are going to turn out to be beneficial or potentially harmful&rdquo;</span></p>
<p><span><span>&ldquo;As we roll out genomic medicine we are fighting against this society-wide misconception that having the bad gene means you&rsquo;re going to get the disease. That&rsquo;s only true in a very few cases.&rdquo;</span></span></p>
<p><span><span><strong>Source</strong>:Today Health</span></span></p><p>Address of the bookmark: <a href="http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154" rel="nofollow">http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41863/ppai-a-web-server-for-predicting-protein-aptamer-interactions</guid>
	<pubDate>Fri, 12 Jun 2020 07:26:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41863/ppai-a-web-server-for-predicting-protein-aptamer-interactions</link>
	<title><![CDATA[PPAI: a web server for predicting protein-aptamer interactions]]></title>
	<description><![CDATA[<p><span>PPAI can query aptamers and proteins, predict aptamers and predict protein-aptamer interactions in batch mode precisely and efficiently, which would be a novel bioinformatics tool for the research of protein-aptamer interactions. PPAI web-server is freely available at&nbsp;</span><a href="http://39.96.85.9/PPAI">http://39.96.85.9/PPAI</a></p><p>Address of the bookmark: <a href="http://39.96.85.9/PPAI/" rel="nofollow">http://39.96.85.9/PPAI/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/10409/check-linux-server-configuration</guid>
	<pubDate>Tue, 06 May 2014 01:10:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/10409/check-linux-server-configuration</link>
	<title><![CDATA[Check Linux server configuration !!]]></title>
	<description><![CDATA[<p>Bioinformatician uses servers for computational analysis. Sometime we need to check the server details before running our programs or tools. Here I am showing some basic commands using them you can gather the system/server information.<br /><br />To check what version of Operating System is installed on the server you can use the following commands:-<br />&nbsp;=================================================================<br />1.cat /etc/issue<br />[root@localhost ~]# cat /etc/issue<br />Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br />Kernel \r on an \m<br /><br />2.cat /etc/redhat-release<br />[root@localhost ~]# cat /etc/redhat-release<br />Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br /><br /><br />3.lsb_release -a<br />[root@localhost ~]# lsb_release -a<br />LSB Version:&nbsp;&nbsp;&nbsp; :core-3.1-ia32:core-3.1-noarch:graphics-3.1-ia32:graphics-3.1-noarch<br />Distributor ID: RedHatEnterpriseServer<br />Description:&nbsp;&nbsp;&nbsp; Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br />Release:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5.5<br />Codename:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Tikanga<br /><br /><br /><br />To check whether the operating system is 32 or 64bit:-<br />================================<br /># uname -i<br />[root@localhost ~]# uname -i<br />i386<br />(i386 represents that server is having 32bit operating system)<br /><br />[root@localhost ~]# uname -i<br />x86_64<br />(x86_64 represents that server is having 64bit operating system)<br /><br />To see the processor/CPU information:-<br />=============================<br /># cat /proc/cpuinfo<br />[root@localhost ~] cat /proc/cpuinfo<br />processor&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />vendor_id&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : GenuineIntel<br />cpu family&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 6<br />model&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 15<br />model name&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : Intel(R) Xeon(R) CPU&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5130&nbsp; @ 2.00GHz<br />stepping&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 6<br />cpu MHz&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 1995.087<br />cache size&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 4096 KB<br />physical id&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />siblings&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 2<br />core id&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />cpu cores&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 2<br />apicid&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />fdiv_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />hlt_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />f00f_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />coma_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />fpu&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : yes<br />fpu_exception&nbsp;&nbsp; : yes<br />cpuid level&nbsp;&nbsp;&nbsp;&nbsp; : 10<br />wp&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : yes<br />flags&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe nx lm constant_tsc pni monitor ds_cpl vmx tm2 ssse3 cx16 xtpr lahf_lm<br />bogomips&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 3990.17<br />(Here processor number 0 indicates that the system is having one process(processor number starts with zero))<br /><br /><br /><br /><br />To check memory information:-<br />===========================<br /># free -m<br />[root@localhost ~]# free -m<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; total&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; used&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; free&nbsp;&nbsp;&nbsp;&nbsp; shared&nbsp;&nbsp;&nbsp; buffers&nbsp;&nbsp;&nbsp;&nbsp; cached<br />Mem:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5066&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 3513&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1552&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 612&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2319<br />-/+ buffers/cache:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 582&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4484<br />Swap:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1983&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1983<br /><br /><br /><br /># cat /proc/meminfo<br />[root@localhost ~]# cat /proc/meminfo<br />MemTotal:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5187752 kB<br />MemFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1639300 kB<br />Buffers:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 627024 kB<br />Cached:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2374944 kB<br />SwapCached:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />Active:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2458788 kB<br />Inactive:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 920964 kB<br />HighTotal:&nbsp;&nbsp;&nbsp;&nbsp; 4325164 kB<br />HighFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1561936 kB<br />LowTotal:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 862588 kB<br />LowFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 77364 kB<br />SwapTotal:&nbsp;&nbsp;&nbsp;&nbsp; 2031608 kB<br />SwapFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2031608 kB<br />Dirty:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 704 kB<br />Writeback:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />AnonPages:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 377892 kB<br />Mapped:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 35328 kB<br />Slab:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 153036 kB<br />PageTables:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 6316 kB<br />NFS_Unstable:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />Bounce:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />CommitLimit:&nbsp;&nbsp; 4625484 kB<br />Committed_AS:&nbsp;&nbsp; 977132 kB<br />VmallocTotal:&nbsp;&nbsp; 116728 kB<br />VmallocUsed:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4492 kB<br />VmallocChunk:&nbsp;&nbsp; 112124 kB<br />HugePages_Total:&nbsp;&nbsp;&nbsp;&nbsp; 0<br />HugePages_Free:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0<br />HugePages_Rsvd:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0<br />Hugepagesize:&nbsp;&nbsp;&nbsp;&nbsp; 2048 kB<br /><br /><br />To check the model and serial name of the server:-<br />=======================================<br />[root@localhost ~]#&nbsp; dmidecode | egrep -i "product name|Serial number"<br />Product Name: PowerEdge R710<br />Serial Number: AB8CDE1<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br /><br />To check the host name:-<br />=====================<br />[root@localhost ~]# uname -n<br />localhost<br /><br />[root@localhost ~]# hostname<br />localhost<br /><br />To check the kernel version:-<br />========================<br />[root@localhost ~]# uname -r<br />2.6.18-238.9.1.el5PAE</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>