ppxscal/embedding_network huggingface dataset:
Active Memory Clusters: Efficient Multiprocessing on Commodity Clusters
Authors: Mark Heinrich, Evan Speight, Mainak Chaudhuri
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

We show how novel active memory system research and system networking trends can be combined to realize hardware distributed shared memory on clusters of industry-standard workstations. Our active memory controller extends the cache coherence protocol to support transparent use of address re-mapping techniques that dramatically improve single-node performance, and also contains the necessary functionality for building a hardware DSM machine. Simultaneously, commodity network technology is becoming more tightly-integrated with the memory controller. We call our design of active memory commodity nodes interconnected by a next-generation network active memory clusters. We present a detailed design of the AMC architecture, focusing on the active memory controller and the network characteristics necessary to support AMC. We show simulation results for a range of parallel applications, showing that AMC performance is comparable to that of custom hardware DSM systems and far exceeds that of the fastest software DSM solutions.
A Holistic Approach for Performance Measurement and Analysis for Petascale Applications
Authors: Heike Jagode, Jack Dongarra, Sadaf Alam, Jeffrey Vetter, Wyatt Spear, Allen D. Malony
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Contemporary high-end Terascale and Petascale systems are composed of hundreds of thousands of commodity multi-core processors interconnected with high-speed custom networks. Performance characteristics of applications executing on these systems are a function of system hardware and software as well as workload parameters. Therefore, it has become increasingly challenging to measure, analyze and project performance using a single tool on these systems. In order to address these issues, we propose a methodology for performance measurement and analysis that is aware of applications and the underlying system hierarchies. On the application level, we measure cost distribution and runtime dependent values for different components of the underlying programming model. On the system front, we measure and analyze information gathered for unique system features, particularly shared components in the multi-core processors. We demonstrate our approach using a Petascale combustion application called S3D on two high-end Teraflops systems, Cray XT4 and IBM Blue Gene/P, using a combination of hardware performance monitoring, profiling and tracing tools.
An empirical characterization of scientific software development projects according to the Boehm and Turner model: A progress report
Authors: Carlton A. Crabtree, A. Gunes Koru, Carolyn Seaman, Hakan Erdogmus
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering for Computational Science and Engineering (2009)

A number of recent studies reported on the success of applying agile methods in scientific software development projects. These studies found that agile methods are well suited to the exploratory, iterative, and collaborative nature of scientific inquiry. However, these findings might not be applicable in all situations pertaining to scientific software development projects. In addition, they only constitute a subset of the important factors while deciding which development methods and practices should be adopted. Therefore, it becomes important to conduct further research before making recommendations regarding the adoption of certain development methods and practices in this domain. In this progress report, we discuss our on-going research that will empirically study the characteristics of various scientific software development projects according to a model suggested by Boehm and Turner. We plan to conduct interviews and collect data from various scientific software development projects in the Baltimore-Washington area. We expect that our qualitative results will increase our understanding of the characteristics in those projects favoring plan-driven approaches or agile methods, and the needs and conditions associated with those characteristics. Our research provides guidance to scientific software developers by enhancing their capacity to evaluate and understand their own project characteristics and select effective software practices. As a long-term benefit in the same direction, our qualitative results will generate a set of hypotheses that can be tested in different project environments to better understand and categorize scientific software development projects. Consequently, in the future, more generalizable and actionable recommendations can be made for scientific software development projects.
A robust numerical scheme for singularly perturbed parabolic reaction-diffusion problems
Authors: Srinivasan Natesan, Rajdeep Deb
Venue: Neural, Parallel Scientific Computations (2008)

In this article, we study the numerical solution of singularly perturbed parabolic reaction-diffusion initial-boundary-value problems. To solve these problems, we develop a numerical scheme which combines the cubic spline scheme and the classical finite difference scheme for the spatial derivatives, and backward difference scheme for the time derivative. To resolve the boundary layers, we use the piecewise uniform Shishkin mesh for the spatial discretization. Stability analysis and error estimates are obtained. The proposed method is applied to a test problem, which shows the parameter-uniform convergent results.
EndSec: An end-to-end message security protocol for mobile telecommunication networks
Authors: Kameswari Kotapati, Peng Liu, Thomas F. LaPorta
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

