ppxscal/embedding_network huggingface dataset:
Automatic Projector Calibration Using Self-Identifying Patterns
Authors: Mark Fiala
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Calibrating multiple monitor or projector display elements to provide a composite image can be a time-consuming task if performed manually. Ideally the user would like to roughly aim a number of projectors at a surface, define the desired display corners, and have some automatic method to align the display. A digital camera and computer vision can be used to calibrate the projectors with the assistance of self-identifying patterns. To account for distortion effects and to equalize brightness, it is desirable to know the mapping of many points within each projector image. A small set of images can be projected from each display element if a self-identifying pattern is used. An array of ARTag markers are used as a self-identifying pattern which is displayed in turn by each of the display monitors or projectors and recognized in the camera image. In this way an ad-hoc arrangement of projectors can be calibrated in seconds. Experimental results are shown validating this architecture.
Rejection strategy for Convolutional Neural Network by adaptive topology applied to handwritten digits recognition
Authors: Hubert Cecotti, Abdel Belad
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a rejection strategy for convolutional neural network models. The purpose of this work is to adapt the network's topology in function of the geometrical error. A self-organizing map is used to change the links between the layers leading to a geometric image transformation occurring directly inside the network. Instead of learning all the possible deformation of a pattern, ambiguous patterns are rejected and the network's topology is modified in function of their geometric errors thanks to a specialized self-organizing map. Our objective is to show how an adaptive topology, without a new learning, can improve the recognition of rejected patterns in the case of handwritten digits.
On Clustering Biological Data Using Unsupervised and Semi-Supervised Message Passing
Authors: Huimin Geng, Xutao Deng, Dhundy Bastola, Hesham Ali
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Noticing that unsupervised clustering may produce clusters that are irrelevant to the research hypotheses and interests, we generalize traditional unsupervised clustering into semi-supervised clustering based on our previously proposed Message Passing Clustering (MPC). In the semi-supervised MPC, prior knowledge such as instance-level and attribute-level constraints are used to guide the clustering process towards better and interpretable partitions. We applied the unsupervised MPC (null background) to phylogenetic analysis of Mycobacterium and the semi-supervised MPC to colon cancer microarray data analysis. The results show that MPC is superior to the widely accepted neighbor-joining and hierarchical clustering methods, and the semi-supervised MPC is even more powerful in biological data analysis such as gene selection and cancer diagnosis using microarray.
Rethinking the Semantic Web, Part 2
Authors: Rob McCool
Venue: IEEE Internet Computing (2006)

Without radical simplification, the Semantic Web will continue to see limited participation and few compelling applications.
Off-Angle Iris Recognition Using Bi-Orthogonal Wavelet Network System
Authors: Aditya Abhyankar, Lawrence Hornak, Stephanie Schuckers
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

One important category of non-ideal conditions for iris recognition is off-angle iris images. Practically it is very difficult for images to be captured with no offset. It then becomes necessary to account for off angle information in order to maintain robust performance. A bi-orthogonal wavelet based iris recognition system, previously designed at our lab, is modified and demonstrated to perform off-angle iris recognition. Bi-orthogonal wavelet network (BWN) are developed and trained for each class. The non-ideal factors are adjusted by repositioning the BWN. To test, synthetic iris images are generated by using affine and geometric transforms of 0°, 10° and 20° experimentally collected images from 101 subjects. This approach is shown to perform better than a transformation based iris recognition approach. Iris images off-angle by up to 42° are successfully recognized.
SESAME: Scalable, Environment Sensitive Access Management Engine
Authors: Guangsen Zhang, Manish Parashar
Venue: Cluster Computing (2006)

As computing technology becomes more pervasive and mobile services are deployed, applications will need flexible access control mechanisms. Although lots of researches have been done on access control, these efforts focus on relatively static scenarios where access depends on identity of the subject. They do not address access control issues for pervasive applications where the access privileges of a subject not only depend on its identity but also on its current context and state. In this paper, we present the SESAME dynamic context-aware access control mechanism for pervasive applications. SESAME complements current authorization mechanisms to dynamically grant and adapt permissions to users based on their current context. The underlying dynamic role based access control (DRBAC) model extends the classic role based access control (RBAC). We also present a prototype implementation of SESAME and DRBAC with the Discover computational collaboratory and an experimental evaluation of its overheads.
Valid inequalities based on simple mixed-integer sets
Authors: Sanjeeb Dash, Oktay G&#x00fc;nl&#x00fc;k
Venue: Mathematical Programming: Series A and B (2006)

