ppxscal/embedding_network huggingface dataset:
Robust Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm
Authors: Hui Ji, Cornelia Fermüller
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (low-resolution) images. Super-resolution reconstruction entails solutions to two problems. One is the alignment of image frames. The other is the reconstruction of a HR image from multiple aligned LR images. Both are important for the performance of super-resolution imaging. Image alignment is addressed with a new batch algorithm, which simultaneously estimates the homographies between multiple image frames by enforcing the surface normal vectors to be the same. This approach can handle longer video sequences quite well. Reconstruction is addressed with a wavelet-based iterative reconstruction algorithm with an efficient de-noising scheme. The technique is based on a new analysis of video formation. At a high level our method could be described as a better-conditioned iterative back projection scheme with an efficient regularization criteria in each iteration step. Experiments with both simulated and real data demonstrate that our approach has better performance than existing super-resolution methods. It can remove even large amounts of mixed noise without creating artifacts.
Study on the Balance of Urban Datum Land Prices Among Cities in Hubei Province of China Based on GIS Platform
Authors: Nianchao Deng, Yaolin Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The research aims at establishing system of urban land grade and datum land prices in Hubei province of China. The balance of urban datum land prices is made to harmonize regional land prices among cities and to make datum land prices truly reflect different economic development levels. Principal component analysis enhances selection of evaluation factors and confirmation of weights. K-Means clustering by distance is used to enhance the efficiency of land gradation. We propose the method of zoning by regional economic development level to determine reasonable capitalization rate and capacity rate. Then we choose representative towns based on coincidence level between score of evaluation units in land gradation and datum land prices, by establishing linear regression equation or exponential regression equation, we can balance urban datum land prices, on the basis of improving piecewise linear interpolation, the paper presents the method of validation by piecewise regression analysis model and spatial interpolation.
On column generation formulations for the RWA problem
Authors: B. Jaumard, C. Meyer, B. Thiongane
Venue: Discrete Applied Mathematics (2009)

We present a review of several column generation formulations for the Routing and Wavelength Assignment (rwa) problem with the objective of minimizing the blocking rate. Several improvements are proposed, together with a comparison of the different formulations with respect to the quality of their continuous relaxation bounds and their computing solution ease. Experimental results are presented on several classical network and traffic instances.
Generating segmented meshes from textured color images
Authors: Mario A. S. Lizier, David C. Martins,  Jr., Alex J. Cuadros-Vargas, Roberto M. Cesar,  Jr., Luis G. Nonato
Venue: Journal of Visual Communication and Image Representation (2009)

This paper presents a new framework for generating triangular meshes from textured color images. The proposed framework combines a texture classification technique, called W-operator, with Imesh, a method originally conceived to generate simplicial meshes from gray scale images. An extension of W-operators to handle textured color images is proposed, which employs a combination of RGB and HSV channels and Sequential Floating Forward Search guided by mean conditional entropy criterion to extract features from the training data. The W-operator is built into the local error estimation used by Imesh to choose the mesh vertices. Furthermore, the W-operator also enables to assign a label to the triangles during the mesh construction, thus allowing to obtain a segmented mesh at the end of the process. The presented results show that the combination of W-operators with Imesh gives rise to a texture classification-based triangle mesh generation framework that outperforms pixel based methods.
Better than optimum?: register reduction using idle pipelined functional units
Authors: Taemin Kim, Xun Liu
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

This paper presents a register binding algorithm in high level synthesis with the objective of register minimization. Our main observation is that not all pipelined functional units are operating at all time. Idle pipelined functional units can be used to store data temporarily, reducing stand-alone registers. The proposed register binding scheme is applied to a suite of benchmark circuits. Experimental results demonstrate that register counts can be lowered by 20% on average in comparison to the left-edge algorithm [10], which is often considered as the optimal approach. Our optimized circuits are synthesized, placed, and routed using state-of-the-art industrial EDA tools. The reduction of register leads to 31% and 23% decrease in rising and falling clock skews, respectively. Moreover, the benchmark circuits have 7% less total wirelength with a 4% power reduction on average.
A variant of Digital Signature Algorithm
Authors: Dimitrios Poulakis
Venue: Designs, Codes and Cryptography (2009)

