M. Damiani

University of Milan

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Maria Luisa Damiani

University of Milan

P. Olivo

University of Ferrara

B. Riccò

University of Bologna

M. Favalli

University of Ferrara

Giovanni De Micheli

École Polytechnique Fédérale de Lausanne

Francesca Cagnacci

Fondazione Edmund Mach

S. Ercolani

University of Bologna

Alessandro Bogliolo

University of Urbino

Sabrina Gaito

Laboratoire d'Informatique de Paris-Nord

Benjamin Robira

Fondazione Edmund Mach

Cooperative Institutions

European Organization for Nuclear Research

University of Milan

Centre National de la Recherche Scientifique

Agencia de Medio Ambiente y Agua de Andalucía

Université Paris Cité

Stanford University

Iberia (Spain)

University of Bologna

Junta de Andalucía

Institut National de Physique Nucléaire et de Physique des Particules

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Don't care set specifications in combinational and synchronous logic circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (1993)

M. Damiani Giovanni De Micheli

A unified framework for the specification and computation of don't care conditions for combinational and synchronous multiple-level digital circuits is presented. Circuits are characterized in terms of graphs, logic functions and don't care conditions induced by the external and internal interconnections. The replacement of a gate in a synchronous logic network is modeled by a perturbation of the corresponding logic function, and it is shown that the don't care conditions for the gate optimization represent the bound on this perturbation. Algorithms to compute such don't care conditions in both the combinational and synchronous case are presented. The implementation of the algorithms and the experimental results are discussed.< >

Combinational logic

Sequential logic

10.1109/43.215001

Cite

Citations (50)

Analysis and design of linear finite state machines for signature analysis testing

IEEE Transactions on Computers (1991)

M. Damiani P. Olivo B. Riccò

The authors present a theoretical investigation of the aliasing error probability (AEP) in signature analysis testing by means of linear finite state machines (LFSMs). The equations of the resulting Markov chain model of the LFSM are solved to determine an exact expression of the AEP as a function of the main LFSM features and of the relevant parameters of the testing environment. This expression is used to prove criteria for the synthesis of LFSMs with minimum asymptotic and transient AEP. A fundamental lower bound on the AEP is presented, which represents the performance limit of any LFSM with respect to aliasing minimization. It is shown that the AEP in machines realizing counters mod 2/sup k/-1 is the closest to such a bound, in particular periodically reaching it.< >

Aliasing

Signature (topology)

Expression (computer science)

Minification

10.1109/12.83659

Cite

Citations (35)

Corrigendum to “Born to be wild: Captive-born and wild Iberian lynx (Lynx pardinus) reveal space-use similarities when reintroduced for species conservation concerns” [Biol. Conserv. 294 (2024) 110646]

Biological Conservation (2024)

Pablo Cisneros-Araújo Germán Garrote Andrea Corradini Mohammad S. Farhadinia Benjamin Robira

10.1016/j.biocon.2024.110699

Cite

Citations (0)

Aliasing in signature analysis testing with multiple-input shift-registers

M. Damiani P. Olivo M. Favalli Sara Ercolani B. Riccò

Signature analysis with multiple-input shift registers (MISRs) is often used to realize efficient built-in self-test of digital VLSI circuits. The authors present a statistical theory that explains the dependence of aliasing probability on the main MISR features, such as length and feedback network, and thus makes it possible to prove criteria for the MISR design. The assumption of independent errors at the register inputs is used to model the register behavior as a Markov process, whose equations are then solved to obtain the exact dependence of aliasing probability as a function of test length, input error probabilities, and feedback structure.< >

Aliasing

Signature (topology)

10.1109/etc.1989.36262

Cite

Citations (33)

Aliasing in signature analysis testing with multiple input shift registers

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (1990)

M. Damiani P. Olivo M. Favalli S. Ercolani B. Riccò

