ppxscal/embedding_network huggingface dataset:
Data-driven fuzzy sets for classification
Authors: Sofia Visa, Anca Ralescu
Venue: International Journal of Advanced Intelligence Paradigms (2008)

Using the mass assignment mechanism, a fuzzy classifier can be derived directly from the class relative frequency distribution. Moreover, in this framework, a family of fuzzy sets can represent a class, thus adapting the classifier to the need of classification. Graduality and the corresponding concept of error can be used to guide the process of deriving class representing fuzzy sets. The classification algorithm is attractive due to its low complexity. Successful applications include imbalanced data classification problems where the class having fewer examples is the class of interest.
Unveiling facebook: a measurement study of social network based applications
Authors: Atif Nazir, Saqib Raza, Chen-Nee Chuah
Venue: Proceedings of the 8th ACM SIGCOMM conference on Internet measurement (2008)

Online social networking sites such as Facebook and MySpace have become increasingly popular, with close to 500 million users as of August 2008. The introduction of the Facebook Developer Platform and OpenSocial allows third-party developers to launch their own applications for the existing massive user base. The viral growth of these social applications can potentially influence how content is produced and consumed in the future Internet. To gain a better understanding, we conducted a large-scale measurement study of the usage characteristics of online social network based applications. In particular, we developed and launched three Facebook applications, which have achieved a combined subscription base of over 8 million users. Using the rich dataset gathered through these applications, we analyze the aggregate workload characteristics (including temporal and geographical distributions) as well as the structure of user interactions. We explore the existence of 'communities', with high degree of interaction within a community and limited interaction outside the community. We find that a small fraction of users account for the majority of activity within the context of our Facebook applications and a small number of applications account for the majority of users on Facebook. Furthermore, user response times for Facebook applications are independent of source/destination user locality. We also investigate distinguishing characteristics of social gaming applications. To the best of our knowledge, this is the first study analyzing user activities on online social applications.
Flexible planning using fuzzy description logics: Theory and application
Authors: Lian Shi, Jigui Sun, Shuai Lu, Minghao Yin
Venue: Applied Soft Computing (2009)

Description logics (DLs for short) are formalisms for representing knowledge of various domains in a structured and formally well-understood way. Typically, DLs are limited to deal with precise and well-defined concepts. In this paper we first present a fuzzy extension of ALC*, called fuzzy ALC*, combining Zadeh's fuzzy logic with an expressive DL and define its syntax and semantics. Then we devote to taking advantage of the expressive power and reasoning capabilities of fuzzy ALC* by encoding flexible planning problems within the framework of fuzzy ALC*. Both theory and experimental results have shown that our method is sound and efficient.
Scalable and reliable communication for hardware transactional memory
Authors: Seth H. Pugsley, Manu Awasthi, Niti Madan, Naveen Muralimanohar, Rajeev Balasubramonian
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. This is especially true for a large-scale distributed memory system where multiple transactions may attempt to commit simultaneously and coordination is required before allowing commits to proceed in parallel. In this paper, we propose novel algorithms to implement commit that are more scalable in terms of delay and are free of deadlocks/livelocks. We show that these algorithms have similarities with the token cache coherence concept and leverage these similarities to extend the algorithms to handle message loss and starvation scenarios. The proposed algorithms improve upon the state-of-the-art by yielding up to a 7X reduction in commit delay and up to a 48X reduction in network messages for commit. These translate into overall performance improvements of up to 66% (for synthetic workloads with average transaction length of 200 cycles), 35% (for average transaction length of 1000 cycles), and 8% (for average transaction length of 4000 cycles). For a small group of multi-threaded programs with frequent transaction commits, improvements of up to 8% were observed for a 32-node simulation.
Scalable ranked publish/subscribe
Authors: Ashwin Machanavajjhala, Erik Vee, Minos Garofalakis, Jayavel Shanmugasundaram
Venue: Proceedings of the VLDB Endowment (2008)

