ppxscal/embedding_network huggingface dataset:
Secondary electron detection for distributed axis electron beam systems
Authors: S. Tanimoto, D. S. Pickard, C. Kenney, R. F. W. Pease
Venue: Microelectronic Engineering (2008)

A secondary electron detection scheme for the distributed axis, fixed-aperture system is described. It employs a multi-channel detector array with a through-hole for a primary beamlet on each channel, a field terminator installed between the detector array and sample, and a deflector forming a static transverse electric field between the field terminator and sample. These elements enable detection of the secondary electrons stimulated by the primary beamlet. In order to achieve a high detection rate, small separation of the primary beamlets, and small aberrations, the size and the layout of the through-holes of the field terminator are studied. The equation of motion in an ideal field distribution is analytically solved and the dispersion of the secondary electrons caused by the helical motion in an axial magnetic field and chromatic variation of deflection are calculated. Aberrations are calculated by using numerical simulation. On the basis of these calculations, two types of the field terminator are proposed. One has a single through-hole, which is shared by a primary beamlet and the secondary electrons stimulated by the primary beamlet, per primary beamlet. The other has a through-hole exclusively for a primary beamlet and an extra slot for the secondary electrons, per primary beamlet. Simulations reveal that the former achieves a secondary electron detection rate of 99.7% and aberrations smaller than 4.6nm, but doesn't enable the separation of the primary beamlet to be smaller than 1000@mm. In contrast, the latter achieves a secondary electron detection rate of 95.0%, aberrations smaller than 9.7nm. Furthermore, it also enables the separation of the primary beamlet to be as small as 250@mm, the same as in our detector array at this moment.
Efficiency of reducing and oxidizing ash plasmas in preventing metallic barrier diffusion into porous SiOCH
Authors: N. Posseme, T. Chevolleau, T. David, M. Darnon, J. P. Barnes, O. Louveau, C. Licitra, D. Jalabert, H. Feldis, M. Fayolle, O. Joubert
Venue: Microelectronic Engineering (2008)

