ppxscal/embedding_network huggingface dataset:
Wavelet domain watermark embedding strategy using TTCQ quantization
Authors: A. Makhloufi, A. Ouled Zaid, A. Bouallegue
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Invisible Digital watermarks have been proposed as a method for discouraging illicit copying and distribution of copyright material. Due to its characteristics, one of the problems in image watermarking is to decide how to hide in an image as many bits of information as possible while ensuring that the information can be correctly retrieved at the detecting stage, even after various attacks. Several approaches based on Discrete Wavelet Transform (DWT) have been proposed to address the problem of image watermarking. The advantage of DWT relative to the DCT is that it allows for localized watermarking of the image. The central contribution of this paper is to develop a watermarking algorithm, resilient to like lossy compression attack, by exploring the use of turbo trellis-coded quantization techniques (turbo TCQ) on the wavelet domain. Our results indicate that the proposed approach performs well against lossy wavelet-based compression attacks such as JPEG2000 and SPIHT.
Weaving rewrite-based access control policies
Authors: Anderson Santana de Oliveira, Eric Ke Wang, Claude Kirchner, Helene Kirchner
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

Access control is a central issue among the overall security goals of information systems. Despite the existence of a vast literature on the subject, it is still very hard to assure the compliance of a large system to a given dynamic access control policy. Based on our previous work on formal islands, we provide in this paper a systematic methodology to weave dynamic, formally specified policies on existing applications using aspect-oriented programming. To that end, access control policies are formalized using term rewriting systems, allowing us to have an agile, modular, and precise way to specify and to ensure their formal properties. These high-level descriptions are then weaved into the existing code, such that the resulting program implements a safe reference monitor for the specified policy. For developers, this provides a systematic process to enforce dynamic policies in a modular and flexible way. Since policies are independently specified and checked to be later weaved into various different applications, the level of reuse is improved. We implemented the approach on test cases with quite encouraging results.
Load Balancing Method Using Connection Pool in RFID Middleware
Authors: Sung-Mee Park, Jeong-Hwan Song, Chae-Soo Kim, Jung-Ja Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

RFID is an emerging technology which brings enormous productivity benefits in applications where objects have to be identified automatically. RFID Middleware is a new breed of software system which facilitates data communication between automatic identification equipments like RFID readers and enterprise applications. It provides a distributed environment to process the data coming from tags, filter and then deliver it to a variety of backend applications via various communication protocols including web services. Load balancing is an important factor to provide a more steady and flexible working environment for RFID Middleware. In this paper, we propose load balancing method using Connection Pool in RFID Middleware system. Our proposed Connection Pool is composed of four components. They are CPT (Connection Pool Table), CPM (Connection Pool Manager), MMT (Middleware Manager Table), ICC (Interrupt Check Component). We also present architecture and detailed design for Connection Pool. Our proposed Connection Pool provides a decentralized and steady data processing for RFID to load balancing, which can enhance system flexibility and availability.
Fusing remote sensing images using à trous wavelet transform and empirical mode decomposition
Authors: Shao-hui Chen, Hongbo Su, Renhua Zhang, Jing Tian
Venue: Pattern Recognition Letters (2008)

A trous wavelet transform (AWT) and empirical mode decomposition (EMD) are two distinct methods used for analyzing nonlinear and nonstationary signals. In this paper, a combination of AWT and EMD is proposed as an improved method for fusing remote sensing images on the basis of the framework of AWT-based image fusion. The principle consists of performing a multiresolution decomposition on high resolution panchromatic image (HRPI) using AWT. The approximation component and low resolution multispectral image (LRMI) are fused through an intrinsic mode functions (IMFs) based model. Subsequently, the sharpening approximation component produced is substituted for the old one. High resolution multispectral image (HRMI) is then obtained through an inverse AWT (IAWT). QuickBird images are used to illustrate the advantage of this method over the traditional AWT and EMD based methods both visually and quantitatively.
Silicon Compaction/Defragmentation for Partial Runtime Reconfiguration
Authors: Kolin Paul, Joel Porquet, Josep Llosa
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

The effective use of Run Time Reconfiguration (RTR) in modern FPGAs opens up new avenues to design area and power efficient high performance architectures. However the current design flow for exploiting RTR in designs, leads to the problem of silicon Defragmentation. We propose a silicon compaction/ defragmentation technique which works on already placed and routed modules to generate partial bitstreams (programming files) for the device. We have outlined a method which generates these partial bitstreams very fast taking into account the size and position of the "free" silicon when the device is in operation. The other advantage of this method is that the changes in the basic FPGA fabric needed to implement this defragmentation strategy are (almost) trivial.
FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
Authors: Zhaohong Deng, Fu-Lai Chung, Shitong Wang
Venue: Pattern Recognition (2008)

