ppxscal/embedding_network huggingface dataset:
B-series and Order Conditions for Exponential Integrators
Authors: Havard Berland, Brynjulf Owren, Bard Skaflestad
Venue: SIAM Journal on Numerical Analysis (2005)

We introduce a general format of numerical ODE-solvers which include many of the recently proposed exponential integrators. We derive a general order theory for these schemes in terms of $B$-series and bicolored rooted trees. To ease the construction of specific schemes we generalize an idea of Zennaro [{\em {Math. Comp.,}} 46 (1986), pp. 119--133] and define natural continuous extensions in the context of exponential integrators. This leads to a relatively easy derivation of some of the most popular recently proposed schemes. The general format of schemes considered here makes use of coefficient functions which will usually be selected from some finite dimensional function spaces. We will derive lower bounds for the dimension of these spaces in terms of the order of the resulting schemes. Finally, we illustrate the presented ideas by giving examples of new exponential integrators of orders 4 and 5.
Carbon etching with a high density plasma etcher
Authors: Kevin A. Pears, Jens Stolze
Venue: Microelectronic Engineering (2005)

Generating suitable passivation on the carbon sidewall is a major challenge facing carbon etching especially for films thicker than 500nm. Patterning carbon hard mask stacks for sub 90nm technologies was tested for three different O"2-based chemistries using an inductively coupled plasma etch tool. The results show that the etched carbon profiles are highly dependant upon the O"2 flow and the total time of the etch process. Extended over etch times quite often initiates lateral etching and rapid loss of profile and critical dimension. An HBr/O"2/N"2 chemistry has been shown to provide the best options for profile control and more resistance to profile loss during extended over etching than the other chemistries which were tested during this study.
Solving Optimal Control Problems on the Class of Step Functions
Authors: K. R. Aida-Zade
Venue: Cybernetics and Systems Analysis (2005)

Linear optimal control problems with multipoint non-separated conditions with a quadratic performance criterion of control are analyzed. An approach with a violation of intermediate conditions is proposed. The original problem is reduced to the classical quadratic programming problem with the dimension determined by the number of intermediate points.
Dynamic Creation of Inter-Organizational Grid Virtual Organizations
Authors: B. Nasser, R. Laborde, A. Benzekri, F. Barrere, M. Kamel
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The grid has emerged as a platform that enables inter-organizational internet-based collaborations in a sharing space called Virtual Organization (VO). Building a VO, in an open environment as the Internet, necessitates an access control policy to authorize, control and forbid activities in order to achieve the different partners' mutual benefits. Our goal being the dynamic VO creation is then associated with the automated generation of access control policy in a multiple access stakeholders' environment. We proposed in recent works OrBAC-based (Organization Based Access Control model) Virtual Organization model which we believe to be the corner stone in the VO creation automated process. In this paper we propose a methodology to dynamically build OrBAC-based VO and we show how our model is integrated in the creation process. The different methodology steps are explained along with the associated related works which serve for implementing our model. Finally we show an example of the model in work.
What hath got Roth
Authors: Paul F. Roth
Venue: ACM SIGSIM Simulation Digest (1974)

This column wishes to acknowledge the reassignment of Andy Hesser, who has been active and productive in computer systems simulation for quite a while. Not only that, but also quite communicative and a very witty presenter.
Fine-Grained Analysis of Change Couplings
Authors: Beat Fluri, Harald C. Gall, Martin Pinzger
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

