ppxscal/embedding_network huggingface dataset:
Performance Evaluation of the Enhanced MI-MAC Protocol for Multimedia Integration over Wireless Cellular Networks
Authors: Theodore Drivas, Polychronis Koutsakis, Michael Paterakis
Venue: Wireless Personal Communications: An International Journal (2009)

In recent work (Koutsakis et al., IEEE Trans Veh Technol 54(5):1863---1874, 2005), we have introduced multimedia integration multiple access control protocol (MI-MAC). The protocol was shown to achieve superior performance in comparison to other protocols of the literature when integrating various types of multimedia traffic over wireless cellular networks. In this work we enhance the scheduling scheme of MI-MAC by adding three important parameters into its study. These are: (a) the handling of handoff traffic, (b) per user varying channel conditions in the uplink and downlink channels and (c) video sources' contention for channel resources. These parameters are added in order to evaluate the protocol under a significantly more realistic wireless cellular network scenario. New scheduling ideas are proposed in order to efficiently incorporate the new parameters into the scheme. The evaluation, conducted by comparing the enhanced MI-MAC with another efficient protocol of the literature and with an "ideal" MAC protocol, focuses on the efficient transmission of MPEG-4 video traffic and shows that our scheme achieves excellent performance results.
Collaborative Narratives: Collaborative Learning in the Blogosphere
Authors: Jude Yew
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This research explores the use of Blogs as an application that is well suited for the development of a learning community. When aggregated through the use of syndication technologies, student-maintained Blogs form a community known as a Blogosphere. The study proposes that such a Blogosphere promotes the construction of a learning community where individuals are able to conduct reflective analysis, observe how others grapple with new information, interact with classmates, and receive feedback from the instructor. This interaction takes place through narrative construction, and fosters cognitive and social processes that influence both individual and group knowledge acquisition. This ability to construct and articulate knowledge collectively through the use of narratives is considered to be superior to learning new concepts individually and in the abstract.
A Novel Algorithm for Detecting Singular Points from Fingerprint Images
Authors: Jie Zhou, Fanglin Chen, Jinwei Gu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Fingerprint analysis is typically based on the location and pattern of detected singular points in the images. These singular points (cores and deltas) not only represent the characteristics of local ridge patterns but also determine the topological structure (i.e., fingerprint type) and largely influence the orientation field. In this paper, we propose a novel algorithm for singular points detection. After an initial detection using the conventional Poincaré Index method, a so-called DORIC feature is used to remove spurious singular points. Then, the optimal combination of singular points is selected to minimize the difference between the original orientation field and the model-based orientation field reconstructed using the singular points. A core-delta relation is used as a global constraint for the final selection of singular points. Experimental results show that our algorithm is accurate and robust, giving better results than competing approaches. The proposed detection algorithm can also be used for more general 2D oriented patterns, such as fluid flow motion, and so forth.
A gentle introduction to the boundary element method in Matlab/Freemat
Authors: Stephen Kirkup, Javad Yazdani
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

The Boundary Element Method is developed in its most simple form; for the solution of Laplace's equation in an interior domain with a straight line approximation to the boundary. The direct and indirect approaches to the boundary element method are included. The methods are developed in Freemat, a language similar to Matlab. The codes for the solution of Laplace's equation in a general domain with a general (Robin) boundary condition are developed. The codes are applied to a typical test problem. The codes are made available as open source and can be downloaded from www.east-lancashire-research.org.uk (report AR-08-14).
Growing with Technology Activities in Action Powered by Lesson Express: Green Level, 1st edition
Authors: Gary B. Shelly, Thomas J. Cashman, Rachel Biheller Bunin
Venue:  (2007)

