http://www.bibsonomy.org/burst/tag/articleBibSonomy BuRST Feed for /tag/article2008-07-27T03:48:36+02:00The {E}mergent {S}emantic {W}eb: {A} {C}onsensus {A}pproach for {D}eriving {S}emantic {K}nowledge on the {W}ebhttp://www.bibsonomy.org/bibtex/25edf40c9c7556be1aff3fff153d6fc2a/greschgresch2008-07-20T15:03:22+02:00develop article knowledge software semantic <span style="color:#555555;">Clifford <a href="http://www.bibsonomy.org/author/Behrens">Behrens</a> and Vipul <a href="http://www.bibsonomy.org/author/Kashyap">Kashyap</a> </span><em>Proceedings of the International Semantic Web Working Symposium, </em><em>Stanford, CA, </em>(<em>2001</em>)Sun Jul 20 15:03:22 CEST 2008Stanford, CAProceedings of the International Semantic Web Working SymposiumThe {E}mergent {S}emantic {W}eb: {A} {C}onsensus {A}pproach for {D}eriving {S}emantic {K}nowledge on the {W}eb2001develop article knowledge software semantic http://www.bibsonomy.org/bibtex/29fbeba4fa01dbe49df6e48541a92af24/cschenkcschenk2008-06-30T16:27:20+02:00xt read:2008 projekt praxis article modell tüv ix v-modell <span style="color:#555555;">Dirk <a href="http://www.bibsonomy.org/author/Niebuhr">Niebuhr</a> and Marco <a href="http://www.bibsonomy.org/author/Kuhrmann">Kuhrmann</a> </span><em>iX</em><em>Januar2006. </em>Mon Jun 30 16:27:20 CEST 2008iXJanuar126-129Projekt-TÜV. Erste Praxiserfahrungen mit dem V-Modell XT12006xt read:2008 projekt praxis article modell tüv ix v-modell http://www.bibsonomy.org/bibtex/243d2c72e40212957f3d6ed66a4a104b3/cschenkcschenk2008-06-30T16:14:54+02:00ix email blacklists article spam read:2008 ip <span style="color:#555555;">Christian <a href="http://www.bibsonomy.org/author/Rossow">Rossow</a> and Christian <a href="http://www.bibsonomy.org/author/Dietrich">Dietrich</a> and Norbert <a href="http://www.bibsonomy.org/author/Pohlmann">Pohlmann</a> </span><em>iX</em><em>Januar2008. </em>Mon Jun 30 16:14:54 CEST 2008iXJanuar56-61Blockwerk. IP-Blacklists sinnvoll kombinieren12008ix email blacklists article spam read:2008 ip http://www.bibsonomy.org/bibtex/2073b079a7206bcfb7a6ea0daf189e91d/cschenkcschenk2008-06-30T16:08:04+02:00norm read:2008 article information security ix zertifizierung isms sicherheit iso standards 27000 system bsi management <span style="color:#555555;">Alexander <a href="http://www.bibsonomy.org/author/Geschonneck">Geschonneck</a> </span><em>iX</em>(<em>2006</em>)Mon Jun 30 16:08:04 CEST 2008iX114-115Messbar. Neue Standards für Informationssicherheit12006norm read:2008 article information security ix zertifizierung isms sicherheit iso standards 27000 system bsi management http://www.bibsonomy.org/bibtex/22e725bdb785392dfa38fe4ff68fd965f/cschenkcschenk2008-06-30T16:03:06+02:00newsletter article adressen spam read:2008 email ix <span style="color:#555555;">Bert <a href="http://www.bibsonomy.org/author/Ungerer">Ungerer</a> </span><em>iX</em><em>Januar2008. </em>Mon Jun 30 16:03:06 CEST 2008iXJanuar48-54Vorsorgemaßnahmen. Korrekter Umgang mit E-Mail-Adressen12008newsletter article adressen spam read:2008 email ix http://www.bibsonomy.org/bibtex/21b2674f52f10eee8a8df1d71b4bcf84d/cschenkcschenk2008-06-25T17:09:15+02:00review harvard business article product scrum read:2008 hbr game development <span style="color:#555555;">Hirotaka <a href="http://www.bibsonomy.org/author/Takeuchi">Takeuchi</a> and Ikujiro <a href="http://www.bibsonomy.org/author/Nonaka">Nonaka</a> </span><em>Harvard Business Review</em>(<em>1986</em>)Wed Jun 25 17:09:15 CEST 2008Harvard Business ReviewThe New New Product Development Game1986review harvard business article product scrum read:2008 hbr game development http://www.bibsonomy.org/bibtex/2fc6178e7acc7fcc530557a7c95e92da4/cschenkcschenk2008-06-25T17:06:08+02:00agile read:2008 primer scrum management introduction project article <span style="color:#555555;">Pete <a href="http://www.bibsonomy.org/author/Deemer">Deemer</a> and Gabrielle <a href="http://www.bibsonomy.org/author/Benefield">Benefield</a> </span>(<em>2007</em>)Wed Jun 25 17:06:08 CEST 2008The Scrum Primer. An Introduction to Agile Project Management with Scrum2007agile read:2008 primer scrum management introduction project article http://www.bibsonomy.org/bibtex/2f7544762af984d2749bdccec3bcdbe31/cschenkcschenk2008-06-25T16:55:39+02:00principles article toyota read:2008 scrum <span style="color:#555555;">Boris <a href="http://www.bibsonomy.org/author/Gloger">Gloger</a> </span>(<em>2006</em>)Wed Jun 25 16:55:39 CEST 2008Scrum Delivers or Scrum and the Toyota Way2006principles article toyota read:2008 scrum Toyota often is touted as the world's best manufacturer. This success has been attributed to fourteen clearly identified principles. Find out how Scrum can allow you to model these ideals in your own product development.http://www.bibsonomy.org/bibtex/2e2620ffdbcabf3f96ddc391384f7a826/cschenkcschenk2008-06-25T10:57:21+02:00intro scrum five article overview development process minutes read:2008 5 <span style="color:#555555;"> <a href="http://www.bibsonomy.org/author/Softhouse">Softhouse</a> </span>(<em>2006</em>)Wed Jun 25 10:57:21 CEST 2008Scrum in five minutes2006intro scrum five article overview development process minutes read:2008 5 http://www.bibsonomy.org/bibtex/2830e8ea9bdc281d3f50536ee0f6f5754/cschenkcschenk2008-06-25T10:50:53+02:00agile scrum lessons development read:2008 first article <span style="color:#555555;">Dr. <a href="http://www.bibsonomy.org/author/Jeff Sutherland">Jeff Sutherland</a> </span><em>October2004. </em>Wed Jun 25 10:50:53 CEST 2008OctoberAgile Development: Lessons Learned From The First Scrum2004agile scrum lessons development read:2008 first article http://www.bibsonomy.org/bibtex/2ca089cfbba34e5ed7dc6db43c264d858/cschenkcschenk2008-06-25T10:25:44+02:00teams software scrum article read:2008 ieee development process <span style="color:#555555;">Linda <a href="http://www.bibsonomy.org/author/Rising">Rising</a> and Norman S. <a href="http://www.bibsonomy.org/author/Janoff">Janoff</a> </span><em>IEEE Software</em><em>July/August2000. </em>Wed Jun 25 10:25:44 CEST 2008IEEE SoftwareJuly/AugustThe Scrum Software Development Process for Small Teams2000teams software scrum article read:2008 ieee development process In today’s software development environment, requirements often change during the product development life cycle to meet shifting business demands, creating endless headaches for development teams. We discuss our experience in implementing the Scrum software development process to address these concerns.ScienceDirect - Electronic Notes in Theoretical Computer Science : Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularitieshttp://www.bibsonomy.org/bibtex/20f49c7d956f306d32d63b18f5a106022/emanuelemanuel2008-06-14T17:50:38+02:00igor2 rule-based_programming constructor_systems article analytical_ip inductive_programming induction program_synthesis <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> and Ute <a href="http://www.bibsonomy.org/author/Schmid">Schmid</a> </span><em>Electronic Notes in Theoretical Computer Science</em><em>174(1):49--63</em>(<em>2007</em>)Sat Jun 14 17:50:38 CEST 2008Proceedings of the 7th International Workshop on Rule Based Programming (RULE 2006)Electronic Notes in Theoretical Computer Science149--63Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities1742007igor2 rule-based_programming constructor_systems article analytical_ip inductive_programming induction program_synthesis We present a technique for inducing functional programs from few, well chosen input/output-examples (I/O-examples). Potential applications for automatic program or algorithm induction are to enable end users to create their own simple programs, to assist professional programmers, or to automatically invent completely new and efficient algorithms. In our approach, functional programs are represented as constructor term rewriting systems (CSs) containing recursive rules. I/O-examples for a target function to be implemented are a set of pairs of terms (F(i_i),o_i) meaning that F(i_i)---denoting application of function F to input i_i---is rewritten to o_i by a CS implementing the function F. Induction is based on detecting syntactic regularities between example terms. In this paper we present theoretical results and describe an algorithm for inducing CSs over arbitrary signatures/data types which consist of one function defined by an arbitrary number of rules with an arbitrary number of non-nested recursive calls in each rule. Moreover, we present empirical results based on a prototypical implementation.http://www.bibsonomy.org/bibtex/21becb457fcdff29bf2e60d3d8a329fb2/emanuelemanuel2008-06-14T17:43:48+02:00skeletons article parallel_programming <span style="color:#555555;">Holger <a href="http://www.bibsonomy.org/author/Bischof">Bischof</a> and Sergei <a href="http://www.bibsonomy.org/author/Gorlatch">Gorlatch</a> and Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> </span><em>Parallel Processing Letters</em><em>13(4):575--587</em>(<em>2003</em>)Sat Jun 14 17:43:48 CEST 2008Parallel Processing Letters4575--587Cost Optimality And Predictability Of Parallel Programming with Skeletons132003skeletons article parallel_programming Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approachhttp://www.bibsonomy.org/bibtex/241c72a03ba80767af6f77376acdbeb02/emanuelemanuel2008-06-14T17:41:39+02:00program_synthesis article inductive_programming ifp igor1 recursive_program_schemes induction analytical_ip ebg <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> and Ute <a href="http://www.bibsonomy.org/author/Schmid">Schmid</a> </span><em>Journal of Machine Learning Research</em>(<em>2006</em>)Sat Jun 14 17:41:39 CEST 2008Cambridge, MA, USAJournal of Machine Learning Research429--454Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach72006program_synthesis article inductive_programming ifp igor1 recursive_program_schemes induction analytical_ip ebg We describe an approach to the inductive synthesis of recursive equations from input/output-examples which is based on the classical two-step approach to induction of functional Lisp programs of Summers (1977). In a first step, I/O-examples are rewritten to traces which explain the outputs given the respective inputs based on a datatype theory. These traces can be integrated into one conditional expression which represents a non-recursive program. In a second step, this initial program term is generalized into recursive equations by searching for syntactical regularities in the term. Our approach extends the classical work in several aspects. The most important extensions are that we are able to induce a set of recursive equations in one synthesizing step, the equations may contain more than one recursive call, and additionally needed parameters are automatically introduced.http://www.bibsonomy.org/bibtex/26f8dd8da981d547650022c928617e677/ggraniggrani2008-06-13T16:35:21+02:00ontology folksonomy web_2.0 article <span style="color:#555555;">Mathias <a href="http://www.bibsonomy.org/author/Lux">Lux</a> and Gisela <a href="http://www.bibsonomy.org/author/Dösinger">D&#246;singer</a> </span><em>nternational Journal of Knowledge and Learning (IJKL)</em><em>3(4/5):515-528</em>(<em>2007</em>) <em>ISSN (Online): 1741-1017 ISSN (Print): 1741-1009 . </em>Fri Jun 13 16:35:21 CEST 2008nternational Journal of Knowledge and Learning (IJKL)ISSN (Online): 1741-1017 ISSN (Print): 1741-10094/5515-528From Folksonomies to Ontologies: Employing Wisdom of the Crowds to Serve Learning Purposes32007ontology folksonomy web_2.0 article Is Web 2.0 just hype or just a buzzword, which might disappear in the near future? One way to find answers to these questions is to investigate the actual benefit of the Web 2.0 for real use cases. Within this contribution we study a very special aspect of the Web 2.0 – the folksonomy – and its use within self-directed learning. Guided by conceptual principles of emergent computing we point out methods, which might be able to let semantics emerge from folksonomies and discuss the effect of the results in self-directed learning.http://www.bibsonomy.org/bibtex/2a70e57263c9b46159d9fb9c7e5e7f6c9/cschenkcschenk2008-06-09T17:29:08+02:00article fs fragmente verzeichnisse tuning linux ext3 c't read:2008 filesystem <span style="color:#555555;">Oliver <a href="http://www.bibsonomy.org/author/Diedrich">Diedrich</a> </span><em>c't</em><em>M&#228;rz2008. </em>Mon Jun 09 17:29:08 CEST 2008c'tMärz5214-219Fragmente und Verzeichnisse2008article fs fragmente verzeichnisse tuning linux ext3 c't read:2008 filesystem Ext3 ist das Standard-Dateisystem für Linux: robust, schnell, für alle Einsatzbereiche geeignet. Und trotzdem kann Ext3 zum Performance-Engpass werden. Selbst Fragmentierung ist bei Ext3 ein Thema.Talks about managing Eclipse plugins, workspaces and installations.http://www.bibsonomy.org/bibtex/2f66736c2d94206e938d1742b7594e894/cschenkcschenk2008-05-31T16:25:53+02:00read:2008 ibm environment manage article eclipse <span style="color:#555555;">Chris <a href="http://www.bibsonomy.org/author/Aniszczyk">Aniszczyk</a> and Phil <a href="http://www.bibsonomy.org/author/Crosby">Crosby</a> </span><em>February2006. </em>Sat May 31 16:25:53 CEST 2008FebruaryManage your Eclipse environment2006read:2008 ibm environment manage article eclipse The continuing growth of Eclipse means that there will always be an increase in the number of projects and plug-ins to manage. As a developer, this management process can be frustrating when staying up to date with the latest Eclipse builds. As a new user, the concept of projects, plug-ins, workspaces, and installations may seem daunting at first. This article aims to show some best practices for managing your Eclipse environment.foil, particularly dealing with closed worlds and making clauses more understandablehttp://www.bibsonomy.org/bibtex/229521d514edc325b3e1e3e7a88751f3f/emanuelemanuel2008-05-16T18:20:41+02:00inductive_programming induction enumerative_ip article applications foil program_synthesis ilp machine_learning <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Quinlan">Quinlan</a> and R. M. <a href="http://www.bibsonomy.org/author/Cameron-Jones">Cameron-Jones</a> </span><em>New Generation Computing, special issue on Inductive Logic Programming</em><em>13(3-4):287--312</em>(<em>1995</em>)Fri May 16 18:20:41 CEST 2008New Generation Computing, special issue on Inductive Logic Programming3-4287--312Induction of Logic Programs: {FOIL} and Related Systems131995inductive_programming induction enumerative_ip article applications foil program_synthesis ilp machine_learning foil in 1994http://www.bibsonomy.org/bibtex/26d35fd8bdec05ccce1cd5ef370063fd1/emanuelemanuel2008-05-16T18:18:32+02:00program_synthesis enumerative_ip foil article inductive_programming induction applications ilp machine_learning <span style="color:#555555;">R. <a href="http://www.bibsonomy.org/author/Mike Cameron-Jones">Mike Cameron-Jones</a> and J. <a href="http://www.bibsonomy.org/author/Ross Quinlan">Ross Quinlan</a> </span><em>SIGART Bulletin</em><em>5(1):33--42</em>(<em>1994</em>)Fri May 16 18:18:32 CEST 2008New York, NY, USASIGART Bulletin133--42Efficient Top-Down Induction of Logic Programs51994program_synthesis enumerative_ip foil article inductive_programming induction applications ilp machine_learning FOIL is a system for inducing function-free Horn clause definitions of relations from example and extensionally defined background relations. It demonstrates the successful application of a general to specific approach to clause induction using heuristically guided search. This paper describes the current version of FOIL, assesses its performance and notes areas for improvement. The successful application of similar methods in other systems is reviewed to demonstrate their general utility.original foil paperhttp://www.bibsonomy.org/bibtex/226261dd95ddc089124d3e8b44caca699/emanuelemanuel2008-05-16T18:07:44+02:00article enumerative_ip program_synthesis foil ilp inductive_programming applications machine_learning induction <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Quinlan">Quinlan</a> </span><em>Machine Learning</em><em>5(3):239--266</em>(<em>1990</em>) <em>original foil paper . </em>Fri May 16 18:07:44 CEST 2008Machine Learningoriginal foil paper3239--266Learning Logical Definitions from Relations51990article enumerative_ip program_synthesis foil ilp inductive_programming applications machine_learning induction This paper describes FOIL, a system that learns Horn clauses from data expressed as relations. FOIL is based on ideas that have proved effective in attribute-value learning systems, but extends them to a first-order formalism. This new system has been applied successfully to several tasks taken from the machine learning literature.