ppxscal/embedding_network huggingface dataset:
Parallel MOPEX: Computing mosaics of large-area Spitzer surveys on a cluster computer
Authors: Joseph C. Jacob, Peter Eisenhardt, David Makovoz
Venue: Scientific Programming (2007)

The Spitzer Science Center's MOPEX software is a part of the Spitzer Space Telescope's operational pipeline that enables detection of cosmic ray collisions with the detector array, masking of the corrupted pixels due to these collisions, subsequent mosaicking of image fields, and extraction of point sources to create catalogs of celestial objects. This paper reports on our experiences in parallelizing the parts of MOPEX related to cosmic ray rejection and mosaicking on a 1,024-processor cluster computer at NASA's Jet Propulsion Laboratory. The architecture and performance of the new Parallel MOPEX software are described. This work was done in order to rapidly mosaic the IRAC shallow survey data, covering a region of the sky observed with one of Spitzer's infrared instruments for the study of galaxy clusters, large-scale structure, and brown dwarfs.
FT-COMAR
Authors: Marco Vassura, Luciano Margara, Pietro Di Lena, Filippo Medri, Piero Fariselli, Rita Casadio
Venue: Bioinformatics (2008)

Summary: Fault Tolerant Contact Map Reconstruction (FT-COMAR) is a heuristic algorithm for the reconstruction of the protein three-dimensional structure from (possibly) incomplete (i.e. containing unknown entries) and noisy contact maps. FT-COMAR runs within minutes, allowing its application to a large-scale number of predictions. Availability: http://bioinformatics.cs.unibo.it/FT-COMAR Contact: vassura@cs.unibo.it Supplementary information: Supplementary data are available on Bioinformatics online.
Motivation in Software Engineering: A systematic literature review
Authors: Sarah Beecham, Nathan Baddoo, Tracy Hall, Hugh Robinson, Helen Sharp
Venue: Information and Software Technology (2008)

Objective: In this paper, we present a systematic literature review of motivation in Software Engineering. The objective of this review is to plot the landscape of current reported knowledge in terms of what motivates developers, what de-motivates them and how existing models address motivation. Methods: We perform a systematic literature review of peer reviewed published studies that focus on motivation in Software Engineering. Systematic reviews are well established in medical research and are used to systematically analyse the literature addressing specific research questions. Results: We found 92 papers related to motivation in Software Engineering. Fifty-six percent of the studies reported that Software Engineers are distinguishable from other occupational groups. Our findings suggest that Software Engineers are likely to be motivated according to three related factors: their 'characteristics' (for example, their need for variety); internal 'controls' (for example, their personality) and external 'moderators' (for example, their career stage). The literature indicates that de-motivated engineers may leave the organisation or take more sick-leave, while motivated engineers will increase their productivity and remain longer in the organisation. Aspects of the job that motivate Software Engineers include problem solving, working to benefit others and technical challenge. Our key finding is that the published models of motivation in Software Engineering are disparate and do not reflect the complex needs of Software Engineers in their career stages, cultural and environmental settings. Conclusions: The literature on motivation in Software Engineering presents a conflicting and partial picture of the area. It is clear that motivation is context dependent and varies from one engineer to another. The most commonly cited motivator is the job itself, yet we found very little work on what it is about that job that Software Engineers find motivating. Furthermore, surveys are often aimed at how Software Engineers feel about 'the organisation', rather than 'the profession'. Although models of motivation in Software Engineering are reported in the literature, they do not account for the changing roles and environment in which Software Engineers operate. Overall, our findings indicate that there is no clear understanding of the Software Engineers' job, what motivates Software Engineers, how they are motivated, or the outcome and benefits of motivating Software Engineers.
The application of tabu search algorithm on power system restoration
Authors: Fang Xin-yan, Cai Xiao-yi, Jiang Chuan-wen
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The essay is just according to the part of the Shanghai Electric System, which is in accident. The Breadth First Search (BFS) and The Depth First Search (DFS) will be used to solve the problem of the early search of the net, then The Tabu Search will be used to search for the fastest restore path. After these searches, C++ will be used to compile the BFS and the DFS; also it will be used to establish the tabu list. The result shows that the optimal restore path will be selected in power system restoration.
Semi automated metadata extraction for preprints archives
Authors: Emma Tonkin, Henk L. Muller
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

