ppxscal/embedding_network huggingface dataset:
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
Authors: Barbara Chapman, Gabriele Jost, Ruud van der Pas
Venue:  (2007)

"I hope that readers will learn to use the full expressibility and power of OpenMP. This book should provide an excellent introduction to beginners, and the performance section should help those with some experience who want to push OpenMP to its limits." --from the foreword by David J. Kuck, Intel Fellow, Software and Solutions Group, and Director, Parallel and Distributed Solutions, Intel Corporation OpenMP, a portable programming interface for shared memory parallel computers, was adopted as an informal standard in 1997 by computer scientists who wanted a unified model on which to base programs for shared memory systems. OpenMP is now used by many software developers; it offers significant advantages over both hand-threading and MPI. Using OpenMP offers a comprehensive introduction to parallel programming concepts and a detailed overview of OpenMP. Using OpenMP discusses hardware developments, describes where OpenMP is applicable, and compares OpenMP to other programming interfaces for shared and distributed memory parallel architectures. It introduces the individual features of OpenMP, provides many source code examples that demonstrate the use and functionality of the language constructs, and offers tips on writing an efficient OpenMP program. It describes how to use OpenMP in full-scale applications to achieve high performance on large-scale architectures, discussing several case studies in detail, and offers in-depth troubleshooting advice. It explains how OpenMP is translated into explicitly multithreaded code, providing a valuable behind-the-scenes account of OpenMP program performance. Finally, Using OpenMP considers trends likely to influence OpenMP development, offering a glimpse of the possibilities of a future OpenMP 3.0 from the vantage point of the current OpenMP 2.5. With multicore computer use increasing, the need for a comprehensive introduction and overview of the standard interface is clear. Using OpenMP provides an essential reference not only for students at both undergraduate and graduate levels but also for professionals who intend to parallelize existing codes or develop new parallel programs for shared memory computer architectures.
Fuzzy neural Web agents for efficient NBA scouting
Authors: Mourad Atlas, Yan-Qing Zhang
Venue: Web Intelligence and Agent Systems (2008)

The intelligent agents are very useful for World Wide Web applications. Intelligent agents are designed and implemented for a variety of tasks in diverse range of applications: managing e-mail, navigating and retrieving information from the Internet, online shopping, electronic business, monitoring stock prices or currency exchanges, etc. In this paper, we present and describe an intelligent service agent that assists an NBA scouting agent in his/her work. The particularity of our agent is that it not only retrieves relevant information about NBA players from the Internet for the scouting agent but also derives metadata from that information, which consist of player performance evaluation and player statistics prediction.
Designs on Simulation Platform of Traffic Emergency Management System
Authors: Guolin Wang, Deyun Xiao, Jason Gu
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Efficient operations mean saving lives and properties, eliminating the impact to the smooth flow of traffic. It’s crucial for traffic operators to respond to emergency incidents quickly and efficiently. In this paper, the design and implementation of a computer-aided emergency management simulation software platform capable of reacting to traffic incidents in due time is described. The system is divided into four parts: Incident Detection and Verification Unit, Automatic Dispatch Unit, Scene Display Unit and Evaluation Unit. The system functions analysis is explored in this paper. Our focus is on building an automatic dispatch system for actions and resources adapting to changing environment through its action plan database. The software architecture is also discussed in detail. Key challenges faced in designing the system are addressed. Simulation results prove the efficiency of the system.
Ontology-Based Semi-automatic Construction of Bayesian Network Models for Diagnosing Diseases in E-health Applications
Authors: Beom-Jun Jeon, In-Young Ko
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Bayesian network (BN) is one of the popular probabilistic methods of diagnosing diseases in e-health applications. However, it is normally a complex task to construct a BN for diagnosing a specific disease by collecting and analyzing domain knowledge. We propose a semi-automatic way of constructing BNs for diagnosing diseases. Our method automatically generates nodes in a BN out of e-health ontology, and allows developers to easily establish links among nodes based on a meta-model that represents cause-and-effect relationships among ontologies.
Mobile findex: supporting mobile web search with automatic result categories
Authors: Tomi Heimonen, Mika Käki
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Designing an effective mobile search user interface is challenging, as interacting with the results is often complicated by the lack of available screen space and limited interaction methods. This paper presents Mobile Findex; a mobile search user interface that uses automatically computed categories to present the user with an overview of the result set. In addition, it utilizes a focus+context result list presentation combined with an intuitive browsing method to aid the user in the evaluation of results. A user study with 16 participants was carried out to evaluate Mobile Findex. Subjective evaluations show that Mobile Findex was clearly preferred by the participants over the traditional ranked result list in terms of ease of finding relevant results, suitability to tasks and perceived efficiency. While the use of categories resulted in a lower rate of non-relevant result selections, an overall significant difference in search performance was not observed.
Guest editors' introduction
Authors: Paolo Penna, S. S. Ravi
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

