ppxscal/embedding_network huggingface dataset:
A New Method for Image Classification by Using Multilevel Association Rules
Authors: Vincent S. Tseng, Ming-Hsiang Wang, Ja-Hwung Su
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

With the popularity of multimedia applications, the huge amount of image and video related to real life have led to the proliferation of emerging storage techniques. Contented-based image retrieval and classification have become attractive issues in the last few years. Most researches concerning image classification focus primarily on low-level image features (e.g. color, texture, shape, etc.) and ignore the conceptual associations among the objects in the images. In this paper, we propose a new image classification method by using multiple-level association rules based on the image objects. The approach we proposed can be decomposed of three phases: (1) building of conceptual object hierarchy, (2) discovery of classification rules, and (3) classification and prediction of images. At the first phase, we use a hierarchical clustering method to build the conceptual hierarchy based on the low-level features of image objects. At the second phase, we devise a multi-level mining algorithm for finding the image classification rules. The classification task is performed at the last phase. Empirical evaluations show that our approach performs better than other approaches in terms of classification accuracy.
The Application of Learning Styles in Both Individual and Collaborative Learning
Authors: Pedro Paredes, Pilar Rodriguez
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

With the goal of applying learning styles in both individual and collaborative learning, some adaptation mechanisms have been developed. These mechanisms try to improve the process of learning by matching the teaching style with the student's learning style and by grouping students in some specific ways. We use the Felder-Silverman Learning Style Model and its Index of Learning Styles (ILS) questionnaire, in order to classify students, depending on their preferences on four dimensions (active/reflective, sensing/intuitive, visual/verbal, and sequential/global). The benefits of learning styles, it can be of interest for adaptive hypermedia learning systems in both individual and collaborative activities, especially if they support automatic grouping of users. From the results obtained by a case study with students of Computer Science in a collaborative task can be concluded that some dimensions of the learning style model seem to affect the quality of the resulting work. With this aim, new grouping rules have been incorporated in the TANGOW/WOTAN system to be used in the corresponding courses.
A Model of Front-End Pre-Change Corrective Testing
Authors: Mira Kajko-Mattsson, Stefan Britts
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Most of the testing process models deal with testing within development. To our knowledge, there are no process models exclusively dedicated to the testing of corrective changes. For this reason, we have outlined a process model covering the testing activities at the front-end support level and evaluated them within 15 software organizations.
Data farming: discovering surprise
Authors: Gary E. Horne, Ted E. Meyer
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The development of models and analysis of modeling results usually requires that models be run many times. Very few modelers are satisfied with the computing resources available to do sensitivity studies, validation and verification, measurement of effectiveness analysis, and related necessary activities. Fortunately, high performance computing, in the form of distributed computing capabilities and commodity node systems, is becoming more pervasive and cost effective. In this paper the authors describe the concept and methods of Data Farming, the study and development of methods, interfaces, and tools that make high performance computing readily available to modelers and allows analysts to explore the vast amount of data that results from exercising models.
A work-efficient distributed algorithm for reachability analysis
Authors: Orna Grumberg, Tamir Heyman, Assaf Schuster
Venue: Formal Methods in System Design (2006)

This work presents a novel distributed symbolic algorithm for reachability analysis that can effectively exploit, as needed, a large number of machines working in parallel. The novelty of the algorithm is in its dynamic allocation and reallocation of processes to tasks and in its mechanism for recovery from local state explosion. As a result, the algorithm is work-efficient: it utilizes only those resources that are actually needed. In addition, its high adaptability makes it suitable for exploiting the resources of very large and heterogeneous distributed, nondedicated environments. Thus, it suitable for verifying very large systems. We implemented our algorithm in a tool called Division. Our experimental results show that the algorithm is indeed work-efficient. Although the goal of this research is to check larger models, the results also indicate that the algorithm can obtain high speedups, because communication overhead is very small.
A Personalized Electronic Map System Based on Object Deputy Model
Authors: Yuwei Peng, Weiping Xie, Boxuan Zhai, Zhiyong Peng
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

