ppxscal/embedding_network huggingface dataset:
Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle
Authors: Xuefeng Liang, Tetsuo Asano, Arijit Bishnu
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

This paper is concentrated on an accurate and efficient fingerprint indexing algorithm, which efficiently retrieves the top N possibly matched candidates from a huge database. In order to have ability of coping with distorted fingerprints, the proposed algorithm uses novel features, which are insensitive to distortion, formed by the Delaunay triangulation of minutiae set as the representation unit. These features include minutia detail and Delaunay triangle (its handedness, angles, maximum edge, and related angle between orientation field and edges). Experiments on database FVC 2000 and scanned fingerprints with heavy distortion show our algorithm considerably narrows down the search space in fingerprint databases and is also available for distorted fingerprints. We also compared with other indexing approaches, and results show our algorithm has a better performance, especially on fingerprints with heavy distortion. This algorithm has another significant advantage that is it provides the control points for fingerprint distortion compensation.
Optimal grid-based methods for thin film micromagnetics simulations
Authors: C. B. Muratov, V. V. Osipov
Venue: Journal of Computational Physics (2006)

Thin film micromagnetics are a broad class of materials with many technological applications, primarily in magnetic memory. The dynamics of the magnetization distribution in these materials is traditionally modeled by the Landau-Lifshitz-Gilbert (LLG) equation. Numerical simulations of the LLG equation are complicated by the need to compute the stray field due to the inhomogeneities in the magnetization which presents the chief bottleneck for the simulation speed. Here, we introduce a new method for computing the stray field in a sample for a reduced model of ultra-thin film micromagnetics. The method uses a recently proposed idea of optimal finite difference grids for approximating Neumann-to-Dirichlet maps and has an advantage of being able to use non-uniform discretization in the film plane, as well as an efficient way of dealing with the boundary conditions at infinity for the stray field. We present several examples of the method's implementation and give a detailed comparison of its performance for studying domain wall structures compared to the conventional FFT-based methods.
Modeling agents and interactions in agricultural economics
Authors: Daisuke Torii, Toru Ishida, Francois Bousquet
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

When multiagent simulations are used for consensus building among stakeholders, it is important not only that the domain experts can deeply understand stakeholders' actual behavior but also that the stakeholders can feel the simulation result as their solution. To this end, we propose a modeling methodology which combines several techniques with the participatory method which takes stakeholders into the modeling process using role playing games (RPG).There are two types of model required to simulate a social system as a multiagent system: agents (internal models) and interactions. Hence, we considered a modeling method according to each character. In modeling an agent (e.g. decision making) which is implicit in human, the identification of the model greatly depends on the modeler's ability. Therefore we propose a modeling method wherein classification learning creates an alternative model from RPG log data for validating the domain experts' hypothesis. On the other hand, in modeling interactions (e.g. negotiation) which are emerged outside of human, it is rather important to show and capture continuously appeared interactions. Therefore we propose a modeling method with participatory simulation where a stakeholder participates as an avatar and agents act as the other stakeholders in order to deeply understand the stakeholders' interactions. Our methodology was effective to give the domain experts a deeper understanding through a real case study of agricultural economics in the northeast of Thailand [17].
Analytic determination of the tension capable workspace of cable actuated haptic interfaces
Authors: Emmanuel Brau, Jean Paul Lallemand, Florian Gosselin
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

