ppxscal/embedding_network huggingface dataset:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Authors: Yosuke Kikuchi, Toru Araki
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A bipartite graph G is bipancyclic if G has a cycle of length l for every even 4 \le \iota \le |V(G)|. For a bipancyclic graph G and any edge e, G is edge-bipancyclic if e lies on a cycle of any even length l of G. In this paper, we show that the bubble-sort graph Bn is bipancyclic for n \ge 4, and also show that it is edgebipancyclic for n \ge 5. To obtain this results, we also prove that we can construct a hamiltonian cycle of Bn that contains given two nonadjacent edges. Assume that F is the subset of E(Bn). We prove that Bn - F is bipancyclic whenever n \ge 4 and |F| \le n - 3. Since Bn is a (n - 1)-regular graph, this result is optimal in the worst case.
Orbifold mirror symmetry for complex tori
Authors: Michael Thaddeus
Venue:  (2005)

In this paper we begin the study of an interesting group cohomology class which appears in the formulation of mirror symmetry for orbifolds. This class plays an intriguing role in mirror theorems for Calabi-Yau orbifolds and in the deformation theory of these orbifolds. In the first part of the paper, we suppose that X is a complex torus with a holomorphic n-form &Omega;X, and that &pi; : X &rarr; Tn is a fibration by special Lagrangian tori. If G is a finite group acting on X preserving the complex structure, &Omega;X, and the fibration, we construct an inner local system &rho; arising from discrete torsion and a mirror map T on cohomology so that for any local system &beta;, T is a mirror isomorphism on the Chen-Ruan orbifold cohomology, T : Hp,q,orbb (X,G) &rarr;&ape;Hn-p,q,orbbr (X,G). In the second part of the paper, we restrict to abelian G. In this setting, we describe a map from the twisted orbifold cohomology group Hn-1,1orb,r (X,G) to the first order deformation space of the underlying scheme of X/G. The deformations encoded in this group deform codimension 2 fixed-point sets of X/G, but leave fixed the support of the discrete torsion.
A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments
Authors: &#x015e;ima Uyar, Emre Harmanci
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

In this paper, an adaptive domination change mechanism for diploid genetic algorithms with discrete representations is presented. It is aimed at improving the performance of existing diploid genetic algorithms in changing environments. Diploidy acts as a source of diversity in the gene pool while the adaptive domination mechanism guides the phenotype towards an optimum. The combined effect of diploidy and the adaptive domination forms a balance between exploration and exploitation. The dominance characteristic of each locus in the population is adapted through feedback from the ongoing search process. A dynamic bit matching benchmark is used to perform controlled experiments. Controlled changes to implement different levels of change severities and frequencies are used. The testing phase consists of four stages. In the first stage, the benefits of the adaptive domination mechanism are shown by testing it against previously proposed diploid approaches. In the second stage, the same adaptive approach is applied to a haploid genetic algorithm to show the effect of the diploidy on the performance of the proposed approach. In the third stage, the levels of diversity introduced by diploidy on the genotype and maintained by the adaptive domination mechanism on the phenotype are explored. In the fourth stage, tests are performed to examine the robustness of the chosen approaches against different mutation rates. Currently, the dominance change mechanism can be applied to di-allelic or multiallelic discrete representations and promising results are obtained as a result of the tests performed.
An automated end-to-end lecture capturing and broadcasting system
Authors: Cha Zhang, Jim Crawford, Yong Rui, Li-wei He
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We present a complete end-to-end system that is fully automated and supports capturing, broadcasting, viewing, archiving and search. Specifically, we describe a system architecture that minimizes the pre- and post-production time, and a fully automated lecture capturing system called iCam2, which synchronously captures all the contents of the lecture, including audio, video and visual aids. As no staff is needed during the capturing and broadcasting process, the operation cost of our system is negligible. The system has been used on a daily basis for more than 4 years, during which 467 lectures were captured with 17,000+ online viewers.
Restoring Warped Document Images through 3D Shape Modeling
Authors: Chew Lim Tan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Scanning a document page from a thick bound volume often results in two kinds of distortions in the scanned image, i.e., shade along the "spine” of the book and warping in the shade area. In this paper, we propose an efficient restoration method based on the discovery of the 3D shape of a book surface from the shading information in a scanned document image. From a technical point of view, this shape from shading (SFS) problem in real-world environments is characterized by 1) a proximal and moving light source, 2) Lambertian reflection, 3) nonuniform albedo distribution, and 4) document skew. Taking all these factors into account, we first build practical models (consisting of a 3D geometric model and a 3D optical model) for the practical scanning conditions to reconstruct the 3D shape of the book surface. We next restore the scanned document image using this shape based on deshading and dewarping models. Finally, we evaluate the restoration results by comparing our estimated surface shape with the real shape as well as the OCR performance on original and restored document images. The results show that the geometric and photometric distortions are mostly removed and the OCR results are improved markedly.
A Behavioral Approach to Time-Varying Linear Systems. Part 2: Descriptor Systems
Authors: Achim Ilchmann
Venue: SIAM Journal on Control and Optimization (2005)