Reduced set density estimator (RSDE) is an important technique that can be used to replace the classical Parzen window estimator (PW) for saving the computational cost. Though RSDE demonstrates a nicer performance in the density accuracy and the computational time compared with several existing methods, it still faces the critical challenge for practical applications because of its high time complexity (no less than O(N^2)) and space complexity (O(N^2)) in training the model weighting coefficients on large data sets. In order to overcome this shortcoming, a fast reduced set density estimator algorithm (FRSDE) is proposed in this study. First, the relationship between RSDE and the minimal enclosing ball problems (MEB) in computational geometry is revealed. Then, the finding that RSDE is equivalent to a special MEB problem is derived. With this finding, the fast core-set based MEB approximation algorithm is introduced to develop the proposed algorithm FRSDE. Compared with RSDE, FRSDE has the following distinctive advantage: it can guarantee that the upper bound of the time complexity is linear with the size N of a large data set and the upper bound of the space complexity is independent of N. Our experimental results show that the proposed FRSDE has a competitive performance in the density accuracy and an overwhelming advantage over RSDE for large data sets in the data condensation rate and the training time for the weighting coefficients.
Design Space Exploration for the BLAST Algorithm Implementation
Authors: Euripides Sotiriades, Apostolos Dollas
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

The most prevalent algorithm for DNA sequence matching is the BLAST algorithm. During recent years we have developed several FPGA-based architectures to speed up BLAST execution. In this work we present a new VLSI architecture as a followup to our reconfigurable logic-based architectures, and we compare the performance of several software and hardware implementations of BLAST.
Frame Buffer Algorithms for Stochastic Models
Authors: Alain Fournier, Thomas Milligan
Venue: IEEE Computer Graphics and Applications (1985)

A display-level system using specialized processors offers a faster method of modeling visually complex objects.
An efficient terminal and model order reduction algorithm
Authors: Pu Liu, Sheldon X. -D. Tan, Boyuan Yan, Bruce McGaughy
Venue: Integration, the VLSI Journal (2008)

The paper proposes an efficient terminal and model order reduction method for compact modeling of interconnect circuits with many terminals. The new method is inspired by the recently proposed terminal reduction method, SVDMOR [P. Feldmann, F. Liu, Sparse and efficient reduced order modeling of linear subcircuits with large number of terminals, in: Proceedings of the International Conference on Computer Aided Design (ICCAD), 2004, pp. 88-92]. But different from SVDMOR, the new method considers higher order moment information for terminal responses during the terminal reduction and separately applies singular value decomposition (SVD) on both input and output terminals for low-rank approximations. This is in contrast to the SVDMOR method where input and output terminal responses are approximated by SVD at the same time, which can lead to large errors when the numbers of inputs and outputs are quite different. We analyze the passivity requirements for SVD-based terminal and model order reduction and show that the combined passive terminal and MOR using SVD method will not lead an effective terminal reduction in general. Our experimental results show that the proposed ESVDMOR method outperforms the SVDMOR method in terms of accuracy for the same reduced model sizes when the numbers of input and output terminals are quite different.
An Optimal Wavelet-Based Image Watermarking via Genetic Algorithm
Authors: Ning Zhong, Zunwen He, Jingming Kuang, Zhihai Zhuo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In watermarking system designing, there are always encounter two conflicting objectives: robustness and invisibility. It is difficult to satisfy them at same time. Traditional watermarking algorithm often solve this problem by choosing parameters via experience, it always be inefficient. We resolve the problem by using genetic algorithm (GA) to obtain the optimized solution. With a proper fitness function in the watermarking system, GA search for the optimal parameters to improve the performance of watermarking algorithm. The simulation results show that both watermark robustness and invisibility can be achieved under different attack schemes.
Managing service level agreement contracts in OGSA-based Grids
Authors: Antonios Litke, Kleopatra Konstanteli, Vassiliki Andronikou, Sotirios Chatzis, Theodora Varvarigou
Venue: Future Generation Computer Systems (2008)

