ppxscal/embedding_network huggingface dataset:
Characterizing and modeling the behavior of context switch misses
Authors: Fang Liu, Fei Guo, Yan Solihin, Seongbeom Kim, Abdulaziz Eker
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

One of the essential features in modern computer systems is context switching, which allows multiple threads of execution to time-share a limited number of processors. While very useful, context switching can introduce high performance overheads, with one of the primary reasons being the cache perturbation effect. Between the time a thread is switched out and when it resumes execution, parts of its working set in the cache may be perturbed by other interfering threads, leading to (context switch) cache misses to recover from the perturbation. The goal of this paper is to understand how cache parameters and application behavior influence the number of context switch misses the application suffers from. We characterize a previously-unreported type of context switch misses that occur as the artifact of the interaction of cache replacement policy and an application's temporal reuse behavior. We characterize the behavior of these "reordered misses" for various applications, cache sizes, and the amount of cache perturbation. As a second contribution, we develop an analytical model that reveals the mathematical relationship between cache design parameters, an application's temporal reuse pattern, and the number of context switch misses the application suffers from. We validate the model against simulation studies and find that it is accurate in predicting the trends of context switch misses. The mathematical relationship provided by the model allows us to derive insights into precisely why some applications are more vulnerable to context switch misses than others. Through a case study, we also find that prefetching tends to aggravate the number of context switch misses.
DNA-based organic-on-inorganic devices: Barrier enhancement and temperature issues
Authors: Ö. Güllü, M. Çankaya, Ö. Barış, A. Türüt
Venue: Microelectronic Engineering (2008)

Electrical measurements have been reported sandwich device fabricated from DNA molecular film located between Al and p-type InP inorganic semiconductor. We have observed that DNA-based this structure shows an excellent rectifying behavior, and that the DNA film increases the effective barrier height by influencing the space charge region of InP. We have also evaluated electrical characteristics of the DNA-based device in a wide temperature range.
A Graph-Based Approach for Contextual Service Loading in Pervasive Environments
Authors: Amira Hamida, Frédéric Mouël, Stéphane Frénot, Mohamed Ahmed
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

The pervasive computing paradigm promises great abilities whenever and wherever a user goes. However, as people are shifting from the desktop to more resource-constrained devices, issues due to scarce resources may appear preventing from the use of the available services and applications.In this paper, we consider the adaptive deployment as a mainstream solution to suit service-oriented applications to different context constraints such as the users requirements, the hosts resources, the services properties and the surrounding environments.We put forward a graph-based deployment approach for service-based applications so as to make these applications adaptable to the runtime contextual constraints. We introduce the AxSeL architecture, A conteXtual Service Loader in which services and their dependencies are represented as a bidimensional graph. The dependency graph is then coloured through a process taking into account the devices, services and users constraints. This process aims to choose to load or not a service according to its execution context.A prototype based on Java and OSGi technologies is implemented in order to demonstrate and evaluate our approach.
Real-time synchronization on distributed architecture with Ada-2005
Authors: Jim Ras, Albert M.K. Cheng
Venue: Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference (2008)

Ada is found in most Avionics processing. It is often the hidden software that makes life safe in systems that fly most passenger/private aircraft. In an effort to promote the use of Ada-2005 in more embedded systems, we will present a Distributed Stack Resource Policy (DSRP) suitable for synchronizing tasks executing on distributed systems, meaning the protocol relies only on message-passing between processors. Accordingly, we will present an empirical evaluation that tests the performance of the DSRP with the Distributed Priority Ceiling Protocol (DPCP) created by Rajkumar. To the best of our knowledge, no empirical distributed-based evaluation of the DPCP has ever been conducted prior to this. We will also discuss the efficacy of Ada and examine the resulting design issues and trade-offs, and the ability of the DSRP to manage multiple shared resources efficiently on distributed processors.
FORK: A novel two-pronged strategy for an agent-based intrusion detection scheme in ad-hoc networks
Authors: Chandrasekar Ramachandran, Sudip Misra, Mohammad S. Obaidat
Venue: Computer Communications (2008)