Cable robots or wire driven robots possess many advantages that makes them very well suited to be used as haptic interfaces. They exhibit very low inertia and very low friction because of their very light mechanical structure. The use of cables, however, leads to an under-constrained system which shows complex properties. The main drawback is the difficulty to estimate the useful workspace, and the maximum tension in the cables, as the relation between the maximum force at the tip of the interface and the maximum tension in the cables can not be easily established. In this paper we present a method to calculate these tensions in a given workspace and to estimate what we have called "the tension capable workspace" for a 3 cables 2 d.o.f (degree of freedom) planar haptic interface and for a 4 cables 2 d.o.f. one.
The recognizability of sets of graphs is a robust property
Authors: Bruno Courcelle, Pascal Weil
Venue: Theoretical Computer Science (2005)

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite congruences. Applications to the construction of efficient algorithms and to the theory of context-free sets of graphs follow naturally. The class of recognizable sets depends on the signature of graph operations. We consider three signatures related respectively to Hyperedge Replacement (HR) context-free graph grammars, to Vertex Replacement (VR) context-free graph grammars, and to modular decompositions of graphs. We compare the corresponding classes of recognizable sets. We show that they are robust in the sense that many variants of each signature (where in particular operations are defined by quantifier-free formulas, a quite flexible framework) yield the same notions of recognizability. We prove that for graphs without large complete bipartite subgraphs, HR-recognizability and VR-recognizability coincide. The same combinatorial condition equates HR-context-free and VR-context-free sets of graphs. Inasmuch as possible, results are formulated in the more general framework of relational structures.
Differences in "Meaningful Learning Strategies of Navigation: An Empirical Model
Authors: Silvia Rita Viola, Alberto Giretti, Tommaso Leo
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this study the empirical detection of ways of generating semantic maps using navigational data and data driven approaches is addressed. It is hypothesized that the hypertextual structure of distributed environments could encourages the construction of personal semantic maps, expressed by navigational paths. Then this kind of usage is compared with the one of concepts maps in the dataset provided by the WINDS Project. It is shown that: a) the two strategies are in most cases mutually exclusive; b) the differences in usage of the two strategies are statistically significant; c) map usage is more scarce than the one of hypertextual structure; d) concepts maps usage is clustered around the same course. The potential of distributed technologies in supporting "meaningful learning" is discussed; moreover, the importance of other variables (e.g. learner-teacher interaction) in strategies construction is underlined.
A new efficient probabilistic model for mining labeled ordered trees
Authors: Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhisa Ueda, Minoru Kanehisa, Hiroshi Mamitsuka
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, including text mining, web mining and bioinformatics. Mining patterns from these datasets is the focus of many of the current data mining approaches. We focus on labeled ordered trees, typical datasets of semi-structured data in data mining, and propose a new probabilistic model and its efficient learning scheme for mining labeled ordered trees. The proposed approach significantly improves the time and space complexity of an existing probabilistic modeling for labeled ordered trees, while maintaining its expressive power. We evaluated the performance of the proposed model, comparing it with that of the existing model, using synthetic as well as real datasets from the field of glycobiology. Experimental results showed that the proposed model drastically reduced the computation time of the competing model, keeping the predictive power and avoiding overfitting to the training data. Finally, we assessed our results using the proposed model on real data from a variety of biological viewpoints, verifying known facts in glycobiology.
On the motion planning problem, complexity, entropy, and nonholonomic interpolation
Authors: Jean-Paul Gauthier, Vladimir Zakalyukin
Venue: Journal of Dynamical and Control Systems (2006)

We consider the sub-Riemannian motion planning problem defined by a sub-Riemannian metric (the robot and the cost to minimize) and a non-admissible curve to be ε-approximated in the sub-Riemannian sense by a trajectory of the robot. Several notions characterize the E-optimality of the approximation: the "metric complexity" MC and the "entropy" E (Kolmogorov-Jean). In this paper, we extend our previous results. 1. For generic one-step bracket-generating problems, when the corank is at most 3, the entropy is ssrelated to the complexity by E = 2πMC. 2. We compute the entropy in the special 2-step bracket-generating case, modelling the car plus a single trailer. The ε-minimizing trajectories (solutions of the "ε-nonholonomic interpolation problem"), in certain normal coordinates, are given by Euler's periodic inflexional elastica. 3. Finally, we show that the formula for entropy which is valid up to corank 3 changes in a wild case of corank 6: it has to be multiplied by a factor which is at most 3/2.
Computer-Based Training of Stimulus Detection Improves Color and Simple Pattern Recognition in the Defective Field of Hemianopic Subjects
Authors: Erich Kasten, Dorothe A. Poggel, Bernhard A. Sabel
Venue: Journal of Cognitive Neuroscience (2000)

