ppxscal/embedding_network huggingface dataset:
Multipurpose Digital Watermarking Algorithm Based on Morphological Wavelet Transform
Authors: Lin Zhuang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper proposes an novel multipurpose digital watermarking algorithm in morphological wavelet transform domain for two purposes: to notify the copyright owner with a visible gray image watermark and to protect the copyright with an invisible binary image watermark. Both watermarks are embedded in different blocks with different methods. The experiment results indicate that the morphological wavelet has state-of-the-art performance to make the visible water hard to remove and the invisible watermark robust.
Pulse width allocation with clock skew scheduling for optimizing pulsed latch-based sequential circuits
Authors: Hyein Lee, Seungwhun Paik, Youngsoo Shin
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Pulsed latches, latches driven by a brief clock pulse, offer the convenience of flip-flop-like timing verification and optimization, while retaining superior design parameters of latches over flip-flops. But, pulsed latch-based design using a single pulse width has a limitation in reducing clock period. The limitation still exists even if clock skew scheduling is employed, since the amount of skew that can be assigned is practically limited due to process variations. The problem of allocating pulse width (out of discrete number of predefined widths) and scheduling clock skew (within prescribed upper bound) is formulated, for the first time, for optimizing pulsed latch-based sequential circuits. An allocation algorithm called PWCS_Optimize is proposed to solve the problem. Experiments with 65-nm technology demonstrate that small number of variety of pulse widths (up to 5) combined with clock skews (up to 10% of clock period) yield minimum clock period for many benchmark circuits. The design flow including PWCS_Optimize, placement and routing, and synthesis of local and global clock trees is presented and assessed with example circuits.
A tag in the hand: supporting semantic, social, and spatial navigation in museums
Authors: Dan Cosley, Jonathan Baxter, Soyoung Lee, Brian Alson, Saeko Nomura, Phil Adams, Chethan Sarabu, Geri Gay
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Designers of mobile, social systems must carefully think about how to help their users manage spatial, semantic, and social modes of navigation. Here, we describe our deployment of MobiTags, a system to help museum visitors interact with a collection of "open storage" exhibits, those where the museum provides little curatorial information. MobiTags integrates social tagging, art information, and a map to support navigation and collaborative curation of these open storage collections. We studied 23 people's use of MobiTags in a local museum, combining interview data with device use logs and tracking of people's movements to understand how MobiTags affected their navigation and experience in the museum. Despite a lack of social cues, people feel a strong sense of social presence--and social pressure--through seeing others' tags. The tight coupling of tags, item information, and map features also supported a rich set of practices around these modes of navigation.
Friend or foe?: examining CAS use in mathematics research
Authors: Andrea Bunt, Michael Terry, Edward Lank
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI community has examined the extent to which these computational tools support domain experts. In this paper, we report findings from a qualitative study investigating the work practices and tools of nine mathematicians in a research setting. Counter to our expectations, our data suggests that computational tools play only a minor role in their workflow, with the limited use of CAS owing primarily to four factors: (1) the need for transparency in CAS's reasoning to explain computed results; (2) the problem of rigidity and formality in CAS's input/output style dialogue; (3) the need for 2D input to support a wide range of annotations, diagrams, and in-place manipulation of objects of interest; and (4) the need for collaboration, particularly in early stages of problem solving. While grounded in the study of mathematicians, these findings (particularly the first) have implications for the design of computational systems intended to support complex problem solving.
Verifying Time and Communication Costs of Rule-Based Reasoners
Authors: Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib
Venue: Model Checking and Artificial Intelligence: 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers (2009)

We present a framework for the automated verification of time and communication requirements in systems of distributed rule-based reasoning agents which allows us to determine how many rule-firing cycles are required to solve the problem, how many messages must be exchanged, and the trade-offs between the time and communication resources. We extend CTL* with belief and communication modalities to express bounds on the number of messages the agents can exchange. The resulting logic, $\mathcal{L}_{CRB}$, can be used to express both bounds on time and on communication. We provide an axiomatisation of the logic and prove that it is sound and complete. Using a synthetic but realistic example system of rule-based reasoning agents which allows the size of the problem and the distribution of knowledge among the reasoners to be varied, we show the Mocha model checker [1] can be used to encode and verify properties of systems of distributed rule-based agents. We describe the encoding and report results of model checking experiments which show that even simple systems have rich patterns of trade-offs between time and communication bounds.
Comment: Projection Methods Require Black Border Removal
Authors: George Nagy, Sharad C. Seth, Mahesh Viswanathan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

