http___blog.unone.org_date_2008_06_2.xml
http___www.ontko.com_moss_.xml
1.1 1.2 1.3 1.4 1.5 2.1 3.1 4.1 5.1 6.1 7.1 7.2 8.1 9.1 10.1 11.1 12.1 13.1 14.1 15.1 16.1 17.1 17.2 18.1 19.1 20.1 21.1 22.1 23.1 24.1 25.1 25.2 26.1 27.1 28.1 29.1 30.1 31.1 32.1
От доста време се замислях да напиша такъв плъгин и ето я първата версия на плъгина. Благодарение на поста на Пламен Томов за Подобни резултати от Google Blogsearch се роди идеята. Доразвих неговия код, използвайки вградени за wordpress класове и функции ( т.е. няма нужда от добавяне на нови файлове, просто качвате плъгина във директорията /wp-content/plugins/, след което го активирате от административния панел ), като по този начин се подобрява бързодействието на плъгина, защото не зарежда много файлове наведнъж. Плъгина има възможност да се скинва – т.е. частта с html-a е отделена във файла theme.php, css-а е изведен във файла style.css, като използва зададените по подразбиране стилове от оригиналния css файл. Плъгина е xHTML съвместим. Линкът http://blog.unone.org/wp-content/uploads/2008/06/blogsearch1.rar Идеята Идеята на плъгина е да покаже свързани по смисъл постове от други блогове, от което печелите допълнително ключови думи по съответната тема, на която е поста. Как работи плъгина? Ако има добавени тагове към поста, ги взима и прави заявка към blogsearch.google.com, ако липсват такива – взима всички думи от заглавието и тогава прави заявката. Резултатите се визуализират директно след самия пост Инсталация - Разархивирайте архивния файл, след което копирайте създалата се директория във /wp-content/plugins/ на вашата wordpress инсталация - Активирайте плъгина от раздел “Plugins” Описание на файловете - blogsearch.php – основния файл за плъгина – препоръчително е да не се редактира - theme.php – файла с html-a – тук може да дописвате, редактирате тагове на HTML и съдържание - style.css – css файла, който можете да ползвате, за да скиннете плъгина - readme.txt – стандартен readme файл Лиценз На фона на интернет пиратството, винаги е било забавно да се говори за лицензи. Включил съм плъгина текст от GPL лиценза: Copyright 2008 by Manol Trendafilov (email : manol.trendafilov /at/ gmail.com) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Разпространява се свободно и безплатно под GPL лиценз ( тъй като винаги съм бил фен на Линукса, е под GPL, а не някакъв друг ) Чувствайте се свободни, да коментирате, да давате идеи за развитието на плъгина, защо не и да критикувате. Първият ми плъгин за WordPress Йее!
1.1 2.1 3.1 4.1 5.1 6.1 7.1 8.1 9.1 9.2 10.1 11.1 12.1 13.1 14.1 15.1 16.1 17.1 18.1 19.1 20.1 21.1 22.1 23.1 24.1 25.1 27.1 28.1 28.2 29.1 30.1 31.1 31.2 32.1 32.2 33.1 34.1 35.1 37.1 38.1 39.1 40.1 40.2 41.1 42.1 43.1 43.2 44.1 45.1 46.1 46.2 47.1 48.1 49.1 51.1 52.1 52.2 53.1 54.1 55.1 55.2 56.1 56.2 57.1 58.1 59.1 60.1 61.1 62.1 63.1 64.1 65.1 66.1 68.1 69.1 69.2 70.1 71.1 71.2 72.1 73.1 74.1 74.2 75.1 76.1 77.1 78.1 79.1 80.1 81.1 82.1 83.1 84.1 85.1 85.2 86.1 87.1 88.1 89.1 90.1 91.1 92.1 93.1 94.1 95.1 96.1 97.1 98.1 99.1 100.1
Modern Operating Systems Simulators moss (Modern Operating Systems Simulators) is a collection of Java-based simulation programs which illustrate key concepts presented in the text Andrew S. Tanenbaum, Modern Operating System, Second Edition (Prentice-Hall, 2001). The software is designed for students and instructors using this text. Additional supplemental material for this and other Tanenbaum texts is available from the author's site. moss was written by Ray Ontko and Alexander Reeder with advice from Andrew S. Tanenbaum and support from Prentice-Hall. Send comments, suggestions, enhancements to Ray Ontko (rayo@ontko.com). Each simulator is packaged separately, and is available for both Unix and Windows 95/98/Me/NT/2000 systems. Contents - Scheduling (Chapter 2) The scheduling simulator illustrates the behavior of scheduling algorithms against a simulated mix of process loads. The user can specify the number of processes, the mean and standard deviation for compute time and I/O blocking time for each process, and the duration of the simulation. At the end of the simulation a statistical summary is presented. Students may also be asked to write their own scheduling algorithms to be used with process loads defined by the instructor. - Deadlocking (Chapter 3) The deadlock simulator illustrates multiple processes competing for one or more resources to investigate the nature and causes of deadlock conditions and how they can be avoided, detected, and resolved. The simulator includes a graphical user interface that allows the student to step through the "programs" being concurrently "executed" by each of the processes and see which processes are blocked by which resources. A typical student lab exercise might require students to write simple "programs" for the simulator to investigate different kinds of resource contention conditions. More advanced students might write a deadlock manager (in Java) based on the template provided, and test it using "programs" of their own design. - Memory Management (Chapter 4) The memory management simulator illustrates page fault behavior in a paged virtual memory system. The program reads the initial state of the page table and a sequence of virtual memory instructions and writes a trace log indicating the effect of each instruction. It includes a graphical user interface so that students can observe page replacement algorithms at work. Students may be asked to implement a particular page replacement algorithm which the instructor can test by comparing the output from the student's algorithm to that produced by a working implementation. Also, Alejandro Pérez Reyna, Juan Luis Gutierrez Pallares, and Ricardo Bautista Santacruz of Benemérita Universidad Autonoma de Puebla, México, provide a simulation of Belady's Anomaly. - File System (Chapter 6) The file system simulator shows the inner workings of a UNIX V7 file system. The simulator reads or creates a file which represents the disk image, and keeps track of allocated and free blocks using a bit map. A typical exercise might be for students to write a program (in Java) which invokes various simulated operating system calls against a well-known disk image provided by the instructor. Students may also be asked to implement indirect blocks, list-based free block managment, or write a utility (like fsck) to check and repair the file system. moss operating system simulators Copyright (C) 2001, Prentice-Hall, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. A copy of the GPL is available online at the GNU web site: http://www.gnu.org/copyleft/gpl.html Java is a trademark of Sun Microsystems, Inc., and refers to Sun's Java programming language technology. moss is not sponsored by or affiliated with Sun Microsystems, Inc. This page maintained by Ray Ontko (rayo@ontko.com). Last updated: Sunday, November 23, 2008