ppxscal/embedding_network huggingface dataset:
High-performance implementation of the level-3 BLAS
Authors: Kazushige Goto, Robert Van De Geijn
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

A simple but highly effective approach for transforming high-performance implementations on cache-based architectures of matrix-matrix multiplication into implementations of other commonly used matrix-matrix computations (the level-3 BLAS) is presented. Exceptional performance is demonstrated on various architectures.
Time is a Resource, and Other Stories
Authors: Edward A. Lee
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

This paper examines some misleading aphorisms.
Randomized search trees
Authors: C. R. Aragon, R. G. Seidel
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior is presented. In particular, in the expected case an update takes logarithmic time and requires fewer than two rotations. Moreover, the update time remains logarithmic, even if the cost of a rotation is taken to be proportional to the size of the rotated subtree. The approach generalizes naturally to weighted trees, where the expected time bounds for accesses and updates again match the worst case time bounds of the best deterministic methods. The balancing strategy and algorithms are exceedingly simple and should be fast in practice.
Spatial-Data Sharing: Applying Social-Network Analysis to study individual and collective behaviour
Authors: El. E. Omran, J. van Etten
Venue: International Journal of Geographical Information Science (2007)

Spatial-Data Sharing (SDS) is a crucial aspect of spatial-data infrastructures. This paper introduces Social-Network Analysis to research on SDS. By mapping out relationships among social actors using Social-Network Analysis, the collective properties of SDS in organizations can be investigated. Previous theoretical approaches have focused exclusively on individual behaviour. This paper attempts to expand this focus and applies Social-Network Analysis in a study of SDS in a project of the Egyptian Survey Authority. It concentrates on the emerging pattern of SDS between social actors in the organization and their perceptions and attitudes. Social-Network Analysis results show that SDS in this organization corresponds strongly to the existing hierarchy in the organization. Individual beliefs and perceptions of SDS show patterns that correspond strongly to the network structure. Project leaders are central in the SDS network and optimistic about SDS. Workers lower in the organization feel they have less control and express more concern about constraints regarding SDS than workers higher up in the organization. The paper shows that Social-Network Analysis can be a useful tool to study SDS and complements approaches to individual behaviour. Social-Network Analysis could be expanded to study inter-organizational SDS, could be implemented with digital technology, and could be refined to distinguish behaviour and networks according to different information types.
Terascale turbulence computation using the FLASH3 application framework on the IBM Blue Gene/L system
Authors: R. T. Fisher, L. P. Kadanoff, D. Q. Lamb, A. Dubey, T. Plewa, A. Calder, F. Cattaneo, P. Constantin, I. Foster, M. E. Papka, S. I. Abarzhi, S. M. Asida, P. M. Rich, C. C. Glendening, K. Antypas, D. J. Sheeler, L. B. Reid, B. Gallagher, S. G. Needham
Venue: IBM Journal of Research and Development (2008)

Understanding the nature of turbulent flows remains one of the outstanding questions in classical physics. Significant progress has been recently made using computer simulation as an aid to our understanding of the rich physics of turbulence. Here, we present both the computer science and the scientific features of a unique terascale simulation of a weakly compressible turbulent flow that includes tracer particles. (Terascale refers to performance and dataset storage use in excess of a teraflop and terabyte, respectively.) The simulation was performed on the Lawrence Livermore National Laboratory IBM Blue Gene/L™ system, using version 3 of the FLASH application framework. FLASH3 is a modular, publicly available code designed primarily for astrophysical simulations, which scales well to massively parallel environments. We discuss issues related to the analysis and visualization of such a massive simulation and present initial scientific results. We, also discuss challenges related to making the database available for public release. We suggest that widespread adoption ofan open dataset model of high-performance computing is likely to result in significant advantages for the scientific computing community, in much the same way that the widespread adoption of open-source software has produced similar gains over the last 10 years.
Hybrid statistical pronunciation models designed to be trained by a medium-size corpus
Authors: Bahram Vazirnezhad, Farshad Almasganj, Seyed Mohammad Ahadi
Venue: Computer Speech and Language (2009)

