ppxscal/embedding_network huggingface dataset:
Magnetic Nanostructures in Modern Technology: Spintronics, Magnetic MEMS and Recording, 1st edition
Authors: Bruno Azzerboni, Giovanni Asti, Luigi Pareti, Massimo Ghidini
Venue: Nato Science For Peace And Security Series B Physics And Biophysics (2007)

A team of outstanding scientists in the field of modern magnetic nanotechnologies illustrates the state of the art in several areas of advanced magneto-electronic devices, magnetic micro-electromechanical systems and high density information storage technologies. The physics and chemistry of nano-scale systems have made rapid advances and there are real prospects of translating exciting scientific findings into a new generation of processes and high technology products with a potential impact on several industrial sectors. In particular the development of nano-structured magnetic materials plays a leading role in the increasing miniaturization of devices with superior performances. The application areas considered are: i) "magneto-electronics", where the control of electron spins in magnetic hetero-structures offers new and improved functionalities in devices of integrated digital electronics. Magnetic random access memories, MRAM are among the principal applications for new non-volatile RAM with fast dynamics, toward the pico-, femto-second range. ii) "magnetic MEMS" (micro-electro-mechanical systems), which are the integration of mechanical and electro/ferromagnetic elements (micro-actuators and sensors) with conventional electronics MEMS, promise a revolution in several product categories. In fact the proposed integration enables the development of smart products, where sensors can gather information from the environment by measuring thermal, magnetic, electric, mechanical, biological chemical, optical characteristics and the electronic section processes the information and the actuator promotes the action realizing a complete control of the environment. iii) "Magnetic recording" is a leading technology in the information storage domain and the most relevant application in the field of magnetics, showing surprising continuous progress over several decades towards the limit of terabit per square inch of areal density.
Para-analyzer and Its Applications
Authors: Jair Minoro Abe, João I. da Silva Filho, Fábio Romeu de Carvalho, Israel Brunstein
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

In this expository work we show how the Para-analyzer can be useful to a variety of applications involving decision-making when facing mainly with uncertainty, inconsistent or paracomplete information. The Para-analyzer can be implemented electronically, originating the Para-control, very useful in applications in the area of Robotics and Automation.
OpenMP implementation of SPICE3 circuit simulator
Authors: Tien-Hsiung Weng, Ruey-Kuen Perng, Barbara Chapman
Venue: International Journal of Parallel Programming (2007)

In this paper, we describe our experience of creating an OpenMP implementation of the SPICE3 circuit simulator program. Given the irregular patterns of access to dynamic data structures in the SPICE code, a parallelization using current standard OpenMP directives is impossible without major rewriting of the original program. The aim of this work is to present a case study showing the development of a shared memory parallel code with minimum effort. We present two implementations, one with minimal code modification and one without modification to the original SPICE3 program using Intel's taskq construct. We also discuss the results of the case study in terms of what future compiler tools may be needed to help OpenMP application developers with similar porting goals. Our experiments using SPICE3, based on SRAM model simulation, were compiled by the SUN compiler running on a SunFire V880 UltraSPARC-III 750MHz and by the Intel icc compiler running on both an IBM Itanium with four CPUs and Intel Xeon of two processors machines. The results are promising.
Self Calibrating Visual Sensor Networks
Authors: Khurram Shafique, Asaad Hakeem, Omar Javed, Niels Haering
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

This paper presents an unsupervised data driven scheme to automatically estimate the relative topology of overlapping cameras in a large visual sensor network. The proposed method learns the camera topology by employing the statistics of co-occurring observations (of moving targets) in each sensor. Since target observation data is typically very noisy in realistic scenarios, an efficient two step method is used for robust estimation of the planar homography between camera views. In the first step, modes in the co-occurrence data are learned using meanshift. In the second step, a RANSAC based procedure is used to estimate the homography from weighted co-occurrence modes. Note that the first step not only lessens the effects of noise but also reduces the search spacefor efficient calculation. Unlike most existing algorithms for overlapping camera calibration, the proposed method uses an update mechanism to adapt online to the changes in network topology. The method does not assume prior knowledge about the scene, target, or network properties. It is also robust to noise, traffic intensity, and the amount of overlap between the fields of view. Experiments and quantitative evaluation using both synthetic and real data are presented to support the above claims.
AIF+: Dialogue in the Argument Interchange Format
Authors: Chris Reed, Simon Wells, Joseph Devereux, Glenn Rowe
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

