Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju


51 - 60 / 710
Na začetekNa prejšnjo stran234567891011Na naslednjo stranNa konec
Hybrid societies: challenges and perspectives in the design of collective behavior in self-organizing systems
Heiko Hamann, Yara Khaluf, Jean Botev, Mohammad Divband Soorati, Eliseo Ferrante, Oliver Kosak, Jean-Marc Montanier, Sanaz Mostaghim, Richard Redpath, Jon Timmis, Frank Veenstra, Mostafa Wahby, Aleš Zamuda, 2016, izvirni znanstveni članek

Opis: Hybrid societies are self-organizing, collective systems, which are composed of different components, for example, natural and artificial parts (bio-hybrid) or human beings interacting with and through technical systems (socio-technical). Many different disciplines investigate methods and systems closely related to the design of hybrid societies. A stronger collaboration between these disciplines could allow for re-use of methods and create significant synergies. We identify three main areas of challenges in the design of self-organizing hybrid societies. First, we identify the formalization challenge. There is an urgent need for a generic model that allows a description and comparison of collective hybrid societies. Second, we identify the system design challenge. Starting from the formal specification of the system, we need to develop an integrated design process. Third, we identify the challenge of interdisciplinarity. Current research on self-organizing hybrid societies stretches over many different fields and hence requires the re-use and synthesis of methods at intersections between disciplines. We then conclude by presenting our perspective for future approaches with high potential in this area.
Ključne besede: hybrid society, bio-hybrid, distributed, self-organization, design, intedisciplinary
Objavljeno: 10.07.2017; Ogledov: 80; Prenosov: 26
.pdf Celotno besedilo (603,11 KB)

Toward the discovery of citation cartels in citation networks
Iztok Fister, Iztok Fister, Matjaž Perc, 2016, izvirni znanstveni članek

Opis: In this perspective, our goal is to present and elucidate a thus far largely overlooked problem that is arising in scientific publishing, namely the identification and discovery of citation cartels in citation networks. Taking from the well-known definition of a community in the realm of network science, namely that people within a community share significantly more links with each other as they do outside of this community, we propose that citation cartels are defined as groups of authors that cite each other disproportionately more than they do other groups of authors that work on the same subject. Evidently, the identification of citation cartels is somewhat different, although similar to the identification of communities in networks. We systematically expose the problem, provide theoretical examples, and outline an algorithmic guide on how to approach the subject.
Ključne besede: citation network, citation cartel, network science, community detection, cooperation
Objavljeno: 10.07.2017; Ogledov: 89; Prenosov: 4
.pdf Celotno besedilo (855,89 KB)

Open $k$-monopolies in graphs: complexity and related concepts
Dorota Kuziak, Iztok Peterin, Ismael G. Yero, 2016, izvirni znanstveni članek

Opis: Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems, diagnosis problems or voting systems. We introduce here open ▫$k$▫-monopolies in graphs which are closely related to different parameters in graphs. Given a graph ▫$G=(V,E)$▫ and ▫$X \subseteq V$▫, if ▫$\delta_X(v)$▫ is the number of neighbors ▫$v$▫ has in ▫$X$▫, ▫$k$▫ is an integer and ▫$t$▫ is a positive integer, then we establish in this article a connection between the following three concepts: (1) Given a nonempty set ▫$M\subseteq V$▫ a vertex ▫$v$▫ of ▫$G$▫ is said to be ▫$k$▫-controlled by ▫$M$▫ if ▫$\delta_M(v)\ge \frac{\delta_V(v)}{2}+k$▫. The set ▫$M$▫ is called an open ▫$k$▫-monopoly for ▫$G$▫ if it ▫$k$▫-controls every vertex ▫$v$▫ of ▫$G$▫. (2) A function ▫$f: V\rightarrow \{-1,1\}$▫ is called a signed total ▫$t$▫-dominating function for ▫$G$▫ if ▫$f(N(v))=\sum_{v\in N(v)}f(v)\geq t$▫ for all ▫$v\in V$▫. (3) A nonempty set ▫$S\subseteq V$▫ is a global (defensive and offensive) ▫$k$▫-alliance in ▫$G$▫ if ▫$\delta_S(v)\ge \delta_{V-S}(v)+k$▫ holds for every ▫$v\in V$▫. In this article we prove that the problem of computing the minimum cardinality of an open ▫$0$▫-monopoly in a graph is NP-complete even restricted to bipartite or chordal graphs. In addition we present some general bounds for the minimum cardinality of open ▫$k$▫-monopolies and we derive some exact values.
Ključne besede: open k-monopolies, k-signed total domination, global defensive k-alliance, global offensive k-alliance
Objavljeno: 10.07.2017; Ogledov: 55; Prenosov: 4
.pdf Celotno besedilo (181,59 KB)

