ppxscal/embedding_network huggingface dataset:
Autocalibration of an Ad Hoc Construction of Multi-Projector Displays
Authors: Takayuki Okatani, Koichiro Deguchi
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper, we present a method for geometric calibration of a multi-projector display system. It enables easy calibration of the system such that the user needs only to take a picture of the projected images on the planar screen with a hand-held camera to accomplish entire calibration. Using the calibration method, one can realize a large highresolution image display by placing multiple projectors on a desk etc. in an arbitrary manner. The calibration requires four or more projectors and includes not only alignment of the images but overall rectification of the stitched image. The problem to be solved is to recover the Euclidean structure of the system (at least partially); its difficulties arise from the fact that the intrinsics of the projectors, especially the focal lengths, need to be estimated along with other parameters. For the problem, we show uniqueness of solutions and several critical configurations, which were unclear in previous studies, and then present an algorithm. We present several experimental results that demonstrate the feasibility of the proposed method.
Distributed and collaborative visualization of large data sets using high-speed networks
Authors: Andrei Hutanu, Gabrielle Allen, Stephen D. Beck, Petr Holub, Hartmut Kaiser, Archit Kulshrestha, Miloš Liška, Jon MacLaren, Luděk Matyska, Ravi Paruchuri, Steffen Prohaska, Ed Seidel, Brygg Ullmer, Shalini Venkataraman
Venue: Future Generation Computer Systems (2006)

We describe an architecture for distributed collaborative visualization that integrates video conferencing, distributed data management and grid technologies as well as tangible interaction devices for visualization. High-speed, low-latency optical networks support high-quality collaborative interaction and remote visualization of large data.
Encoding Information Flow in Haskell
Authors: Peng Li, Steve Zdancewic
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

This paper presents an embedded security sublanguage for enforcing information-flow policies in the standard Haskell programming language. The sublanguage provides useful information-flow control mechanisms including dynamic security lattices, run-time code privileges and declassification, without modifying the base language. This design avoids the redundant work of producing new languages, lowers the threshold for adopting security-typed languages, and also provides great flexibility and modularity for using security-policy frameworks. The embedded security sublanguage is designed using a standard combinator interface called arrows. Computations constructed in the sublanguage have static and explicit control-flow components, making it possible to implement information-flow control using static-analysis techniques at run time, while providing strong security guarantees. This paper presents a concrete Haskell implementation and an example application demonstrating the proposed techniques.
An Improved Multiscale Maximum Entropy Image Restoration Algorithm
Authors: Sun Jing, Wu Lehua, Gui Qi
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Based on Multiscale Maximum Entropy Method for image restoration proposed by Starck, an improved method is proposed in this paper. In this method, an adaptive threshold that is computationally more efficient is proposed for spatial filtering. And the choosing of regularization parameter is also developed for any image. Computer simulations show that the improved algorithm is better for image restoration.
An empirical study of groupware support for distributed software architecture evaluation process
Authors: Muhammad Ali Babar, Barbara Kitchenham, Liming Zhu, Ian Gorton, Ross Jeffery
Venue: Journal of Systems and Software (2006)

Software architecture evaluation is an effective means of addressing quality related issues early in the software development lifecycle. Scenario-based approaches to evaluate architecture usually involve a large number of stakeholders, who need to be collocated for face-to-face evaluation meetings. Collocating a large number of stakeholders is an expensive and time-consuming exercise, which may prove to be a hurdle in the wide-spread adoption of disciplined architectural evaluation practices. Drawing upon the successful introduction of groupware applications to support geographically distributed teams in software inspection, and requirements engineering disciplines, we propose the concept of distributed architectural evaluation using Internet-based collaborative technologies. This paper presents a pilot study used to assess the viability of a larger experiment intended to investigate the feasibility of groupware support for distributed software architecture evaluation. In addition, the results of the pilot study provide some preliminary findings on the viability of groupware-supported software architectural evaluation process.
Actions, wreath products of C-varieties and concatenation product
Authors: Laura Chaubard, Jean-Éric Pin, Howard Straubing
Venue: Theoretical Computer Science (2006)

The framework of C-varieties, introduced by the third author, extends the scope of Eilenberg's variety theory to new classes of languages. In this paper, we first define C-varieties of actions, which are closely related to automata, and prove their equivalence with the original definition of C-varieties of stamps. Next, we complete the study of the wreath product initiated by Ésik and Ito by extending its definition to C-varieties in two different ways, which are proved to be equivalent. We also state an extension of the wreath product principle, a standard tool of language theory. Finally, our main result generalizes to C-varieties the algebraic characterization of the closure under product of a variety of languages.
Thermodynamics of self-assembly of ions in the ITO solid solution
Authors: Masao Morishita, Koichiro Koyama, Tomohiro Shiraga
Venue: Microelectronic Engineering (2005)

