2024-03-29T12:58:19Z
http://eprints.biblio.unitn.it/cgi/oai2
oai:eprints.biblio.unitn.it:23
2012-02-28T14:14:49Z
7374617475733D696E7072657373
7375626A656374733D48:4847
74797065733D746563687265706F7274
The monetary transmission mechanism in Italy: the credit channel and a missing ring
Tamborini, Roberto
Fiorentini, Riccardo
HG Finance
Research on how money affects economic activity has revived interest in the so-called "credit view". In this paper we focus on current developments in the credit view in order to assess the results of the past decade's research and its legacy for macroeconomics and monetary policy. We expound the main models of the "credit channels" of monetary transmission, drawing a distinction between models of aggregate demand, which are predominant, and models of aggregate supply, which are less developed despite theory suggests a potential connection between credit conditions and firms' production activity. Each approach is accompanied by a survey of the main empirical results with particular reference to Italy, where bank-firm relations are traditionally regarded as particularly important.
2001
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/23/1/1_01_Tamborini.pdf
Tamborini, Roberto and Fiorentini, Riccardo (2001) The monetary transmission mechanism in Italy: the credit channel and a missing ring. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/23/
oai:eprints.biblio.unitn.it:28
2012-02-28T14:14:51Z
7374617475733D696E7072657373
7375626A656374733D51:5141:5141323639
7375626A656374733D48:4842
74797065733D746563687265706F7274
Routines, Hierarchies of Problems, Procedural Behaviour: Some Evidence From Experiments
Egidi, Massimo
QA269 Game theory
HB Economic Theory
A laboratory experiment was performed as replication of the original one created by M. Cohen and P. Bacdayan at Michigan University. It consists in a twopersons card game played by a large number of pairs, whose actions are stored in a computer’s memory. In order to achieve the final goal each player must discover his sub-goals, and must coordinate his action with the partner’s one. The game therefore involves the division of knowledge and cooperation among players, and gives rise to the emergence of organizational routines. It is suggested that the organizational routines, i.e. the sequences of patterned actions which lead to the realization of the final goal, cannot be fully memorized because of their variety and number. It is shown that players do not possess all the knowledge needed by an hypothetical supervisor to play the best strategy: they generally explore only a limited part of the space of the potential rules, and therefore learn and memorize a simple, bounded set of "personal" meta-rules. These meta-rules, also called "production rules" in standard Cognitive Science’s language, are of the form <If "Condition" then "Action">. Each "Condition" can concern either the game configurations or the partner’s action. In the former case the identification of an appropriate "Action" depends on the sub-goals exploration. In the latter it depends on the recognition (or discovery) of interaction rules ; in this eventuality the production rule embodies a dynamic - and possibly cooperative - reaction to the partner’s action. Organizational procedures (routines) therefore emerge as the outcome of a distributed process generated by "personal" production rules . These routines, as in von Hayek’s view, "can be understood as if it were made according to a single plan, although nobody has planned it." (Hayek, 1980, p. 54). Empirical evidence is provided to support the above statements.
1995
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/28/1/CEEL95_03.pdf
Egidi, Massimo (1995) Routines, Hierarchies of Problems, Procedural Behaviour: Some Evidence From Experiments. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/28/
oai:eprints.biblio.unitn.it:62
2012-02-28T14:15:01Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413337342E37
74797065733D746563687265706F7274
Well-posedness of an infinite system of partial differential equations modelling parasitic infection in an age-structured host
Pugliese, Andrea
Tonetto, Lorenza
QA374.7 Partial differential equations
We study a deterministic model for the dynamics of a population infected by macroparasites. The model consists of an infnite system of partial differential equations, with initial and boundary conditions; the system is transformed in an abstract Cauchy problem on a suitable Banach space, and existence and uniqueness of the solution are obtained through multiplicative perturbation of a linear C0°-semigroup. Positivity and boundedness are proved using the specific form of the equations.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/62/1/Lorenza1.pdf
Pugliese, Andrea and Tonetto, Lorenza (2002) Well-posedness of an infinite system of partial differential equations modelling parasitic infection in an age-structured host. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/62/
oai:eprints.biblio.unitn.it:97
2012-02-28T14:15:10Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
7375626A656374733D54:5441:5441313734
74797065733D746563687265706F7274
Adaptive Anisotropic Filtering (AAF) for Real-Time Visual Enhancement of Mpeg-Coded Video Sequences
Atzori, L.
De Natale, Francesco G. B.
Granelli, F.
QA075 Electronic computers. Computer science
TA174 Engineering Design
Current standards for video compression achieve good performances in terms of data compaction and signal to noise ratio of the decoded signal. Nevertheless, there are some known problems concerning the visual quality of reconstructed images, which can be partially solved using appropriate post-processing algorithms. The paper proposes a new adaptive anisotropic filter (AAF) that aims at unifying the treatment of different sources of perceptive distortion in MPEG sequences. The process is driven by a local classification of blocks and single pixels of decoded frames, taking into account several parameters (distribution of DCT coefficient energy, presence of sharp variations, spatial position of DCT block boundaries). Experimental results show that the proposed algorithm outperforms existing enhancement approaches, in particular when constraints on complexity and real-time processing are compelling.
2002-01
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/97/1/01.PDF
Atzori, L. and De Natale, Francesco G. B. and Granelli, F. (2002) Adaptive Anisotropic Filtering (AAF) for Real-Time Visual Enhancement of Mpeg-Coded Video Sequences. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/97/
oai:eprints.biblio.unitn.it:98
2012-02-28T14:15:11Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
7375626A656374733D54:5441:5441313734
74797065733D746563687265706F7274
Adaptive Model Selection for Digital Linear Classifiers
Boni, Andrea
QA075 Electronic computers. Computer science
TA174 Engineering Design
Adaptive model selection can be defined as the process thanks to which an optimal classifiers h* is automatically selected from a function class H by using only a given set of examples z. Such a process is particularly critic when the number of examples in z is low, because it is impossible the classical splitting of z in training + test + validation. In this work we show that the joined investigation of two bounds of the prediction error of the classifier can be useful to select h* by using z for both model selection and training. Our learning algorithm is a simple kernel-based Perceptron that can be easily implemented in a counter-based digital hardware. Experiments on two real world data sets show the validity of the proposed method.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/98/1/34.pdf
Boni, Andrea (2002) Adaptive Model Selection for Digital Linear Classifiers. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/98/
oai:eprints.biblio.unitn.it:100
2012-02-28T14:15:11Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
7375626A656374733D54:5441:5441313734
74797065733D746563687265706F7274
The Digital Kernel Perceptron
Anguita, Davide
Boni, Andrea
Ridella, Sandro
QA075 Electronic computers. Computer science
TA174 Engineering Design
In this paper, we show that a kernel-based perceptron can be efficiently implemented in digital hardware using very few components. Despite its simplicity, the experimental results on standard data sets show remarkable performance in terms of generalization error.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/100/1/32.pdf
Anguita, Davide and Boni, Andrea and Ridella, Sandro (2002) The Digital Kernel Perceptron. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/100/
oai:eprints.biblio.unitn.it:121
2012-02-28T14:15:17Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
Audemard, Gilles
Bertoli, Piergiorgio
Cimatti, Alessandro
Kornilowicz, Artur
Sebastiani, Roberto
QA075 Electronic computers. Computer science
The availability of decision procedures for combinations of boolean and linear mathematical propositions opens the ability to solve problems arising from real-world domains such as verification of timed systems and planning with resources. In this paper we present a general and efficient approach to the problem, based on two main ingredients. The first is a DPLL-based SAT procedure, for dealing efficiently with the propositional component of the problem. The second is a tight integration, within the DPLL architecture, of a set of mathematical deciders for theories of increasing expressive power. A preliminary experimental evaluation shows the potential of the approach.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/121/1/41.pdf
Audemard, Gilles and Bertoli, Piergiorgio and Cimatti, Alessandro and Kornilowicz, Artur and Sebastiani, Roberto (2002) A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/121/
oai:eprints.biblio.unitn.it:123
2012-02-28T14:15:18Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Reasoning with Goal Models
Giorgini, Paolo
Nicchiarelli, Eleonora
Mylopoulous, John
Sebastiani, Roberto
QA075 Electronic computers. Computer science
Over the past decade, goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. Such models extend traditional AI planning techniques for representing goals by allowing for partially defined and possibly inconsistent goals. This paper presents a formal framework for reasoning with such goal models. In particular, the paper proposes a qualitative and a numerical axiomatization for goal modeling primitives and introduces label propagation algorithms that are shown to be sound and complete with respect to their respective axiomatizations. In addition, the paper reports on preliminary experimental results on the label propagation algorithms applied to a goal model for a North America car manufacturer.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/123/1/43.pdf
Giorgini, Paolo and Nicchiarelli, Eleonora and Mylopoulous, John and Sebastiani, Roberto (2002) Reasoning with Goal Models. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/123/
oai:eprints.biblio.unitn.it:124
2012-02-28T14:15:18Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Bounded Model Checking for Timed Systems
Audemard, Gilles
Cimatti, Alessandro
Kornilowicz, Artur
Sebastiani, Roberto
QA075 Electronic computers. Computer science
Enormous progress has been achieved in the last decade in the verification of timed systems, making it possible to verify significant real-world protocols. An open challenge is the identification of fully symbolic verification techniques, able to deal effectively with the finite state component as well as with the timing aspects. In this paper we propose a new, symbolic verification technique that extends the Bounded Model Checking (BMC) approach for the verification of timed systems. The approach is based on the following ingredients. First, a BMC problem for timed systems is reduced to the satisfiability of a math-formula, i.e., a boolean combination of propositional variables and linear mathematical relations over real variables (used to represent clocks). Then, an appropriate solver, called MathSAT, is used to check the satisfiability of the math-formula. The solver is based on the integration of SAT techniques with some specialized decision procedures for linear mathematical constraints, and requires polynomial memory. Our methods allow for handling expressive properties in a fully-symbolic way. A preliminary experimental evaluation confirms the potential of the approach.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/124/1/44.pdf
Audemard, Gilles and Cimatti, Alessandro and Kornilowicz, Artur and Sebastiani, Roberto (2002) Bounded Model Checking for Timed Systems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/124/
oai:eprints.biblio.unitn.it:125
2012-02-28T14:15:19Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Integrating BDD-based and SAT-based Symbolic Model Checking
Cimatti, Alessandro
Giunchiglia, Enrico
Pistore, Marco
Roveri, Marco
Sebastiani, Roberto
Tacchella, Armando
QA075 Electronic computers. Computer science
Symbolic model checking is a very successful formal verification technique, classically based on Binary Decision Diagrams (BDDs). Recently, propositional satisfiability (SAT) techniques have been proposed as a computational basis for symbolic model checking, and proved to be an effective alternative to BDD-based techniques. In this paper we show how BDD-based and SAT-based techniques have been effectively integrated within the NuSMV symbolic model checker.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/125/1/45.pdf
Cimatti, Alessandro and Giunchiglia, Enrico and Pistore, Marco and Roveri, Marco and Sebastiani, Roberto and Tacchella, Armando (2002) Integrating BDD-based and SAT-based Symbolic Model Checking. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/125/
oai:eprints.biblio.unitn.it:126
2012-02-28T14:15:19Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Improving the Encoding of LTL Model Checking into SAT
Cimatti, Alessandro
Pistore, Marco
Roveri, Marco
Sebastiani, Roberto
QA075 Electronic computers. Computer science
Bounded Model Checking (BMC) is a technique for encoding an LTL model checking problem into a problem of propositional satisfiability. Since the seminal paper by [Biere et al.'99], the research on BMC has been primarily directed at achieving higher efficiency for solving reachability properties. In this paper, we tackle the problem of improving BMC encodings for the full class of LTL properties. We start noticing some properties of the encoding of [Biere et al.'99], and we exploit them to define improvements that make the resulting boolean formulas smaller or simpler to solve.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/126/1/46.pdf
Cimatti, Alessandro and Pistore, Marco and Roveri, Marco and Sebastiani, Roberto (2002) Improving the Encoding of LTL Model Checking into SAT. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/126/
oai:eprints.biblio.unitn.it:152
2012-02-28T14:15:24Z
7374617475733D696E7072657373
7375626A656374733D54:5431
74797065733D746563687265706F7274
Analysis of Multitemporal Remote-Sensing Images for Change Detection: Bayesian Thresholding Approaches
Bruzzone, Lorenzo
Cossu, Roberto
T Technology (General)
The recent technological developments in remote-sensing sensors and satellites (e.g., the increased spatial and spectral resolutions of sensors, the increased rivisitation time of satellites) offer the possibility of addressing new applications related to environmental monitoring and natural-resource management. In particular, applications connected with the analysis of multitemporal remote-sensing images are becoming more and more important, also in relation to the increased awareness of politicians of the necessity for a regular and efficient control of the environment. This chapter deals with a key issue in multitemporal data analysis, namely, the automatic detection of changes in pairs of images acquired in the same geographical area at different times. In particular, unsupervised change-detection methods (i.e., methods that do not require any ground-truth information for detecting land-cover changes) are considered. Attention is focused on one of the crucial problems that should be solved to develop fully automatic and unsupervised change-detection approaches, i.e., the selection of the decision threshold to be used to distinguish between changed and unchanged areas. Several methods proposed in the literature are described and compared with approaches recently developed by the authors. In addition, some theoretically well-founded thresholding strategies, generally not used for remote-sensing problems, are considered and evaluated also in relation to applications. Examples of results obtained by applying the presented techniques to real multitemporal remote-sensing data sets are reported and discussed.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/152/1/31.pdf
Bruzzone, Lorenzo and Cossu, Roberto (2002) Analysis of Multitemporal Remote-Sensing Images for Change Detection: Bayesian Thresholding Approaches. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/152/
oai:eprints.biblio.unitn.it:211
2012-02-28T14:15:37Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
The Tropos Software Development Methodology: Processes, Models and Diagrams
Giunchiglia, Fausto
Mylopoulos, John
Perini, Anna
QA075 Electronic computers. Computer science
QA076 Computer software
Tropos is a novel agent-oriented software development methodology founded on two key features: (i) the notions of agent, goal, plan and various other knowledge level concepts are fundamental primitives used uniformly throughout the software development process; and (ii) a crucial role is assigned to requirements analysis and specification when the system-to-be is analyzed with respect to its intended environment. This paper provides a (first) detailed account of the Tropos methodology. In particular, we describe the basic concepts on which Tropos is founded and the types of models one builds out of them. We also specify the analysis process through which design flows from external to system actors through a goal analysis and delegation. In addition, we provide an abstract syntax for Tropos diagrams and other linguistic constructs.
2001-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/211/1/08.pdf
Giunchiglia, Fausto and Mylopoulos, John and Perini, Anna (2001) The Tropos Software Development Methodology: Processes, Models and Diagrams. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/211/
oai:eprints.biblio.unitn.it:212
2012-02-28T14:27:07Z
oai:eprints.biblio.unitn.it:227
2012-02-28T14:15:40Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Transparent Location Fingerprinting for Wireless Services
Brunato, Mauro
Kiss Kalló, Csaba
QA075 Electronic computers. Computer science
Detecting the user location is crucial in a wireless environment, not only for the choice of first-hop communication partners, but also for many auxiliary purposes: Quality of Service (availability of information in the right place for reduced congestion/delay, establishment of the optimal path), energy consumption, automated insertion of location-dependent info into a web query issued by a user (for example a tourist asking informations about a monument or a restaurant, a fireman approaching a disaster area). The technique we propose in our investigation tries to meet two main goals: transparency to the network and independence from the environment. A user entering an environment (for instance a wireless-networked building) shall be able to use his own portable equipment to build a personal map of the environment without the system even noticing it. Preliminary tests allow us to detect position on a map with an average uncertainty of two meters when using information gathered from three IEEE802.11 access points in an indoor environment composed of many rooms on a 625sqm area. Performance is expected to improve when more access points will be exploited in the test area. Implementation of the same techniques on Bluetooth are also being studied.
2002-09
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/227/1/71.pdf
Brunato, Mauro and Kiss Kalló, Csaba (2002) Transparent Location Fingerprinting for Wireless Services. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/227/
oai:eprints.biblio.unitn.it:244
2012-02-28T14:15:44Z
7374617475733D696E7072657373
7375626A656374733D4A:4A41
7375626A656374733D48:484D
74797065733D61727469636C656A6F75726E616C
Organizations, coalitions, and movements
Diani, M
Bison, I
JA Political science (General)
HM Sociology
This article uses empirical evidence on networks of voluntary organizations mobilizing on ethnic minority, environmental, and social exclusion issues in two British cities, to differentiate between social movement processes and other, cognate collective action dynamics. Social movement processes are identified as the building and reproducing of dense informal networks between a multiplicity of actors, sharing a collective identity, and engaged in social and/or political conflict. They are contrasted to coalitional processes, where alliances to achieve specific goals are not backed by significant identity links, and organizational processes, where collective action takes place mostly in reference to specific organizations rather than broader, looser networks.
2004
Article in journal
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/244/1/Diani_%26_Bison_2004_Full_text.doc
Diani, M and Bison, I (2004) Organizations, coalitions, and movements. In «Theory and Society», vol. 33, UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/244/
oai:eprints.biblio.unitn.it:277
2012-02-28T14:15:46Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Language-Based Performance Prediction for Distributed and Mobile Systems
Priami, Corrado
QA075 Electronic computers. Computer science
We present a framework for performance prediction of distributed and mobile systems. We rely on process calculi and their structural operational semantics. The dynamic behaviour is described through transition systems whose transitions are labelled by encodings of their proofs that we then map into stochastic processes. We enhance related works by allowing general continuous distributions resorting to a notion of enabling between transitions. We also discuss how the number of resources available affects the overall model. Finally, we introduce a notion of bisimulation that takes stochastic information into account and proves it to be a congruence. When only exponential distributions are of interest our equivalence induces a lumpable partition on the underlying Markov process.
2002
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/277/1/17.pdf
Priami, Corrado (2002) Language-Based Performance Prediction for Distributed and Mobile Systems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/277/
oai:eprints.biblio.unitn.it:282
2012-02-28T14:15:48Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multi-dimensional Files
Das, Sajal K.
Pinotti, Maria Cristina
QA075 Electronic computers. Computer science
A multi-dimensional file is one whose data are characterized by several attributes, each specified in a given domain. A partial match query on a multi-dimensional file extracts all data whose attributes match the values of one or more attributes specified in the query. The disk allocation problem of a multi-dimensional file, F, on a database system with multiple disks accessible in parallel is the problem of distributing F among the disks such that the data qualifying for each partial match query are distributed as evenly as possible among the disks of the system. We propose an optimal solution to this problem, for multi-dimensional files with pairwise prime domains, based on a large and flexible class of maximum distance separable codes, namely the redundant residue codes. We also introduce a new family of residue codes, called the redundant non-pairwise prime residue codes, to deal with files whose attribute domains are non-pairwise prime.
2002-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/282/1/77.pdf
Das, Sajal K. and Pinotti, Maria Cristina (2002) Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multi-dimensional Files. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/282/
oai:eprints.biblio.unitn.it:284
2012-02-28T14:15:48Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
Bertossi, Alan
Pinotti, Cristina M.
Tan, Richard
QA075 Electronic computers. Computer science
Given an integer $\sigma > 1$, a vector $(\delta_1, \delta_2, \ldots, \delta_{\sigma-1})$ of nonnegative integers, and an undirected graph $G=(V,E)$, an $L(\delta_1, \delta_2, \ldots,\delta_{\sigma-1})$-coloring of $G$ is a function $f$ from the vertex set $V$ to a set of nonnegative integers such that $| f(u) -f(v) | \ge \delta_i$, if $d(u,v) = i, \ 1 \le i \le \sigma-1, \ $ where $d(u,v)$ is the distance (i.e. the minimum number of edges) between the vertices $u$ and $v$. An optimal $L(\delta_1, \delta_2, \ldots,\delta_{\sigma-1})$-coloring for $G$ is one using the smallest range $\lambda$ of integers over all such colorings. This problem has relevant application in channel assignment for interference avoidance in wireless networks, where channels (i.e. colors) assigned to interfering stations (i.e. vertices) at distance $i$ must be at least $\delta_i$ apart, while the same channel can be reused in vertices whose distance is at least $\sigma$. In particular, two versions of the coloring problem -- $L(2,1,1)$, and $L(\delta_1, 1, \ldots,1)$ -- are considered. Since these versions of the problem are $NP$-hard for general graphs, efficient algorithms for finding optimal colorings are provided for specific graphs modeling realistic wireless networks including rings, bidimensional grids, and cellular grids.
2002-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/284/1/78.pdf
Bertossi, Alan and Pinotti, Cristina M. and Tan, Richard (2002) Channel Assignment with Separation for Interference Avoidance in Wireless Networks. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/284/
oai:eprints.biblio.unitn.it:305
2012-02-28T14:16:00Z
7374617475733D696E7072657373
7375626A656374733D48:4844:484436322E36
74797065733D61727469636C656A6F75726E616C
Impresa non profit: efficienza, ideologia e codice etico
Sacconi, Lorenzo
HD0062.6 Nonprofit Organizations
Analisi dei fattori determinanti per l'efficienza dell'organizzazione non profit nella produzione di beni sociali o di welfare. L'autore sostiene la tesi secondo la quale il fattore base dell'efficienza di questo tipo di organizzazioni è l'attitudine ad avvalersi di principi ideologici e codici etici di autoregolamentazione. In particolare l'autore analizza l'interdipendenza tra il ruolo cognitivo del codice etico che sostiene la relazione fiduciaria dell'organizzazione con i suoi agenti esterni (donatori e beneficiari) e il ruolo motivazionale dell'deologia che genera preferenze conformiste tra gli agenti interni all'organizzazione stessa.
2002
Article in journal
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/305/1/wp17.pdf
Sacconi, Lorenzo (2002) Impresa non profit: efficienza, ideologia e codice etico. In «ISSAN Working Papers», n. 17 UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/305/
oai:eprints.biblio.unitn.it:306
2012-02-28T14:16:00Z
7374617475733D696E7072657373
7375626A656374733D48:4844:484436322E36
74797065733D61727469636C656A6F75726E616C
La cooperazione sociale di inserimento lavorativo e il punto di vista dell'utente
Zalla, Domenico
HD0062.6 Nonprofit Organizations
Premessa: La cooperazione sociale di inserimento cooperativo, o di tipo B, e' diventata in pochi anni soggetto di politiche sociali e del lavoro attive, riuscendo nell'obiettivo di realizzare inserimento lavorativo e di dare formazione generale al lavoro, ovvero fornire alle persone inserite quelli che vengono definiti "prerequisiti lavorativi", cioe' la capacita' di rispettare modi e tempi di lavoro, ritmi, esigenze organizzative, ecc. Tuttavia, il lavoro non costituisce di per sé una garanzia di miglioramento della situazione personale di un soggetto svantaggiato, e l'inserimento lavorativo non comporta necessariamente integrazione sociale. Il realizzarsi dell'integrazione sociale dipende dal tipo di disagio di cui la persona è portatrice: ciò che è vero per i portatori di handicap non lo è necessariamente per i soggetti con disagio sociale. Il disabile nella gran parte dei casi, è inserito in una rete sociale e familiare adeguata, in una rete affettiva che lo sostiene, e il lavoro diventa quel tassello che può significare inclusione sociale. Gli utenti in condizioni di disagio sociale hanno invece altri bisogni: avere un supporto psicologico, costruirsi reti affettive e amicali, trovare casa, ecc. Si pone allora il problema di come dare risposte a questi bisogni: gli strumenti per farlo vanno trovati dentro le cooperative o al di fuori di esse? Se si sceglie la strada "interna" si rischia di fornire un alibi ai servizi sociali: una volta affidatogli il soggetto svantaggiato, infatti, essi si aspettano che la cooperativa si occupi della totalità dei bisogni della persona. Se si opta invece per la strada "esterna" è necessario creare una rete di servizi pubblici e privati che affianchi e sostenga l'attività di formazione svolta dalla cooperativa sociale di inserimento lavorativo. In questo lavoro si cerca di dare qualche prima risposta a queste domande e di aggiungere elementi di riflessione alle ricerche che hanno quantificato i risultati dell'inserimento lavorativo. Il commento che segue è articolato in sei paragrafi, ognuno dei quali analizza i diversi momenti in cui si articola il rapporto tra i soggetti svantaggiati e la cooperativa, e ne individua le modalità di realizzazione e le difficoltà. Nel primo paragrafo si presenta una breve descrizione della ricerca e del campione. Nei paragrafi due, tre e quattro si descrivono i diversi momenti del rapporto con la cooperativa, ovvero l’ingresso, l’esperienza e l’uscita. Il quinto paragrafo definisce il ruolo del lavoro e dell'inserimento lavorativo all'interno di un progetto di riabilitazione. Nelle conclusioni, infine, sono presentate alcune proposte operative.
2001-05
Article in journal
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/306/1/wp16.pdf
Zalla, Domenico (2001) La cooperazione sociale di inserimento lavorativo e il punto di vista dell'utente. In «ISSAN Working Papers», n. 16 UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/306/
oai:eprints.biblio.unitn.it:308
2012-02-28T14:16:01Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
What is Local Models Semantics?
Ghidini, Chiara
Giunchiglia, Fausto
QA075 Electronic computers. Computer science
In recent papers a new semantics, called Local Models Semantics, was presented and used to provide a foundation to reasoning with contexts. Local Models Semantics captures and makes precise the two main principles underlying contextual reasoning: the, so-called, Principle of Locality and Principle of Compatibility. In this chapter we aim at explaining the main intuitions underlying Local Models Semantics, its fundamental logical properties, and its relation with contextual reasoning. The emphasis is on motivations and intuitions, rather than on technicalities.
2002-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/308/1/90.pdf
Ghidini, Chiara and Giunchiglia, Fausto (2002) What is Local Models Semantics? UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/308/
oai:eprints.biblio.unitn.it:309
2012-02-28T14:16:01Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
On the dimensions of context dependence
Benerecetti, Massimo
Bouquet, Paolo
Ghidini, Chiara
QA075 Electronic computers. Computer science
In this chapter we propose to re-read the past work on formalizing context as the search for a logic of the relationships between partial, approximate, and perspectival theories of the world. The idea is the following. We start from a very abstract analysis of a context dependent representation into three basic elements. We briefly show that all the mechanisms of contextual reasoning that have been studied in the past fall into three abstract forms: expand/contract, push/pop, and shifting. Moreover we argue that each of the three forms of reasoning actually captures an operation on a different dimension of variation of a context dependent representation, partiality, approximation, and perspective. We show how these ideas are formalized in the framework of MultiContext Systems, and briefly illustrate some applications.
2002-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/309/1/91.pdf
Benerecetti, Massimo and Bouquet, Paolo and Ghidini, Chiara (2002) On the dimensions of context dependence. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/309/
oai:eprints.biblio.unitn.it:340
2012-02-28T14:16:10Z
7374617475733D696E7072657373
7375626A656374733D51:5141:5141303633
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Il ragionamento controfattuale: un modello e la sua applicazione al ragionamento pratico
Ferrario, Roberta
QA063 Problem solving
QA076 Computer software
Il ragionamento controfattuale: un modello e la sua applicazione al ragionamento pratico
2002-12
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/340/1/101.pdf
Ferrario, Roberta (2002) Il ragionamento controfattuale: un modello e la sua applicazione al ragionamento pratico. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/340/
oai:eprints.biblio.unitn.it:385
2012-02-28T14:16:24Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Web site quality evaluation: Lightweight or Heavyweight Models?
Mich, Luisa
Franch, Mariangela
Novi Inverardi, Pierluigi
Marzani, Pietro
QA075 Electronic computers. Computer science
One of the most critical decisions in a quality evaluation project is to establish the level at which to analyse the characteristics of the Web sites. This choice should be driven by the underlying goals of the evaluation. Scalability and flexibility are thus desiderable features of the models used to evaluate the quality of a Web site. In this paper we describe two separate studies of Regional Tourist Boards in the Alps that were conducted instantiating the meta-model 2QCV3Q (7Loci). Specifically, we will show that the results of the first study - based on a lightweight model - are consistent with those obtained with the more detailed heavyweight model in the second study.
2003-04
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/385/1/015.pdf
Mich, Luisa and Franch, Mariangela and Novi Inverardi, Pierluigi and Marzani, Pietro (2003) Web site quality evaluation: Lightweight or Heavyweight Models? UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/385/
oai:eprints.biblio.unitn.it:387
2013-08-26T19:34:25Z
7374617475733D696E7072657373
7375626A656374733D48:4846:484635343130
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Market research for requirements analysis using linguistic tools
Mich, Luisa
Franch, Mariangela
Novi Inverardi, Pierluigi
QA075 Electronic computers. Computer science
HF5410 Marketing. Distribution of Products
Numerous studies in recent months have proposed the use of linguistic instruments to support requirements analysis. There are two main reasons for this: (i) the progress made in natural language processing, (ii) the need to provide the developers of software systems with support in the early phases of requirements definition and conceptual modelling. This paper presents the results of an online market research intended (a) to assess the economic advantages of developing a CASE tool that integrates linguistic analysis techniques for documents written in natural language, and (b) to verify the existence of potential demand for such a tool. The research included a study of the language – ranging from completely natural to highly restricted – used in documents available for requirements analysis, an important factor given that on a technological level there is a trade-off between the language used and the performance of the linguistic instruments. To determine the potential demand for such tool, some of the survey questions dealt with the adoption of development methodologies and consequently with models and support tools; other questions referred to activities deemed critical by the companies involved. Through statistical correspondence analysis of the responses, we were able to outline two "profiles" of companies that correspond to two potential market niches which are characterised by their very different approach to software development.
2002-02
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/387/1/NLP%2DCASEMarketResearch_(1)_new_version.pdf
Mich, Luisa and Franch, Mariangela and Novi Inverardi, Pierluigi (2002) Market research for requirements analysis using linguistic tools. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/387/
oai:eprints.biblio.unitn.it:405
2012-02-28T14:16:30Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Deriving Ontology-Based Metadata for E-Learning form the ACM Computing Curricula
Saini, Paramjeet
Ronchetti, Marco
QA075 Electronic computers. Computer science
Using metadata is very important for achieving best results in finding and reusing e-learning material. Metadata are however effective only if there is a common agreement on the terminology used. Defining an ontology is a way out, but creating a good ontology and reaching a consensus on it is a non trivial task. In this paper, we claim that an ontology for Computer Science can be extracted as a side-result from the work made by an ACM committee on Computer Science curricula. We extracted the ontology, and we suggest that it could/should be used for defining metadata on e-learning material that is concerned with the Computer Science domain. We provide both an XML and a DAML+OIL representation of the ontology. Also, we suggest a possible way to navigate the metadata that allows enriching each lesson with a set of related material automatically extracted from the repository of e-learning material. Finally, we discuss possible additional uses of the ontology, and the exportability of our approach to other disciplines.
2003-05
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/405/1/017.pdf
Saini, Paramjeet and Ronchetti, Marco (2003) Deriving Ontology-Based Metadata for E-Learning form the ACM Computing Curricula. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/405/
oai:eprints.biblio.unitn.it:406
2012-02-28T14:16:30Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
From the classroom to the computer screen: delivering a traditional University course in a non-traditional way
Ronchetti, Marco
QA075 Electronic computers. Computer science
The present Technical Reports contains two complementary papers describing our experience with a system for delivering traditional lectures through computers and computer networks.
2003-05
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/406/1/018.pdf
Ronchetti, Marco (2003) From the classroom to the computer screen: delivering a traditional University course in a non-traditional way. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/406/
oai:eprints.biblio.unitn.it:407
2012-02-28T14:16:30Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
De-Fragmenting Knowledge: Using Metadata for Interconnecting Courses
Ronchetti, Marco
Giuliani, Alberto
Saini, Paramjeet
QA075 Electronic computers. Computer science
E-learning systems are often based on the notion of "course": an interconnected set of resources aiming at presenting material related to a particular topic. Course authors do provide external links to related material. Such external links are however "frozen" at the time of publication of the course. Metadata are useful for classifying and finding e-learning artifacts. In many cases, metadata are used by Learning Management Systems to import, export, sequence and present learning objects. The use of metadata by humans is in general limited to a search functionality, e.g. by authors who search for material that can be reused. We argue that metadata can be used to enrich the interconnection among courses, and to present to the student a richer variety of interconnected resources. We implemented a system that presents an instance of this idea.
2003-05
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/407/1/019.pdf
Ronchetti, Marco and Giuliani, Alberto and Saini, Paramjeet (2003) De-Fragmenting Knowledge: Using Metadata for Interconnecting Courses. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/407/
oai:eprints.biblio.unitn.it:423
2012-02-28T14:16:36Z
7374617475733D696E7072657373
7375626A656374733D48:4831
74797065733D746563687265706F7274
Managing the KM Trade-Off: Knowledge Centralization versus Distribution
Bonifacio, Matteo
Camussone, Pierfranco
H Social Sciences (General)
KM is more an archipelago of theories and practices rather than a monolithic approach. We propose a conceptual map that organizes some major approaches to KM according to their assumptions on the nature of knowledge. The paper introduces the two major views on knowledge objectivist, subjectivist - and explodes each of them into two major approaches to KM: knowledge as a market, and knowledge as intellectual capital (the objectivistic perspective); knowledge as mental models, and knowledge as practice (the subjectivist perspective). We argue that the dichotomy between objective and subjective approaches is intrinsic to KM within complex organizations, as each side of the dichotomy responds to different, and often conflicting, needs: on the one hand, the need to maximize the value of knowledge through its replication; on the other hand, the need to keep knowledge appropriate to an increasingly complex and changing environment. Moreover, as a proposal for a deeper discussion, such trade-off will be suggested as the origin of other relevant KM related trade-offs that will be listed. Managing these trade-offs will be proposed as a main challenge of KM.
2003
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/423/1/029.pdf
Bonifacio, Matteo and Camussone, Pierfranco (2003) Managing the KM Trade-Off: Knowledge Centralization versus Distribution. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/423/
oai:eprints.biblio.unitn.it:424
2012-02-28T14:16:36Z
7374617475733D696E7072657373
7375626A656374733D48:4831
74797065733D746563687265706F7274
The richness of diversity in knowledge creation: an interdisciplinary overview
Bonifacio, Matteo
Molani, Alessandra
H Social Sciences (General)
The goal of this article is to explore some of the main reasons that sustain a distributed approach to Knowledge Management, and this will be done, first, showing how, according to very different theoretical disciplines, knowledge diversity is proposed as the very source of organizational innovation and adaptability; second providing some evidence coming from major applicative domains; third proposing some considerations on the role of technology.
2003
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/424/1/030.pdf
Bonifacio, Matteo and Molani, Alessandra (2003) The richness of diversity in knowledge creation: an interdisciplinary overview. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/424/
oai:eprints.biblio.unitn.it:425
2012-02-28T14:16:36Z
7374617475733D696E7072657373
7375626A656374733D48:4831
74797065733D746563687265706F7274
Knowledge Nodes: the reification of organizational communities. A case study
Cuel, Roberta
Bonifacio, Matteo
Grossele, Mirko
H Social Sciences (General)
In our work a new approach, the Distributed Knowledge Management (DKM) approach, is used and organizations are seen as constellations of communities, which \own" local knowledge and exchange it through meaning negotiation coordination processes. In order to reify communities within a DKM system, the concept of Knowledge Node (KN) is used and then applied in a case study: a complex Italian national firm, the Impresa Pizzarotti & C. S.p.A. All communities of practices are un-veiled and rei ed as KNs within a high level architecture of a DKM system. In this paper it is argued that, even if knowledge has to be organized and made useful to the whole organization, there are types of knowledge that must be managed in an autonomous way, and the DKM approach is a good system which to deal with coordination/negotiation processes.
2003
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/425/1/031.pdf
Cuel, Roberta and Bonifacio, Matteo and Grossele, Mirko (2003) Knowledge Nodes: the reification of organizational communities. A case study. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/425/
oai:eprints.biblio.unitn.it:433
2012-02-28T14:16:39Z
7374617475733D696E7072657373
7375626A656374733D5A:5A41:5A4134343530
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Implementing Database Coordination in P2P Networks
Giunchiglia, Fausto
Zaihrayeu, Ilya
ZA4450 Databases
QA076 Computer software
We are interested in the interaction of databases in Peer-to-Peer (P2P) networks. In this paper we propose a new solution for P2P databases, that we call database coordination. We see coordination as managing semantic interdependencies among databases at runtime. We propose a data coordination model where the notions of Interest Groups and Acquaintances play the most crucial role. Interest groups support the formation of peers according to data models they have in common; and acquaintances allow for peers inter-operation. Finally, we present an architecture supporting database coordination and show how it is implemented on top of JXTA.
2003-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/433/1/035.pdf
Giunchiglia, Fausto and Zaihrayeu, Ilya (2003) Implementing Database Coordination in P2P Networks. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/433/
oai:eprints.biblio.unitn.it:438
2012-02-28T14:16:40Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413337342E37
74797065733D746563687265706F7274
Volterra integro-differential equations with accretive operators and non autonomous perturbations
Bonaccorsi, Stefano
Fantozzi, Marco
QA374.7 Partial differential equations
Not available
2003-05
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/438/1/UTM642.pdf
Bonaccorsi, Stefano and Fantozzi, Marco (2003) Volterra integro-differential equations with accretive operators and non autonomous perturbations. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/438/
oai:eprints.biblio.unitn.it:439
2012-02-28T14:16:41Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143333231
74797065733D746563687265706F7274
On a model of phase relaxation for the hyperbolic Stefan problem
Recupero, Vincenzo
QC321 Heat - conduction
In this paper we study a model of phase relaxation for the Stefan problem with the Cattaneo-Maxwell heat flux law. We prove an existence and uniqueness result for the resulting problem and we show that its solution converges to the solution of the Stefan problem as the two relaxation parameters go to zero, provided a relation between these parameters holds.
2003
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/439/1/UTM643.pdf
Recupero, Vincenzo (2003) On a model of phase relaxation for the hyperbolic Stefan problem. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/439/
oai:eprints.biblio.unitn.it:440
2012-02-28T14:16:41Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
A Reconstruction Procedure for Microwave Nondestructive Evaluation based on a Numerically Computed Green's Function
Caorsi, Salvatore
Massa, Andrea
Pastorino, Matteo
Randazzo, Andrea
Rosani, Andrea
QC760 Electromagnetism
This paper describes a new microwave diagnostic tool for nondestructive evaluation. The approach, developed in the spatial domain, is based on the numerical computation of the inhomogeneous Green’s function in order to fully exploit all the available a-priori information of the domain under test. The heavy reduction of the computational complexity of the proposed procedure (with respect to standard procedures based on the free-space Green’s function) is also achieved by means of a customized hybrid-coded genetic algorithm. In order to assess the effectiveness of the method, the results of several simulations are presented and discussed.
2003-06
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/440/1/039.pdf
Caorsi, Salvatore and Massa, Andrea and Pastorino, Matteo and Randazzo, Andrea and Rosani, Andrea (2003) A Reconstruction Procedure for Microwave Nondestructive Evaluation based on a Numerically Computed Green's Function. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/440/
oai:eprints.biblio.unitn.it:441
2012-02-28T14:16:42Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Improved Microwave Imaging Procedure for Non-Destructive Evaluations of Two-Dimensional Structures
Caorsi, Salvatore
Massa, Andrea
Pastorino, Matteo
Donelli, Massimo
QC760 Electromagnetism
An improved microwave procedure for detecting defects in dielectric structures is proposed. The procedure is based on the integral equations of the inverse scattering problem. A hybrid Genetic Algorithm is applied in order to minimize the obtained nonlinear functional. Since in nondestructive evaluations the unperturbed object is completely known, it is possible off-line to numerically compute the Green's function for the configuration without defects. Consequently, a very dignificant computation saving is obtained, since the 'chromosome' of the Genetic Algorithm codes only the parameters describing the unknown defect.
2003-06
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/441/1/040.pdf
Caorsi, Salvatore and Massa, Andrea and Pastorino, Matteo and Donelli, Massimo (2003) Improved Microwave Imaging Procedure for Non-Destructive Evaluations of Two-Dimensional Structures. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/441/
oai:eprints.biblio.unitn.it:444
2012-02-28T14:16:43Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Synthesis of sum and difference patterns for monopulse antennas by an hybrid real/integer-coded differential evolution method
Caorsi, Salvatore
Massa, Andrea
Pastorino, Matteo
Randazzo, Andrea
QC760 Electromagnetism
The synthesis of sum and difference patterns of monopulse antennas is considered in this paper. The synthesis problem is recast as an optimization problem by defining a suitable cost function based on the constraints on the side lobe levels. A subarray configuration is considered and the excitations of the difference pattern are approximately determined. The optimization problem is efficently solved by a differential evolution algorithm, wich is able to contemporarly handle real and integer unknowns. Numerical results are reported considering classic array configurations previusly assumed in the literature.
2003-07
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/444/1/043.pdf
Caorsi, Salvatore and Massa, Andrea and Pastorino, Matteo and Randazzo, Andrea (2003) Synthesis of sum and difference patterns for monopulse antennas by an hybrid real/integer-coded differential evolution method. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/444/
oai:eprints.biblio.unitn.it:446
2012-02-28T14:16:44Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Detection, Location and Imaging of Multiple Scatterers by means of the Iterative Multiscaling Method
Caorsi, Salvatore
Massa, Andrea
Donelli, Massimo
QC760 Electromagnetism
In this paper, a new version of the iterative multiscaling method (IMM) is proposed for reconstructing multiple scatterers in two-dimensional microwave imaging problems. The manuscript describes the new procedure evaluating the effectiveness of the IMM previously assessed for single object detection. Starting from inverse scattering integral equations, the problem is recast in a minimization one by defining iteratively (at each level of the scaling procedure) a suitable cost function allowing firstly a detection of the unknown objects, successively a location of the scatterers and finally a quantitative reconstruction of the scenario under test. Thanks to its properties, the approach allows an effective use of the information achievable from inverse scattering data. Morover, the adopted kind of expansion is able to deal with all possible multiresolution combinations in an easy and computationally inexpensive way. Selected numerical examples concerning dielectric as well as dissipative objects in noisy enviroments or starting from experimantally-acquired data are reported in order to confirm the usefulness of the introduced tool and of the effectiveness of the proposed procedure.
2003-07
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/446/1/044.pdf
Caorsi, Salvatore and Massa, Andrea and Donelli, Massimo (2003) Detection, Location and Imaging of Multiple Scatterers by means of the Iterative Multiscaling Method. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/446/
oai:eprints.biblio.unitn.it:448
2012-02-28T14:16:44Z
7374617475733D696E7072657373
7375626A656374733D51:5148:5148333031
74797065733D746563687265706F7274
Cell Cycle Control in Eukaryotes: a BioSpi model
Lecca, Paola
Priami, Corrado
QH301 Biology
This paper presents a stochastic model of the cell cycle control in eukaryotes. The framework used is based on stochastic process algebras for mobile systems. The automatic tool used in the simulation is the BioSpi. We compare our approach with classical ODE specications.
2003-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/448/1/045.pdf
Lecca, Paola and Priami, Corrado (2003) Cell Cycle Control in Eukaryotes: a BioSpi model. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/448/
oai:eprints.biblio.unitn.it:449
2012-02-28T14:16:44Z
7374617475733D696E7072657373
7375626A656374733D51:5148:5148333031
74797065733D746563687265706F7274
Enhanced Operational Semantics in Systems Biology
Degano, Pierpaolo
Priami, Corrado
QH301 Biology
We are faced with a great challenge: the cross-fertilization between the fields of formal methods for concurrency, in the computer science domain, and systems biology in the biological realm.
2003-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/449/1/046.pdf
Degano, Pierpaolo and Priami, Corrado (2003) Enhanced Operational Semantics in Systems Biology. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/449/
oai:eprints.biblio.unitn.it:450
2012-02-28T14:16:44Z
7374617475733D696E7072657373
7375626A656374733D51:5148:5148333031
74797065733D746563687265706F7274
Static Analysis for Systems Biology
Nielson, Flemming
Nielson, Hanne Riis
Priami, Corrado
Schuch da Rosa, Debora
QH301 Biology
This paper shows how static analysis techniques can help understanding biological systems. Based on a simple example will illustrate the outcome of performing three different analyses extracting information of increasing precision. We conclude by reporting on the potential impact and exploitation of these techniques in systems biology.
2003-07
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/450/1/047.pdf
Nielson, Flemming and Nielson, Hanne Riis and Priami, Corrado and Schuch da Rosa, Debora (2003) Static Analysis for Systems Biology. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/450/
oai:eprints.biblio.unitn.it:451
2012-02-28T14:16:45Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
7375626A656374733D51:5148:5148333031
74797065733D746563687265706F7274
Design Environments for Complex Systems
Priami, Corrado
QH301 Biology
QA075 Electronic computers. Computer science
The paper describes an approach for modeling complex systems by hiding as much formal details as possible from the user, still allowing verification and simulation of the model. The interface is based on UML to make the environment available to the largest audience. To carry out analysis, verification and simulation we automatically extract process algebras specifications from UML models. The results of the analysis is then reflected back in the UML model by annotating diagrams. The formal model includes stochastic information to handle quantitative parameters. We present here the stochastic -calculus and we discuss the implementation of its probabilistic support that allows simulation of processes. We exploit the benefits of our approach in two applicative domains: global computing and systems biology.
2003-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/451/1/048.pdf
Priami, Corrado (2003) Design Environments for Complex Systems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/451/
oai:eprints.biblio.unitn.it:530
2012-02-28T14:17:00Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736:514137362E37
74797065733D746563687265706F7274
Contextualizing Ontologies
Bouquet, Paolo
Giunchiglia, Fausto
van Harmelen, Frank
Serafini, Luciano
Stuckenschmidt, Heiner
QA076.7 Programming Languages - Semantics
Ontologies are shared models of a domain that encode a view which is common to a set of different parties. Contexts are local models that encode a party’s subjective view of a domain. In this paper we show how ontologies can be contextualized, thus acquiring certain useful properties that a pure shared approach cannot provide. We say that an ontology is contextualized or, also, that it is a contextual ontology, when its contents are kept local, and therefore not shared with other ontologies, and mapped with the contents of other ontologies via explicit (context) mappings. The results is Context OWL (C-OWL), a language whose syntax and semantics have been obtained by extending the OWL syntax and semantics to allow for the representation of contextual ontologies.
2004-02
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/530/1/013.pdf
Bouquet, Paolo and Giunchiglia, Fausto and van Harmelen, Frank and Serafini, Luciano and Stuckenschmidt, Heiner (2004) Contextualizing Ontologies. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/530/
oai:eprints.biblio.unitn.it:531
2012-02-28T14:17:00Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736:514137362E37
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
S-Match: an algorithm and an implementation of semantic matching
Giunchiglia, Fausto
Shvaiko, Pavel
Yatskevich, Mikalai
QA076 Computer software
QA076.7 Programming Languages - Semantics
We think of Match as an operator which takes two graph-like structures (e.g., conceptual hierarchies or ontologies) and produces a mapping between those nodes of the two graphs that correspond semantically to each other. Semantic matching is a novel approach where semantic correspondences are discovered by computing, and returning as a result, the semantic information implicitly or explicitly codified in the labels of nodes and arcs. In this paper we present an algorithm implementing semantic matching, and we discuss its implementation within the S-Match system. We also test S-Match against three state of the art matching systems. The results, though preliminary, look promising, in particular for what concerns precision and recall.
2004-02
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/531/1/015.pdf
Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai (2004) S-Match: an algorithm and an implementation of semantic matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/531/
oai:eprints.biblio.unitn.it:537
2012-02-28T14:17:03Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Requirements Engineering for the Business Process re-engineering: an example in the Agro-Food Supply Chain
Bresciani, Paolo
Marin, Floriana
Martinelli, Lucia
Sannicolo', Fabrizio
QA075 Electronic computers. Computer science
Recent researches in Requirements Engineering and Software Engineering suggest that a deep organizational analysis is needed as a preliminary phase of any project that aims at introducing or modifying the use of Information Technologies inside an organization. Accordingly to this view, the social setting is the motivating factor that justify the technological choices. In this paper, we show with an example how balancing social and business issues can be properly addressed and analyzed by means of the Early Requirements Analysis phase of the Tropos methodology. In particular, we refer to an ongoing project with the goal of proposing web based technologies to spread-off information, data and knowledge on the so called Genetically Modified Organisms.
2003-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/537/1/bresciani%2Dmartinelli%2Dmarin%2Dsannicolo.pdf
Bresciani, Paolo and Marin, Floriana and Martinelli, Lucia and Sannicolo', Fabrizio (2003) Requirements Engineering for the Business Process re-engineering: an example in the Agro-Food Supply Chain. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/537/
oai:eprints.biblio.unitn.it:549
2012-02-28T14:17:08Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Towards Explaining Semantic Matching
McGuinness, Deborah L.
Shvaiko, Pavel
Giunchiglia, Fausto
da Silva, Paulo Pinheiro
QA076 Computer software
Interoperability among systems using different term vocabularies requires some mapping between terms in the vocabularies. Matching applications generate such mappings. When the matching process utilizes term meaning (instead of simply relying on syntax), we refer to the process as semantic matching. If users are to use the results of matching applications, they need information about the mappings. They need access to the sources that were used to determine relations between terms and potentially they need to understand any deductions performed on the information. In this paper, we present our approach to explaining semantic matching. Our initial work uses a satisfiability-based approach to determine subsumption and semantic matches and uses the Inference Web and its OWL encoding of the proof markup language to explain the mappings. The Inference Web solution also includes a registration of the OWL reasoning component of JTP, as well as other reasoner registrations, and thus provides a foundation for explaining semantic matching systems.
2004-02
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/549/1/019.pdf
McGuinness, Deborah L. and Shvaiko, Pavel and Giunchiglia, Fausto and da Silva, Paulo Pinheiro (2004) Towards Explaining Semantic Matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/549/
oai:eprints.biblio.unitn.it:556
2012-02-28T14:17:10Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Satisfiability for Propositional Contexts
Serafini, Luciano
Roelofsen, Floris
QA076 Computer software
We propose a sound and complete satisfiability algorithm for propositional multi-context systems. In essence, the algorithm is a distribution policy built on top of local reasoning procedures, one for each context, which can be implemented by (a diversity of) customized state-of-the-art SAT solvers. The foremost intuition that has motivated our algorithm, and the very potential strength of contextual reasoning, is that of keeping reasoning as local as possible. In doing so, we improve on earlier established complexity results by Massacci. Moreover, our approach could be applied to enhance recent proposals by Amir and Mcilraith towards a new partition-based reasoning paradigm; particularly, our formalism allows for a more expressive description of interpartition relations, and we provide an algorithm that is explicitly designed to deal with this expressiveness.
2004-04
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/556/1/026.pdf
Serafini, Luciano and Roelofsen, Floris (2004) Satisfiability for Propositional Contexts. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/556/
oai:eprints.biblio.unitn.it:558
2012-02-28T14:17:10Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
The coDB Robust Peer-to-Peer Database System
Franconi, Enrico
Kuper, Gabriel
Lopatenko, Andrei
Zaihrayeu, Ilya
QA076 Computer software
In this paper we give an overview of the coDB semantically well-founded P2P DB system. A network of databases, possibly with different schemas, are interconnected by means of GLAV coordination rules, which are inclusions of conjunctive queries, with possibly existential variables in the head; coordination rules may be cyclic. Each node can be queried in its schema for data, which the node can fetch from its neighbours, if a coordination rule is involved. Correctness and termination of query answering is guaranteed also in the case of runtime change in the topology of the network.
2004-04
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/558/1/028.pdf
Franconi, Enrico and Kuper, Gabriel and Lopatenko, Andrei and Zaihrayeu, Ilya (2004) The coDB Robust Peer-to-Peer Database System. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/558/
oai:eprints.biblio.unitn.it:565
2012-02-28T14:17:13Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Interactive Access Control for Web Services
Koshutanski, Hristo
Massacci, Fabio
QA075 Electronic computers. Computer science
Business Processes for Web Services (BPEL4WS) are the new paradigms for lightweight enterprise integration. They cross organizational boundaries and are provided by entities that see each other just as business partners. Web services require shift in the access control mechanism: from identity-based access control to trust management and negotiation, but this is not enough for cross organizational business processes. For many businesses no partner may guess a priori what kind of credentials will be sent by clients and clients may not know a priori which credentials are required for completing a business process. We propose a logical framework for reasoning about access control for BPEL4WS and a BPEL4WS based implementation using Collaxa server. Our model is based on interaction and exchange of requests for supplying or declining missing credentials. We identify the formal reasoning services (deduction, abduction, consistency checking) that characterise the problem and discuss their implementation.
2004-04
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/565/1/031.pdf
Koshutanski, Hristo and Massacci, Fabio (2004) Interactive Access Control for Web Services. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/565/
oai:eprints.biblio.unitn.it:632
2012-02-28T14:17:28Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
74797065733D746563687265706F7274
An Adaptive Weighting Strategy for Microwave Imaging Problems
Bort, Emmanuele
Donelli, Massimo
Martini, Anna
Massa, Andrea
QC661 Electromagnetic Theory
In the framework of microwave imaging applications, an innovative strategy aimed at addressing the multi-objective inverse scattering problem is proposed. Starting from the spatial-domain integral formulation, the original multi-objective problem is recast into a single-objective one by defining a suitable cost function as a linear combination of the data and state terms according to variable weighting parameters. By iteratively tuning these paramenters, the optimization procedure is forced to solve an 'almost' multi-objective problem avoiding the use of ad-hoc multiple-objective optimization methods and satisfying different objectives in a balanced way. Selected numerical results indicate that the use of such a strategy yields to accurate reconstructions, with noise-corrupted data as well, by improving the performances of the adopted optimization procedure.
2004-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/632/1/DIT%2D04%2D064.pdf
Bort, Emmanuele and Donelli, Massimo and Martini, Anna and Massa, Andrea (2004) An Adaptive Weighting Strategy for Microwave Imaging Problems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/632/
oai:eprints.biblio.unitn.it:634
2012-02-28T14:17:30Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Electromagnetic Detection of Dielectric Scatterers Using Phaseless Synthetic and Real Data and the Memetic Algorithm
Caorsi, Salvatore
Massa, Andrea
Pastorino, Matteo
Randazzo, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
Phaseless data are used to evaluate the application of an electromagnetic inverse-scattering-based procedure for the detection of cylindrical inhomogeneities, which are schematized as multylayer infinite dielectric cylinders with elliptic cross sections. The electromagnetic inverse problem is recast as a global optimization problem and iteratively solved by an efficient memetic algorithm, which combines deterministic and stochastic concepts. Moreover, a recursive analytical procedure is used for the forward scattering computation. The possibility of localizing and reconstructing the scatterers by using phaseless input data, which would greatly simplify the design of the imaging apparatus, is evaluated both with reference to synthetically produced data and by means of experimental data obtained by a microwave tomograph.
2004-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/634/1/DIT%2D04%2D066.pdf
Caorsi, Salvatore and Massa, Andrea and Pastorino, Matteo and Randazzo, Andrea (2004) Electromagnetic Detection of Dielectric Scatterers Using Phaseless Synthetic and Real Data and the Memetic Algorithm. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/634/
oai:eprints.biblio.unitn.it:635
2012-02-28T14:17:30Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
A Multi-Source Strategy based on a Learning-by-Examples Technique for Buried Object Detection
Bermani, Emanuela
Boni, Andrea
Caorsi, Salvatore
Donelli, Massimo
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
In the framework of buried object detection and subsurface sensing, some of the main difficulties in the reconstruction process are certainly due to the aspect-limited nature of available measurement data and to the requirement of an on-line reconstruction. To limit these problems, a multi-source (MS) learning-by-example (LBE) technique is proposed in this paper. In order to fully exploit the more attractive features of the MS strategy, the proposed approach is based on a support vector machine (SVM). The effectiveness of the MS-LBE technique is evaluated by comparing the achieved results with those obtained by means of a previously developed single-source (SS) SVM-based procedure for an ideal as well as a noisy enviroment.
2004-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/635/1/DIT%2D04%2D067.pdf
Bermani, Emanuela and Boni, Andrea and Caorsi, Salvatore and Donelli, Massimo and Massa, Andrea (2004) A Multi-Source Strategy based on a Learning-by-Examples Technique for Buried Object Detection. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/635/
oai:eprints.biblio.unitn.it:654
2012-02-28T14:17:37Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
A Classification of Schema-Based Matching Approaches
Shvaiko, Pavel
QA076 Computer software
Schema/ontology matching is a critical problem in many application domains, such as, Semantic Web, schema/ontology integration, data warehouses, e-commerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema-based matching techniques that builds on the previous work on classifying schema matching approaches. Some innovations are in introducing new criteria which distinguish between matching techniques relying on diverse semantic clues. In particular, we distinguish between heuristic and formal techniques at schema-level; and implicit and explicit techniques at element- and structure-level. Based on the classification proposed we overview some of the recent schema/ontology matching systems pointing which part of the solution space they cover.
2004-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/654/1/093.pdf
Shvaiko, Pavel (2004) A Classification of Schema-Based Matching Approaches. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/654/
oai:eprints.biblio.unitn.it:688
2012-02-28T14:17:45Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
An Integrated Multi-Scaling Strategy based on a Particle Swarm Algorithm for Inverse Scattering Problems
Donelli, Massimo
Franceschini, Gabriele
Martini, Anna
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
The application of a multiscale strategy integrated with a stochastic technique to the solution of nonlinear inverse scattering problems is presented. The approach allows for the explicit and easy handling of many difficulties associated with such a problem ranging from ill-conditioning to nonlinearity and false solutions drawback. The choice of a finite dimensional representation for the unknowns, due to the upper bound to the essential dimension of the data, is iteratively accomplished by means of an adaptive multi-resolution model, which offers considerable flexibility for the inclusion of the a-priori knowledge and of the knowledge acquired during the iterative steps of the multiscaling process. Even though a suitable representation of the unknowns could limit the local minima problem, the multi-resolution strategy is integrated with a customized stochastic optimizer based on the behavior of a particle swarm (PSO), which allows to prevent that nonlinearity could induce the solution algorithm into false solutions without a large increasing of the overall computational burden. Selected examples are presented by considering a two-dimensional microwave imaging problem so as to illustrate the key features of the integrated stochastic multi-scaling strategy.
2004-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/688/1/DIT%2D04%2D081.pdf
Donelli, Massimo and Franceschini, Gabriele and Martini, Anna and Massa, Andrea (2004) An Integrated Multi-Scaling Strategy based on a Particle Swarm Algorithm for Inverse Scattering Problems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/688/
oai:eprints.biblio.unitn.it:689
2012-02-28T14:17:45Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Improving the Effectiveness of GA-Based Approaches to Microwave Imaging through an Innovative Parabolic Crossover
Bort, Emmanuele
Massa, Andrea
Rocca, Paolo
QC661 Electromagnetic Theory
QC760 Electromagnetism
Several studies have shown that evolutionary-based approaches are efficient, effective, and robust optimization methods for microwave imaging. However, the convergence rate of such techniques still does not meet all the requirements for on-line real applications and attempting to speed up the optimization is needed. In this paper, a new local search operator, the fitness-based parabolic crossover, is proposed and embedded into a real-coded genetic algorithm. Such a modification enables the imaging method to achieve a better trade-off between convergence rate and robustness to false solutions. By exploiting the relationship between the crossover operation and the local quadratic behavior of the functional, it is possible to increase the convergence rate of the genetic algorithm and thereby to obtain an acceptable solution with a smaller number of fitness function evaluations. The effectiveness of the modified genetic-algorithm-based imaging method is assessed by considering some synthetic test cases different in dimensions and noisy conditions. The obtained numerical results provide an empirical evidence of the efficiency and reliability of the proposed modified evolutionary algorithm.
2004-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/689/1/DIT%2D04%2D096.pdf
Bort, Emmanuele and Massa, Andrea and Rocca, Paolo (2004) Improving the Effectiveness of GA-Based Approaches to Microwave Imaging through an Innovative Parabolic Crossover. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/689/
oai:eprints.biblio.unitn.it:690
2012-02-28T14:17:45Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
An Innovative Fuzzy-Logic-Based Strategy for an Effective Exploitation of Noisy Inverse Scattering Data
Azaro, Renzo
Casagranda, Aronne
Franceschini, Davide
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
This paper presents an innovative inverse scattering approach based on a fuzzy-logic strategy aimed at fully exploiting the information content of the scattered data in a microwave imaging system. The effectiveness of the proposed method is assessed through the results of a numerical analysis concerned with the reconstruction of single as well as multiple dielectric targets in various noisy environments. For comparison purposes, the obtained performance are compared with those of a standard method in terms of reconstruction accuracy and computational load to point out the improvement induced by the proposed approach.
2004-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/690/1/DIT%2D04%2D097.pdf
Azaro, Renzo and Casagranda, Aronne and Franceschini, Davide and Massa, Andrea (2004) An Innovative Fuzzy-Logic-Based Strategy for an Effective Exploitation of Noisy Inverse Scattering Data. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/690/
oai:eprints.biblio.unitn.it:691
2012-02-28T14:17:46Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Interactive Access Control in Autonomic Communication
Koshutanski, Hristo
Massacci, Fabio
QA076 Computer software
Autonomic Communication is a new paradigm for dynamic network integration. An Autonomic Network crosses organizational and management boundaries and is provided by entities that see each other just as business partners. Policy-based network access and management already requires a paradigm shift in the access control mechanism: from identity-based access control to trust management and negotiation, but this is not enough for cross organizational autonomic communication. For many services no autonomic communication partner may guess a priori what will be sent by clients and clients may not know a priori what credentials are demanded for completing a service requiring the orchestration of many different autonomic nodes. To solve this problem we propose to use interactive access control for autonomic communication: servers should be able to get back to clients asking for missing credentials, whereas the latter may decide to supply or decline requested credentials and so on until a final decision is made. This proposal is grounded in a formal model on policy-based access control using abduction. We identify the key algorithm for interactive access and show its correctness. The Web Services-based implementation that we have developed is also sketched.
2004-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/691/1/094.pdf
Koshutanski, Hristo and Massacci, Fabio (2004) Interactive Access Control in Autonomic Communication. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/691/
oai:eprints.biblio.unitn.it:693
2012-02-28T14:17:46Z
7374617475733D696E7072657373
7375626A656374733D54:544B:544B37383835
7375626A656374733D54:544B:544B353130352E35
74797065733D746563687265706F7274
QVBR-MAC: A QoS-Oriented MAC Protocol for Variable-Bit-Rate MC-CDMA Wireless LANs
Berlanda-Scorza, Giovanni
Sacchi, Claudio
Granelli, Fabrizio
De Natale, Francesco
TK7885 Computer Engineering
TK5105.5 Computer Networks
Multicarrier Code Division Multiple Access (MC-CDMA) techniques were originally proposed at mid of 90’s for wideband multi-user communications in wireless environments characterised by hostile propagation characteristics. Problems still to be solved are related to the provision of efficient resource channel allocation in variable-bit-rate transmission. In this work, the design of a MC-CDMA-based WLAN infrastructure is considered. The great advantage of MC-CDMA, i.e. the capability of supporting asynchronous multi-user variable-bit-rate (VBR) transmission over multipath channel with conventional detection, is exploited, jointly with an efficient and real-time Medium Access Control (MAC) strategy, in order to allow a significant number of VBR users to share the same bandwidth with different QoS profiles. Different classes of users will be labeled by the MAC level that has to plan a controlled access to the channel on the basis of the users’ requests and to check the possibility of assuring to them a certain Qos degree. The paper presents an overview of the system and tests its performance through extensive simulation.
2004-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/693/1/DIT%2D04%2D098.pdf
Berlanda-Scorza, Giovanni and Sacchi, Claudio and Granelli, Fabrizio and De Natale, Francesco (2004) QVBR-MAC: A QoS-Oriented MAC Protocol for Variable-Bit-Rate MC-CDMA Wireless LANs. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/693/
oai:eprints.biblio.unitn.it:717
2012-02-28T14:17:52Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736:514137362E37
74797065733D746563687265706F7274
Efficient Semantic Matching
Giunchiglia, Fausto
Yatskevich, Mikalai
Giunchiglia, Enrico
QA076.7 Programming Languages - Semantics
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class of problems. According to the tests we have done so far, the optimizations substantially improve the time performance of the system.
2004-12
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/717/1/112.pdf
Giunchiglia, Fausto and Yatskevich, Mikalai and Giunchiglia, Enrico (2004) Efficient Semantic Matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/717/
oai:eprints.biblio.unitn.it:725
2012-02-28T14:17:55Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
SAT-Based Decision Procedures for Classical Modal Logics
Giunchiglia, Enrico
Giunchiglia, Fausto
Tacchella, Armando
QA076 Computer software
We present a set of SAT-based decision procedures for various classical modal logics. By SAT-based, we mean built on top of a SAT solver. We show how the SAT-based approach allows for a modular implementation for these logics. For some of the logics we deal with, we are not aware of any other implementation. For the others, we define a testing methodology which generalizes the 3CNFK methodology by Giunchiglia and Sebastiani. The experimental evaluation shows that our decision procedures perform better than or as well as other state-of-the-art decision procedures.
2005-01
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/725/1/001.pdf
Giunchiglia, Enrico and Giunchiglia, Fausto and Tacchella, Armando (2005) SAT-Based Decision Procedures for Classical Modal Logics. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/725/
oai:eprints.biblio.unitn.it:734
2012-02-28T14:27:15Z
oai:eprints.biblio.unitn.it:737
2012-02-28T14:17:56Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413337342E37
74797065733D746563687265706F7274
A high resolution scheme for flows in open channels with arbitrary cross-section
Aldrighetti, Elisa
Zanolli, Paola
QA374.7 Partial differential equations
The aim of this paper is to present a numerical scheme to simulate unsteady, one dimensional flows in open channels with arbitrary cross-section. This scheme is fully conservative of volume and momentum and preserves the non-negativity of the water depth. The finite difference method derived is semi-implicit in time and based on a space staggered grid. A high resolution technique, the flux limiter method, is implemented to control the accuracy of the proposed scheme. Our purpose is to achieve the precision and the stability of the method with respect to the regularity of the data. A few computational examples on classical test cases are given to illustrate the properties of the present method in terms of stability, accuracy and efficiency.
2004-10
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/737/1/aldrighetti_zanolli.pdf
Aldrighetti, Elisa and Zanolli, Paola (2004) A high resolution scheme for flows in open channels with arbitrary cross-section. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/737/
oai:eprints.biblio.unitn.it:744
2012-02-28T14:17:56Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
On the Enhancement of the Reconstruction Accuracy obtained with a Multi-Source/Multi-Illumination Inverse Scattering Technique
Franceschini, Davide
Massa, Andrea
QC760 Electromagnetism
This paper explores the possibility of enhancing the available information content of scattered data by means of an innovative Multi-Source strategy. The approach exploits the scattering interactions between scatterer and probing source when the investigation domain is illuminated by different (in terms of radiation patterns) illuminations. The results of a set of representative numerical simulations are shown to point out the potentialities of the inversion strategy.
2005-01
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/744/1/DIT%2D05%2D003.pdf
Franceschini, Davide and Massa, Andrea (2005) On the Enhancement of the Reconstruction Accuracy obtained with a Multi-Source/Multi-Illumination Inverse Scattering Technique. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/744/
oai:eprints.biblio.unitn.it:747
2012-02-28T14:17:57Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Evaluation and Ranking of Ontology Construction Tools
Murshed, Md. Ahsan-ul
Singh, Ramanjit
QA075 Electronic computers. Computer science
The emphasis of reusing domain knowledge in system development makes ontology the most important disciplines in the information system industry at present. Many domain specific ontology editors are currently available for developing ontologies. However, selecting the most appropriate editor is a challenge because each ontology construction initiative requires its own budget, time, and resources. Therefore, to overcome this challenge, we propose a criterion to evaluate ontology construction tools. We define evaluation criteria such as functionality, reusability, data storage, complexity, association, scalability, resilience, reliability, robustness, learnability, availability, efficiency, and visibility. Then, on the basis of criteria, we propose a technique to rank ontology tools and finally, we evaluate three ontology construction editors based on the ranking technique.
2005-03
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/747/1/013.pdf
Murshed, Md. Ahsan-ul and Singh, Ramanjit (2005) Evaluation and Ranking of Ontology Construction Tools. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/747/
oai:eprints.biblio.unitn.it:748
2012-02-28T14:17:57Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Semantic Schema Matching
Giunchiglia, Fausto
Shvaiko, Pavel
Yatskevich, Mikalai
QA076 Computer software
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic schema matching is based on the two ideas: (i) we discover mappings by computing semantic relations (e.g., equivalence, more general); (ii) we determine semantic relations by analyzing the meaning (concepts, not labels) which is codified in the elements and the structures of schemas. In this paper we present basic and optimized algorithms for semantic schema matching, and we discuss their implementation within the S-Match system. We also validate the approach and evaluate S-Match against three state of the art matching systems. The results look promising, in particular for what concerns the quality and performance indicators.
2005-03
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/748/1/014.pdf
Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai (2005) Semantic Schema Matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/748/
oai:eprints.biblio.unitn.it:802
2012-02-28T14:18:11Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Multiscaling Reconstruction of Metallic Targets from TE and TM Experimental Data
Azaro, Renzo
Donelli, Massimo
Franceschini, Davide
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
The non invasive imaging of unknown objects is of particular interest in several industrial applications. In this letter, an iterative multi-resolution strategy (IMRS) is applied to the reconstruction of metallic targets from experimental measurements. A representative test case is presented for evaluating the effectiveness of the IMRS in dealing with real data collected in a controlled environment in both TE and TM illuminations.
2005-05
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/802/1/DIT%2D05%2D004.pdf
Azaro, Renzo and Donelli, Massimo and Franceschini, Davide and Massa, Andrea (2005) Multiscaling Reconstruction of Metallic Targets from TE and TM Experimental Data. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/802/
oai:eprints.biblio.unitn.it:814
2012-02-28T14:18:14Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Design of an Integrated Antenna for Automotive Systems
Azaro, Renzo
Boato, Giulia
De Natale, Francesco
Franceschini, Gabriele
Martini, Anna
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
This paper describes the design process of an integrated antenna for an automotive rescue system. In order to fulfill the antenna design requirements in different frequency bands and to minimize the interference phenomena arising from the integration of different classes of antennas in a single device, a two-phases stochastic optimization approach is used. The experimental validation carried out on the developed prototype confirms the effectiveness of the proposed approach.
2005-06
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/814/1/DIT%2D05%2D007.pdf
Azaro, Renzo and Boato, Giulia and De Natale, Francesco and Franceschini, Gabriele and Martini, Anna and Massa, Andrea (2005) Design of an Integrated Antenna for Automotive Systems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/814/
oai:eprints.biblio.unitn.it:816
2012-02-28T14:18:15Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5141:51413735
7375626A656374733D51:5143:5143373630
7375626A656374733D51:5143:51433130302E35
74797065733D746563687265706F7274
Unsupervised Synthesis of Microwave Components by Means of an Evolutionary-Based Tool Exploiting Distributed Computing Resources
Donelli, Massimo
Azaro, Renzo
Massa, Andrea
Raffetto, Mirco
QC661 Electromagnetic Theory
QC760 Electromagnetism
QA075 Electronic computers. Computer science
QC100.5 Measuring Instruments
A parallel implementation of an automatic CAD tool based on the parallel virtual machine software package, genetic algorithms and finite element simulators is presented. It is shown that the parallel implementation can be obtained by developing just a few hundred lines of code and a pseudocode description is provided. Finally, selected numerical results are provided in order to show the effectiveness and the reliability of the proposed approach.
2005-06
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/816/1/DIT%2D05%2D008.pdf
Donelli, Massimo and Azaro, Renzo and Massa, Andrea and Raffetto, Mirco (2005) Unsupervised Synthesis of Microwave Components by Means of an Evolutionary-Based Tool Exploiting Distributed Computing Resources. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/816/
oai:eprints.biblio.unitn.it:817
2012-02-28T14:18:15Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143353031
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Design of a Miniaturized Ism-Band Fractal Antenna
Azaro, Renzo
Boato, Giulia
Donelli, Massimo
Franceschini, Gabriele
Martini, Anna
Massa, Andrea
QC501 Electricity
QC760 Electromagnetism
Miniaturization techniques for antenna design based on fractal geometries are of growing interest in wireless communications. In this letter, the design of a miniaturized fractal antenna prototype is described. Towards this end, a particle swarm optimizer is used to simultaneously optimize the fractal shape as wll as the input impedance by acting on the thickness of the antenna segments to avoid matching networks. The effectiveness of the approach is confirmed by means of simulated as well as experimental results
2005-06
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/817/1/DIT%2D05%2D009.pdf
Azaro, Renzo and Boato, Giulia and Donelli, Massimo and Franceschini, Gabriele and Martini, Anna and Massa, Andrea (2005) Design of a Miniaturized Ism-Band Fractal Antenna. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/817/
oai:eprints.biblio.unitn.it:818
2012-02-28T14:18:15Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Full-Vectorial Three-Dimensional Microwave Imaging Through the Iterative Multi-Scaling Strategy: a Preliminary Assessment
Franceschini, Gabriele
Franceschini, Davide
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
In this paper, a multi-scaling strategy for full-vectorial three-dimensional inverse scattering problems is presented. The approach is fully iterative and it avoids solving any forward problem at each step. Thanks to the adaptive multi-resolution model, which offers considerable flexibility for the inclusion of the a-priori knowledge and of the knowledge acquired during the iterative steps of the multi-scaling process, the overall computational burden is considerably reduced. This allows to balance effectively the trade-off between computational costs and achievable resolution accuracy. The effectiveness of the proposed approach is demonstrated through a selected set of preliminary experiments using homogeneous dielectric scatterers in a noisy synthetic environment.
2005-06
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/818/1/DIT%2D05%2D010.pdf
Franceschini, Gabriele and Franceschini, Davide and Massa, Andrea (2005) Full-Vectorial Three-Dimensional Microwave Imaging Through the Iterative Multi-Scaling Strategy: a Preliminary Assessment. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/818/
oai:eprints.biblio.unitn.it:819
2012-02-28T14:18:16Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143373630
74797065733D746563687265706F7274
Multiscaling Reconstruction of Metallic Targets from Te and Tm Experimental Data
Azaro, Renzo
Donelli, Massimo
Franceschini, Davide
Massa, Andrea
QC661 Electromagnetic Theory
QC760 Electromagnetism
The non invasive imaging of unknown objects is of particular interest in several industrial applications. In this letter, an iterative multi-resolution strategy (IMRS) is applied to the reconstruction of metallic targets from experimental measurements. A representative test case is presented for evaluating the effectiveness of the IMRS in dealing with real data collected in a controlled environment in both TE and TM illuminations.
2005-06
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/819/1/DIT%2D05%2D011.pdf
Azaro, Renzo and Donelli, Massimo and Franceschini, Davide and Massa, Andrea (2005) Multiscaling Reconstruction of Metallic Targets from Te and Tm Experimental Data. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/819/
oai:eprints.biblio.unitn.it:841
2012-02-28T14:18:28Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
An Improved Asymmetric Watermarking Scheme Suitable for Copy Protection
Boato, Giulia
De Natale, Francesco G. B.
Fontanari, Claudio
QA075 Electronic computers. Computer science
A major limitation of some recently proposed asymmetric watermarking techniques based on linear algebra lies in the strong dependence of the watermark on the original image. The present letter suggests an alternative scheme which is not only secure against projection attack but allows also the insertion of arbitrary watermarking sequences.
2005-07
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/841/1/DIT%2D05%2D056.pdf
Boato, Giulia and De Natale, Francesco G. B. and Fontanari, Claudio (2005) An Improved Asymmetric Watermarking Scheme Suitable for Copy Protection. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/841/
oai:eprints.biblio.unitn.it:842
2012-02-28T14:18:28Z
7374617475733D696E7072657373
7375626A656374733D54:5441:5441333239
74797065733D746563687265706F7274
Hierarchical ownership and deterministic watermarking of digital images via polynomial interpolation
Boato, Giulia
De Natale, Francesco G. B.
Fontanari, Claudio
Melgani, Farid
TA329 Engineering mathematics
This paper presents a novel method for the secure management of digital images formulated within the mathematical theory of polynomial interpolation. As main innovative features, our approach is based on a hierarchical joint ownership of the image by a trusted layered authority and on a deterministic watermarking procedure, embedding a short meaningful or random signature into the image. Experimental results show that the inserted signature can almost always be fully recovered even in presence of a reasonable amount of image degradation due to image processing operators, such as filtering, geometric distorsions and compression.
2005-07
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/842/1/DIT%2D05%2D012.pdf
Boato, Giulia and De Natale, Francesco G. B. and Fontanari, Claudio and Melgani, Farid (2005) Hierarchical ownership and deterministic watermarking of digital images via polynomial interpolation. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/842/
oai:eprints.biblio.unitn.it:861
2012-02-28T14:18:35Z
7374617475733D696E7072657373
74797065733D746563687265706F7274
The Constitution of the Not-For-Profit Organisation: Reciprocal Conformity to Morality
Grimalda, Gianluca
Sacconi, Lorenzo
Available in the .pdf file
2004-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/861/1/DP_13_04.pdf
Grimalda, Gianluca and Sacconi, Lorenzo (2004) The Constitution of the Not-For-Profit Organisation: Reciprocal Conformity to Morality. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/861/
oai:eprints.biblio.unitn.it:919
2012-02-28T14:18:48Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Semantic Web Applications: Fields and Business Cases. The Industry Challenges The Research.
Léger, Alain
J.B. Nixon, Léger
Shvaiko, Pavel
Charlet, Jean
QA076 Computer software
Semantic Web technology is being increasingly applied in a large spectrum of applications in which domain knowledge is conceptualized and formalized (e.g., by means of an ontology) in order to support diversified knowledge processing (e.g., reasoning) by machine. Moreover, through the subtle joining of (cognitive) human reasoning and (logical) machine reasoning, it is possible for humans and machines to share complementary tasks. Some examples of application areas where these tasks arise are: corporate portals and knowledge management, e-commerce, e-work, healthcare, e-government, natural language understanding and automated translation, information search, data and services integration, social networks and collaborative filtering, knowledge mining, and so on. From a social and economic perspective, this emerging technology should contribute to growth in economic wealth, but it must also show clear cut value for everyday activities through technological transparency and efficiency. The uptake of Semantic Web technology by industry is progressing slowly. One of the problems is that academia is not always aware of the concrete problems that arise in industry. In contrast, industry is not often well informed about the academic developments that can potentially meet its needs. In this paper we present ongoing work in the cross-fertilization between industry and academy. In particular, we present a collection of application fields and use cases from enterprises which are interested in the promises of Semantic Web technology. We explain our approach by analyzing the industry needs in different application areas. We summarize industrial requirements with respect to Semantic Web technology in the form of a typology of knowledge processing tasks. These results are intended to focus academia on the development of plausible knowledge-based solutions for concrete industrial problems, and therefore, facilitate the industrial uptake of Semantic Web technology.
2005-12
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/919/1/081.pdf
Léger, Alain and J.B. Nixon, Léger and Shvaiko, Pavel and Charlet, Jean (2005) Semantic Web Applications: Fields and Business Cases. The Industry Challenges The Research. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/919/
oai:eprints.biblio.unitn.it:935
2012-02-28T14:18:51Z
7374617475733D696E7072657373
7375626A656374733D54:544B:544B37383835
74797065733D746563687265706F7274
A Syntax-Based Approach to Multiple Description Video Coding
Conci, Nicola
De Natale, Francesco G. B.
TK7885 Computer Engineering
The paper describes an efficient method to achieve Multiple Description Coding (MDC) for video streaming applications. The idea is to use a JPEG-like syntax to represent an ordered sequence of the coefficients, alternately distributed among the two descriptors. The ordering procedure allows an efficient interpolation of the missing coefficients, and then an almost seamless reconstruction from a single descriptor. As compared to other approaches to MDC, the proposed strategy is characterized by an extremely low computational burden, while ensuring comparable overhead and good quality of single-descriptor video. We will consider the basic scheme, where only two descriptions are taken into account, bearing in mind that an extension to more descriptions is feasible with small effort, thanks to the extremely light nature of the encoder and decoder structure.
2005-12
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/935/1/DIT%2D05%2D070.pdf
Conci, Nicola and De Natale, Francesco G. B. (2005) A Syntax-Based Approach to Multiple Description Video Coding. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/935/
oai:eprints.biblio.unitn.it:1003
2012-02-28T14:19:06Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Community-Driven Ontology Matching
V. Zhdanova, Anna
Shvaiko, Pavel
QA076 Computer software
We extend the notion of ontology matching to community-driven ontology matching. Primarily, the idea is to enable Web communities to establish and reuse ontology mappings in order to achieve, within those communities, an adequate and timely domain representation, facilitated knowledge exchange, etc. Secondarily, the matching community is provided with the new practice, which is a public alignment reuse. Specifically, we present an approach to construction of a community-driven ontology matching system and discuss its implementation. An analysis of the system usage indicates that our strategy is promising. In particular, the results obtained justify feasibility and usefulness of the community-driven ontology mappings’ acquisition and sharing.
2006-04
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1003/1/028.pdf
V. Zhdanova, Anna and Shvaiko, Pavel (2006) Community-Driven Ontology Matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1003/
oai:eprints.biblio.unitn.it:1006
2012-02-28T14:19:07Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
To Ackermann-ize or not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT(EUF U T)
Bruttomesso, Roberto
Cimatti, Alessandro
Franzén, Anders
Griggio, Alberto
Santuari, Alessandro
Sebastiani, Roberto
QA076 Computer software
Satisfiability Modulo Theories (SMT(T)) is the problem of deciding the satisfiability of a formula with respect to a given background theory T. When T is the combination of two simpler theories T1 and T2 (SMT(T1 U T2)), a standard and general approach is to handle the integration of T1 and T2 by performing some form of search on the equalities between the shared variables. A frequent and very relevant sub-case of SMT(T1 U T2) is when T1 is the theory of Equality and Uninterpreted Functions (EUF). For this case, an alternative approach is to eliminate first all uninterpreted function symbols by means of Ackermann’s expansion, and then to solve the resulting SMT (T2) problem. In this paper we build on the empirical observation that there is no absolute winner between these two alternative approaches, and that the performance gaps between them are often dramatic, in either direction. We propose a simple technique for estimating a priori the costs and benefits, in terms of the size of the search space of an SMT tool, of applying Ackermann’s expansion to all or part of the function symbols. We have implemented a preprocessor which analyzes the input formula, decides autonomously which functions to expand, performs such expansions and gives the resulting formula as input to an SMT tool. A thorough experimental analysis, including the benchmarks of the SMT’05 competition, shows that our preprocessor performs the best choice(s) nearly always, and that the proposed technique is extremely effective in improving the overall performance of the SMT tool.
2006-05
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1006/1/031.pdf
Bruttomesso, Roberto and Cimatti, Alessandro and Franzén, Anders and Griggio, Alberto and Santuari, Alessandro and Sebastiani, Roberto (2006) To Ackermann-ize or not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT(EUF U T). UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1006/
oai:eprints.biblio.unitn.it:1041
2012-02-28T14:19:14Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
IC-Service: A Service-Oriented Approach to the Development of Recommendation Systems
Birukou, Aliaksandr
Blanzieri, Enrico
D'Andrea, Vincenzo
Giorgini, Paolo
Kokash, Natallia
Modena, Alessio
QA076 Computer software
Recommendation systems have proven to be useful in various application domains. However, current solutions are usually ad-hoc systems which are tightly-coupled with the application domain. We present the IC-Service, a recommendation service that can be included in any system in a loosely coupled way. The implementation follows the principles of service oriented computing and provides a solution to various problems arising in recommendation systems, e.g. to the problem of meta-recommendation systems development. Moreover, when properly configured, the IC-Service can be used by different applications (clients), and several independent instances of the IC-Service can collaborate to produce better recommendations. Service architecture and communication protocols are presented. The paper describes also ongoing work and applications based on the IC-Service.
2006-07
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1041/1/044.pdf
Birukou, Aliaksandr and Blanzieri, Enrico and D'Andrea, Vincenzo and Giorgini, Paolo and Kokash, Natallia and Modena, Alessio (2006) IC-Service: A Service-Oriented Approach to the Development of Recommendation Systems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1041/
oai:eprints.biblio.unitn.it:1047
2012-02-28T14:19:15Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Self-Configuring Socio-Technical Systems: Redesign at Runtime
Bryl, Volha
Giorgini, Paolo
QA076 Computer software
Modern information systems are becoming more and more socio-technical systems, namely systems composed of human (social) agents and software (technical) systems operating together in a common environment. The structure of such systems has to evolve dynamically in response to the changes of the environment. When new requirements are introduced, when an actor leaves the system or when a new actor comes, the socio-technical structure needs to be redesigned and revised. In this paper, an approach to dynamic reconfiguration of a socio-technical system structure in response to internal or external changes is proposed. The approach is based on planning techniques for generating possible alternative configurations, and local strategies for their evaluation. The reconfiguration mechanism is presented, which makes the socio-technical system self-configuring, and the approach is discussed and analyzed on a simple case study.
2006-07
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1047/1/048.pdf
Bryl, Volha and Giorgini, Paolo (2006) Self-Configuring Socio-Technical Systems: Redesign at Runtime. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1047/
oai:eprints.biblio.unitn.it:1070
2012-02-28T14:19:21Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
A Survey of Learning-Based Techniques of Email Spam Filtering
Blanzieri, Enrico
Bryl, Anton
QA076 Computer software
Email spam is one of the major problems of the today’s Internet, bringing financial damage to companies and annoying individual users. Among the approaches developed to stop spam, filtering is an important and popular one. In this paper we give an overview of the state of the art of machine learning applications for spam filtering, and of the ways of evaluation and comparison of different filtering methods. We also provide a brief description of other branches of anti-spam protection and discuss the use of various approaches in commercial and noncommercial anti-spam software solutions.
2006-09
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1070/1/056.pdf
Blanzieri, Enrico and Bryl, Anton (2006) A Survey of Learning-Based Techniques of Email Spam Filtering. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1070/
oai:eprints.biblio.unitn.it:1094
2012-02-28T14:19:27Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D51:5143:5143353031
7375626A656374733D54:544B:544B353130352E35
7375626A656374733D51:5141:51413735
7375626A656374733D51:5143:5143373630
7375626A656374733D51:5143:5143303230
7375626A656374733D51:5143:51433130302E35
74797065733D746563687265706F7274
Synthesis of a Three-Dimensional Triband (L1-L2 GPS and Wi-Fi) Prefractal Tree Antenna
Azaro, Renzo
Zeni, Edoardo
Gazzini, Tommaso
Dallapiccola, Ramona
Massa, Andrea
QC661 Electromagnetic Theory
TK5105.5 Computer Networks
QC501 Electricity
QC760 Electromagnetism
QA075 Electronic computers. Computer science
QC020 Mathematical Physics
QC100.5 Measuring Instruments
In this letter, the synthesis of a 3D wire antenna with a tree-like shape and operating at three different frequency bands (L1-L2 GPS bands and Wi-Fi) is presented. The Geometrical parameters of the antenna are determined by means of a particle swarm-based optimization procedure exploiting the degrees of freedom of the reference tree geometry for fitting the electrical project costraints. The results of the numerical simulation are shown and compared with those for experimental measurements for assessing the effectiveness of the synthesis procedure.
2006-11
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1094/1/DIT%2D06%2D068.pdf
Azaro, Renzo and Zeni, Edoardo and Gazzini, Tommaso and Dallapiccola, Ramona and Massa, Andrea (2006) Synthesis of a Three-Dimensional Triband (L1-L2 GPS and Wi-Fi) Prefractal Tree Antenna. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1094/
oai:eprints.biblio.unitn.it:1097
2012-02-28T14:19:28Z
7374617475733D696E7072657373
7375626A656374733D54:5431:54323031
74797065733D746563687265706F7274
Dualband GPS-WiFi Antenna
Massa, Andrea
Laboratory, Eledia
T201 Patents. Trademarks
Project and design of a Dualband GPS-WiFi Antenna
2006-11
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1097/1/DIT%2D06%2D071.pdf
Massa, Andrea and Laboratory, Eledia (2006) Dualband GPS-WiFi Antenna. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1097/
oai:eprints.biblio.unitn.it:1133
2013-01-29T09:05:04Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
7375626A656374733D4B:4B31
74797065733D7072657072696E74
Il “Signore degli anelli” nel ciberspazio: controllo delle informazioni e Digital Rights Management
Caso, Roberto
QA075 Electronic computers. Computer science
K Law (General)
Versione 1.0 - settembre 2006. - Articolo in corso di pubblicazione in M. BORGHI, M. L. MONTAGNANI (curr.), “Proprietà digitale” – Diritto d’autore, nuove tecnologie, e Digital Rights Management – Atti del Convegno svoltosi a Milano il 18 novembre 2005 presso l’Università Commerciale Luigi Bocconi, casa editrice Egea di Milano. Questa versione 1.0 – settembre 2006 in pdf - © 2006 Roberto Caso – è pubblicata con licenza Creative Commons Attribuzione-NonCommerciale-NoOpereDerivate 2.5 Italy. Tale licenza consente l’uso non commerciale dell’opera, a condizione che ne sia sempre data attribuzione all’autore (per maggiori informazioni visita il sito: http://creativecommons.org/licenses/by-nc-nd/2.5/it/).
2006-09
Preprint
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1133/1/Roberto_Caso.DRM.Signore_degli_anelli.pdf
Caso, Roberto (2006) Il “Signore degli anelli” nel ciberspazio: controllo delle informazioni e Digital Rights Management. [Preprint] (In Press)
http://eprints.biblio.unitn.it/1133/
oai:eprints.biblio.unitn.it:1142
2012-02-28T14:19:45Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
A Framework for Rapid Integration of Presentation Components
Yu, Jin
Benatallah, Boualem
Saint-Paul, Regis
Casati, Fabio
Daniel, Florian
Matera, Maristella
QA076 Computer software
The development of user interfaces (UIs) is one of the most time-consuming aspects in software development. In this context, the lack of proper reuse mechanisms for UIs is increasingly becoming manifest, especially as software development is more and more moving toward composite applications. In this paper we propose a framework for the integration of stand-alone modules or applications, where integration occurs at the presentation layer. Hence, the final goal is to reduce the effort required for UI development by maximizing reuse. The design of the framework is inspired by lessons learned from application integration, appropriately modified to account for the specificity of the UI integration problem. We provide an abstract component model to specify characteristics and behaviors of presentation components and propose an event-based composition model to specify the composition logic. Components and composition are described by means of a simple XML-based language, which is interpreted by a runtime middleware for the execution of the resulting composite application. A proof-of-concept prototype allows us to show that the proposed component model can also easily be applied to existing presentation components, built with different languages and/or component technologies.
2006-12
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1142/1/100.pdf
Yu, Jin and Benatallah, Boualem and Saint-Paul, Regis and Casati, Fabio and Daniel, Florian and Matera, Maristella (2006) A Framework for Rapid Integration of Presentation Components. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1142/
oai:eprints.biblio.unitn.it:1190
2012-02-28T14:19:58Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Collaborative Case Retrieval within the Implicit Culture Framework
Birukou, Aliaksandr
Blanzieri, Enrico
Giorgini, Paolo
Weiss, Michael
QA075 Electronic computers. Computer science
The retrieval of cases plays important role in CBR systems. Current solutions to the problem of case retrieval adopt various similarity metrics such as utility-based, adaptation-guided similarity, and collaborative retrieval. In this paper, we present a collaborative architecture for case retrieval, where users share their experience in using cases and interact with one another by means of software agents. Past experiences are used to improve case retrieval. We describe a system for choosing software patterns as an implementation of the proposed architecture. Experimental results show that the system performs better than conventional retrieval engines.
2007-02
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1190/1/015.pdf
Birukou, Aliaksandr and Blanzieri, Enrico and Giorgini, Paolo and Weiss, Michael (2007) Collaborative Case Retrieval within the Implicit Culture Framework. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1190/
oai:eprints.biblio.unitn.it:1244
2012-02-28T14:27:16Z
oai:eprints.biblio.unitn.it:1252
2012-02-28T14:20:22Z
7374617475733D696E7072657373
7375626A656374733D54:544B:544B353130352E35
74797065733D746563687265706F7274
A Planar Electronically Reconfigurable Wi-Fi Band Antenna Based on a Parasitic Microstrip Structure
Donelli, Massimo
Azaro, Renzo
Fimognari, Luca
Massa, Andrea
TK5105.5 Computer Networks
This report presents the result of the synthesis of an horizontally polarized reconfigurable microstrip antenna.
2007-07
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1252/1/DIT%2D07%2D050.pdf
Donelli, Massimo and Azaro, Renzo and Fimognari, Luca and Massa, Andrea (2007) A Planar Electronically Reconfigurable Wi-Fi Band Antenna Based on a Parasitic Microstrip Structure. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1252/
oai:eprints.biblio.unitn.it:1257
2012-02-28T14:20:24Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D54:544B:544B37383835
74797065733D746563687265706F7274
Memory Enhanced PSO-Based Optimization Approach for Smart Antennas Control in Complex Interference Scenario
Benedetti, Manuel
Azaro, Renzo
Massa, Andrea
TK7885 Computer Engineering
QC661 Electromagnetic Theory
In the framework of control methods for adaptive phased-arrays, this paper deals with complex communication scenarios by considering a memory-enhanced cooperative algorithm. Compared to existing approaches where far-field interferences are taken into account, the proposed analysis considers a more realistic situation where the jamming sources are located either in the near-field or in the far-field of the receiving antenna. In order to carefully address the arising challenges and to effectively deal with such complex environments, an optimization approach based on an enhanced PSO-based algorithm is used. The obtained results seem to confirm the effectiveness of the proposed technique in terms of both signal-to-noise ratio and computational costs and complexity.
2007-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1257/1/DIT%2D07%2D051.pdf
Benedetti, Manuel and Azaro, Renzo and Massa, Andrea (2007) Memory Enhanced PSO-Based Optimization Approach for Smart Antennas Control in Complex Interference Scenario. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1257/
oai:eprints.biblio.unitn.it:1260
2012-02-28T14:27:17Z
oai:eprints.biblio.unitn.it:1267
2012-02-28T14:20:26Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Semantic Matching
Giunchiglia, Fausto
Shvaiko, Pavel
Yatskevich, Mikalai
QA076 Computer software
Not available.
2007-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1267/1/064.pdf
Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai (2007) Semantic Matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1267/
oai:eprints.biblio.unitn.it:1268
2012-02-28T14:20:26Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Background knowledge in ontology matching
Giunchiglia, Fausto
Shvaiko, Pavel
Yatskevich, Mikalai
QA076 Computer software
Ontology matching is a critical operation in many well-known metadata intensive applications, such as data integration and peer-to-peer information sharing. Typically, heterogeneity in these applications is reduced in two steps: (i) matching ontologies to determine correspondences and (ii) executing correspondences according to an application needs (e.g., data translation). In this position statement paper we focus only on the first, i.e., matching step. In particular, we think of matching as an operation that takes two graph-like structures, such as lightweight ontologies [7], and produces a set of correspondences between the nodes of the graphs that correspond semantically to each other [8, 11]. Many diverse solutions of matching have been proposed so far, see [17, 19] for surveys. Also, recently this topic has been given a book account in [4]. It is worth noting that, on the one side, schema matching is usually performed with the help of techniques trying to guess the meaning encoded in the schemas. On the other side, ontology matching systems primarily try to exploit knowledge explicitly encoded in the ontologies. In real-world applications, various data and conceptual models usually have both well defined and obscure terms, and contexts in which they occur, therefore, solutions from both problems would be mutually beneficial [19]. Similar ideas of cross-fertilization among databases and artificial intelligence in the field of matching were also put forward in [16, 18]. Let us discuss one of the challenges in the matching area, which is the lack of background knowledge in matching tasks [9]. We believe that this challenge can be best tackled from the multi-disciplinary viewpoint, by building on top of the experiences in various communities, including databases, artificial intelligence and semantic web.
2007-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1268/1/065.pdf
Giunchiglia, Fausto and Shvaiko, Pavel and Yatskevich, Mikalai (2007) Background knowledge in ontology matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1268/
oai:eprints.biblio.unitn.it:1345
2012-02-28T14:21:01Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
A Large Scale Dataset for the Evaluation of Ontology Matching Systems
Giunchiglia, Fausto
Yatskevich, Mikalai
Avesani, Paolo
Shvaiko, Pavel
QA076 Computer software
Recently, the number of ontology matching techniques and systems has increased significantly. This makes the issue of their evaluation and comparison more severe. One of the challenges of the ontology matching evaluation is in building large scale evaluation datasets. In fact, the number of possible correspondences between two ontologies grows quadratically with respect to the numbers of entities in these ontologies. This often makes the manual construction of the evaluation datasets demanding to the point of being infeasible for large scale matching tasks. In this paper we present an ontology matching evaluation dataset composed of thousands of matching tasks, called TaxME2. It was built semi-automatically out of the Google, Yahoo and Looksmart web directories. We evaluated TaxME2 by exploiting the results of almost two dozen of state of the art ontology matching systems. The experiments indicate that the dataset possesses the desired key properties, namely it is error-free, incremental, discriminative, monotonic, and hard for the state of the art ontology matching systems. The paper has been accepted for publication in "The Knowledge Engineering Review", Cambridge Universty Press (ISSN: 0269-8889, EISSN: 1469-8005).
2008-01
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1345/1/001.pdf
Giunchiglia, Fausto and Yatskevich, Mikalai and Avesani, Paolo and Shvaiko, Pavel (2008) A Large Scale Dataset for the Evaluation of Ontology Matching Systems. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1345/
oai:eprints.biblio.unitn.it:1402
2012-02-28T14:21:35Z
7374617475733D696E7072657373
7375626A656374733D51:5143:5143363631
7375626A656374733D54:544B:544B37383835
7375626A656374733D51:5143:5143373630
7375626A656374733D54:5431:5435352E34
7375626A656374733D54:5441:5441333239
74797065733D746563687265706F7274
Morphological Processing of Electromagnetic Scattering Data for Enhancing the Reconstruction Accuracy of the Iterative Multi-Scaling Approach
Franceschini, Davide
Rosani, Andrea
Donelli, Massimo
Pastorino, Matteo
Massa, Andrea
TK7885 Computer Engineering
QC661 Electromagnetic Theory
T055.4 Industrial Engineering
QC760 Electromagnetism
TA329 Engineering mathematics
This work is aimed at presenting a methodology that exploits the scattered electromagnetic radiation collected on a measurement region outside the area under investigation to locate and characterize multiple unknown profiles. In many practical cases, an accurate quantitative imaging of the scenario under test is required and it can be reached by using a high resolution representation of the dielectric profile of the scatterers. Towards this aim, an enhanced iterative multi-resolution procedure that exploits a morphological processing for detecting and focusing on different non-connected regions-of-interest is developed. A suitable set of representative numerical results is presented for demonstrating that the proposed approach is able to efficiently detect the objects located in the test domain and to enhance the accuracy in reconstructing multiple scatterers
2008-03
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1402/1/DISI%2D08%2D016.pdf
Franceschini, Davide and Rosani, Andrea and Donelli, Massimo and Pastorino, Matteo and Massa, Andrea (2008) Morphological Processing of Electromagnetic Scattering Data for Enhancing the Reconstruction Accuracy of the Iterative Multi-Scaling Approach. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1402/
oai:eprints.biblio.unitn.it:1461
2012-02-28T14:21:58Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Ten Challenges for Ontology Matching
Shvaiko, Pavel
Euzenat, Jerome
QA075 Electronic computers. Computer science
This paper aims at analyzing the key trends and challenges of the ontology matching field. The main motivation behind this work is the fact that despite many component matching solutions that have been developed so far, there is no integrated solution that is a clear success, which is robust enough to be the basis for future development, and which is usable by non expert users. In this paper we first provide the basics of ontology matching with the help of examples. Then, we present general trends of the field and discuss ten challenges for ontology matching, thereby aiming to direct research into the critical path and to facilitate progress of the field.
2008-08
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1461/1/042.pdf
Shvaiko, Pavel and Euzenat, Jerome (2008) Ten Challenges for Ontology Matching. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1461/
oai:eprints.biblio.unitn.it:1494
2012-02-28T14:22:06Z
7374617475733D696E7072657373
7375626A656374733D51:5141:5141303633
74797065733D746563687265706F7274
Neighborhood Counting Measure Metric and Minimum Risk Metric: An empirical comparison
Argentini, Andrea
Blanzieri, Enrico
QA063 Problem solving
Wang in a PAMI paper proposed Neighborhood Counting Measure (NCM) as a similarity measure for the k-nearest neighbors classification algorithm. In his paper, Wang mentioned Minimum Risk Metric (MRM) an earlier method based on the minimization of the risk of misclassification. However, Wang did not compare NCM with MRM because of its allegedly excessive computational load. In this letter, we empirically compare NCM against MRM on k-NN with k=1, 3, 5, 7 and 11 with decision taken with a voting scheme and k=21 with decision taken with a weighted voting scheme on the same datasets used by Wang. Our results shows that MRM outperforms NCM for most of the k values tested. Moreover, we show that the MRM computation is not so probihibitive as indicated by Wang. ©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
2008-10
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1494/1/057.pdf
Argentini, Andrea and Blanzieri, Enrico (2008) Neighborhood Counting Measure Metric and Minimum Risk Metric: An empirical comparison. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1494/
oai:eprints.biblio.unitn.it:1500
2012-02-28T14:22:07Z
7374617475733D696E7072657373
74797065733D7072657072696E74
Open access: scelte istituzionali e ruolo del diritto d'autore
Vezzoso , Simonetta
Negli ultimi anni si sono moltiplicate le iniziative di enti di ricerca, università, enti erogatori di fondi di ricerca, di promozione del libero accesso ai risultati della ricerca scientifica (c.d. open access). Il contributo propone una breve analisi di tre di quelle politiche istituzionali (National Institutes of Health, Law School dell’Università di Harvard e Istituto Superiore di Sanità), dal diverso grado di vincolatività nei confronti dei ricercatori/autori e, presumibilmente, anche di efficacia. Se la sperimentazione, su scala genuinamente globale, delle politiche istituzionali a favore dell’open access rimane estremamente importante, il contributo termina sostenendo la necessità di un intervento legislativo in tema di diritto d’autore, che promuova un nuovo bilanciamento fra gli interessi di chi sfrutta economicamente le pubblicazioni scientifiche e le esigenze della ricerca.
2008-10
Preprint
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1500/1/OA_Vezzoso_pre%2Dprint.pdf
Vezzoso , Simonetta (2008) Open access: scelte istituzionali e ruolo del diritto d'autore. [Preprint] (In Press)
http://eprints.biblio.unitn.it/1500/
oai:eprints.biblio.unitn.it:1511
2012-02-28T14:22:10Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413735
74797065733D746563687265706F7274
Decentralized Ranking in Large-Scale Overlay Networks
Montresor, Alberto
Jelasity, Mark
Babaoglu, Ozalp
QA075 Electronic computers. Computer science
Modern distributed systems are often characterized by very large scale, poor reliability, and extreme dynamism of the participating nodes, with a continuous flow of nodes joining and leaving the system. In order to develop robust applications in such environments, middleware services aimed at dealing with the inherent unpredictability of the underlying networks are required. One such service is aggregation. In the aggregation problem, each node is assumed to have attributes. The task is to extract global information about these attributes and make it available to the nodes. Examples include the total free storage, the average load, or the size of the network. Efficient protocols for computing several aggregates such as average, count, and variance have already been proposed. In this paper, we consider calculating the rank of nodes, where the set of nodes has to be sorted according to a numeric attribute and each node must be informed about its own rank in the global sorting. This information has a number of applications, such as slicing. It can also be applied to calculate the median or any other percentile. We propose T-Rank, a robust and completely decentralized algorithm for solving the ranking problem with minimal assumptions. Due to the characteristics of the targeted environment, we aim for a probabilistic approach and accept minor errors in the output. We present extensive empirical results that suggest near logarithmic time complexity, scalability and robustness in different failure scenarios.
2008-12
Departmental Technical Report
PeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1511/1/081.pdf
Montresor, Alberto and Jelasity, Mark and Babaoglu, Ozalp (2008) Decentralized Ranking in Large-Scale Overlay Networks. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1511/
oai:eprints.biblio.unitn.it:1530
2012-02-28T14:22:18Z
7374617475733D696E7072657373
7375626A656374733D51:5141:51413736
74797065733D746563687265706F7274
Results of the Ontology Alignment Evaluation Initiative 2008
Caracciolo, Caterina
Euzenat, Jérôme
Hollink, Laura
Ichise, Ryutaro
Isaac, Antonie
Malaisé, Véronique
Meilicke, Christian
Pane, Juan
Shvaiko, Pavel
Stuckenschmidt, Heiner
Šváb-Zamazal, Ondˇrej
Svátek, Vojtˇech
QA076 Computer software
Ontology matching consists of finding correspondences between ontology entities. OAEI campaigns aim at comparing ontology matching systems on precisely defined test sets. Test sets can use ontologies of different nature (from expressive OWL ontologies to simple directories) and use different modalities, e.g., blind evaluation, open evaluation, consensus. OAEI-2008 builds over previous campaigns by having 4 tracks with 8 test sets followed by 13 participants. Following the trend of previous years, more participants reach the forefront. The official results of the campaign are those published on the OAEI web site.
2008-12
Departmental Technical Report
NonPeerReviewed
application/pdf
http://eprints.biblio.unitn.it/1530/1/083.pdf
Caracciolo, Caterina and Euzenat, Jérôme and Hollink, Laura and Ichise, Ryutaro and Isaac, Antonie and Malaisé, Véronique and Meilicke, Christian and Pane, Juan and Shvaiko, Pavel and Stuckenschmidt, Heiner and Šváb-Zamazal, Ondˇrej and Svátek, Vojtˇech (2008) Results of the Ontology Alignment Evaluation Initiative 2008. UNSPECIFIED. (In Press)
http://eprints.biblio.unitn.it/1530/
metadataPrefix%3Doai_dc%26offset%3D1531%26set%3D7374617475733D696E7072657373