ppxscal/embedding_network huggingface dataset:
Discovering the Local Co-occurring Patterns in Visual Categorization
Authors: Hongbin Wang, Paul Miller, Phil. F. Culverhouse
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

We present a novel visual representation, called local co-occurring patterns (LCPs), which consists of characteristic local features and the statistical co-occurance relations between them. The LCPs can be discovered using an associate rule mining algorithm. Experiments show that LCPs widely exist in a large image corpus, and are more discriminant than individual local features in visual categorization tasks such as subcategory and face recognition. Furthermore, state-of-the-art categorization performance was achieved on two test data-sets.
The Significance of Emotion and Empathy in Learning with MC3
Authors: Bridget Cooper
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper considers the thinking and findings from five projects which consider deeply the role of affect in the learning process and applies the thinking to virtual learning environments. It concludes that consideration of affect in learning has not been seriously considered for the future of learning on line, which is why many virtual learning environments fail to engender positive emotion in learners and teachers and therefore have limited capacity for successful learning.
Fuzzy clustering algorithms for symbolic interval data based on adaptive and non-adaptive Euclidean distances
Authors: Francisco de A. T. de Carvalho
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

The recording of symbolic interval data has become a common practice with the recent advances in database technologies. This paper presents fuzzy c-means clustering algorithms for symbolic interval data. The proposed methods furnish a partition of the input data and a corresponding prototype (a vector of intervals) for each class by optimizing an adequacy criterion which is based on adaptive and non-adaptive Euclidean distance between vectors of intervals. Experiments with real and synthetic symbolic interval data sets showed the usefulness of the proposed method.
Generating Compact Redundancy-Free XML Documents from Conceptual-Model Hypergraphs
Authors: Wai Yin Mok, David W. Embley
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

As XML data becomes more and more prevalent and as larger quantities of data find their way into XML documents, the need for quality XML data organization will only increase. One standard way of structuring data well is to reduce and, if possible, eliminate redundancy, while at the same time making the storage structures as compact as possible. In this paper, we present a methodology to generate XML storage structures where conforming XML documents are redundancy-free, and for most practical cases, are also fully compact. Our methodology assumes the input is a conceptual-model hypergraph. For the special case that every edge in the hypergraph is binary, we present a simple algorithm, guaranteed to always generate redundancy-free storage structures. We show, however, that generating a minimum number of redundancy-free storage structures is NP-hard. We therefore provide heuristics to guide the process and observe that these heuristics result in satisfactory solutions, which are often optimal. We then present a general algorithm for n{\hbox{-}}\rm ary edges and show that it generates redundancy-free storage structures. The general algorithm must overcome several problems that do not arise in the special case.
Blended Rank Evolutionary Algorithm for the Constrained Multiobjective Crop Rotation Problem
Authors: Nicholas Young, Russel Stonier
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)

In a constrained multiobjective problem, solutions can be mapped onto three spaces: decision variable space, objective space, and constraint space. Blended Rank Evolutionary Algorithm uses measures from all three spaces and dynamically blends them together into a final fitness score for use in an evolutionary algorithm. Results on the highly constrained, multiobjective "nonlinear crop rotation" problem show that BREA reliably finds better quality non-dominated fronts than the popular algorithm NSGA-II. The difficulty of the nonlinear crop rotation problem leaves room for improvement in both algorithms.
Finding DNA Motifs Using Genetic Algorithms
Authors: Carlos Reyes-Rico
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Organism's DNA genes are expressed by regulatory and functional proteins which group together into a sequence called motif. Finding motifs in a collection of sequences is a fundamental problem in Bioinformatics. This paper presents a method based on genetic algorithms by MotifSearcher system and an analysis of results in comparison with other probabilistic methods. Finally experimental results demonstrate that genetic algorithms are capable of producing better results than Gibbs sampling methods.
On using SPEEDES as a platform for a parallel swarm simulation
Authors: Matthew A. Russell, Gary B. Lamont, Kenneth Melendez
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Unmanned Aerial Vehicle (UAV) research is an increasingly important pillar of national security and military interest. A high fidelity discrete event simulation is prerequisite to any systems implementation. The Synchronous Parallel Environment for Emulation and Discrete Event Simulation (SPEEDES) is a versatile and powerful tool that can be used for realization of this objective. A suite of five experiments measures the efficiency a parallel UAV swarming SPEEDES application. Results indicate that the conservative time management produces more than twice the speedup as optimistic time management.
Personalized Knowledge Service Framework for Mobile Learning
Authors: Jixin Wang, Xia Li, Tao Huang, Bei Wu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

