ppxscal/embedding_network huggingface dataset:
Investigating the Roles of Knowledge and Cognitive Abilities in Older Adult Information Seeking on the Web
Authors: Joseph Sharit, Mario A. Hernández, Sara J. Czaja, Peter Pirolli
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

This study investigated the influences of knowledge, particularly Internet, Web browser, and search engine knowledge, as well as cognitive abilities on older adult information seeking on the Internet. The emphasis on aspects of cognition was informed by a modeling framework of search engine information-seeking behavior. Participants from two older age groups were recruited: twenty people in a younger-old group (ages 60-70) and twenty people in an older-old group (ages 71-85). Ten younger adults (ages 18-39) served as a comparison group. All participants had at least some Internet search experience. The experimental task consisted of six realistic search problems, all involving information related to health and well-being and which varied in degree of complexity. The results indicated that though necessary, Internet-related knowledge was not sufficient in explaining information-seeking performance, and suggested that a combination of both knowledge and key cognitive abilities is important for successful information seeking. In addition, the cognitive abilities that were found to be critical for task performance depended on the search problem's complexity. Also, significant differences in task performance between the younger and the two older age groups were found on complex, but not on simple problems. Overall, the results from this study have implications for instructing older adults on Internet information seeking and for the design of Web sites.
A Distributed Routing Algorithm Based on Architecture of ForCES
Authors: Bin Zhuge, Ligang Dong, Weiming Wang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper presents a distributed routing algorithm based on architecture of Forwarding and Control Element Separation (ForCES). On this algorithm the calculating routing table divides into two parts, inner routing table between Forwarding Elements and outer routing table between routers. Then according to both routing tables the Control Element calculates the final routing table of each Forwarding Element. An independent routing server is used for the routing process, which decreases the amount of development work. This algorithm satisfies the distributed characteristic of ForCES router and reduces the amount of computation of Forwarding Element obviously. The algorithm has been applied at a prototype of ForCES router with satisfactory result.
Research note: On the complexity and algorithm of grooming regular traffic in WDM optical networks
Authors: Yong Wang, Qian-Ping Gu
Venue: Journal of Parallel and Distributed Computing (2008)

In SONET/WDM networks, a high-speed wavelength channel is usually shared by multiple low-rate traffic demands to make efficient use of the wavelength capacity. The multiplexing is known as traffic grooming and performed by SONET Add-Drop Multiplexers (SADM). The maximum number of low-rate traffic demands that can be multiplexed into one wavelength channel is called grooming factor. Since SADMs are expensive, a key optimization goal of traffic grooming is to minimize the total number of SADMs in order to satisfy a given set of traffic demands. As an important communication traffic pattern, all-to-all traffic has been widely studied for the traffic grooming problem. In this paper, we study the regular traffic pattern, which is considered as a generalization of the all-to-all traffic pattern. We focus on the Unidirectional Path-Switched Ring (UPSR) networks. We prove that the traffic grooming problem is NP-hard for the regular traffic pattern in UPSR networks, and show that the problem does not admit a Fully Polynomial Time Approximation Scheme (FPTAS). We further prove that the problem remains NP-hard even if the grooming factor is any fixed value chosen from a subset of integers. We also propose a performance guaranteed algorithm to minimize the total number of required SADMs, and show that the algorithm achieves a better upper bound than previous algorithms. Extensive simulations are conducted, and the empirical results validate that our algorithm outperforms the previous ones in most cases. In addition, our algorithm always uses the minimum number of wavelengths, which are precious resources as well in optical networks.
Mobile support for communities of interest: design and implementation of Community2Go
Authors: Simone Braun, Wolfgang Gräther
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper we present Community2Go, a community portal for mobile devices with small displays. Community2Go offers relevant functions for social interaction and access to Communities of Interest (CoIs) set up by the FIT community toolbar. Thus, Community2Go bridges the gap between desktop functionality and mobile needs. We present the design, functionality and evaluation of Community2Go.
Exploiting SOA within emaintenance
Authors: Ramin Karim, Mira Kajko-Mattsson, Peter Söderholm
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

