ppxscal/embedding_network huggingface dataset:
Shape and Texture Based Classification of Fish Species
Authors: Rasmus Larsen, Hildur Olafsdottir, Bjarne Kjær Ersbøll
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

In this paper we conduct a case study of fish species classification based on shape and texture. We consider three fish species: cod, haddock, and whiting. We derive shape and texture features from an appearance model of a set of training data. The fish in the training images were manual outlined, and a few features including the eye and backbone contour were also annotated. From these annotations an optimal MDL curve correspondence and a subsequent image registration were derived. We have analyzed a series of shape and texture and combined shape and texture modes of variation for their ability to discriminate between the fish types, as well as conducted a preliminary classification. In a linear discrimant analysis based on the two best combined modes of variation we obtain a resubstitution rate of 76 %.
Best-first AND/OR search for graphical models
Authors: Radu Marinescu, Rina Dechter
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to the structure of the graphical model, which can translate into significant time savings. Indeed, in recent years depth-first AND/OR Branch-and-Bound algorithms were shown to be very effective when exploring such search spaces, especially when using caching. Since best-first strategies are known to be superior to depth-first when memory is utilized, exploring the best-first control strategy is called for. In this paper we introduce two classes of best-first AND/OR search algorithms; those that explore a context-minimal AND/OR search graph and use static variable orderings, and those that use dynamic variable orderings but explore an AND/OR search tree. The superiority of the best-first search approach is demonstrated empirically on various real-world benchmarks.
Adaptive channel and power allocation of downlink multi-user MC-CDMA systems
Authors: Jun-Bo Wang, Ming Chen, Jiangzhou Wang
Venue: Computers and Electrical Engineering (2009)

The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very attractive multiple access technique for high-rate data transmission in the future wireless communication systems. This paper is focused on the joint channel and power allocation in the downlink transmission of multi-user MC-CDMA systems and considers the throughput maximization problem as a mixed integer optimization problem. For simple analysis, the problem is divided into two less complex sub-problems: power allocation and channel allocation, which can be solved by a suboptimal Adaptive Power Allocation (APA) algorithm and an optimal Adaptive Channel Allocation (ACA) algorithm, respectively. By combining APA and ACA algorithms, an adaptive channel and power allocation scheme is proposed. The numerical results show that the proposed APA algorithm is more suitable for MC-CDMA systems than the conventional equal power allocation algorithm, and the proposed channel and power allocation scheme can significantly improve the system throughput performance.
Study on the Growth and Degradation Characteristics of Atrazine Degradation Strain Named J2
Authors: Zhao Jiang, Jing Li, Xinran Peng, Yao Ma, Rongjuan Wang, Ying Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

This paper mainly studies the growth and degradation characteristics of the atrazine degradation strain J2 isolated from the soil collected from the cornfield in northern China with a long history of atrazine application. The growth and the degradation characteristics at different pHs, temperatures and in mediums with different salinity are also studied. The results indicate that: when J2 is inoculated 1% into the medium, it can degrade the atrazine, whose concentration in the medium is 100mg/L, completely within 72h. When the medium is cultured at 30°C with a pH of 7, the growth and the degradation ability of J2 become best. When the salinity of the medium is increases, the growing and degrading abilities of J2 get worse gradually, this indicates that J2 can not endure high salinity.
DP-Complete Problems Derived from Extremal NP-Complete Properties
Authors: Yi Cao, Joseph Culberson, Lorna Stewart
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

In contrast to the extremal variants of coNP-complete problems, which are frequently DP-complete, many extremal variants of NP-complete problems are in P. We investigate the extremal variants of two NP-complete problems, the extremal colorability problem with restricted degree and the extremal unfrozen non-implicant problem, and show that both of them are DP-complete.
Development during adolescence of the neural processing of social emotion
Authors: Stephanie Burnett, Geoffrey Bird, Jorge Moll, Chris Frith, Sarah-Jayne Blakemore
Venue: Journal of Cognitive Neuroscience (2009)

In this fMRI study, we investigated the development between adolescence and adulthood of the neural processing of social emotions. Unlike basic emotions (such as disgust and fear), social emotions (such as guilt and embarrassment) require the representation of another's mental states. Nineteen adolescents (10-18 years) and 10 adults (22-32 years) were scanned while thinking about scenarios featuring either social or basic emotions. In both age groups, the anterior rostral medial prefrontal cortex (MPFC) was activated during social versus basic emotion. However, adolescents activated a lateral part of the MPFC for social versus basic emotions, whereas adults did not. Relative to adolescents, adults showed higher activity in the left temporal pole for social versus basic emotions. These results show that, although the MPFC is activated during social emotion in both adults and adolescents, adolescents recruit anterior (MPFC) regions more than do adults, and adults recruit posterior (temporal) regions more than do adolescents.
Pace: Privacy-Protection for Access Control Enforcement in P2P Networks
Authors: Marc Sánchez-Artigas, Pedro García-López
Venue: Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems (2009)