Generating pronunciation variants of words is an important subject in speech research and is used extensively in automatic speech recognition and segmentation systems. Decision trees are well known tools in modeling pronunciation over words or sub-word units. In the case of word units and very large vocabulary, in order to train necessary decision trees, a huge amount of speech utterances are required. This training data must contain all of the needed words in the vocabulary with a sufficient number of repetitions for each one. Additionally, an extra corpus is needed for every word which is not included in the original training corpus and may be added to the vocabulary in the future. To overcome these drawbacks, we have designed generalized decision trees, which can be trained using a medium-size corpus over groups of similar words to share information on pronunciation, instead of training a separate tree for every single word. Generalized decision trees predict places in the word where substitution, deletion and insertion of phonemes may occur. After this step, appropriate statistical contextual rules are applied to the permitted places, in order to specifically determine word variants. The hybrids of generalized decision trees and contextual rules are designed in static and dynamic versions. The hybrid static pronunciation models take into account word phonological structures, unigram probabilities, stress and phone context information simultaneously, while the hybrid dynamic models consider an extra feature, speaking rate, to generate pronunciation variants of words. Using the word variants, generated by static and dynamic models, in the lexicon of the SHENAVA Persian continuous speech recognizer, relative word error rate reductions as high as 8.1% and 11.6% are obtained, respectively.
Numerical Modeling and Optimization of Local Electric Field Distribution in Anisotropic Tissue for in vivo Electrochemotherapy and Electrogene Transfer
Authors: Selma Corovic, Ane upanic, Damijan Miklavcic
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Numerical modeling and genetic optimization algorithm which we are presenting in this study could be a useful tool in treatment planning of electrochemotherapy and electrogene transfer.
Exploiting log files in video retrieval
Authors: Frank Hopfgartner, Thierry Urruty, Robert Villa, Nicholas Gildea, Joemon M. Jose
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

While research into user-centered text retrieval is based on mature evaluation methodologies, user evaluation in multimedia retrieval is still in its infancy. User evaluations can be expensive and are also often non-repeatable. An alternative way of evaluating such systems is the use of simulations. In this poster, we present an evaluation methodology which is based on exploiting log files recorded from a user-study we conducted.
A Lightweight Security Analyzer inside GCC
Authors: Davide Pozza, Riccardo Sisto
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper describes the design and implementation of a lightweight static security analyzer that exploits the compilation process of the gcc compiler. The tool is aimed at giving to programmers useful and precise hints for improving the security of the developed software, while also detecting format string vulnerabilities, buffer overflows, and subtle vulnerabilities due to incorrect arithmetic and conversion on integers. The experimented technique is a combination of the taint analysis concept and of a value range propagation algorithm. The experimental results obtained by analyzing some real-world security critical programs show that the tool is only slightly heavier than pure compilation, and that it is able to detect known vulnerabilities, as well as unknown ones. Moreover, even if false positives are given, many of the warnings that do not correspond to vulnerabilities are indeed instances of unsafe programming practices, which can be avoided by applying a defensive programming style. Then, the tool can be profitably used during development, as a means that facilitates such coding practice.
IT policyScience policy isn't always about science
Authors: Cameron Wilson, Peter Harsha
Venue: Communications of the ACM (2008)

What is the appropriate role and level of influence for science and technical advice in policy deliberations?
Storyline-based summarization for news topic retrospection
Authors: Fu-ren Lin, Chia-Hao Liang
Venue: Decision Support Systems (2008)

Electronics newspapers gradually become main sources for news readers. When facing the numerous reports on a series of events in a topic, a summary of stories from news reports will benefit news readers in reviewing the news topic efficiently. Besides identifying events and presenting news titles and keywords the TDT (Topic Detection and Tracking) techniques are used to do, a summarized text to present event evolution is necessary for general news readers to review events under a news topic. This paper proposes a topic retrospection process and implements the SToRe (Story-line based Topic Retrospection) system that identifies various events under a news topic, and composes a summary that news readers can get the sketch of event evolution in the topic. It consists of three main functions: event identification, main storyline construction and storyline-based summarization. The constructed main storyline can remove the irrelevant events and present a main theme. The storyline-based summarization extracts the representative sentences and takes the main theme as the template to compose the summary. The storyline summary not only provides readers enough information to understand the development of a news topic, but also serves as an index for readers to search corresponding news reports. Following a design science paradigm, a lab experiment is conducted to evaluate the SToRe system in the question-and-answer (Q&A) setting. The experimental results show that SToRe enables news readers to effectively and efficiently capture the evolution of a news topic.
A lightweight streaming layer for multicore execution
Authors: David Zhang, Qiuyuan J. Li, Rodric Rabbah, Saman Amarasinghe
Venue: ACM SIGARCH Computer Architecture News (2008)