This unique educational software provides a wealth of additional activities to supplement the Growing with Technology series as well as empowers teachers with no programming skills to easily create even more multimedia activities for their students with existing activities templates.
Electronic Structure Calculations and Adaptation Scheme in Multi-core Computing Environments
Authors: Lakshminarasimhan Seshagiri, Masha Sosonkina, Zhao Zhang
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Multi-core processing environments have become the norm in the generic computing environment and are being considered for adding an extra dimension to the execution of any application. The T2 Niagara processor is a very unique environment where it consists of eight cores having a capability of running eight threads simultaneously in each of the cores. Applications like General Atomic and Molecular Electronic Structure (GAMESS), used for ab-initio molecular quantum chemistry calculations, can be good indicators of the performance of such machines and would be a guideline for both hardware designers and application programmers. In this paper we try to benchmark the GAMESS performance on a T2 Niagara processor for a couple of molecules. We also show the suitability of using a middleware based adaptation algorithm on GAMESS on such a multi-core environment.
Finding Symbolic Bug Patterns in Sensor Networks
Authors: Mohammad Maifi Khan, Tarek Abdelzaher, Jiawei Han, Hossein Ahmadi
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multiple seemingly different event patterns lead to the same type of failure manifestation. A hidden relationship exists, in those patterns, among event attributes that is somehow responsible for the failure. For example, in some system, a message might always get corrupted if the sender is more than two hops away from the receiver (which is a distance relationship) irrespective of the senderId and receiverId. To uncover such failure-causing relationships, we present a new symbolic pattern extraction technique that identifies and symbolically expresses relationships correlated with anomalous behavior. Symbolic pattern extraction is a new concept in sensor network debugging that is unique in its ability to generalize over patterns that involve different combinations of nodes or message exchanges by extracting their common relationship. As a proof of concept, we provide synthetic traffic scenarios where we show that applying symbolic pattern extraction can uncover more complex bug patterns that are crucial to the understanding of real causes of problems. We also use symbolic pattern extraction to diagnose a real bug and show that it generates much fewer and more accurate patterns compared to previous approaches.
A novel approach to fair routing in wireless mesh networks
Authors: Juho Määttä, Timo Bräysy
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

Multiradio wireless mesh network (WMN) is a feasible choice for several applications, as routers with multiple network interface cards have become cheaper. Routing in any network has a great impact on the overall network performance, thus a routing protocol or algorithm for WMN should be carefully designed taking into account the specific characteristics of the network. In addition, in wireless networks, serious unfairness can occur between users if the issue is not addressed in the network protocols or algorithms. In this paper, we are proposing a novel centralized routing algorithm, called Subscriber Aware Fair Routing in WMN (SAFARI), for multiradio WMN that assures fairness, leads to a feasible scheduling, and does not collapse the aggregate network throughput with a strict fairness criterion. We show that our protocol is feasible and practical, and exhaustive simulations show that the performance is improved compared to traditional routing algorithms.
Nonconforming finite element approximations of the Steklov eigenvalue problem
Authors: Yidu Yang, Qin Li, Sirui Li
Venue: Applied Numerical Mathematics (2009)

This paper deals with nonconforming finite element approximations of the Steklov eigenvalue problem. For a class of nonconforming finite elements, it is shown that the j-th approximate eigenpair converges to the j-th exact eigenpair and error estimates for eigenvalues and eigenfunctions are derived. Furthermore, it is proved that the j-th eigenvalue derived by the EQ"1^r^o^t element gives lower bound of the j-th exact eigenvalue, whereas the nonconforming Crouzeix-Raviart element and the Q"1^r^o^t element provide lower bounds of the large eigenvalues. Numerical results are presented to confirm the considered theory.
AnnaBot: a static verifier for Java annotation usage (abstract only)
Authors: Ian Darwin
Venue: Proceedings of the 2nd International Workshop on Defects in Large Software Systems: Held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2009) (2009)

A domain-specific language has been devised for verification of correct use of Annotation-based metadata in the Java programming language. Annotations are a standard Java 5 mechanism used to attach metadata to types, methods or fields without using an external configuration file. A binary representation of the Annotation becomes part of the compiled "class" file, for inspection by other components at run time. Java Annotations were introduced into the Java language in 2004 and have become widely used in recent years due to their introduction in the Java Enterprise Edition (EE 5) and elsewhere. Despite that, mainstream development tools have not yet produced a widely-used verification tool to confirm correct configuration and placement of annotations external to the particular runtime component. This verification becomes especially important both as annotations become more widely adopted and as multiple implementations of standards become available, such as the use of either Hibernate or EclipseLink as a "provider" for the Java Persistence API. It is anticipated that this software will continue to evolve as an open-source software verification tool; the web site for this project has been established as http://www.annabot.org/.
Augmented training of hidden Markov models to recognize remote homologs via simulated evolution
Authors: Anoop Kumar, Lenore Cowen
Venue: Bioinformatics (2009)