This work focuses on the efficiency of reducing and oxidizing plasma chemistries in preventing metallic barrier diffusion into porous dielectric materials (SiOCH with a k value close to 2.2, porosity content around 40%). The ash processes have been performed on SiOCH coated blanket and patterned wafers in either reactive ion etching (RIE) or downstream (DS) reactors. The Rutherford backscattering spectroscopy technique (RBS) has shown that titanium based compounds diffuse into the blanket porous SiOCH without treatment during a typical TiN barrier deposition process by chemical vapor deposition (CVD). The metallic barrier diffusion is strongly limited on blanket wafers when the porous SiOCH has been previously modified (partially or fully) by ash plasmas (RIE-O"2, RIE-NH"3, DS-H"2/N"2 and DS-O"2/N"2) while the metallic barrier diffusion occurs with no modifying ash plasmas (DS-H"2/He). We have shown that ellipsometric porosimetry (EP) measurements clearly point out that no complete pore sealing is achieved with all the investigated ash plasmas. Energy-filtering transmission electron microscopy experiments (EFTEM) performed on single damascene structures have revealed significant titanium diffusion into the porous dielectric lines for DS-H"2/He and RIE-O"2 and sidewalls modification of the porous SiOCH lines (lower C/O ratio) for all the ash plasmas. The RC product (resistancexcapacitance) have been extracted from the single damascene structures and the evolution of RC product will be discussed in terms of lines modification (titanium diffusion and porous SiOCH modification).
An embedded infrastructure of debug and trace interface for the DSP platform
Authors: Ming-Chang Hsieh, Chih-Tsun Huang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The paper presents an infrastructure for debug and trace of the embedded digital signal processor (DSP) system, consisting of the in-system trace interface and its methodology to optimize the compression rate of the program and data traces. The platform has been implemented in a multimedia dual-core SOC design with little area overhead. Both the benchmark evaluation and realistic system integration justified the efficiency and effectiveness of our approach.
Quantifying the flexibility of a manufacturing system by applying the transfer function
Authors: K. Alexopoulos, N. Papakostas, D. Mourtzis, P. Gogos, G. Chryssolouris
Venue: International Journal of Computer Integrated Manufacturing (2007)

This paper discusses a method of estimating the flexibility of a manufacturing system. The proposed approach is motivated by the dynamic behaviour analogy between a mechanical and a manufacturing system. The main hypothesis is that the flexibility of a manufacturing system can be calculated in the same manner as the damping factor of a mechanical system. In order for the validity of the proposed method to be tested and discussed, a set of experiments has been designed and executed, initially for a simple production system. An industrial production system has also been studied using the same approach. The results prove that this method can be used for the estimation of a manufacturing system's flexibility.
The relation browser tool for faceted exploratory search
Authors: Robert G. Capra, Gary Marchionini
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The Relation Browser (RB) is a tool developed by the Interaction Design Lab at the University of North Carolina at Chapel Hill for understanding relationships between items in a collection and for exploring an information space (e.g., a set of documents or webpages). The RB has been through a number of major design revisions. At JCDL 2007, we reported on two studies of information seeking that we conducted using the RB++ version of the Relation Browser software. Based on the results of those studies, we developed a set of design changes and implemented these in a new version called RB07. We will demonstrate the new RB07 interface and describe the rationale for our design changes.
Automatic business process analysis and simulation based on DEMO
Authors: J. Barjis
Venue: Enterprise Information Systems (2007)

Enterprise process modelling as a core area of the Enterprises Information Systems (EIS) research has long attracted theoreticians of new concepts, designers of artefacts, and practitioners of modelling. As a result a vast number of modelling methods have been generated. However, each method is challenging because they lack certain aspects. First, these methods view processes as a flowchart, undermining the deep (nested) structure of processes. Second, most of these methods are based on informal or semi-formal representation, failing direct model checking and formal analysis without further translations and mapping procedures. Finally, because the majority of these methods originated from a computing perspective, their focal point is control-flow rather than interaction of social actors. In reality, an enterprise is a complex socio-technical system that includes interaction of technical and social components. In this paper, we discuss an innovative method that will address some of these challenges and provide an improved tool for this purpose. We base our method on the field-proven DEMO theory and methodology, where emphasis is made on the interactions between social actors. The proposed method encompasses a set of graphical notations and constructs based on the Petri nets semantics that allows direct model analysis and simulation.
Broadcast electrode-addressing for pin-constrained multi-functional digital microfluidic biochips
Authors: Tao Xu, Krishnendu Chakrabarty
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Recent advances in digital microfluidics have enabled lab-on-a-chip devices for DNA sequencing, immunoassays, clinical chemistry, and protein crystallization. Basic operations such as droplet dispensing, mixing, dilution, localized heating, and incubation can be carried out using a two-dimensional array of electrodes and nanoliter volumes of liquid. The number of independent input pins used to control the electrodes in such microfluidic "biochips" is an important cost-driver, especially for disposable PCB devices that are being developed for clinical and point-of-care diagnostics. However, most prior work on biochip design-automation has assumed independent control of the electrodes using a large number of input pins. Another limitation of prior work is that the mapping of control pins to electrodes is only applicable for a specific bioassay. We present a broadcast-addressing-based design technique for pin-constrained multi-functional biochips. The proposed method provides high throughput for bioassays and it reduces the number of control pins by identifying and connecting control pins with "compatible" actuation sequences. The proposed method is evaluated using a multifunctional chip designed to execute a set of multiplexed bioassays, the polymerase chain reaction, and a protein dilution assay.
On the computation of Boolean functions by analog circuits of bounded fan-in
Authors: G. Turan, F. Vatan
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e. by circuits of gates computing real-valued functions, either exactly or as a sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over certain bases (sign-representation by arithmetic circuits and exact computation by piecewise linear circuits). Bounds are given for the computational power gained by adding discontinuous gate functions and nondeterminism. We also prove explicit nonlinear lower bounds for the formula size of analog circuits over bases containing addition, subtraction, multiplication, the sign function and all real constants.
Selecting the right MBA schools - An application of self-organizing map networks
Authors: Melody Y. Kiang, Dorothy M. Fisher
Venue: Expert Systems with Applications: An International Journal (2008)

The self-organizing map (SOM) network, an unsupervised neural computing network, is a categorization network developed by Kohonen. The SOM network was designed for solving problems that involve tasks such as clustering, visualization, and abstraction. In this study, we apply the clustering and visualization capabilities of SOM to group and plot the top 79 MBA schools as ranked by US News and World Report (USN&WR) into a two-dimensional map with four segments. The map should assist prospective students in searching for the MBA programs that best meet their personal requirements. Comparative analysis with the outputs from two popular clustering techniques K-means analysis and a two-step Factor analysis/K-means procedure are also included.
Refinement of temporal constraints in fuzzy associations
Authors: Thomas Sudkamp
Venue: International Journal of Approximate Reasoning (2008)

The objectives of hypothesis refinement in knowledge discovery are to produce rules that more accurately model the underlying data while maintaining rule interpretability. In this paper we introduce two refinement strategies for association rules with fuzzy temporal constraints. Disjunctive generalization produces more general rules by merging adjacent constraints within a partition of the window of temporal relevance. Temporal specification uses linguistic hedges to reduce the duration of a constraint to better model the distribution of examples. Both types of refinement produce rules expressible using the linguistic terms of the original rules. The acquisition of the information needed to perform the refinements is incorporated into a general algorithm for determining the number of examples and counterexamples of rules with fuzzy temporal constraints.
Legal research topics in user-centric services
Authors: O. Pitkänen, P. Virtanen, J. Kemppinen
Venue: IBM Systems Journal (2008)

There are several essential legal topics that must be included in the research agenda of service science. In this paper, we discuss these topics, beginning with an analysis of the definition of a service and a categorization of some of the actors in service systems, with their diverse interests. A set of case studies and scenarios is presented to illustrate the kinds of legal challenges that are involved in providing user-centric and customer-oriented services. We conclude by suggesting the most important legal topics that should be studied further in relation to service science.
Dual-link failure resiliency through backup link mutual exclusion
Authors: Srinivasan Ramasubramanian, Amit Chandak
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as backup link mutual exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: 1) formulating the backup path selection as an integer linear program; 2) developing a polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared with approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all of the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures.
The cost of supporting references in collaborative augmented reality
Authors: Jeff Chastine, Ying Zhu
Venue: Proceedings of graphics interface 2008 (2008)

