ppxscal/embedding_network huggingface dataset:
An Ontology-driven Portal for a Collaborative Learning Community
Authors: J. I. Mayorga, B. Barros, C. Celorrio, M. F. Verdejo
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This paper deals with a portal for a group or community organisation and how to take advantage of having an ontology to support its operation and services. The ontology, as a representation mechanism, interprets all the available knowledge and provides adequate ways of exploiting it, which include enhanced searching capabilities to facilitate social navigation. The ontology takes into account the context and users' working style to assist the learners.
Spatial Clustering of Multivariate Genomic and Epigenomic Information
Authors: Rami Jaschek, Amos Tanay
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of gene-regulatory and epigenetics marks on a global scale. This new experimental methodology was recently applied to map multiple histone marks and genomic factors, characterizing patterns of genome organization and discovering interactions among processes of epigenetic reprogramming during cellular differentiation. The new data poses a significant computational challenge in both size and statistical heterogeneity. Understanding it collectively and without bias remains an open problem. Here we introduce spatial clustering - a new unsupervised clustering methodology for dissection of large, multi-track genomic and epigenomic data sets into a spatially organized set of distinct combinatorial behaviors. We develop a probabilistic algorithm that finds spatial clustering solutions by learning an HMM model and inferring the most likely genomic layout of clusters. Application of our methods to meta-analysis of combined ChIP-seq and ChIP-chip epigenomic datasets in mouse and human reveals known and novel patterns of local co-occurrence among histone modification and related factors. Moreover, the model weaves together these local patterns into a coherent global model that reflects the higher level organization of the epigenome. Spatial clustering constitutes a powerful and scalable analysis methodology for dissecting even larger scale genomic dataset that will soon become available.
Brief paper: Stabilizing switching design for switched linear systems: A state-feedback path-wise switching approach
Authors: Zhendong Sun
Venue: Automatica (Journal of IFAC) (2009)

This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction-aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set.
Estimation and representation of non-linear static functions using non-orthogonal continuous wavelets
Authors: M. P. Pushpalatha, N. Nalini
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper presents a wavelet neural-network for learning and approximation of non-linear functions. Wavelet networks are a class of neural network that takes advantage of good localization and approximation properties of multiresolution analysis. The proposed model structure is similar to that of Radial Basis Function (RBF) structure and we have restricted to non-orthogonal continuous wavelets i.e. the first and second derivative of Gaussians as wavelet functions. Simulations show that the proposed method outperforms the other reported methods.
SAMPL: a simple aggregation and message passing layer for sensor networks
Authors: Anthony Rowe, Karthik Lakshmanan, Ragunathan (Raj) Rajkumar
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

In recent years, wireless sensor networking has shown great promise in applications ranging from industrial control, environmental monitoring and inventory tracking. Given the resource-constrained nature of sensor devices and the dynamic wireless channel used for communication, a sensor networking protocol needs to be compact, energy efficient and highly adaptable. In this paper we present SAMPL, a simple aggregation and message passing layer, aimed at flexible aggregation of sensor information over a long period of time, and supporting sporadic messages from mobile devices. SAMPL is a compact network layer that operates on top of a low-power CSMA/CA based MAC protocol. The protocol has been designed with extensibility in mind to support new transducer devices and unforeseen applications without requiring reprogramming of the entire network. SAMPL uses a highly adaptive tree-based routing scheme to achieve highly robust operation in a time-varying environment. The protocol supports peer-to-peer data transactions, local storage of data similar to what many RFID systems provide as well as secure gateway to infrastructure communication. SAMPL is built on top of the Nano-RK[1] operating system that runs on the FireFly sensor networking platform. Nano-RK's resource management primitives are used to create virtual energy budgets within SAMPL that enforce application lifetimes. As of October 2008, SAMPL has been operating as part of the Sensor Andrew project at Carnegie Mellon University with battery powered sensor nodes for over seven months and continues to be actively used as a research testbed. We describe our deployment tools and network health monitoring strategies necessary for configuring and maintaining long-term operation of a sensor network. Our approach has led to sustainable average packet success rate of 94% across the entire network.
Fluctuationlessness theorem and its application to boundary value problems of ODEs
Authors: Nejla Altay, Metin Demiralp
Venue: WSEAS Transactions on Mathematics (2009)