In this paper we present a system called paperBase that aids users in entering metadata for preprints. PaperBase extracts metadata from the preprint. Using a Dublin-Core based REST API, third-party repository software populates a web form that the user can then proofread and complete. PaperBase also predicts likely key words for the preprints, based on a controlled vocabulary of keywords that the archive uses and a Bayesian classifier. We have tested the system on 12 individuals, and measured the time that it took them to enter data, and the accuracy of the entered metadata. We find that our system appears to be faster than manual entry, but a larger sample needs to be tested before it can be deemed statistically significant. All but two participants perceived it to be faster. Some metadata, in particular the title of preprints, contains significantly fewer mistakes when entered automatically; even though the automatic system is not perfect, people tend to correct mistakes that paperBase makes, but would leave their own mistakes in place.
Oracle10gR2 Recovery Manager: The Concise Treatise, 0 edition
Authors: Ramesh Raghav
Venue:  (2007)

This is the complete guide to the vastly enhanced RMAN tool in this latest release of Oracle database software. The concise treatment of all the key capabilities in a comprehensive manner is a unique approach fully echoing the principle of all grain no chaff. This one of a kind book also has several workshops demonstrating the practical application of key concepts. More specifically for the advanced topics the DBA will find this manual an invaluable resource.
MedEvi
Authors: Jung-jae Kim, Piotr Pȩzik, Dietrich Rebholz-Schuhmann
Venue: Bioinformatics (2008)

Summary: Search engines running on MEDLINE abstracts have been widely used by biologists to find publications that are related to their research. The existing search engines such as PubMed, however, have limitations when applied for the task of seeking textual evidence of relations between given concepts. The limitations are mainly due to the problem that the search engines do not effectively deal with multi-term queries which may imply semantic relations between the terms. To address this problem, we present MedEvi, a novel search engine that imposes positional restriction on occurrences matching multi-term queries, based on the observation that terms with semantic relations which are explicitly stated in text are not found too far from each other. MedEvi further identifies additional keywords of biological and statistical significance from local context of matching occurrences in order to help users reformulate their queries for better results. Availability: http://www.ebi.ac.uk/tc-test/textmining/medevi/ Contact: kim@ebi.ac.uk
Segmentation of CT Head Images
Authors: Tong Hau Lee, Mohammad Faizal Ahmad Fauzi, Ryoichi Komiya
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper presents the segmentation of the CT head images with different techniques. The system partitions the CT head images into four regions which are skull, calcifications, cerebrospinal fluid (CSF) and brain matter. The method consists of two phases. The first phase is to partition the skull, CSF and brain matter in which we applied the Expectation-maximization (EM) algorithm for the segmentation. The second phase is to identify the calcifications where we used thresholding. The system has been tested with a number of real CT head images and has achieved promising results
The transition and adoption to modern programming concepts for scientific computing in Fortran
Authors: Charles D. Norton, Viktor K. Decyk, Boleslaw K. Szymanski, Henry Gardner
Venue: Scientific Programming (2007)

This paper describes our experiences in the early exploration of modern concepts introduced in Fortran90 for large-scale scientific programming. We review our early work in expressing object-oriented concepts based on the new Fortran90 constructs - foreign to most programmers at the time - our experimental work in applying them to various applications, the impact on the WG5/J3 standards committees to consider formalizing object-oriented constructs for later versions of Fortran, and work in exploring how other modern programming techniques such as Design Patterns can and have impacted our software development. Applications will be drawn from plasma particle simulation and finite element adaptive mesh refinement for solid earth crustal deformation modeling.
An analysis of reinforcement learning with function approximation
Authors: Francisco S. Melo, Sean P. Meyn, M. Isabel Ribeiro
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We address the problem of computing the optimal Q-function in Markov decision problems with infinite state-space. We analyze the convergence properties of several variations of Q-learning when combined with function approximation, extending the analysis of TD-learning in (Tsitsiklis & Van Roy, 1996a) to stochastic control settings. We identify conditions under which such approximate methods converge with probability 1. We conclude with a brief discussion on the general applicability of our results and compare them with several related works.
Products and help bits in decision trees
Authors: N. Nisan
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We investigate two problems concerning the complexity of evaluating a function f at k-tuple of unrelated inputs by k parallel decision tree algorithms. In the product problem, for some fixed depth bound d, we seek to maximize the fraction of input k-tuples for which all k decision trees are correct. Assume that for a single input to f, the best decision tree algorithm of depth d is correct on a fraction p of inputs. We prove that the maximum fraction of k-tuples on which k depth d algorithms are all correct is at most p/sup k/, which is the trivial lower bound. We show that if we replace the depth d restriction by "expected depth d", then this result fails. In the help-bit problem, we are permitted to ask k-1 arbitrary binary questions about the k-tuple of inputs. For each possible k-1-tuple of answers to these queries we will have a k-tuple of decision trees which are supposed to correctly compute all functions on k-tuples that are consistent with the particular answers. The complexity here is the maximum depth of any of the trees in the algorithm. We show that for all k sufficiently large, this complexity is equal to deg/sup s/(f) which is the minimum degree of a multivariate polynomial whose sign is equal to f. Finally, we give a brief discussion of these problems in the context of other complexity models.
Monte Carlo Simulation Based Error Performance Analysis of DS-CDMA System
Authors: Anjana Jain, Shailendra Singh Pawar, Raksha Upadhyay, S. V. Charhate
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