In the sequel to [A. Ilchmann and V. Mehrmann, {\em SIAM J.\ Control Optim.}, 44 (2005), pp.\ 1725--1747], we discuss a behavioral approach for linear, time-varying, differential algebraic (descriptor) systems with real analytic coefficients. The analysis is ``almost global" in the sense that the analysis is not restricted to an interval $\I\subset \R$ but is allowed for the ``time axis" $\R\!\setminus\!\T$, where $\T$ is a discrete set of critical points, at which the solution may exhibit a finite escape time. Controllable, observable, and autonomous behavior for linear time-varying descriptor systems is characterized.
Page Segmentation Competition
Authors: A. Antonacopoulos, D. Bridson, B. Gatos
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

There is an established need for objective evaluation of layout analysis methods, in realistic circumstances. This paper describes the Page Segmentation Competition (modus operandi, dataset and evaluation criteria) held in the context of ICDAR2005 and presents the results of the evaluation of four candidate methods. The main objective of the competition was to compare the performance of such methods using scanned documents from commonlyoccurring publications. The results indicate that although methods seem to be maturing, there is still a considerable need to develop robust methods that deal with everyday documents.
A Design of New Infrared Data Broadcasting Protocol and Educational Application
Authors: Ryota Kawashima, Dawei Cai
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper presents a new infrared data broadcasting protocol that can be used for realizing contents delivering system and possible application for educational system. To realize a higher communication speed by infrared communication, we developed a new Infrared data delivering protocol with a VFIR physical layer and implemented the protocol in a Linux based platform successfully.As an application of the infrared data broadcasting protocol, we gave a concept describtion on a new style educational system, which is expected to provide a new style teaching service with combination of infrared communication and raido wireless communication.
A Methodology to Enhance the Semantics of Links between PubMed Publications and Markers in the Human Genome
Authors: Alex Lash, Woei-Jyh Lee, Louiqa Raschid
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Links in life science sources capture important biological knowledge. However, current simple physical link implementations do not explicitly represent this knowledge so that it can be easily shared among scientists. We develop a methodology for link extraction and generation, and link labeling to produce an enhanced e-link. The e-link associates each existing link with a link label that captures semantics of the link. We develop a machine assisted tool for curators to produce e-links and we develop a search interface for biologists to discover interesting e-links.
An Evaluation of Existing Metadata Compression and Encoding Technologies for MPEG-21 Applications
Authors: Christian Timmerer, Ingo Kofler, Johannes Liegl, Hermann Hellwagner
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

XML-based metadata for digital media is becoming increasingly important, as a consequence also calling for efficient encoding and compression schemes for the storage and transport of this metadata. Moreover, support for streaming the XML metadata in conjunction with the media data is highly desirable. Such support is provided, for instance, by MPEG's Binary Format for Metadata (BiM) encoding approach, which facilitates fragmenting, delivering, and accessing the metadata in so-called Access Units (AUs). In this paper, we present a quantitative evaluation of existing XML metadata compression and encoding techniques, reaching from widely used state-ofthe- art data compression algorithms to sophisticated XML-aware encoding schemes. The comparison is based on compressing MPEG-21 generic Bitstream Syntax Descriptions (gBSDs) which can grow to non-negligible sizes. The main conclusion from this investigation is that in terms of pure compression efficiency on XML files, the BiM approach (exemplified by the MPEG reference software as well as a commercial version thereof) is comparable - in terms of performance - with traditional data or specific XML compression tools. However, when XML metadata have to be fragmented, compressed, and streamed in such fragments, the results indicate that the BiM approach is superior to the other schemes.
Separate handles from names on the internet
Authors: Michael J. O'Donnell
Venue: Communications of the ACM (2005)

