Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II

We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials'$ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly, we supply a review of selected related combinatorial interpretations of generalized binomial coefficients. We then propose also a kind of transfer of interpretation of $p,q-binomial$ coefficients onto $q-binomial$ coefficients interpretations thus bringing us back to $Gy{\"{o}}rgy P\'olya$ and Donald Ervin Knuth relevant investigation decades ago.Comment: 57 pages, 8 figure

Competition between open-source and proprietary software: the (La)TeX case study

The paper examines competition between two development models, proprietary and open-source (``OS''). It first defines and compares those two models and then analyzes the influence the development of one type of software has on the development of the other. The paper is based on the (La)TeX case study. In that case study, the features, users, and patterns in the development of the (La)TeX software were compared to its proprietary equivalents. The models that are presented in this paper describe some aspects of the strategic interactions between proprietary and open-source software. The paper shows that they cannot be analyzed independently; the decisions of one class of agents (OSS developers) are affected by those of the other class of agents (private entrepreneurs).Open source, software, proprietary software, BSD, GPL, public domain, intellectual production, licensing, patents, TeX, LaTeX

Intrinsic Motivation versus Signaling in Open Source Software Development

This papers sheds light on the puzzling fact that even though open source software (OSS) is a public good, it is developed for free by highly qualified, young, motivated individuals, and evolves at a rapid pace. We show that when OSS development is understood as the private provision of a public good, these features emerge quite naturally. We adapt a dynamic private-provision-of-public-goods model to reflect key aspects of the OSS phenomenon. Apart from extrinsic motives (namely signaling), the present model also contains intrinsic motives of OSS programmers, such as play value or homo ludens payoff, userprogrammers’ and gift culture benefits. Such intrinsic motives feature extensively in the wider OSS literature and contribute new insights to the economic analysisopen source software; public goods; homo ludens; war of attrition

Gopher Peavey

1 electronic resource (PDF file; includes articles, portraits, photographs

Methodology of Algorithm Engineering

Research on algorithms has drastically increased in recent years. Various sub-disciplines of computer science investigate algorithms according to different objectives and standards. This plurality of the field has led to various methodological advances that have not yet been transferred to neighboring sub-disciplines. The central roadblock for a better knowledge exchange is the lack of a common methodological framework integrating the perspectives of these sub-disciplines. It is the objective of this paper to develop a research framework for algorithm engineering. Our framework builds on three areas discussed in the philosophy of science: ontology, epistemology and methodology. In essence, ontology describes algorithm engineering as being concerned with algorithmic problems, algorithmic tasks, algorithm designs and algorithm implementations. Epistemology describes the body of knowledge of algorithm engineering as a collection of prescriptive and descriptive knowledge, residing in World 3 of Popper's Three Worlds model. Methodology refers to the steps how we can systematically enhance our knowledge of specific algorithms. The framework helps us to identify and discuss various validity concerns relevant to any algorithm engineering contribution. In this way, our framework has important implications for researching algorithms in various areas of computer science