Efficient open domination in graph products
Dorota Kuziak, Iztok Peterin, Ismael G. Yero, 2014, izvirni znanstveni članek

Opis: A graph ▫$G$▫ is an efficient open domination graph if there exists a subset ▫$D$▫ of ▫$V(G)$▫ for which the open neighborhoods centered in vertices of ▫$D$▫ form a partition of ▫$V(G)$▫. We completely describe efficient open domination graphs among lexicographic, strong, and disjunctive products of graphs. For the Cartesian product we give a characterization when one factor is ▫$K_2$▫.
Ključne besede: graph theory, efficient open domination, graph products, total domination
Objavljeno: 10.07.2017; Ogledov: 52; Prenosov: 4
.pdf Celotno besedilo (804,78 KB)

XML Schema metrics for quality evaluation
Maja Pušnik, Marjan Heričko, Zoran Budimac, Boštjan Šumak, 2014, izvirni znanstveni članek

Opis: In XML Schema development, the quality of XML Schemas is a crucial issue for further steps in the life cycle of an application, closely correlated with the structure of XML Schemas and different building blocks. Current research focuses on measuring complexity of XML Schemas and mainly do not consider other quality aspects. This paper proposes a novel quality measuring approach, based on existing software engineering metrics, additionally defining the quality aspects of XML Schemas using the following steps: (1) definition of six schema quality aspects, (2) adoption of 25 directly measurable XML Schema variables, (3) proposition of six composite metrics, applying 25 measured variables and (4) composite metrics validation. An experiment was conducted using 250 standard XML Schemas collected from available e-business information systems. The results illustrate the influence of XML Schemaʼs characteristics on its quality and evaluate the applicability of metrics in the measurement process, a useful tool for software developers while building or adopting XML Schemas.
Ključne besede: XML, metrics, quality variables, quality index, evaluation, validation
Objavljeno: 06.07.2017; Ogledov: 92; Prenosov: 4
.pdf Celotno besedilo (765,37 KB)

Towards building a forensics aware language for secure logging
Shams Zawoad, Marjan Mernik, Ragib Hasan, 2014, izvirni znanstveni članek

Opis: Trustworthy system logs and application logs are crucial for digital forensics. Researchers have proposed different security mechanisms to ensure the integrity and confidentiality of logs. However, applying current secure logging schemes on heterogeneous formats of logs is tedious. Here, we propose Forensics Aware Language (FAL), a domain-specific language (DSL) through which we can apply a secure logging mechanism on any format of logs. Using FAL, we can define log structure, which represents the format of logs and ensures the security properties of a chosen secure logging scheme. This log structure can later be used by FAL to serve two purposes: it can be used to store system logs securely and it will help application developers for secure application logging by generating the required source code.
Ključne besede: domain-specific language, DSL, secure logging, audit trail, digital forensics
Objavljeno: 06.07.2017; Ogledov: 74; Prenosov: 5
.pdf Celotno besedilo (526,42 KB)

