ppxscal/embedding_network huggingface dataset:
Physics of failure for interconnect structures: an essay
Authors: Rainer Tilgner
Venue: Microsystem Technologies (2008)

This composition of moderate length deals with physics of failure for interconnect structures in an easy cursory way representing the author&#x2019;s personal experience and outlook on analysing materials and overall systems chip and package as well as their destruction under stress.
A Concept-Driven Automatic Ontology Generation Approach for Conceptualization of Document Corpora
Authors: Hai-Tao Zheng, Charles Borchert, Hong-Gee Kim
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

In the age of increasing information availability, many techniques, such as document clustering and information visualization, have been developed to ease understanding of information for users. However, most of these methods do not help users directly understand key concepts and their semantic relationships in document corpora, which are critical for capturing their conceptual structures. Therefore, we propose a novel approach called 'Clonto' to identify the key concepts and automatically generate ontologies based on these concepts for conceptualization of document corpora. Clonto applies latent semantic analysis to identify key concepts, allocates documents based on these concepts, and utilizes WordNet to automatically generate a corpus-related ontology. The documents are linked to the ontology through the key concepts. The experimental results show that Clonto can identify key concepts with a high precision and the clustering results of Clonto outperform the STC (Suffix Tree Clustering) algorithm, the Lingo clustering algorithm, the Fuzzy Ants clustering algorithm, and clustering based on TRS (Tolerance Rough Set). Moreover, based on the same document corpus, the ontology generated by Clonto shows a significant informative conceptual structure.
An object-oriented framework with corresponding graphical user interface for developing ant colony optimization based algorithms
Authors: Raka Jovanovic, Milan Tuba, Dana Simian
Venue: WSEAS Transactions on Computers (2008)

This paper describes GRAF-ANT (Graphical Framework for Ant Colony Optimization), an object-oriented C# framework for developing ant colony systems that we have developed. While developing this framework, abstractions that are necessary for ant colony optimization algorithms were analyzed, as well as the features that their implementing classes should have. During creation of these classes, several problems were solved: implementation of individual ants and ant colonies, connection between visualization and problem spaces, creation of a multithread application in which multiple ant colonies can communicate, creation of a problem independent graphical user interface (GUI), establishing an opportunity for hybridization of ACO (Ant colony optimization). Effects of this hybridization to different variations of ant colony systems is analyzed. The use of the GRAF-ANT and its suitability is illustrated by few instances of the Traveling Salesman Problem (TSP). We also present a concept of escaping ACO stagnation in local optima, named suspicious path destruction, that is also a part of GRAF-ANT.
Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach
Authors: Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2008)

In a distributed stream processing system, streaming data are continuously disseminated from the sources to the distributed processing servers. To enhance the dissemination efficiency, these servers are typically organized into one or more dissemination trees. In this paper, we focus on the problem of constructing dissemination trees to minimize the average loss of fidelity of the system. We observe that existing heuristic-based approaches can only explore a limited solution space and hence may lead to sub-optimal solutions. On the contrary, we propose an adaptive and cost-based approach. Our cost model takes into account both the processing cost and the communication cost. Furthermore, as a distributed stream processing system is vulnerable to inaccurate statistics, runtime fluctuations of data characteristics, server workloads, and network conditions, we have designed our scheme to be adaptive to these situations: an operational dissemination tree may be incrementally transformed to a more cost-effective one. Our adaptive strategy employs distributed decisions made by the distributed servers independently based on localized statistics collected by each server at runtime. For a relatively static environment, we also propose two static tree construction algorithms relying on apriori system statistics. These static trees can also be used as initial trees in a dynamic environment. We apply our schemes to both single- and multi-object dissemination. Our extensive performance study shows that the adaptive mechanisms are effective in a dynamic context and the proposed static tree construction algorithms perform close to optimal in a static environment.
Generalized mathematical model of the dynamics of consolidation processes with relaxation
Authors: V. M. Bulavatsky, V. V. Skopetskii
Venue: Cybernetics and Systems Analysis (2008)

Filtration consolidation of salt-saturated porous media is modeled taking into account time-space nonlocality effects. Asymptotic approximations of problem solutions for excess head are found, an algorithm of numerical modeling of the process dynamics within the framework of the model is proposed, and the results of numerical experiments are presented.
On the problem of guidance of an autonomous conflict-controlled system onto a cylinder set
Authors: Yu. V. Averboukh
Venue: Cybernetics and Systems Analysis (2008)

The problem of guidance of a conflict-controlled system onto a cylinder set is considered. This problem is compared with the problem of guidance of a transformed system onto the base of the cylinder at the last moment. It is shown that the problems considered are equivalent. Moreover, the sequences constructed by the programmed iteration method coincide for both problems.
A secure compiler for session abstractions
Authors: Ricardo Corin, Pierre-Malo Deniélou, Cédric Fournet, Karthikeyan Bhargavan, James Leifer
Venue: Journal of Computer Security (2008)

