ppxscal/embedding_network huggingface dataset:
Correlation of electromigration lifetime distribution to failure mode in dual damascene Cu/SiLK interconnects
Authors: L. M. Gignac, C.-K. Hu, E. G. Liniger
Venue: Microelectronic Engineering (2003)

The electromigration cumulative percent lifetime probability of dual Damascene Cu/SiLK interconnects was fitted using three, individual lognormal functions where the functional populations were grouped by void growth location determined from focused ion beam failure analysis of all 54 of the stressed structures. The early, first mode failures were characterized by small voids in the bottom of the vias. The intermediate mode failures had voids in the line and via bottom while the late mode failures had voids that formed in the line only. The three, individual lognormal functions provided good fits of the data. Failure mode population separation using comprehensive failure analysis suggested that only the first mode failures should be used in the prediction of the chip design current.
Kinetics of undoped silica deposition process in plasmachemical SPCVD technology
Authors: A. N. Denisov, A. S. Biriukov, K. M. Golant
Venue: Microelectronic Engineering (2003)

Kinetics of SiCl4 into SiO transformation process in oxygen plasma of stationary reduced-pressure microwave-induced discharge is studied theoretically and experimentally. Calculations and experiments have been carried out for an extended stationary plasma column, limited by substrate tube silica walls (SPCVD technology). The model includes 10 components and 18 major chemical reactions, and gas mixture flow towards plasma column is taken into proper account. The components distribution along the plasma column was registered by emission spectroscopy. The reaction rate constants of SiCln (n≤4) dissociation under the condition of discharge are estimated by comparison of the calculated concentration profiles of the major plasma components with the experimental data on the longitudinal profiles of their emissions.
On the average sojourn time under M/M/1/SRPT
Authors: Nikhil Bansal
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

We consider an M/M/1 queueing system under the Shortest Remaining Processing Time (SRPT) policy. We show that there are constants cl and c2 such the average sojourn time under SRPT lies between cl (&mu;(1 - &rho;) log 1/(1 - &rho;))-1 and c2 (&mu;(l - &rho;) log 1/(1 - &rho;))-1, where &mu; denotes the service rate and &rho; denotes the load. Comparing this with the classic result that any scheduling policy that does not use the knowledge of job sizes has average sojourn time (&mu;(1-&rho;))-1, implies that SRPT offers a non-constant improvement over such policies.
Stabilization of Linear Parabolic Equations Defined in an Exterior of a Bounded Domain by a Boundary Control
Authors: A. V. Gorshkov
Venue: Journal of Dynamical and Control Systems (2004)

In this paper, we study the stabilization problem for linear parabolic equation defined in an exterior of a bounded domain. For any positive k > 0 and for a given initial datum we prove the existence of a boundary condition which is the control such, that the solution of this boundary-value problem tends to 0 as t &rarr; &infin; with the rate 1/tk.
Early evaluation of software performance based on the UML performance profile
Authors: Gordon Ping Gu, Dorina C. Petriu
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

The "UML Profile for Schedulability, Performance and Time" recently adopted by OMG defines performance extensions via the Unified Modeling Language (UML) stereotypes, tagged values and constraints. In order to conduct quantitative performance analysis of a UML model with performance annotations, one must first translate it into a performance model, then solve the generated model with an existing performance analysis tool. This paper proposes a method for transforming automatically an annotated UML model into a simulation-based performance model. The UML model represents the software architecture, the deployment of software on hardware resources, and a set of key performance scenarios. The transformation was implemented in Extensible Stylesheet Language for Transformations (XSLT). It takes as input an annotated UML model in eXtensible Markup Language (XML) Metadata Interchange (XMI) format, and produces as output a CSIM18 compile-ready simulation model. The transformation is done in two steps: a) from the UML input model to an XML intermediate form, and b) from the later to the compile-ready code of the simulation model. The intermediate form was designed to be independent of the specific performance model, so other types of performance models can be generated from it.
A multimodal presentation planner for a home entertainment environment
Authors: Christian Elting, Georg Michelitsch
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

In this paper we outline the design and the implementation of the multimodal presentation planner PMO, which is part of the EMBASSI intelligent user interface for home entertainment devices. We provide details about the concepts we use to produce cohesive and coherent output as well as illustrate the software architecture of the PMO. We compare our approach with the state of the art in presentation planning and conclude with an illustration of our future work.
Modelling the asymmetric volatility of electronics patents in the USA
Authors: Felix Chan, Dora Marinova, Michael McAleer
Venue: Mathematics and Computers in Simulation (2004)