A major security vulnerability in the mobile telecommunication network is that wireline signaling messages are cleartext. The latest protocol for wireline signaling message security is Mobile Application Part Security (MAPSec), which protects MAP (a signaling message protocol) messages on the link between nodes. MAPSec is a limited solution because it still leaves MAP signaling messages unsecured in intermediate nodes, and also leaves other wireline signaling message protocols unsecured both on the link and in intermediate nodes. Hence, there is a need for a more comprehensive wireline security scheme to protect all types of wireline signaling messages end-to-end i.e., both on the link and in intermediate nodes. As a solution, we propose EndSec, an end-to-end wireline signaling message security protocol for all types of signaling messages. EndSec works by inserting cryptographic checks on data items in signaling messages, has capabilities to self-detect and repair corruption, and identifies the nodes causing corruption.
What Would Edmonds Do? Augmenting Paths and&#x00a0;Witnesses for Degree-Bounded MSTs
Authors: Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
Venue: Algorithmica (2009)

Given a graph and degree upper bounds on vertices, the BDMST problem requires us to find a minimum cost spanning tree respecting the given degree bounds. This problem generalizes the Travelling Salesman Path Problem (TSPP), even in unweighted graphs, and so we expect that it is necessary to relax the degree constraints to get efficient algorithms. K&#x00f6;nemann and Ravi (Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, pp.&#x00a0;537&#x2013;546, 2000; Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, pp.&#x00a0;389&#x2013;395, 2003) give bicriteria approximation algorithms for the problem using local search techniques of Fischer (Technical Report 14853, Cornell University, 1993). Their algorithms find solutions which make a tradeoff of the approximation factor for the cost of the resulting tree against the factor by which degree constraints are violated. In particular, they give an algorithm which, for a graph with a spanning tree of cost&#x00a0;C and degree B, and for parameters b,w>1, produces a tree whose cost is at most wC and whose degree is at most $\frac{w}{w-1}bB+\log_{b}n.$ A primary contribution of K&#x00f6;nemann and Ravi is to use a Lagrangean relaxation to formally relate the BDMST problem to what we call the MDMST problem, which is the problem of finding an MST of minimum degree in a graph. In their solution to the MDMST problem, they make central use of a local-search approximation algorithm of Fischer. In this paper, we give the first approximation algorithms for the BDMST problem&#x2014;both our algorithms find trees of optimal cost. We achieve this improvement using a primal-dual cost bounding methodology from Edmonds&#x2019; weighted matching algorithms which was not previously used in this context. In order to follow Edmonds&#x2019; approach, we develop algorithms for a variant of the MDMST problem in which there are degree lower bound requirements. This variant may be of independent interest; in particular, our results extend to a generalized version of the BDMST problem in which both upper and lower degree bounds are given. First we give a polynomial-time algorithm that finds a tree of optimal cost and with maximum degree at most $\frac{b}{2-b}B+O(\log_{b}n)$for any b&#x2208;(1,2). We also give a quasi-polynomial-time approximation algorithm which produces a tree of optimal cost C and maximum degree at most B+O(log&#x2009;n/log&#x2009;log&#x2009;n). That is, the error is additive as well as restricted just to the degree. This further improvement in degree is obtained by using augmenting-path techniques that search over a larger solution space than Fischer&#x2019;s local-search algorithm.
Performance evaluation of a DTN as a city-wide infrastructure network
Authors: Joohyun Lee, Kyunghan Lee, Jaesung Jung, Song Chong
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

As providing data networks in an urban district through a cellular system is expensive and does not provide sufficient capacity, use of a wireless mesh network is generally considered as a way to achieve more capacity. While a mesh network has sizable installation costs to deploy routers and still does not provide abundant capacity, it is worthwhile to consider a DTN whose capacity is abundant without additional installation costs to support a mesh network. In this paper, we propose an architecture of a DTN as an infrastructure network and study the capacity region of the DTN over the real mobility of Shanghai taxies. We identify and verify several key characteristics of the DTN capacity, including time-varying and asymmetric characteristics. Our simulation results show that the capacity of the DTN is superior to a mesh network most of the time for both single-link and multi-link scenarios.
DFM and DFA approach on designing pressure vessel
Authors: A. R. Ismail, S. C. Abdullah, A. H. H. A. Manap, K. Sopian, M. M. Tahir, I. M. S. Usman, D. A. Wahab
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

This case study shows how the effect of implementation of the Design for Manufacture and Assembly (DFMA) in product development process. Pressure vessel was selected as the example in this case study. The pressure vessel design was obtained from one of the oil and gas company in Malaysia. Information gathering and data collection were conducted by interview and observation. Information such as design and component development time was analyzed and modeled to ensure the effect of implementation of this approach to product development cycle and design efficiencies. The method used for this case study is the Boothroyd and Dewhurst method. Using this method, the existing design of the pressure vessel was modified by incorporating the design for manufacture and assembly requirements. The approach enables a shorter product development cycle time through reduction in manufacturing and assembly time. Apart from that, the overall cost of the pressure vessel was reduced. The implementation of this approach has improved the company's performance and return of investment.
Multi-instance genetic programming for web index recommendation
Authors: A. Zafra, C. Romero, S. Ventura, E. Herrera-Viedma
Venue: Expert Systems with Applications: An International Journal (2009)