In this paper, we introduce FORK, a novel two-pronged strategy to an agent-based intrusion detection system for ad-hoc networks. We follow two different but complementary approaches for intrusion detection in our proposed scheme. We perform intrusion detection for power-aware ad-hoc networks. We introduce a novel power and reputation-based auctioning scheme for distributing agent-tasks in the network. Nodes compete for, and win auctions for performing the tasks based on a competitive power-efficient mechanism that permits collaboration between nodes. The chosen nodes perform the intrusion detection using our proposed anomaly detection algorithm that is modeled on popular evolutionary algorithms techniques. We evaluate our system both in terms of the task allocation algorithm as well as results of actual intrusion detection performed in some session log files. The outcome is promising and offers scope for some interesting additional research.
An algorithm for minimum flows
Authors: Oana Georgescu, Eleonor Ciurea
Venue: WSEAS Transactions on Computers (2008)

In this paper we consider an advanced topic for minimum flow problem: the use of the dynamic trees data structure to efficiently implement decreasing path algorithm. In the final part of the paper we present an example for this algorithm, some practical applications for the minimum flow problem, conclusions and open problems.
hapConstructor
Authors: Ryan Abo, Stacey Knight, Jathine Wong, Angela Cox, Nicola J. Camp
Venue: Bioinformatics (2008)

Summary: Haplotypes carry important information that can direct investigators towards underlying susceptibility variants, and hence multiple tagging single nucleotide polymorphisms (tSNPs) are usually studied in candidate gene association studies. However, it is often unknown which SNPs should be included in haplotype analyses, or which tests should be performed for maximum power. We have developed a program, hapConstructor, which automatically builds multi-locus SNP sets to test for association in a case-control framework. The multi-SNP sets considered need not be contiguous; they are built based on significance. An important feature is that the missing data imputation is carried out based on the full data, for maximal information and consistency. HapConstructor is implemented in a Monte Carlo framework and naturally extends to allow for significance testing and false discovery rates that account for the construction process and to related individuals. HapConstructor is a useful tool for exploring multi-locus associations in candidate genes and regions. Availability: http://www-genepi.med.utah.edu/Genie Contact: ryan.abo@hsc.utah.edu
Adaptive Processing for Multi-user Stream Service over Web-Based Broadcasting Stream
Authors: Mi-Young Kang, Hyeong-Ok Lee, Omar F. Hamad, Ji-Seung Nam
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

Adaptive processing overlay multicasting for web-based broadcasting provides efficient service for multi-users sharing application with single sources. A mechanism is proposed by locally applying children-parents-role swapping in trees by adopting a swapping function in overlay protocol. Performance efficient results for real-time, concurrent service is achieved with stream trees with locally swapped nodes having maximum peak RTTs of about 0.6 seconds - better than TBCP and HMTP. The proposed scheme does well in terms of session connections, especially when multi-users’ number grows. Number of hosts against group size after the local swapping seems to be the best and maximum average relative delay penalty (ARDP) of less than 6 units indicates that the new mechanism welcomes modest services in stream groups with affordable penalty, regardless of hosts’ number. The swapped trees perform better in terms of costs, average RTT, number of hosts, and ARDP.
Predicting News Story Importance Using Language Features
Authors: Ralf Krestel, Bhaskar Mehta
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

In this age of awareness, people have access to information like never before. Hundreds of newspapers and millions of bloggers present news and their interpretations in an openly accessible manner. With globalization, distant events can have impact on people thousands of miles away. While expert humans can recognize a potentially important piece of news, this is still a difficult problem for an automatic system. Since people are increasingly relying on multiple online sources of information, it is important to support users in filtering news automatically. In this work, we consider the problem of anticipating news story importance, i.e. given a news item, predicting if it will be of interest for a majority of users. Such ranking is currently done manually for newspapers, and we explore automatic approaches and indicative features for the same. Our main conclusion is that importance prediction is a hard problem, and pure textual features are not sufficient for classifiers with 90% accuracy.
Distributing Complementary Resources across Multiple Periods with Stochastic Demand: Hedging via Time Frame Aggregation
Authors: Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments, we show that under stochastic conditions the performance variation of the process decreases as the time frame length (time frames are obtained by aggregating time periods) increases. This is achieved without causing deterioration in the mean performance.
A Sigma-Delta ADC design automation tool with embedded performance estimator
Authors: Selçuk Talay, Engin Deniz, Günhan Dündar
Venue: Integration, the VLSI Journal (2009)