In software evolution analysis, many approaches analyze release history data available through versioning systems. The recent investigations of CVS data have shown that commonly committed files highlight their change couplings. However, CVS stores modifications on the basis of text but does not track structural changes, such as the insertion, removing, or modification of methods or classes. A detailed analysis whether change couplings are caused by source code couplings or by other textual modifications, such as updates in license terms, is not performed by current approaches. The focus of this paper is on adding structural change information to existing release history data. We present an approach that uses the structure compare services shipped with the Eclipse IDE to obtain the corresponding finegrained changes between two subsequent versions of any Java class. This information supports filtering those change couplings which result from structural changes. So we can distill the causes for change couplings along releases and filter out those that are structurally relevant. The first validation of our approach with a medium-sized open source software system showed that a reasonable amount of change couplings are not caused by source code changes.
Proactive Business Performance Management in the Book Distribution Industry
Authors: Kaoji Fujiwara, Akio Koide, Masaru Saitoh
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper presents a feasibility study of proactive business performance management based on monitoring data for the Japanese book market. By using two years of such data, we developed three types of forecasts. We tested them with simulations to show how to prediction-based book distribution can improve the book business.
Experimental study on population-based incremental learning algorithms for dynamic optimization problems
Authors: Shengxiang Yang, Xin Yao
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world problems are often dynamic. This seriously challenges traditional evolutionary algorithms. In this paper, the application of population-based incremental learning (PBIL) algorithms, a class of evolutionary algorithms, for dynamic problems is investigated. Inspired by the complementarity mechanism in nature a Dual PBIL is proposed, which operates on two probability vectors that are dual to each other with respect to the central point in the genotype space. A diversity maintaining technique of combining the central probability vector into PBIL is also proposed to improve PBIL&#x2019;s adaptability in dynamic environments. In this paper, a new dynamic problem generator that can create required dynamics from any binary-encoded stationary problem is also formalized. Using this generator, a series of dynamic problems were systematically constructed from several benchmark stationary problems and an experimental study was carried out to compare the performance of several PBIL algorithms and two variants of standard genetic algorithm. Based on the experimental results, we carried out algorithm performance analysis regarding the weakness and strength of studied PBIL algorithms and identified several potential improvements to PBIL for dynamic optimization problems.
A Ring Removal Movement-Based Mobility Location Update Scheme
Authors: Yaqin YANG, Jincai YANG, Jiwei CAO
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost. In this paper, a ring removal movement-based location update scheme with a selective paging is proposed. This location update scheme reduces the location updates by removing the ring formed in terminal's movement path. Numerical results show that the proposed movement-based update scheme provides a better performance than the improved movement-based registration (IMBR) scheme [1] when the terminal's callto- mobility (CMR) ratio [2] is small.
Reflection and aspects meet again: runtime reflective mechanisms for dynamic aspects
Authors: N. Bencomo, G. Blair, G. Coulson, P. Grace, A. Rashid
Venue: Proceedings of the 1st workshop on Aspect oriented middleware development (2005)

Distributed applications and middleware systems typically involve language and system-wide heterogeneity e.g. different platforms (PC, PDA, embedded devices, etc.). Dynamic adaptation of distributed systems at run-time is a common approach to deal with the resultant environmental conditions. Dynamic aspects have been identified as a technique to address this problem. In such kind of applications, advices cannot be considered as a simple 'piece of code' as it might be in single-language AOP approaches; instead advices should be realised in different ways in distinct parts of the system depending upon the platform, language, and dynamics of program execution. This position paper discusses the use of a suit of orthogonal meta-level models as the basis to provide different reflective implementation mechanisms for supporting AOP approaches in a language and platform independent fashion.
Welfare Economy on Belief in Data Mining - A rough set theoretical approach
Authors: Takashi Matsuhisa
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

We investigate a pure exchange economy under uncertainty with emphasis on the logical point of view from data base theory; the traders are assumed to have a multi-modal logic of belief and to make their decision under uncertainty represented by rough sets. We propose a generalized notion of expectations equilibrium for the economy, and we show the fundamental welfare theorem: An allocation in the economy is ex-ante Pareto optimal if and only if it is an expectations equilibrium allocation in belief for some initial endowment with respect to some price system.
Image Analysis for Electron Microscopy of Muscle Fibers
Authors: C. H. Yoon, P. J. Bones, R. P. Millane
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