We served as the Co-Chairs of the Technical Committee responsible for the Student Poster Session and Research Competition held as part of MobiCom 2007 in Montreal. A total of 29 submissions were received for the poster session and the committee selected 16 of these submissions. Authors of all the accepted submissions were invited to submit their work in the form of an extended abstract of length at most three pages to this special issue. We received abstracts from 13 of the 16 selected submissions.
Speech "Siglet" Detection for Business Microscope (concise contribution)
Authors: Jun Nishimura, Nobuo Sato, Tadahiro Kuroda
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

"Business Microscope" is a tool which provides knowledge workers with a bird-eye view of their daily communication. To meet the problem of the energy consumption of sensor nodes and privacy concerns for wearers and non-wearers, "siglet" sensing is proposed. Siglet sensing is a way to capture very short and noise-like signals by sensors operating on a low duty ratio. To extract the useful information on workers' communication, speech siglet detection is studied. The LBG trained speech and workplace nonspeech models with Mel Frequency Cepstrum Coefficients (MFCCs) as feature vectors are utilized. A hierarchical pruning technique is studied to reduce the calculation cost of the matching process to nearly 25% and refine the classification accuracy. Our approach achieved average speech and nonspeech classification accuracy of 99.96% on 0.1s long test siglets.
Content-Based Classifying Traditional Chinese Calligraphic Images
Authors: Zhong Gao, Guanming Lu, Daquan Gu, Chun He
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

As traditional Chinese calligraphic (TCC) occupies an important place in the life of modern Chinese, there are a lot of TCC images digitalized and exhibited on the Internet. However, effective classification in them is an imperative problem need to be addressed. The paper proposes a content-based classification scheme that represents the visual content of TCC images by a textural feature set. Four kinds of classifier implemented in the scheme learn the characteristics of fundamental TCC style, art movements and calligraphic artists. The experimental results show that the scheme is capable of classifying the TCC image based on calligraphic artists as well as art movements with an accuracy of greater than 85%.
Low-power limited-search parallel state viterbi decoder implementation based on scarce state transition
Authors: Jin Jin, Chi-Ying Tsui
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

In this paper, a low-power Viterbi decoder design based on scarce state transition (SST) is presented. A low complexity algorithm based on a limited search algorithm, which reduces the average number of the add-compare-select computation of the Viterbi algorithm, is proposed and seamlessly integrated with the SST-based decoder. The new decoding scheme has low overhead and facilitates low-power implementation for high throughput applications. We also propose an uneven-partitioned memory architecture for the trace-back survivor memory unit to reduce the overall memory access power. The new Viterbi decoder is designed and implemented in TSMC 0.18-µm CMOS process. Simulation results show that power consumption is reduced by up to 80% for high throughput wireless systems such as Multiband-OFDM Ultra-wideband applications.
Comparison of the Andersen-Gill model with poisson and negative binomial regression on recurrent event data
Authors: Antje Jahn-Eimermacher
Venue: Computational Statistics Data Analysis (2008)

Many generalizations of the Cox proportional hazard method have been elaborated to analyse recurrent event data. The Andersen-Gill model was proposed to handle event data following Poisson processes. This method is compared with non-survival approaches, such as Poisson and negative binomial regression. The comparison is performed on data simulated according to various event-generating processes and differing in subject heterogeneity. When robust standard error estimates are applied, for Poisson processes the Andersen-Gill approach is comparable to a negative binomial regression, whereas the poisson regression has comparable coverage probabilities of confidence intervals, but increased type I error rates; however, none of the methods can generate unbiased parameter estimates with data violating the independent increment assumption. These findings are illustrated by data from a clinical trial of the efficacy of a new pneumococcal vaccine for prevention of otitis media.
A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
Authors: Guoming Lai, Katia Sycara, Cuihong Li
Venue: Multiagent and Grid Systems (2008)