As mobile technologies become widespread, teachers and students will be increasingly mobile, using more portable devices and interacting with computationally-enhanced learning environment. In this paper, we proposed a personalized knowledge service framework for mobile learning to adapt knowledge to different learners, leveraging Semantic Web Services in support of context awareness. This includes modeling sources of context information as web services that can be automatically discovered and accessed by knowledge adaptation engine, which assist the mobile learners with different sets of learning tasks. The paper then described the decision algorithm based on the requirements process and described the system implementation.
Longitudinal Profiles of Semantic Impairment for Living and Nonliving Concepts in Dementia of Alzheimer's Type
Authors: Peter Garrard, Matthew A. Lambon Ralph, Peter C. Watson, Jane Powis, Karalyn Patterson, John R. Hodges
Venue: Journal of Cognitive Neuroscience (2001)

Two types of theoretical account have been proposed to explain the phenomenon of category-specific impairment in tests of semantic memory: One stresses the importance of different cortical regions to the representation of living and nonliving categories, while the other emphasize the importance of statistical relationships among features of concepts belonging to these two broad semantic domains. Theories of the latter kind predict that the direction of a domain advantage will be determined in large part by the overall damage to the semantic system, and that the profiles of patients with progressive impairments of semantic memory are likely to include a point at which an advantage for one domain changes to an advantage for the other. The present series of three studies employed semantic test data from two separate cohorts of patients with probable dementia of Alzheimer's type (DAT) to look for evidence of such a crossover. In the first study, longitudinal test scores from a cohort of 58 patients were examined to confirm the presence of progressive semantic deterioration in this group. In the second study, Kaplan-Meier survival curves based on serial naming responses and plotted separately for items belonging to living and nonliving domains indicated that the representations of living concepts (as measured by naming) deteriorated at a consistently and significantly faster rate than those of nonliving concepts. A third study, carried out to look in detail at the performance of mildly affected patients, employed an additional cross-sectional cohort of 20 patients with mild DAT and utilized a graded naming assessment. This study also revealed no evidence for a crossover in the advantage of one domain over the other as a function of disease severity. Taken together with the model of anatomical progression in DAT based on the work of Braak and Braak (1991), these findings are interpreted as evidence for the importance of regional cerebral anatomy to the genesis of semantic domain effects in DAT.
The scientific language spoken by optical instruments
Authors: Y. S. Kim
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Most common optical instruments include filters, polarizers, interferometers, lenses, lasers and multilayers. It requires two-by-two matrices to study optical beams going through these optical components. It is therefore possible to study these matrices in terms of the two-by-two representation of the six-parameter Lorentz group. Furthermore, using the correspondence between the two-by-two and four-by-four representations, it is possible to study many of the formulas in optics in terms of the kinematics of Lorentz transformations. Conversely, the optical instruments can serve as analogue computers for events in special relativity. 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
Risk factors in the collaborative development of management information systems for Nigerian universities
Authors: Charles O. Uwadia, Princely E. Ifinedo, Goodluck M. Nwamarah, Emmanuel G. Eseyin, Akin Sawyerr
Venue: Information Technology for Development (2006)

The authors discuss the risk factors associated with the collaborative development of information systems (IS) within the university environment in Nigeria. They use observations and reviews of relevant reports of the project as well as a variation of the Delphi Study in presenting their findings. The study shows that risks were associated with funding, top administrators' commitment, the number of participating universities, the role of the donor, as well as other factors. In addition, the challenges posed by each risk factor and the lessons learned are presented. Primarily, the study reports the scenario of IS development by universities in a developing economy in which the development process is characterized by collaboration. Opportunities for future research on the issue are also outlined.
On the Effectiveness of Secure Overlay Forwarding Systems under Intelligent Distributed DoS Attacks
Authors: Xun Wang Sriram Chellappan Phillip Boyer Dong Xuan
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