Entropies of mixing, @D"m"i"xS"2"9"8, at 298K of Sn-doped In-based transparent Conducting Oxides (ITOs) were determined by measuring heat capacities from near absolute zero Kelvin (2K). The @D"m"i"xS"2"9"8 values were found to be below zero, indicating that short range orderings of Sn"I"n^?andO"i^'' are caused by a thermodynamic self-assembly to compensate charges. Such a self-assembly makes Sn"I"n^?andO"i^'' levels in the band gap degenerate. The degeneracy prevents absorption of visible light, remaining wide band gap over than 3eV. As a result, ITOs have good transparency while high conductivity.
Trust Negotiations with Customizable Anonymity
Authors: Anna Cinzia Squicciarini, Abhilasha Barghav-Spantzel, Elisa Bertino, Elena Ferrari, Indrakshi Ray
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosing digital credentials and policies. Credentials, exchanged during trust negotiations, often contain sensitive attributes that attest to the properties of the credential owner. Uncontrolled disclosure of such sensitive attributes may cause grave damage to the credential owner. Research has shown that disclosing non-sensitive attributes only can cause identity to be revealed as well. Consequently, we impose a stronger requirement: our negotiations should have the k-anonymity property -- the set of credentials submitted by a subject during a negotiation should be equal to k other such sets received by the counterpart during earlier negotiations. In this paper we propose a protocol that ensures k-anonymity. Our protocol has a number of important features. First, a credential submitter before submitting its set of credentials has the assurance that its set will be identical to k other sets already stored with the counterpart. Second, we provide a cryptographic protocol ensuring that the credentials submitted by the submitter during different negotiations cannot be linked to each other. Third, we ensure that the critical data exchanged during the protocol is valid. Fourth, the major part of the protocol involves the negotiating parties only; the protocol invokes the validator only only when some critical information needs to be validated.
Mining e-Learning Domain Concept Map from Academic Articles
Authors: Nian-Shing Chen, Prof. Kinshuk, Chun-Wang Wei, Hong-Jhe Chen
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Recent research has demonstrated the important of ontology and its applications. For example, while designing adaptive learning materials, designers need to refer to the ontology of a subject domain. Moreover, ontology can show the whole picture and core knowledge about a subject domain. Research from literature also suggested that graphical representation of ontology can reduce the problems of information overload and learning disorientation for learners. However, ontology constructions used to rely on domain experts in the past; it is a time consuming and high cost task. Ontology creation for emerging new domains like e-Learning is even more challenging. The aim of this paper is to construct e-Learning domain concept maps, an alternative form of ontology, from academic articles. We adopt some relevant journal articles and conferences papers in e-Learning domain as data sources, and apply text-mining techniques to automatically construct concept maps for e-Learning domain. The constructed concept maps can provide a useful reference for researchers, who are new to e- Leaning field, to study related issues, for teachers to design adaptive courses, and for learners to understand the whole picture of e-Learning domain knowledge.
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
Authors: Marc-Antoine Drouin, Martin trudeau, Sebastien Roy
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a disparity label to every pixel of a disparity map, it associates a position to every disparity discontinuity. This formulation allows us to find an approximate solution to a 2D labeling problem with robust smoothing term by minimizing multiple 1D problems, thus making possible the use of dynamic programming. Dynamic programming allows the efficient computation of the visibility of most of the cameras during the minimization. Whilst the proposed minimization strategy is particularly suitable for stereo with occlusion, it may be used with other labeling problems.
Local Propagation in Conditional Gaussian Bayesian Networks
Authors: Robert G. Cowell
Venue: The Journal of Machine Learning Research (2005)

This paper describes a scheme for local computation in conditional Gaussian Bayesian networks that combines the approach of Lauritzen and Jensen (2001) with some elements of Shachter and Kenley (1989). Message passing takes place on an elimination tree structure rather than the more compact (and usual) junction tree of cliques. This yields a local computation scheme in which all calculations involving the continuous variables are performed by manipulating univariate regressions, and hence matrix operations are avoided.
Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands
Authors: Namrata Shekhar, Priyank Kalla, M. Brandon Meredith, Florian Enescu
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