As multicore architectures gain widespread use, it becomes increasingly important to be able to harness their additional processing power to achieve higher performance. However, exploiting parallel cores to improve single-program performance is difficult from a programmer's perspective because most existing programming languages dictate a sequential method of execution. Stream programming, which organizes programs by independent filters communicating over explicit data channels, exposes useful types of parallelism that can be exploited. However, there is still the burden of mapping high-level stream programs to specific multicore architectures. The complexities of each architecture's underlying details makes it difficult to schedule the execution of a stream program with high performance. In this paper, we present the specifications for an intermediate layer between the stream program and the target architecture. This multicore streaming layer (MSL) provides a common level of abstraction that facilitates efficient execution of stream programs by making it easier for compilers to manage computation, and by providing automatic orchestration and optimization of communication when appropriate. We implemented a framework for one such instance of the MSL targeted to the Cell processor and the StreamIt language and achieved greater than 88% utilization on all benchmarks with relatively small amounts of code. The framework can also be applied to other architectures and stream programming languages to enhance generality and portability.
Optimisation of the number of IGBT devices in a series-parallel string
Authors: Noel Y. A. Shammas, Ruchira Withanage, Dinesh Chamund
Venue: Microelectronics Journal (2008)

High-power semiconductor switches can be realised by connecting existing devices in series and parallel. The number of devices in series depends on the operating voltage of an application and the individual device voltage rating. For a given application, the use of higher voltage rated IGBTs leads to a fewer number of devices and vice versa. The total power loss of the series string equals to the sum of individual IGBT power losses and total loss increases with the increase in operating frequency. The level of increase in power loss depends on the device characteristics. For high current operation, the minimum number of devices depends on the current rating of individual device. In this paper, series IGBT string of six 1.2kV, four 1.7kV, two 3.3kV and a single 6.5kV IGBTs are simulated for a 4.5kV/100A application and power losses are analysed for different frequencies and duty cycles. This power loss analysis is extended for commercial IGBTs to compare the simulation results. The number of devices for minimum power loss depends on operating frequencies and power savings are significant both at low and high frequencies. In addition to the power losses, the other important issues in optimising the number of IGBTs are described in this paper. When IGBT modules are connected in parallel the principle of derating is applied to obtained reliable operation. This is explained with some examples.
Jim Gray at IBM: the transaction processing revolution
Authors: Bruce G. Lindsay
Venue: ACM SIGMOD Record (2008)

While at the IBM San Jose Research Laboratory, in the 1970's, Dr. Jim Gray defined and developed the fundamental concepts and techniques that underlie on-line transaction processing systems. Jim Gray's pivotal contributions enabled cost efficient, on-line processing to replace paper and batch processing systems. Today, online transaction processing powers the record keeping systems that drive today's commerce, services, and government.
A state coverage tool for JUnit
Authors: Ken Koster
Venue: Companion of the 30th international conference on Software engineering (2008)

We present a JUnit test runner that informs users of missing behavior checks in their tests. The tool tracks variable updates and definitions over the course of a test execution and determines which variables influence which assertions via dynamic taint analysis. The program statements that set outputs which do not influence the outcome of any test assertions are reported as state coverage inadequacies. With traditional code coverage tools, users can ensure that tests execute all program statements; with this tool, they can additionally ensure that program output is checked, in one way or another, by a test.
Stochastic Analysis of the Packet-Pair Bandwidth Probing Event under Heterogeneous Cross-Traffic
Authors: M. J. Tunnicliffe
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

An analytical model of packet-pair bandwidth-probing under heterogeneous traffic is compared with a discrete-event simulation. The arrival of each packet-type is governed by an independent Poisson process, such that the aggregate distribution is approximately Gaussian. The waiting-time can be resolved into two components: A transient component representing the emptying process, and an equilibrium component representing the return to a steady-state distribution. The simulated waiting-time and dispersion characteristics agree closely the model’s predictions.
Numerical Simulation during Expansion for Hot Rolling Sheet Strip
Authors: Xianzhang Feng, Yuanpeng Liu, Haodong Luo, Huarui Tang, Cai Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In order to analyze the procedure of hot rolling sheet strip, the model of expansion of coiler was simulated during sheet strip coiling with FEM. The base of conditions of hot rolling sheet strip coiling regulations, and studying the rules of displacement change law of sheet stripos nodes along coiler innermost layer during coiler expansion with different layer, layer of minimum and safety was yield, when the loop of sheet strip coiled was 2 or 3 layers, its head had the rather larger displacement, and when the loop was 4 or 5, its displacement was nearly a constant value. The studying results were references vales to constitute the least layer before coiler expansion for technicians in field engineering and increase coiling speed. 1.
A theoretical framework for knowledge transfer in process redesign
Authors: Kelly J. Fadel, Susan A. Brown, Mohan Tanniru
Venue: ACM SIGMIS Database (2008)