A numerical method based on Fluctuationlessness Approximation, which was developed recently, is constructed for solving Boundary Value Problems of Ordinary Differential Equations on appropriately defined Hilbert Spaces. The numerical solution is written in the form of a Maclaurin series. The unknown coefficients of this series are determined by constructing an (n - 2) unknown containing linear system of equations. The eigenvalues of the independent variable's matrix representation are used in the construction of the matrices and the vectors of the linear system. The numerical solution obtained by Fluctuationlessness Approximation is then compared with the Maclaurin coefficients of the analytical solution to observe the quality of the convergence. Some illustrative examples are presented in order to give an idea about the efficiency of the method explained here.
Sams Teach Yourself Service Oriented Architecture in 24 Hours, 1st edition
Authors: Atul Apte
Venue:  (2009)

Service Oriented Architecture (SOA) has grown rapidly in the enterprise software market. The goal of this book is to fill the immediate and real need for technical and nontechnical individuals to understand the benefits of SOA and how to successfully adopt and manage SOA initiatives and projects.
MayBMS: a probabilistic database management system
Authors: Jiewen Huang, Lyublena Antova, Christoph Koch, Dan Olteanu
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept for its ease of use, we have built on top of MayBMS a Web-based application that offers NBA-related information based on what-if analysis of team dynamics using data available at www.nba.com.
Modular Distribution and Application to Discrete Controller Synthesis
Authors: Gwenaël Delaval
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper shows the application of the automatic distribution of synchronous reactive programs to the specific problem of discrete controller synthesis of complex reactive systems. Discrete controller synthesis is a formal method used to ensure properties on a flexible system which does not a priori verify them. However, this method is efficient only on Boolean programs. More complex embedded systems, comprising complex data types and structures, cannot be addressed without abstraction means. We show how such abstractions can be obtained automatically using a type-directed projection operation. This operation allows then the safe recombination of the result of the synthesis with the original abstracted system, preserving the ensured properties.
The Two-Guard Polygon Walk Problem
Authors: John Z. Zhang
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Consider a simple polygon. A walk is conducted by two guards on the polygon boundary. They start at a boundary point and walk on the boundary. It is required that the two guards maintain their mutual visibility at all times and eventually meet together again. A polygon may or may not be walkable, depending on where the two guards start their walk or no matter where they start on the boundary. In this work, we characterize the class of walkable polygons by two guards by presenting a set of forbidden patterns. 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
Numerical method and analytical technique of the modified anomalous subdiffusion equation with a nonlinear source term
Authors: F. Liu, C. Yang, K. Burrage
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we consider a modified anomalous subdiffusion equation with a nonlinear source term for describing processes that become less anomalous as time progresses by the inclusion of a second fractional time derivative acting on the diffusion term. A new implicit difference method is constructed. The stability and convergence are discussed using a new energy method. Finally, some numerical examples are given. The numerical results demonstrate the effectiveness of theoretical analysis.
Bip: Towards a Highly Configurable Business Intelligence Framework
Authors: Ping Tang
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

The Bip intelligent business solution is the basics for all business systems. It is a total solution for enterprise or SME business application implementation. This business process building block offers an easy-to-use practical tool to customize business needs in a short time, usually in hands on the user. In line with the latest application development universe, user-maintained rule-based application engine with easily customizable screen flows are the basics provided in the building block. Toppling with the latest business intelligence capability and enhanced graphic interface makes the framework a good landing base towards a swift to the long-standing programming platform. 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
Cryptanalysis of CubeHash
Authors: Eric Brier, Thomas Peyrin
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