This paper addresses simulation-based verification of highlevel descriptions of arithmetic datapaths. Instances of such designs are commonly found in DSP for audio, video and multimedia applications, where the word-lengths of input/output bit-vectors are fixed according to the desired precision. Initial descriptions of such systems are usually specified as Matlab/C code. These are then automatically translated into behavioural/RTL descriptions (HDL) for subsequent hardware synthesis. In order to verify that the initial Matlab/C model is bit-true equivalent to the translated RTL, how many simulation vectors need to be applied? This paper explores results from number theory and commutative algebra to show that exhaustive simulation is not necessary for testing their equivalence. In particular, we derive an upper bound on the number of simulation vectors required to prove equivalence or identify bugs. These vectors cannot be arbitrarily generated; we determine exactly those vectors that need to be simulated. Extensive experiments are performed within practical CAD settings to demonstrate the validity and applicability of these results.
Performance of Queueing Model of one UMTS Cell with R Virtual Zones by the Maximum Entropy Solution
Authors: Aymen I. Zreikat
Venue: Wireless Personal Communications: An International Journal (2006)

UMTS stands for Universal Mobile Telecommunications System, which is one of the third generation (i.e., 3G) cellular systems, will come into full commercial phase by year 2005 and the first UMTS services are launched commercially in 2001. Therefore, the research of UMTS is an important and urgent task. In this paper, the performance of UMTS systems is studied through a queueing model which consists of one UMTS with many virtual zones to evaluate the system uplink traffic performance. The two performance measures: blocking probability and system utilization are obtained by the Maximum Entropy Principle, i.e., ME solutions for S RXR (GGeo/GGeo/1)/N queue. S RXR (GGeo/GGeo/1)/N system means that arrival time and service time are both GGeo (Generalized Geometric) distributed, each output port has a single server and the maximum capacity is N. After the theoretical analysis, the numerical results are found for the idiographic example, 8×8 (GGeo/GGeo/1)/512 queueing model. Additionally, the performance of this queueing model is discussed with the effect of the parameters Ca 2 (squared coefficient of variation of the interarrival time), Cs 2 (squared coefficient of variation of the service time) and the arrival rate, ¿.
Perceptually-Inspired and Edge-Directed Color Image Super-Resolution
Authors: Yu-Wing Tai, Wai-Shun Tong, Chi-Keung Tang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Inspired by multi-scale tensor voting, a computational framework for perceptual grouping and segmentation, we propose an edge-directed technique for color image superresolution given a single low-resolution color image. Our multi-scale technique combines the advantages of edgedirected, reconstruction-based and learning-based methods, and is unique in two ways. First, we consider simultaneously all the three color channels in our multi-scale tensor voting framework to produce a multi-scale edge representation to guide the process of high-resolution color image reconstruction, which is subject to the back projection constraint. Fine details are inferred without noticeable blurry or ringing artifacts. Second, the inference of highresolution curves is achieved by multi-scale tensor voting, using the dense voting field as an edge-preserving smoothness prior which is derived geometrically without any timeconsuming learning procedure. Qualitative and quantitative results indicate that our method produces convincing results in complex test cases typically used by state-of-theart image super-resolution techniques.
UML-based multiprocessor SoC design framework
Authors: Tero Kangas, Petri Kukkala, Heikki Orsila, Erno Salminen, Marko Hännikäinen, Timo D. Hämäläinen, Jouni Riihimäki, Kimmo Kuusilinna
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2006)