Distributed applications can be structured as parties that exchange messages according to some pre-arranged communication patterns. These sessions (or contracts, or protocols) simplify distributed programming: when coding a role for a given session, each party just has to follow the intended message flow, under the assumption that the other parties are also compliant. In an adversarial setting, remote parties may not be trusted to play their role. Hence, defensive implementations also have to monitor one another, in order to detect any deviation from the assigned roles of a session. This task involves low-level coding below session abstractions, thus giving up most of their benefits. We explore language-based support for sessions. We extend the ML language with session types that express flows of messages between roles, such that well-typed programs always play their roles. We compile session type declarations to cryptographic communication protocols that can shield programs from any low-level attempt by coalitions of remote peers to deviate from their roles. Our main result is that, when reasoning about programs that use our session implementation, one can safely assume that all session peers comply with their roles - without trusting their remote implementations.
Discovering the Dynamics in a Social Memory Network
Authors: Lin Gao, Jiming Liu, Shiwu Zhang, Jie Yang
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

A social network consists of events and individuals, in which the events denote the activities happening in the system and the individuals denotes the peoples who are attracted into the activities. A memory feature exists in a dynamic social network which leads to the decay of the event attraction, and further influences the structure and the dynamics of the network. In the paper, an agent model for a social memory network is built and implemented. The simulation result reveals the dynamics of the average life span of events. The result also discovers how a social network with a small "diameter" and a large clustering coefficient evolves. The model is validated with the empirical data from USTC Bulletin Board System (BBS).
On control laws for discrete linear repetitive processes with dynamic boundary conditions
Authors: Lukasz Hladowski, Eric Rogers, Krzysztof Galkowski, Virendra R. Sule
Venue: Multidimensional Systems and Signal Processing (2008)

Repetitive processes are characterized by a series of sweeps, termed passes, through a set of dynamics defined over a finite duration known as the pass length. On each pass an output, termed the pass profile, is produced which acts as a forcing function on, and hence contributes to, the dynamics of the next pass profile. This can lead to oscillations in the sequence of pass profiles produced which increase in amplitude in the pass-to-pass direction and cannot be controlled by application of standard control laws. Here we give new results on the design of physically based control laws for so-called discrete linear repetitive processes which arise in applications areas such as iterative learning control.
Computer Jobs with the Growing Information Technology Professional Services Sector [2007] Companies-Contacts-Links - IT Services Firms - West Coast States
Authors: Info Tech Employment
Venue:  (2007)

The solid and growing information technology professional services sector continues to increase headcount. Discover computer jobs in this robust sector of the industry with Computer Jobs with the Growing Information Technology Professional Services Sector [2007]: Career Guide - Companies-Contacts-Links -8 Regional Editions. So that jobseekers can find employers close to home, there are eight editions available , which cover eight US regions: New England States, Mid-Atlantic States, Potomac Region, Southern States, Midwest States, Western States, West Coast States, and Northwestern States. In the "Companies-Contacts-Links" section, technology jobseekers gain access to current URLs and recruiter/personnel e-mail addresses of IT service providers in their region. These providers have active government and corporate contracts to supply information technology services and staff. In the "Articles" section, 21 Advisory and Analytical articles discuss leading IT jobs, skill sets, positioning tools, job classifications and pay scales. Analytical Articles: C++ Computer . Java and JavaScript . Visual Basic . Sun Solaris, Unix, Linux, Network Tech Jobs . Oracle, SQL, FoxPro, Sybase, Database Management . Software Programmer; Software Engineer . Network Programmer, Network Systems . Telecommunications . Web Developer . IT Procurement, IT Training, Project Management . IT Security . Computer Graphics, Computer Animation. Advisory Articles: Careers in IT . Hiring Options: IT Outsourcers, IT Service Providers, In-House IT Staff. Telecommuting IT Careers, Entry-Level Tech Jobs . Resumes . Skills Employers Require of IT Professionals; Training Opportunities, Building a Successful Computer Career. These editions give sure-fire direction to good employment in all 50 U.S. States.
Entertaining iTV applications for local communities
Authors: Gunther Kreuzberger, Imke Hoppe, Peter Dunker
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

Through evolving technical conditions, television offers rising possibilities to interact with programs. Hence, it might become some kind of individualized mass medium. At the same time the media choice changes. Interactive media like digital games or Web 2.0 applications rise significantly. This paper therefore deals with the systematic design of interactive TV applications and sug-gests a design-process model. Local communities are focused as an ideal target group for such applications, as they soonest meet the technical and social conditions for interactive TV applications.
Provenance Tracking in an Earth Science Data Processing System
Authors: Curt Tilmes, Albert J. Fleig
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)