In open environments such as peer-to-peer (P2P) systems, the decision to collaborate with multiple users -- e.g., by granting access to a resource -- is hard to achieve in practice due to extreme decentralization and the lack of trusted third parties. The literature contains a plethora of applications in which a scalable solution for distributed access control is crucial. This fact motivates us to propose a protocol to enforce access control, applicable to networks consisting entirely of untrusted nodes. The main feature of our protocol is that it protects both sensitive permissions and sensitive policies, and does not rely on any centralized authority. We analyze the efficiency (computational effort and communication overhead) as well as the security of our protocol.
Mapping the learning pathways and processes associated with the development of expertise and learner identities
Authors: Leah A. Bricker, Philip Bell, Suzanne Reeve, Brigid Barron, Nichole Pinkard, Kimberly Gomez, Caitlin Kennedy Martin, Akili Lee, Mark Chen, Heather Toomey Zimmerman, Carrie Tzou, Giovanna Scalone, Christopher Hoadley, Sameer Honwad, Vénique Mertl, Laurie McCarthy, Reed Stevens, Sheldon Levias, Flávio S. Azevedo
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

This poster session showcases ten examples of expertise development in everyday domains of personal relevance and consequence to learners. The collection of cases highlighted in the posters stem from ethnographic research studies investigating learning from socio-cultural-historical perspectives. In each poster, authors describe their ethnographic project, explicate a case of expertise development, and detail the specific learning processes, practices, and pathways associated with that expertise development. Implications for understanding personally relevant and consequential learning for the design of effective learning environments in K-12 STEM classrooms and beyond will be discussed. Discussion will also include plans for the design and implementation of a data repository, which will house a broad set of learning cases, such as those detailed in this poster session, with the goals of supporting collaborative theoretical synthesizing related to diverse learning-related phenomena and helping researchers and educators understand the details of learning as it socially occurs in meaningful ways.
Abductive logic programming by nonground rewrite systems
Authors: Fangzhen Lin, Jia-Huai You
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, under which the problem of abduction becomes one of solving quantified equations and disequations. By this way of treating abduction, the problems with nonground negative queries in the previous approaches no longer exist. We show the soundness and completeness results for our approach.
Design and implementation of S-MARKS: A secure middleware for pervasive computing applications
Authors: Sheikh Iqbal Ahamed, Haifeng Li, Nilothpal Talukder, Mehrab Monjur, Chowdhury Sharif Hasan
Venue: Journal of Systems and Software (2009)

As portable devices have become a part of our everyday life, more people are unknowingly participating in a pervasive computing environment. People engage with not a single device for a specific purpose but many devices interacting with each other in the course of ordinary activity. With such prevalence of pervasive technology, the interaction between portable devices needs to be continuous and imperceptible to device users. Pervasive computing requires a small, scalable and robust network which relies heavily on the middleware to resolve communication and security issues. In this paper, we present the design and implementation of S-MARKS which incorporates device validation, resource discovery and a privacy module.
Generating plans in concurrent, probabilistic, over-subscribed domains
Authors: Li Li, Nilufer Onder
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Planning in realistic domains involves reasoning under uncertainty, operating under time and resource constraints, and finding the optimal set of goals to be achieved. In this paper, we provide an AO* based algorithm that can deal with durative actions, concurrent execution, over-subscribed goals, and probabilistic outcomes in a unified way. We explore plan optimization by introducing two novel aspects to the model. First, we introduce parallel steps that serve the same goal and increase the probability of success in addition to parallel steps that serve different goals and decrease execution time. Second, we introduce plan steps to terminate concurrent steps that are no longer useful so that resources can be conserved. Our algorithm called CPOAO* (Concurrent, Probabilistic, Oversubscription AO*) can deal with the aforementioned extensions and relies on the AO* framework to reduce the size of the search space using informative heuristic functions. We describe our framework, implementation, the heuristic functions we use, the experimental results, and potential research on heuristics that can further reduce the size of search space.
Eye Movements and Pupil Size Reveal Deception in Computer Administered Questionnaires
Authors: Andrea K. Webb, Douglas J. Hacker, Dahvyn Osher, Anne E. Cook, Dan J. Woltz, Sean Kristjansson, John C. Kircher
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