This paper presents a decentralized model that allows self-interested agents to reach "win-win" agreements in a multi-attribute negotiation. The model is based on an alternating-offer protocol. In each period, the proposing agent is allowed to make a limited number of offers. The responding agent can select the best out of these offers. In the case of rejection, agents exchange their roles and the negotiation proceeds to the next period. To make counteroffers, an agent first uses the heuristic of choosing the offer on an indifference (or "iso-utility") curve/surface that is closest to the best offer made by the opponent in the previous period, and then taking this offer as the seed, chooses several other offers randomly in a specified neighborhood of this seed offer. Experimental analysis shows agents can reach near Pareto optimal agreements in quite general situations following the model where agents may have complex preferences on the attributes and incomplete information. This model does not require the presence of a mediator.
Non-preserving splicing with delay
Authors: Remco Loos, Victor Mitrana
Venue: International Journal of Computer Mathematics (2007)

In this paper we investigate H systems with strongly non-preserving splicing that exhibit a new feature, namely delay, and introduce a variant of the H system that lies between H systems with strongly non-preserving splicing and H systems with non-reflexively evolving splicing. Informally, the new splicing system behaves as follows: (1) each splicing step is exactly a splicing step in a system with non-reflexively evolving splicing; and (2) the generated language is obtained exactly as in a system with strongly non-preserving splicing. For both H systems with non-reflexively evolving and non-preserving splicing we have a remarkable jump in power between systems with a finite but arbitrarily large delay, and those with infinite delay. The first can generate non-context-free languages, whereas the second do not get beyond the regular limit. Moreover, H systems with null delay generate all recursively enumerable languages.
Robust support vector machines for classification and computational issues
Authors: T. B. Trafalis, R. C. Gilbert
Venue: Optimization Methods Software (2007)

In this paper, we investigate the theoretical and numerical aspects of robust classification using support vector machines (SVMs) by providing second order cone programming and linear programming formulations. SVMs are learning algorithms introduced by Vapnik used either for classification or regression. They show good generalization properties and they are based on statistical learning theory. The resulting learning problems are convex optimization problems suitable for application of primal-dual interior points methods. We investigate the training of a SVM in the case where a bounded perturbation is added to the value of an input xi∈n. A robust SVM provides a decision function that is immune to data perturbations. We consider both cases where our training data are either linearly separable or non linearly separable respectively and provide computational results for real data sets.
Precise asymptotics in complete moment convergence for self-normalized sums
Authors: Yuexu Zhao, Jingxuan Tao
Venue: Computers Mathematics with Applications (2008)

Let X,X"1,X"2,... be a sequence of nondegenerate i.i.d. random variables with zero means, set S"n=X"1+...+X"n and V"n^2=X"1^2+...+X"n^2, EX^2I(|X|@?x) is a slowly varying function at ~. We prove that, for any @b>2,@d>2/@b-1,lim@e@70@e^@b^(^@d^+^1^)^-^2@?n=2~(logn)^@d^-^2^/^@bnE(S"n/V"n)^2I(|S"n|>=@eV"n(logn)^1^/^@b)=@bE|N|^@b^(^@d^+^1^)@b(@d+1)-2, where N is a standard normal random variable.
A machine learning approach to reading level assessment
Authors: Sarah E. Petersen, Mari Ostendorf
Venue: Computer Speech and Language (2009)

Reading proficiency is a fundamental component of language competency. However, finding topical texts at an appropriate reading level for foreign and second language learners is a challenge for teachers. Existing measures of reading level are not well suited to this task, where students may know some difficult topic-related vocabulary items but not have the same level of sophistication in understanding complex sentence constructions. Recent work in this area has shown the benefit of using statistical language processing techniques. In this paper, we use support vector machines to combine features from n-gram language models, parses, and traditional reading level measures to produce a better method of assessing reading level. We explore the use of negative training data to handle the problem of rejecting data from classes not seen in training, and compare the use of detection vs. regression models on this task. As in many language processing problems, we find substantial variability in human annotation of reading level, and explore ways that multiple human annotations can be used in comparative assessments of system performance.
Content-based image retrieval with the normalized information distance
Authors: Iker Gondra, Douglas R. Heisterkamp
Venue: Computer Vision and Image Understanding (2008)

