ppxscal/embedding_network huggingface dataset:
Memory management thread for heap allocation intensive sequential applications
Authors: Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solihin
Venue: Proceedings of the 10th MEDEA workshop on MEmory performance: DEaling with Applications, systems and architecture (2009)

Dynamic memory management is one of the most ubiquitous and expensive operations in many C/C++ applications. Some C/C++ programs might spend up to one third of their execution time in dynamic memory management routines. With multicore processors as a mainstream architecture, it is important to investigate how dynamic memory management can exploit the multi-core parallelism for speeding up sequential programs. In this paper, we propose a way for exploiting multicore parallelism in dynamic memory management for sequential applications, by spinning off memory allocation and deallocation functions to a separate thread that we refer to as memory management thread (MMT). The goal of this study is to show how an efficient design and implementation of MMT can give performance without any algorithm or implementation level knowledge of underlying memory management library being offloaded. Using heap allocation-intensive benchmarks, we evaluate MMT on an Intel Core 2 Quad platform for widely used Doug Lea's memory allocator. Without any modifications to application source-code or memory management algorithm of underlying memory allocators, our MMT approach achieves an average speedup ratio of 1.19x, and 1.60x in the best case.
Design of Smart Temperature Sensor Based on IEEE1451.2 Standard
Authors: Li Zhaochun, Cheng Yuzhu, Hua Jin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The design of a Smart Transducer Interface Module is developed for temperature sensing, complying with the IEEE 1451.2 standard. The standard IEEE1451.2 can be a helpful tool to design smart temperature sensor compatible with the possibility to use different sensors technologies without major redesigning efforts. The design provides a generic solution to make uniform temperature sensors, instead of a proprietary solution for various applications. In this work a solution for the development of electronic smart temperature senor including design of hardware and software is presented based on this standard, which STIM is composed of the chips of AT89C51 and digital sensor DS18B20, and the flow chart of program and TEDS are studied. The design is simulated by Proteus. The further work for STIM communicating with NCAP need be done.
Improved bispectrum based tests for Gaussianity and linearity
Authors: Yngve Birkelund, Alfred Hanssen
Venue: Signal Processing (2009)

The classical bispectrum based tests for linearity of time series are based on Gaussian asymptotics and a suboptimal smoothing in the bispectral domain. We show that the resulting classical tests may lead to vastly incorrect significance levels for non-Gaussian time series. This implies that a non-Gaussian linear time series may incorrectly be classified as non-linear. The purpose of this paper is to propose simple yet accurate tests for Gaussianity and linearity. The improved tests are derived through: (1) an optimal hexagonal smoothing in the bispectral domain, (2) the construction of simple and intuitive bispectrum based test statistics, and (3) determination of correct significance levels through a new skewness preserving scheme for linear surrogate data. The superiority of the proposed tests is demonstrated through extensive Monte Carlo simulations using relevant synthetic data.
SedLog: A shareware program for drawing graphic logs and log data manipulation
Authors: Dimitrios Zervas, Gary J. Nichols, Robert Hall, Helen R. Smyth, Charlotta Lüthje, Fionn Murtagh
Venue: Computers Geosciences (2009)

SedLog is a free multi-platform software package for creating graphic sediment logs providing an intuitive graphical user interface. The graphic sediment logs generated by SedLog can be exported as PDF, Scalable Vector Graphics (SVG), or JPEG for use by other drawing applications or for publications. Log data can be imported and exported in Comma Separated Values (CSV) format. The logs can also be printed to any paper size the user wants. Zoom In, Zoom Out, Fit page, Fit Height and Fit Width facilities are also provided to enable the user to customise the workspace size.
Airborne Dispersion Modelling Based on Artificial Neural Networks
Authors: Bin Hao, Hui Xie, Fei Ma
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Artificial Neural Networks (ANNs) and airborne dispersion models are two important techniques for predicting air pollution concentrations. The purpose of this paper was to develop an integrated model that canoptimise the performances of simple airborne dispersion models. The ANN dispersion model, consisting of the ANN and air dispersion model, was designed and realized. In this new model, the concentration levels produced by the air dispersion model were filtered with an ANN to account for disagreement between the actual and predicted values.The performance of the new methodology was tested by two data sets: the Prairie Grass and Copenhagen when compared with the performance of the simple air dispersion model. Simulation results showed a marked improvement for the ANN dispersion model, which indicated that the use of ANN in order to better the simple air dispersion model could be the reasonable model combination.
Proceedings of the 10th International Conference on Parsing Technologies
Venue: Annual Meeting of the ACL (2007)

