ppxscal/embedding_network huggingface dataset:
Perturbation Theory for Analytic Matrix Functions: The Semisimple Case
Authors: P. Lancaster, A. S. Markus, F. Zhou
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

The eigenvalue problem for non-self-adjoint, analytic matrix functions of two variables, $L(\lambda,\alpha)$, is examined with emphasis on the case when, at a fixed $\al_0$, $L(\lambda,\alpha_0)$ has a multiple, semisimple eigenvalue $\lambda_0$. New sufficient conditions for analytic dependence of eigenvalue functions, $\lambda(\alpha)$, on $\alpha$ in a neighborhood of $\alpha_0$ are obtained. An algorithm for generating Taylor coefficients of perturbed eigenvalues and eigenvectors is studied and the existence of positive radii of convergence is established. Connections with known results on self-adjoint problems are made.
Mixed ptl/static logic synthesis using genetic algorithms: theory and applications
Authors: Tom Chen
Venue:  (2003)

With the increasing demand of high-performance and high-density VLSI (Very Large Scale Integrated circuits) designs, technology scaling has been meeting the increasing demand and will continue in UDSM (Ultra Deep-SubMicron) regimes. As the complexity of a chip increases almost exponentially as CMOS (Complementary Metal-Oxide Semiconductor) technology scales to under 100 nm, the difficulty of designing VLSI system has increased. Thus, the gap between design productivity and technology capability is increasing. Because of this gap, efficient and practical EDA (Electronic Design Automation) solutions have become more and more relevant in ensuring successful chip designs and time-to-market. Static CMOS logic style has long been used widely to realize a VLSI system because of ease to use and well-developed synthesis methods. With power becomes an increasingly limiting factor in high density and high-performance VLSI designs, a great deal of effort has been made to explore low-power design options without sacrificing performance. Pass-transistor logic (PTL) is being considered as an alternative logic style of static CMOS because static logic consumes a large amount of power due to large short circuit current. Generally, PTL consumes less power than static logic because of its small capacitive load and smaller area. However, PTL only circuits would increase the circuit delay caused by a long transistor chain in series.In this dissertation, a new mixed pass-transistor logic (PTL) and static CMOS logic synthesis method is presented. The main advantage of mixed PTL/Static circuits is that the static CMOS acts as a buffer as well as performs a logic function. The proposed synthesis method searches for possible matches between a logic structure and a set of predefined PTL/Static logic gates using Binary Decision Diagrams (BDDs). This proposed mixed PTL/Static synthesis method also optimizes the final mapped circuits on a global level by using genetic algorithms (GAs). Our experimental results demonstrate that circuits synthesized using our proposed mixed PTL/Static synthesis method outperform their static counterparts in delay or power consumption, or both in various CMOS technologies. The impacts of technology scaling on mixed PTL/Static circuits in terms of performance and power consumption are also examined by means of both theoretical projections and experiments. The projection and experimental results give more evidence that the mixed PTL/Static circuit style is a promising alternative to static and domino circuit styles for high-performance and low-power applications in the future.
Adaptive and Incremental Processing for Distance Join Queries
Authors: Hyoseop Shin, Bongki Moon, Sukho Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

A spatial distance join is a relatively new type of operation introduced for spatial and multimedia database applications. Additional requirements for ranking and stopping cardinality are often combined with the spatial distance join in online query processing or Internet search environments. These requirements pose new challenges as well as opportunities for more efficient processing of spatial distance join queries. In this paper, we first present an efficient k{\hbox{-}}\rm distance join algorithm that uses spatial indexes such as R-trees. Bidirectional node expansion and plane-sweeping techniques are used for fast pruning of distant pairs, and the plane-sweeping is further optimized by novel strategies for selecting a sweeping axis and direction. Furthermore, we propose adaptive multistage algorithms for k{\hbox{-}}{\rm{distance}} join and incremental distance join operations. Our performance study shows that the proposed adaptive multistage algorithms outperform previous work by up to an order of magnitude for both k{\hbox{-}}{\rm{distance}} join and incremental distance join queries, under various operational conditions.
Improving spatial locality of programs via data mining
Authors: Karlton Sequeira, Mohammed Zaki, Boleslaw Szymanski, Christopher Carothers
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this paper, we propose two algorithms, one greedy and the other stochastic, designed for program specific code restructuring as a means of increasing spatial locality within a program. Both algorithms effectively decrease average working set size and hence the page fault rate. Our methods are more effective than traditional approaches due to use of domain information. We illustrate the efficacy of our algorithms on actual data mining algorithms.
Real-Time Update of Eye Features on the 3D Head Model Texture
Authors: Patricio Inostroza
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