In the framework of a set of clients communicating with a critical server over the Internet, a recent approach to protect communication from Distributed Denial of Service (DDoS) attacks involves the usage of overlay systems. SOS, MAYDAY, and I3 are such systems. The architecture of these systems consists of a set of overlay nodes that serve as intermediate forwarders between the clients and the server, thereby controlling access to the server. Although such systems perform well under random DDoS attacks, it is questionable whether they are resilient to intelligent DDoS attacks which aim to infer architectures of the systems to launch more efficient attacks. In this paper, we define several intelligent DDoS attack models and develop analytical/simulation approaches to study the impacts of architectural design features of such overlay systems on the system performance in terms of path availability between clients and the server under attacks. Our data clearly demonstrate that the system performance is indeed sensitive to the architectural features and the different features interact with each other to impact overall system performance under intelligent DDoS attacks. Our observations provide important guidelines in the design of such secure overlay forwarding systems.
Analysis And Classification of IPSec Security Policy Conflicts
Authors: Zhitang Li, Xue Cui, Lin Chen
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

IPSec has been proposed to provide integrity, confidentiality and authentication of data communications over IP networks. However, the complex semantics of IPSec policies results in potential conflicts, such as shielding conflict, redundancy conflict and overlapping conflict, et al. The conflict should be identified and detected to avoid internet security threat. However, there has no research on identifying and defining IPSec security policy conflict formally and comprehensively. So it is necessary to give a depth analysis on policy conflict. Therefore, the paper presents a generic model that represents IPSec security policy semantics. Based on it, we classify and define conflicts formally that may exist in a single IPSec device or in some tunnels between different IPSec devices. That the conflict analysis is comprehensive is proved also. The research provides theoretical foundation for policy conflict detection and prevention in IPSec policy configuration.
Spatial scan statistics: approximations and performance study
Authors: Deepak Agarwal, Andrew McGregor, Jeff M. Phillips, Suresh Venkatasubramanian, Zhengyuan Zhu
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invested in designing efficient algorithms for finding such "high discrepancy" regions, with methods ranging from fast heuristics for special cases, to general grid-based methods, and to efficient approximation algorithms with provable guarantees on performance and quality.In this paper, we make a number of contributions to the computational study of spatial scan statistics. First, we describe a simple exact algorithm for finding the largest discrepancy region in a domain. Second, we propose a new approximation algorithm for a large class of discrepancy functions (including the Kulldorff scan statistic) that improves the approximation versus run time trade-off of prior methods. Third, we extend our simple exact and our approximation algorithms to data sets which lie naturally on a grid or are accumulated onto a grid. Fourth, we conduct a detailed experimental comparison of these methods with a number of known methods, demonstrating that our approximation algorithm has far superior performance in practice to prior methods, and exhibits a good performance-accuracy trade-off.All extant methods (including those in this paper) are suitable for data sets that are modestly sized; if data sets are of the order of millions of data points, none of these methods scale well. For such massive data settings, it is natural to examine whether small-space streaming algorithms might yield accurate answers. Here, we provide some negative results, showing that any streaming algorithms that even provide approximately optimal answers to the discrepancy maximization problem must use space linear in the input.
YALE: rapid prototyping for complex data mining tasks
Authors: Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Martin Scholz, Timm Euler
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring the development of new methods or processing schemes. Like in software development, the development of such solutions demands for careful analysis, specification, implementation, and testing. Rapid prototyping is an approach which allows crucial design decisions as early as possible. A rapid prototyping system should support maximal re-use and innovative combinations of existing methods, as well as simple and quick integration of new ones.This paper describes Yale, a free open-source environment forKDD and machine learning. Yale provides a rich variety of methods whichallows rapid prototyping for new applications and makes costlyre-implementations unnecessary. Additionally, Yale offers extensive functionality for process evaluation and optimization which is a crucial property for any KDD rapid prototyping tool. Following the paradigm of visual programming eases the design of processing schemes. While the graphical user interface supports interactive design, the underlying XML representation enables automated applications after the prototyping phase.After a discussion of the key concepts of Yale, we illustrate the advantages of rapid prototyping for KDD on case studies ranging from data pre-processing to result visualization. These case studies cover tasks like feature engineering, text mining, data stream mining and tracking drifting concepts, ensemble methods and distributed data mining. This variety of applications is also reflected in a broad user base, we counted more than 40,000 downloads during the last twelve months.
IPIC Domain decomposition algorithm for parabolic problems
Authors: Younbae Jun, Tsun-Zee Mai
Venue: Applied Mathematics and Computation (2006)