CubeHash is a family of hash functions submitted by Bernstein as a SHA-3 candidate. In this paper, we provide two different cryptanalysis approaches concerning its collision resistance. Thanks to the first approach, related to truncated differentials, we computed a collision for the CubeHash-1/36 hash function, i.e. when for each iteration 36 bytes of message are incorporated and one call to the permutation is applied. Then, the second approach, already used by Dai, much more efficient and based on a linearization of the scheme, allowed us to compute a collision for the CubeHash-2/4 hash function. Finally, a theoretical collision attack against CubeHash-2/3, CubeHash-4/4 and CubeHash-4/3 is described. This is currently by far the best known cryptanalysis result on this SHA-3 candidate.
Architecture of Multiagent Internet Measurement System MWING Release 2
Authors: Leszek Borzemski, Łukasz Cichocki, Marta Kliber
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Internet performance measurements have motivated the development of a measurement system called MWING. Recently the existing system has evolved according to new requirements and now also distributed measurements are handled in Release 2. MWING system Release 2 is a multi-agent system that is used to perform tests, measurements and diagnosis of Internet and Web performance from the end user perspective. Multiple agents freely scattered in the Internet can, in synchronous or asynchronous manner, probe collectively given set of Web sites, and collect mutual performance data. This data can be used in the analysis of Internet performance e.g. for the needs of Content Delivery Networks and Grids. This kind of measurements is also desired and helpful for Internet Service Providers since it enables monitoring and analysis how ISP's domain is perceived by end-users from various Internet locations.
Interval regression analysis using support vector networks
Authors: Pei-Yi Hao
Venue: Fuzzy Sets and Systems (2009)

Support vector machines (SVMs) have been very successful in pattern classification and function estimation problems for crisp data. In this paper, the v-support vector interval regression network (v-SVIRN) is proposed to evaluate interval linear and nonlinear regression models for crisp input and output data. As it is difficult to select an appropriate value of the insensitive tube width in @e-support vector regression network, the proposed v-SVIRN alleviates this problem by utilizing a new parametric-insensitive loss function. The proposed v-SVIRN automatically adjusts a flexible parametric-insensitive zone of arbitrary shape and minimal size to include the given data. Besides, the proposed method can achieve automatic accuracy control in the interval regression analysis task. For a priori chosen v, at most a fraction v of the data points lie outside the interval model constructed by the proposed v-SVIRN. To be more precise, v is an upper bound on the fraction of training errors and a lower bound on the fraction of support vectors. Hence, the selection of v is more intuitive. Moreover, the proposed algorithm here is a model-free method in the sense that we do not have to assume the underlying model function. Experimental results are then presented which show the proposed v-SVIRN is useful in practice, especially when the noise is heteroscedastic, that is, the noise strongly depends on the input value x.
Model based testing for agent systems
Authors: Zhiyong Zhang, John Thangarajah, Lin Padgham
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

The use of agent technology for building complex systems is increasing, and there are compelling reasons to use this technology. Benfield [1] showed a productivity gain of over 300% using a BDI (Belief Desire Intention) agent approach, while other work calculated that a very modest plan and goal structure provides well over a million ways to achieve a given goal, providing enormous flexibility in a modular manner.
A partial Horn recursion in the cohomology of flag varieties
Authors: Edward Richmond
Venue: Journal of Algebraic Combinatorics: An International Journal (2009)

Horn recursion is a term used to describe when non-vanishing products of Schubert classes in the cohomology of complex flag varieties are characterized by inequalities parameterized by similar non-vanishing products in the cohomology of "smaller" flag varieties. We consider the type A partial flag variety and find that its cohomology exhibits a Horn recursion on a certain deformation of the cup product defined by Belkale and Kumar (Invent. Math. 166:185---228, 2006). We also show that if a product of Schubert classes is non-vanishing on this deformation, then the associated structure constant can be written in terms of structure constants coming from induced Grassmannians.
The key technology and solution of IPTV
Authors: Ya-Xing Yuan
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

This paper introduces the basic concept of IPTV. Then analyzes several key techniques and presents relevant solutions of IPTV in detail. Finally, it investigates how to improve the QoS of current large-scale IPTV.
Fundamentals of Software Integration, 1st edition
Authors: Kay Hammer, Tina Timmerman
Venue:  (2007)

Integration is one of the most critical technical challenges in software today, as well as a difficult topic to generalize because of the many things affecting it the technologies involved, the timeframe, the number and types of user communities requiring access, regulatory requirements, and so on. Fundamentals of Software Integration provides an overview of the evolution of software technology, with a particular emphasis on long-standing problems that remain unsolved. It then uses this background as a basis for presenting an abstract model of the software application and its environment, along with a methodology for how to use this model to develop an integration strategy that meets both short and long-term needs of the organization. Hammer and Timmerman's accessible writing style and strategic exercises help students recognize similarities in the integration challenges faced across technologies.
Diffusion of Pedagogical Innovations in Schools --Research Design Using ABM Method
Authors: Jun-Song Huang
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