This paper extends the Argument Interchange Format to enable it to represent dialogic argumentation. One of the challenges is to tie together the rules expressed in dialogue protocols with the inferential relations between premises and conclusions. The extensions are founded upon two important analogies which minimise the extra ontological machinery required. First, locutions in a dialogue are analogous to AIF I-nodes which capture propositional data. Second, steps between locutions are analogous to AIF S-nodes which capture inferential movement. This paper shows how these two analogies combine to allow both dialogue protocols and dialogue histories to be represented alongside monologic arguments in a single coherent system.
Co-Design of Web Information Systems Supported by SPICE
Authors: Gunar Fiedler, Hannu Jaakkola, Timo Mäkinen, Bernhard Thalheim, Timo Varkoi
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

Web information systems (WIS) augment classical information systems by modern Web technologies. They require at the same time a careful development and support for the interaction or story spaces beside the classical support for the working space of users. These dimensions complicate the system development process. This paper shows how classical advanced methodologies can be carefully enhanced. We evaluated the Co-Design approach to information systems development according to the ISO/IEC 15504 Framework for Process Assessment (SPICE) and derived the potential and deficiencies of this approach. This evaluation has been used for a managed Co-Design methodology. Since WIS constantly change and evolve the development process never ends. We develop as a solution an optimization procedure and a runtime environment for the Co-Design approach that allows to cope with such changes, with evolution and extension of WIS and that demonstrates the new system facilities whenever a change is mastered.
Tools For Structured and Object-Oriented Design, 7th edition
Authors: Marilyn Bohl, Maria Rynn
Venue:  (2007)

For courses in Problem Solving/Programming Logic and Programming Concepts and Logic. Using a concept-oriented, language-independent approach, Tools for Structured and Object-Oriented Design explores and illustrates introductory programming concepts and problem-solving tools. The text's three-part structure is supported by an exceptionally clear narrative and a host of step-by-step examples, sample problems, enrichment sections, and exercises. The password protected Instructor's Resource Center includes: *Test files for all chapters (Multiple Choice/True-False)*Instructor's Manual (Objectives, Teaching Strategies, Key Terms, Answers to end-of-chapter exercises)*Source Code*Power Point Lecture Slides For more information please go to www.prenhall.com/bohl-rynn
BIPA
Authors: Semin Lee, Tom L Blundell
Venue: Bioinformatics (2009)

Summary:BIPA is a database for protein–nucleic acid interactions in 3D structures. The database provides various physicochemical features of protein–nucleic acid interface such as size, shape, residue propensity, secondary structure composition and intermolecular interactions. The database also contains multiple structural alignments of nucleic acid-binding protein families with annotations of local environments in order to allow definition of features that influence acceptability of mutations at a particular position in a protein family. A web interface has been designed to present the results of these analyses and facilitate navigation of protein–nucleic acid interfaces. Availability: http://www-cryst.bioc.cam.ac.uk/bipa Contact: semin@cryst.bioc.cam.ac.uk Supplementary information:Supplementary data are available at Bioinformatics online.
CEBBIP: a parser of bibliographic information in chinese electronic books
Authors: Liangcai Gao, Zhi Tang, Xiaofan Lin
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Bibliographic information is essential for many digital library applications, such as citation analysis, academic searching and topic discovery. And bibliographic data extraction has attracted a great deal of attention in recent years. In this paper, we address the problem of automatic extraction of bibliographic data in Chinese electronic book and propose a tool called CEBBIP* for the task, which includes three main systems: data preprocessing, data parsing and data postprocessing. In the data preprocessing system, the tool adopts a rules-based method to locate citation data in a book and to segment citation data into citation strings of individual referencing literature. And a learning-based approach, Conditional Random Fields (CRF), is employed to parse citation strings in the data parsing system. Finally, the tool takes advantage of document intrinsic local format consistency to enhance citation data segmentation and parsing through clustering techniques. CEBBIP has been used in a commercial E-book production system. Experimental results show that CEBBIP's precision rate is very high. More specially, adopting the document intrinsic local format consistency obviously improves the citation data segmenting and parsing accuracy.
Flexible approximation of structured interactions in decentralized Markov decision processes
Authors: Stefan J. Witwicki, Edmund H. Durfee
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Our work is motivated by cooperative planning problems where agents can affect each others' transitions and rewards, and so benefit from coordinating their actions, but in doing so must account for durational uncertainty in these actions. To reason about this uncertainty efficiently, agents can employ temporal decoupling (a paradigm that has been explored in a variety of restricted contexts [2, 3]) to constrain interactions to occur by selected time points, representing the uncertain occurrence for each time point with a probabilistic promise [5]. Here we summarize a reformulation of Becker's Event-driven DEC-MDP problems [1] that uses commitment models to exploit temporal structure. We argue that, in addition to representing optimal solutions, our approach enables more efficient, scalable computation of approximate solutions and a natural flexibility by which interactions can be modeled with more or less detail.
RAD Tool for Object Code Generation: A Case Study
Authors: Marcin Graboń, Jarosław Małek, Marcin Surkont, Paweł Woroszczuk, Rafał Fitrzyk, Andrzej Huzar, Andrzej Kaliś
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