In a previously conducted randomized placebo-controlled trial, we were able to demonstrate significant visual field enlargement induced by restitution therapy in patients with cerebral lesions [Kasten, E., Wuest, S., Behrens-Bamann, W., & Sabel, B. A. (1998c). Computer-based training for the treatment of partial blindness. Nature Medicine, 4, 1083-1087.]. Visual field training was performed on a computer monitor for 1 hr per day over a period of 6 months. Since the procedure included only stimulation with white light, in the present study we investigated if this simple detection training had a transfer effect on color or form recognition in the trained area (i.e., in the absence of modality specific training). Answering this question would be crucial for planning optimal restitution therapy: In case there is no transfer of training effects to other visual modalities, a specific treatment of each visual function must be performed in order to achieve maximum benefit. Therefore, we analyzed the data from 32 patients with visual field defects who had participated in the original trial and whose form and color recognition had been investigated. The experimental group (n = 19, restitution training) experienced not only an increase of 12.8% correctly detected stimuli (PeriMa program, p < .05), but also an improvement of 5.6% in pattern recognition (PeriForm) and of 6.1% in color perception (PeriColor), respectively. In contrast, the placebo group (n = 13, fixation training) showed no significant changes from baseline to final outcome in any of the visual modalities (PeriMa: 0.3%; PeriForm: -0.3%; PeriColor: 0.4%). Conventional perimetry yielded an increase of 7.8% detected stimuli in the experimental group, but only of 1.2% in the placebo group (p < .05). For form recognition and color perception, the differences between the results of the experimental and the placebo groups narrowly missed significance. However, correlations of diagnostic results showed that mainly those patients who had achieved visual field enlargement also improved in color and form perception: r = .67 (p < .05) between PeriMa and PeriForm and r = .32 between PeriMa and PeriColor. We conclude that visual restitution training using a simple white light stimulus has at least some influence on improving other visual functions such as color and pattern recognition. This result supports the "bottleneck theory" of visual restitution, i.e., training effects can be explained as a process of perceptual learning and increased processing of information by residual structures surviving lesions of the primary visual pathways.
Free vibration of Mindlin plates based on the relative displacement plate element
Authors: Y. Q. Ma, K. K. Ang
Venue: Finite Elements in Analysis and Design (2006)

In this paper, free vibration of Mindlin plates using the relative displacement element has been studied. Firstly, the governing equations of motion of Mindlin plates are reformulated using relative displacement concept rather than the rotational degrees of freedom, which has a good property of representation of the rotary inertia effect. Secondly, based on these formulations, the corresponding stiffness matrix and mass matrix are derived using isoparametric concept and assumed strain method, respectively. Finally, the natural frequencies of a circular plate are computed and in comparison with the theoretical solution, it is quite accurate in the numerical sense.
Home photo indexing using learned visual keywords
Authors: Joo-Hwee Lim, Jesse S. Jin
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

With rapid advances in sensor, storage, processor, and communication technologies, consumers can now afford to create, store, process, and share large digital photo collections. With more and more digital photos accumulated, consumers need effective and efficient tools to index and retrieve relevant photos. In this paper, we propose a novel image representation called Visual Keyword Histogram (VKH) for content-based indexing and retrieval. Visual keywords are domain-relevant visual prototypes (e.g. faces, foliage, buildings etc) with both perceptual appearance and textual semantics. Collectively, VKHs are computed over spatial tessellation to represent the distribution of visual keywords in various parts of an image. To construct a vocabulary of visual keywords, an incremental neural network is adopted to learn visual keywords from examples. This allows us to build domain-specific visual vocabularies rapidly and incrementally. We demonstrate our approach on 2400 home photos with 15 semantic queries.
Data Mining Methods for Modeling Gene Expression Regulation and Their Applications
Authors: Weixiong Zhang
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Understanding gene expression regulation at both transcriptional and post-transcriptional levels is critical for elucidation of the mechanism of stress tolerance in plants and important for understanding and diagnosis of human diseases. With the advent of high throughput gene expression profiling techniques, a huge amount of gene expression data on various organisms has been collected. Such a wealth of biological data has provided excellent opportunities to elucidating transcriptional regulation mechanisms using machine learning and data mining approaches.
On the structure of certain intersection graphs
Authors: Kathie Cameron, Chính T. Hoàng
Venue: Information Processing Letters (2006)

Recently Gavril introduced a new class of intersection graphs called interval-filament graphs. These include co-comparability graphs and polygon-circle graphs (the intersection graphs of polygons inscribed in a circle), which include circular-arc graphs (the intersection graphs of arcs of a circle), circle graphs (the intersection graphs of chords of a circle), chordal graphs, and outerplanar graphs. We give a structural property of polygon-circle graphs. We prove a bound on the clique-covering number for interval-filament graphs in terms of the size of a largest independent set of nodes in the graph. We prove that complements of interval-filament graphs are 4-divisible in the sense of Hoàng and McDiarmid. Similar results are obtained for complements of other intersection graphs introduced by Gavril.
Mobile Technology as an Enabler of Organizational Agility
Authors: Vlad Krotov, Iris Junglas
Venue: Proceedings of the International Conference on Mobile Business (2006)