In this paper, a real-time tracking/synthesis loop isproposed to animate the eye texture of a 3D head modelby a camera performance. The user's eyes, captured by avideo camera, are tracked by means of a frame-rate pupildetector technique, based on an active illuminationscheme. A small area of interest is selected around eachpupil detected in the video. These areas contain the eyeand eyebrow features. Substituting the captured areas onthe texture of the 3D model, the eyes and eyebrowsanimation is created. To avoid the 'collage' effect, theextracted areas are color-corrected, stretched andblended with the texture.
Sampling and series expansion theorems for fractional Fourier and other transforms
Authors: Çagatay Candan, Haldun M. Ozaktas
Venue: Signal Processing (2003)

We present much briefer and more direct and transparent derivations of some sampling and series expansion relations for fractional Fourier and other transforms. In addition to the fractional Fourier transform, the method can also be applied to the Fresnel, Hartley, and scale transform and other relatives of the Fourier transform.
A parallel algorithm for matrix assembly in mesh-free methods
Authors: Christopher Kern Cartwright
Venue:  (2003)

When solving partial differential equations numerically, the continuous problem is discretized and represented by a system of linear equations. The matrix representation of the discrete problem is built by a process known as data assembly. Finite Element Method (FEM) discretizations are based on a mesh. Data assembly is fairly simple for FEMs, but problems are encountered with discontinuous PDEs and expensive remeshing is required for adaptive FEMs. An alternative to FEMs are a class of Meshfree methods, in which the discretizations are based on nodes. For meshfree Galerkin methods, solutions are constructed using a collection of basis functions. Data assembly in meshfree methods is more complicated than for FEMs, in that sparsity pattern of the matrices involved is not as regular as it is in FEMs, where the (i, j)th entry is nonzero if node i is adjacent to node j. For meshfree methods, the (i, j)th entry is nonzero if nodes i and j lie in the intersection of the supports of the basis functions associated with nodes i and j. This leads to a computational geometry problem which must be solved. We solve the following problem: Given a collection of N sets (d-rectangles or d-spheres) S i and P points xk in Rd compute Ik = {(i, j) | xk &isin; Si &cap; Sj}. We describe a computationally efficient implementation for d = 2 using quadtrees to solve I( k) = {i | xk &isin; Si} from which Ik can easily be produced. The results may be extended to Rd using 2d-trees (for example, octrees for the case d = 3). In this thesis we describe a parallel algorithm for solving this problem. Parallel issues of load balancing and characteristics of the collections of sets and points that are used in applications which have implications for the performance of the algorithm are considered theoretically and also exhibited through numerical examples.
Volume visualization of object interiors
Authors: Ingmar Bitter
Venue:  (2002)

We present work on volume visualization of object interiors. Given sampled data with a segmented region of interest, the task is to efficiently and meaningfully display the density field in the interior of this region. In modern medicine, doctors are faced with this problem during each of their virtual endoscopy procedures, such as virtual bronchoscopy, virtual colonoscopy or virtual examination of blood vessels. Our work provides solutions to this problem that include automatic navigation within the region of interest and that create volume rendered views of the sampled density volume along the way. It is imperative that the views created during a virtual endoscopy are rendered as perspective projections of diagnostic quality. The perspective projection is needed to properly simulate the view of a physical endoscope. We analyze the image quality dependencies on interpolation, classification, sampling rate, and compositing buffer depth. Based on this analysis, we present algorithms and architectures to generate perspective views. The algorithms focus on generating high quality perspective projection images on general-purpose hardware with the optimal number of samples. Our volume rendering architecture supports perspective projection through an incremental slice sweep algorithm. Implemented as special-purpose hardware, it can route and process volumetric data much more efficiently than general-purpose computers and can process multiple data streams in parallel. Therefore, it can achieve much higher frame rates. For complete insight into an objects' interior all of the inner surface has to be visualized through several volume rendered views. This is enabled through our guided navigation paradigm that can smoothly transition between automatic and manual navigation of the virtual camera. For manual navigation we use a distance from boundary field to avoid collisions with the object wall. For automatic navigation we provide distance field based algorithms to compute an object's centerline and/or skeleton and then navigate the camera along the centerline or skeleton. Additionally, the automatic navigation can start anywhere inside the object, not only on the centerline or skeleton. The results of this work have been integrated into a virtual colonoscopy system that many radiologists use daily to facilitate diagnosing colon polyps in thousands of patients.
Validating complex agent behavior
Authors: Scott Andrew Wallace
Venue:  (2003)