This article introduces the use of a multi-instance genetic programming algorithm for modelling user preferences in web index recommendation systems. The developed algorithm learns user interest by means of rules which add comprehensibility and clarity to the discovered models and increase the quality of the recommendations. This new model, called G3P-MI algorithm, is evaluated and compared with other available algorithms. Computational experiments show that our methodology achieves competitive results and provide high-quality user models which improve the accuracy of recommendations.
Entropic security in quantum cryptography
Authors: Simon Pierre Desrosiers
Venue: Quantum Information Processing (2009)

We present two new definitions of security for quantum ciphers which are inspired by the definitions of entropic security and entropic indistinguishability defined by Dodis and Smith. We prove the equivalence of these two new definitions. We also propose a generalization of a cipher described by Dodis and Smith and show that it can actually encrypt n qubits using less than n classical bits of key under reasonable conditions and yet be secure in an information theoretic setting. This cipher also totally closes the gap between the key requirement of quantum ciphers and classical ciphers.
AARTIC: development of an intelligent environment for human learning
Authors: Faten Mhiri, Sylvie Ratté
Venue: ACM SIGCSE Bulletin (2009)

The project's main objective is the design and development of an intelligent environment for human learning (EIAH). Our system is adaptive and intelligent and aims to guide students in the realization of their labs and to collaborate with peers. A pedagogical agent, integrated into the environment, incorporates functions of observations and personalized tutoring for learning. The system is currently tested in an introductory course in IA given to undergraduate students at ETS.
The Key Theorem of Learning Theory on Uncertainty Space
Authors: Shujing Yan, Minghu Ha, Xiankun Zhang, Chao Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Statistical Learning Theory is commonly regarded as a sound framework within which we handle a variety of learning problems in presence of small size data samples. However, since the theory is based on probability space, it hardly handles statistical learning problems on uncertainty space. In this paper, the Statistical Learning Theory on uncertainty space is investigated. The Khintchine law of large numbers on uncertainty space is proved. The definitions of empirical risk functional, expected risk functional and empirical risk minimization principle on uncertainty space are introduced. On the basis of these concepts, the key theorem of learning theory on uncertainty space is introduced and proved.
Automated Mentoring for Reflection in an Eportfolio
Authors: Tzemin Chung, Mun Kew Leong, Joel P. L. Loo
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In this paper, we describe a system that provides automated mentoring through the use of reflective thinking in eportfolios. Reflective thinking is a cognitive tool to cultivate deep learning. It is most effective when done within a community of peers where social interaction is emphasized. Moreover, it is also important that reflection is guided by a mentor so that meaningful exchange can take place. We currently propose a system that dynamically generates reflective prompts from past and current eportfolios and adapt such prompts to students. The automatic mentoring process goes through four steps, namely, priming, guidance, momentum, and termination. The aim of the system is to help students acquire new knowledge and skills, achieve deep learning and move towards higher-order learning.
A Sensor Network System for Measuring Traffic in Short-Term Construction Work Zones
Authors: Manohar Bathula, Mehrdad Ramezanali, Ishu Pradhan, Nilesh Patel, Joe Gotschall, Nigamanth Sridhar
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

In this paper, we present the design and implementation of a sensor network system for monitoring the flow of traffic through temporary construction work zones. As opposed to long-term work zones which are common on highways, short-term or temporary work zones remain active for a few hours or a few days at most. As such, instrumenting temporary work zones with monitoring equipment similar to those used in long-term work zones is not practical. Yet, these temporary work zones present an important problem in terms of crashes occurring in and around them. Our design for a sensornet-based system for monitoring traffic is (a) inexpensive, (b) rapidly deployable, and (c) requires minimal maintenance. We report on our experiences in building this system, and with testing our system in live work zones in the Cleveland area.
An Improved Margin Adaptive Subcarrier Allocation with Fairness for Multiuser OFDMA System
Authors: Tan Li, Gang Su, Guangxi Zhu, Jun Jiang, Hui Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