In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these inequalities two-step MIR inequalities as they can be derived by applying the simple mixed-integer rounding (MIR) principle of Wolsey (1998) twice. The two-step MIR inequalities define facets of the master cyclic group polyhedron of Gomory (1969). In addition, they dominate the strong fractional cuts of Letchford and Lodi (2002).
Scheduling and mac protocols for wireless networks
Authors: Sunil Suresh Kulkarni
Venue:  (2005)

The design philosophy of the latest wireless networks is radically different from the traditional design philosophy. Even though the physical communication protocols have a considerable impact on the wireless system efficiency, from the system point of view, medium access control, routing, and scheduling protocols, i.e., the layer 2 and 3 protocols in the ISO protocol hierarchy, have a determining impact on the overall system performance. The purpose of this work is to propose, study and analyze various communication protocols for different wireless communication networks. We consider two kinds of problems. First we study scheduling problems in wireless cellular networks. In this problem, the emphasis is on fairness and Quality of Service guarantees in an environment where the time varying channel conditions give rise to time varying data rates. We formulate different scheduling problems as constrained optimization problems and obtain optimal scheduling algorithms. These algorithms can be viewed as generalizations of the traditional opportunistic scheduling algorithms. The second class of problems that we study is the problem of Medium Access Control (MAC) in decentralized wireless local area networks in which nodes are equipped with directional antennas. We first propose a list of requirements that a good MAC protocol must satisfy and then suggest a protocol satisfying all the requirements. By analyzing and simulating the proposed MAC protocol, we demonstrate the performance advantage of the suggested protocol over other MAC protocols.
A transactional object calculus
Authors: Suresh Jagannathan, Jan Vitek, Adam Welc, Antony Hosking
Venue: Science of Computer Programming (2005)

A transaction defines a locus of computation that satisfies important concurrency and failure properties. These so-called ACID properties provide strong serialization guarantees that allow us to reason about concurrent and distributed programs in terms of higher-level units of computation (e.g., transactions) rather than lower-level data structures (e.g., mutual-exclusion locks). This paper presents a framework for specifying the semantics of a transactional facility integrated within a host programming language. The TFJ calculus, an object calculus derived from Featherweight Java, supports nested and multi-threaded transactions. We give a semantics to TFJ that is parametrized by the definition of the transactional mechanism that permits the study of different transaction models. We give two instantiations: one that defines transactions in terms of a versioning-based optimistic concurrency model, and the other which specifies transactions in terms of a pessimistic two-phase locking protocol, and present soundness and serializability properties for our semantics.
Active Crosstalk Cancel for High-Density Inductive Inter-chip Wireless Communication
Authors: Amit Kumar, Noriyuki Miura, Muhammad Muqsith, Tadahiro Kuroda
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