SimpleConcepts: a lightweight extension to C++ to support constraints on generic types
Reed Milewicz, Marjan Mernik, Peter Pirkelbauer, 2014, izvirni znanstveni članek

Opis: Generic programming plays an essential role in C++ software through the use of templates. However, both the creation and use of template libraries is hindered by the fact that the language does not allow programmers to specify constraints on generic types. To date, no proposal to update the language to provide concepts has survived the committee process. Until that time comes, as a form of early support, this paper introduces SimpleConcepts, an extension to C++11 that provides support for concepts, sets of constraints on generic types. SimpleConcepts features are parsed according to an island grammar and source-to-source translation is used to lower concepts to pure C++11 code.
Ključne besede: generic programming, C++ templates, C++ concepts
Objavljeno: 06.07.2017; Ogledov: 90; Prenosov: 3
.pdf Celotno besedilo (299,20 KB)

Program comprehension for domain-specific languages
Maria João Varando Pereira, Marjan Mernik, Daniela Da Cruz, Pedro Rangel Henriques, 2008, izvirni znanstveni članek

Opis: In the past, we have been looking for program comprehension tools that are able to interconnect operational and behavioral views, aiming at aiding the software analyst to relate problem and program domains in order to reach a full understanding of software systems. In this paper we are concerned with Program Comprehension issues applied to Domain Specific Languages (DSLs). We are now willing to understand how techniques and tools for the comprehension of traditional programming languages fit in the understanding of DSLs. Being the language tailored for the description of problems in a specific domain, we believe that specific visualizations (at a higher abstraction level, closer to the problem level) could and should be defined to enhance the comprehension of the descriptions in that particular domain.
Ključne besede: program comprehension, DSL, domain-specific languages, program understanding
Objavljeno: 06.07.2017; Ogledov: 119; Prenosov: 5
.pdf Celotno besedilo (248,98 KB)

Ontology driven development of domain-specific languages
Ines Čeh, Matej Črepinšek, Tomaž Kosar, Marjan Mernik, 2011, izvirni znanstveni članek

Opis: Domain-specific languages (DSLs) are computer (programming, modeling, specification) languages devoted to solving problems in a specific domain. Thedevelopment of a DSL includes the following phases: decision, analysis, design, implementation, testing, deployment, and maintenance. The least-known and least examined are analysis and design. Although various formal methodologies exist, domain analysis is still done informally most of the time. A common reason why formal methodologies are not used as often as they could be is that they are very demanding. Instead of developing a new, less complex methodology, we propose that domain analysis could be replaced with a previously existing analysis in another form. A particularly suitable form is the use of ontologies. This paper focuses on ontology-based domain analysis and how it can be incorporated into the DSL design phase. We will present the preliminary results of the Ontology2DSL framework, which can be used to help transform ontology to a DSL grammar incorporating concepts from a domain.
Ključne besede: domain specific language, domain analysis, ontology
Objavljeno: 06.07.2017; Ogledov: 106; Prenosov: 4
.pdf Celotno besedilo (607,21 KB)

On automata and language based grammar metrics
Matej Črepinšek, Tomaž Kosar, Marjan Mernik, Julien Cervelle, Rémi Forax, Gilles Roussel, 2010, izvirni znanstveni članek

Opis: Grammar metrics have been introduced to measure the quality and the complexity of the formal grammars. The aim of this paper is to explore the meaning of these notions and to experiment, on several grammars of domain specific languages and of general-purpose languages, existing grammar metrics together with the new metrics that are based on grammar LR automaton and on the language recognized. We discuss the results of this experiment and focus on the comparison between grammars of domain specific languages as well as of general-purpose languages and on the evolution of the metrics between several versions of the same language.
Ključne besede: grammar metrics, software language engineering, grammar engineering, grammarware
Objavljeno: 06.07.2017; Ogledov: 87; Prenosov: 4
.pdf Celotno besedilo (282,41 KB)

Iskanje izvedeno v 0.22 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici