ppxscal/embedding_network huggingface dataset:
Dynamic partitioning of the cache hierarchy in shared data centers
Authors: Gokul Soundararajan, Jin Chen, Mohamed A. Sharaf, Cristiana Amza
Venue: Proceedings of the VLDB Endowment (2008)

Due to the imperative need to reduce the management costs of large data centers, operators multiplex several concurrent database applications on a server farm connected to shared network attached storage. Determining and enforcing per-application resource quotas in the resulting cache hierarchy, on the fly, poses a complex resource allocation problem spanning the database server and the storage server tiers. This problem is further complicated by the need to provide strict Quality of Service (QoS) guarantees to hosted applications. In this paper, we design and implement a novel coordinated partitioning technique of the database buffer pool and storage cache between applications for any given cache replacement policy and per-application access pattern. We use statistical regression to dynamically determine the mapping between cache quota settings and the resulting per-application QoS. A resource controller embedded within the database engine actuates the partitioning of the two-level cache, converging towards the configuration with maximum application utility, expressed as the service provider revenue in that configuration, based on a set of latency sample points. Our experimental evaluation, using the MySQL database engine, a server farm with consolidated storage, and two e-commerce benchmarks, shows the effectiveness of our technique in enforcing application QoS, as well as maximizing the revenue of the service provider in shared server farms.
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
Authors: Mahesh Arumugam
Venue: Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2008)

Several self-stabilizing time division multiple access (TDMA) algorithms are proposed for sensor networks. Such algorithms enable the transformation of programs written in abstract models considered in distributed computing literature into a model consistent with sensor networks, i.e., write all with collision (WAC) model. Existing TDMA slot assignment algorithms have one or more of the following properties: (i) compute slots using a randomized algorithm, (ii) assume that the topology is known upfront, and/or (iii) assign slots sequentially. If these algorithms are used to transform abstract programs into programs in WAC model then the transformed programs are probabilistically correct, do not allow the addition of new sensors, and/or converge in a sequential fashion. In this paper, we propose a self-stabilizing deterministic TDMA algorithm where a sensor is aware of only its neighbors. We show that the slots are assigned to the sensors in a concurrent fashion and starting from arbitrary initial states, the algorithm converges to states where collision-free communication among the sensors is restored. Moreover, this algorithm facilitates the transformation of abstract programs into programs in WAC model that are deterministically correct.
Review: Dimensionality reduction based on rough set theory: A review
Authors: K. Thangavel, A. Pethalakshmi
Venue: Applied Soft Computing (2009)

A rough set theory is a new mathematical tool to deal with uncertainty and vagueness of decision system and it has been applied successfully in all the fields. It is used to identify the reduct set of the set of all attributes of the decision system. The reduct set is used as preprocessing technique for classification of the decision system in order to bring out the potential patterns or association rules or knowledge through data mining techniques. Several researchers have contributed variety of algorithms for computing the reduct sets by considering different cases like inconsistency, missing attribute values and multiple decision attributes of the decision system. This paper focuses on the review of the techniques for dimensionality reduction under rough set theory environment. Further, the rough sets hybridization with fuzzy sets, neural network and metaheuristic algorithms have also been reviewed. The performance analysis of the algorithms has been discussed in connection with the classification.
A local experts organization model with application to face emotion recognition
Authors: Jia-Jun Wong, Siu-Yeung Cho
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a novel approach for recognizing human facial emotion in order to further detect human suspicious behaviors. Instead of relying on relative poor representation of facial features in a flat vector form, the approach utilizes a format of tree structures with Gabor feature representations to present a facial emotional state. The novel local experts organization (LEO) model is proposed for the processing of this tree structure representation. The motivation for the LEO model is to deal with the inconsistent length of features in case there are some features failed to be detected. The proposed LEO model is inspired by the natural hierarchical model presented in natural organization, where workers (local experts) reports to their supervisor (fusion classifier), whom in turn reports to upper management (global fusion classifier). Moreover, an Asian emotion database is created. The database contains high-resolution images of 153 Asian subjects in six basic pseudo-emotions (excluding neutral expression) in three different poses for evaluating our proposed system. Empirical studies were conducted to benchmark our approach with other well-known classifiers applying to the system, and the results showed that our approach is the most robust, and less affected by noise from feature locators for the face emotion recognition system.
The babbleTunes system: talk to your ipod!
Authors: Jan Schehl, Alexander Pfalzgraf, Norbert Pfleger, Jochen Steigner
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