Grids and mobile Grids can form the basis and the enabling technology for pervasive and utility computing due to their ability to be open, highly heterogeneous and scalable. However, the process of selecting the appropriate resources and initiating the execution of a job is not enough to provide quality in a dynamic environment such as a mobile Grid, where changes are numerous, highly variable and with unpredictable effects. In this paper we present a scheme for advancing and managing Quality of Service (QoS) attributes contained in Service Level Agreement (SLA) contracts of Grids that follow the Open Grid Services Architecture (OGSA). In order to achieve this, the execution environment of the Grid infrastructure establishes and exploits the synergies between the various modules of the architecture that participate in the management of the execution and the enforcement of the SLA contractual terms. We introduce an Execution Management Service which is in collaboration with both the application services and the network services in order to provide an adjustable quality of the requested services. The components that manage and control the execution in the Grid environment interact with the suit of the SLA-related services exchanging information that is used to provide the quality framework of the execution with respect to the agreed contractual terms. The described scheme has been implemented in the framework of the Akogrimo IST project.
Combining principal component regression and artificial neural networks for more accurate predictions of ground-level ozone
Authors: Saleh M. Al-Alawi, Sabah A. Abdul-Wahab, Charles S. Bakheit
Venue: Environmental Modelling Software (2008)

This work encompasses ozone modeling in the lower atmosphere. Data on seven environmental pollutant concentrations (CH"4, NMHC, CO, CO"2, NO, NO"2, and SO"2) and five meteorological variables (wind speed, wind direction, air temperature, relative humidity, and solar radiation) were used to develop models to predict the concentration of ozone in Kuwait's lower atmosphere. The models were developed by using summer air quality and meteorological data from a typical urban site when ozone concentration levels were the highest. The site was selected to represent a typical residential area with high traffic influences. The combined method, which is based on using both multiple regression combined with principal component analysis (PCR) and artificial neural network (ANN) modeling, was used to predict ozone concentration levels in the lower atmosphere. This combined approach was used to improve the prediction accuracy of ozone. The predictions of the models were found to be consistent with observed values. The R^2 values were 0.965, 0.986, and 0.995 for PCR, ANN, and the combined model prediction, respectively. It was found that combining the predictions from the PCR and ANN models reduced the root mean square errors (RMSE) of ozone concentrations. It is clear that combining predictions generated by different methods could improve the accuracy and provide a prediction that is superior to a single model prediction.
Urban sensing: out of the woods
Authors: Dana Cuff, Mark Hansen, Jerry Kang
Venue: Communications of the ACM (2008)

Embedded networked sensing, having successfully shifted from the lab to the environment, is primed for a more contentious move to the city to where citizens will likely be the target of data collection. This transition will warrant careful study and touch on issues that go far beyond the scientific realm.
Optimal 3GPP packet-switched streaming service (PSS) over GPRS networks
Authors: Miikka Lundan, Igor D. Curcio
Venue: Multimedia Tools and Applications (2007)

3GPP packet-switched streaming service (PSS) is a standardized packet-based mobile streaming service, which is based on IETF RTSP/SDP standards. PSS can be implemented over GPRS networks; however these cannot usually guarantee any data rates or delay bounds, but allow sufficient bandwidth for mobile streaming. GPRS cell reselections pose additional challenges for streaming, since several seconds of data transmission breaks may occur, and data may even be lost. The level of error protection of GPRS is good enough for mobile streaming, if the correct quality of service (QoS) profile is configured. In this paper, we study the effect of different QoS parameters configurations to find optimal values for PSS over GPRS. The paper shows also a method for optimizing cell reselection management at the application layer, in order to provide seamless mobility. Results show that despite all the limitations of a GPRS environment, PSS is feasible with a decent quality of service.
Wrapper Approach to Select a Subset of Color Components for Image Segmentation with Photometric Variations
Authors: Lucio Andre de Castro Jorge, Henrique de Souza Ruiz, Ednaldo Jose Ferreira, Adilson Gonzaga
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

The choice of a color model is of great importance for many computer vision algorithms. However, there are many color models available; the inherent difficulty is how to automatically select a single color model or, alternatively, a subset of features from several color models producing the best result for a particular task. To achieve proper colors components selection, in this paper, it was proposed the use of wrapper method, a data mining approach, to obtain repeatability and distinctiveness in segmentation process. The result was compared with neural network method and yields good feature discrimination. The method was verified experimentally with 108 images from Amsterdam Library of Objects Images (ALOI) and 10 aerial images with different photometric conditions. Furthermore, it has shown that the color model selection scheme provides a proper balance between color invariance (repeatability) and discriminative power (distinctiveness).
An iterative methodology for teaching object oriented concepts
Authors: Irit Hadar, Ethan Hadar
Venue: Informatics in education (2007)