Motivation: While profile hidden Markov models (HMMs) are successful and powerful methods to recognize homologous proteins, they can break down when homology becomes too distant due to lack of sufficient training data. We show that we can improve the performance of HMMs in this domain by using a simple simulated model of evolution to create an augmented training set. Results: We show, in two different remote protein homolog tasks, that HMMs whose training is augmented with simulated evolution outperform HMMs trained only on real data. We find that a mutation rate between 15 and 20% performs best for recognizing G-protein coupled receptor proteins in different classes, and for recognizing SCOP super-family proteins from different families. Contacts:anoop.kumar@tufts.edu;lenore.cowen@tufts.edu
Hexagonal stratification of numbers
Authors: Manuel Meireles
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In this article is presented a stratification of the natural numbers in way to highlight potential prime numbers. Initially it was done the hexagonal stratification and it is verified that all and any prime number can be written in the form 6a+1 or 6a+5. Then, it was done to the penta-hexagonal stratification and it was observed that all and any prime number can be written as: 30a+1; 30a+7; 30a+13; 30a+19; 30a+11; 30a+17; 30a+23 and 30a+29. All and any prime number can be written in one these ways. With the hexagonal or hexapentagonal stratification becomes easier to identify a potential prime number but. This article interests potentially for all those that are researching primality tests with views to reduce time in the computational algorithms.
The 2LIP model and its implementations
Authors: Jacek Jankowski, Stefan Decker
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

In this article we present a model for 2-Layer Interface Paradigm (2LIP). 2LIP is an approach for designing simple yet interactive 3D web applications, an attempt to marry advantages of 3D experience with the advantages of the narrative structure of hypertext. The hypertext information, together with graphics, and multimedia, is presented semi-transparently on the foreground layer. It overlays the 3D representation of the information displayed in the background of the interface. We describe implementations of the 2LIP model: 2LIPGarden (HTML context) and Copernicus (wiki context). We want to show that our model can be easily employed to the existing web infrastructure.
Revenue submodularity
Authors: Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We introduce revenue submodularity, the property that market expansion has diminishing returns on an auction's expected revenue. We prove that revenue submodularity is generally possible only in matroid markets, that Bayesian-optimal auctions are always revenue-submodular in such markets, and that the VCG mechanism is revenue-submodular in matroid markets with i.i.d bidders and "sufficient competition". We also give two applications of revenue submodularity: good approximation algorithms for novel market expansion problems, and approximate revenue guarantees for the VCG mechanism with i.i.d bidders.
Answering linear optimization queries with an approximate stream index
Authors: Gang Luo, Kun-Lung Wu, Philip S. Yu
Venue: Knowledge and Information Systems (2009)

We propose a SAO index to approximately answer arbitrary linear optimization queries in a sliding window of a data stream. It uses limited memory to maintain the most &#x201c;important&#x201d; tuples. At any time, for any linear optimization query, we can retrieve the approximate top-K tuples in the sliding window almost instantly. The larger the amount of available memory, the better the quality of the answers is. More importantly, for a given amount of memory, the quality of the answers can be further improved by dynamically allocating a larger portion of the memory to the outer layers of the SAO index.
Interpreting the layout of web pages
Authors: Luis Francisco-Revilla, Jeff Crow
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Web pages such as news and shopping sites often use modular layouts. When used effectively this practice allows authors to present clearly large amounts of information in a single page. However, while sighted people can visually parse and understand these complex layouts in seconds, current assistive technologies such as screen readers cannot. This puts visually impaired users at a great disadvantage. In order to design better assistive technologies, we conducted a study of how people interpret modular layouts of news and shopping Web pages. The study revealed that when the layout complexity increases, the interpretation process gets longer and the reading gets more varied. Also, before looking at the main content, users first frame the Web page by looking for familiar structural elements that can be used as references and entry points. These elements include navigational bars, search boxes, and ads. This implies that assistive technologies can reduce the time required to frame the pages if they help users identify reference points and entry points.
Causation as Production
Authors: John Bell
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Recently I suggested that a cause is an event which, in its context of occurrence, is both necessary and sufficient for the effect. However this definition is only appropriate if there is a single potential cause of the effect. Consequently I suggest a generalization of the definition and discuss the resulting “Production Theory”. I suggest that this can be seen as a combination of a regularity theory in the Hume tradition and a dependence theory in the Lewis tradition, and argue that the Production Theory inherits the strengths of the component theories while avoiding their weaknesses.
An Elasticity Approach to Principal Modes of Shape Variation
Authors: Martin Rumpf, Benedikt Wirth
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Concepts from elasticity are applied to analyze modes of variation on shapes in two and three dimensions. This approach represents a physically motivated alternative to shape statistics on a Riemannian shape space, and it robustly treats strong nonlinear geometric variations of the input shapes.To compute a shape average, all input shapes are elastically deformed into the same configuration. That configuration which minimizes the total elastic deformation energy is defined as the average shape. Each of the deformations from one of the shapes onto the shape average induces a boundary stress. Small amplitude stimulation of these stresses leads to displacements which reflect the impact of every single input shape on the average. To extract the dominant modes of variation, a PCA is performed on this set of displacements.To make the approach computationally tractable, a relaxed formulation is proposed, and sharp contours are approximated via phase fields. For the spatial discretization of the resulting model, piecewise multilinear finite elements are applied. Applications in 2D and in 3D demonstrate the qualitative properties of the presented approach.
A Global Sensitivity Index for Biophysically Detailed Cardiac Cell Models: A Computational Approach
Authors: Sanjay Kharche, Niklas Lüdtke, Stefano Panzeri, Henggui Zhang
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