Since the 1970s, electronics and associated electrical equipment (henceforth "electronics") has been one of the most dominant industries in the developed countries, with its geographical centre firmly rooted in the USA. The overall presence of electronics patents in the USA is considerable, with the share of electronics reaching 31% of all US patents in 1996 and total electronics patents reaching close to 170,000 in 1997. For the empirical analysis, the time-varying nature of volatility in the electronics patent share, namely the ratio of US electronics patents to total US patents, is examined using monthly data from January 1975 to December 1997. As negative and positive movements in the patent share may have different impacts on innovative activity, and hence on volatility, both symmetric and asymmetric models of volatility are estimated. The estimated models are the symmetric AR(1)-GARCH(1, 1), the asymmetric AR(1)-GJR(1, 1), and asymmetric AR(1)-EGARCH(1, 1). Of these, the asymmetric AR(1)-GJR(1, 1) model is found to be suitable for modelling the electronics patent share in the USA.
Using background knowledge in case-based legal reasoning: a computational model and an intelligent learning environment
Authors: Vincent Aleven
Venue: Artificial Intelligence (2003)

Researchers in the field of AI and Law have developed a number of computational models of the arguments that skilled attorneys make based on past cases. However, these models have not accounted for the ways that attorneys use middle-level normative background knowledge (1) to organize multi-case arguments, (2) to reason about the significance of differences between cases, and (3) to assess the relevance of precedent cases to a given problem situation. We present a novel model, that accounts for these argumentation phenomena. An evaluation study showed that arguments about the significance of distinctions based on this model help predict the outcome of cases in the area of trade secrets law, confirming the quality of these arguments. The model forms the basis of an intelligent learning environment called CATO, which was designed to help beginning law students acquire basic argumentation skills. CATO uses the model for a number of purposes, including the dynamic generation of argumentation examples. In a second evaluation study, carried out in the context of an actual legal writing course, we compared instruction with CATO against the best traditional legal writing instruction. The results indicate that CATO's example-based instructional approach is effective in teaching basic argumentation skills. However, a more "integrated" approach appears to be needed if students are to achieve better transfer of these skills to more complex contexts. CATO's argumentation model and instructional environment are a contribution to the research fields of AI and Law, Case-Based Reasoning, and AI and Education.
Evaluation of a split-connection mobile transport protocol
Authors: Feng Xie, Joseph L. Hammond, Daniel L. Noneaker
Venue: Wireless Networks (2003)

A performance evaluation is presented for a split-connection protocol for wireless Internet access which is denoted Split-Connection Mobile Tranport Protocol (SCMTP). It uses the general approach of the previously introduced Mobile End Transport Protocol (METP) but with differences that include a wireless-link channel-access protocol better matched with current cellular networks and more general ARQ methods for error control in the wireless link. In common with METP, SCMTP uses a standard TCP protocol on the wireline connection and isolates the data flow in the wire-line network from the effect of wireless packet errors.Performance is considered for the important case of a single SCMTP split connection between a fixed host and a mobile host with heavy downlink traffic from the fixed host to the mobile host. It is shown for these conditions that if the wire-line packet-error rate is small, a steady state is reached in which the connection's data flow in the wire-line network remains under the control of the receiver-advertised window of the TCP entity at the base station. Performance is evaluated for the steady-state operation of the SCMTP protocol, and relationships are established between the key properties of the split connection and the end-to-end performance of the connection.It is shown that for heavy downlink traffic, the delay in the wire-line part of the connection does not affect steady-state throughput if the receiver buffer is sized appropriately. It is also shown that use of the go-back-N ARQ protocol on the wireless link yields better performance than the stop-and-wait ARQ protocol, although the performance with go-back-N ARQ is more sensitive to the characteristics of the wireless channel. It is shown that under a broad range of conditions, SCMTP with go-back-N ARQ provides nearly optimal utilization of the capacity of the wireless link.
A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems
Authors: B. Cano, A. Durán
Venue: Mathematics of Computation (2003)

Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.
Adaptive Modeling of Biochemical Pathways
Authors: R. Brause
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

In bioinformatics, biochemical pathways can be modeled by many differential equations. It is still an open problem how to fit the huge amount of parameters of the equations to the available data. Here, the approach of systematically learning the parameters is necessary.In this paper, for the small, important example of inflammation modeling a network is constructed and different learning algorithms are proposed. It turned out that due to the nonlinear dynamics evolutionary approaches are necessary to fit the parameters for sparse, given data.
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
Authors: Alan D. Sokal
Venue: Combinatorics, Probability and Computing (2001)

