ppxscal/embedding_network huggingface dataset:
A Computational Distributed Reputation Model for B2C E-commerce
Authors: Anna Gutowska, Kevan Buckley
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

This paper presents a novel and comprehensive reputation metric designed for the distributed reputation system for the Business-to-Consumer (B2C) E-commerce applications. The algorithm offers a comprehensive approach as it considers a number of the parameters that have a bearing on trust and reputation such as age of ratings, transaction value, credibility of referees, as well as number of malicious incidents. Moreover, it also extends the existing frameworks based on information about past behaviour, with other aspects affecting online trading decisions which relate to the characteristic of the providers.
Mining recommendations from the web
Authors: Guy Shani, Max Chickering, Christopher Meek
Venue: Proceedings of the 2008 ACM conference on Recommender systems (2008)

In this paper we study the challenges and evaluate the effectiveness of data collected from the web for recommendations. We provide experimental results, including a user study, showing that our methods produce good recommendations in realistic applications. We propose a new evaluation metric, that takes into account the difficulty of prediction. We show that the new metric aligns well with the results from a user study.
Modeling of chemical-mechanical polishing considering thermal coupling effects
Authors: Seunghee Oh, Jongwon Seok
Venue: Microelectronic Engineering (2008)

The removal of surface material in the conventional chemical-mechanical polishing (CMP) process is the result of synergetic effects of two dominant mechanisms: a mechanical process due to the abrasion of particles in the slurry, and a chemical process due to the reactions between the wafer and the chemicals in the slurry. In the overall material removal mechanism, in particular for metal layers, the mechanical and chemical effects are not independent, but are strongly coupled. Many models do not account for these coupling effects and cannot explain the non-Prestonian behavior that occurs when the material removal rate is a nonlinear function of the input areal power density. To address this deficiency and coupling effects, we propose a new integrated thermo-chemical-mechanical model that considers the synergistic effects of both the mechanical and chemical removal processes using the heat transfer mechanism as a bridge between them. In the modeling process, the material removal model is developed based on elastic and plastic contact mechanics and the dominant chemical reactions at the wafer surface. The temperature variation of the CMP system is treated as the coupling factor. The mechanical abrasion by the abrasive particles causes friction, which generates frictional heat on the contacting interfacial area. This heat plays a key role in accelerating the overall chemical reaction for the material removal. We performed a computer simulation with the proposed model using known parameters, and compared the results with other data to ensure its validity.
Design of an object-based storage device based on I/O processor
Authors: Shuibing He, Dan Feng
Venue: ACM SIGOPS Operating Systems Review (2008)

Object-based Storage Device (OSD) is the foundation of the Object-based Storage System (OBSS).As the petabyte-scale OBSS includes thousands of OSDs, the performance, cost and power of single OSD must be considered together to build such a huge storage system The existing OSD based on server and general-purposed PC platform cannot have an excellent tradeoff among the three factor as they are not designed specifically for storage applications. An original OSD architecture based on the Intel IOP315 I/O processor chipset is presented in this paper. The I/O processor makes it powerful for the OSD to process the network communication protocol and the unique switch fabric of the chipset can further improve the I/O performance through parallel data transfer in multiple I/O channels. The experimental results show that the OSD performs well for system performance. Moreover, it provides characteristic of low cost and power.
Strength of hierarchical materials
Authors: Alberto Carpinteri, Pietro Cornetti, Nicola Pugno, Alberto Sapora
Venue: Microsystem Technologies (2008)

Many biological materials exhibit a hierarchical structure over more than one length scale. Understanding how hierarchy affects their mechanical properties emerges as a primary concern, since it can guide the synthesis of new materials to be tailored for specific applications. In this paper the strength and stiffness of hierarchical materials are investigated by means of a fractal approach. A new model is proposed, based both on geometric and material considerations and involving simple recursive formulas.
AKARA: A Flexible Clustering Protocol for Demanding Transactional Workloads
Authors: A. Correia,  Jr., J. Pereira, R. Oliveira
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)

Shared-nothing clusters are a well known and cost-effective approach to database server scalability, in particular, with highly intensive read-only workloads typical of many 3-tier web-based applications. The common reliance on a centralized component and a simplistic propagation strategy employed by mainstream solutions however conduct to poor scalability with traditional on-line transaction processing (OLTP), where the update ratio is high. Such approaches also pose an additional obstacle to high availability while introducing a single point of failure.More recently, database replication protocols based on group communication have been shown to overcome such limitations, expanding the applicability of shared-nothing clusters to more demanding transactional workloads. These take simultaneous advantage of total order multicast and transactional semantics to improve on mainstream solutions. However, none has already been widely deployed in a general purpose database management system.In this paper, we argue that a major hurdle for their acceptance is that these proposals have disappointing performance with specific subsets of real-world workloads. Such limitations are deep-rooted and working around them requires in-depth understanding of protocols and changes to applications. We address this issue with a novel protocol that combines multiple transaction execution mechanisms and replication techniques and then show how it avoids the identified pitfalls. Experimental results are obtained with a workload based on the industry standard TPC-C benchmark.
Algorithmic transformations and peak power constraint applied to multiple-voltage low-power VLSI signal processing
Authors: Hsueh-Chih Yang, Lan-Rong Dung
Venue: WSEAS Transactions on Signal Processing (2007)