Welcome to the Tenth International Conference on Parsing Technologies, IWPT 2007, in the beautiful city of Prague. IWPT'07 continues the tradition of biennial workshops on parsing technology organized by SIGPARSE, the Special Interest Group on Parsing of the Association for Computational Linguistics (ACL). The first workshop, in Pittsburgh and Hidden Valley, was followed by workshops in Cancun (Mexico) in 1991; Tilburg (Netherlands) and Durbuy (Belgium) in 1993; Prague and Karlovy Vary (Czech Republic) in 1995; Boston/Cambridge (Massachusetts) in 1997; Trento (Italy) in 2000; Beijing (China) in 2001; Nancy (France) in 2003; and Vancouver (Canada) in 2005. Over the years the IWPT Workshops have become the major forum for researchers in natural language parsing. They have also given rise to four books on parsing technologies. For the first time this year, IWPT is organised as a co-located event with the main ACL conference and with EMNLP and many other workshops.
Psi-calculi in Isabelle
Authors: Jesper Bengtson, Joachim Parrow
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, giving it an expressive power beyond the applied pi-calculus and the concurrent constraint pi-calculus.We have formalised psi-calculi in the interactive theorem prover Isabelle using its nominal datatype package. One distinctive feature is that the framework needs to treat binding sequences, as opposed to single binders, in an efficient way. While different methods for formalising single binder calculi have been proposed over the last decades, representations for such binding sequences are not very well explored.The main effort in the formalisation is to keep the machine checked proofs as close to their pen-and-paper counterparts as possible. We discuss two approaches to reasoning about binding sequences along with their strengths and weaknesses. We also cover custom induction rules to remove the bulk of manual alpha-conversions.
An Improved Algorithm for Image Fractal Dimension
Authors: Lihong Hu, Zifan Yu, Yanfang Liu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

There are several methods to estimate fractal dimension in fractional Brownian motion model. In this paper, one of methods, the variance method, is analyzed detailedly, and some problems in the method are pointed out. To resolve the problems, an improved method is proposed. To validate the method, a comparing experiment of two methods is designed. In the experiment, a SPOT image is selected and five categories, flourishing field, bareness land, resident area, water area and mountainous area, in the image are taken as examples. The experiment shows that the result by improved method is coincident with human perception and the improved method is also helpful for classification.
Fine-Grained Data Distribution Operations for Particle Codes
Authors: Michael Hofmann, Gudula Rünger
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

This paper proposes a new fine-grained data distribution operation MPI_Alltoall_specific that allows an element-wise distribution of data elements to specific target processes. This operation can be used to implement irregular data distribution operations that are required, for example, in particle codes. We present different implementation variants for MPI_Alltoall_specific which are based on collective MPI operations, on point-to-point communication operations, or on parallel sorting. The properties of the implementation variants are discussed and performance results with different data sets are presented. For the performance results two high scaling hardware platforms, including a Blue Gene/P system, are used.
The Round Complexity of Verifiable Secret Sharing Revisited
Authors: Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS can be circumvented by introducing a negligible probability of error in the reconstruction phase. Previous results show matching lower and upper bounds of three rounds for VSS, with n = 3t + 1, where the reconstruction of the secrets always succeeds, i.e. with probability 1. In contrast we show that with a negligible probability of error in the reconstruction phase: 1 There exists an efficient 2-round VSS protocol for n = 3t + 1. If we assume that the adversary is non-rushing then we can achieve a 1-round reconstruction phase. 1 There exists an efficient 1-round VSS for t = 1 and n > 3. 1 We prove that our results are optimal both in resilience and number of sharing rounds by showing: 1 There does not exist a 2-round WSS (and hence VSS) for n ≤ 3t. 1 There does not exist a 1-round VSS protocol for t ¿ 2 and n ¿ 4.
When You Can't Read It, Listen to It! An Audio-Visual Interface for Book Reading
Authors: Carlos Duarte, Luís Carriço
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

This paper presents a prototype of a mobile Digital Talking Book player, which, by combining visual and non-visual means of interaction, strives to achieve universal accessibility. Details on the non-visual aspects of the interaction, both input and output, are provided. To assess the validity of the proposed solutions, an experiment evaluates the non-visual operation of the prototype. Results show users can complete the same tasks with visual and non-visual interaction. However, some limitations are identified, and the observations prompt a discussion on how the use of multimodal interfaces can improve their accessibility and usability.
A Knowledge-Based System to Support Emergency Medical Services for Disabled Patients
Authors: Luca Chittaro, Roberto Ranon, Elio Carchietti, Agostino Zampa, Emanuele Biasutti, Luca Marco, Augusto Senerchia
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