We show that there exist universal constants C(r) < &infin; such that, for all loopless graphs G of maximum degree &le; r, the zeros (real or complex) of the chromatic polynomial PG(q) lie in the disc &#x2223;q&#x2223; < C(r). Furthermore, C(r) &le; 7.963907r. This result is a corollary of a more general result on the zeros of the Potts-model partition function ZG(q, {ve}) in the complex antiferromagnetic regime &#x2223;1 + ve&#x2223; &le; 1. The proof is based on a transformation of the Whitney&ndash;Tutte&ndash;Fortuin&ndash;Kasteleyn representation of ZG(q, {ve}) to a polymer gas, followed by verification of the Dobrushin&ndash;Koteck&yacute;&ndash;Preiss condition for nonvanishing of a polymer-model partition function. We also show that, for all loopless graphs G of second-largest degree &le; r, the zeros of PG(q) lie in the disc &#x2223;q&#x2223; < C(r) + 1. Along the way, I give a simple proof of a generalized (multivariate) Brown&ndash;Colbourn conjecture on the zeros of the reliability polynomial for the special case of series-parallel graphs.
Culture and e-business in Thailand
Authors: Suttisak Jantavongso, Raymond Koon-Ying Li, Benedict Tootell
Venue: Managing globally with information technology (2003)

Surveys of Western literature identify law, infrastructure, tax, payment processes, consumers, suppliers, education and business culture, as the key factors in the successful adoption of e-business. A survey of Thai business executives confirmed that culture and society are additional factors. Twenty of these factors were identified and examined Organizational infrastructure and English literacy were also found to be major internal and external barriers respectively. The research findings provide the foundation for future research aimed at developing a holistic framework to guide business in Thailand and other countries, to successfully implement the new generation of e-business activities. The new generation of e-business activities include operation-centric e-business, virtual business and Application Service Providers (ASPs).
Information retrieval and the query language
Authors: Abraham Waksman
Venue: Proceedings of the 1973 meeting on Programming languages and information retrieval (1973)

This paper addresses itself to the information retrieval problem of a manager within an organization. We feel that the approach taken in specifying such a system is sufficiently general to be suitable for application to other system specifications. It is assumed that the manager wishes to interrogate a system containing a data base that relates to his task of making decisions in the course of running his part of an organization.To meet the manager's needs we have attempted to define the models a manager uses in making decisions. We have further made an approach toward problem definition for the manager.To interpret a manager's queries stemming from encountered or anticipated problems, we have attempted to define an inferential system. The inferential system has a further task of specifying the retrieval of information that might exist only in an implicit form. Finally, we demonstrate an approach toward the design of a query language for the manager, which could become "natural" to him after short experience.
An adaptive survivability admission control algorithm using backup path for high-speed networks
Authors: Chi-Chun Lo, Bin-Wen Chuang
Venue: International Journal of Network Management (2003)

In this paper, we propose an adaptive survivability admission control algorithm using a backup path for high-speed networks. For each call request, the proposed algorithm selects a combination of working path and backup path. Two BP selection methods, min-cost and min-expectation, are suggested. Computational experiments indicate that the proposed algorithm significantly reduces the consumption of backup capacity while still maintaining 100% survivability upon a single link failure and near 80% survivability upon double link failures.
Design issues in implementing a cooperative search among heterogeneous agents to aid information management
Authors: P. G. Chander, T. Radhakrishnan, R. Shinghal
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Searching for information is an ubiquitous need in today's data-oriented environments. However, a request for search often entails the service and cooperation of tools managing a diversified set of tasks. In this article, we explore how tools in the form of cooperating agents can be deployed for information management. We describe an agent framework called GAME (goal-oriented, agent-managed environment), and focus on how GAME agents search cooperatively for information requested by a user. Cooperative search entails several issues such as coordinating agent activities, maintaining transparency to agent heterogeneity, and designing information formats to be shared among the agents that require examination. This article analyzes these issues and describes how they are handled in the GAME framework. Cooperative search effectively supports collaboration and information sharing not only among agents in a domain, but also among GAME agents developed across domains. We illustrate the application of cooperative search in task-oriented domains such as Manufacturing and Front Office showing how GAME promotes intradomain and interdomain collaboration in a Factory environment.
Application-defined scheduling in Ada
Authors: Mario Aldea Rivas, Michael González Harbour
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