Developing software agents that replicate human behavior, even within a narrow domain, is a time consuming and error prone process. The most widely used methodology for designing these agents is based on the complementary processes of knowledge acquisition and validation, both of which have been cited as significant bottlenecks. In this thesis, we identify two methods for comparing actors' behavior that have the potential to decrease the cost of validation. The first is a simple sequence-based approach that can be used to compare many different aspects of two actors' behavior. Although initially promising, our empirical and analytical analysis exposes significant limitations with this general class of approaches, especially as the complexity of the domain increases. As a result, we turn to a novel comparison approach that we call behavior bounding. Unlike the sequential approaches, behavior bounding uses a concise representation of an actor's aggregate behavior as a basis for performing its comparison. We show that behavior bounding requires minimal human effort to use and that its representation of behavior is efficient to construct and maintain even as the complexity of the environment increases. Furthermore, we show that behavior bounding outperforms the sequential comparison approach in two domains of distinct complexity. Finally, we provide empirical evidence that behavior bounding's summary of the differences in two actors' behavior can be used to significantly speed up the knowledge validation process.
Massively Multiplayer Middleware
Authors: Michi Henning
Venue: Queue (2004)

Wish is a multiplayer, online, fantasy role-playing game being developed by Mutable Realms.1 It differs from similar online games in that it allows tens of thousands of players to participate in a single game world (instead of the few hundred players supported by other games). Allowing such a large number of players requires distributing the processing load over a number of machines and raises the problem of choosing an appropriate distribution technology.
Intrusion Sensor Data Fusion in an Intelligent Intrusion Detection System Architecture
Authors: Ambareen Siraj, Rayford B. Vaughn, Susan M. Bridges
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Most modern intrusion detection systems employ multiple intrusion sensors to maximize theirtrustworthiness. The overall security view of the multi-sensor intrusion detection system can serve as an aid to appraise the trustworthiness in the system. This paper presents our research effort in that direction by describing a Decision Engine for an Intelligent Intrusion Detection System (IIDS) that fuses information from different intrusion detection sensors using an artificial intelligence technique. The Decision Engine uses Fuzzy Cognitive Maps (FCMs) and fuzzy rule-bases for causal knowledge acquisition and to support the causal knowledge reasoning process. In this paper, we report on the workings of the Decision Engine that has been successfully embedded into the IIDS architecture being built at the Center for Computer Security Research (CCSR), Mississippi State University.
Real-time halftoning
Authors: Jan Kautz, Hans-Peter Seidel
Venue: Journal of Graphics Tools (2002)

We present a real-time hardware accelerated method for rendering objects using halftoning. It is solely based on texture mapping and creates the impression of a printed image, although the lighting and objects can be changed and manipulated on the fly.
Data mining applications to dermatological diseases, colorectal cancer, diabetes, cardiology and medical audit systems
Authors: Sarabjot Singh Anand
Venue: ACM SIGBIO Newsletter (1998)

Diagnosis of Dermatological DiseasesThis project aims to develop tools that would provide doctors with the ability to discover the typical characteristics of certain inflammatory dermatological diseases. It is hoped that this will aid doctors in accurately diagnosing the dermatological disorder, especially between two skin diseases with very similar characteristics such as psoriasis and atopic dermatitis.Prognostic Models for Colorectal Cancer PatientsThe goal of this project is to build a robust prognostic model that will predict length of survival for patients with colorectal cancer. Techniques employed for this purpose include Neural Networks, Case-based reasoning (CBR), Cox's Regression and Regression Tree Induction. Accomplishments have been the development of point estimates of survival from Cox's regression to allow direct comparison of Artificial Intelligence techniques with Cox's results and the development of techniques for building more perspicuous models that are intuitive to medical practitioners.Pre-empting Complications in Diabetic PatientsData, provided by Data Retrieval in General Practice, is currently being used to discover common trends that appear among diabetic patients. These trends can then be used to predict complications in a diabetic's life cycle. This will allow patients who are not at risk to be filtered out and those who are at risk to be carefully monitored. Data mining techniques such as Sequential Pattern Discovery are being employed for this purpose.Risk Assessment in CardiologyThis project has been investigating the use of case-based reasoning and the incorporation of fuzzy logic to provide insight into the understanding of the underlying mechanisms of coronary heart disease. By identifying patients at risk early on, it is easier to stop the progression of this disease. A series of qualitative and quantitative information was gathered from middle aged men, such as weight, blood pressure, body fat and family medical histories over a three year time span, to help identify which factors contribute to coronary heart disease.Integrating Data Mining into Medical Audit SystemsThe aim of this project is to bring Data Mining into mainstream medical audit by integrating it with Medical statistics techniques already in use. This will encourage the practice of Evidence-based medicine, that is becoming a norm in western societies, providing IT support for it. The motivation behind this project is the realization that current Medical statistics techniques fall short of certain objectives and requirements of medical audit.
Towards Risk Adjusted Controlling of Strategic IS Projects in Banks in the Light of Basel II
Authors: Christian Locher, Jens I. Mehlau, Oliver Wild
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Large-scale information systems (IS) investments of banks have direct impact on operational risk. After the New Basel Accord comes into effect 2006 operational risk may change the regulatory capital of banks. Considering long-term IS investments, one must take into account these effects even now. However, the possibility of integrating these effects in an investment decision depends on both applied investment measurement and Basel II risk quantification approach. The authors introduce a methodology for integrating these aspects into the decision process. Although there are several possible solutions, this paper emphasizes net present value as a controlling method and the loss distribution approach as a possible risk quantification instrument.
In situ plasma diagnostics for chemical vapor deposition of nano-carbon thin film materials
Authors: A. N. Obraztsov, A. A. Zolotukhin, A. O. Ustinov, A. P. Volkov, Yu. Svirko, K. Jefimovs
Venue: Microelectronic Engineering (2003)