Publish/subscribe (pub/sub) systems are designed to efficiently match incoming events (e.g., stock quotes) against a set of subscriptions (e.g., trader profiles specifying quotes of interest). However, current pub/sub systems only support a simple binary notion of matching: an event either matches a subscription or it does not; for instance, a stock quote will either match or not match a trader profile. In this paper, we argue that this simple notion of matching is inadequate for many applications where only the "best" matching subscriptions are of interest. For instance, in targeted Web advertising, an incoming user ("event") may match several different advertiser-specified user profiles ("subscriptions"), but given the limited advertising real-estate, we want to quickly discover the best (e.g., most relevant) ads to display. To address this need, we initiate a study of ranked pub/sub systems. We focus on the case where subscriptions correspond to interval ranges (e.g, age in [25,35] and salary > $50, 000), and events are points that match all the intervals that they stab (e.g., age=28, salary = $65,000). In addition, each interval has a score and our goal is to quickly recover the top-scoring matching subscriptions. Unfortunately, adapting existing index structures to solve this problem results in either an unacceptable space overhead or a significant performance degradation. We thus propose two novel index structures that are both compact and efficient. Our experimental evaluation shows that the proposed structures provide a scalable basis for designing ranked pub/sub systems.
Power management of MEMS-based storage devices for mobile systems
Authors: Mohammed G. Khatib, Pieter H. Hartel
Venue: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems (2008)

Because of its small form factor, high capacity, and expected low cost, MEMS-based storage is a suitable storage technology for mobile systems. MEMS-based storage devices should also be energy efficient for deployment in mobile systems. The problem is that MEMS-based storage devices are mechanical, and thus consume a large amount of energy when idle. Therefore, a power management (PM) policy is needed that maximizes energy saving while minimizing performance degradation. In this work, we quantitatively demonstrate the optimality of the fixed-timeout PM policy for MEMS-based storage devices. Because the media sled is suspended by springs across the head array in MEMS-based storage devices, we show that these devices (1) lack mechanical startup overhead and (2) exhibit small shutdown overhead. As a result, we show that the combination of a PM policy, that fixes the timeout in the range of 1--10 ms, and a shutdown policy, that exploits the springs, results in a near-optimal energy saving yet at a negligible loss in performance.
Fuzzy process capability analyses: An application to teaching processes
Authors: Ihsan Kaya, Cengiz Kahraman
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2008)

Process capability indices (PCIs) are mainly used in industry in order to measure the capability of a process to produce products meeting specifications. Traditionally, the specifications are defined as crisp numbers. Sometimes, specification limits can be expressed as linguistic terms. Traditional PCIs can not be applied for this situation. In this paper, PCIs are analyzed under fuzzy environment. The fuzzy process capability analyses are developed when the specifications limits are represented by triangular and trapezoidal fuzzy numbers. The developed approaches are applied to teaching processes and the fuzzy PCIs are compared based on two different fuzzy ranking methods.
Adaptive link-weight routing protocol using cross-layer communication for MANET
Authors: A. N. Al-Khwildi, S. Khan, K. K. Loo, H. S. Al-Raweshidy
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2007)

Routing efficiency is one of the challenges offered by Mobile Ad-hoc Networks (MANETs). This paper proposes a novel routing technique called Adaptive Link-Weight (ALW) routing protocol. ALW adaptively selects an optimum route on the basis of available bandwidth, low delay and long route lifetime. The technique adapts a cross-layer framework where the ALW is integrated with application and physical layer. The proposed design allows applications to convey preferences to the ALW protocol to override the default path selection mechanism. The results confirm improvement over AODV in terms of network load, route discovery time and link reliability.
Accurate prediction of bird species richness patterns in an urban environment using Landsat-derived NDVI and spectral unmixing
Authors: G. Bino, N. Levin, S. Darawshi, N. Van Der Hal, A. Reich-Solomon, S. Kark
Venue: International Journal of Remote Sensing (2008)