For successful collaboration to occur, a fundamental requirement is the ability for participants to refer to artifacts within the shared environment. This task is often straightforward in traditional collaborative desktop applications, yet the spatial properties found in mixed reality environments greatly impact the complexity of generating and interpreting meaningful reference cues. Although awareness is a very active area of research, little focus has been given to the environmental and contextual factors that influence referencing or the costs associated with supporting it in mixed reality environments. The work presented here consists of a compilation of understanding we have gained through user observation, participant feedback and system development. We begin by summarizing our findings from several user studies in collaborative augmented reality (AR). To organize the complexity associated with referencing in AR, we enumerate contextual and environmental factors that influence referential awareness - integrating discussion about user preferences and the impact they have on the underlying technological requirements. Finally, we discuss how these factors can impact the design space of collaborative systems and describe the cost associated with supporting references in collaborative AR.
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
Authors: Blai Bonet, Héctor Geffner
Venue: Artificial Intelligence (2008)

The automatic derivation of heuristic functions for guiding the search for plans is a fundamental technique in planning. The type of heuristics that have been considered so far, however, deal only with simple planning models where costs are associated with actions but not with states. In this work we address this limitation by formulating a more expressive planning model and a corresponding heuristic where preferences in the form of penalties and rewards are associated with fluents as well. The heuristic, that is a generalization of the well-known delete-relaxation heuristic, is admissible, informative, but intractable. Exploiting a correspondence between heuristics and preferred models, and a property of formulas compiled in d-DNNF, we show however that if a suitable relaxation of the domain, expressed as the strong completion of a logic program with no time indices or horizon is compiled into d-DNNF, the heuristic can be computed for any search state in time that is linear in the size of the compiled representation. This representation defines an evaluation network or circuit that maps states into heuristic values in linear-time. While this circuit may have exponential size in the worst case, as for OBDDs, this is not necessarily so. We report empirical results, discuss the application of the framework in settings where there are no goals but just preferences, and illustrate the versatility of the account by developing a new heuristic that overcomes limitations of delete-based relaxations through the use of valid but implicit plan constraints. In particular, for the Traveling Salesman Problem, the new heuristic captures the exact cost while the delete-relaxation heuristic, which is also exponential in the worst case, captures only the Minimum Spanning Tree lower bound.
Electric field integral equation combined with cylindrical conduction mode basis functions for electrical modeling of three-dimensional interconnects
Authors: Ki Jin Han, Madhavan Swaminathan, Ege Engin
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