With the rapid development of Internet, the demand for various kinds of electronic maps is increased greatly. But the existing electronic maps have some problem. In terms of user, there is too much geographical information on the maps; it is very difficult for user to find ones' targets very clearly. On the other hand, in terms of developer, the data is stored and managed by relational database or objectrelational database. If we need to extend the system, we must change the structure of data greatly or add more redundancy. In this paper, we proposed a method to build electronic map systems using Object Deputy Model proposed by us under supervision of Prof. Kambayashi. Our electronic map system enables user to create their own maps according to their need or interests. In addition, the electronic maps can be personalized more easily.
Mitigating attacks on open functionality in SMS-capable cellular networks
Authors: Patrick Traynor, William Enck, Patrick McDaniel, Thomas La Porta
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

The transformation of telecommunications networks from homogeneous closed systems providing only voice services to Internet-connected open networks that provide voice and data services presents significant security challenges. For example, recent research illustrated that a carefully crafted DoS attack via text messaging could incapacitate all voice communications in a metropolitan area with little more than a cable modem. This attack highlights a growing threat to these systems; namely, cellular networks are increasingly exposed to adversaries both in and outside the network. In this paper, we use a combination of modeling and simulation to demonstrate the feasibility of targeted text messaging attacks. Under realistic network conditions, we show that adversaries can achieve blocking rates of more than 70% with only limited resources. We then develop and characterize five techniques from within two broad classes of countermeasures - queue management and resource provisioning. Our analysis demonstrates that these techniques can eliminate or extensively mitigate even the most intense targeted text messaging attacks. We conclude by considering the tradeoffs inherent to the application of these techniques in current and next generation telecommunications networks.
Maximum robustness control for isolation of mechanical disturbances
Authors: V. V. Koulaguin
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Some new criterion for decision making under uncertainty and its control application are set forth. The criterion is based on known property of robustness of each admissible decision. Namely, a decision goal is realized by this admissible decision in spite of the fact that an uncertainty parameter value is changed within some range of it. A few basic goals for decision making and basic types of control design problem are considered. Application to protection devices from shock and vibration is investigated. 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
A Graph-Based Approach for Modeling and Indexing Video Data
Authors: Jeongkyu Lee
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new graph-based data model called Spatio- Temporal Region Graph (STRG). Unlike existing graph-based data structures which provide only spatial features, the proposed STRG further provides temporal features, which represent temporal relationships among spatial objects. The STRG is decomposed into its subgraphs object graphs (OGs) and background graphs (BGs). In addition, a new distance measure, called Extended Graph Edit Distance (EGED), is introduced in metric space for matching and indexing. Based on clustering and EGED, we propose a new indexing method STRG-Index, which is faster and more accurate. We compare the STRG-Index with the M-tree, which is a popular tree-based indexing method for multimedia data. The STRG-Index outperforms the M-tree in terms of cost and speed.
Fractional Hamiltonian analysis of irregular systems
Authors: Dumitru Baleanu
Venue: Signal Processing (2006)

The fractional Hamiltonian systems with linearly dependent constraints are investigated within fractional Riemann-Liouville derivatives. One example is analyzed in details and the consistency of fractional Euler-Lagrange and Hamilton equations is examined.
Efficient Register Mapping and Allocation in LaTTe, an Open-Source Java Just-in-Time Compiler
Authors: Byung-Sun Yang Junpyo Lee SeungIl Lee Seongbae Park Yoo C. Chung Suhyun Kim Kemal Ebcioglu, Erik Altman, Soo-Mook Moon
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Java just-in-time (JIT) compilers improve the performance of a Java virtual machine (JVM) by translating Java bytecode into native machine code on demand. One important problem in Java JIT compilation is how to map stack entries and local variables to registers efficiently and quickly, since register-based computations are much faster than memory-based ones, while JIT compilation overhead is part of the whole running time. This paper introduces LaTTe, an open-source Java JIT compiler that performs fast generation of efficiently register-mapped RISC code. LaTTe first maps "all” local variables and stack entries into pseudoregisters, followed by real register allocation which also coalesces copies corresponding to pushes and pops between local variables and stack entries aggressively. Our experimental results indicate that LaTTe's sophisticated register mapping and allocation really pay off, achieving twice the performance of a naive JIT compiler that maps all local variables and stack entries to memory. It is also shown that LaTTe makes a reasonable trade-off between quality and speed of register mapping and allocation for the bytecode. We expect these results will also be beneficial to parallel and distributed Java computing 1) by enhancing single-thread Java performance and 2) by significantly reducing the number of memory accesses which the rest of the system must properly order to maintain coherence and keep threads synchronized.
Motion Estimation from Spheres
Authors: Guoqiang Zhang, Kwan-Yee K. Wong
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