SOA is being exploited in many various business domains. One of them is industrial maintenance. In this paper, we outline an eMaintenance Platform (eMP) for maintaining complex technical systems. This platform is part of the eMaintenance Management Framework (eMMF). Our primary goal is to explore how SOA can be exploited within industrial maintenance. Our secondary goal is to provide eMP as an effective tool for organizations to conduct their maintenance and support.
Situated Software Development: Work Practice and Infrastructure Are Mutually Constitutive
Authors: Julia Prior, Toni Robertson, John Leaney
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Software developers’ work is much more interesting and multifarious in practice than formal definitions of software development processes imply. Rational models of work are often representations of processes defined as they should be performed, rather than portrayals of what people actually do in practice. These models offer a simplified picture of the phenomena involved, and are frequently confused with how the work is carried out in reality, or they are advocated as the ideal way to accomplish the work. A longitudinal ethnographic study (45 days of fieldwork over 20 months) of a group of professional software developers revealed the importance of including their observed practice, and the “infrastructure” that supports and shapes this practice, in an authentic account of their work. Moreover, this research revealed that software development work practice and the infrastructure used to produce software are inextricably entwined and mutually constitutive over time.
Experiences on the Belief-Theoretic Integration of Para-consistent Conceptual Models
Authors: Ebrahim Bagheri, Ali A. Ghorbani
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Viewpoint-based conceptual modeling is concerned with theidentification of a complete and coherent set of software models that have been developed with the involvement of various analysts. The contribution of multiple analysts in this process will provide a rich and comprehensive final product. One of the major concerns in any process requiring the direct involvement of human analysts is the introduction of uncertainty and inconsistency. In this paper, we employ a formal model based on belief theory that attempts to capture the degree of analysts' uncertainty towards their specifications and builds on these information to create a unique integrated model. The model is employed in the process of developing a conceptual model for the Pet Store application. The results show that the formal framework provides suitable tools for formal negotiation, belief revision, consensus building, belief recommendation and expert reliability evaluation.
Detecting VoIP Floods Using the Hellinger Distance
Authors: Hemant Sengar, Haining Wang, Duminda Wijesekera, Sushil Jajodia
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Voice over IP (VoIP) a.k.a. Internet telephony is gaining market share rapidly and now competes favorably as one of the visible applications of the Internet. Nevertheless, being an application running over the TCP/IP protocol suite, it is susceptible to flooding attacks. If flooded, being a time-sensitive service, VoIP voice quality may show noticeable degradation and even encounter sudden service disruptions. Because multiple protocols are involved in VoIP service, and most of them are susceptible to flooding, an effective solution must be able to detect and overcome hybrid floods. As a solution, we offer \emph{VoIP Flood Detection Systems (vFDS)}---an online, statistical anomaly detection framework that generates alerts based on abnormal variations in a selected hybrid collection of traffic flows. It does so by viewing collections of related packet streams as evolving probability distributions and measuring abnormal variations in their relationships using the \emph{Hellinger distance}---a measure of variability between two probability distributions. Experimental results show that vFDS is fast and accurate in detecting flooding attacks, without noticeably increasing call setup times or introducing jitter into the voice streams.
Exploiting Codon-Triplets Association for Genome Primary Structure Analysis
Authors: José P. Lousado, Gabriela R. Moura, Manuel A. S. Santos, José Luis Oliveira
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

The way evolution shapes the arrangement of synonymous codons within open reading frames (ORF) for finetuning mRNA decoding efficiency is not yet understood. Since the ribosome has 3 tRNA binding sites, the context of triplets should be relevant to decoding fidelity and efficiency. We have developed a software application for large-scale analysis of codon-triplet associations to shed new light into this problem. The developed algorithms identify codon-triplets context biases, allowing for large scale comparative codon-triplet analysis and for identification of alterations to the standard genetic code.
A note on possible extensions of Negami's conjecture
Authors: Petr Hliněný
Venue: Journal of Graph Theory (1999)

A graph H is a cover of a graph G, if there exists a mapping &phi; from V(H) onto V(G) such that for every vertex &nu; of G, &phi; maps the neighbors of &nu; in H bijectively onto the neighbors of &phi;(&nu;) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in the projective plane. This conjecture is not completely solved yet, but partial results due to Archdeacon, Fellows, Negami, and the author are known. This article suggests another formulation of this conjecture that has a straightforward generalization to higher nonorientable surfaces, and provides some support for the generalized version. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 32: 234240 1999
Boundary Identification and Triangulation of STL Model
Authors: Wenyu Fu, Aike Qiao, Pengbin Fu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In order to identify the border of STL model with open border, topology structure of STL model was reconstructed using half edge data structure. On this basis, border segments of STL model can be identified by a process of edge traversing. Then constrained Delaunay triangulation with Steiner point insertion was used to triangulate the border regions of STL model. In this way, STL model was closed and it provides necessary foundation to further finite element mesh generation.
The NC equivalence of planar integer linear programming and Euclidean GCD
Authors: D. Shallcross
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We show NC-reduction of integer linear programming with two variables to the evaluation of the remainder sequence arising in the application of the Euclidean algorithm to two positive integers. Due to the previous result of X. Deng (1989), this implies NC-equivalence of both of these problems, whose membership in NC, as well as P-completeness, remain unresolved open problems.
The peaking phenomenon in the presence of feature-selection
Authors: Chao Sima, Edward R. Dougherty
Venue: Pattern Recognition Letters (2008)