This paper presents a full-fledged multimodal dialogue system for accessing multimedia content in home environments from both portable media players and online sources. We will mainly focus on two aspects of the system that provide the basis for a natural interaction: (i) the automatic processing of named entities which permits the incorporation of dynamic data into the dialogue (e.g., song or album titles, artist names, etc.) and (ii) general multimodal interaction patterns that are bound to ease the access to large sets of data.
A Pragmatic Approach to Realizing Context-Aware Personal Services
Authors: Sangkeun Lee, Dongjoo Lee, Seungseok Kang, Sang-goo Lee
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

As network and computing technologies have improved, and the number of mobile devices has increased, realizing context-aware personal services has become one of the most important issues in pervasive computing. Semantic technology may help acquiring, organizing, and processing context information. However, most approaches thus far have adopted semantic technology with an ideal point of view, and they have failed to produce feasible performance and scalability. We propose a practical semantic technology adoption strategy for context-aware personal services with respect to conventional technologies. Based on our strategy, we present a context-aware personal service framework with acceptable performance and scalability.
Integration of K-means algorithm and AprioriSome algorithm for fuzzy sequential pattern mining
Authors: R. J. Kuo, C. M. Chao, C. Y. Liu
Venue: Applied Soft Computing (2009)

Since Agrawal and Srikant proposed sequential pattern mining in 1995, there have been many scholars working to improve the efficiency and reduce the processing time of algorithms. This study intends to propose a fuzzy AprioriSome algorithm for fuzzy sequential patterns mining with integration with clustering technique, K-means algorithm. Two experiments performed using transaction data provided by a securities firm and foodmarket data from SQL sever 2000 demonstrate the strength of fuzzy AprioriSome sequential pattern mining in mining large quantity of transaction data.
Software Transactional Memory: Why Is It Only a Research Toy?
Authors: Calin Cascaval Colin Blundell Maged Michael Harold W. Cain Peng Wu Stefanie Chiras Siddhartha Chatterjee
Venue: Queue (2008)

STM is sometimes touted as the way forward for developing concurrent software, but is it ready for use in real-world applications? The authors built an STM runtime system and compiler framework, the IBM STM, and compared its performance to other similar products by Intel and Sun. They conclude that from both performance and productivity standpoints, STM still has a long way to go before it can be viable in the real world.
Temporal logic patterns for querying dynamic models of cellular interaction networks
Authors: Pedro T. Monteiro, Delphine Ropers, Radu Mateescu, Ana T. Freitas, Hidde de Jong
Venue: Bioinformatics (2008)

Motivation: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful technology to keep up with this increase in scale and complexity. The application of modelchecking approaches is hampered, however, by the difficulty for nonexpert users to formulate appropriate questions in temporal logic. Results: In order to deal with this problem, we propose the use of patterns, that is, high-level query templates that capture recurring biological questions and can be automatically translated into temporal logic. The applicability of the developed set of patterns has been investigated by the analysis of an extended model of the network of global regulators controlling the carbon starvation response in Escherichia coli. Availability: GNA and the model of the carbon starvation response network are available at http://www-helix.inrialpes.fr/gna Contact: Hidde.de-Jong@inrialpes.fr
Extending lattice: using generics and methods to implement new visualization methods within the Trellis framework
Authors: Deepayan Sarkar
Venue: Computational Statistics (2008)

The lattice add-on package implements Trellis graphics in R. One of the major recent changes to the package API has been to make all high level functions generic, with the traditional implementations available as the "formula" method. This allows for cleaner and more flexible implementations for certain uses that were permitted in the original S-PLUS version on a one-off basis. For example, dotplot could be used to display one-way tables, but the new approach naturally extends to multi-way tables as well. More importantly, it opens up the possibility of new Trellis displays specifically designed for previously unsupported classes. We present some examples of such extensions and describe a few issues generally relevant to the development of new Trellis-style visualizations using the lattice infrastructure.
Model-based simulation and performance evaluation of grid scheduling strategies
Authors: Hui Li, Rajkumar Buyya
Venue: Future Generation Computer Systems (2009)