An oculomotor test is described that uses pupil diameter and eye movements during reading to detect deception. Forty participants read and responded to statements on a computerized questionnaire about their possible involvement in one of two mock crimes. Twenty guilty participants committed one of two mock crimes, and 20 innocent participants committed no crime. Guilty participants demonstrated speeded and accurate reading when they encountered statements about their crime and increases in pupil size. A discriminant function of oculomotor measures successfully discriminated between guilty and innocent participants and between the two groups of guilty participants. Results suggest that oculomotor tests may be of value for pre-employment and security screening applications.
A tensor artificial viscosity using a finite element approach
Authors: Tz. V. Kolev, R. N. Rieben
Venue: Journal of Computational Physics (2009)

We derive a tensor artificial viscosity suitable for use in a 2D or 3D unstructured arbitrary Lagrangian-Eulerian (ALE) hydrodynamics code. This work is similar in nature to that of Campbell and Shashkov [1]; however, our approach is based on a finite element discretization that is fundamentally different from the mimetic finite difference framework. The finite element point of view leads to novel insights as well as improved numerical results. We begin with a generalized tensor version of the Von Neumann-Richtmyer artificial viscosity, then convert it to a variational formulation and apply a Galerkin discretization process using high order Gaussian quadrature to obtain a generalized nodal force term and corresponding zonal heating (or shock entropy) term. This technique is modular and is therefore suitable for coupling to a traditional staggered grid discretization of the momentum and energy conservation laws; however, we motivate the use of such finite element approaches for discretizing each term in the Euler equations. We review the key properties that any artificial viscosity must possess and use these to formulate specific constraints on the total artificial viscosity force term as well as the artificial viscosity coefficient. We also show, that under certain simplifying assumptions, the two-dimensional scheme from [1] can be viewed as an under-integrated version of our finite element method. This equivalence holds on general distorted quadrilateral grids. Finally, we present computational results on some standard shock hydro test problems, as well as some more challenging problems, indicating the advantages of the new approach with respect to symmetry preservation for shock wave propagation over general grids.
Towards a Component-Based Architecture for TeleAgents
Authors: Ockmer L. Oosthuizen, Elizabeth M. Ehlers
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

The component-based design of software systems has long been recognised in the realm of software engineering as a method for building highly adaptable and maintainable software systems. This paper explores the principles behind software agent-orientated frameworks and the component-based design of software agents. The ideas and principles discussed are then used in the introduction of our AgentAssembly framework and its application to the component-based construction of TeleAgents.
A generalization of column generation to accelerate convergence
Authors: Dong Liang, Wilbert E. Wilhelm
Venue: Mathematical Programming: Series A and B (2009)

This paper proposes a generalization of column generation, reformulating the master problem with fewer variables at the expense of adding more constraints; the sub-problem structure does not change. It shows both analytically and computationally that the reformulation promotes faster convergence to an optimal solution in application to a linear program and to the relaxation of an integer program at each node in the branch-and-bound tree. Further, it shows that this reformulation subsumes and generalizes prior approaches that have been shown to improve the rate of convergence in special cases.
Face Recognition under Variant Illumination Using PCA and Wavelets
Authors: Mong-Shu Lee, Mu-Yen Chen, Fu-Sen Lin
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

In this paper, an efficient wavelet subband representation method is proposed for face identification under varying illumination. In our presented method, prior to the traditional principal component analysis (PCA), we use wavelet transform to decompose the image into different frequency subbands, and a low-frequency subband with three secondary high-frequency subbands are used for PCA representations. Our aim is to compensate for the traditional wavelet-based methods by only selecting the most discriminating subband and neglecting the scattered characteristic of discriminating features. The proposed algorithm has been evaluated on the Yale Face Database B. Significant performance gains are attained.
Analyzing collaborative contexts: professional musicians, corporate engineers, and communities in the himalayas
Authors: Véronique Mertl, Timothy Kieran O'Mahony, Kersti Tyson, Leslie R. Herrenkohl, Sameer Honwad, Christopher Hoadley
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