The main idea of content-based image retrieval (CBIR) is to search on an image's visual content directly. Typically, features (e.g., color, shape, texture) are extracted from each image and organized into a feature vector. Retrieval is performed by image example where a query image is given as input by the user and an appropriate metric is used to find the best matches in the corresponding feature space. We attempt to bypass the feature selection step (and the metric in the corresponding feature space) by following what we believe is the logical continuation of the CBIR idea of searching visual content directly. It is based on the observation that, since ultimately, the entire visual content of an image is encoded into its raw data (i.e., the raw pixel values), in theory, it should be possible to determine image similarity based on the raw data alone. The main advantage of this approach is its simplicity in that explicit selection, extraction, and weighting of features is not needed. This work is an investigation into an image dissimilarity measure following from the theoretical foundation of the recently proposed normalized information distance (NID) [M. Li, X. Chen, X. Li, B. Ma, P. Vitanyi, The similarity metric, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 863-872]. Approximations of the Kolmogorov complexity of an image are created by using different compression methods. Using those approximations, the NID between images is calculated and used as a metric for CBIR. The compression-based approximations to Kolmogorov complexity are shown to be valid by proving that they create statistically significant dissimilarity measures by testing them against a null hypothesis of random retrieval. Furthermore, when compared against several feature-based methods, the NID approach performed surprisingly well.
CiCUTS: Combining System Execution Modeling Tools with Continuous Integration Environments
Authors: James H. Hill, Douglas C. Schmidt, Adam A. Porter, John M. Slaby
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

System execution modeling (SEM) tools provide an effective means to evaluate the quality of service (QoS) of enterprise distributed real-time and embedded (DRE) systems. SEM tools facilitate testing and resolving performance issues throughout the entire development life-cycle, rather than waiting until final system integration. SEM tools have not historically focused on effective testing. New techniques are therefore needed to help bridge the gap between the early integration capabilities of SEM tools and testing so developers can focus on resolving strategic integration and performance issues, as opposed to wrestling with tedious and error-prone low-level testing concerns. This paper provides two contributions to research on using SEM tools to address enterprise DRE system integration challenges. First, we evaluate several approaches for combining continuous integration environments with SEM tools and describe CiCUTS, which combines the CUTS SEM tool with the CruiseControl .NET continuous integration environment. Second, we present a case study that shows how CiCUTS helps reduce the time and effort required to manage and execute integration tests that evaluate QoS metrics for a representative DRE system from the domain of shipboard computing. The results of our case study show that CiCUTS helps developers and testers ensure the performance of an example enterprise DRE system is within its QoS specifications throughout development, instead of waiting until system integration time to evaluate QoS.
FPGA-Based 1.2 GHz Bandwidth Digital Instantaneous Frequency Measurement Receiver
Authors: James Helton, Chien-In Henry Chen, David M. Lin, James B. Y. Tsui
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Digital wideband receivers are essential elements used in electronic warfare applications. Instantaneous Frequency Measurement (IFM) receivers are suitable for use in EW systems due to the ultra-wideband instantaneous radio-frequency (RF) bandwidth, fine-frequency resolution, and moderately high sensitivity and dynamic range. Conventional IFM receivers use analog components such as power dividers, crystal video detectors, and hybrids. This paper presents the architecture and design implementation of a patented “digital IFM receiver” algorithm. The invention is capable of detecting short wave pulse or CW signal of 1.2 GHz bandwidth with a major error within 2 MHz for every 100 nsec.
STOPE-based approach for e-readiness assessment case studies
Authors: Khalid Al-Osaimi, Abdulmohsen Alheraish, Saad Haj Bakry
Venue: International Journal of Network Management (2008)

The STOPE-based approach is used here for practical e-readiness assessment case studies. The approach integrates and evaluates the various e-readiness assessment issues, over its well-structured domains: strategy, technology, organization, people, and environment. The case studies considered concern three Saudi organizations: a government organization, a bank, and a private sector company. The results obtained provide e-readiness indicators that illustrate the strengths and weaknesses of each organization with regard to e-readiness strategic development issues, information and communication technology (ICT)issues, management and organization issues, people issues, and environment issues within which the organization operates. The work shows how the approach can be practically used, and it also provides practical results that direct the organizations concerned toward enhancing their e-readiness in response to the current trend of globalizing e-business.
Computation of the Folkman number Fe(3, 3; 5)
Authors: Konrad Piwakowski, Stanisaw P. Radziszowski, Sebastian Urbański
Venue: Journal of Graph Theory (1999)

With the help of computer algorithms, we improve the lower bound on the edge Folkman number Fe(3, 3; 5) and vertex Folkman number Fv(3, 3; 4), and, thus, show that the exact values of these numbers are 15 and 14, respectively. We also present computer enumeration of all critical graphs. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 41&ndash;49, 1999