Business process redesign has become commonplace in today's organizations. A frequently overlooked consequence of process redesign is the learning barriers it creates for individuals who have to change the way they perform their work tasks. One way to overcome these barriers is through a process of knowledge transfer, wherein individuals apply their knowledge of existing work tasks to learn new work tasks. While transfer may facilitate learning through reuse of existing knowledge, it may also impede learning. Drawing on theories of task knowledge and analogical learning, this paper presents a task script framework and associated research propositions for knowledge transfer in process redesign. The framework is illustrated in the context of a real-world example, and implications for research and practice are discussed.
SOA service reuse by design
Authors: Asit Dan, Robert D. Johnson, Tony Carrato
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

Reuse of services in supporting new business processes, in addition to alignment of IT with business functions, is a key motivation in using Service-oriented Architecture (SOA) for developing business solutions. The three key benefits of service reuse are improving agility of solutions by quickly assembling new business processes from existing services to meet changing marketplace needs, reduction of cost by not just avoiding duplication of code for enabling similar business functions across multiple business processes, but also throughout the SOA life-cycle spanning service deployment and management, and also reducing risks by reusing well-tested code and runtime environments. However, currently there are many organizational challenges and lack of accepted SOA solution development methodologies and supporting technical capabilities in customer environments in achieving service reuse. This paper details the key challenges in achieving service reuse, and advocates taking a pro-active position in addressing these challenges by putting in place governing key aspects of service life-cycle and supporting technical capabilities.
An Experiment Study on Text Transformation for Compression Using Stoplists and Frequent Words
Authors: Jirapond Tadrat, Veera Boonjing
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The paper presents a new text transform algorithm suitable for embedding in compression algorithms. The strategy the new algorithm employed to increase performance of text compression is to replace words with predefined codes. Instead of using a huge dictionary containing exhaustive words as in previous works, the new algorithm uses a list of stoplists and/or frequent words. The research devised different encoding schemes for such a list. It then made experiments of using these schemes with different compression algorithms on standard texts. The result shows that each scheme gives increasing compression when using with specific compression algorithms.
A constructive procedure for finding good starting solutions to the network design problem with uncertain parameters
Authors: Fernando Pérez, Ada M. Alvarez, Karim De Alba
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Given a network with a set of nodes and a set of potential edges, we must decide what edges will be included in the design to satisfy demands between pairs of nodes. Each edge has associated a finite capacity, a fixed cost and routing costs. Uncertainty will be considered in important input parameters such as demands and routing costs and will be modeled through scenarios. The objective is to find a network design that is "good" across all scenarios potentially realizable. At the present time, there exists no exact algorithm that can solve large instances, common in several applications, in a reasonable period of time. A GRASP is proposed that gives solutions of acceptable quality.
An Improved Flexible Access Control Scheme for JPEG2000 Codestreams
Authors: Yang Ou, Chae Duk Jung, Chul Sur, Kyung Hyune Rhee
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

JPEG2000 is the newest image coding standard which provides flexible scalability. Designing an encryption system for scalable JPEG200 codestream is becoming a new challenge. Recently, Wu et al.[13] proposed a flexible access control scheme for JPEG2000 codestream. However, it needs key regeneration whenever users change the preferred progression order. In this paper, we propose an improved flexible access control scheme for JPEG2000 codestreams based on Multi-Dimensional Hash Chains (MDHC), in which the keys need not to be regenerated whenever different progression order of packets is required. In particular, we employ multiple hash chains to generate a series of keys to encrypt each packet in the codestream. Furthermore, users can access the encrypted codestream according to any authorized combinations of resolution, quality layer and precinct with as few as possible keys. Also, our proposed scheme is secure against collusion attack as well as unauthorized access.
Monochromatic and bichromatic reverse skyline search over uncertain databases
Authors: Xiang Lian, Lei Chen
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Reverse skyline queries over uncertain databases have many important applications such as sensor data monitoring and business planning. Due to the existence of uncertainty in many real-world data, answering reverse skyline queries accurately and efficiently over uncertain data has become increasingly important. In this paper, we model the probabilistic reverse skyline query on uncertain data, in both monochromatic and bichromatic cases, and propose effective pruning methods to reduce the search space of query processing. Moreover, efficient query procedures have been presented seamlessly integrating the proposed pruning methods. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approach with various experimental settings.