This paper addresses the problem of recovering epipolar geometry from spheres. Previous works have exploited epipolar tangencies induced by frontier points on the spheres for motion recovery. It will be shown in this paper that besides epipolar tangencies, N^2 point features can be extracted from the apparent contours of the N spheres whenN \gt 2. An algorithm for recovering the fundamental matrices from such point features and the epipolar tangencies from 3 or more spheres is developed, with the point features providing a homography over the view pairs and the epipolar tangencies determining the epipoles. In general, there will be two solutions to the locations of the epipoles. One of the solutions corresponds to the true camera configuration, while the other corresponds to a mirrored configuration. Several methods are proposed to select the right solution. Experiments on using 3 and 4 spheres demonstrate that our algorithm can be carried out easily and can achieve a high precision.
An Effective and Efficient Exact Match Retrieval Scheme for Symbolic Image Database Systems Based on Spatial Reasoning: A Logarithmic Search Time Approach
Authors: P. Punitha, D. S. Guru
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

In this paper, a novel method of representing symbolic images in a symbolic image database (SID) invariant to image transformations that is useful for exact match retrieval is presented. The relative spatial relationships existing among the components present in an image are perceived with respect to the direction of reference [15] and preserved by a set of triples. A distinct and unique key is computed for each distinct triple. The mean and standard deviation of the set of keys computed for a symbolic image are stored along with the total number of keys as the representatives of the corresponding image. The proposed exact match retrieval scheme is based on a modified binary search technique and, thus, requires O(log n) search time in the worst case, where n is the total number of symbolic images in the SID. An extensive experimentation on a large database of 22,630 symbolic images is conducted to corroborate the superiority of the model. The effectiveness of the proposed representation scheme is tested with standard testbed images.
Can good learners always compensate for poor learners?
Authors: Keith Sullivan, Liviu Panait, Gabriel Balan, Sean Luke
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Can a good learner compensate for a poor learner when paired in a coordination game? Previous work presented an example where a special learning algorithm (FMQ) is capable of doing just that when paired with a specific less capable algorithm even in games which stump the poorer algorithm when paired with itself. We argue that this result is not general. We give a straightforward extension to the coordination game in which FMQ cannot compensate for the lesser algorithm. We also provide other problematic pairings, and argue that another high-quality algorithm cannot do so either.
An empirical test of the minimal cognitive processing theory of web buyer behavior
Authors: John Vinsonhaler
Venue:  (2006)

Sales on e-commerce websites cannot increase if visitors leave the websites without purchasing. To better explain and increase buyer conversion and user satisfaction, it is needed to better understand why Internet shoppers give up and exit websites without achieving their goal of purchasing desired products. First, a compendium of website features which are thought to improve buyer conversion is provided. Second, the current theory, minimal cognitive processing theory (MCPT), is summarized. The MCPT applies Newell and Simon's cognitive processing theory from human computer interaction to user behavior on retail websites. It proposes that two latent variables, clickstream cost and personal cost limit, are responsible for a user staying on or leaving a website. Clickstream cost is the amount of cognitive processing required to reach a given page in the site, which is operationally defined by counting the number of site features and applying the Hick Hyman Law. Personal cost limit is the total amount of cognitive processing that the visitor is willing to invest in the site. When the clickstream cost exceeds his/her personal cost limit, the visitor exits unless he/she has already found and purchased the desired product. From this it is deduced that one of the major latent variables responsible for website abandonment is website complexity (amount of cognitive processing required by the site). Third, an empirical study evaluating the MCPT is summarized. In this experimental study two websites were created: a high-complexity website, with all of the features provided as defaults by the site building software osCommerce, and a low-complexity website, with minimal features. The websites were otherwise identical. In total, 120 participants (each buying two products on both sites) were used. Four major hypotheses were deduced from the MCPT: the higher the complexity, (a) the lower the number of visitors making successful purchases, (b) the greater the amount of time required for purchase, (c) the greater the number of visitors voluntarily exiting the sites before completing any purchase, and (d) the lower the user satisfaction. All major predictions from the MCPT were confirmed with p = .000. Secondary hypotheses suggest the effect of knowledge of B2C site design, self-reported experience in Web purchasing, and learning across websites, as suggested by the MCPT. Fourth, plans for generalizing the theory and further empirical research are summarized.
Comparing business models for multimedia content distribution platforms
Authors: Pieter Ballon, Michael Van Bossuyt
Venue: Proceedings of the International Conference on Mobile Business (2006)