A system-level design automation tool for designing discrete time, switched-capacitor, Sigma-Delta analog-to-digital converters is presented. The presented work utilizes a performance estimator based on EKV models. The design automation tool takes advantage of high level analytical single-bit and multibit models of the building blocks. With the contribution of the performance estimator module, the tool provides an extensive design environment for designing Sigma-Delta analog-to-digital converters. Developed models and their effects are presented with examples. Design examples for 0.5 and 0.35@mm technologies are provided for proving the flexibility of the design automation tool.
Canopy blockage and scattering effects on apparent soil spectral reflectance and its consequence in spectral mixture analysis of vegetated surfaces
Authors: H. Guan, H. Xie, M. Zhu
Venue: International Journal of Remote Sensing (2008)

Remote sensing technique has become the most efficient and common approach to estimate surface vegetation cover. Among various remote sensing algorithms, spectral mixture analysis (SMA) is the most common approach to obtain sub-pixel surface coverage. In the SMA, spectral endmembers (the number of endmembers may vary), with invariant spectral reflectance across the whole image, are needed to conduct the mixture procedure. Although the nonlinear effect in quantifying vegetation spectral reflectance was noticed and sometimes addressed in the SMA analysis, the nonlinear effect in soil spectral reflectance is seldom discussed in the literature. In this paper, we investigate the effects of vegetation canopy on the inter-canopy soil spectral reflectance via mathematical modelling and field measurements. We identify two mechanisms that lead to the difference between remotely sensed apparent soil spectral reflectance and actual soil spectral reflectance. One is a canopy blockage effect, leading to a reduced apparent soil spectral reflectance. The other is a canopy scattering effect, leading to an increased apparent soil spectral reflectance. Without correction, the first (second) mechanism causes an overestimated (underestimated) areal coverage of the low-spectral-reflectance endmember. The overall effect of canopy to soil, however, tends to overestimate fractional vegetation cover due to the relative significance of the canopy blockage effect, even though the two mechanisms vary with spectral wavelengths and spectral difference between different vegetation and soil. For the SMA of vegetated surface using multiple-spectral remote sensing imagery (e.g., LandSat), it is recommended that infrared bands of low vegetation spectral reflectance (e.g. band 7) be first considered; if both visible and infrared bands are used, combination of bands 3, 4, and 5 is appropriate, while use of all six bands could overestimate fraction vegetation cover.
A personalized counseling system using case-based reasoning with neural symbolic feature weighting (CANSY)
Authors: Sungho Ha
Venue: Applied Intelligence (2008)

In this article, we introduce a personalized counseling system based on context mining. As a technique for context mining, we have developed an algorithm called CANSY. It adopts trained neural networks for feature weighting and a value difference metric in order to measure distances between all possible values of symbolic features. CANSY plays a core role in classifying and presenting most similar cases from a case base. Experimental results show that CANSY along with a rule base can provide personalized information with a relatively high level of accuracy, and it is capable of recommending appropriate products or services.
Exploiting Provenance to Make Sense of Automated Decisions in Scientific Workflows
Authors: Paolo Missier, Suzanne Embury, Richard Stapenhurst
Venue: Provenance and Annotation of Data and Processes: Second International Provenance and Annotation Workshop, IPAW 2008, Salt Lake City, UT, USA, June 17-18, 2008. Revised Selected Papers (2008)

Scientific workflows may include automated decision steps, for instance to accept/reject certain data products during the course of an in silico experiment, based on an assessment of their quality. The trustworthiness of these workflows can be enhanced by providing the users with a trace and explanation of the outcome of these decisions. In this paper we present a provenance model that is designed specifically to support this task. The model applies to a particular type of sub-workflow that is compiled automatically from a high-level specification of user-defined, quality-based data acceptance criteria. The keys to the effectiveness of the approach are that (i) these sub-workflows follow a predictable pattern structure, (ii) the purpose of their component services is defined using an ontology of Information Quality concepts, and (iii) the conceptual model for provenance is consistent with the ontology structure.
Efficient functional clustering of protein sequences using the Dirichlet process
Authors: Duncan P. Brown
Venue: Bioinformatics (2008)