A domain decomposition algorithm which is based on a semi-implicit prediction and then a fully implicit correction at the interface, for solving parabolic partial differential equations, is presented. The numerical results show that the algorithm is unconditionally stable and very efficient. In this paper, high speed-up is analyzed with respect to the spectral radius and operation counts.
Agency Architecture for Teacher Intervention in Robotics Classes
Authors: Ilkka Jormanainen, Yuejun Zhang, Erkki Sutinen, Prof. Kinshuk
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Teachers working in robotics classes face a major problem: how to keep track on individual students' or even small groups' progress in a class of 30-40 students. An agency approach to this problem is based on having sensors to monitor students' interaction, robots' movements, and the construction and programming process of robots. The design can be implemented with the Lego Mindstorms set using the IPPE programming environment. The designed architecture works well for monitoring small groups, but needs further work to support teacher's intervention to an individual student's learning process
A Multiple View System for Modeling Building Entities
Authors: Frank Steinicke, Timo Ropinski, Klaus Hinrichs, Gerd Bruder
Venue: Proceedings of the Fourth International Conference on Coordinated & Multiple Views in Exploratory Visualization (2006)

Modeling virtual buildings is an essential task in the city planning domain whereas several aspects have essential influence. Planners have to deal with different types of potentially multiform datasets; moreover they have to consider certain guidelines and constraints that are imposed on the development areas to which buildings are related. The planning process can be divided into different subtasks with varying requirements regarding the interaction techniques that are used for their accomplishment. To incorporate these aspects multiple view systems have proven enormous potential in order to provide efficient user interfaces. In this paper, we present strategies for modeling virtual building entities via a multiple view system as part of a 3D decision support system that enables the intuitive generation and evaluation of building proposals. City planners have been involved in the design process of the system, in particular the multiple view concepts. Therefore each view of the system, which visualizes different aspects concerning the underlying models, meets the demands of city planners. Furthermore, we present both coupled and uncoupled interaction techniques between different views with respect to requirements of the city planning domain.
Network I/O Acceleration in Heterogeneous Multicore Processors
Authors: Benjamin Wun, Patrick Crowley
Venue: Proceedings of the 14th IEEE Symposium on High-Performance Interconnects (2006)

Chip multiprocessor (CMP) architectures are fast becoming the dominant design for general purpose processors. Whereas current generation server and desktop processors use homogenous CMP architectures, network processors (NPs) have used heterogeneous CMP architectures for years. At the same time, the failure of network stacks in traditional processors to scale with increased network bandwidths has spawned numerous proposals for new approaches to accelerate network processing. This paper looks at moving network stack processing from the main CPU to a series of smaller, closely coupled, and more efficient processors in a heterogeneous CMP by implementing such an architecture on an Intel IXP network processor. Our experiments show that the close coupling and flexible nature of the IXP's microengines allow them to greatly accelerate network processing for a small cost in area.
Enabling Large-Scale Pervasive Logic Verification through Multi-Algorithmic Formal Reasoning
Authors: Tilman Glokler, Jason Baumgartner, Devi Shanmugam, Rick Seigler, Gary Van Huben, Barinjato Ramanandray, Hari Mony, Paul Roessler
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

Pervasive Logic is a broad term applied to the variety of logic present in hardware designs, yet not a part of their primary functionality. Examples of pervasive logic include initialization and self-test logic. Because pervasive logic is intertwined with the functionality of chips, the verification of such logic tends to require very deep sequential analysis of very large slices of the design. For this reason, pervasive logic verification has hitherto been a task for which formal algorithms were not considered applicable. In this paper, we discuss several pervasive logic verification tasks for which we have found the proper combination of algorithms to enable formal analysis. We describe the nature of these verification tasks, and the testbenches used in the verification process. We furthermore discuss the types of algorithms needed to solve these verification tasks, and the type of tuning we performed on these algorithms to enable this analysis.
A note on vector-valued rational interpolation
Authors: Xiaolin Zhu, Gongqin Zhu
Venue: Journal of Computational and Applied Mathematics (2006)

Graves-Morris (see [P.R. Graves-Morris, Vector valued interpolants I, Numer. Math. 42 (1983) 331-348 and P.R. Graves-Morris and C.D. Jenkins, Vector valued rational interpolants III, Constr. Approx. 2 (1986) 263-289]) defined the generalized inverse rational interpolants (GIRIs) in the form of R(x) = N(x)/D(x) with the divisibility condition D(x) | ||N(x)||2, and proved the Uniqueness Theorem for GIRIs. However, this condition is found not necessary in some cases. In this paper, we remove this divisibility condition, define the extended generalized inverse rational interpolants (EGIRIs) and establish the Uniqueness Theorem for EGIRIs. One can see that the Uniqueness Theorem for GIRIs is the special case of the one for EGIRIs.