In this paper, according to the margin adaptive (MA) algorithm with fixed transmission rate, we propose a suboptimal MA Greedy algorithm with demand function. In this algorithm, the allocation process is divided into two separate steps, resource calculation and subcarrier allocation. With the employment of overload inhibition process, diversity scheduling method and demand function, we improve the traditional MA algorithms to reduce the computing complexity with subscribers' fairness and Quality of Service (QoS) guaranteed. Utilizing the simulation with real-time services, we have proved that compared to static allocation algorithms, our MA Greedy algorithm could enhance the system performance by 5-6dB with low computing complexity, which is very close to the optimal MA algorithm.
Word Sense Disambiguation for XML Structure Feature Generation
Authors: Andrea Tagarelli, Mario Longo, Sergio Greco
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

A common limit of most existing methods that manage XML structure information is that they do not handle the semantic meanings that might be associated to the markup tags. In this paper, we study how to map structure information available from XML elements into semantically related concepts in order to support the generation of XML semantic features of XML structural type. For this purpose, we define an unsupervised word sense disambiguation method to select the most appropriate meaning for each element contextually to its respective XML path. The proposed approach exploits conceptual relations provided by a lexical ontology such as WordNet and employs different notions of sense relatedness. Experiments with data from various application domains are discussed, showing that our approach can be effectively used to generate structural semantic features.
The Development of a Grouping System in a Collaborative Learning Environment
Authors: Pao-Ta Yu, Yen-Shou Lai, Chia-Ming Liu, Jenq-Muh Hsu
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This study develops a mobile learning and grouping system based on thinking styles and Bloom's taxonomy in a collaborative learning environment. The environment takes cooperative learning as the instructional strategy, and Student Teams-Achievement Divisions (STAD) as the cooperative learning method. The purpose is to propose a method of heterogeneous grouping that students not only use mobile learning but also use students' thinking styles for grouping. Participants in the experiment include three classes of 96 sixth-grade students which are assigned to one control group and two experimental groups. Data collection includes mathematical anxiety questionnaires, learning sheets, and achievement test. The results show that the grouping method has better learning effects than mixed grouping and individual learning.
Digital SLR Astrophotography, 1st edition
Authors: Michael A. Covington
Venue:  (2007)

In the last few years, digital SLR cameras have taken the astrophotography world by storm. It is now easier to photograph the stars than ever before! They are compact and portable, flexible to adapt with different lenses and for telescope use, and above all DSLR cameras are easy and enjoyable to use. In this concise guide, experienced astrophotography expert Michael Covington outlines the simple, enduring basics that will enable you to get started, and help you get the most from your equipment. He covers a wide selection of equipment, simple and advanced projects, technical considerations and image processing techniques. Unlike other astrophotography books, this one focuses specifically on DSLR cameras, not astronomical CCDs, non-DSLR digital cameras, or film. This guide is ideal for astrophotographers who wish to develop their skills using DSLR cameras and as a friendly introduction to amateur astronomers or photographers curious about photographing the night sky. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Robust cluster validity indexes
Authors: Kuo-Lung Wu, Miin-Shen Yang, June-Nan Hsieh
Venue: Pattern Recognition (2009)

Cluster validity indexes can be used to evaluate the fitness of data partitions produced by a clustering algorithm. Validity indexes are usually independent of clustering algorithms. However, the values of validity indexes may be heavily influenced by noise and outliers. These noise and outliers may not influence the results from clustering algorithms, but they may affect the values of validity indexes. In the literature, there is little discussion about the robustness of cluster validity indexes. In this paper, we analyze the robustness of a validity index using the @f function of M-estimate and then propose several robust-type validity indexes. Firstly, we discuss the validity measure on a single data point and focus on those validity indexes that can be categorized as the mean type of validity indexes. We then propose median-type validity indexes that are robust to noise and outliers. Comparative examples with numerical and real data sets show that the proposed median-type validity indexes work better than the mean-type validity indexes.
An approach for Mail-Robot navigation using a CBR technique
Authors: Martí Navarro, Stella Heras, Vicente Julián
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

Multi-Agent System (MAS) paradigm has seemed especially appropriate for developing applications in complex domains, as Real-Time environments are. In this situation, an artificial intelligent technique may require tasks which involve searching in large search spaces in a bounded time. However, the main problem of MAS applications over real-time environments is to merge intelligent deliberative techniques with real-time actions in complex and distributed environments. In this settings, agents must make sure that they will be able to perform a service within a specific time before committing themselves to its performance. This paper proposes the use of a Case-Based Reasoning (CBR) technique to cope with this functionality. The technique is tested in an example where the tasks are bounded and need a temporal control.