A methodological error in the evaluation of page segmentation algorithms is examined.
A Fast Macroblock Mode Decision Algorithm for the Baseline Profile in the H.264 Video Coding Standard
Authors: Chang-Hsing Lee, Cheng-Chang Lien, Jau-Ling Shih, Ping-Yu Lin
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

A fast macroblock (MB) mode decision algorithm is proposed to reduce the computational complexity of H.264 video coding. First, a SKIP mode detection algorithm is developed to detect as many "skipped" MB as possible. As a result, the encoding functions associated with all inter modes and all intra modes can be omitted. In addition, an early inter mode termination mechanism is developed to disable some inter modes and all intra modes during the motion estimation process. Compared with JM_FFS, the proposed algorithm can reduce 71.35% of the encoding time with a negligible degradation in video quality and compression ratio.
Dynamic memory balancing for virtual machines
Authors: Weiming Zhao, Zhenlin Wang
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

Virtualization essentially enables multiple operating systems and applications to run on one physical computer by multiplexing hardware resources. A key motivation for applying virtualization is to improve hardware resource utilization while maintaining reasonable quality of service. However, such a goal cannot be achieved without efficient resource management. Though most physical resources, such as processor cores and I/O devices, are shared among virtual machines using time slicing and can be scheduled flexibly based on priority, allocating an appropriate amount of main memory to virtual machines is more challenging. Different applications have different memory requirements. Even a single application shows varied working set sizes during its execution. An optimal memory management strategy under a virtualized environment thus needs to dynamically adjust memory allocation for each virtual machine, which further requires a prediction model that forecasts its host physical memory needs on the fly. This paper introduces MEmory Balancer (MEB) which dynamically monitors the memory usage of each virtual machine, accurately predicts its memory needs, and periodically reallocates host memory. MEB uses two effective memory predictors which, respectively, estimate the amount of memory available for reclaiming without a notable performance drop, and additional memory required for reducing the virtual machine paging penalty. Our experimental results show that our prediction schemes yield high accuracy and low overhead. Furthermore, the overall system throughput can be significantly improved with MEB.
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Venue: ACM/Usenix International Conference On Virtual Execution Environments (2009)