For the modeling of interconnect in three-dimensional packagings, this paper proposes a method based on the electric field integral equation (EFIE) with cylindrical conduction mode basis functions (CMBF). The bases are defined to describe arbitrary skin and proximity effects, and partial impedances are obtained from the formulation of the EFIE with CMBF's. Examples of several 3-D interconnects verify that the proposed method is efficient in speed and memory.
Neural networks in process life cycle profit modelling
Authors: Teemu Räsänen, Risto Soukka, Sami Kokki, Yrjö Hiltunen
Venue: Expert Systems with Applications: An International Journal (2008)

Changes in operational environment of the process industry such as decreasing selling prices, increased competition between companies and new legislation, set requirements for performance and effectiveness of the industrial production lines and processes. For the basis of this study, a life cycle profit (LCP) model of a pulp process was constructed using different kind of process information including chemical consumptions and production levels of material and energy flows in unit processes. However, all the information needed in the creation of relevant LCP model was not directly provided by information systems of the plant. In this study, neural networks was used to model pulp bleaching process and fill out missing information and furthermore to create estimators for the alkaline chemical consumption. A data-based modelling approach was applied using an example, where factors affecting the sodium hydroxide consumption in the bleaching stage were solved. The results showed that raw process data can be refined into new valuable information using computational methods and moreover to improve the accuracy of life cycle profit models.
Modeling the Dynamics of the Human Pulse Data by MDL-optimal Neural Networks
Authors: Yingnan Ma, Yi Zhao, Youhua Fan, Hong Hu, Xiujun Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, we describe an information theoretic criterion, the method of minimum description length (MDL), to determine optimal neural networks to predict the human pulse data as well as non-stationary Lorenz data. Such optimal models which minimize the description length of the data both generalize well and accurately capture the dynamics of the original data. It demonstrates the potential utility of our MDL- optimal model in biomedical time series modeling.
Fast reroute with pre-established bypass tunnel in MPLS
Authors: Wei Kuang Lai, Zhen Chang Zheng, Chen-Da Tsai
Venue: Computer Communications (2008)

Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress label switching router (LSR) to forward the packet. This study presents a novel method to facilitate restoration of LSP in the MPLS network. The proposed method attempts to establish all possible bypass tunnels based on the available bandwidth between two LSRs around the protected label switched router. The Max-Flow Min-Cut theorem is adopted to find the necessary links through which all paths between LSR"i and LSR"j must pass. All LSPs affected by a LSR failure or a link failure can specify a bypass tunnel that fits its QoS constraints to reroute if there is one. This study also compares the pre-established bypass tunnel (PBT) algorithm and the PBT algorithm with disjoint bypass tunnels (PBT-D). The simulation results indicate that the proposed method has less packet losses in rerouting and can allow more affected LSPs to reroute traffic than RSVP and efficient Pre-Qualify. Additionally, the PBT performs better than PBT-D in terms of correctly receiving ratio and successfully rerouting ratio although PBT-D has the advantages of establishing less paths and fast search time.
IBM POWER6 microarchitecture
Authors: H. Q. Le, W. J. Starke, J. S. Fields, F. P. O'Connell, D. Q. Nguyen, B. J. Ronchetti, W. M. Sauer, E. M. Schwarz, M. T. Vaden
Venue: IBM Journal of Research and Development (2007)

This paper describes the implementation of the IBM POWER6™ microprocessor, a two-way simultaneous multithreaded (SMT) dual-core chip whose key features include binary compatibility with IBM POWER5™ microprocessor-based systems; increased functional capabilities, such as decimal floating-point and vector multimedia extensions; significant reliability, availability, and serviceability enhancements; and robust scalability with up to 64 physical processors. Based on a new industry-leading high-frequency core architecture with enhanced SMT and driven by a high-throughput symmetric multiprocessing (SMP) cache and memory subsystem, the POWER6 chip achieves a significant performance boost compared with its predecessor, the POWER5 chip. Key extensions to the coherence protocol enable POWER6 microprocessor-based systems to achieve better SMP scalability while enabling reductions in system packaging complexity and cost.