This paper reports on the collaborative experiences and theories of members of professional and community settings who work with others in their everyday practices. Data are drawn from interviews and field observations with professional musicians who collaborate regularly for performances, corporate engineers working in groups, and community members exchanging perspectives on sustainable practices for their village. Performing chamber music, designing a new technology-driven plane, or making decisions about sustainability in rural communities, all require sophisticated collaboration to generate ideas from multiple perspectives, problem solve, and innovate. The research we present explores the demands on the environment, the relational space, and the shifts that occur for participants in their collaborative settings. The findings from these studies emphasize the multidimensionality of collaboration and the importance of collaboration as a tool for learning and decision-making in given contexts.
Isotonic Classification Trees
Authors: Rémon Kamp, Ad Feelders, Nicola Barile
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

We propose a new algorithm for learning isotonic classification trees. It relabels non-monotone leaf nodes by performing the isotonic regression on the collection of leaf nodes. In case two leaf nodes with a common parent have the same class after relabeling, the tree is pruned in the parent node. Since we consider problems with ordered class labels, all results are evaluated on the basis of L 1 prediction error. We experimentally compare the performance of the new algorithm with standard classification trees.
A Model to Simulate Web Users' Eye Movements
Authors: Myriam Chanceaux, Anne Guérin-Dugué, Benoît Lemaire, Thierry Baccino
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

One of the most important tasks on the Web is foraging information. In this study, we present a computational model which simulates human eye movements during information seeking in Web pages. Human visual scanpaths are guided by their information needs, by the visual features of the stimuli and by what they previously processed. Our model takes into account both semantic (top-down) and visual (bottom-up) information, as well as a memory model in order to predict the focus of attention. Our model operates at the block level, but also at the word level. To validate this model, both participants and model were asked to seek information in a pseudo online newspaper. We find good correspondence between simulated and empirically observed scanpaths. Knowing where the user is looking at while searching for information is crucial for evaluating the usability of Web sites and contribute to the design of Web pages.
The complexity of reasoning with cardinality restrictions and nominals in expressive description logics
Authors: Stephan Tobies
Venue: Journal of Artificial Intelligence Research (2000)

We study the complexity of the combination of the Description Logics ALCQ and ALCQI with a terminological formalism based on cardinality restrictions on concepts. These combinations can naturally be embedded into C2, the two variable fragment of predicate logic with counting quantifiers, which yields decidability in NExpTime. We show that this approach leads to an optimal solution for ALCQI, as ALCQI with cardinality restrictions has the same complexity as C2 (NExpTime-complete). In contrast, we show that for ALCQ, the problem can be solved in ExpTime. This result is obtained by a reduction of reasoning with cardinality restrictions to reasoning with the (in general weaker) terminological formalism of general axioms for ALCQ extended with nominals. Using the same reduction, we show that, for the extension of ALCQI with nominals, reasoning with general axioms is a NExpTime-complete problem. Finally, we sharpen this result and show that pure concept satisfiability for ALCQI with nominals is NExpTime-complete. Without nominals, this problem is known to be PSpace-complete.
Reachability for Continuous and Hybrid Systems
Authors: Oded Maler
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

In this talk I present some past, present and future work concerning reachability computation for continuous and hybrid systems.
Gauss-Lobatto-Kronrod Formulae and Adaptive Numerical Integration
Authors: Radu Tiberiu Trimbitas, Maria Gabriela Trimbitas
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The aim of this paper is to develop a MATLAB function for one dimensional numerical integration based on adaptive algorithms and Gauss-Lobatto-Kronrod formulas. Using Maple, we find a triple of formulas, and then we use it to code ananalogous of MATLAB quadl function with a higher degree ofexactness. Finally, some examples and tests which compare our function and quadl are given. Our function is a good alternative to quadl when the accuracy and reliability requirements are hard.
Naïve possibilistic network classifiers
Authors: Bakhta Haouari, Nahla Ben Amor, Zied Elouedi, Khaled Mellouli
Venue: Fuzzy Sets and Systems (2009)

Naive Bayesian network classifiers have proved their effectiveness to accomplish the classification task, even if they work under the strong assumption of independence of attributes in the context of the class node. However, as all of them are based on probability theory, they run into problems when they are faced with imperfection. This paper proposes a new approach of classification under the possibilistic framework with naive classifiers. To output the naive possibilistic network classifier, two procedures are studied namely the building phase, which deals with imperfect (imprecise/uncertain) dataset attributes and classes, and the classification phase, which is used to classify new instances that may be characterized by imperfect attributes. To improve the performance of our classifier, we propose two extensions namely selective naive possibilistic classifier and semi-naive possibilistic classifier. Experimental study has shown naive Bayes style possibilistic classifier, and is efficient in the imperfect case.