It is our pleasure to welcome you to the 5th ACM SIGPLAN/SIGOPS Conference on Virtual Execution Environments (VEE'09). This year's conference continues the VEE tradition of being the premier forum for presentation of research results on all aspects of virtualization. VEE is unique in that it brings together diverse elements of virtualization research, most notably operating system virtualization and virtual machines for programming languages. Reflecting the broad scope of these communities, VEE is again being co-located with ASPLOS, a cross-disciplinary conference that spans programming language, operating system, and architecture research. Since 2007, VEE has had two program chairs - one each from the operating systems and programming languages communities. The program committee also reflects a balanced representation of these two communities. The call for papers attracted 40 submissions, from which the program committee accepted 14 papers for presentation at the conference. The committee evaluated the technical contribution of each submission as well as its general accessibility to the VEE audience. Papers were judged on significance, originality, relevance, correctness, and clarity. Papers in new areas or novel approaches were especially encouraged. The resulting program has operating system-oriented papers outnumbering those with a languages focus by approximately two to one.
On Weakening Conditions for Discrete Maximum Principles for Linear Finite Element Schemes
Authors: Antti Hannukainen, Sergey Korotov, Tomáš Vejchodský
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this work we discuss weakening requirements on the set of sufficient conditions due to Ph. Ciarlet [4,5] for matrices associated to linear finite element schemes, which is commonly used for proving validity of discrete maximum principles (DMPs) for the second order elliptic problems.
Texture Image Segmentation Using Spectral Histogram and Skeleton Extracting
Authors: Hongman Wang, Jie Na
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents a texture image segmentation algorithm using spectral histogram and skeleton extracting. No need of selecting seed pixels or specifying or deciding the number of regions is its remarkable characteristic. Based on a local spatial/frequency representation, spectral histogram consists of marginal distributions of responses of a bank of filters and encodes implicitly the local structure of images through the filtering stage and the global appearance through the histogram stage. The similarity between two spectral histograms is measured using χ^2-statistic. According to the similarity among spectral histograms, the initial binary segmentation image can be obtained. Adopting skeleton extracting algorithm based on mathematical morphology, the final segmentation result can be obtained. Experiments on Brodatz textures give satisfactory results.
A parthenogenetic algorithm for single individual SNP haplotyping
Authors: Jingli Wu, Jianxin Wang, Jian'er Chen
Venue: Engineering Applications of Artificial Intelligence (2009)

The minimum error correction (MEC) model is one of the important computational models for single individual single nucleotide polymorphism (SNP) haplotyping. Due to the NP-hardness of the model, Qian et al. presented a particle swarm optimization (PSO) algorithm to solve it, and the particle code length is equal to the number of SNP fragments. However, there are hundreds and thousands of SNP fragments in practical applications. The PSO algorithm based on this kind of long particle code cannot obtain high reconstruction rate efficiently. In this paper, a practical heuristic algorithm PGA-MEC based on parthenogenetic algorithm (PGA) is presented to solve the model. A kind of short chromosome code and an effective recombination operator are designed for the algorithm. The reconstruction rate of PGA-MEC algorithm is higher than that of PSO algorithm and the running time of PGA-MEC algorithm is shorter than that of PSO algorithm, which are proved by a number of experiments.
Regular Expression Pattern Matching Supporting Constrained Repetitions
Authors: Sangkyun Yun, Kyuhee Lee
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

In this paper we present regular expression pattern matching architecture supporting constrained repetitions. The proposed architecture can implement the constrained repetitions of a regular expression while previous works support only the constrained repetitions of a single character or a multi-cycle, fixed length pattern. The blocks for the constrained repetitions are simply implemented using a counter. The beginning constrained repetition blocks are implemented differently from the non-beginning blocks to support overlapped matching. The proposed architecture can implement all constrained repetitions used in Snort rule-sets with smaller resources.
Applications of interval valued fuzzy n-ary polygroups with respect to t-norms (t-conorms)
Authors: B. Davvaz, V. Leoreanu-Fotea
Venue: Computers Mathematics with Applications (2009)

Using the triangular norm T (conorm S) in the context of n-ary polygroups, we introduce the concept of an interval-valued (anti) fuzzy n-ary subpolygroup with respect to T (S respectively). A necessary and sufficient condition for an interval-valued fuzzy subset in order to be an interval-valued (anti) fuzzy n-ary subpolygroup is established and some important results are presented. This study is useful for the most computational part of fuzzy control, which is the defuzzification.
Personalized retrieval in social bookmarking
Authors: Scott Bateman, Michael J. Muller, Jill Freyne
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Users of social bookmarking systems take advantage of pivot browsing, an interaction technique allowing them to easily refine lists of bookmarks through the selection of filter terms. However, social bookmarking systems use one-size-fits-all ranking metrics to order refined lists. These generic rankings ignore past user interactions that may be useful in determining the relevance of bookmarks. In this work we describe a personalized ordering algorithm that leverages the fact that refinding, rather than discovery (finding a bookmark for the first time), makes up the majority of bookmark accesses. The algorithm examines user-access histories and promotes bookmarks that a user has previously visited. We investigate the potential of our algorithm using interaction logs from an enterprise social bookmarking system, the results show that our personalized algorithm would lead to improved bookmark rankings.
Kernel Dimension for Some Families of Quaternary Reed-Muller Codes
Authors: J. Pernas, J. Pujol, M. Villanueva
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

Recently, new families of quaternary linear Reed-Muller codes such that, after the Gray map, the corresponding Z4-linear codes have the same parameters and properties as the codes in the usual binary linear Reed-Muller family have been introduced. A structural invariant, the kernel dimension, for binary codes can be used to classify these Z4-linear codes. The kernel dimension for these Z4-linear codes is established generalizing the known results about the kernel dimension for Z4-linear Hadamard and Z4-linear extended 1-perfect codes.
Mindplotter
Authors: Jan Bitzer, Ilija Brunck, Tom Weber
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A metaphorical visualisation of the filmmakers' work process.
Sensonomy: intelligence penetrating into the real space
Authors: Jun Rekimoto
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Recent commoditization of mobile digital devices and net-working brought us to use them as a very large-scale sensing platform. We call this possibility "Sensonmoy", which is an integration of collective intelligence (also known as "folk-sonomy") and pervasive sensing. As many users own mobile devices with sensing facilities, a collection of sensing data from these devices becomes quite important, and integration of them can be used in a very different manner. Such feature could be a new way to create intelligent systems and inter-faces. In this talk, I am going to discuss a possibility of con-necting a large number of simple devices to produce intelligent interactions. As a realistic example of them, I will introduce a city-scale indoor and outdoor positioning system that we have developed, and how its database can be evolved by using the idea of Sensonomy. I would also like to discuss computer-augmented memory and lifelong computing based on our platform.
A Proactive and Distributed QoS Negotiation Approach for Heterogeneous Environments: An Evaluation of QoS Signalling Overhead
Authors: Anis Zouari, Lucian Suciu, Jean Marie Bonnin, Karine Guillouard
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The recent boom in radio access technologies and their diversification have opened the way to new studies on Quality of Services (QoS) management in such heterogeneous environments. Indeed, the need for efficient QoS mechanisms is increasing since these new technologies provide scarce resources (e.g. unpredictable bandwidth and variable error rates). In this environment, nomadic hosts have a greater choice of access technologies. Thus, keeping the same QoS level for one user's application, anywhere user is connecting, may require some mechanisms to control QoS in each target network. In this framework, we propose to adopt a proactive and dynamic negotiation approach coupled with the hand over decision algorithm implemented in [1]. In this approach, decision parameters (e.g. throughput, transmission delay, etc.) can be distributed between several hierarchical entities in the network. If one decision parameter's value should be negotiated, negotiation process will be immediately started before taking the hand over decision. A comparison of several QoS parameter distributions (e.g. QoS parameters are stored either in Mobile Terminal or in controlentity located more or less deeply in the core network) has been carried out thanks to a mathematical model, which takes into account the size of all messages necessary to achieve QoS parameter negotiation during a mobility scenario.
Link-layer protection in 802.11i WLANS with dummy authentication
Authors: Zhimin Yang, Adam C. Champion, Boxuan Gu, Xiaole Bai, Dong Xuan
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

The current 802.11i standard can provide data confidentiality, integrity and mutual authentication in enterprise Wireless Local Area Networks (WLANs). However, secure communication can only be provided after successful authentication and a robust security network association is established. In general, the wireless link layer is not protected by the current standard in WLANs, which leads to many possible attacks, especially in public open-access wireless networks. We argue that regardless of the type of network under consideration, link-layer protection and data confidentiality are of great importance in wireless applications. In this paper, we first identify and analyze the security issues ignored by the current 802.11 security standard. Then we propose our solution to patch the current 802.11i standard and address all those issues with a new dummy authentication key-establishment algorithm. Dummy means no real authentication for a user. In dummy authentication, we apply public-key cryptography's key-establishment technique to the 802.11 MAC protocol. Our solution can provide link-layer data encryption in open-access wireless networks, separate session encryption keys for different users, and protection for important frames such as management and null data frames as well as Extensible Authentication Protocol (EAP) messages.
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
Authors: Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The subject of this paper is maximum weight matchings of graphs. An edge set M of a given graph G is called a matching if and only if any pair of edges in M share no endvertices. A maximum weight matching is a matching whose total weight (total sum of edge-weights) is maximum among those of G. The maximum weight matching problem (MWM for short) is to find a maximum weight matching of a given graph. Polynomial algorithms for finding an optimum solution to MWM have already been proposed: for example, an O(|V|4) time algorithm proposed by J. Edmonds, and an O(|E||V|log |V|) time algorithm proposed by H.N. Gabow. Some applications require obtaining a matching of large total weight (not necessarily a maximum one) in realistic computing time. These existing algorithms, however, spend extremely long computing time as the size of a given graph becomes large, and several fast approximation algorithms for MWM have been proposed. In this paper, we propose six approximation algorithms GRS+, GRS_F+, GRS_R+, GRS_S+, LAM_a+ and LAM_as+. They are enhanced from known approximation ones by adding some postprocessings that consist of improved search of weight augmenting paths. Their performance is evaluated through results of computing experiment.