In this paper we present a variant of the Digital Signature Algorithm based on a factorization problem and two discrete logarithm problems. We prove that our signature scheme is at least as secure as the original Digital Signature Algorithm and withstands all known attacks.
Analysis of the M6809 instruction set
Authors: Joel Boney
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The M6809 has now been in the marketplace for about 3 years and is one of the most popular midrange microcomputers. With 3 years of history, it is now possible to analyze many of the existing M6809 programs to see how the computer is actually used. This paper includes data I took regarding instruction-set and addessing-mode usage on existing M6809 programs. The specific information should be of interest to M6809 programmers and to future computer architects who wish to create similar machines. Beyond the specific M6809 information, however, there are some basic usage trends that are apparent in almost all Von Neuman architectures. Therefore, the information in this paper will be of interest to most users of microprocessors. The data point out to programmers and system engineers what attributes of a computer's instruction set really affect the memory efficiency and throughput and what attributes don't matter. With this knowledge the programmer/system engineer should be better able to evaluate a microcomputer before he selects one for his project.
On performance optimization for multi-carrier MIMO ad hoc networks
Authors: Jia Liu, Y. Thomas Hou, Yi Shi, Hanif D. Sherali
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Broadband multi-carrier MIMO (MC-MIMO) is a promising technology that could provide significant capacity gain for wireless ad hoc networks. For MC-MIMO networks, since the capacity is affected by potential mutual interference on subcarriers, scheduling for subcarriers and algorithms for power control/allocation become key problems to harness their potential. However, due to non-convexity and large size of the underlying problem, there are few results on this important problem. In this paper, we first show that the non-convex problem for MC-MIMO networks satisfies the so-called concave perturbation condition, which gives a zero duality gap for the problem. This important result allows us to tackle the problem in the dual domain. The dual approach has the highly desirable benefit of reducing the complexity of the underlying problem, which allows us to design a near-optimal off-line algorithm. In addition to the off-line algorithm, we also devise an online adaptive algorithm (OAA) without the need of channel distribution information (CDI). We show that OAA is able to achieve the same result as the off-line algorithm.
Dynamic solid textures for real-time coherent stylization
Authors: Pierre Bénard, Adrien Bousseau, Joëlle Thollot
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Stylized rendering methods, which aim at depicting 3D scenes with 2D marks such as pigments or strokes, are often faced with temporal coherence issues when applied to dynamic scenes. These issues arise from the difficulty of having to satisfy two contrary goals: ensuring that the style marks follow 3D motions while preserving their 2D appearance. In this paper we describe a new texture based method for real-time temporally coherent stylization called dynamic textures. A dynamic texture is a standard texture mapped on the object and enriched with an infinite zoom mechanism. This simple and fast mechanism maintains quasi-constant size and density of texture elements in screen space for any distance from the camera. We show that these dynamic textures can be used in many stylization techniques, enforcing the 2D appearance of the style marks while preserving the accurate 3D motion of the depicted objects. Although our infinite zoom technique can be used with both 2D or 3D textures, we focus in this paper on the 3D case (dynamic solid textures) which avoids the need for complex parameterizations of 3D surfaces. This makes dynamic textures easy to integrate in existing rendering pipelines with almost no loss in performance, as demonstrated by our implementation in a game rendering engine.
Discrimination Effectiveness of Speech Cepstral Features
Authors: A. Malegaonkar, A. Ariyaeeinia, P. Sivakumaran, S. Pillay
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

In this work, the discrimination capabilities of speech cepstra for text and speaker related information are investigated. For this purpose, Bhattacharya distance metric is used as the measure of discrimination. The scope of the study covers static and dynamic cepstra derived using the linear prediction analysis (LPCC) as well as mel-frequency analysis (MFCC). The investigations also include the assessment of the linear prediction-based mel-frequency cepstral coefficients (LP-MFCC) as an alternative speech feature type. It is shown experimentally that whilst contaminations in speech unfavourably affect the performance of all types of cepstra, the effects are more severe in the case of MFCC. Furthermore, it is shown that with a combination of static and dynamic features, LP-based mel-frequency cepstra (LP-MFCC) exhibit the best discrimination capabilities in almost all experimental cases.
D&eacute;monstration: transcordanse # 1 espaceTemps performatif interactif
Authors: Helmuth Reiter
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

transcordanse # 1 is designed both as a performative scenic space for a dance performance and as an independent interactive installation. This aristic project is an interactive timeSpace in dialogue with the public, a kinesthetic, sonorous and visual environment. To interact with this timeSpace, visitors and performers are invited to move within interactive cords, where looking and hearing are linked to movement. Thus, relationships will be established between the body and its environment: visual and sonorous superpostions and juxtapositions of the bodies, the bodies of the spectateurs and the bodies of the performers. Generated by multilinear experiences and possible transitory trajectories, a choreography of bodies and information/data will emerge, an &laquo;info-choreography&raquo; between projected bodies, real bodies and virtual bodies in this setting [dispositif].
Solving the multiple competitive facilities location and design problem on the plane
Authors: Juana López Redondo, José Fernández, Inmaculada García, Pilar M. Ortigosa
Venue: Evolutionary Computation (2009)

