ppxscal/embedding_network huggingface dataset:
A Comparison between Block-Based and Non Block-Based Watermarking Schemes Based on DWT
Authors: Osamah M. Al-Qershi, Khoo Bee Ee
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

In recent years, invisible digital watermarks have been proposed as a method for protecting copyrighted materials such as digital images. Due to its characteristics, one of the problems in digital image watermarking is to decide which technique should be used to hide in an image as many bits of information as possible while ensuring that the embedded watermark can be correctly extracted at the detecting stage, even after various attacks. In this paper we study the effect of dividing the image into blocks and applying a watermarking scheme to each block as an individual image (block-based), and compare it with applying the same watermark to the entire image (non-block-based). Digital wavelet transform (DWT) combined with a proper quantization method is used in this paper and normalized correlation (NC) is used to compare between the two cases after applying number of standard attacks. The results show that block-based watermarking has slightly better performance than non-block-based watermarking.
Fuzzy hybrid simulated annealing algorithms for topology design of switched local area networks
Authors: Salman A. Khan, Andries P. Engelbrecht
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

Topology design of switched local area networks (SLAN) is classified as an NP-hard problem since a number of objectives, such as monetary cost, network delay, hop count between communicating pairs, and reliability need to be simultaneously optimized under a set of constraints. This paper presents a multiobjective heuristic based on a simulated annealing (SA) algorithm for topology design of SLAN. Fuzzy logic has been incorporated in the SA algorithm to handle the imprecise multiobjective nature of the SLAN topology design problem, since the logic provides a suitable mathematical framework to address the multiobjective aspects of the problem. To enhance the performance of the proposed fuzzy simulated annealing (FSA) algorithm, two variants of FSA are also proposed. These variants incorporate characteristics of tabu search (TS) and simulated evolution (SimE) algorithms. The three proposed fuzzy heuristics are mutually compared with each other. Furthermore, two fuzzy operators, namely, ordered weighted average (OWA) and unified AND&#x2013;OR (UAO) are also applied in certain steps of these algorithms. Results show that in general, the variant which embeds characteristics of SimE and TS into the fuzzy SA algorithm exhibits more intelligent search of the solution subspace and was able to find better solutions than the other two variants of the fuzzy SA. Also, the OWA and UAO operators exhibited relatively similar performance.
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
Authors: Joshua Brody, Amit Chakrabarti
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit input strings is large (i.e., at least $n/2 + \sqrt n$) or small (i.e., at most $n/2 - \sqrt n$); they do not care if it is neither large nor small. This $\Theta(\sqrt n)$ gap in the problem specification is crucial for capturing the approximation allowed to a data stream algorithm. Thus far, for randomized communication, an $\Omega(n)$ lower bound on this problem was known only in the one-way setting. We prove an $\Omega(n)$ lower bound for randomized protocols that use any constant number of rounds. As a consequence we conclude, for instance, that $\epsilon$-approximately counting the number of distinct elements in a data stream requires $\Omega(1/\epsilon^2)$ space, even with multiple (a constant number of) passes over the input stream. This extends earlier one-pass lower bounds, answering a long-standing open question. We obtain similar results for approximating the frequency moments and for approximating the empirical entropy of a data stream. In the process, we also obtain tight $n - \Theta(\sqrt{n}\log n)$ lower and upper bounds on the one-way deterministic communication complexity of the problem. Finally, we give a simple combinatorial proof of an $\Omega(n)$ lower bound on the one-way randomized communication complexity.
A Conceptual Framework For Personalized And Mobile Health Care
Authors: Rajani S. Sadasivam, Murat M. Tanik, James Willig
Venue: Journal of Integrated Design Process Science (2008)

The widespread adoption of cell phones and other mobile platforms represent an opportunity to extend the benefits of personalized point-of-care healthcare applications to providers and patients in the developing world. However, the challenges facing the effective deployment of mobile health care applications are complex; thus, requiring a scalable, flexible, and configurable approach. A conceptual framework based on service-oriented-architecture is proposed to address the challenges of developing and deploying mobile health care applications. A particular emphasis of the framework is a service-agent-modeling-based personalized process support that is needed to support the diverse needs of the users.
Study of the Multi-parameter Measuring System Based on Wireless Sensor Network
Authors: Xingqiao Liu, Chengchun Li, Xiangmei Zhang, Yang Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