Motivation: Automatic clustering of protein sequences is an important problem in computational biology. The recent explosion in genome sequences has given biological researchers a vast number of novel protein sequences. However, the majority of these sequences have no experimental evidence for their molecular function in the cell, and the responsibility for correctly annotating these sequences falls upon the bioinformatics community. Ideally, we would like to be able to group sequences of similar or identical molecular function in an automatic fashion, without relying on experimental evidence. Results: In this article I present a novel probabilistic framework that models subfamilies within a known protein family. Given a multiple sequence alignment, the model uses Dirichlet mixture densities to estimate amino acid preferences within subfamily clusters, and places a Dirichlet process prior on the overall set of clusters. Based on results from several datasets, the model breaks data accurately into functional subgroups. Availability: The algorithm is implemented as c++ software available at bpg-research.berkeley.edu/~duncanb/dpcluster/ Contact: duncan_brown@merck.com Supplementary information:Supplementary data are available at Bioinformatics online.
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
Authors: Stephen L. Spitler, Daniel C. Lee
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper presents a methodology for protecting low-priority best-effort (BE) traffic in a network domain that provides both virtual-circuit routing with bandwidth reservation for QoS traffic and datagram routing for BE traffic. When a QoS virtual circuit is established, bandwidths amounting to the traffic's effective bandwidths are reserved along the links. We formulate a new QoS-virtual-circuit admission control and routing policy that sustains a minimum level of BE performance. In response to a QoS connection request, the policy executes a two-stage optimization. The first stage seeks a minimum-net-effective-bandwidth reservation path that satisfies a BE protecting constraint; the second stage is a tie-breaking rule, selecting from tied paths one that least disturbs BE traffic. Our novel policy implementation efficiently executes both optimization stages simultaneously by a single run of Dijkstra's algorithm. According to simulation results, within a practical operating range, the consideration that our proposed policy gives to the BE service does not increase the blocking probability of a QoS connection request.
Analysing Bug Prediction Capabilities of Static Code Metrics in Open Source Software
Authors: Javed Ferzund, Syed Nadeem Ahsan, Franz Wotawa
Venue: Proceedings of the International Conferences on Software Process and Product Measurement (2008)

Open Source Softwares provide a rich resource of empirical research in software engineering. Static code metrics are a good indicator of software quality and maintainability. In this work we have tried to answer the question whether bug predictors obtained from one project can be applied to a different project with reasonable accuracy. Two open source projects Firefox and Apache HTTP Server (AHS) are used for this study. Static code metrics are calculated for both projects using in-house software and the bug information is obtained from bug databases of these projects. The source code files are classified as clean or buggy using the Decision tree classifier. The classifier is trained on metrics and bug data of Firefox and tested on Apache HTTP Server and vice versa. The results obtained vary with different releases of these projects and can be as good as 92 % of the files correctly classified and as poor as 68 % of the files correctly classified by the trained classifier.
Validation and comparison of 1 km global land cover products in China
Authors: W. Wu, R. Shibasaki, P. Yang, L. Ongaro, Q. Zhou, H. Tang
Venue: International Journal of Remote Sensing (2008)

Four 1 km global land cover products are currently available to the scientific community: the University of Maryland (UMD) global land cover product, the International Geosphere-Biosphere Programme Data and Information System Cover (IGBP-DISCover), the MODerate resolution Imaging Spectrometer (MODIS) global land cover product and Global Land Cover 2000 (GLC2000). Because of differences in data sources, temporal scales, classification systems and methodologies, it is important to compare and validate these global maps before using them for a variety of studies at regional to global scales. This study aimed to perform the validation and comparison of the four global land cover datasets, and to examine the suitability and accuracy of different coarse spatial resolution datasets in mapping and monitoring cropland across China. To meet this objective, we compared the four global land cover products with the National Land Cover Dataset 2000 (NLCD-2000) at three scales to evaluate the accuracy of estimates of aggregated cropland areas in China. This was followed by a spatial comparison to assess the accuracies of the four products in estimating the spatial distribution of cropland across China. A comparative analysis showed that there are varying levels of apparent discrepancies in estimating the cropland of China between these four global land cover datasets, and that both area totals and spatial (dis)agreement between them vary from region to region. Among these, the MODIS dataset has the best fit in depicting China's croplands. The coarse spatial resolution and the per pixel classification approach, as well as landscape heterogeneity, are the main reasons for the large discrepancies between the global land cover datasets tested and the reference data.
Practical issues in subjective video quality evaluation: human factors vs. psychophysical image quality evaluation
Authors: Marc Sullivan, James Pratt, Philip Kortum
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

In this paper, we describe subjective video quality testing using naturally occurring, realistic, video content. The use of realistic content poses a number of challenges that are not encountered when using standard video test clips. The methods that we have developed are targeted to define levels of video quality that will be acceptable to customers of a video service. The methods were developed in the context of home TV viewing, but are applicable to other emerging areas such as mobile video. Some of the key elements of testing with natural content are controlling for natural content variability, measuring content desirability, and using a testing method that encourages natural viewing behaviors.