A continuous location problem in which a firm wants to set up two or more new facilities in a competitive environment is considered. Other facilities offering the same product or service already exist in the area. Both the locations and the qualities of the new facilities are to be found so as to maximize the profit obtained by the firm. This is a global optimization problem, with many local optima. In this paper we analyze several approaches to solve it, namely, three multistart local search heuristics, a multistart simulated annealing algorithm, and two variants of an evolutionary algorithm. Through a comprehensive computational study it is shown that the evolutionary algorithms are the heuristics that provide the best solutions. Furthermore, using a set of problems for which the optimal solutions are known, only the evolutionary algorithms were able to find the optimal solutions for all the instances. The evolutionary strategies presented in this paper can be easily adapted to handle other continuous location problems.
On the Performance of Impulse Radio Communication Systems Versus the Monocycle Pattern
Authors: Longxiang Yang, Mingjie Wang, Shixiang Shao, Hongbo Zhu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper presents the bit error probability (BEP) of impulse radio communication systems with Gaussian monocycle as the impulse. Results show that the BEP of asynchronous polarization randomized time-hopping (TH) impulse radio communication systems has no obvious relationship with the order of Gaussian monocycle, but has certain relationship with the width of Gaussian monocycle. The narrower the n-order Gaussian monocycle, the lower the BEP of TH impulse radio communication system.
Storage Management in Data Centers: Understanding, Exploiting, Tuning, and Troubleshooting Veritas Storage Foundation, 1 edition
Authors: Volker Herminghaus, Albrecht Scriba
Venue:  (2009)

Storage Management in Data Centers helps administrators tackle the complexity of data center mass storage. It shows how to exploit the potential of Veritas Storage Foundation by conveying information about the design concepts of the software as well as its architectural background. Rather than merely showinghowto use Storage Foundation, it explainswhyto use it in a particular way, along with what goes on inside. Chapters are split into three sections: An introductory part for the novice user, a full-featured part for the experienced, and a technical deep dive for the seasoned expert. An extensive troubleshooting section shows how to fix problems with volumes, plexes, disks and disk groups. A snapshot chapter gives detailed instructions on how to use the most advanced point-in-time copies. A tuning chapter will help you speed up and benchmark your volumes. And a special chapter on split data centers discusses latency issues as well as remote mirroring mechanisms and cross-site volume maintenance.All topics are covered with the technical know how gatheredfrom an aggregatethirtyyears of experience in consulting and training in data centers all over the world.
A novel Fourier descriptor based image alignment algorithm for automatic optical inspection
Authors: Chin-Sheng Chen, Chun-Wei Yeh, Peng-Yeng Yin
Venue: Journal of Visual Communication and Image Representation (2009)

This paper presents a Fourier descriptor based image alignment algorithm (FDBIA) for applications of automatic optical inspection (AOI) performed in real-time environment. It deliberates component detection and contour tracing algorithms and uses the magnitude and phase information of Fourier descriptors to establish correspondences between the target objects detected in the reference and the inspected images, so the parameters for aligning the two images can be estimated accordingly. To enhance the computational efficiency, the proposed component detection and contour tracing algorithms use the run length encoding (RLE) and Blobs tables to represent the pixel information in the regions of interest. The Fourier descriptors derived from the component boundaries are used to match the target objects. Finally, the transformation parameters for aligning the inspected image with the reference image are estimated based on a novel phase-shifted technique. Experimental results show that the proposed FDBIA algorithm sustains similar accuracy as achieved by the commercial software Easyfind against various rotation and translation conditions. Also, the computational time consumed by the FDBIA algorithm is significantly shorter than that by Easyfind.
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Authors: Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of split graphs, both of which are unrelated subclasses of chordal graphs. To complement our result, we show that cutwidth is NP-complete on split graphs, and consequently also on chordal graphs. In addition, we show that cutwidth is trivial on proper interval graphs, another subclass of interval graphs. The cutwidth of interval graphs is open, and only very few graph classes are known so far on which polynomial-time cutwidth algorithms exist. Thus we contribute to define the border between graph classes on which cutwidth is polynomially solvable and on which it remains NP-complete.
Human aspects of the environmental information management in Colombia
Authors: Myriam Cecilia Dueñas Parada
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This document describes the e-Government initiative developed by entities of the National Environmental System for the design and development of the Environmental Information System of Colombia which looked to implement the principles and foundations of the Society of Information defined in the World Summit of the United Nations. The strategy is analyzed emphasizing on the human aspects, recognizing that the use of Information and Communication Technologies (ICT) is the way and not the end itself, to integrate several social groups in the search of sustainable development. It describes the background, strategy, limitations and challenges of the e-Government initiative.
Room temperature nano- and microstructure photon detectors
Authors: A. G. U. Perera, P. V. V. Jayaweera, G. Ariyawansa, S. G. Matsik, K. Tennakone, M. Buchanan, H. C. Liu, X. H. Su, P. Bhattacharya
Venue: Microelectronics Journal (2009)