According to the effect of water with suspended particles to light propagation and temperature to turbidity and pressure, a multi-parameter measuring system with wireless transceiver and automatic temperature compensation is designed. The measured value of turbidity, temperature and pressure are transmitted to host computer (its monitor system software is written under VisualBasic6.0 program) by radio chip nRF2401. The nRF2401 controlled by single chip C8051F310 works in ShockBurstTM transmission scheme, can realize half-duplex communication. The wireless sensor network with tree and star type is constructed based on field environment and application. The inquiring or reversion mode and mature TDMA communication protocol are used in the network. Experimental results show that the system possesses stable operation, high precision, simple operation, reliable communication (the maximum distance up to 300m).
Magnetic Sensor Calibration Based on Multi-frequency Signal
Authors: Yanzhang Wang, Defu Cheng, Hao Lu, Yunxia Wan
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Magnetic sensor is widely used in electromagnetic field to get the real weak magnetic field intensity. Because the sensor outputs voltage and the parameter applied in electromagnetic in fact is magnetic field intensity, it should to be known precisely relationship between output voltage of the sensor and the magnetic field, that is to say, the sensor should be calibrated before applied in electromagnetic. When the sensor was calibrated in the past, the exciting signal origin from calibration system was usually sine wave or square wave. In this paper, we bring up a kind of calibration method that the exciting signal is multi-frequency signal. There are some advantages by using the method: First, the exciting signal can be produced easily. Second, the frequency of the exciting signal can be set low as far as possible. Thirdly, the calibration efficiency is improved significantly without effecting calibration precision because of all useful frequency point energy occupying most of total energy of the exciting signal. The result of experiment proves that this calibration method is feasible and high efficiency.
Semantic scene concept learning by an autonomous agent
Authors: Weiyu Zhu
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Scene understanding addresses the issue of "what a scene contains". Existing research on scene understanding is typically focused on classifying a scene into classes that are of the same category type. These approaches, although they solve some scene-understanding tasks successfully, in general fail to address the semantics in scene understanding. For example, how does an agent learn the concept label "red" and "ball" without being told that it is a color or a shape label in advance? To cope with this problem, we have proposed a novel research called semantic scene concept learning. Our proposed approach models the task of scene understanding as a "multi-labeling" classification problem. Each scene instance perceived by the agent may receive multiple labels coming from different concept categories, where the goal of learning is to let the agent discover the semantic meanings, i.e., the set of relevant visual features, of the scene labels received. Our preliminary experiments have shown the effectiveness of our proposed approach in solving this special intra- and inter-category mixing learning task.
Application Research of Using Design Pattern to Improve Layered Architecture
Authors: Chen Liyan
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Design pattern which is used appropriately can help us to establish perfect programs. In this paper, we research on the characteristics of the MVC pattern, analysis of the tightly coupled problem among each tier of the MVC pattern, propose a layered model to improve ERP architecture, present a feasible project application solution to improve the performance of J2EE. The experiment result s shows that our proposed method enhances system performance.
Augmented Reality Video See-through HMD Oriented to Product Design Assessment
Authors: Giandomenico Caruso, Umberto Cugini
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