This paper describes a complete design flow for multiprocessor systems-on-chips (SoCs) covering the design phases from system-level modeling to FPGA prototyping. The design of complex heterogeneous systems is enabled by raising the abstraction level and providing several system-level design automation tools. The system is modeled in a UML design environment following a new UML profile that specifies the practices for orthogonal application and architecture modeling. The design flow tools are governed in a single framework that combines the subtools into a seamless flow and visualizes the design process. Novel features also include an automated architecture exploration based on the system models in UML, as well as the automatic back and forward annotation of information in the design flow. The architecture exploration is based on the global optimization of systems that are composed of subsystems, which are then locally optimized for their particular purposes. As a result, the design flow produces an optimized component allocation, task mapping, and scheduling for the described application. In addition, it implements the entire system for FPGA prototyping board. As a case study, the design flow is utilized in the integration of state-of-the-art technology approaches, including a wireless terminal architecture, a network-on-chip, and multiprocessing utilizing RTOS in a SoC. In this study, a central part of a WLAN terminal is modeled, verified, optimized, and prototyped with the presented framework.
Eccentric and fragile benchmarks
Authors: H. Vandierendonck, K. De Bosschere
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Benchmarks are essential for computer architecture research and performance evaluation. Constructing a good benchmark suite is, however, non-trivial: it must be representative, show different types of behavior and the benchmarks should not be easily tweaked. This paper uses principal components analysis, a statistical data analysis technique, to detect differences in behavior between benchmarks. Two specific types of benchmarks are identified. Eccentric benchmarks have a behavior that differs significantly from the other benchmarks. They are useful to incorporate different types of behavior in a suite. Fragile benchmarks are weak benchmarks: their execution time is determined almost entirely by a single bottleneck. Removing that bottleneck reduces their execution time excessively. This paper argues that fragile benchmarks are not useful and shows how they can be detected by means of workload characterization techniques. These techniques are applied to the SPEC CPU95 and CPU2000 benchmark suites. It is shown that these suites contain both eccentric and fragile benchmarks. The notions of eccentric and fragile benchmarks are important when composing a benchmark suite and to guide the sub-setting of a benchmark suite.
A literature survey of the quality economics of defect-detection techniques
Authors: Stefan Wagner
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Over the last decades, a considerable amount of empirical knowledge about the efficiency of defect-detection techniques has been accumulated. Also a few surveys have summarised those studies with different focuses, usually for a specific type of technique. This work reviews the results of empirical studies and associates them with a model of software quality economics. This allows a better comparison of the different techniques and supports the application of the model in practice as several parameters can be approximated with typical average values. The main contributions are the provision of average values of several interesting quantities w.r.t. defect detection and the identification of areas that need further research because of the limited knowledge available.
Local Correlation Tracking in Time Series
Authors: Spiros Papadimitriou, Jimeng Sun, Philip S. Yu
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

We address the problem of capturing and tracking local correlations among time evolving time series. Our approach is based on comparing the local auto-covariance matrices (via their spectral decompositions) of each series and generalizes the notion of linear cross-correlation. In this way, it is possible to concisely capture a wide variety of local patterns or trends. Our method produces a general similarity score, which evolves over time, and accurately reflects the changing relationships. Finally, it can also be estimated incrementally, in a streaming setting. We demonstrate its usefulness, robustness and efficiency on a wide range of real datasets.
Blending canal surfaces based on PH curves
Authors: Chen-Dong Xu, Fa-Lai Chen
Venue: Journal of Computer Science and Technology (2005)

In this paper, a new method for blending two canal surfaces is proposed. The blending surface is itself a generalized canal surface, the spine curve of which is a PH (Pythagorean-Hodograph) curve. The blending surface possesses an attractive property -- its representation is rational. The method is extensible to blend general surfaces as long as the blending boundaries are well-defined.
Analysis and Problems on Fuzzy Vault Scheme
Authors: Qiong Li, Zhaoqing Liu, Xiamu Niu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper discusses the problem existed in the UNLOCK algorithm of a fuzzy vault scheme. After analyzing the construction of the fuzzy vault scheme and the principle of the Reed-Solomon error correction code, it is proved that the special use of the Reed- Solomon code in the UNLOCK algorithm of the scheme is not appropriate. Therefore, the computation complexity analysis of the scheme, which is based on the Reed-Solomon code, also needs reconsideration. A practical UNLOCK algorithm and computation complexity analysis are also presented in the paper.
Training first responders to nuclear facilities using 3-D visualization technology
Authors: Robert L. Sanders, Joseph E. Lake
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The development of an advanced visualization and simulation tool for first responder exercises and education is presented. This tool exploits cutting edge computer graphics, physics-based effects modeling, virtual reality, and gaming technologies to establish a system that can eventually be used for the administrative planning and training of first responders in homeland security, homeland defense, and combating terrorism communities.
JPEG2000-based secure image authentication
Authors: Mathias Schlauweg, Dima Pröfrock, Erika Müller
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

We present an efficient JPEG2000-based image authentication scheme, which is robust to JPEG compression and other allowed signal processing operations. Positive wavelet-based watermarking approaches proposed in recent years are enhanced by image adaptive perceptual modeling and error correction coding. Our new method is secure in contrast to most of the schemes proposed so far. Lots of popular features of the JPEG2000 compression framework are supported, such as quality and resolution scalability, lossless image rotation and flipping. All coefficients of the wavelet decomposition are protected using our new extended scalar quantization and hashing scheme. We show that error correction coding yields impressive robustness improvements of the embedded image content dependent signature without raising a security gap. Further, we introduce a technique to remove the embedded information during the decompression process and thus to improve the image quality during, e.g., visualization. The functionality is not only proved by experimental results but also a real prototype camera implementation and web-based verification.