PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Measuring conflict and power in strategic settings
100%
Rossi G.
Badania Operacyjne i Decyzje
|
2009
|
tom nr 2
75-104
EN
This is a quantitative approach to measuring conflict and power in strategic settings: noncooperative games (with cardinal or ordinal utilities) and blockings (without any preference specification). A (0, 1)-ranged index is provided, taking its minimum on common interest games, and its maximum on a newly introduced class termed “full conflict” games.
PL
Zgoda na koordynacje strategii w grach strategicznych owocuje tym, że koalicje mogą podejmować grupowe akcje oraz mogą być traktowane jak samoistni gracze, dla których opozycją jest ich dopełnienie. Konflikt pojawia się wtedy, kiedy dla każdego rezultatu istnieje co najmniej jeden gracz, który ściśle preferuje inny wynik. W pracy zaproponowano indeks pomiaru tego konfliktu. Ogólna idea zawiera się w dwóch krokach: w pierwszym należy przekształcić strategiczną strukturę w grę koalicyjną przyjmującą wartości z przedziału jednostkowego, której wartości wyznaczają znormalizowaną wartość koordynacji wewnątrz koalicji, oraz w drugim kroku, na zagregowaniu po niepustych koalicjach wprowadzonego pomiaru konfliktu w jeden indeks także z przedziału jednostkowego. W grach strategicznych działania grupy koalicji prowadzą z założenia do maksymalizacji znormalizowanych użyteczności jej członków, podczas gdy ich dopełnienia wybierają odwet wśród najlepszych możliwych odpowiedzi. Została także dokonana charakteryzacja gry pełnego konfliktu, dla której proponowany indeks przyjmuje wartość maksymalną. Analizując możliwości odwetu (jednocześnie działań i preferencji), faktycznie mieszamy siłę i konflikt. W rzeczywistości akcje mogą być ignorowane, a cała uwaga może być skierowana wyłącznie na preferencje, w pracy modelowane jako rodzina permutacji wyników. Konflikt (a nie siła) pomiędzy koalicjami jest mierzony w kategoriach odległości pomiędzy rodzinami permutacji ich członków. Tak jest w szczególności w grach, gdzie zdolność do blokowania wyznacza, jaki wynik dana koalicja może blokować. Wybrane podejście na bazie wartości kardynalnych powoduje, że siła (a nie konflikt) osiąga swoje maksimum na blokach Maskina, gdzie osiągane jest status quo wyniku.
2
Content available Mechanical components dynamic characterization using thermoelastic stress analysis and digital image correlation
63%
Marsili R. , Rossi G.
Diagnostyka
|
2018
|
tom Vol. 19, No. 1
3--9
EN
In this work the possibility to characterize mechanical components combining thermoelastic measurement technique (TSA) and digital image correlation (DIC) is studied. The combination of these two different methodologies allows to analyze thermo-mechanical characteristics of materials such as plastic and rubber, which are difficult to study with the only thermoelastic methodology. The digital image correlation allows to determinate the first invariant of deformation ε1, using a differential thermocamera. Lack of adiabatic conditions, essential for methodology use, makes analysis not simple. Digital image correlation allows to obtain the same information by correlating digital images acquired during static or dynamic deformationof an object, but with limitations linked to acquisition system. An accurate analysis is dedicated to the study of first invariant of deformation related to Young’s module variation, performed by load cycles with variable amplitude and displacement. Comparative analysis between the two measurement methodologies has been performed on rubber samples loaded by dynamic compression.
3
Content available remote Nondeterministic Programming in Java with JSetL
63%
Rossi G. , Bergenti F.
Fundamenta Informaticae
|
2015
|
tom Vol. 140, nr 3/4
393--412
EN
JSetL is a Java library that endows Java with a number of facilities that are intended to support declarative and constraint (logic) programming. In this paper we show how JSetL can be used to support general forms of nondeterministic programming in an object-oriented framework. This is obtained by combining different but related facilities, such as logical variables, set data structures, unification, along with a constraint solver that allows the user to solve nondeterministic constraints as well as to define new constraints using the nondeterminism handling facilities provided by the solver itself. Thus, the user can define her/his own general nondeterministic procedures as new constraints, letting the constraint solver handle them. The proposed solutions are illustrated through a number of concrete Java programs using JSetL, including the implementation of simple Definite Clause Grammars.
4
Content available remote GASP: Answer Set Programming with Lazy Grounding
51%
Dal Palu A. , Dovier A. , Pontelli E. , Rossi G.
Fundamenta Informaticae
|
2009
|
tom Vol. 96, nr 3
297-322
EN
In recent years, Answer Set Programming has gained popularity as a viable paradigm for applications in knowledge representation and reasoning. This paper presents a novel methodology to compute answer sets of an answer set program. The proposed methodology maintains a bottom-up approach to the computation of answer sets (as in existing systems), but it makes use of a novel structuring of the computation, that originates from the non-ground version of the program. Grounding is lazily performed during the computation of the answer sets. The implementation has been realized using Constraint Logic Programming over finite domains.
5
Content available remote Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
51%
Bergenti F. , Dal Palu A. , Rossi G.
Fundamenta Informaticae
|
2009
|
tom Vol. 96, nr 3
227-252
EN
This paper summarizes a constraint solving technique that is used to reason effectively in the scope of a set-based constraint language that supersedes existing finite domain languages. The first part of this paper motivates the presented work and introduces the constraint language, namely the language of Hereditarily Finite Sets (HFS). Then, the proposed constraint solver is detailed in terms of a set of rewrite rules that exploit finite domain reasoning within the HFS language. The proposed solution improves previous work on CLP(SET ) [11] by integrating intervals into the constraint system and by providing a new layered architecture for the solver that supports more effective constraint solving strategies. On the other hand, the proposed approach provides enhanced expressivity and flexibility of domain representation than those usually found in existing finite domain constraint solvers.
6
Content available remote Constraint Logic Programming with Polynomial Constraints over Finite Domains
51%
Bergenti F. , Monica S. , Rossi G.
Fundamenta Informaticae
|
2018
|
tom Vol. 161, nr 1/2
9--27
EN
This paper introduces an instantiation of the constraint logic programming scheme called CLP(PolyFD) in which variables take values from finite subsets of the integers and constraints are expressed as equalities, inequalities, and disequalities of polynomials with integer coefficients. Such constraints, which we call polynomial constraints over finite domains, can be treated effectively by means of a specific solver under the assumption that initial approximations of the domains of variables are available. The proposed solver deals with constraints in a canonical form and it uses the modified Bernstein form of polynomials to detect the satisfiability of constraints. The solver is complete and a preliminary assessment of its performance is reported.
7
Content available remote A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms
51%
Dovier A. , Policriti A. , Rossi G.
Fundamenta Informaticae
|
1998
|
tom Vol. 36, nr 2,3
201-234
EN
The first-order theories of lists, multisets, compact lists (i.e., lists, where the number of contiguous occurrences of each element is immaterial) , and sets are introduced via axioms. Such axiomatizations are shown to be very well-suited for the integration with free functor symbols governed by the classical Clark's axioms in the context of (Constraint) Logic Programming. Adaptations of the extensionally principle to the various theories taken into account is then exploited in the design of unification algorithms for the considered data structures. All the theories presented can be combined providing frameworks to deal with several of the proposed data structures simultaneously. The unification algorithms proposed can be combined (merged) as well, to produce engines for such combination theories.
8
Content available Tests on the effect of ultrasonic treatment on two different activated sludge waste
51%
Simonetti M. , Rossi G. , Cabbai V. , Goi D.
Environment Protection Engineering
|
2014
|
tom Vol. 40, nr 1
23--34
EN
The effect of ultrasonic treatment on two different waste activated sludges (WASI and WAS2) was compared by batch tests. WASI was taken from an industrial WWTP that treats pulp and paper wastewater, WAS2 was obtained from a traditional municipal WWTP. Physical and chemical characterization of sludges and supernatants was performed at various specific energy inputs. Upon increasing specific energy input, sludge structure changed, particle size decreased and organic and nitrogen release increased. A different release of organic matter and nitrogen compound related to the sludge origin was observed. The study is a preliminary assay of the potential of sonication treatment to enhance biogas production in anaerobic digestion.
9
Increased levels of proapoptotic markers in normal ovarian cortex surrounding small endometriotic cysts
38%
Nisio V. D. , Rossi G. , Luigi G. D. , Palumbo P. , D'Alfonso A. , Iorio R. , Cecconi S.
Reproductive Biology
|
2019
|
tom 19
|
nr 3
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.