Current state of the art technology offers various solutions for developing virtual prototyping applications that also allow the interaction with the real environment. In particular, Augmented Reality (AR) technologies include tracking systems, stereoscopic visualization systems, photorealistic rendering tools, hi-resolution video overlay systems that allow us to create various types of applications where the virtual prototype is contextualized within the real world. One application domain is product design: AR technologies allow designers to perform some evaluation tests on the virtual prototype of industrial products without the necessity to produce a physical prototype. This paper describes the development of a new Video See-Through Head Mounted Display (VST-HMD) that is high-performing and based on stereoscopic visualization. The developed display system overcomes some issues concerning the correct visualization of virtual objects that are close to the user's point of view. The paper also presents the results of some tests about an AR application developed for product design assessment.
Hardware Implementation Study of the SCFQ-CA and DRR-CA Scheduling Algorithms
Authors: Raúl Martínez, Francisco J. Alfaro, José L. Sánchez, José M. Claver
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The provision of Quality of Service (QoS) in computing and communication environments has been the focus of much research in industry and academia during the last decades. A key component for networks with QoS support is the egress link scheduling algorithm. Apart from providing a good performance in terms of, for example, good end-to-end delay and fair bandwidth allocation, an ideal scheduling algorithm implemented in a high-performance network with QoS support should satisfy other important property which is to have a low computational and implementation complexity. This is especially important in high-performance networks due to their high speed and because switches are usually implemented in a single chip.In [7] we proposed the Self-Clocked Fair Queuing Credit Aware (SCFQ-CA) and the Deficit Round Robin Credit Aware (DRR-CA) schedulers in order to adapt the SCFQ and DRR algorithms to networks with a link-level flow control mechanism. In this paper, we propose specific implementations of these two schedulers taking into account the characteristics of current high-performance networks. Moreover, we compare the complexity of these two algorithms in terms of silicon area and computation delay. In order to carry out this comparison, we have performed our own hardware implementation for the different schedulers. We have modeled the schedulers using the Handel-C language and employed the DK design suite tool from Celoxica in order to obtain hardware estimates on silicon area and arbitration time.
Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer
Authors: Benjamin Wells
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

Colossus, the first electronic digital (and very unconventional) computer, was not a stored-program general purpose computer in the modern sense, although there are printed claims to the contrary. At least one of these asserts Colossus was a Turing machine. Certainly, an appropriate Turing machine can simulate the operation of Colossus. That is hardly an argument for generality of computation. But this is: a universal Turing machine could have been implemented on a clustering of the ten Colossus machines installed at Bletchley Park, England, by the end of WWII in 1945. Along with the presentation of this result, several improvements in input, output, and speed, within the hardware capability and specification of Colossus are discussed.
Incremental estimation of discrete hidden Markov models based on a new backward procedure
Authors: German Florez-Larrahondo, Susan Bridges, Eric A. Hansen
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We address the problem of learning discrete hidden Markov models from very long sequences of observations. Incremental versions of the Baum-Welch algorithm that approximate the β-values used in the backward procedure are commonly used for this problem, since their memory complexity is independent of the sequence length. We introduce an improved incremental Baum-Welch algorithm with a new backward procedure that approximates the β-values based on a one-step lookahead in the training sequence. We justify the new approach analytically, and report empirical results that show it converges faster than previous incremental algorithms.
Visualizing Design Exclusion Predicted by Disability Data: A Mobile Phone Case Study
Authors: Sam Waller, Pat Langdon, P. John Clarkson
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

Disability data can help to predict the number of people that will be unable to use a particular product. The greatest benefits of this prediction are the design insights that help to reduce exclusion and thereby improve the product experience for a broad range of people. This paper uses a mobile phone case study to demonstrate how a set of visualization outputs from an exclusion audit can generate prioritized design insights to reduce exclusion, particularly when multiple tasks place demands on multiple capabilities.
Microtuators of SMA for Braille display system
Authors: D. R. Chaves, I. L. Peixoto, A. C. O. Lima, M. F. Vieira, C. J. de Araujo
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

This paper presents a new configuration of microactuator based on the shape memory alloys (SMA) NiTi (Niquel-Titanium), that it can be applied in touch interfaces high resolution. The essentials criterions for the project of a tactile display and factors as time of reply and force mechanics on the Braille display surface had been satisfied. The time was 1s for the displacement of the pin Braille of the order of 0.7 mm, from a current level around 350 mA, and the force for the microactuator was superior 120 mN.
Grouping of Semantically Similar Image Positions
Authors: Lutz Priese, Frank Schmitt, Nils Hering
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

Features from the Scale Invariant Feature Transformation (SIFT) are widely used for matching between spatially or temporally displaced images. Recently a topology on the SIFT features of a single image has been introduced where features of a similar semantics are close in this topology. We continue this work and present a technique to automatically detect groups of SIFT positions in a single image where all points of one group possess a similar semantics. The proposed method borrows ideas and techniques from the Color-Structure-Code segmentation method and does not require any user intervention.
Thorough Analysis of IEEE 802.11 EDCA in Ring Topology Scenarios with Hidden and Exposed Nodes
Authors: Katarzyna Kosek, Marek Natkaniec, Luca Vollero
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

