ppxscal/embedding_network huggingface dataset:
Electrical and reliability properties of isotropic conductive adhesives on immersion silver printed-circuit boards
Authors: J. Lee, C. S. Cho, J. E. Morris
Venue: Microsystem Technologies (2008)

Electrically conductive adhesive (ECAs) have been used for many years in both the anisotropic conductive adhesive (ACA) and isotropic conductive adhesive (ICA) forms for microelectronic packaging applications and as an alternative to lead (Pb) soldering technology. Especially, environmentally friendly ICAs offer many advantages over solder, such as simple and low temperature process conditions and better thermo-mechanical performance. However, a number of reliability questions linger, and continue to be studied. In particular, the ICA-to-pad contact resistance can increase with time due to the galvanic corrosion of dissimilar contact and ICA-filler metals (Lu et al., IEEE Trans Electron Packag Manuf 22:228&#x2013;232, 1999). ICAs are usually silver (Ag) epoxy composites, and the corrosion potential should be completely eliminated by the use of Ag contact pads. To completely eliminate lead (Pb) from electronics, the printed wiring board (PWB) must also change from hot-air-leveled solder (SnPb) to alternative metallic finishes, such as immersion-silver (Ag), immersion-tin (Sn), electroless nickel (Ni)/immersion-gold (Au) and organic solderability preservative (OSP) (Pas, in European institute of printed circuits summer conference, 2005). Especially, immersion-Ag is one of the leading Pb-free final finish choices for many OEMs in the telecommunications, computer, automotive and consumer electronics industries, because of its excellent properties and reasonable cost. This paper presents the electrical properties of Ag epoxy composite ICAs materials on Cu-finished and immersion-Ag finished PWBs, as solder replacements for SMT or flip chip technologies. All PWBs were subjected to 85&#x00b0;C/85% relative humidity (RH) aging testing, with junction resistance monitored for comparison of the immersion-Ag board to the Cu-finished board as a control. We expected that the corrosion potential, which is one of main causes to degrade conductivity between ICAs and PWB, should be eliminated by the use of Ag contact pads with the Ag epoxy composite ICAs materials. Not only is the junction resistance of immersion-Ag finished boards lower than that of Cu finished boards, but its junction resistance changes are smaller than those of Cu-finished boards, as expected.
Traceback-Based Optimizations for Maximum a Posteriori Decoding Algorithms
Authors: Curt Schurgers, Anantha Chandrakasan
Venue: Journal of Signal Processing Systems (2008)

Maximum A Posteriori (MAP) decoding is a crucial enabler of turbo coding and other powerful feedback-based algorithms. To allow pervasive use of these techniques in resources constrained systems, it is important to limit their implementation complexity, without sacrificing the superior performance they are known for. We show that introducing traceback information into the MAP algorithm, thereby leveraging components that are also part of Soft-Output Viterbi Algorithms (SOVA), offers two unique possibilities to simplify the computational requirements. Our proposed enhancements are effective at each individual decoding iteration and therefore provide gains on top of existing techniques such as early termination and memory optimizations. Based on these enhancements, we will present three new architectural variants for the decoder. Each one of these may be preferable depending on the decoder memory hardware requirements and number of trellis states. Computational complexity is reduced significantly, without incurring significant performance penalty.
Protein structure alignment considering phenotypic plasticity
Authors: Gergely Csaba, Fabian Birzele, Ralf Zimmer
Venue: Bioinformatics (2008)

Motivation: Protein structure comparison exhibits differences and similarities of proteins and protein families and may help to elucidate protein sequence and structure evolution. Despite many methods to score protein structure similarity with and without.exibility and to align proteins accurately based on their structures, a meaningful evolutionary distance measure and alignment method which models the cost of mutations, insertions and deletions occurring in protein sequences on the structure level is still missing. Results: Here, we introduce a new measure for protein structure similarity and propose a novel method called phenotypic plasticity method (PPM) which explicitly tries to model the evolutionary distance of two proteins on the structure level by measuring the cost of ‘morphing’ one structure into the other one. PPM aligns protein structures taking variations naturally observed in groups of structures (‘phenotypic plasticity’) into account while preserving the overall topological arrangement of the structures. The performance of PPM in detecting similarities between protein structures is evaluated against well-known structure classi.cation methods on two benchmark sets. The larger set consists of more than 3.6 million structure pairs from the SCOP database which are also consistently classi.ed in CATH. In the current parameterization, PPM already performs comparable or better than other methods such as TM-Align and Vorolign on those two sets according to various evaluation criteria showing that the method is able to reliably classify known protein structures, to detect their similarities and to compute accurate alignments despite phenotypic plasticity. Availability: Executables are available upon request. Datasets and supplementary data (datasets and superpositions) can be accessed on http://www.bio.ifi.lmu.de/PPM Contact: ralf.zimmer@bio.ifi.lmu.de
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
Authors: Chuan Xiao, Wei Wang, Xuemin Lin
Venue: Proceedings of the VLDB Endowment (2008)

There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data integration and cleaning, bioinformatics, and pattern recognition. We focus on efficient algorithms for similarity join with edit distance constraints. Existing approaches are mainly based on converting the edit distance constraint to a weaker constraint on the number of matching q-grams between pair of strings. In this paper, we propose the novel perspective of investigating mismatching q-grams. Technically, we derive two new edit distance lower bounds by analyzing the locations and contents of mismatching q-grams. A new algorithm, Ed-Join, is proposed that exploits the new mismatch-based filtering methods; it achieves substantial reduction of the candidate sizes and hence saves computation time. We demonstrate experimentally that the new algorithm outperforms alternative methods on large-scale real datasets under a wide range of parameter settings.
Distributed status monitoring and controlusing remote buffers and Ada 2005
Authors: Brad J. Moore
Venue: Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference (2008)

The ability to monitor status and control equipment distributed over a network is a common network management need. This paper describes a relatively simple approach to designing a prototype dynamic network where the assets of all vehicles on the network can be monitored and controlled at multiple remote stations. In particular, Ada 2005 features are explored in conjunction with Ada's Distributed Systems Annex (DSA) features to utilize a suite of remote buffer classes that implement an interface providing a mechanism for sharing a distributed dataset. In addition, the paper demonstrates an approach for distributed interoperability between Ada and C++ by using the DSA to distribute a C++ class hierarchy of objects that can be accessed by application code written in both languages. Finally, the paper exposes a need and describes a possible solution for enhancing existing DSA implementations in order to provide better support for multicast networking solutions.
Design and development of agent-based procurement system to enhance business intelligence
Authors: C. K. M. Lee, H. C. W. Lau, G. T. S. Ho, William Ho
Venue: Expert Systems with Applications: An International Journal (2009)

The purpose of this research is to propose a procurement system across other disciplines and retrieved information with relevant parties so as to have a better co-ordination between supply and demand sides. This paper demonstrates how to analyze the data with an agent-based procurement system (APS) to re-engineer and improve the existing procurement process. The intelligence agents take the responsibility of searching the potential suppliers, negotiation with the short-listed suppliers and evaluating the performance of suppliers based on the selection criteria with mathematical model. Manufacturing firms and trading companies spend more than half of their sales dollar in the purchase of raw material and components. Efficient data collection with high accuracy is one of the key success factors to generate quality procurement which is to purchasing right material at right quality from right suppliers. In general, the enterprises spend a significant amount of resources on data collection and storage, but too little on facilitating data analysis and sharing. To validate the feasibility of the approach, a case study on a manufacturing small and medium-sized enterprise (SME) has been conducted. APS supports the data and information analyzing technique to facilitate the decision making such that the agent can enhance the negotiation and suppler evaluation efficiency by saving time and cost.
Using Provenance to Support Real-Time Collaborative Design of Workflows
Authors: Tommy Ellkvist, David Koop, Erik W. Anderson, Juliana Freire, Cláudio Silva
Venue: Provenance and Annotation of Data and Processes: Second International Provenance and Annotation Workshop, IPAW 2008, Salt Lake City, UT, USA, June 17-18, 2008. Revised Selected Papers (2008)

Because designing workflows is a notoriously difficult task, it often requires multiple users to collaborate. In such scenarios, sharing workflow evolution provenance in a timely manner is critical. We present an environment where collaborating users can see each other's changes in real-time. The synchronization of workflow evolution provenance is automatic, immediate, and unobtrusive, allowing users to see collaborators' changes as they are made. This enables a richer and fuller method of collaboration. We present the interface and algorithm for the synchronization and discuss common scenarios where this mechanism has been utilized.
Enriching Multilingual Language Resources by Discovering Missing Cross-Language Links in Wikipedia
Authors: Jong-Hoon Oh, Daisuke Kawahara, Kiyotaka Uchimoto, Jun'ichi Kazama, Kentaro Torisawa
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

We present a novel method for discovering missing cross-language links between English and Japanese Wikipedia articles. We collect candidates of missing cross-language links -- a pair of English and Japanese Wikipedia articles, which could be connected by cross-language links. Then we select the correct cross-language links among the candidates by using a classifier trained with various types of features. Our method has three desirable characteristics for discovering missing links. First, our method can discover cross-language links with high accuracy (92\% precision with 78\% recall rates). Second, the features used in a classifier are language-independent. Third, without relying on any external knowledge, we generate the features based on resources automatically obtained from Wikipedia. In this work, we discover approximately $10^5$ missing cross-language links from Wikipedia, which are almost two-thirds as many as the existing cross-language links in Wikipedia.
ForSim
Authors: Brian W. Lambert, Joseph D. Terwilliger, Kenneth M. Weiss
Venue: Bioinformatics (2008)

Many important problems in biology involve complex traits affected by multiple coding or regulatory parts of the genome. How well the underlying genetic architecture can be inferred by statistical methods such as mapping and association studies are active research areas. ForSim is a flexible forward evolutionary simulation tool for exploring the consequences of evolution by phenotype, whereby demographic, chance, behavioral and selective effects mold genetic architecture. Simulation is useful for exploring these issues as well as the choice of study design inferential methods. Contact: bwl1@psu.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Electrical and mechanical characterization of an anisotropic conductive adhesive with a low melting point solder
Authors: Yong-Sung Eom, Keonsoo Jang, Jong-Tae Moon, Jae-Do Nam, Jong-Min Kim
Venue: Microelectronic Engineering (2008)

For the highly reliable interconnection in a micro-packaging technology requiring an excellent electrical and mechanical performance, the new anisotropic conductive adhesive (ACA) system with a low melting point solder was designed and characterized. An optimum flip-chip bonding cycle considering the chemo-rheological properties of a polymer matrix and solder was proposed. The bonding mechanism of the new ACA system was experimentally observed by the optical microscope. The electrical properties such as electrical resistance of about 5.6m@W and current density of 10,000A/cm^2 were measured by the 4-point probe test. The measured shear strength was 304MPa after bonding process. Electrical and mechanical performances were measured and compared before and after a pressure cooker test (PCT). In order to get a more stable ACA system during processing, the polymer matrix mixed with a reductant and a low melting point solder powder will be continuously developed in the near future.
Estimating 3D shape from degenerate sequences with missing data
Authors: Manuel Marques, João Costeira
Venue: Computer Vision and Image Understanding (2009)

Reconstructing a 3D scene from a moving camera is one of the most important issues in the field of computer vision. In this scenario, not all points are known in all images (e.g. due to occlusion), thus generating missing data. On the other hand, successful 3D reconstruction algorithms like Tomasi & Kanade's factorization method, require an orthographic model for the data, which is adequate in close-up views. The state-of-the-art handles the missing points in this context by enforcing rank constraints on the point track matrix. However, quite frequently, close-up views tend to capture planar surfaces producing degenerate data. Estimating missing data using the rank constraint requires that all known measurements are ''full rank'' in all images of the sequence. If one single frame is degenerate, the whole sequence will produce high errors on the reconstructed shape, even though the observation matrix verifies the rank 4 constraint. In this paper, we propose to solve the structure from motion problem with degenerate data, introducing a new factorization algorithm that imposes the full scaled-orthographic model in one single optimization procedure. By imposing all model constraints, a unique (correct) 3D shape is estimated regardless of the data degeneracies. Experiments show that remarkably good reconstructions are obtained with an approximate models such as orthography.
SIRENE
Authors: Fantine Mordelet, Jean-Philippe Vert
Venue: Bioinformatics (2008)

Motivation: Living cells are the product of gene expression programs that involve the regulated transcription of thousands of genes. The elucidation of transcriptional regulatory networks is thus needed to understand the cell's working mechanism, and can for example, be useful for the discovery of novel therapeutic targets. Although several methods have been proposed to infer gene regulatory networks from gene expression data, a recent comparison on a large-scale benchmark experiment revealed that most current methods only predict a limited number of known regulations at a reasonable precision level. Results: We propose SIRENE (Supervised Inference of Regulatory Networks), a new method for the inference of gene regulatory networks from a compendium of expression data. The method decomposes the problem of gene regulatory network inference into a large number of local binary classification problems, that focus on separating target genes from non-targets for each transcription factor. SIRENE is thus conceptually simple and computationally efficient. We test it on a benchmark experiment aimed at predicting regulations in Escherichia coli, and show that it retrieves of the order of 6 times more known regulations than other state-of-the-art inference methods. Availability: All data and programs are freely available at http://cbio.ensmp.fr/sirene. Contact: Fantine.Mordelet@ensmp.fr
A Cooperative Multi-agent Approach to Computer Forensics
Authors: Bruno W. P. Hoelz, Célia G. Ralha, Rajiv Geeverghese, Hugo C. Junior
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

This article proposes the use of a collaborative multi-agent approach to develop a toolkit to assist the experts during the forensic examination process: MADIK - a Multi-Agent Digital Investigation ToolKit. The use of a multi-agent approach has been proved adequate, specially regarding the cooperative action of the autonomous specialized agents: HashSetAgent, FilePathAgent, TimelineAgent, FileSignatureAgent. Also the distributed nature of the multi-agent approach allows for better usage of computational resources, since agents can operate autonomously in different machines and environments. As part of our work, we have defined a four layer multi-agent architecture, as a metaphor to the organizational hierarchy levels, which is divided in strategic, tactical, perational and specialist levels. The proposed architecture was the base to the development of the toolkit, which was developed with a blackboard approach, implemented over the Java Agent DEvelopment Framework - JADE, using Java Expert System Shell - JESS. We have done some experiments with MADIK using real data and the results are encouraging. This paper focuses on the benefits of using the multi-agent approach to aid in the forensic examination process, specially regarding the cooperative action of the autonomous specialized agents, which we deem as a flexible and promising possibility that should be further exploredin the computer forensics scenario.
Mapping an inland wetland complex using hyperspectral imagery
Authors: M. Y. Jollineau, P. J. Howarth
Venue: International Journal of Remote Sensing (2008)

The goal is to determine the extent to which heterogeneous inland wetland vegetation communities and their dominant species, as well as adjacent upland vegetation types, can be mapped using 4-m hyperspectral Compact Airborne Spectrographic Imager (CASI) data. Two classification algorithms, the maximum-likelihood classifier (MLC) and the spectral angle mapper (SAM), are applied to CASI data acquired over an inland wetland complex located in southern Ontario, Canada. Application of the MLC algorithm to all bands of the CASI data produced better classification results than use of the SAM. Using the MLC, 10 classes were identified with an overall accuracy of 92%. This approach permitted differentiation between areas of shrub-dominated vegetation communities, floating aquatic communities, emergent aquatics and shallow open water. In the SAM classification, 11 image-derived spectral endmembers were generated. Wetland classes identified were shrub-dominated wetlands, floating aquatic vegetation communities, shallow open water and moderately turbid shallow open water. Upland vegetation types were accurately mapped with both algorithms. Reasons why the SAM did not perform as well as the MLC in this complex environment are suggested. It is concluded that high-resolution hyperspectral data can provide information needed by wetland managers about inland wetland plant communities and their dominant species.
Axiomatics for Data Refinement in Call by Value Programming Languages
Authors: John Power, Miki Tanaka
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We give a systematic category theoretic axiomatics for modelling data refinement in call by value programming languages. Our leading examples of call by value languages are extensions of the computational @l-calculus, such as FPC and languages for modelling nondeterminism, and extensions of the first order fragment of the computational @l-calculus, such as a CPS language. We give a category theoretic account of the basic setting, then show how to model contexts, then arbitrary type and term constructors, then signatures, and finally data refinement. This extends and clarifies Kinoshita and Power's work on lax logical relations for call by value languages.
Incremental analysis of large VLSI Layouts
Authors: Akash Agrawal, Prosenjit Gupta
Venue: Integration, the VLSI Journal (2009)

The verification of VLSI layouts is an important and expensive step in physical design process and has significant contribution in overall design cycle time. Design rule checking, connectivity extraction and device extraction are important steps in layout analysis. Efficient incremental algorithms for these steps are crucial for fast development as well as small time-to-market of the design. If the size of layout is so large that it cannot fit entirely into available main memory, the main performance bottleneck is communication between internal memory and the external memory due to the slow access speed of external memory. In this paper, incremental solutions for problems of layout analysis are presented considering the external memory management. The main component of these algorithms is the proposed ''recursive tiling'' approach, which provides an easy to implement data structure for the aggregation of parts of layout for fast search and updates. Experimental results show that the recursive tiling approach proposed in this paper has reduced the time required for incremental processing on the workstations with limited amount of physical memory.
Evaluating multiple object tracking performance: the CLEAR MOT metrics
Authors: Keni Bernardin, Rainer Stiefelhagen
Venue: Journal on Image and Video Processing (2008)

Simultaneous tracking of multiple persons in real-world environments is an active research field and several approaches have been proposed, based on a variety of features and algorithms. Recently, there has been a growing interest in organizing systematic evaluations to compare the various techniques. Unfortunately, the lack of common metrics for measuring the performance of multiple object trackers still makes it hard to compare their results. In this work, we introduce two intuitive and general metrics to allow for objective comparison of tracker characteristics, focusing on their precision in estimating object locations, their accuracy in recognizing object configurations and their ability to consistently label objects over time. These metrics have been extensively used in two large-scale international evaluations, the 2006 and 2007 CLEAR evaluations, to measure and compare the performance of multiple object trackers for a wide variety of tracking tasks. Selected performance results are presented and the advantages and drawbacks of the presented metrics are discussed based on the experience gained during the evaluations.