Grounded in complex theory, this research adopts Agent-Based Modeling (ABM) approach and aims to explore the strategies and conditions for sustainable and scaleable diffusion of pedagogical innovations. Teachers are modeled as individual agents who interact with their near peers in school social networks and make adoption decisions based on bounded rational. The diffusion pattern emerges in spatial-temporal landscape. The model enables policy-makers and school leaders to explore in “what-if” scenarios and the research findings will contribute to the understanding of diffusion phenomena from holism perspective.
An epistemic characterization of zero knowledge
Authors: Joseph Y. Halpern, Rafael Pass, Vasumathi Raman
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula that completely characterizes zero knowledge; that is, a formula that holds iff a proof is zero knowledge. We present such a formula, and show that it does characterize zero knowledge. Moreover, we show that variants of the formula characterize variants of zero knowledge such as concurrent zero knowledge [Dwork, Naor, and Sahai 2004] and proofs of knowledge [Feige, Fiat, and Shamir 1987; Tompa and Woll 1987].
Fully Discrete Analysis of a Discontinuous Finite Element Method for the Keller-Segel Chemotaxis Model
Authors: Yekaterina Epshteyn, Ahmet Izmirlioglu
Venue: Journal of Scientific Computing (2009)

This paper formulates and analyzes fully discrete schemes for the two-dimensional Keller-Segel chemotaxis model. The spatial discretization of the model is based on the discontinuous Galerkin methods and the temporal discretization is based either on Forward Euler or the second order explicit total variation diminishing (TVD) Runge-Kutta methods. We consider Cartesian grids and prove fully discrete error estimates for the proposed methods. Our proof is valid for pre-blow-up times since we assume boundedness of the exact solution.
A Computer Science Text Corpus/Search Engine X-Tec and Its Applications
Authors: Takehiro Tokuda, Yusuke Soyama, Tetsuya Suzuki
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

We built a computer science text corpus/search engine called X-Tec. We automatically collected 2.98 million sentences (68.9 million words) from carefully chosen English computer science documents on the Web using 678 hours. We also built an interactive sample sentence query system and an automatic expression diag-nostic system for graduate students. Our computer science text corpus/search engine can be also used for knowledge search and word co-occurrence frequency retrieval.
NetReview: detecting when interdomain routing goes wrong
Authors: Andreas Haeberlen, Ioannis Avramopoulos, Jennifer Rexford, Peter Druschel
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Despite many attempts to fix it, the Internet's interdomain routing system remains vulnerable to configuration errors, buggy software, flaky equipment, protocol oscillation, and intentional attacks. Unlike most existing solutions that prevent specific routing problems, our approach is to detect problems automatically and to identify the offending party. Fault detection is effective for a larger class of faults than fault prevention and is easier to deploy incrementally. To show that fault detection is useful and practical, we present NetReview, a fault detection system for the Border Gateway Protocol (BGP). NetReview records BGP routing messages in a tamper-evident log, and it enables ISPs to check each other's logs against a high-level description of the expected behavior, such as a peering agreement or a set of best practices. At the same time, NetReview respects the ISPs' privacy and allows them to protect sensitive information. We have implemented and evaluated a prototype of NetReview; our results show that NetReview catches common Internet routing problems, and that its resource requirements are modest.
Compiler-assisted soft error detection under performance and energy constraints in embedded systems
Authors: Jie Hu, Feihui Li, Vijay Degalahal, Mahmut Kandemir, N. Vijaykrishnan, Mary J. Irwin
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

Soft errors induced by terrestrial radiation are becoming a significant concern in architectures designed in newer technologies. If left undetected, these errors can result in catastrophic consequences or costly maintenance problems in different embedded applications. In this article, we focus on utilizing the compiler's help in duplicating instructions for error detection in VLIW datapaths. The instruction duplication mechanism is further supported by a hardware enhancement for efficient result verification, which avoids the need of additional comparison instructions. In the proposed approach, the compiler determines the instruction schedule by balancing the permissible performance degradation and the energy constraint with the required degree of duplication. Our experimental results show that our algorithms allow the designer to perform trade-off analysis between performance, reliability, and energy consumption.