NASA and other organizations involved with climate research have captured huge archives of earth observations. The sensors, spacecraft, and science algorithms for transforming and analyzing the data and the processing frameworks are evolving over time. Science Data Processing Systems (SDPSes) should capture, archive, and distribute provenance information of all externally received data and algorithms, as well as describing all internal processes used for data transformation. This will make the data sets produced by the systems easier to understand, enable independent scientific reproducability, and ultimately, increase the credibility of the scientific research that makes use of those data sets.
Modeling of interfacial intermetallic compounds in the application of very fine lead-free solder interconnections
Authors: Zhiheng Huang, Paul P. Conway, Rongshan Qin
Venue: Microsystem Technologies (2008)

Intermetallic compounds (IMCs) are formed between lead-free solders and base metals during soldering processes. The morphology as well as the amount of the IMCs, in particular the interfacial IMCs, are important to mechanical performance of the solder joints in their service environment. This is especially the case in state-of-art ultrafine-pitch wafer-level packaging, in which solder joints could become as small as 50&#x00a0;&#x03bc;m in diameter or even less. However, research addressing growth kinetics of the IMCs in the existing literature has concentrated on fitting experimental data onto a simple parabolic growth equation, which cannot account for all the complicated physics involved in the process of IMC formation. There are a few models based on Fick&#x2019;s diffusion equations in the literature, which assume the growing IMC interface is planar. A combined thermodynamic&#x2013;kinetic model has been derived from the relationships amongst some thermodynamic parameters; however, this model is only one dimension (1-D) in nature. 2-D models have also been proposed, e.g. an implicit boundary tracking method, and a phase field model. This paper reviews the modeling techniques in the literature for both the growth kinetics and morphology of the interfacial IMCs, under the context of lead-free soldering in very fine interconnections. The advantages and disadvantages of each method are discussed. Possible solutions to include the geometrical features of micro solder joints in the modeling of growth kinetics of interfacial IMC are presented.
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Venue: Internet Measurement Conference (2008)