The advent of new mobile and wireless network technologies, the panoply of devices and the array of content types present mobile operators as well as content providers with serious challenges related to multimedia content distribution. This paper compares four feasible business model configurations for multimedia content distribution platforms that may deal with these challenges, focusing on the requirements for mobile operators and content providers, the impact on content distribution architectures and the implications for value propositions towards end users.
Ipsilesional Biases in Saccades but not Perception after Lesions of the Human Inferior Parietal Lobule
Authors: Tony Ro, Chris Rorden, Jon Driver, Robert Rafal
Venue: Journal of Cognitive Neuroscience (2001)

We examined the effects of chronic unilateral lesions to either the inferior parietal lobe, or to the dorsolateral prefrontal cortex including the frontal eye fields (FEFs), upon human visual perception and saccades in temporal-order-judgment (TOJ) tasks. Two visual events were presented on each trial, one in each hemifield at various stimulus onset asynchronies (SOAs). In the saccade task, patients moved their eyes to whichever stimulus attracted gaze first. In the perceptual-manual task, they pressed a button to indicate which stimulus was perceived first. Frontal patients showed appropriate TOJs for visual targets in both tasks. Parietal patients showed appropriate TOJs in the perceptual-manual but not the saccade task; their saccades tended to be ipsilesional unless the contralesional target led substantially. This reveals a bias in saccade choice after parietal damage that cannot be attributed to deficient visual perception. These results challenge previous claims that only anterior lesions produce motoric spatial biases in humans. However, they are in accord with recent neurophysiological evidence for parietal involvement in saccade generation, and also with suggestions that visuomotor transformations in the parietal lobe serving direct spatial motor responses can dissociate from conscious perception as indicated by indirect arbitrary responses.
Multiple Movement Representations in the Human Brain: An Event-Related fMRI Study
Authors: Ivan Toni, Nadim J. Shah, Gereon R. Fink, Daniel Thoenissen, Richard E. Passingham, Karl Zilles
Venue: Journal of Cognitive Neuroscience (2002)

Neurovascular correlates of response preparation have been investigated in human neuroimaging studies. However, conventional neuroimaging cannot distinguish, within the same trial, between areas involved in response selection and/or response execution and areas specifically involved in response preparation. The specific contribution of parietal and frontal areas to motor preparation has been explored in electrophysiological studies in monkey. However, the associative nature of sensorimotor tasks calls for the additional contributions of other cortical regions. In this article, we have investigated the functional anatomy of movement representations in the context of an associative visuomotor task with instructed delays. Neural correlates of movement representations have been assessed by isolating preparatory activity that is independent from the performance of an actual motor act, or from the presence of a response's target. Movement instruction (specified by visual cues) and motor performance (specified by an auditory cue) were separated by a variable delay period. We have used whole-brain event-related fMRI to measure human brain activity during the performance of such a task. We have focused our analysis on specific preparatory activity, defined as a sustained response over variable delay periods between a transient visual instruction cue and a brief motor response, temporally independent from the transient events. Behavioral and electrophysiological controls ensured that preparatory activity was not contaminated by overt motor responses or working memory processes. We report suggestive evidence for multiple movement representations in the human brain. Specific sustained activity in preparation for an action was found not only in parieto-frontal regions but also in extrastriate areas and in the posterior portion of the superior temporal sulcus. We suggest that goal-directed preparatory activity relies on both visuomotor and visuoperceptual areas. These findings point to a functional-anatomical basis for the integration of perceptual and executive processes.
Conditional Random People: Tracking Humans with CRFs and Grid Filters
Authors: Leonid Taycher, David Demirdjian, Trevor Darrell, Gregory Shakhnarovich
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We describe a state-space tracking approach based on a Conditional Random Field (CRF) model, where the observation potentials are learned from data. We find functions that embed both state and observation into a space where similarity corresponds to L1 distance, and define an observation potential based on distance in this space. This potential is extremely fast to compute and in conjunction with a grid-filtering framework can be used to reduce a continuous state estimation problem to a discrete one. We show how a state temporal prior in the grid-filter can be computed in a manner similar to a sparse HMM, resulting in real-time system performance. The resulting system is used for human pose tracking in video sequences.