The human meaning of domain names attracts conflict over their control, degrading their reliability as permanent handles. Solution: support handles separately from names.
Design methodology for concurrent software systems employing modelling and simulation
Authors: William E. Riddle
Venue: ACM SIGSIM Simulation Digest (1977)

There is no single attribute or characteristic which distinguishes a software system as complex - rather, software system complexity may be assessed only in terms of a complicated combination of a variety of quantitative and qualitative measurements. Typical quantitative measures are size, number of components and length of the construction period - generally these can be artificially increased by inexperienced or inept designers or programmers. Measures of a more qualitative nature are ones such as under-standability and modifiability - these are generally dependent upon the experience and ability of those trying to measure the system's complexity.
The challenges of documenting everything
Authors: Diana Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1981)

About a week ago, I had a nightmare that a DP manager was talking to me on the telephone telling me his problems: He had some old system, and some new system in the works; the analysts were using all of the latest structured techniques, and yet somehow everything in both maintenance and design was in chaos. The nightmarish part of the dream was that I was promising that I could write him some reports for upper management on his problems and that I could pin down his new design in another document for user approval; but he would have none of it. He had serious problems and he wanted them solved. All I could offer was documentation, and that just wasn't what he wanted. I felt so helpless, and yet I felt that I had the right solution! 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
The Astro-spiral jump
Authors: Raymon R. McHenry
Venue: ACM SIGSIM Simulation Digest (1973)

An unusual application of a digital simulation of automobile dynamics to the design of a thrill show stunt is described. The rationale for development of the simulation, which is intended primarily for highway safety applications, is discussed and the general analytical approach is described. Computer graphics displays of simulation outputs, consisting of detailed perspective drawings of the vehicle and terrain features or obstacles at selected intervals of time during a simulated maneuver, are presented as figures in the text. For the presentation of the paper, computer graphics displays of simulation outputs will be animated through the use of motion picture film. Also, motion picture coverage of both developmental tests and public performances of the Astro Spiral Jump will be shown.
Model-driven business transformation and the semantic web
Authors: Juhnyoung Lee
Venue: Communications of the ACM (2005)

Coupling business and IT models provides a top-down business perspective.
MobiCon: integrated capture, annotation, and sharing of video clips with mobile phones
Authors: Janne Lahti, Utz Westermann, Marko Palola, Johannes Peltola, Elena Vildjiounaite
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper presents MobiCon, a video production tool for mobile camera phones. MobiCon integrates video clip capture with context-aware, personalized clip annotation -- supporting automatic annotation suggestions based on context data and efficient manual annotation with user-specific ontologies and keywords -- and clip sharing secured by digital rights management techniques. Thus, MobiCon allows users to inexpensively create metadata-annotated video clips for a better management of their clip collections and keeps them in control of the clips they share.
3D screen-space widgets for non-linear projection
Authors: Patrick Coleman, Karan Singh, Leon Barrett, Nisha Sudarsanam, Cindy Grimm
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create nonlinear projections that balance their linear perspective view of a scene with elements of aesthetic style, layout and relative importance of scene objects. Manipulating the many parameters of a linear perspective camera to achieve a desired view is not easy. Controlling and combining multiple such cameras to specify a nonlinear projection is an even more cumbersome task. This paper presents a direct interface, where an artist manipulates in 2D the desired projection of a few features of the 3D scene. The features represent a rich set of constraints which define the overall projection of the 3D scene. Desirable properties of local linear perspective and global scene coherence drive a heuristic algorithm that attempts to interactively satisfy the given constraints as a weight-averaged projection of a minimal set of linear perspective cameras. This paper shows that 2D feature constraints are a direct and effective approach to control both the 2D layout of scene objects and the conceptually complex, high dimensional parameter space of nonlinear scene projection.
Computing Surface-Based Photo-Consistency on Graphics Hardware
Authors: J. W. Bastian, A. J. van den Hengel
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper describes a novel approach to the problem of recovering information from an image set by comparing the radiance of hypothesised point correspondences. Our algorithm is applicable to a number of problems in computer vision, but is explained particularly in terms of recovering geometry from an image set. It uses the idea of photo-consistency to measure the confidence that a hypothesised scene description generated the reference images. Photo-consistency has been used in volumetric scene reconstruction where a hypothesised surface is evolved by considering one voxel at a time. Our approach is different: it represents the scene as a parameterised surface so decisions can be made about its photo-consistency simultaneously over the entire surface rather than a series of independent decisions. Our approach is further characterised by its ability to execute on graphics hardware. Experiments demonstrate that our cost function minimises at the solution and is not adversely affected by occlusion.
A direct bijection for the Harer-Zagier formula
Authors: I. P. Goulden, A. Nica
Venue: Journal of Combinatorial Theory Series A (2005)