With the growing interest in integration of voice, data and video traffic in wireless communication networks, CDMA emerged as an attractive access technique. The performance of wireless system is deteriorated in presence of multipath fading environment. Hence, the error performance analysis is a fundamental requirement to deploy CDMA system. The Bit Error Rate (BER) is one of the error performance parameter in communication systems. This paper presents estimation of BER as function of Eb/No (bit energy to noise power spectral density ratio) using Monte Carlo simulation technique. The simulation includes the effects of Additive White Gaussian Noise, multipath and Multiple Access Interference (MAI). Direct Sequence Spread spectrum with BPSK modulation is used for the simulation. The Ricean fading channel with various factor K is considered. Results are presented in form of graphs which show the effect of different Ricean factor K on BER. These elegant results can be used for evaluating the system capacity, designing power control algorithms and appropriate channel coding techniques for CDMA.
Maple code of gamma algorithm for global optimization of uncertain functions over compact robust sets
Authors: M. Delgado Pineda, E. A. Galperin
Venue: Computers Mathematics with Applications (2008)

Problems with uncertainties are ubiquitous in many areas of science and technology. Due to imprecision of measurements (Heisenberg's relation), such problems are normal in nuclear physics. Due to fluidity of media, ships at sea and planes in the air have to deal with instability of the currents they move in. Yields in agriculture depend on the whims of weather. Due to the lack of information in economy and finance, problems with uncertainties (stock prices, marketing problems, inflation, unemployment) are commonplace. In such situations, it is necessary to make a choice of better parameters that produce finite intervals of possible values of a given uncertain function at each point of the parameter space. The gamma algorithm [E.A. Galperin, Global optimization in problems with uncertainties, Journal of Nonlinear Analysis 47 (2001) 941-952; E.A. Galperin, Global optimization in problems with uncertainties. The gamma algorithm. Computer and Mathematics with Applications 44 (2002) 853-862] presents a method to make that choice. A new variant of the gamma algorithm based on the beta algorithm is presented for global optimization of uncertain functions over compact robust sets in R^n. The set-monotonic algorithm contains a block for problems with equality constraints, and operates within the unit cube [0,1]^n for all problems. On this basis, a MAPLE code of modular structure is developed for full global optimization of functions of n variables. The code does not create ill-conditioned situations. Graphics are included, and the solution set can be visualized in plane projections and sections. The code is ready for engineering applications. The results of numerical experiments are presented, with graphs, to illustrate the use of the code.
Brimon: a sensor network system for railway bridge monitoring
Authors: Kameswari Chebrolu, Bhaskaran Raman, Nilesh Mishra, Phani Kumar Valiveti, Raj Kumar
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Railway systems are critical in many regions, and can consist of several tens of thousands of bridges, being used over several decades. It is critical to have a system to monitor the health of these bridges and report when and where maintenance operations are needed. This paper presents BriMon, a wireless sensor network based system for such monitoring. The design of BriMon is driven by two important factors: application requirements, and detailed measurement studies of several pieces of the architecture. In comparison with prior bridge monitoring systems and sensor network prototypes, our contributions are three-fold. First, we have designed a novel event detection mechanism that triggers data collection in response to an oncoming train. Next, BriMon employs a simple yet effective multi-channel data transfer mechanism to transfer the collected data onto a sink located on the moving train. Third, the BriMon architecture is designed with careful consideration of the interaction between the multiple requisite functionalities such as time synchronization, event detection, routing, and data transfer. Based on a prototype implementation, this paper also presents several measurement studies to show that our design choices are indeed quite effective.
A Comparative Review of Aspect Ratio Conversion Methods
Authors: Zhongliang Deng, Yandong Guo, Xiaodong Gu, Zhibo Chen, Quqing Chen, Charles Wang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The Aspect ratio is the fractional relation of the width of a video image compared to its height. Because of the historical and some other factors, there are so many video formats with different aspect ratios and the conversion of aspect ratio is required more and more imminently. The paper introduced all the aspect ratio conversion methods published in literatures, including cropping method, expanding method and so on, and presented experiment results to demonstrate the advantages and disadvantages of each conversion method.
Multi-User FPGA An Efficient Way of Managing Expensive FPGA Resources Using TCP/IP, Wi-Max/ Wi-Fi in a Secure Network Environment
Authors: Piyush Kumar Shukla, S. Silakari, Sarita S. Bhadoria, Anuj Garg
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Optimizing the single FPGA board resource as a simulator in a multi user environment regardless of the physical distance improved by TCP/IP. It is important step for IP and system development to use FPGA and IP core to design and improve flow of multi user data in a high speed communication internet environment and optimal utilization of available bandwidth. A user can connect either by Wi-Fi, Wi-Max , USB, PCI or over a network connection may be to another workstation. There is no need for end users to program this functionality at their own ends. In this paper, we have shown that with Xilinx’s system generator for, it is possible for multi users to hardware co-simulate IPCores over any distance via TCP/IP and at any altitude of angle using NLOS Wi-Max, sharing only one FPGA resource. The strategy is based on the time sharing modular approach (TDM), mutually exclusive phenomena. To enhance security of FPGA and IP core co-simulated users we use strong encryption standards. In this paper we have used three encryption standards AES and Camellia and DES. Matlab 7.0 is used ensuring sharing of FPGA board in a multi user, insecure environment to make possible efficient use of FPGA board resource.
GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
Authors: Daniel Archambault, Tamara Munzner, David Auber
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, it allows users to investigate hierarchy space instead of a single, fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.
Who should own access rights? a game-theoretical approach to striking the optimal balance in the debate over digital rights management
Authors: Yu-Lin Chang
Venue: Artificial Intelligence and Law (2007)

The development of access rights as, perhaps, a replacement for copyright in digital rights management (DRM) systems, draws our attention to the importance of 'the balance problem' between information industries and the individual user. The nature of just what this 'balance' is, is often mentioned in copyright writings and judgments, but is rarely discussed. In this paper I focus upon elucidating the idea of balance in intellectual property and propose that the balance concept is not only the most feasible way to examine whether past solutions to copyright problems are fair, but it also provides the ability to predict what will be the better solution for all affected parties. Based upon an envy-free contribution towards predicting the efficient balance, game theory is applied in a novel manner to the DRM problem to infer where and what might be the optimal balance in the debate over the nature of access right.
Computer science in kindergarten? Of course!: the ABC'S of the K-12 CSTA model curriculum in computer science
Authors: Tim DeClue
Venue: Journal of Computing Sciences in Colleges (2008)

In the United States, computer science as a topic in pre-college education has historically been less than successful. Some states certify computer science teachers, but others do not. Some states have rigorous standards, but others do not. Some school districts choose to spend money on computer science education while others do not. Some see computer science as a derivative of mathematics; others view computer science as an extension of business education. Neither Missouri or Kansas, for example, certify computer science as a content area in teacher education. Recently the Computer Science Teacher's Association (CSTA), a national organization for computer science teachers, produced a blueprint for a K-12 computer science curriculum which addresses many of the issues which have caused problems in the past. The curriculum is brief, but it is clear and paints a refreshing picture for the future of pre-college computer science.
Sternum Image Retrieval Based on High-level Semantic Information and Low-level Features
Authors: Qin Chen, Xiaoying Tai
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In allusion to sternum images, herein we describe a system which supports image retrieval by content. Attention is focused on high-level semantic information representation of medical images. Then a feature fusion algorithm of medical image retrieval using high-level semantic information combining low-level features is presented. A prototype system which supports query by example is designed and implemented on vista operating system, using VC++ and Access. The performance of the method is illustrated using examples from an image database composed of 134 medical images, and the comparison of the retrieval results shows that the approach proposed in this paper is effective.