A 1.2Gb/s/channel inductive inter-chip wireless interconnect is reported in ISSCC 2004. For high data bandwidth in this scheme, high density inductor layout is required, but closer layout of inductors on chip also increases the crosstalk between channels. In this paper a theory is introduced to reduce the crosstalk between wireless channels based on the inverse matrix, which in turn helps in reducing the pitch of the inductor layout. The simulations were done for a communication distance of 15 µm and for varying inductor pitch layout from 10 µm to 50 µm. Simulink simulations show that for the same Signal to Noise Ratio (SNR) the Bit Error Rate (BER) can be improved for the given pitch. Circuit implementations are proposed and Spice simulations show that the pitch of the inductor layout can be decreased only with the help of change in layout from 25 µm to 15 µm for SNR of 15db.
Granular SVM-RFE Gene Selection Algorithm for Reliable Prostate Cancer Classification on Microarray Expression Data
Authors: Yuchun Tang, Yan-Qing Zhang, Zhen Huang, Xiaohua Hu
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Selecting the most informative cancer-related genes from huge microarray gene expression data is an important and challenging bioinformatics research topic. This paper presents the novel Granular Support Vector Machines - Recursive Feature Elimination (GSVM-RFE) algorithm for the gene selection task. As a biologically meaningful hybrid method of statistical learning theory and granular computing theory, GSVM-RFE can separately eliminate irrelevant, redundant or noisy genes in different granules at different stages and can select positively related genes and negatively related genes in balance. Simulation results on the prostate cancer dataset show that GSVM-RFE is statistically much more accurate than traditional algorithms for the prostate cancer classification. More importantly, GSVM-RFE extracts a compact "perfect" gene subset of 17 genes with 100% accuracy. To our best knowledge, this is the first time such a "perfect" gene subset is reported, which is expected to be helpful for prostate cancer study.
A Model Based Factorization Approach for dense 3D recovery from monocular Video
Authors: Jay Yagnik, K R. Ramakrishnan
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Feature track matrix factorization based methods have been attractive solutions to the Structure-from-motion (Sfm) problem. Group motion of the feature points is analyzed to get the 3D information. It is well known that the factorization formulations give rise to rank deficient system of equations. Even when enough constraints exist, the extracted models are sparse due the unavailability of pixel level tracks. Pixel level tracking of 3D surfaces is a difficult problem, particularly when the surface has very little texture as in a human face. Only sparsely located feature points can be tracked and tracking errors are inevitable along rotating low texture surfaces. However, the 3D models of an object class lie in a subspace of the set of all possible 3D models. We propose a novel solution to the Structure-frommotion problem which utilizes the high-resolution 3D obtained from range scanner to compute a basis for this desired subspace. Adding subspace constraints during factorization also facilitates removal of tracking noise which causes distortions outside the subspace. We demonstrate the effectiveness of our formulation by extracting dense 3D structure of a human face and comparing it with a well known Structure-from-motion algorithm due to Brand.
Fuzzy Flight Control System for Helicopter Intelligence in Hover
Authors: Michal Lower, Boguslaw Szlachetko, Dariusz Krol
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper relates to a fuzzy flight control system in spot hovering for a single-rotor helicopter PZL Kania1. The model of the fuzzy control system was developed on the basis of computer simulation experiments done by the expert's analysis (pilot's knowledge). The helicopter's mathematical model and its fuzzy flight control system were simulated using Matlab software package. In a series of numerous computer simulations the operation of the fuzzy control system was investigated and the system itself was tuned up. Simulation tests have been performed for the helicopter both in fixed hovering, and in hovering with disturbances. Disturbances were related to a gust of wind or to an accidental motion of one of the rudders. Obtained results give the good promise for building the Web simulator.
Volume 2 number 1 SICSIM Newsletter
Venue: ACM SIGSIM Simulation Digest (1973)

Information for the Newsletter should be transmitted directly to Nancy Zimmer. Membership information, application forms, etc. can be obtained from Mr. Gebhart. The next Newsletter is scheduled for publication in late June, 1968. 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
ECPRESS: a mini-IMPRESS
Authors: Clark M. Baker, Edward R. Baker, Teresa O. Green
Venue: ACM SIGSOC Bulletin (1974)

Two years ago, Project DELTA, a computing facility studying computational learning activity in pre-college education, became interested in Dartmouth's IMPRESS as a means of motivating computer use in social studies classes. IMPRESS is most attractive because it is interactive, and it is written in BASIC. Being interactive is important because our users are remote and prefer the time-sharing mode of computing. The project selected a PDP-11 with RSTS, because a very high level BASIC is their only time-sharing language. However, we innocently underestimated the task of adapting the larger program to a mini-computer. We met with Ed Meyers, Director of Project IMPRESS at Dartmouth, to define the scope of the task. I will describe briefly the procedures, problems, solutions, and expectations which were identified as important to achieving the objectives of creating a mini-IMPRESS. I will assume that the reader is familiar with the IMPRESS system and has some knowledge of DEC's RSTS and RSTS/E with BASIC-PLUS.
Dynamic Histograms for Non-Stationary Updates
Authors: Elizabeth Lam, Kenneth Salem
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

In this paper, we address the problem of incrementally maintaining a histogram in response to a non-stationary update process. In relational database systems, this problem can occur whenever relations model time-varying activities. We present a simple update model that is general enough to describe both stationary and non-stationary update processes, and we use it to show that existing histogram maintenance techniques can perform poorly when updates are non-stationary. We describe several techniques for solving this problem, and we use the update model to demonstrate that these techniques can effectively handle a broad range of update processes, including non-stationary ones
Analyzing the Evolutionary History of the Logical Design of Object-Oriented Software
Authors: Zhenchang Xing Eleni Stroulia
Venue: IEEE Transactions on Software Engineering (2005)