This paper is a proposal for an application program interface (API) that would enable Ada applications to use application-defined scheduling algorithms in a way compatible with the scheduling model of the Ada 95 Real-Time Systems Annex. With this API, several application-defined schedulers, implemented by extending a tagged type, can coexist in the system in a predictable way together with their scheduled tasks, and with regular fixed priority tasks directly scheduled by the run-time system. Task synchronization through protected objects is also considered by adding the Stack Resource Policy, which can be used in a large variety of fixed and dynamic priority scheduling policies.
MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations
Authors: Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In the literature of data mining, many different algorithmsfor association rule mining have been proposed. However,there is relatively little study on how association rules can aidin more specific targets. In this paper, one of the applicationsfor association rules - maximal-profit item selection with cross-selling effect (MPIS) problem - is investigated. The problemis about selecting a subset of items which can give the maximalprofit with the consideration of cross-selling. We provethat a simple version of this problem is NP-hard. We proposea new approach to the problem with the consideration of theloss rule - a kind of association rule to model the cross-sellingeffect. We show that the problem can be transformed to aquadratic programming problem. In case quadratic programmingis not applicable, we also propose a heuristic approach.Experiments are conducted to show that both of the proposedmethods are highly effective and efficient.
On an inventory model for deteriorating items with stock dependent and time-varying demand rates
Authors: Zaid T. Balkhi, Lakdere Benkherouf
Venue: Computers and Operations Research (2004)

In this paper, we present an inventory model for deteriorating items with stock dependent and time-varying demand rates for a finite time planning horizon. We also suggest a procedure for finding the optimal replenishment schedule and show in a rigorous way that the policy suggested is indeed optimal. Further, we present a numerical example and conclude the paper with suggestions for possible future research.
Transcoding HTML to VoiceXML Using Annotation
Authors: Zhiyan Shao, Robert G. Capra,  III, Manuel A. Pérez-Quiñones
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

A problem with trying to create voice interfaces to existing HTML web pages is that most web pages are designed and optimized for graphical browsing. Our approach has been to consider voice interfaces to web information not as a replacement for desktop browsing using a graphical interface, but as a way to meet mobile users' needs for specific information. Such an interaction can be more directed and focused in nature than open-ended browsing tasks. In order to create usable voice interfaces to web information, we have identified a set of information structures that are commonly found on web pages and explored how they can be presented and navigated by voice. We have codified these structures in an XML annotation language called VXPL that can be used to annotate existing HTML code to indicate wherethese information structures exist. VXPL is designed so that it can be used for manual or automatic annotation of HTML code. In addition, we have implemented an automated transcoder that converts VXPL into VoiceXML with increased support for navigation and usability of the resulting interface.
Cellular automata technique for computational electromagnetics
Authors: Greg Bridges
Venue:  (2002)

Lattice Gas Automata (LGA) can be considered as an alternative to the conventional differential equation description of problems in electromagnetics. LGAs are discrete dynamical systems that are based on a microscopic model of the physics being simulated. The basic constituents of an LGA are discrete cells. These cells are interconnected according to certain symmetric requirements to form an extremely large regular lattice. The cells of an LGA are extremely simple, requiring only a few bits to completely describe their states. Even though they are simple, the collective behaviour of LGA microscopic systems is capable of exhibiting those behaviours described by partial differential equations for real physical systems. The inherent parallelism and simplicity of LGA algorithms make them ideally suited to implementation in a parallel processing architecture which can be effectively realized with special-purpose cellular automata machines. The objective of this research is to explore and develop the potential of cellular automata as mathematical tools for electromagnetic modelling. In two-dimensional applications, a new HPP-type mixture LGA algorithm is presented for modelling wave propagation in inhomogeneous media. It can be analytically shown that change in sound speed of an LGA can be achieved by incorporating rest bits at a lattice site, as well as moving or interaction bits. It will also be shown that a simple mixture LGA will behave according to the linear scalar wave equation. Thus, by making an analogy between a fluid and two-dimension electromagnetic field parameters, we can utilize this simple particle interaction paradigm as a tool for two-dimensional inhomogeneous electromagnetic problems. However, the problem of developing LGA vector models for modelling three-dimensional electromagnetic phenomena is more difficult since there is no a direct analogy between fluid and three-dimensional vector electromagnetic fields. By considering the inherent property of electromagnetic fields, an LGA vector algorithm for modelling three-dimensional vector electromagnetic fields is constructed. We show how, in the macroscopic limit, the three-dimensional Maxwell's equations can be derived from the LGA vector model.