We present a multiple-voltage high-level synthesis methodology that minimizes power dissipation of VLSI signal processing. By applying algorithmic transformations, the proposed approach optimizes the power saving, in terms of the average power and peak power, for DSP applications when the resources and the latency are constrained. Our approach is motivated by the maximization of task mobilities. The mobility is defined as the distance between its as-late-as-possible (ALAP) schedule time and its as-soon-as-possible (ASAP) schedule time. The increase of mobilities may raise the possibility of assigning tasks to low-voltage components. To earn task mobilities, we use loop shrinking, retiming and unfolding techniques. The loop shrinking can reduce the iteration period bound (IPB), while the others are employed for shortening the minimum achieved sample period (MASP) as much as possible. The minimization of MASP implies high task mobilities. Thereafter, we can assign tasks with high mobilities to low-voltage components and minimize energy dissipation under resource and latency constraints. With considering the overhead of level conversion and the minimization of peak power, the proposed methodology has low complexity and can achieve significant power reduction.
Context-Aware Scenarios for Pervasive Long-Life Learning
Authors: Cuong Pham-Nguyen, Serge Garlatti
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

In the p-LearNet project, we are interested in TEL systems integrating context-aware corporate learning and working activities for e-retail (shops and hypermarkets). The main issues of the p-LearNet project are: work-integrated learning and customer learning support whatever the place, the time, the organisational and technological contexts of the individual or collective learning and working processes. We propose an adaptive and context-aware model of scenario for a pervasive learning system. This model enables us to choose how to achieve activities according to the current situation. The scenario model is based on a hierarchical task model having the task/method paradigm - methods define how to achieve a task, a task represents an activity. The context-aware adaptation process selects the relevant methods according to the current situation.
Context-dependent DNA recognition code for C2H2 zinc-finger transcription factors
Authors: Jiajian Liu, Gary D. Stormo
Venue: Bioinformatics (2008)

Motivation: Modeling and identifying the DNA-protein recognition code is one of the most challenging problems in computational biology. Several quantitative methods have been developed to model DNA-protein interactions with specific focus on the C2H2 zinc-finger proteins, the largest transcription factor family in eukaryotic genomes. In many cases, they performed well. But the overall the predictive accuracy of these methods is still limited. One of the major reasons is all these methods used weight matrix models to represent DNA-protein interactions, assuming all base-amino acid contacts contribute independently to the total free energy of binding. Results: We present a context-dependent model for DNA–zinc-finger protein interactions that allows us to identify inter-positional dependencies in the DNA recognition code for C2H2 zinc-finger proteins. The degree of non-independence was detected by comparing the linear perceptron model with the non-linear neural net (NN) model for their predictions of DNA–zinc-finger protein interactions. This dependency is supported by the complex base-amino acid contacts observed in DNA–zinc-finger interactions from structural analyses. Using extensive published qualitative and quantitative experimental data, we demonstrated that the context-dependent model developed in this study can significantly improves predictions of DNA binding profiles and free energies of binding for both individual zinc fingers and proteins with multiple zinc fingers when comparing to previous positional-independent models. This approach can be extended to other protein families with complex base-amino acid residue interactions that would help to further understand the transcriptional regulation in eukaryotic genomes. Availability:The software implemented as c programs and are available by request. http://ural.wustl.edu/softwares.html Contact: stormo@ural.wustl.edu
Two novel feature selection approaches for web page classification
Authors: Chih-Ming Chen, Hahn-Ming Lee, Yu-Jung Chang
Venue: Expert Systems with Applications: An International Journal (2009)

