39083116
Data hiding in digital binary image
This paper proposes a new method to embed data in binary images, including scanned text, figures and signatures. The method manipulates "flippable" pixels and uses shuffling to embed a significant amount of data without causing noticeable artifacts. The extraction of the hidden data does not require the original image. Potential applications include detecting unauthorized use of a digitized signature and authenticating binary documents.
698019
A statistical watermark detection technique without using original images for resolving rightful ownerships of digital images
Digital watermarking has been proposed as the means for copyright protection of multimedia data. Many of existing watermarking schemes focused on the robust means to mark an image invisibly without really addressing the ends of these schemes. This paper first discusses some scenarios in which many current watermarking schemes fail to resolve the rightful ownership of an image. The key problems are then identified, and some crucial requirements for a valid invisible watermark detection are discussed. In particular, we show that, for the particular application of resolving rightful ownership using invisible watermarks, it might be crucial to require that the original image not be directly involved in the watermark detection process. A general framework for validly detecting the invisible watermarks is then proposed. Some requirements on the claimed signature/watermarks to be used for detection are discussed to prevent the existence of any counterfeit scheme. The optimal detection strategy within the framework is derived. We show the effectiveness of this technique based on some visual-model-based watermark encoding schemes.
2849367
Temporal segmentation of video using frame and histogram space
Two algorithms are presented for the detection of gradual transitions in video sequences. The first is a dissolve detection algorithm utilizing certain properties of a dissolve's trajectory in image-space. It is implemented both as a simple threshold-based detector, and as a parametric detector by modeling the error properties of the extracted statistics. The second is an algorithm to detect a wide variety of wipes based on image histogram characteristics during such transitions. Both algorithms operate in the compressed domain, requiring only partial decoding of the compressed video stream. Experiments show the algorithms perform as well as-and in some cases, better than-full-frame methods, on a wide variety of gradual transitions, and can operate significantly faster than real-time.
40457509
Temporal segmentation of video using frame and histogram space
Two algorithms are presented for the detection of gradual transitions in video sequences. The first is a dissolve detection algorithm utilizing certain properties of a dissolve's trajectory in image-space. It is implemented both as a simple threshold-based detector, and as a parametric detector by modeling the error properties of the extracted statistics. The second is an algorithm to detect a wide variety of wipes based on image histogram characteristics during such transitions. Both algorithms operate in the compressed domain, requiring only partial decoding of the compressed video stream. Experiments show the algorithms perform as well as-and in some cases, better than-full-frame methods, on a wide variety of gradual transitions, and can operate significantly faster than real-time.
36301624
Some results on integral sum graphs
Abstract Let Z denote the set of all integers. The integral sum graph of a finite subset S of Z is the graph (S,E) with vertex set S and edge set E such that for u,v∈S, uv∈E if and only if u+v∈S . A graph G is called an integral sum graph if it is isomorphic to the integral sum graph of some finite subset S of Z . The integral sum number of a given graph G , denoted by ζ(G) , is the smallest number of isolated vertices which when added to G result in an integral sum graph. Let ⌈x⌉ denote the least integer not less than the real x . In this paper, we (i) determine the value of ζ(K n −E(K r )) for r⩾⌈2n/3⌉−1 , (ii) obtain a lower bound for ζ(K n −E(K r )) when 2⩽r and n⩾5 , showing by construction that the bound is sharp when r=2 , and (iii) determine the value of ζ(K r,r ) for r⩾2 . These results provide partial solutions to two problems posed by Harary (Discrete Math. 124 (1994) 101–108). Finally, we furnish a counterexample to a result on the sum number of K r,s given by Hartsfiedl and Smyth (Graphs and Matrices, R. Rees (Ed.), Marcel, Dekker, New York, 1992, pp. 205–211).
14837083
A Transactional Approach to Parallel Data Warehouse Maintenance
Data Warehousing is becoming an increasingly important technology for information integration and data analysis. Given the dynamic nature of modern distributed environments, both source data and schema changes are likely to occur autonomously and even concurrently in different sources. We have thus developed a comprehensive solution approach, called TxnWrap, that successfully maintains the warehouse views under any type of concurrent source updates. In this work, we now overcome TxnWrap's restriction that the maintenance is processed one by one for each source update, since that limits the performance. To overcome this limitation, we exploit the transactional approach of TxnWrap to achieve parallel data warehouse maintenance. For this, we first identify the read/write conflicts among the different warehouse maintenance processes. We then propose a parallel maintenance scheduler (PMS) that generates legal schedules that resolve these conflicts. PMS has been implemented and incorporated into our TxnWrap system. The experimental results confirm that our parallel maintenance scheduler significantly improves the performance of data warehouse maintenance.
8584874
Throughput Optimization and Fair Bandwidth Allocation in Multi-Hop Wireless LANs
There is an inherent well-known conflict between fairness and throughput that arises in many networking scenarios. A number of researchers have studied this problem in the context of (single-hop) wireless local area networks (WLANs), where clients directly exchange traffic with access points (APs). More recently, researchers have proposed multi-hop extensions to WLANs where client traffic is forwarded via a series of client-client links. In this paper, we show that the objective of improving throughput without sacrificing fairness can be much better met in multi-hop WLANs. We decouple this objective into two separate but related problems. First, we need an algorithm to organize clients into a multi-hop structure such that fair bandwidth allocation within this structure leads to improved throughput. Second, we need algorithms for performing fair bandwidth allocation within the determined multi-hop structure. In this paper, we first design optimal fair bandwidth allocation algorithms for both max-min throughput fairness and max-min time fairness in multi-hop WLANs. Subsequently, we design an efficient algorithm to find desirable multi-hop structures. With slight modifications, our results in this paper can be generalized to other multi-hop wireless networks as well. Our proposed solutions seamlessly integrate with legacy devices and hence are incrementally deployable. Simulation results demonstrate that our solutions can effectively improve throughput (by up to 114% or more) as well as network coverage while preserving fairness.
7263630
On TCP and self-similar traffic
We re-examine the same TCP trace that was used by Veres et al. [A. Veres, M. Boda, The chaotic nature of TCP congestion control, in: Proceedings of the IEEE INFOCOM, 2000] to claim that TCP creates self-similar traffic. A careful reassessment of their data analysis shows that this claim is not justified and suggests that the TCP trace in question is not consistent with (asymptotic second-order) self-similarity or long-range dependence (LRD). We illustrate the reasons that led to the claim in [A. Veres, M. Boda, The chaotic nature of TCP congestion control, in: Proceedings of the IEEE INFOCOM, 2000] and provide some practical guidelines for assessing a statistical characteristic of trace data such as LRD that is defined in strictly asymptotic terms. Our conclusion is in full agreement with the findings obtained from analyzing a much longer TCP trace (resulting from repeating the same simulation as in [A. Veres, M. Boda, The chaotic nature of TCP congestion control, in: Proceedings of the IEEE INFOCOM, 2000], but running it for a longer period) and with analytical results derived from a detailed Markovian model of TCP. These results show that the traffic generated by a long-lived TCP connection, while exhibiting pronounced correlations over a predictable finite range of time-scales, cannot be (asymptotically second-order) self-similar or exhibit LRD. Our work serves as a reminder of the importance of careful trace analysis and detailed examination (and cross-validation) of alternative explanations when establishing or characterizing the generality of any particular finding about Internet traffic.
5760901
Statistical gate delay calculation with crosstalk alignment consideration
We study gate delay variation caused by crosstalk aggressor alignment, i.e., difference of signal arrival times in coupled neighboring interconnects. This effect is as significant as multiple-input switching on gate delay variation [2]. We establish a functional relationship between driver gate delay and crosstalk alignment by deterministic circuit simulation, and derive closed form formulas for statistical distributions of driver gate delay and output signal arrival time.Our proposed method can be smoothly integrated into a static timing analyzer, which runtime is dominated by sampling deterministic delay calculation, while probabilistic computation and updating take constant time. Our experimental results on 70nm technology global interconnect structures and 130nm technology industry designs show respectively 159:4% and 147:4% differences in mean and standard deviation of gate delay without crosstalk aggressor alignment consideration, while our method gives within 2:57% and 3:86% offset in gate output signal arrival time mean and standard deviation, respectively.