We report on the study of nano-carbon film deposition by in situ measuring of the optical emission and electrical parameters of the d.c. discharge in a methane-hydrogen gas mixture. By changing the deposition process parameters over a wide range, we obtain a variety of carbon thin film materials, the structure and composition of which are qualitatively characterized by a number of methods including the Raman and electron microscopy. The obtained results show the presence of H-, H2-, CH-, and C2-activated species in the discharge plasma. These species play a decisive role in the formation of nano-carbon graphite-like films including carbon nanotubes, and in carbon condensation in gas phase. We propose a model that describes the formation of graphitic nanostructured carbon films in the C2-dimers enriched plasma.
Using titles and category names from editor-driven taxonomies for automatic evaluation
Authors: Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury, David Grossman
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Evaluation of IR systems has always been difficult because of the need for manually assessed relevance judgments. The advent of large editor-driven taxonomies on the web opens the door to a new evaluation approach. We use the ODP (Open Directory Project) taxonomy to find sets of pseudo-relevant documents via one of two assumptions: 1) taxonomy entries are relevant to a given query if their editor-entered titles exactly match the query, or 2) all entries in a leaf-level taxonomy category are relevant to a given query if the category title exactly matches the query. We compare and contrast these two methodologies by evaluating six web search engines on a sample from an America Online log of ten million web queries, using MRR measures for the first method and precision-based measures for the second. We show that this technique is stable with respect to the query set selected and correlated with a reasonably large manual evaluation.
An Evaluation of cJava System Architecture
Authors: Anderson Faustino da Silva, Marcelo Lobosco, Claudio Luis de Amorim
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

In this work, we propose a new distributed run-time environment, which we called cJava, that enables multithread Java applications to execute in clusters transparently. Our implementation of cJava supports the distributed shared memory (DSM) which required significant extensions to the original Java virtual machine (JVM). First, a distributed object manager was incorporated to the JVM's memory management subsystem for creating a global object space. Second, synchronized accesses to the global object space were extended so that they could use the lock() and unlock() primitives that cJava's DSM supports. Third, cJava adapted the thread subsystem to enable remote creation and global monitors. Last, a subsystem for remote signaling was added to the original JVM. The main advantage of cJava is that it can execute existing multithread Java applications straightaway. Most importantly, our results of cJava's performance across several benchmarks show that cJava offers an efficient run-time system for executing transparently multithread Java applications in clusters.
Bi-Decomposition of Function Sets in Multiple-Valued Logic for Circuit Design and Data Mining
Authors: Christian Lang, Bernd Steinbach
Venue: Artificial Intelligence Review (2003)

This article presents a theory for the bi-decomposition of functions in multi-valued logic (MVL). MVL functions are applied in logic design of multi-valued circuits and machine learning applications. Bi-decomposition is a method to decompose a function into two decomposition functions that are connected by a two-input operator called gate. Each of the decomposition functions depends on fewer variables than the original function. Recursive bi-decomposition represents a function as a structure of interconnected gates. For logic synthesis, the type of the gate can be chosen so that it has an efficient hardware representation. For machine learning, gates are selected to represent simple and understandable classification rules.Algorithms are presented for non-disjoint bi-decomposition, where the decomposition functions may share variables with each other. Bi-decomposition is discussed for the min- and max-operators. To describe the MVL bi-decomposition theory, the notion of incompletely specified functions is generalized to function intervals. The application of MVL differential calculus leads to particular efficient algorithms. To ensure complete recursive decomposition, separation is introduced as a new concept to simplify non-decomposable functions. Multi-decomposition is presented as an example of separation.The decomposition algorithms are implemented in a decomposition system called YADE. MVL test functions from logic synthesis and machine learning applications are decomposed. The results are compared to other decomposers. It is verified that YADE finds decompositions of superior quality by bi-decomposition of MVL function sets.