Simulation studies of Grid scheduling strategies require representative workloads to produce dependable results. Real production Grid workloads have shown diverse correlation structures and scaling behavior, which are different to the characteristics of the available supercomputer workloads and cannot be captured by Poisson or simple distribution-based models. We present statistical models that are able to reproduce various autocorrelation structures, including pseudo-periodicity and long range dependence. By conducting model-based simulation, we quantitatively evaluate the performance impacts of workload autocorrelations in Grid scheduling. The results indicate that autocorrelations result in system performance degradation, both at the local and the Grid level. It is shown that realistic workload modeling is not only possible, but also necessary to enable dependable Grid scheduling studies.
Achieving interoperability in e-government services with two modes of semantic bridging: SRS and SWRL
Authors: Saravanan Muthaiyah, Larry Kerschberg
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2008)

Data heterogeneity in the public sector is a serious problem and remains to be a key issue as different naming conventions are used to represent similar data labels. The e-government effort in many countries has provided a platform for government entities and their business partners to exchange data through Information Communication Technologies (ICT) and standards such as RosettaNet (B2B data exchange standard), EDIFACT (Electronic Data Interchange for Administration, Commerce, and Transport), XML (Extensible Markup Language) and EDI (Electronic Data Interchange). However, e-government efforts have not really resolved data heterogeneity problems significantly due to limitation of these standards. One such limitation is the inability of data inheritance. In order to solve this problem with emphasis on Service Oriented Architectures (SOA) and Web Services, a semantically enriched web service for the public sector is needed. Thus we propose an ontology-based solution which allows data inheritance and polymorphism. This goal of this paper is to show how heterogeneous e-government documents can be semantically matched. We propose a shared hierarchical knowledge repository approach and a detailed process methodology for semantic mediation. A two-part semantic mediation approach using SRS (Semantic Relatedness Scores) and SWRL (Semantic Web Rule Language) is highlighted. Both measures are complimentary and provide the semantics necessary for resolving schema heterogeneity. Our approach incorporates a rule-based engine that reads and executes SWRL rules (i.e. RacerPro). We also adopted several tools for proof-of-concept such as Protégé (i.e. ontology editor) and JESS (Java Expert Shell System).
Estimating post-fire organic soil depth in the Alaskan boreal forest using the Normalized Burn Ratio
Authors: D. Verbyla, R. Lord
Venue: International Journal of Remote Sensing (2008)

As part of a long-term moose browse/fire severity study, we used the Normalized Burn Ratio (NBR) with historic Landsat Thematic Mapper (TM) imagery to estimate fire severity from a 1983 wildfire in interior Alaska. Fire severity was estimated in the field by measuring the depth of the organic soil at 57 sites during the summer of 2006. Sites were selected for field sampling from five fire severity classes based on threshold NBR values. The linear relationship between post-fire NBR and organic soil depth among sites within the burn was weak (r 2 = 0.26), and improved substantially (r 2 = 0.66) when restricted to non-wetland black spruce sites. The relationship between NBR and aspen/willow counts was non-linear. Sites with high densities of aspen stems consistently occurred in the high fire severity classes, and sites with high willow stem densities consistently occurred in the moderate fire severity class. However, NBR varied substantially from sites with low aspen or willow reproduction and therefore predicting aspen or willow regeneration based on post-fire NBR values would be difficult.
StreamTX: extracting tuples from streaming XML data
Authors: Wook-Shin Han, Haifeng Jiang, Howard Ho, Quanzhong Li
Venue: Proceedings of the VLDB Endowment (2008)

We study the problem of extracting flattened tuple data from streaming, hierarchical XML data. Tuple-extraction queries are essentially XML pattern queries with multiple extraction nodes. Their typical applications include mapping-based XML transformation and integrated (set-based) processing of XML and relational data. Holistic twig joins are known for the optimal matching of XML pattern queries on parsed/indexed XML data. Na&iuml;ve application of the holistic twig joins to streaming XML data incurs unnecessary disk I/Os. We adapt the holistic twig joins for tuple-extraction queries on streaming XML with two novel features: first, we use the block-and-trigger technique to consume streaming XML data in a best-effort fashion without compromising the optimality of holistic matching; second, to reduce peak buffer sizes and overall running times, we apply query-path pruning and existential-match pruning techniques to aggressively filter irrelevant incoming data. We compare our solution with the direct competitor TurboXPath and other alternative approaches that use full-fledged query engines such as XQuery or XSLT engines for tuple extraction. The experiments using real-world XML data and queries demonstrated that our approach 1) outperformed its competitors by up to orders of magnitude, and 2) exhibited almost linear scalability. Our solution has been demonstrated extensively to IBM customers and will be included in customer engagement applications in healthcare.
Variation in aerosol properties over Hyderabad, India during intense cyclonic conditions
Authors: K. V. S. Badarinath, Shailesh Kumar Kharol, V. Krishna Prasad, D. G. Kaskaoutis, H. D. Kambezidis
Venue: International Journal of Remote Sensing (2008)