An automated image analysis system for determination of myosin filament orientations in electron micrographs of muscle cross-sections is described. Analysis of the distribution of the orientations is important in studies of muscle structure, particularly for interpretation of x-ray diffraction data. Filament positions are determined by filtering with a point spread function that incorporates the local symmetry in an image. Filament orientations are determined by correlation with a template that incorporates the salient filament characteristics and the orientations classified using a Gaussian mixture model. Application to micrographs and comparison with manual classification of orientations shows that the system is effective.
Modelling Requirements Variability across Product Lines
Authors: Stan Buhne, Kim Lauenroth, Klaus Pohl
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The explicit definition of variability in software product lines is a key difference between the development of single software systems and software product line engineering. More and more companies maintain several software product lines which focus on different types of products, market segments, and/or domains. Those product lines typically share commonalities and variability. The companies thus face the problem of managing communality and variability across different product lines. In this paper we identify essential requirements for the documentation of requirements variability across product lines. We propose a meta model for structuring the variability information, sketch a prototypical realisation for managing variability across product lines in DOORS, and illustrate the use of the meta model in a small example. We further report on experiences made with the proposed variability modelling approach.
Citron: A Context Information Acquisition Framework for Personal Devices
Authors: Tetsuo Yamabe, Ayako Takagi, Tatsuo Nakajima
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

This paper describes a context information acquisition framework for a personal device that equips a variety of sensors. The framework captures context information about a user and his/her surrounding environment; and the information is used to adapt the behavior of applications running on the personal device. Our framework adopts the blackboard architecture to execute multiple analysis modules that analyze signals from respective sensors. Respective modules implement different algorithms to complement each other¿s results to retrieve more accurate and higher abstract context information.
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
Authors: Min-Jae Lee, Kyu-Young Whang, Wook-Shin Han, Il-Yeol Song
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Spatial joins find all pairs of objects that satisfy a given spatial relationship. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with extents of objects, it is relatively complex to optimize join algorithms using these indexes. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no extents. Thus, optimization of join algorithms using these indexes can be relatively simple. However, the disadvantage of these join algorithms is that they cannot be applied to original-space indexes such as the R-tree. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose the new notion of the transform-space view and present the transform-space view join algorithm. The transform-space view is a virtual transform-space index based on an original-space index. It allows us to "interpret” or "view” an existing original-space index as a transform-space index with no space and negligible time overhead and without actually modifying the structure of the original-space index or changing object representation. The transform-space view join algorithm joins two original-space indexes in the transform space through the notion of the transform-space view. Through analysis and experiments, we verify the excellence of the transform-space view join algorithm. The transform-space view join algorithm always outperforms existing ones for all the data sets tested in terms of all three measures used: the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page), the number of disk accesses for a given buffer size, and the wall clock time. Thus, it constitutes a lower-bound algorithm. We believe that the proposed transform-space view can be applied to developing various new spatial query processing algorithms in the transform space.
An optimized Takagi-Sugeno type neuro-fuzzy system for modeling robot manipulators
Authors: Amitava Chatterjee, Keigo Watanabe
Venue: Neural Computing and Applications (2006)

The present paper describes the development of a Takagi-Sugeno (TS)-type Neuro-fuzzy system (NFS) for dynamic modeling of robot manipulators. The NFS has been trained by a relatively new combinatorial metaheuristic optimization method, called particle swarm optimization (PSO). The development of such an intelligent, robust, dynamic models for robot manipulators can immensely help in deriving proper position/velocity control strategies in offline situations with these accurately developed models. The proposed PSO-based NFS has been successfully applied to two-link and three-link model robot manipulators.
Where Computer Security Meets National Security
Authors: Helen Nissenbaum
Venue: Ethics and Information Technology (2005)

This paper identifies two conceptions of security in contemporary concerns over the vulnerability of computers and networks to hostile attack. One is derived from individual-focused conceptions of computer security developed in computer science and engineering. The other is informed by the concerns of national security agencies of government as well as those of corporate intellectual property owners. A comparative evaluation of these two conceptions utilizes the theoretical construct of "securitization,"developed by the Copenhagen School of International Relations.
Text Recognition of Low-resolution Document Images
Authors: Charles Jacobs, Patrice Y. Simard, Paul Viola, James Rinker
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Cheap and versatile cameras make it possible to easily and quickly capture a wide variety of documents. However, low resolution cameras present a challenge to OCR because it is virtually impossible to do character segmentation independently from recognition. In this paper we solve these problems simultaneously by applying methods borrowed from cursive handwriting recognition. To achieve maximum robustness, we use a machine learning approach based on a convolutional neural network. When our system is combined with a language model using dynamic programming, the overall performance is in the vicinity of 80-95% word accuracy on pages captured with a 1024x768 webcam and 10-point text.
EMMA: Epidemic Messaging Middleware for Ad hoc networks
Authors: Mirco Musolesi, Cecilia Mascolo, Stephen Hailes
Venue: Personal and Ubiquitous Computing (2005)