Biophysically detailed cardiac cell models are based upon stiff ordinary differential equations describing ionic channels and intracellular dynamics aiming at reproducing experimental action potentials (APs) and intracellular calcium ([$Ca^{2+}]_{i}$) transients. Channel blocking and bifurcation analyses are local sensitivity analyses in model parameter space. However, all parameters influence model behaviour and require a global sensitivity index quantifying the influence of parameters on model responses. Identification of the influence of individual parameters increases our understanding of models. A global parameter sensitivity index for assessing the sensitivity of model responses to parameters in cardiac cell models is proposed. The robust index was applied to four widely used models. The analysis revealed that whilst models have common sets of parameters influencing AP and $[Ca^{2+}]_{i}$ transients, there are subtle differences. This sensitivity analysis offers a systematic method for quantifying the influence of individual parameters on model behaviour to assist in model reduction, refinement or development.
Fitting Spatial Ability into Intelligent Tutoring Systems Development
Authors: Nancy Milik, Antonija Mitrovic, Michael Grimley
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Building effective learning environments is an art that can only be perfected by a great deal of explorations involving the environments' audience: the learners. This paper focuses on taking into account the learners' spatial ability into the development of Intelligent Tutoring Systems. We modified ERM-Tutor, a constraint-based tutor that teaches logical database design, to provide not only textual feedback messages, but also messages containing combinations of text and pictures, in accordance with the multimedia theory of learning [1]. Results of a preliminary study performed show a promising indication for further explorations. We plan to use these results as the basis for another evaluation study in early 2007.
Approximate belief updating in max-2-connected Bayes networks is NP-hard
Authors: Erez Karpas, Solomon Eyal Shimony, Amos Beimel
Venue: Artificial Intelligence (2009)

A max-2-connected Bayes network is one where there are at most 2 distinct directed paths between any two nodes. We show that even for this restricted topology, null-evidence belief updating is hard to approximate.
High performance genetic programming on GPU
Authors: Denis Robilliard, Virginie Marion, Cyril Fonlupt
Venue: Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems (2009)

The availability of low cost powerful parallel graphics cards has stimulated the port of Genetic Programming (GP) on Graphics Processing Units (GPUs). Our work focuses on the possibilities offered by Nvidia G80 GPUs when programmed in the CUDA language. We compare two parallelization schemes that evaluate several GP programs in parallel. We show that the fine grain distribution of computations over the elementary processors greatly impacts performances. We also present memory and representation optimizations that further enhance computation speed, up to 2.8 billion GP operations per second. The code has been developed with the well known ECJ library.
Genre classification using chords and stochastic language models
Authors: Carlos Perez-Sancho, David Rizo, Jose M. Inesta
Venue: Connection Science (2009)

Music genre meta-data is of paramount importance for the organisation of music repositories. People use genre in a natural way when entering a music store or looking into music collections. Automatic genre classification has become a popular topic in music information retrieval research both, with digital audio and symbolic data. This work focuses on the symbolic approach, bringing to music cognition some technologies, like the stochastic language models, already successfully applied to text categorisation. The representation chosen here is to model chord progressions as n-grams and strings and then apply perplexity and naive Bayes classifiers, respectively, in order to assess how often those structures are found in the target genres. Some genres and sub-genres among popular, jazz, and academic music have been considered, trying to investigate how far can we reach using harmonic information with these models. The results at different levels of the genre hierarchy for the techniques employed are presented and discussed.