Urban landscapes are expanding rapidly and are reshaping the distribution of many animal and plant species. With these changes, the need to understand and to include urban biodiversity patterns in research and management programmes is becoming vital. Recent studies have shown that remote sensing tools can be useful in studies examining biodiversity patterns in natural landscapes. The present study aimed to explore whether remote sensing tools can be applied in biodiversity research in an urban landscape. More specifically, the study examined whether the Landsat-derived Normalized Difference Vegetation Index (NDVI) and linear spectral unmixing of urban land cover can predict bird richness in the city of Jerusalem. Bird richness was sampled in 40 1-ha sites over a range of urban environments in 329 surveys. NDVI and the per cent cover of built-up area were strongly and negatively correlated with each other, and were both very successful in explaining the number of bird species in the study sites. Mean NDVI in each site was positively correlated with the site bird species richness. A hump-shaped relationship between NDVI and species richness was observed (when calculated over increasing spatial scales), with a maximum value (Pearson's R = 0.87, p
Poisson adjacency distributions in genome comparison
Authors: Wei Xu, Benoît Alain, David Sankoff
Venue: Bioinformatics (2008)

The number of common adjacencies of genetic markers, as a measure of the similarity of two genomes, has been widely used as indicator of evolutionary relatedness and as the basis for inferring phylogenetic relationships. Its probability distribution enables statistical tests in detecting whether significant evolutionary signal remains in the marker order. In this article, we derive the probability distributions of the number of adjacencies for a number of types of genome—signed or unsigned, circular or linear, single-chromosome or multichromosomal. Generating functions are found for singlechromosome cases, from which exact counts can be calculated. Probability approaches are adopted for multichromosomal cases, where we.nd the exact values for expectations and variances. In both cases, the limiting distributions are derived in term of numbers of adjacencies. For all unsigned cases, the limiting distribution is Poisson with parameter 2; for all signed cases, the limiting distribution is Poisson with parameter ½. Contact: wxu060@uottawa.ca
Power efficiency study of multi-threading applications for multi-core mobile systems
Authors: Marius Marcu, Dacian Tudor, Sebastian Fuicu, Silvia Copil-Crisan, Florin Maticu, Mihai Micea
Venue: WSEAS Transactions on Computers (2008)

One constant in computing which is true also for mobile computing is the continue requirement for greater performance. Every performance advance in mobile processors leads to another level of greater performance demands from newest mobile applications. However, on battery powered devices performance is strictly limited by the battery capacity, therefore energy efficient applications and systems have to be developed. The power consumption problem of mobile systems is in general a very complex one and remained very actual for quite a long time. In this paper we aim to define a software execution framework for mobile systems in order to characterize the power consumption profile of multi-threading mobile applications. Study results for different thread libraries, multi-core processors and multithreaded parallelized applications are also presented.
Tracking Outdoor Sports --- User Experience Perspective
Authors: Aino Ahtinen, Minna Isomursu, Ykä Huhtala, Jussi Kaasinen, Jukka Salminen, Jonna Häkkilä
Venue: Proceedings of the European Conference on Ambient Intelligence (2008)

In this paper, the potential role of a sport tracking application is examined in the context of supporting tracking outdoor sporting activities. A user study with 28 participants was conducted to study the usage habits and user experiences evoked. The application consists of a mobile tracking tool and a related web service. It collects and stores workout data such as the route, speed and time, and compiles a training diary that can be viewed in many ways during the exercise and afterwards. Data can be uploaded into a web service for further analysis or for sharing it with others. The results show high interest in tracking outdoor sports with a mobile phone application --- the participants used the application during almost all exercise sessions and stated that they would continue using the application after the study. Sharing data was not perceived as valuable, although some usage scenarios for social sharing arose.
cneViewer
Authors: Jason Persampieri, Deborah I. Ritter, Daniel Lees, Jessica Lehoczky, Qiang Li, Su Guo, Jeffrey H. Chuang
Venue: Bioinformatics (2008)

Summary: There are thousands of strongly conserved non-coding elements (CNEs) in vertebrate genomes, and their functions remain largely unknown. However, without biologically relevant criteria for prioritizing them, selecting a particular CNE sequences to study can be haphazard. To address this problem, we present cneViewer—a database and webtool that systematizes information on conserved non-coding DNA elements in zebrafish. A key feature here is the ability to search for CNEs that may be relevant to tissue-specific gene regulation, based on known developmental expression patterns of nearby genes. cneViewer provides this and other organizing features that significantly facilitate experimental design and CNE analysis. Availability: http://cneviewer.zebrafishcne.org Contact: chuangj@bc.edu
The electromagnetic radiation problem in an arbitrary gravitational background vacuum
Authors: Ghislain R. Franssens
Venue: WSEAS Transactions on Mathematics (2007)

Electromagnetism in an arbitrary gravitational background vacuum is formulated in terms of Clifford analysis over a pseudo-Riemannian space with signature (1,3). The full electromagnetic radiation problem is solved for given smooth compact support electric and magnetic monopole charge-current density source fields. We show that it is possible to attack this problem by analytical means in four dimensional form and without invoking electromagnetic potentials. Our approach reveals that the solution for the full electromagnetic field can be expressed in terms of a fundamental solution of the Laplace-de Rham scalar wave equation, so that calculating Green's dyadic fields is superfluous. In the absence of gravity our method reproduces (i) Jefimenko's equations and (ii) an expression for the particular solution of the wave equation satisfied by the electromagnetic field. Expression (ii) is simpler than Jefimenko's result and has the additional advantage that its evaluation avoids integrating over singularities.
AI and computer-based methods in performance evaluation of sporting feats: an overview
Authors: Gilbert Owusu
Venue: Artificial Intelligence Review (2007)

Performance evaluation is a complex process, usually involving the analyses of large amounts of possibly subjective information. The complexity increases when the performances of more than one athlete are being evaluated. For example a coach in charge of twenty divers should be able to remember the strengths and weaknesses of each athlete. Given these difficulties, it is therefore not surprising that a number of computer-based systems have been developed to speed-up and improve the quality of performance evaluation. Most of these systems are visually based such that individuals working on performance analysis first record the motion in question by electronic means and then input these images into a computer for quantification and subsequent analysis. There seems to be enormous potential for AI (i.e. Artificial Intelligence) technologies to make a significant contribution in the analysis phase. Indeed AI technologies have been applied to performance evaluation in recent years, though their applicability has been limited for a variety of reasons. The main factor has been a lack of characterisation of the domain of performance evaluation. This paper reviews selected research and applications of computational models and AI technologies in particular in performance evaluation of sporting feats for individual based events.
Discovering data quality rules
Authors: Fei Chiang, Renée J. Miller
Venue: Proceedings of the VLDB Endowment (2008)

Dirty data is a serious problem for businesses leading to incorrect decision making, inefficient daily operations, and ultimately wasting both time and money. Dirty data often arises when domain constraints and business rules, meant to preserve data consistency and accuracy, are enforced incompletely or not at all in application code. In this work, we propose a new data-driven tool that can be used within an organization's data quality management process to suggest possible rules, and to identify conformant and non-conformant records. Data quality rules are known to be contextual, so we focus on the discovery of context-dependent rules. Specifically, we search for conditional functional dependencies (CFDs), that is, functional dependencies that hold only over a portion of the data. The output of our tool is a set of functional dependencies together with the context in which they hold (for example, a rule that states for CS graduate courses, the course number and term functionally determines the room and instructor). Since the input to our tool will likely be a dirty database, we also search for CFDs that almost hold. We return these rules together with the non-conformant records (as these are potentially dirty records). We present effective algorithms for discovering CFDs and dirty values in a data instance. Our discovery algorithm searches for minimal CFDs among the data values and prunes redundant candidates. No universal objective measures of data quality or data quality rules are known. Hence, to avoid returning an unnecessarily large number of CFDs and only those that are most interesting, we evaluate a set of interest metrics and present comparative results using real datasets. We also present an experimental study showing the scalability of our techniques.
URBAN CRIME ANALYSIS THROUGH AREAL CATEGORIZED MULTIVARIATE ASSOCIATIONS MINING
Authors: Ickjai Lee, Peter Phillips
Venue: Applied Artificial Intelligence (2008)

As geospatial data grows explosively, there is a great demand for the incorporation of data mining techniques into a geospatial context. Association rules mining is a core technique in data mining and is a solid candidate for the associative analysis of large geospatial databases. In this article, we propose a geospatial knowledge discovery framework for automating the detection of multivariate associations based on a given areal base map. We investigate a series of geospatial preprocessing steps involving data conversion and classification so that the traditional Boolean and quantitative association rules mining can be applied. Our framework has been integrated into GISs using a dynamic link library to allow the automation of both the preprocessing and data mining phases to provide greater ease of use for users. Experiments with real-crime datasets quickly reveal interesting frequent patterns and multivariate associations, which demonstrate the robustness and efficiency of our approach.
ChIPmix
Authors: Marie-Laure Martin-Magniette, Tristan Mary-Huard, Caroline Bérard, Stéphane Robin
Venue: Bioinformatics (2008)

Motivation: Chromatin immunoprecipitation (ChIP) combined with DNA microarray is a high-throughput technology to investigate DNA–protein binding or chromatin/histone modifications. ChIP–chip data require adapted statistical method in order to identify enriched regions. All methods already proposed are based on the analysis of the log ratio (Ip/Input). Nevertheless, the assumption that the log ratio is a pertinent quantity to assess the probe status is not always veri.ed and it leads to a poor data interpretation. Results: Instead of working on the log ratio, we directly work with the Ip and Input signals of each probe by modeling the distribution of the Ip signal conditional to the Input signal. We propose a method named ChIPmix based on a linear regression mixture model to identify actual binding targets of the protein under study. Moreover, we are able to control the proportion of false positives. The efficiency of ChIPmix is illustrated on several datasets obtained from different organisms and hybridized either on tiling or promoter arrays. This validation shows that ChIPmix is convenient for any two-color array whatever its density and provides promising results. Availability: The ChIPmix method is implemented in R and is available at http://www.agroparistech.fr/mia/outil_A.html Contact: marie_laure.martin@agroparistech.fr