The development of room temperature infrared (IR) detectors for wavelengths beyond NIR will open up many applications that are currently limited due to cooling requirements. Three approaches are discussed, which show promise for room temperature IR detection. Tunneling quantum dot (QD) detector, utilizes a tunneling barrier in order to block the dark current while permitting the photocurrent to pass through due to resonance effects, has shown room temperature response for a detector operating at 6 and 17&mu;m. The PbS QDs in a dielectric medium utilizes electronic polarizability of QDs, sensing only the variations of the radiation intensity, operating at ambient temperature. This method allows narrow multiple response bands. A GaAs/AlGaAs heterojunction detector, utilizing light, heavy and split-off hole transition in a p-doped semiconductor, shows a threshold of 3.4&mu;m operating up to 330K.
Satellite-based delivery of educational content to geographically isolated communities: a service based approach
Authors: Tacha Serif, Gheorghita Ghinea, Lampros Stergioulas, Sherry Y. Chen, Thanassis Tiropanis, Sofia Tsekeridou
Venue: Personal and Ubiquitous Computing (2009)

Enabling learning for members of geographically isolated communities presents benefits in terms of promoting regional development and cost savings for governments and companies. However, notwithstanding recent advances in e-Learning, from both technological and pedagogical perspectives, there are very few, if any, recognised methodologies for user-led design of satellite-based e-learning infrastructures. In this paper, we present a methodology for designing a satellite and wireless based network infrastructure and learning services to support distance learning for such isolated communities. This methodology entails (a) the involvement of community members in the development of targeted learning services from an early stage, and (b) a service-oriented approach to learning solution deployment. Results show, that, while the technological premises of distance learning can be accommodated by hybrid satellite/wireless infrastructures, this has to be complemented with (a) high-quality audio---visual educational material, and (b) the opportunity for community members to interact with other community members either as groups (common-room oriented scenarios) or individuals (home-based scenarios), thus providing an impetus for learner engagement in both formal and informal activities.
Vision-Based Hand Gesture Interactions for Large LCD-TV Display Tabletop Systems
Authors: Chi-Ho Yeung, Man-Wa Lam, Hong-Ching Chan, Oscar C. Au
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

The advent of the LCD displays and computer vision technology has encouraged the development of large interactive systems that allow several users to interact simultaneously. We introduce a vision-based hand gestural interactive tabletop system which provides high definition display output and can recognize several standard gestures and track hand motion by using a camera and computer vision technology. The system focuses on the fast recognition and tracking techniques minimizing response time between users and multimedia which is especially important for motion games with immediate and large hand movements. A prototype system, which is capable of recognizing 5 gesture types and tracking hand motion in real time, was built. A demonstration game, Virtual Air Hockey, was built under the prototype system to demonstrate interactive techniques which receive positive user feedback.
Merx: Secure and Privacy Preserving Delegated Payments
Authors: Christopher Soghoian, Imad Aad
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

In this paper we present Merx, a secure payment system that enables a user to delegate a transaction to a third party while protecting the user's privacy from a variety of threats. We assume that the user does not trust the delegated person nor the merchant and wishes to minimize the information transmitted to the user's bank. Our system protects the user from fraud perpetrated by the delegated party or by the merchant. The scheme has a number of other applications such as delegating the withdrawal of cash from Automated Teller Machines ATM and allowing companies to restrict an employee's expenses during business trips. Merx is designed to be used with mobile phones and mobile computing devices, especially in situations where end-users do not have access to the Internet. We evaluate the performance of the proposed mechanism and show that it requires negligible overhead and can be gradually deployed as it is able to piggyback on existing payment-network infrastructures.