To help the growing qualitative and quantitative demands for information from the WWW, efficient automatic Web page classifiers are urgently needed. However, a classifier applied to the WWW faces a huge-scale dimensionality problem since it must handle millions of Web pages, tens of thousands of features, and hundreds of categories. When it comes to practical implementation, reducing the dimensionality is a critically important challenge. In this paper, we propose a fuzzy ranking analysis paradigm together with a novel relevance measure, discriminating power measure (DPM), to effectively reduce the input dimensionality from tens of thousands to a few hundred with zero rejection rate and small decrease in accuracy. The two-level promotion method based on fuzzy ranking analysis is proposed to improve the behavior of each relevance measure and combine those measures to produce a better evaluation of features. Additionally, the DPM measure has low computation cost and emphasizes on both positive and negative discriminating features. Also, it emphasizes classification in parallel order, rather than classification in serial order. In our experimental results, the fuzzy ranking analysis is useful for validating the uncertain behavior of each relevance measure. Moreover, the DPM reduces input dimensionality from 10,427 to 200 with zero rejection rate and with less than 5% decline (from 84.5% to 80.4%) in the test accuracy. Furthermore, to consider the impacts on classification accuracy for the proposed DPM, the experimental results of China Time and Reuter-21578 datasets have demonstrated that the DPM provides major benefit to promote document classification accuracy rate. The results also show that the DPM indeed can reduce both redundancy and noise features to set up a better classifier.
Sequence analysis of GerM and SpoVS, uncharacterized bacterial ‘sporulation’ proteins with widespread phylogenetic distribution
Authors: Daniel J. Rigden, Michael Y. Galperin
Venue: Bioinformatics (2008)

Sporulation in low-G+C gram-positive bacteria (Firmicutes) is an important survival mechanism that involves up to 150 genes, acting in a highly regulated manner. Many sporulation genes have close homologs in non-sporulating bacteria, including cyanobacteria, proteobacteria and spirochaetes, indicating that their products play a wider biological role. Most of them have been characterized as regulatory proteins or enzymes of peptidoglycan turnover; functions of others remain unknown but they are likely to have a general role in cell division and/or development. We have compiled a list of such widely conserved sporulation and germination proteins with poorly characterized functions, ranked them by the width of their phylogenetic distribution, and performed detailed sequence analysis and, where possible, structural modeling aimed at estimating their potential functions. Here we report the results of sequence analysis of Bacillus subtilis spore germination protein GerM, suggesting that it is a widespread cell development protein, whose function might involve binding to peptidoglycan. GerM consists of two tandem copies of a new domain (designated the GERMN domain) that forms phylum-specific fusions with two other newly described domains, GERMN-associated domains 1 and 2 (GMAD1 and GMAD2). Fold recognition reveals a β-propeller fold for GMAD1, while ab initio modeling suggests that GMAD2 adopts a fibronectin type III fold. SpoVS is predicted to adopt the AlbA archaeal chromatin protein fold, which suggests that it is a DNA-binding protein, most likely a novel transcriptional regulator. Contact: drigden@liverpool.ac.uk Supplementary information: Supplementary data are available at ftp://ftp.ncbi.nih.gov/pub/galperin/Sporulation.html
Redundantization of interdependent program modules for parallel control computing systems: Organization, estimation of fault-tolerance, formalized description
Authors: V. V. Ignatushchenko, N. A. Isaeva
Venue: Automation and Remote Control (2008)

Using the formalized descriptions and mathematical models of computing processes, fault-tolerance of the parallel control computing system was determined analytically as the probability of successful completion of an arbitrary complex of interdependent program modules in the user-defined schedule time under random times of realization of these modules in the cases of both synchronous and asynchronous their redundantization. The structure of a unified diagnostic program unit for determination of the coordinate of a single error (processor failure or fault) of the system computing resources and identification of the program module with distorted results of its execution was formally substantiated, designed, and described in logical terms for the first time.
Web page language identification based on URLs
Authors: Eda Baykan, Monika Henzinger, Ingmar Weber
Venue: Proceedings of the VLDB Endowment (2008)

Given only the URL of a web page, can we identify its language? This is the question that we examine in this paper. Such a language classifier is, for example, useful for crawlers of web search engines, which frequently try to satisfy certain language quotas. To determine the language of uncrawled web pages, they have to download the page, which might be wasteful, if the page is not in the desired language. With URL-based language classifiers these redundant downloads can be avoided. We apply a variety of machine learning algorithms to the language identification task and evaluate their performance in extensive experiments for five languages: English, French, German, Spanish and Italian. Our best methods achieve an F-measure, averaged over all languages, of around .90 for both a random sample of 1,260 web page from a large web crawl and for 25k pages from the ODP directory. For 5k pages of web search engine results we even achieve an F-measure of .96. The achieved recall for these collections is .93, .88 and .95 respectively. Two independent human evaluators performed considerably worse on the task, with an F-measure of .75 and a typical recall of a mere .67. Using only country-code top-level domains, such as .de or .fr yields a good precision, but a typical recall of below .60 and an F-measure of around .68.
Settlement location and population density estimation in rugged terrain using information derived from Landsat ETM and SRTM data
Authors: Sarah Mubareka, Daniele Ehrlich, Ferdinand Bonn, Francois Kayitakire
Venue: International Journal of Remote Sensing (2008)