In this study, we examine the changes in aerosol properties associated with an intense tropical cyclone, the so-called 'Mala', that occurred during April 2006, over the Bay of Bengal. This cyclone, accompanied by very strong surface winds reaching 240 km h-1, caused extensive disasters in houses and beach resorts in the coastal areas of Myanmar. Ground-based measurements of aerosol optical depth (AOD), particle-size distribution and erythemal UV radiation in the neighbouring urban environment of Hyderabad, India, showed significant variations due to changes in wind velocity and direction associated with the cyclone event. The results show an increase in ground-measured PM1.0, PM2.5, and PM10 concentrations, probably associated with the strong surface winds on 28 April, the day on which the cyclone affected the study region. In contrast, the AOD on that day exhibited a significant decrease, since the winds probably acted as a ventilation mechanism for the atmosphere. The Terra-MODIS satellite images showed a prevalence of dust particles over the study region on the next day of the cyclone. Results from ground-based AOD sun-photometer observations matched well with satellite AOD retrievals. Aerosol index obtained from Ozone Monitoring Instrument (OMI) during the cyclone events suggested increasing trend, indicating the presence of an elevated dust-aerosol layer during and after the cyclone. Results on the effects of wind and air mass fields in affecting the AOD during cyclone events are also presented.
A QoS-aware multicast routing protocol for multimedia applications in mobile ad hoc networks
Authors: Hakim Badis
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g., bounded delay). Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. Moreover, with QoS metrics consideration, the problem of computing optimal constrained multicast tree is known as NP-complete. In this paper, we propose a new QoS-aware Multicast Overlay Spanning Tree (QMOST) protocol to support multiple-metric routing criteria in mobile ad hoc networks. It computes low cost trees under various QoS constraints in polynomial time using an efficient source-based optimization heuristic. Unlike common multicast protocols where data packets are transmitted in a broadcast mode, in QMOST data packets are encapsulated in unicast packets before being forwarded to the overlay tunnels. QMOST must be used in conjunction with a unicast QoS link state protocol (like QOLSR) and can be integrated in a QoS model. This later offers the needed service guarantee using distributed admission control to check if the multicast QoS flows are admissible, resource reservation mechanism and congestion control. Simulation results show that our QMOST protocol achieves better performance than the QOLSR protocol.
Adaptive shared-state sampling
Authors: Frederic Raspall, Sebastia Sallent
Venue: Proceedings of the 8th ACM SIGCOMM conference on Internet measurement (2008)

We present two algorithms to the problem of identifying and measuring heavy-hitters. Our schemes report, with high probability, those flows that exceed a prescribed share of the traffic observed so far; along with an estimate of their sizes. One of the biggest advantages of our schemes is that they entirely rely on sampling. This makes them flexible and lightweight, permits implementing them in cheap DRAM and scale to very high speeds. Despite sampling, our algorithms can provide very accurate results and offer performance guarantees independent of the traffic mix. Most remarkably, the schemes are shown to require memory that is constant regardless of the volume and composition of the traffic observed. Thus, besides computationally light, cost-effective and flexible, they are scalable and robust against malicious traffic patterns. We provide theoretical and empirical results on their performance; the latter, with software implementations and real traffic traces.
Accounting of prior information in paramacrosystems
Authors: D. G. Dorofeev, B. A. Zon, Yu. S. Popkov
Venue: Automation and Remote Control (2008)

The work is devoted to the technique for constructing the probability characteristics of macrostates of paramacrosystems in the cases when microstates are nonequiprobable. The comparison is performed of the probability distribution functions of macrostates for the cases of equal and unequal probabilities of microstates.
Interactive Media: The Semiotics of Embodied Interaction
Authors: Shaleph O'Neill
Venue:  (2008)

The author discusses the existing theoretical approaches of semiotically informed research in HCI, what is useful and the limitations. He proposes a radical rethink to this approach through a re-evaluation of important semiotic concepts and applied semiotic methods. Using a semiotic model of interaction he explores this concept through several studies that help to develop his argument. He concludes that this semiotics of interaction is more appropriate than other versions because it focuses on the characteristics of interactive media as they are experienced and the way in which users make sense of them rather than thinking about interface design or usability issues.