Abstract thinking is a vital skill when learning computer science. Object technology and the concepts it is based upon make this skill even more crucial. However, previous research works show that students in top universities as well as experienced practitioners in industry encounter difficulties in thinking in abstract terms while practicing object oriented development. In this paper we suggest an iterative teaching methodology for supporting students in learning object oriented concepts. The suggested methodology is based on familiarizing students with modeling languages and tools at the early stages of their learning and iterating between model and code. We theoretically examine the contribution of modeling languages, in particular UML, to abstract thinking and consequently to the understanding of object oriented concepts and present some observations acquired during a trial execution of this methodology in a university course.
Redundant Coupling Detection Using Dynamic Dependence Analysis
Authors: Zakarya A. Alzamil
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Most of the software engineers realize the importance of avoiding coupling between programs modules in order to achieve the advantages of modules reusability. However, most of them practice modules' coupling in many cases without necessities. Many techniques have been proposed to detect module's coupling in computer programs. However, developers desire to automatically identify unnecessary module's coupling that can be eliminated with minimum effort, which we refer to as redundant coupling. Redundant coupling is the module coupling that does not contribute to the output of the program. In this paper we introduce an automated approach that uses the dynamic dependence analysis to detect the redundant coupling between program's modules. Such technique guides the developers to avoid redundant coupling when testing their programs.
System Testing using UML Models
Authors: Monalisa Sarma, Rajib Mall
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Coverage of system states during system testing is a nontrivial problem. It is because the number of system states is usually very large, and system developers often do not construct system state model. In this paper, we propose a method to design system test cases to achieve coverage of system states based on UML models constructed during normal development process. We use UML use case, sequence and class level statechart models to generate a set of sequences of scenarios that can achieve adequate coverage of system states.
MHH: A Novel Protocol for Mobility Management in Publish/Subscribe Systems
Authors: Jinling Wang, Jiannong Cao, Jing Li, Jie Wu
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Mobility management is an important issue for publish/subscribe systems to support mobile clients. The objectives of mobility management for publish / subscribe are to achieve short handoff delay and low message overhead, while at the same time guaranteeing reliable message delivery. Although mobility management has been extensively studied, the indirect communication style of publish/subscribe systems brings new challenges in designing mobility management solutions. In this paper, we propose a reliable and high-performance mobility management protocol, called multi-hop handoff (MHH) protocol, which sufficiently meets the requirements of publish/subscribe systems. A prototype was implemented for the MHH protocol and experiments were performed to compare the performance of MHH with two representative existing protocols. The experimental results demonstrate the efficiency improvement made by the proposed MHH protocol over the existing protocols.
On the Development of Correct Specified Programs
Authors: A. J. Blikle
Venue: IEEE Transactions on Software Engineering (1981)

The paper describes a method of program development which guarantees correctness. Our programs consist of an operational part, called instruction, and a specification. Both these parts are subject to the development and the refinement process. The specification consists of a pre-and postcondition called global specification and a set of assertions called local specification. A specified program is called correct if: 1) the operational part is totally correct w.r.t. the pre-and postcondition, 2) the precondition guarantees nonabortion, 3) local assertions are adequate for the proof of 1) and 2). The requirement of nonabortion leads to the use of a three-valued predicate calculus. We use McCarthy's calculus in that place. The paper contains a description of an experimental programming language PROMET-1 designed for our style of programming. The method is illustrated by the derivation of a bubblesort procedure.
A Conversation with Jeff Bonwick and Bill Moore
Authors: John Stanik
Venue: Queue (2007)

This month ACM Queue speaks with two Sun engineers who are bringing file systems into the 21st century. Jeff Bonwick, CTO for storage at Sun, led development of the ZFS file system, which is now part of Solaris. Bonwick and his co-lead, Sun Distinguished Engineer Bill Moore, developed ZFS to address many of the problems they saw with current file systems, such as data integrity, scalability, and administration. In our discussion this month, Bonwick and Moore elaborate on these points and what makes ZFS such a big leap forward.
RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks
Authors: Vadim Drabkin, Roy Friedman, Gabriel Kliot, Marc Segal
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

In this paper, we propose a novel ReliAble ProbabIlistic Dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior. The protocol employs a combination of probabilistic forwarding with deterministic corrective measures. The forwarding probability is set based on the observed number of nodes in each one-hop neighborhood, while the deterministic corrective measures include deterministic gossiping as well as timer based corrections of the probabilistic process. These aspects of the protocol are motivated by a theoretical analysis that is also presented in the paper, which explains why this unique protocol design is inherent to ad-hoc networks environments. Since the protocol only relies on local computations and probability, it is highly resilient to mobility and failures. The paper includes a detailed performance evaluation by simulation. We compare the performance and the overhead of RAPID with the performance of other probabilistic approaches. Our results show that RAPID achieves a significantly higher node coverage with a smaller overhead.