In this paper the authors present a simulation study of five different ring networks with hidden and exposed nodes in which the IEEE 802.11 EDCA function is used as the MAC protocol. The presented analysis is crucial for understanding how the theoretically simple ring topology can be degraded by the presence of hidden and exposed nodes. Configurations with equal and mixed priorities are considered. Additionally, the usefulness of the four-way handshake mechanism is argued. Furthermore, the achieved results are compared with the results obtained for several star and line topology networks. Finally, the authors signalize the need for a better MAC protocol.
Development and Application of Online Image Processing System Based on Applet and JAI
Authors: Weifeng Ma, Keji Mao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Facing the drawback existing in the Stand-alone image processing software, the article proposes a web-based online image processing software architecture, and make use of the advanced image processing technology of java Applet and JAI to achieve. Detailed introducing and analysis the programming development method of JAI advanced image processing technology and Applet plug-in implementation process. At the same time, combining the actual research work, Appling the system to the low-resolution remote sensing image distributed processing system, Application results show that the system has a feature of good Practicality, multi-platform and security, which can fit different needs of distributed image process.
The Properties of Biorthogonal Vector-valued Bivariate Wavelet Packets
Authors: Junqiu Wang, Jian-Guo Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In this paper, we introduce a class of vector-valued wavelet packets of space L^2(R^2)^u, which are generalizations of bivariablewavelet packets. A procedure for constructing a class of biorthogonal vector-valued wavelet packets in higher dimensions is presented and their biorthogonality properties are characterized by virtue of matrix theory, time-frequency analysis method and operator theory. Three biorthogonality formulas regarding these wavelet packets are derived. Furthermore, it is shown how to obtain new Riesz bases of space L^2(R^2)^u from these wavelet packets.
Fix It In Post: Solutions for Postproduction Problems
Authors: Jack James
Venue:  (2009)

This book provides an array of concise solutions to the wide variety of problems that are faced by postproduction artists in the post process. With an application-agnostic approach, it gives proven, step-by-step methods to solving the most frequently encountered postproduction problems. Also included is access to a free, password-protected website that features application-specific resolutions to the problems presented, with fixes for working in Apple's Final Cut Studio suite, Avid's Media Composer, Adobe Premiere Pro, as well as other applications. Lessons are enhanced through eye-catching 4 color illustrations throughout. Solutions are provided for common audio, video, digital, editorial, color, timing and compositing problems, such as, but not limited to:* automated dialogue replacement, adjusting sync, and correcting pitch * turning SD into HD (and vice-versa) and restoration of old film for video* removing duplicate frames, repairing corrupt frames, and anti-aliasing * maintaining continuity, removing soft cuts, and troubleshooting timecodes* adding vignettes, removing color casts, and legalizing color* speeding shots up or slowing shots down, and smoothing timelapse* reframing shots, sky replacement, and object addition or removalThe book is presented in a "cookbook" format, allowing you to reference your exact problem in the TOC or index, go to that section, and immediately implement the solution featured. * Concise solutions to a broad range of problems commonly encountered in postproduction, with solutions for problems with video, audio, compositing, color, editing, timing, and more* 4-color presentation engages and provides vibrant visual guidance to solutions * Application-agnostic approach provides solutions to problems regardless of the software being used The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Capturing and Restoring the Context of Everyday Work: A Case Study at a Law Office
Authors: Gaston R. Cangiano, James D. Hollan
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Real-world activity is complex and increasingly involves use of multiple computer applications and communication devices over extended periods of time. To understand activity at the level of detail required to provide natural and comprehensive support for it necessitates appreciating both its richness and dynamically changing context. In this article, we (1) summarize field work in which we recorded the desktop activities of workers in a law office, (2) analyze interview data in detail to show the effects of context reinstatement when viewing video summaries of past desktop activity. We conclude by discussing the implications of our results for the design of software tools to assist work in office settings.