Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aleta M. Lapone

dblp:23/11127 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 100%
Computer networks
1 paper
Network management and operations · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › watermarking
text watermarking
0.011998
Document identification for copyright protection using centroid detection · IEEE Trans. Commun. 1998
Digital forensics and information hiding
watermarking
0.011998
Document identification for copyright protection using centroid detection · IEEE Trans. Commun. 1998
Network management and operations
network verification
0.011989
An algorithmic procedure for checking safety properties of protocols · IEEE Trans. Commun. 1989
Network management and operations
protocol verification
0.011989
An algorithmic procedure for checking safety properties of protocols · IEEE Trans. Commun. 1989
Automata and formal languages › infinite-state systems › channel systems
communicating finite state machines
0.011989
An algorithmic procedure for checking safety properties of protocols · IEEE Trans. Commun. 1989
Automata and formal languages
finite automata
0.011989
An algorithmic procedure for checking safety properties of protocols · IEEE Trans. Commun. 1989

Methods — techniques the papers use, named apart from their topics

centroid detection · 0.0state reduction · 0.0observational equivalence · 0.0incremental composition · 0.0
YearPublicationVenuePosition
1998 Document identification for copyright protection using centroid detection
abstract
A way to discourage illicit reproduction of copyrighted or sensitive documents is to watermark each copy before distribution. A unique mark is embedded in the text whose recipient is registered. The mark can be extracted from a possibly noisy illicit copy, identifying the registered recipient. Most image marking techniques are vulnerable to binarization attack and, hence, not suitable for text marking. We propose a different approach where a text document is marked by shifting certain text lines slightly up or down or words slightly left or right from their original positions. The shifting pattern constitutes the mark and is different on different copies. In this paper we develop and evaluate a method to detect such minute shifts. We describe a marking and identification prototype that implements the proposed method. We present preliminary experimental results which suggest that centroid detection performs remarkably well on line shifts even in the presence of severe distortions introduced by printing, photocopying, scanning, and facsimile transmission.
Steven H. Low, Nicholas F. Maxemchuk, Aleta M. Lapone
IEEE Trans. Commun.3
1989 An algorithmic procedure for checking safety properties of protocols
abstract
A procedure for checking safety properties of communication protocols is presented. A protocol is specified as a collection of communicating finite-state machines (FSMs). Two novel algorithms used in this procedure are described. The first algorithm does incremental composition and reduction of FSMs. It uses three heuristic rules which reduce the number of states in the global FSM by one to two orders of magnitude while maintaining its observational equivalence. The second algorithm checks whether the behavior of one FSM is a subset of another FSM's behavior. This procedure has been applied to the ISDN Q.931 and alternating bit protocols.>
Krishan K. Sabnani, Aleta M. Lapone, M. Ümit Uyar
IEEE Trans. Commun.2