Business agility is a relatively new concept in management that has been developed in response to the turbulence of today's marketplace. In this paper we explore the question of how mobile technology can be used as an enabler of organizational agility. To address this question, we use an exploratory research approach that employs grounded theory combined with multiple case studies. Using the Sambamurthy et al. [16] agility framework, we explore more than 100 case studies. Our findings include clusters of agilityenhancing benefits that emerge from using mobile technology in an organizational context.
MobileEssence: meeting capture on smartphones
Authors: Anthony Johnson, Ted Selker
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

We demonstrate a software system that runs on the Symbian smartphone platform, and allows a group to capture the essence of a face-to-face meeting or remote conference call in a decentralized manner. We show how the users set up a meeting, record elements from the meeting, and are able to continue the collaboration after the original meeting has ended. We show how the information collected during the meeting can be used by members to analyze the collective impression of the meeting, as well view consensus or differences of opinions.
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols
Authors: Scott Aaronson
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polynomialsize quantum advice, is also in PSPACE with polynomialsize classical advice. This builds on our earlier result that BQP/qpoly \subseteq PP/poly, and offers an intriguing counterpoint to the recent discovery of Raz that QIP/qpoly = ALL. Finally, we show that QCMA/qpoly \subseteq PP/poly and that QMA/rpoly = QMA/poly.
An image retrieval technique using rotationally invariant Gabor features and a localization method
Authors: Daekyu Shin, daewon Kim, Hyunsool Kim, Sanghui Park
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In order to search images in a database, a content based image retrieval methods are widely used for finding visually similar one to a given sample image. The approaches using Gabor functions and filters are regarded as one of the excellent methods for feature extraction and texture segmentations. However, the Gabor method does not perform well specifically for a rotated image since the filter has a direction oriented property. This paper proposes a method of extracting local texture features from blocks with central interest points extracted from an image and a rotationally invariant Gabor wavelet filter. A method of comparison among the pattern histograms that are constructed features are presented after the classification using vector quantization (VQ) between images.
Bridging the Gap between Physical and Abstract Worlds: Capturing Observed Phenomena in Abstract Models through MODELLINGSPACE
Authors: Ioanna Papadimitriou, Georgios Fiotakis, Adrian Stoica, Vassilis Komis, Nikolaos Avouris
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Observation and understanding of real world activities and phenomena is a basis of inquiry and reasoning and subsequently building of scientific knowledge. This involves moving from the perception of real world phenomena to constructing and exploring qualitative and quantitative relations that hold among the main elements. The transition between the two phases is not always smooth for the learners involved. In this paper, we present tools and activities that attempt to bridge the gap between the physical world experience and the abstract modeling and reasoning phase. Firstly, we discuss a modeling approach and the various representations involved. Then, we present the Video2Frames tool of ModellingSpace which is proposed to be used in order to create educational material by allowing the creation of abstract entities from video recordings of phenomena. Next an example of creation of educational material, using this approach is presented and discussed.
A Symbolic Representation for Shape Retrieval in Curvature Scale Space
Authors: Jinye Peng, Wanhai Yang, Zhengwen Cao
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Curvature scale space (CSS) descriptor is a robust multiscale approach for closed shape representation, which was one of the features selected to describe objects in the MPEG-7 standard. In this work, a novel method to symbolic representation for curvature scale space descriptor is presented to improve its performance. The canonical CSS descriptor is firstly mapped to circular vector map, in which, the angle and the Gaussian standard deviation are normalized and quantified to equal interval, respectively. Thus the CSS descriptor of every image can be converted to a symbol string used as shape feature. And then the distance index table is established, by which, the distance between any two CSS descriptor in circular map can be obtained directly rather than by using complicated formula. Comparative experimental results show that our proposal performs faster, simpler and more effective than canonical CSS matching. Furthermore, most traditional retrieval algorithms based on strings may be used to shape retrieval as well.