An investigation of the properties of multiple input shift registers for signature analysis is presented. The assumption of independent errors at the register inputs has been used to model the register behavior as a Markov process whose equations have been solved to obtain the exact dependence of aliasing probabilities as a function of test length, input error probabilities, and feedback structure. Some unique featured of maximum-length registers are proven. Accurate simplified expressions of aliasing probability are derived for use as tools in the evaluation of the coverage.< >

Aliasing

Signature (topology)

10.1109/43.62779

Cite

Citations (58)

StopTracker: Real-time Monitoring of Visitor Stops and Preferences Using UWB Trajectory Streams

M. Damiani Venkata Sudheer Siddabattula Davide Vecchia Gian Pietro Picco Maria Luisa Damiani

Visitor pattern

10.1145/3678717.3691276

Cite

Citations (0)

Synthesis of self-testing finite state machines from high-level specification

Vishwani D. Agrawal R.D. Blanton M. Damiani

Current approaches to self test consist of adding hardware to the already synthesized circuits to transform them into autonomous finite state machines. If the circuit's own function is used for test generation and or data compression, then the fault coverage and aliasing properties have to be obtained by simulation. In this paper, we give a function-level specification for the self-test problem. In the self-test mode, all primary inputs and outputs are latched. The circuit behaves as an autonomous finite-state machine, which executes an Euler walk of all states. Thus, each state is visited exactly once, with all states forming a closed path in the state transition graph of the test machine. This function is embedded in the high-level description of the given finite state machine. The self-test hardware thus undergoes the same optimization process as the machine hardware, with a chance of better area/timing optimization. Up to 100% fault coverage against all single/multiple faults can be achieved if the appropriate synthesis/optimization tools are used. On completion of self-test the signature, consisting of the states of all flip-flops, is shown to have an aliasing probability 2/sup -m/ when the circuit has m flip-flops and the fault corrupts a single state-transition.

Aliasing

Sequential logic

Code coverage

10.1109/test.1996.557135

Cite

Citations (3)

MigrO

Maria Luisa Damiani Hamza Issa Giuseppe Fotino M. Damiani Nathan Ranc

We present MigrO, a clustering environment for the extraction of individual mobility patterns from GPS trajectories, relying on the notion of stay region [1]. A stay region is an 'attractive' area where the moving object resides for a period, possibly experiencing arbitrarily long periods of absence, before moving to a more attractive stay region. The core component is the SeqScan algorithm for the extraction of temporally ordered sequences of stay regions grounded on the notion of presence. An additional set of functionalities support trajectory pre-processing and clustering evaluation. MigrO is developed as plug-in for the open-source QuantumGIS system thus can exploit the rich set of functionalities of the hosting system, offering a formidable platform for the analysis of the mobility behavior. In this demonstration, we present MigrO at work in two case studies, both from the domain of animal ecology, illustrating two kinds of behavior, the migratory behavior and the exploratory behavior of two species of animals.

Component (thermodynamics)

10.1145/2820783.2820794

Cite

Citations (6)

Replication Data for: Cluster-based trajectory segmentation with local noise ind1.tab

Harvard Dataverse (2018)

M. Damiani

Replication

10.7910/dvn/jcicnl/vbukwb

Cite

Citations (0)

Discovering Gatherings Based on Individual Mobility Patterns: Challenges and Direction

2022 IEEE International Conference on Data Mining Workshops (ICDMW) (2017)

M. Damiani Maria Luisa Damiani Hamza Issa

Given a database of spatial trajectories reporting the movement of a set of objects in a time frame, the problem is to discover the groups of objects that stay in close proximity within a geographical area for a significant time. To deal with the problem, techniques for the discovery of collective patterns, e.g. the meeting pattern, have been proposed. Such techniques, however, impose stringent constraints on the object movement. In this paper we investigate a generalized, flexible approach that builds on the idea of expressing the collective pattern as sum of individual behaviors. We present a technique called k-Gathering for the discovery of gatherings of at least k objects, which leverages a recent method for the discovery of stop-and-move patterns. The experiments, conducted on both synthetic and real data, show that the direction is promising and that the approach can be effective also on low sampling rate trajectories.

10.1109/icdmw.2017.41

Cite

Citations (0)