We give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribution of a long cycle multiplied by an involution with no fixed points, in the symmetric group on a set of even cardinality. The main result of this paper is a direct bijection of a set Bp,k, the enumeration of which is equivalent to the Harer-Zagier formula. The elements of Bp,k are of the form (µ, π), where µ is a pairing on {1,...,2p}, π is a partition into k blocks of the same set, and a certain relation holds between µ and π. (The set partitions π that can appear in Bp,k are called "shift-symmetric", for reasons that are explained in the paper.) The direct bijection for Bp,k identifies it with a set of objects of the form (ρ, t), where ρ is a pairing on a 2(p - k + 1)-subset of {1, ..., 2p} (a "partial pairing"), and t is an ordered tree with k vertices. If we specialize to the extreme case when p = k - 1, then ρ is empty, and our bijection reduces to a well-known tree bijection.
Dual Characterizations of Set Containments with Strict Convex Inequalities
Authors: M. A. Goberna, V. Jeyakumar, N. Dinh
Venue: Journal of Global Optimization (2006)

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.
A Fundamental Study of Output Translation from Layout Recognition and Semantic Understanding System for Mathematical Formulae
Authors: Yusuke TAKIGUCHI, Minoru OKADA, Yasuji MIYAKE
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper we propose an implementation method for an off-line layout recognition and semantic understanding system for mathematical formulae. This off-line system aims at higher order coding of mathematical formulae in scientific articles as an application in document analysis. The system has two intermediate output codes: a layout tree holding information of geometrical structure of the formula and character recognized code of the symbols, and a semantic tree holding information of semantics of symbols. From the structure tree and the semantic tree after layout recognition and semantic understanding, various useful output can be generated at the translating part. This paper mainly describes implementation techniques for LATEX source output for high quality typesetting and gnuplot script output for drawing a function as a method for visual representation.
Australian sign language recognition
Authors: Eun-Jung Holden, Gareth Lee, Robyn Owens
Venue: Machine Vision and Applications (2005)

This paper presents an automatic Australian sign language (Auslan) recognition system, which tracks multiple target objects (the face and hands) throughout an image sequence and extracts features for the recognition of sign phrases. Tracking is performed using correspondences of simple geometrical features between the target objects within the current and the previous frames. In signing, the face and a hand of a signer often overlap, thus the system needs to segment these for the purpose of feature extraction. Our system deals with the occlusion of the face and a hand by detecting the contour of the foreground moving object using a combination of motion cues and the snake algorithm. To represent signs, features that are invariant to scaling, 2D rotations and signing speed are used for recognition. The features represent the relative geometrical positioning and shapes of the target objects, as well as their directions of motion. These are used to recognise Auslan phrases using Hidden Markov Models. Experiments were conducted using 163 test sign phrases with varying grammatical formations. Using a known grammar, the system achieved over 97% recognition rate on a sentence level and 99% success rate at a word level.
Improving Associative Classification by Incorporating Novel Interestingness Measures
Authors: Yu Lan, Davy Janssens, Geer Wets, Guoqing Chen
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Associative classification has aroused significant attention in recent years and proved to be intuitive and effective in many cases. This paper aims at achieving more effective associative classifiers by incorporating two novel interesting measures, i.e. intensity of implication and dilated chi-square. The former is proposed in the beginning for mining meaningful association rules and the latter is designed by us to reveal the interdependence between condition and class variables. Each of these two measures is applied, instead of confidence, as the primary sorting criterion under the framework of the well-known CBA algorithm in order to organize the rule sets in a more reasonable sequence. Three credit scoring datasets were applied to testify our new algorithms, along with original CBA, C4.5 decision tree and Neural network as benchmarking. The results showed that our algorithms could empirically generate accurate and more compact decision lists.