This paper presents the Class Editor tool. It is a software development environment that provide automated support for generating Delphi language code from class hierarchy defined either by developers directly or by reading the source data from XML files. We believe, that those classes affect the flexibility of generated code, program comprehension, support round-trip engineering, and program maintenance. In addition this tool can convert classes to highlighted HTML property name documentation, and generate XML Schema files, as well as ready to use templates of read/write procedures from/to databases, providing mechanisms for accessing and storing data. Moreover, it can generate consistent class types hierarchy from example XML data files. Given examples have shown that the tool is useful, and important to us. According to the best knowledge of the authors, such tool has been introduced in this paper for the first time.
Particle size and pore structure characterization of silver nanoparticles prepared by confined arc plasma
Authors: Mingru Zhou, Zhiqiang Wei, Hongxia Qiao, Lin Zhu, Hua Yang, Tiandong Xia
Venue: Journal of Nanomaterials (2009)

In the protecting inert gas, silver nanoparticles were successfully prepared by confined arc plasma method. The particle size, microstructure, and morphology of the particles by this process were characterized via X-ray powder diffraction (XRD), transmission electron microscopy (TEM) and the corresponding selected area electron diffraction (SAED). The N2 absorption-desorption isotherms of the samples were measured by using the static volumetric absorption analyzer, the pore structure of the sample was calculated by Barrett-Joyner-Halenda (BJH) academic model, and the specific surface area was calculated from Brunauer-Emmett-Teller (BET) adsorption equation. The experiment results indicate that the crystal structure of the samples is face-centered cubic (FCC) structure the same as the bulk materials, the particle size distribution ranging from 5 to 65 nm, with an average particle size about 26nm obtained by TEM and confirmed by XRD and BET results. The specific surface area is 23.81m2/g, pore volumes are 0.09 cm3/g, and average pore diameter is 18.7 nm.
A study on performance of dynamic file replication algorithms for real-time file access in Data Grids
Authors: Atakan Doğan
Venue: Future Generation Computer Systems (2009)

Real-time Grid applications are emerging in many disciplines of science and engineering. In order to run these applications while meeting the associated real-time constraints with them, the Grid infrastructure should be designed to respect these constraints and allocate its computing, networking, storage, and the other resources accordingly. Furthermore, these applications involve a large number of data intensive jobs and require to access terabytes of data in real-time. On the other hand, a variety of dynamic file replication algorithms were proposed for the best-effort Data Grid environments in an attempt to decrease job completion times and save network bandwidth. Until now, there is no study in the literature which tries to elaborate on the real-time performance of these dynamic file replication algorithms. Based on this motivation, in this study, the performance of eight dynamic replication algorithms are evaluated under various Data Grid settings. For this evaluation, a process oriented and discrete-event driven simulator called DGridSim is developed. A detailed set of simulation studies are conducted using DGridSim and the results obtained are presented to reveal the real-time performance of the dynamic file replication algorithms.
Optimizing PCR Assays for DNA Based Cancer Diagnostics
Authors: Ali Bashir, Qing Lu, Dennis Carson, Benjamin Raphael, Yu-Tsueng Liu, Vineet Bafna
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

Somatically acquired DNA rearrangements are characteristic of many cancers. The use of these mutations as diagnostic markers is challenging, because tumor cells are frequently admixed with normal cells, particularly in early stage tumor samples, and thus the samples contain a high background of normal DNA. Detection is further confounded by the fact that the rearrangement boundaries are not conserved across individuals, and might vary over hundreds of kilobases. Here, we present an algorithm for designing PCR primers and oligonucleotide probes to assay for these variant rearrangements. Specifically, the primers and probes tile the entire genomic region surrounding a rearrangement, so as to amplify the mutant DNA over a wide range of possible breakpoints and robustly assay for the amplified signal on an array. Our solution involves the design of a complex combinatorial optimization problem, and also includes a novel alternating multiplexing strategy that makes efficient detection possible. Simulations show that we can achieve near-optimal detection in many different cases, even when the regions are highly non-symmetric. Additionally, we prove that the suggested multiplexing strategy is optimal in breakpoint detection.We applied our technique to create a custom design to assay for genomic lesions in several cancer cell-lines associated with a disruption in the CDKN2A locus. The CDKN2A deletion has highly variable boundaries across many cancers. We successfully detect the breakpoint in all cell-lines, even when the region has undergone multiple rearrangements. These results point to the development of a successful protocol for early diagnosis and monitoring of cancer.
Fine Art Digital Nature Photography
Authors: Tony Sweet
Venue:  (2009)