For a fixed sample size, a common phenomenon is that the error of a designed classifier decreases and then increases as the number of features grows. This peaking phenomenon has been recognized for forty years and depends on the classification rule and feature-label distribution. Historically, the peaking phenomenon has been treated by assuming a fixed ordering of the features, usually beginning with the strongest individual feature and proceeding with features of decreasing individual classification capability. This does not take into account feature-selection, which is commonplace in high-dimensional and small sample settings. This paper revisits the peaking phenomenon in the presence of feature-selection. Using massive simulation in a high-performance computing environment, the paper considers various combinations of feature-label models, feature-selection algorithms, and classifier models to produce a large library of error versus feature size curves. Owing to the prevalence of feature-selection in genomic classification, we also consider gene-expression-based classification of breast-cancer patient prognosis. Results vary widely and are strongly dependent on the combination. The error curves tend to fall into three categories: peaking, settling into a plateau, or falling very slowly over a long range of feature set sizes. It can be concluded that one should be wary of applying peaking results found in the absence of feature-selection to settings in which feature-selection is employed.
MRSI: A Fast Pattern Matching Algorithm for Anti-virus Applications
Authors: Xin Zhou, Bo Xu, Yaxuan Qi, Jun Li
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Anti-virus applications play an important role in today’s Internet communication security. Virus scanning is usually performed on email, web and file transfer traffic flows at intranet security gateways. The performance of popular anti-virus applications relies on the pattern matching algorithms implemented in these security devices. The growth of network bandwidth and the increase of virus signatures call for high speed and scalable pattern matching algorithms. Motivated by several observations of a real-life virus signature database from Clam-AV, a popular anti-virus application, a fast pattern matching algorithm named MRSI is proposed in this paper. Compared to the current algorithm implemented in Clam-AV, MRSI achieved an 80%~100% faster virus scanning speed without excessive memory usages.
Considerations of Service Assembly Based on the Analysis of Data Flows between Services
Authors: George Feuerlicht
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Service composition research mostly focuses on the dynamic (workflow) aspects of compositions. In this paper we consider the static component of service composition and focus on analyzing the data flows between services within a composition. We argue that compatibility of service interfaces is a necessary precondition for service composability, and we show that data flow analysis can be applied to the problem of service composition design to identify compatible service interfaces and to minimize data coupling between services.
Representing Uncertainty in RuleML
Authors: Carlos Viegas Damásio, Jeff Z. Pan, Giorgos Stoilos, Umberto Straccia
Venue: Fundamenta Informaticae (2008)

The RuleML initiative defines a normalized markup for expressing and exchange rules in the Semantic Web. However, the syntax of the language is still limited and lacks features for representing rule-based languages capable of handling uncertainty and vagueness. It is desirable to have a general extension of RuleML which accommodates major existing languages proposed in the latest two decades. The main contribution of the paper is to propose such a general extension, showing how to encode many of the existing languages in this extension. It is detailed the important case of fuzzy rule languages. We hope this work can also provide some insights on how to cover uncertainty in the RIF framework.
Abnormalities in Connectivity of Quantitative Electroencephalogram Background Activity in Autism Disorders especially in Left Hemisphere and Right Temporal
Authors: Hamid Behnam, Ali Sheikhani, Mohammad Reza Mohammadi, Maryam Noroozian, Pari ?Golabi?
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Electroencephalography (EEG) is a powerful, inexpensive, and underutilized neurophysiology diagnostic tool. Since EEG signals contain a wealth of information about brain functions, there are many approaches in analyzing EEG signals with spectral techniques. We have used short time Fourier transform (STFT) at 19 channel’s of EEG for 10 Autism disorders (6-11 years old) and 9 age matched control subjects. The values were assessed with variance analysis. Results are shown that alpha band (8-12Hz) has 89.5% discriminate between two groups. Coherence measures at between total pairs (171 pairs) of 19 channels in three frequency bands (alpha, beta and gamma) of EEG are shown that there are more abnormalities at connectivity between left hemisphere and right temporal lobe with other lobs.
Semi-supervised learning of compact document representations with deep networks
Authors: Marc' Aurelio Ranzato, Martin Szummer
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Finding good representations of text documents is crucial in information retrieval and classification systems. Today the most popular document representation is based on a vector of word counts in the document. This representation neither captures dependencies between related words, nor handles synonyms or polysemous words. In this paper, we propose an algorithm to learn text document representations based on semi-supervised autoencoders that are stacked to form a deep network. The model can be trained efficiently on partially labeled corpora, producing very compact representations of documents, while retaining as much class information and joint word statistics as possible. We show that it is advantageous to exploit even a few labeled samples during training.
Quantitative Process Improvement in XP Using Six Sigma Tools
Authors: Sajid Ibrahim Hashmi, Jongmoon Baik
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