Today, most object-oriented software systems are developed using an evolutionary process model. Therefore, understanding the phases that the system's logical design has gone through and the style of their evolution can provide valuable insights in support of consistently maintaining and evolving the system, without compromising the integrity and stability of its architecture. In this paper, we present a method for analyzing the evolution of object-oriented software systems from the point of view of their logical design. This method relies on UMLDiff, a UML-structure differencing algorithm, which, given a sequence of UML class models corresponding to the logical design of a sequence of system code releases, produces a sequence of "change records¿ that describe the design-level changes between subsequent system releases. This change-records sequence is subsequently analyzed from the perspective of each individual system class, to produce the class-evolution profile, i.e., a class-specific change-records' sequence. Three types of longitudinal analyses¿phasic, gamma, and optimal matching analysis¿are applied to the class-evolution profiles to recover a high-level abstraction of distinct evolutionary phases and their corresponding styles and to identify class clusters with similar evolution trajectories. The recovered knowledge facilitates the overall understanding of system evolution and the planning of future maintenance activities. We report on one real-world case study evaluating our approach.
Capturing shock waves in inelastic granular gases
Authors: Susana Serna, Antonio Marquina
Venue: Journal of Computational Physics (2005)

Shock waves in granular gases generated by hitting an obstacle at rest are treated by means of a shock capturing scheme that approximates the Euler equations of granular gas dynamics with an equation of state (EOS), introduced by Goldshtein and Shapiro [J. Fluid Mech. 282 (1995) 75-114], that takes into account the inelastic collisions of granules. We include a sink term in the energy balance to account for dissipation of the granular motion by collisional inelasticity, proposed by Haff [J. Fluid Mech. 134 (1983) 401-430], and the gravity field added as source terms. We have computed the approximate solution to a one-dimensional granular gas falling on a plate under the acceleration of gravity until the close-packed limit.
Testing goodness of fit for the distribution of errors in multivariate linear models
Authors: M. D. Jiménez Gamero, J. Muòoz García, R. Pino Mejías
Venue: Journal of Multivariate Analysis (2005)

In this paper, to test goodness of fit to any fixed distribution of errors in multivariate linear models, we consider a weighted integral of the squared modulus of the difference between the empirical characteristic function of the residuals and the characteristic function under the null hypothesis. We study the limiting behaviour of this test statistic under the null hypothesis and under alternatives. In the asymptotics, the rank of the design matrix is allowed to grow with the sample size.
An Integrated Platform for Distributed Knowledge-Based Production Scheduling
Authors: S. H. Choi, S. G. Kang
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Production scheduling is a complex decision-making process that is becoming more important than ever in competitive markets today. However, effective production scheduling remains a very challenging task, and the current production scheduling systems tend to be inflexible and expensive. Although domain knowledge and information are very important to scheduling decisions, scheduling systems usually cannot effectively make use of them. In this paper, A Multi-Scenario Analysis (MSA) model is proposed for distributed collaborative decision-making, based on which a Multi-Scenario Analysis-based Production Scheduling Platform (MSAPSP) is developed. The platform comprises a toolkit (MSADev) and an engine (MSARE) powered by a script language (EXASL). It provides a flexible and cost-effective tool to exploit domain knowledge and information for scheduling and rescheduling decisions.
Visualization of Structured Nonuniform Grids
Authors: Kirk Riley, Yuyan Song, Martin Kraus, David S. Ebert, Jason J. Levit
Venue: IEEE Computer Graphics and Applications (2006)

Although graphics hardware is well suited to accelerate texture-based volume rendering methods for volume visualization of uniform grids, hardware acceleration is less easily exploited for texture-based volume rendering more complex meshes.Meteorological simulation and measurement data are gridded according to the requirements of the simulation and/or the measurement system.Therefore, an intermediate resampling step is often necessary for texture-based volume rendering, eliminating any potential benefits offered by the original grid structure and often introducing resampling errors. This article presents a novel, texture-based volume rendering architecture applicable to many nonuniform meshes, which avoids the need for resampling or for the visibility sorting typically required for tetrahedral meshes. Advanced lighting methods in texture-based volume rendering improve the perception of 3D structure in the volume.Functional approximations of the mapping from world space to computational space, performed per-fragment on programmable graphics hardware, allows application of these advanced techniques to many important grids in meteorological research at interactive rates.
A Method of Holistic 3D Visualization of Arbitrarily Large Datasets
Authors: Wojciech Wiza, Wojciech Cellary, Krzysztof Walczak
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, we describe a method of adaptive holistic 3D visualization of arbitrarily large datasets. The method, called AVE, permits to visualize entire datasets by the use of the most appropriate interface selected automatically from a number of available interfaces. The choice of an interface is based on the dataset properties. Different types of interfaces enable presenting the dataset categorized according to multiple criteria. The method is most suitable for abstract multidimensional datasets. Examples provided in this paper relate to visualization of data generated by indexing search engines.