Digital cameras and software have revolutionized the world of photography. With seemingly endless products available, photographers are challenged to find what will work best for their individual needs. Renowned photographer Tony Sweet guides readers through numerous lessons, from performing camera "swipes" and creating abstract images to applying filters and transforming infrared images--all illustrated with his stunning nature photographs. Readers will learn how to use a variety of plug-ins, filters, exposure elements, adjustment layers, film emulation software and more.
How Viable Is Digital Rights Management?
Authors: Seong Oun Hwang
Venue: Computer (2009)

Technologies that aim to protect digital content have fallen short of their mission. The computing community must find ways to make protection schemes interoperable and adopt a use model that lifts restrictions on paid-for protected content.
Fusion in Multibiometric Identification Systems: What about the Missing Data?
Authors: Karthik Nandakumar, Anil K. Jain, Arun Ross
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Many large-scale biometric systems operate in the identification mode and include multimodal information. While biometric fusion is a well-studied problem, most of the fusion schemes have been implicitly designed for the verification scenario and cannot account for missing data (missing modalities or incomplete score lists) that is commonly encountered in multibiometric identification systems. In this paper, we show that likelihood ratio-based score fusion, which was originally designed for verification systems, can be extended for fusion in the identification scenario under certain assumptions. We further propose a Bayesian approach for consolidating ranks and a hybrid scheme that utilizes both ranks and scores to perform fusion in identification systems. We also demonstrate that the proposed fusion rules can handle missing information without any ad-hoc modifications. We observe that the recognition performance of the simplest rank level fusion scheme, namely, the highest rank method, is comparable to the performance of complex fusion strategies, especially when the goal is not to obtain the best rank-1 accuracy but to just retrieve the top few matches.
Simple Random Access Compression
Authors: Kimmo Fredriksson, Fedor Nikitin
Venue: Fundamenta Informaticae (2009)

Given a sequence S of n symbols over some alphabet &Sigma; of size &sigma;, we develop new compression methods that are (i) very simple to implement; (ii) provide O(1) time random access to any symbol (or short substring) of the original sequence. Our simplest solution uses at most 2h+o(h) bits of space, where h = n(H$_{0}$(S)+1), and H$_{0}$(S) is the zeroth-order empirical entropy of S. We discuss a number of improvements and trade-offs over the basic method. For example, we can achieve n(H$_{k}$(S)+1)+o(n(H$_{k}$(S)+1)) bits of space, for k = o(log$_{&sigma;}$(n)). Several applications are discussed, including text compression, (compressed) full-text indexing and string matching.
Comparative performance evaluation of idle mode location management schemes for IEEE 802.16j multihop relay networks
Authors: Kuan-Po Lin, Hung-Yu Wei
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

IEEE 802.16 WiMAX is a promising technology to provide broadband wireless networking access. IEEE 802.16j Mobile Multihop Relay standard introduces multihop relaying to WiMAX system. Relay stations are used to extended network coverage and enhance system throughput. To reduce power consumption, an idle mode MS does not send location update messages while moving across cell borders. Paging mechanism is needed to wake up an idle mode MS. In the 802.16j multihop relay network, we investigate the performance of several location management schemes. In timer based scheme, an idle mode MS updates when the timer expires. In the paging area based scheme, an idle mode MS updates when moving to a new paging area. In the hybrid scheme, the paging area is recalculated when timer expires. An idle mode updates when it moves across the border of the MS-centric paging area. In this paper, comparative performance evaluation is conducted for these location management schemes with different IEEE 802.16j paging area topologies.
Use-Cases Engineering with UC Workbench
Authors: Jerzy Nawrocki, Łukasz Olek
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Use-case methodology is widely used for writing requirements. Unfortunately, there are almost no tools supporting the usage of the use cases in any software projects. UC Workbench is a tool that tries to fill in this gap. It contains a use-case editor (it spares up to 25% of the effort at introducing new use-cases and up to 40% at updating them), a generator of mockups (a mockup generated by UC Workbench animates the use-cases and illustrates them with screen designs) and Software Requirement Specification documents, and an effort calculator, based on Use-Case Points.