The characteristics of mobile environments, with the possibility of frequent disconnections and fluctuating bandwidth, have forced a rethink of traditional middleware. In particular, the synchronous communication paradigms often employed in standard middleware do not appear to be particularly suited to ad hoc environments, in which not even the intermittent availability of a backbone network can be assumed. Instead, asynchronous communication seems to be a generally more suitable paradigm for such environments. Message oriented middleware for traditional systems has been developed and used to provide an asynchronous paradigm of communication for distributed systems, and, also for some specific mobile computing systems recently. In this paper, we present our experience in designing, implementing, and evaluating Epidemic Messaging Middleware for Ad hoc networks (EMMA), an adaptation of Java Message Service (JMS) for mobile ad hoc environments, discussing in detail the design challenges and the solutions that have been adopted.
Interaction Pattern Gathering in Service-oriented Applications
Authors: A. M. Silva Filho, H. K. E. Liesenberg, R. S. M. Barros
Venue: Proceedings of the IEEE International Workshop (2005)

Application integration is a challenge and it will continue to be for the next few years. The industry is still figuring out how to best address the challenges of application heterogeneity through modern integration tools and service-oriented and event-driven architectures. We are experiencing a new paradigm shift. However, the impact of service-oriented technology will be evolutionary rather than revolutionary. Companies need to support enterprise service buses and selectively apply business component design practices and Web Services. This paper addresses how interaction patterns in serviceoriented applications can be gathered and discusses related collaboration patterns.
Principles of Timing Anomalies in Superscalar Processors
Authors: Ingomar Wenzel, Raimund Kirner, Peter Puschner, Bernhard Rieder
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

The counter-intuitive timing behavior of certain features in superscalar processors that cause severe problems for existing worst-case execution time analysis (WCET) methods is called timing anomalies. In this paper, we identify structural sources potentially causing timing anomalies in superscalar pipelines. We provide examples for cases where timing anomalies can arise in much simpler hardware architectures than commonly supposed (i.e., even in hardware containing only in-order functional units).We elaborate the general principle behind timing anomalies and propose a general criterion (resource allocation criterion) that provides a necessary (but not suffi- cient) condition for the occurrence of timing anomalies in a processor. This principle allows to state the absence of timing anomalies for a specific combination of hardware and software and thus forms a solid theoretic foundation for the time-predictable execution of real-time software on complex processor hardware.
Disambiguating Nouns, Verbs, and Adjectives Using Automatically Acquired Selectional Preferences
Authors: Diana McCarthy, John Carroll
Venue: Computational Linguistics (2003)

Selectional preferences have been used by word sense disambiguation (WSD) systems as one source of disambiguating information. We evaluate WSD using selectional preferences acquired for English adjective-noun, subject, and direct object grammatical relationships with respect to a standard test corpus. The selectional preferences are specific to verb or adjective classes, rather than individual word forms, so they can be used to disambiguate the co-occurring adjectives and verbs, rather than just the nominal argument heads. We also investigate use of the one-sense-per-discourse heuristic to propagate a sense tag for a word to other occurrences of the same word within the current document in order to increase coverage. Although the preferences perform well in comparison with other unsupervised WSD systems on the same corpus, the results show that for many applications, further knowledge sources would be required to achieve an adequate level of accuracy and coverage. In addition to quantifying performance, we analyze the results to investigate the situations in which the selectional preferences achieve the best precision and in which the one-sense-per-discourse heuristic increases performance.
Inf-sup stable non-conforming finite elements of arbitrary order on triangles
Authors: Gunar Matthies, Lutz Tobiska
Venue: Numerische Mathematik (2005)

We introduce a family of scalar non-conforming finite elements of arbitrary order k&#x2265;1 with respect to the H1-norm on triangles. Their vector-valued version generates together with a discontinuous pressure approximation of order k&#x2212;1 an inf-sup stable finite element pair of order k for the Stokes problem in the energy norm. For k=1 the well-known Crouzeix-Raviart element is recovered.