This paper illustrates a knowledge based system devoted to help nurses and volunteers of Emergency Medical Services (EMS) in dealing with disabled patients during an emergency.
Incorporation of Morphological Properties of Buildings' Descriptors Computed from GIS and LIDAR Data on an Urban Multi-agent Vector Based Geo-simulator
Authors: Cláudio Carneiro, Vitor Silva, François Golay
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

In this paper we present an application of GIS and airborne light detection and ranging (LIDAR) data analysis for computation of morphological properties of buildings' descriptors in the context of an urban morphogenesis geo-simulator. The morphological descriptors of buildings here studied are the mean height, total volume, number of faces, ground surface area, facades surface area, roof surface area, envelope surface area, type of roof, envelope surface area-to-ground surface area complexity, envelope surface area-to-total volume complexity and total volume-to-number of faces complexity. Considering the building's morphology under analysis, its properties are extracted from a 2D GIS cadastral database and a normalized 2.5-D Urban Surface Model (n2.5-DUSM) with a resolution grid of 1 by 1 meter, constructed from a hybrid approach that uses GIS and LIDAR data, or a segmentation procedure for LIDAR data. The case study for application is the district of Chavannes, in Lausanne, where GIS and LIDAR data is available.
Explaining Inconsistencies in OWL Ontologies
Authors: Matthew Horridge, Bijan Parsia, Ulrike Sattler
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

Justifications play a central role as the basis for explaining entailments in OWL ontologies. While techniques for computing justifications for entailments in consistent ontologies are theoretically and practically well-understood, little is known about the practicalities of computing justifications for inconsistent ontologies. This is despite the fact that justifications are important for repairing inconsistent ontologies, and can be used as a basis for paraconsistent reasoning. This paper presents algorithms, optimisations, and experiments in this area. Surprisingly, it turns out that justifications for inconsistent ontologies are more "difficult" to compute and are often more "numerous" than justifications for entailments in consistent ontologies: whereas it is always possible to compute some justifications, it is often not possible to compute all justifications for real world inconsistent ontologies.
Frequency-aware rate adaptation and MAC protocols
Authors: Hariharan Rahul, Farinaz Edalat, Dina Katabi, Charles G. Sodini
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

There has been burgeoning interest in wireless technologies that can use wider frequency spectrum. Technology advances, such as 802.11n and ultra-wideband (UWB), are pushing toward wider frequency bands. The analog-to-digital TV transition has made 100-250 MHz of digital whitespace bandwidth available for unlicensed access. Also, recent work on WiFi networks has advocated discarding the notion of channelization and allowing all nodes to access the wide 802.11 spectrum in order to improve load balancing. This shift towards wider bands presents an opportunity to exploit frequency diversity. Specifically, frequencies that are far from each other in the spectrum have significantly different SNRs, and good frequencies differ across sender-receiver pairs. This paper presents FARA, a combined frequency-aware rate adaptation and MAC protocol. FARA makes three departures from conventional wireless network design: First, it presents a scheme to robustly compute per-frequency SNRs using normal data transmissions. Second, instead of using one bit rate per link, it enables a sender to adapt the bitrate independently across frequencies based on these per-frequency SNRs. Third, in contrast to traditional frequency-oblivious MAC protocols, it introduces a MAC protocol that allocates to a sender-receiver pair the frequencies that work best for that pair. We have implemented FARA in FPGA on a wideband 802.11-compatible radio platform. Our experiments reveal that FARA provides a 3.1x throughput improvement in comparison to frequency-oblivious systems that occupy the same spectrum.
On Improving Provider Decision Making with Enhanced Computerized Clinical Reminders
Authors: Sze-Jung Wu, Mark Lehto, Yuehwern Yih, Jason J. Saleem, Bradley Doebbeling
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

A computerized clinical reminder (CCR) system is a type of decision support tool to remind healthcare providers of recommended actions. In our prior study, we found a linear correlation between resolution time and adherence rate. This correlation implies a potentially biased clinical decision making. This study aimed to redesign the Veterans Affairs (VA) CCR system in order to improve providers' situation awareness and decision quality. The CCR redesign incorporated a knowledge-based risk factor repository and a prioritization mechanism. Both CCR designs were prototyped and tested by 16 physicians in a controlled lab in the Indianapolis VA Medical Center. The results showed that 80% of the subjects changed their prioritization decisions after being introduced to the modified design. Moreover, with the modified design, the correlation between resolution time and adherence rate was no longer found. The redesign improved the subjects' situation awareness and assisted them in making more informed decisions.
Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
Authors: Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We present an extension $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ of the description logic $\mathcal{EL}^{+^\bot}$ for reasoning about prototypical properties and inheritance with exceptions. $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ is obtained by adding to $\mathcal{EL}^{+^\bot}$ a typicality operator T, which is intended to select the "typical" instances of a concept. In $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ knowledge bases may contain inclusions of the form "T(C) is subsumed by P", expressing that typical C-members have the property P. We show that the problem of entailment in $\mathcal{EL}^{+^\bot}{\bf {\rm T}}$ is in co-NP.
SPAX --- PAX with Super-Pages
Authors: Daniel Bößwetter
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