XP (eXtreme Programming) has been used for reducing defects and dealing with changing customer requirements effectively. It has been well known for its defect reduction capability. But, software can be made more reliable by means of process improvement. In general, models like CMM/CMMI have been used for software development process improvement. However, these models have some problems to be used with XP because of less number of process artifacts produced by agile processes. Six Sigma on the other hand, provides the quantitative analysis capabilities required to measure and control process performance. Using XP with Six Sigma can provide means of analyzing XP data and systematically improve process performance. In order to prove our point, we map Six Sigma tools to activities involved at each phase of XP and show that Six Sigma technique can be used with XP to measure and improve the performance of XP process. We also suggest a Six Sigma process improvement guideline with examples.
Must-have Firefox extensions
Authors: Dan Sawyer
Venue: Linux Journal (2008)

Firefox is more than just a Web browser, but how much more?
Structural equation modeling with near singular covariance matrices
Authors: Ke-Hai Yuan, Wai Chan
Venue: Computational Statistics Data Analysis (2008)

Conventional structural equation modeling involves fitting a structural model to the sample covariance matrix S. Due to collinearity or small samples with practical data, nonconvergences often occur in the estimation process. For a small constant a, this paper proposes to fit the structural model to the covariance matrix S"a=S+aI. When treating S"a as the sample covariance matrix in the maximum likelihood (ML) procedure, consistent parameter estimates are still obtained. The asymptotic distributions of the parameter estimates and the corresponding likelihood ratio statistic are studied and compared to those by the conventional ML. Two rescaled statistics for the overall model evaluation with modeling S"a are constructed. Empirical results imply that the estimates from modeling S"a are more efficient than those of fitting the structural model to S even when data are normally distributed. Simulations and real data examples indicate that modeling S"a allows us to evaluate the overall model structure even when S is literally singular. Implications of modeling S"a in a broader context are discussed.
Memory and Thread Placement Effects as a Function of Cache Usage: A Study of the Gaussian Chemistry Code on the SunFire X4600 M2
Authors: R. Yang, J. Antony, P. P. Janes, A. P. Rendell
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

In this work we study the effect of cache blocking and memory/thread placement on a modern multicore shared memory parallel system, the SunFire X4600 M2, using the Gaussian 03 computational chemistry code. A protocol for performing memory and thread placement studies is outlined, as is a scheme for characterizing a particular memory and thread placement pattern. Results for parallel Gaussian 03 runs with up to 16 threads are presented.
A three-layered model to implement data privacy policies
Authors: Gerardo Canfora, Elisa Costante, Igino Pennino, Corrado Aaron Visaggio
Venue: Computer Standards Interfaces (2008)

An increasing number of business-to-business and business-to-customer services are accomplished by means of web technologies and mobile devices. As a consequence, sensitive data are continuously exposed to the risk of being delivered to final users or intermediary actors taking part to the data transactions, who could not have the proper access rights to obtain those data. These new generation of services are often characterized by high dynamism and untrustworthiness: existing technologies for managing and applying data privacy policies could be unsuccessful when dealing with this kind of contexts, as they could require too many resources, degrade the data quality to an unacceptable level, be too pervasive for data sources or data requestors. Moreover, industrial and research community is beginning to perceive the need to embed the mechanisms for preserving data privacy within the software product and process, as it comes to light from the recent literature. This paper proposes an approach to manage data privacy, inspired to the front-end trust filter paradigm, which aims at guaranteeing high flexibility, reducing the resources required, and limiting the pervasiveness into applications and devices involved into the data exchange. Our approach has the potential to curtail the change impact due to the dynamism and to foster the reuse of strategies, and their implementations, also across organizations.