It is useful to have a disaggregated population database at uniform grid units in disaster situations. This study presents a method for settlement location probability and population density estimations at a 90 m resolution for northern Iraq using the Shuttle Radar Topographic Mission (SRTM) digital terrain model and Landsat Enhanced Thematic Mapper satellite imagery. A spatial model each for calculating the probability of settlement location and for estimating population density is described. A randomly selected subset of field data (equivalent to 50%) is first analysed for statistical links between settlement location probability and population density; and various biophysical features which are extracted from Landsat or SRTM data. The model is calibrated using this subset. Settlement location probability is attributed to the distance from roads and water bodies and land cover. Population density can be estimated based upon land cover and topographic features. The Landsat data are processed using a segmentation and subsequent feature-based classification approach making this method robust to seasonal variations in imagery and therefore applicable to a time series of images regardless of acquisition date. The second half of the field data is used to validate the model. Results show a reasonable estimate of population numbers (r = 0.205, p
MPSQ
Authors: Siyuan Zheng, Jia Sheng, Chuan Wang, Xiaojing Wang, Yao Yu, Yun Li, Alex Michie, Jianliang Dai, Yang Zhong, Pei Hao, Lei Liu, Yixue Li
Venue: Bioinformatics (2008)

Summary: MPSQ (multi-protein-states query) is a web-based tool for the discovery of protein states (e.g. biological interactions, covalent modifications, cellular localizations). In particular, large sets of genes can be used to search for enriched state transition network maps (NMs) and features facilitating the interpretation of genomic-scale experiments such as microarrays. One NM collects all the catalogued states of a protein as well as the mutual transitions between the states. For the returned NM, graph visualization is provided for easy understanding and to guide further analysis. Availability: MPSQ is freely available via the web at http://mpsq.biosino.org/. Contact:phao@sibs.ac.cn; liulei@scbit.org; yxli@sibs.ac.cn
Biomarker selection and sample prediction for multi-category disease on MALDI-TOF data
Authors: Jung Hun Oh, Young Bun Kim, Prem Gurnani, Kevin P. Rosenblatt, Jean X. Gao
Venue: Bioinformatics (2008)

Motivation: Diseases normally progress through several stages. Therefore, biomarkers corresponding to each stage may exist. To deal with such a multi-category problem, including sample stage prediction and biomarker selection, we propose methods for classification and feature selection. The proposed classification method is based on two schemes: error-correcting output coding (ECOC) and pairwise coupling (PWC). The final decision for a test sample prediction is an integration of these two schemes. The biomarker pattern for distinguishing each disease category from another one is achieved by the development of an extended Markov blanket (EMB) feature selection method. Results: In this study, a liver cancer matrix-assisted laser desorption/ionization time-of-flight (MALDI-TOF) mass spectrometry (MS) dataset was used, which comprises hepatocellular carcinoma (HCC), cirrhosis, and healthy spectra. Peak patterns were discovered for distinguishing pairwise categories among the three classes. Importance and reliability of individual peaks were presented by the measurements of certain weight values and frequencies. The classification capability of the proposed approach was compared with classical ECOC, random forest, Naive Bayes, and J48 methods. Availability: Supplementary materials are available at http://visionlab.uta.edu/biomarker/bioinfo.htm Contact: gao@uta.edu
Profile-guided program simplification for effective testing and analysis
Authors: Lingxiao Jiang, Zhendong Su
Venue: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering (2008)

Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are often limited due to the complexity of real-world code and thus miss program faults. It will be the users of the program who eventually experience failures caused by the undetected faults. To take advantage of the large number of program runs carried by the users, recent work has proposed techniques to collect execution profiles from the users for developers to perform post-deployment failure analysis. However, in order to protect users' privacy and to reduce run-time overhead, such profiles are usually not detailed enough for the developers to identify or fix the root causes of the failures. In this paper, we propose a novel approach to utilize user execution profiles for more effective in-house testing and analysis. Our key insight is that execution profiles for program failures can be used to simplify a program, while preserving its erroneous behavior. By simplifying a program and scaling down its complexity according to its profiles, in-house testing and analysis techniques can be performed more accurately and efficiently, and pragmatically program defects that occur more often and are (arguably) more relevant to users will be given preference during failure analysis. Specifically, we adapt statistical debugging on execution profiles to predict likely failure-related code and use a syntax-directed algorithm to trim failure-irrelevant code from a program, while preserving its erroneous behavior as much as possible. We conducted case studies on a testing engine, CUTE, and a software model checker, BLAST, to evaluate our technique. We used subject programs from the Aristotle Analysis System and the Software-artifact Infrastructure Repository (SIR). Our empirical results show that using simplified programs, CUTE and BLAST find more bugs with improved accuracy and performance: they were able to detect 20 and 21 (out of 139) more bugs respectively in about half of the time as they took on the original test programs.