Much has been written about the pros and cons of column-orientation as a means to speed up read-mostly analytic workloads in relational databases. In this paper we try to dissect the primitive mechanisms of a database that help express the coherence of tuples and present a novel way of organizing relational data in order to exploit the advantages of both, the row-oriented and the column-oriented world. As we go, we break with yet another bad habit of databases, namely the equal granularity of reads and writes which leads us to the introduction of consecutive clusters of disk pages called super-pages.
An Empirical Study of Collaborative Acoustic Source Localization
Authors: Andreas Mantik Ali, Shadnaz Asgari, Travis C. Collier, Michael Allen, Lewis Girod, Ralph E. Hudson, Kung Yao, Charles E. Taylor, Daniel T. Blumstein
Venue: Journal of Signal Processing Systems (2009)

Field biologists use animal sounds to discover the presence of individuals and to study their behavior. Collecting bio-acoustic data has traditionally been a difficult and time-consuming process in which researchers use portable microphones to record sounds while taking notes of their own detailed observations. The recent development of new deployable acoustic sensor platforms presents opportunities to develop automated tools for bio-acoustic field research. In this work, we implement both two-dimensional (2D) and three-dimensional (3D) AML-based source localization algorithms. The 2D algorithm is used to localize marmot alarm-calls of marmots on the meadow ground. The 3D algorithm is used to localize the song of Acorn Woodpecker and Mexican Antthrush birds situated above the ground. We assess the performance of these techniques based on the results from four field experiments: two controlled test of direction-of-arrival (DOA) accuracy using a pre-recorded source signal for 2D and 3D analysis, an experiment to detect and localize actual animals in their habitat, with a comparison to ground truth gathered from human observations, and a controlled test of localization experiment using pre-recorded source to enable careful ground truth measurements. Although small arrays yield ambiguities from spatial aliasing of high frequency signals, we show that these ambiguities are readily eliminated by proper bearing crossings of the DOAs from several arrays. These results show that the AML source localization algorithm can be used to localize actual animals in their natural habitat using a platform that is practical to deploy.
Interpolation and Symbol Elimination
Authors: Laura Kovács, Andrei Voronkov
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

We prove several results related to local proofs, interpolation and superposition calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and results suggest that symbol-eliminating inferences may be an interesting alternative to interpolation.
Integrating Specification and Programs for System Modeling and Verification
Authors: Jun Sun, Yang Liu, Jin Song Dong, Chunqing Chen
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

High level specification languages like CSP use mathematical objects as abstractions to represent systems and processes. System behaviors are described as process expressions combined with compositional operators, which are associated with elegant algebraic laws for system analysis. Nonetheless, modeling systems with non-trivial data and functional aspects using CSP remains difficult. In this work, we propose a modeling language named CSP# (short for communicating sequential programs) which integrates high-level modeling operators with low-level procedural codes, for the purpose of efficient mechanical system verification. We demonstrate that data operations can be modeled as terminating sequential programs, which can be composed using high-level compositional operators. CSP# is supported by the PAT model checker and has been applied to a number of systems.
End Users at the Bazaar: Designing Next-Generation Enterprise Resource Planning Systems
Authors: Christian Dorner, Sebastian Draxler, Volkmar Pipek, Volker Wulf
Venue: IEEE Software (2009)

The "bazaar" metaphor has developed a lasting popularity in software engineering, especially as software architectures have evolved from monoliths to service orientation. Nevertheless, the metaphor is limited because it doesn't consider end users, those who develop software for themselves. Introducing such an end user, the "prosumer," to the bazaar not only suggests a changing division of work in software development but also calls for different functionality and architectural choices. The authors evaluated changing software architectures from an end-user development (EUD) perspective, taking the case of enterprise resource planning (ERP) systems as traditionally monolithically designed systems moving toward service orientation. On the basis of the study's findings, which indicated problems with the systems' technical flexibility, the authors developed a tool set for fostering EUD activities. Their new architecture for ERP systems enables end users to create their own solutions.