Topic
Applied science
About: Applied science is a research topic. Over the lifetime, 1178 publications have been published within this topic receiving 19920 citations. The topic is also known as: applied sciences.
Papers published on a yearly basis
Papers
More filters
01 Jan 2015
TL;DR: In this article, the main concepts of design science research are presented and the foundations for the application of DSS research as a research method and the methods formalized by several authors for its operationalization are presented.
Abstract: This chapter presents the main concepts of design science research, which is a method that is conducted under the paradigm of design science to operationalize research. In addition to these concepts, the foundations for the application of design science research as a research method and the methods formalized by several authors for its operationalization are presented. A comparison of design science research with two alternate methods is performed. To prevent an exhaustive comparison in this book, we compare design science research with methods that are commonly used for qualitative research in Brazil: case study and action research.
75 citations
01 Jan 2016
TL;DR: It is shown that for every > 0 the authors have fk(Km,n) ≤ (1 + )dk mn k , provided that both m and n are sufficiently large – where dk depends only on k, which coincides with the lower bound fk (G) ≥ dk e(G) k, valid for all bipartite graphs.
Abstract: Let G be a graph. A k-radius sequence for G is a sequence of vertices of G such that for every edge uv of G vertices u and v appear at least once within distance k in the sequence. The length of a shortest k-radius sequence for G is denoted by fk(G). Such sequences appear in a problem related to computing values of some 2-argument functions. Suppose we have a set V of large objects, stored in an external database, and our cache can accommodate at most k + 1 objects from V at one time. If we are given a set E of pairs of objects for which we want to compute the value of some 2-argument function, and assume that our cache is managed in FIFO manner, then fk(G) (where G = (V, E)) is the minimum number of times we need to copy an object from the database to the cache. We give an asymptotically tight estimation on fk(G) for complete bipartite graphs. We show that for every > 0 we have fk(Km,n) ≤ (1 + )dk mn k , provided that both m and n are sufficiently large – where dk depends only on k. This upper bound asymptotically coincides with the lower bound fk(G) ≥ dk e(G) k , valid for all bipartite graphs. We also show that determining fk(G) for an arbitrary graph G is NP-hard for every constant k > 1.
67 citations