It is our great pleasure to welcome you to the Internet Measurement Conference 2008 (IMC'08), sponsored by ACM SIGCOMM and in cooperation with USENIX and ACM SIGMETRICS. For the past 8 years, the Internet Measurement Conference has been the premier forum for presentation of research results that contribute to the current understanding of how to collect or analyze Internet measurements, or provide insight into how the Internet behaves. This year we received a record number of 185 submissions from Asia, Australia, Canada, Europe, and the United States. Each paper under consideration was reviewed by at least two reviewers from the Program Committee, over 80% received three reviews, and a small number had four or more reviews. The set of papers under consideration was winnowed down over multiple rounds of reviews and a discussion phase via the on-line review system before the PC meeting. At the end of the discussion phase, about 70 papers were recommended for further discussion and consideration at the PC meeting, which was hosted at Intel Research Pittsburgh. After heated discussion and careful deliberations that lasted a full day, 32 papers---with a balanced mixture of full-length (14 pages) and short (6 pages) papers---were identified by the program committee to be included in the technical program. The resulting program covers a wide range of topic areas related to Internet measurement. For the first time, the conference program also includes a keynote speech by Prof. Christos Faloutsos of Carnegie Mellon University, and a panel session on "Measurement Challenges in Online Social Networks." After the end of the technical program, there will be a tutorial on the IETF IPFIX protocol by Elisa Boschi and Brian Trammell. Following the tradition of past IMC conferences, a Best Paper Award paper is selected among those in the program that makes their measurement data publically available. This year's Best Paper Award goes to "Experimental Study of Router Buffer Sizing," by Neda Beheshti (Stanford University), Yashar Ganjali (University of Toronto), Monia Ghobadi (University of Toronto), Nick McKeown (Stanford University), Geoff Salmon (University of Toronto). Congratulations to the authors of the award paper, and we hope the released data are well used by the community.
Analysis and application of the IIPG method to quasilinear nonstationary convection-diffusion problems
Authors: Vít Dolejší
Venue: Journal of Computational and Applied Mathematics (2008)

We develop a numerical method for the solution of convection-diffusion problems with a nonlinear convection and a quasilinear diffusion. We employ the so-called incomplete interior penalty Galerkin (IIPG) method which is suitable for a discretization of quasilinear diffusive terms. We analyse a use of the IIPG technique for a model scalar time-dependent convection-diffusion equation and derive hp a priori error estimates in the L^2-norm and the H^1-seminorm. Moreover, a set of numerical examples verifying the theoretical results is performed. Finally, we present a preliminary application of the IIPG method to the system of the compressible Navier-Stokes equations.
Mutual information, variation, and Fano's inequality
Authors: V. V. Prelov, E. C. Meulen
Venue: Problems of Information Transmission (2008)

Some upper and lower bounds are obtained for the maximum of the absolute value of the difference between the mutual information |I(X; Y) ¿ I(X¿; Y¿)| of two pairs of discrete random variables (X, Y) and (X¿, Y¿) via the variational distance between the probability distributions of these pairs. In particular, the upper bound obtained here substantially generalizes and improves the upper bound of [1]. In some special cases, our upper and lower bounds coincide or are rather close. It is also proved that the lower bound is asymptotically tight in the case where the variational distance between (X, Y) and (X¿ Y¿) tends to zero.
Hierarchical Krylov subspace based reduction of large interconnects
Authors: Duo Li, Sheldon X. -D. Tan, Lifeng Wu
Venue: Integration, the VLSI Journal (2009)

In this paper, we propose a new model order reduction approach for large interconnect circuits using hierarchical decomposition and the Krylov subspace projection-based model order reduction methods. The new approach, called hiePrimor, first partitions a large interconnect circuit into a number of smaller subcircuits and then performs the projection-based model order reduction on each of subcircuits in isolation and on the top-level circuit thereafter. The new approach is very amenable for exploiting the multi-core based parallel computing platforms to significantly speed up the reduction process. Theoretically we show that hiePrimor can deliver the same accuracy as the flat reduction method given the same reduction order and it can also preserve the passivity of the reduced models as well. We also show that partitioning has large impacts on the performance of hierarchical reduction and the minimum-span objective should be required to attain the best performance for hierarchical reduction. The proposed method is suitable for reducing large global interconnects like coupled bus, transmission lines, large clock nets in the post-layout stage. Experimental results demonstrate that hiePrimor can be significantly faster and more scalable than the flat projection methods like PRIMA and be order of magnitude faster than PRIMA with parallel computing without loss of accuracy. Interconnect circuits with up to 4 million nodes can be analyzed in a few minutes even in Matlab by the new method.
LearnLexTo: a machine-learning based word segmentation for indexing Thai texts
Authors: Choochart Haruechaiyasak, Sarawoot Kongyoung, Chaianun Damrongrat
Venue: Proceeding of the 2nd ACM workshop on Improving non english web searching (2008)

Thai language is considered as an unsegmented language in which words are written continuously without the use of word delimiters. To index Thai texts via the inverted index, a word segmentation algorithm is usually required to tokenize a text into a series of terms. Recent works on word segmentation reported Conditional Random Fields (CRFs) as the best machine learning algorithm, outperforming the dictionary-based approach and other machine learning algorithms. Our main contribution is to propose a new hybrid approach, LearnLexTo, which further improves the CRF model by integrating the dictionary-based approach. The key idea is to solve the ambiguity problem in the CRF model by using the dictionary-based approach which relies on a valid word set. Experimental results showed that the proposed hybrid approach yields the highest F1 value of 88.46%, compared to 82.07% by using the dictionary-based approach and 85.71% by using the CRF model.
A goal/plan analysis of buggy pascal programs
Authors: James C. Spohrer, Elliot Soloway, Edgar Pope
Venue: Human-computer interaction (1985)

In this paper, we present a descriptive theory of buggy novice programs and a bug categorization scheme that is based on this theory. Central to this theory is the cognitively plausible knowledge--goals and plans--that underlies programming. The bug categorization scheme makes explicit problem-dependent goal and plan knowledge at many different levels of detail. We provide several examples of how the scheme permits us to focus on bugs in a way that facilitates generating plausible accounts of why the bugs may have arisen. In particular, our approach has led us to one explanation of why some novice programs are buggier than others. A basic part of this explanation is the notion of merged goals and merged plans in which a single integrated plan is used to achieve multiple goals.
Thermal aware placement in 3D ICs using quadratic uniformity modeling approach
Authors: Haixia Yan, Qiang Zhou, Xianlong Hong
Venue: Integration, the VLSI Journal (2009)

Three-dimensional (3D) ICs have the potential to reduce the interconnect delay, but thermal problem becomes one of the most serious challenges. In this paper, we proposed an efficient thermal aware 3D placement algorithm,which takes use of quadratic uniformity modeling approach. In this model, cell distribution and thermal dissipation are integrated and formulated as a quadratic function through discrete cosine transformation (DCT) with wirelength optimization. Quadratic programming method is utilized to solve the unified quadratic objective function. We update the unified cell distribution and thermal dissipation with each step of the iterative placement process. Thermal distribution was considered enough during placement process even when a cell was moved. To save time, two fast methods to reflect thermal change were proposed for thermal distribution computation. The experimental results show our thermal aware 3D placement algorithm is efficient with about 3% reduction in average temperature and 15% in max temperature but a little perturbation on wire length.