Institution
University of Maribor
Education•Maribor, Slovenia•
About: University of Maribor is a education organization based out in Maribor, Slovenia. It is known for research contribution in the topics: Population & KEKB. The organization has 3987 authors who have published 13077 publications receiving 258339 citations. The organization is also known as: Univerza v Mariboru.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The mapping from the high-level domain concepts to implementation is possible because of the domain specificity: the language and code generators fit the requirements of a narrowly defined domain.
Abstract: Domain-specific techniques, languages, tools, and models, such as Fortran and Cobol can easily be viewed as domain-specific languages for scientific and business computing, respectively. Their domain is just very wide. What has changed is the technology for creating domain-specific languages (DSLs). Now it is easier to define languages and get tool support for narrower domains. Such focus offers increased abstraction, making development faster and easier. In domain-specific approaches, developers construct solutions from concepts representing things in the problem domain, not concepts of a given general-purpose programming language. Ideally, a DSL follows the domain abstractions and semantics as closely as possible, letting developers perceive themselves as working directly with domain concepts. The created specifications might then represent simultaneously the design, implementation, and documentation of the system, which can be generated directly from them. The mapping from the high-level domain concepts to implementation is possible because of the domain specificity: the language and code generators fit the requirements of a narrowly defined domain.
94 citations
••
TL;DR: In this article, the authors present a new model for heat integration that overcomes difficulties experienced either with direct integration approaches, or with the Duran and Grossmann (1986) model when handling isothermal streams.
94 citations
••
TL;DR: In this paper, a nanopaper ion-exchanger was proposed for the removal of copper from aqueous solutions in a paper industry waste stream using cellulose nanofibrils.
Abstract: Copper is a major problem in industrial wastewater streams, seriously affecting the quality of potential drinking water. Several approaches, including continuous membrane processes or batch-wise application of adsorbents, are in use to tackle this problem. Unfortunately, these processes suffer from their particular drawbacks, such as low permeance or disposal of saturated adsorbents. However, a combination of these processes could constitute a step towards a more efficient copper removal solution. Here, we present a nanopaper ion-exchanger prepared from cellulose nanofibrils produced from fibre sludge, a paper industry waste stream, for the efficient, continuous removal of copper from aqueous solutions. This nanopaper ion-exchanger comprises phosphorylated cellulose nanofibrils that were processed into nanopapers by papermaking. The performance of these phosphorylated nanopaper membranes was determined with respect to their rejection of copper and permeance. It was shown that this new type of nanopaper is capable of rejecting copper ions during a filtration process by adsorption. Results suggest that functional groups on the surface of the nanopapers contribute to the adsorption of copper ions to a greater extent than phosphate groups within the bulk of the nanopaper. Moreover, we demonstrated that those nanopaper ion-exchangers could be regenerated and reused and that in the presence of calcium ions, the adsorption capacity for copper was only slightly reduced.
94 citations
••
TL;DR: The Schultz molecular topological index (MTI) is compared with the Wiener index (W) of a molecular graph and it is shown that 2vminW < MTI ≤ 4vmaxW holds for any (connected) graph Γ.
Abstract: The Schultz molecular topological index (MTI) is compared with the Wiener index (W) of a molecular graph. It is shown that 2vminW < MTI ≤ 4vmaxW holds for any (connected) graph Γ, with vmin and vma...
94 citations
••
TL;DR: It is shown that the lower the threshold for using the small temptation to defect, the more the evolution of cooperation is promoted and coevolutionary multigames could be the new frontier for the swift resolution of social dilemmas.
Abstract: Wealthy individuals may be less tempted to defect than those with comparatively low payoffs. To take this into consideration, we introduce coevolutionary success-driven multigames in structured populations. While the core game is always the weak prisoner's dilemma, players whose payoffs from the previous round exceed a threshold adopt only a minimally low temptation to defect in the next round. Along with the strategies, the perceived strength of the social dilemma thus coevolves with the success of each individual player. We show that the lower the threshold for using the small temptation to defect, the more the evolution of cooperation is promoted. Importantly, the promotion of cooperation is not simply due to a lower average temptation to defect, but rather due to a dynamically reversed direction of invasion along the interfaces that separate cooperators and defectors on regular networks. Conversely, on irregular networks, in the absence of clear invasion fronts, the promotion of cooperation is due to intermediate-degree players. At sufficiently low threshold values, these players accelerate the erosion of defectors and significantly shorten the fixation time towards more cooperative stationary states. Coevolutionary multigames could thus be the new frontier for the swift resolution of social dilemmas.
93 citations
Authors
Showing all 4077 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ignacio E. Grossmann | 112 | 776 | 46185 |
Mirjam Cvetič | 89 | 456 | 27867 |
T. Sumiyoshi | 88 | 855 | 62277 |
M. Bračko | 87 | 738 | 30195 |
Xin-She Yang | 85 | 444 | 61136 |
Matjaž Perc | 84 | 400 | 22115 |
Baowen Li | 83 | 477 | 23080 |
S. Nishida | 82 | 678 | 27709 |
P. Križan | 78 | 749 | 26408 |
S. Korpar | 78 | 615 | 23802 |
Attila Szolnoki | 76 | 231 | 20423 |
H. Kawai | 76 | 477 | 22713 |
John Shawe-Taylor | 72 | 503 | 52369 |
Matjaz Perc | 57 | 148 | 12886 |
Mitja Lainscak | 55 | 287 | 22004 |