Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Selected Works

Algorithms

Discipline
Institution
Publication Year
Publication
File Type

Articles 1 - 30 of 30

Full-Text Articles in Engineering

Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih Jan 2018

Single-Layer Channel Routing And Placement With Single-Sided Nets, Ronald I. Greenberg, Jau-Der Shih

Ronald Greenberg

This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time solutions to all three problems. Such results are implausible if the placement of terminals is entirely unrestricted; in fact, the size of the output for the feasible offset problem may be Ω(n^2). The linear-time …


Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley Jan 2018

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley

Ronald Greenberg

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.


Characterizing Package/Pcb Pdn Interactions From A Full-Wave Finite-Difference Formulation, Shishuang Sun, David Pommerenke, James L. Drewniak, Kai Xiao, Sin-Ting Chen, Tzong-Lin Wu Jul 2016

Characterizing Package/Pcb Pdn Interactions From A Full-Wave Finite-Difference Formulation, Shishuang Sun, David Pommerenke, James L. Drewniak, Kai Xiao, Sin-Ting Chen, Tzong-Lin Wu

James K. Wu, M.D.

A novel approach of equivalent circuit model extraction is developed for modeling of integrated package and PCB power distribution networks (PDN). The integrated PDNs are formulated from a full-wave finite-difference algorithm, and the resulting matrix equations are converted to equivalent circuits. The equivalent circuits, as well as the decoupling capacitors and the attached circuit components, can be analyzed with a SPICE-like solver in both the time and frequency domains. The modeling of dielectric loss is also addressed. The method is used to model three PDN problems including a simple power bus, a BGA package mounting on a PCB, and a …


An Immersed Boundary Geometric Preprocessor For Arbitrarily Complex Terrain And Geometry, Inanc Senocak, Micah Sandusky, Rey Deleon, Derek Wade, Kyle Felzien, Marianna Budnikova Feb 2016

An Immersed Boundary Geometric Preprocessor For Arbitrarily Complex Terrain And Geometry, Inanc Senocak, Micah Sandusky, Rey Deleon, Derek Wade, Kyle Felzien, Marianna Budnikova

Inanc Senocak

There is a growing interest to apply the immersed boundary method to compute wind fields over arbitrarily complex terrain. The computer implementation of an immersed boundary module into an existing flow solver can be accomplished with minor modifications to the rest of the computer program. However, a versatile preprocessor is needed at the first place to extract the essential geometric information pertinent to the immersion of an arbitrarily complex terrain inside a 3D Cartesian mesh. Errors in the geometric information can negatively impact the correct implementation of the immersed boundary method as part of the solution algorithm. Additionally, the distance …


3d Thoracoscopic Ultrasound Volume Measurement Validation In An Ex Vivo And In Vivo Porcine Model Of Lung Tumours, V. Hornblower, E. Yu, A. Fenster, J. Battista, R. Malthaner Jul 2015

3d Thoracoscopic Ultrasound Volume Measurement Validation In An Ex Vivo And In Vivo Porcine Model Of Lung Tumours, V. Hornblower, E. Yu, A. Fenster, J. Battista, R. Malthaner

Richard A. Malthaner

The purpose of this study was to validate the accuracy and reliability of volume measurements obtained using three-dimensional (3D) thoracoscopic ultrasound (US) imaging. Artificial "tumours" were created by injecting a liquid agar mixture into spherical moulds of known volume. Once solidified, the "tumours" were implanted into the lung tissue in both a porcine lung sample ex vivo and a surgical porcine model in vivo. 3D US images were created by mechanically rotating the thoracoscopic ultrasound probe about its long axis while the transducer was maintained in close contact with the tissue. Volume measurements were made by one observer using the …


3d Thoracoscopic Ultrasound Volume Measurement Validation In An Ex Vivo And In Vivo Porcine Model Of Lung Tumours, V. Hornblower, E. Yu, A. Fenster, J. Battista, R. Malthaner Jul 2015

3d Thoracoscopic Ultrasound Volume Measurement Validation In An Ex Vivo And In Vivo Porcine Model Of Lung Tumours, V. Hornblower, E. Yu, A. Fenster, J. Battista, R. Malthaner

Richard A. Malthaner

The purpose of this study was to validate the accuracy and reliability of volume measurements obtained using three-dimensional (3D) thoracoscopic ultrasound (US) imaging. Artificial "tumours" were created by injecting a liquid agar mixture into spherical moulds of known volume. Once solidified, the "tumours" were implanted into the lung tissue in both a porcine lung sample ex vivo and a surgical porcine model in vivo. 3D US images were created by mechanically rotating the thoracoscopic ultrasound probe about its long axis while the transducer was maintained in close contact with the tissue. Volume measurements were made by one observer using the …


Improved And Generalized Learning Strategies For Dynamically Fast And Statistically Robust Evolutionary Algorithms, Yogesh Dashora, Sanjeev Kumar, Nagesh Shukla, M K. Tiwari Apr 2015

Improved And Generalized Learning Strategies For Dynamically Fast And Statistically Robust Evolutionary Algorithms, Yogesh Dashora, Sanjeev Kumar, Nagesh Shukla, M K. Tiwari

Nagesh Shukla

This paper characterizes general optimization problems into four categories based on the solution representation schemes, as they have been the key to the design of various evolutionary algorithms (EAs). Four EAs have been designed for different formulations with the aim of utilizing similar and generalized strategies for all of them. Several modifications to the existing EAs have been proposed and studied. First, a new tradeoff function-based mutation has been proposed that takes advantages of Cauchy, Gaussian, random as well as chaotic mutations. In addition, a generalized learning rule has also been proposed to ensure more thorough and explorative search. A …


Genetic-Algorithms-Based Algorithm Portfolio For Inventory Routing Problem With Stochastic Demand, Nagesh Shukla, M Tiwari, Darek Ceglarek Apr 2015

Genetic-Algorithms-Based Algorithm Portfolio For Inventory Routing Problem With Stochastic Demand, Nagesh Shukla, M Tiwari, Darek Ceglarek

Nagesh Shukla

This paper presents an algorithm portfolio methodology based on evolutionary algorithms to solve complex dynamic optimization problems. These problems are known to have computationally complex objective functions which make their solutions to be computationally hard to find, when problem instances of large dimensions are considered. This is due to the inability of the algorithms to provide optimal or near optimal solution within allocated time interval. Therefore, this paper employs a bundle of evolutionary algorithms (EAs) tied together with several processors, known as algorithm portfolio, to solve a complex optimization problem such as inventory routing problem (IRP) with stochastic demands. EAs …


Application Of Intelligent Sensors In The Integrated Systems Health Monitoring Of A Rocket Test Stand, Ajay Mahajan, Sanjeevi Chitikeshi, Lucas Utterback, Pavan Bandhil, Fernando Figueroa Apr 2015

Application Of Intelligent Sensors In The Integrated Systems Health Monitoring Of A Rocket Test Stand, Ajay Mahajan, Sanjeevi Chitikeshi, Lucas Utterback, Pavan Bandhil, Fernando Figueroa

Dr. Ajay Mahajan

This paper describes the application of intelligent sensors in the Integrated Systems Health Monitoring (ISHM) as applied to a rocket test stand. The development of intelligent sensors is attempted as an integrated system approach, i.e. one treats the sensors as a complete system with its own physical transducer, A/D converters, processing and storage capabilities, software drivers, self-assessment algorithms, communication protocols and evolutionary methodologies that allow them to get better with time. Under a project being undertaken at the NASA Stennis Space Center, an integrated framework is being developed for the intelligent monitoring of smart elements associated with the rocket tests …


A Distributed Particle Filtering Approach For Multiple Acoustic Source Tracking Using An Acoustic Vector Sensor Network Mar 2015

A Distributed Particle Filtering Approach For Multiple Acoustic Source Tracking Using An Acoustic Vector Sensor Network

Faculty of Engineering University of Malaya

Different centralized approaches such as least-squares (LS) and particle filtering (PF) algorithms have been developed to localize an acoustic source by using a distributed acoustic vector sensor (AVS) array. However, such algorithms are either not applicable for multiple sources or rely heavily on sensor-processor communication. In this paper, a distributed unscented PF (DUPF) approach is proposed for multiple acoustic source tracking. At each distributed AVS node, the first-order and the second-order statistics of the local state are estimated by using an unscented information filter (UIF) based PF. The UIF is employed to approximate the optimum importance function due to its …


Proactive Service Migration For Long-Running Byzantine Fault-Tolerant Systems, Wenbing Zhao, H. Zhang Aug 2014

Proactive Service Migration For Long-Running Byzantine Fault-Tolerant Systems, Wenbing Zhao, H. Zhang

Wenbing Zhao

A proactive recovery scheme based on service migration for long-running Byzantine fault-tolerant systems is described. Proactive recovery is an essential method for ensuring the long-term reliability of fault-tolerant systems that are under continuous threats from malicious adversaries. The primary benefit of our proactive recovery scheme is a reduced vulnerability window under normal operation. This is achieved in two ways. First, the time-consuming reboot step is removed from the critical path of proactive recovery. Second, the response time and the service migration latency are continuously profiled and an optimal service migration interval is dynamically determined during runtime based on the observed …


Multiobjective Plan Selection Optimization For Traffic Responsive Control, Montasir M. Abbas, Anuj Sharma Apr 2013

Multiobjective Plan Selection Optimization For Traffic Responsive Control, Montasir M. Abbas, Anuj Sharma

Anuj Sharma

Optimal coordination of traffic signals requires proper activation of timing plans to match current traffic conditions. One of the greatest challenges in configuring a traffic responsive plan selection control mode is how to select only n number of timing plans (restricted by traffic controller memory limitations) to address possibly all traffic conditions/states that can be encountered in the field, for a specific site, but most importantly, how to associate each of these traffic conditions to one of the n timing plans stored in the traffic controller. This paper uses a multiobjective non-dominated sorting genetic algorithm to (1) select the best …


Optimal Area Covering Using Genetic Algorithms, Paulo A. Jimenez, Bijan Shirinzadeh, Ann Nicholson, Gursel Alici Oct 2012

Optimal Area Covering Using Genetic Algorithms, Paulo A. Jimenez, Bijan Shirinzadeh, Ann Nicholson, Gursel Alici

Gursel Alici

Path planning problems involve computing or finding a collision free path between two positions. A special kind of path planning is complete coverage path planning, where a robot sweeps all area of free space in an environment. There are different methods to cover the complete area; however, they are not designed to optimize the process. This paper proposes a novel method of complete coverage path planning based on genetic algorithms. In order to check the viability of this approach the optimal path is tested in a virtual environment. The simulation results confirm the feasibility of this method.


Block-Iterative And String-Averaging Projection Algorithms In Proton Computed Tomography Image Reconstruction, Scott Penfold, Reinhard W. Schulte, Yair Censor, Vladimir Bashkirov, Scott Mcallister, Keith Schubert, Anatoly B. Rosenfeld Sep 2012

Block-Iterative And String-Averaging Projection Algorithms In Proton Computed Tomography Image Reconstruction, Scott Penfold, Reinhard W. Schulte, Yair Censor, Vladimir Bashkirov, Scott Mcallister, Keith Schubert, Anatoly B. Rosenfeld

Anatoly Rozenfeld

Proton therapy is an advantageous form of radiotherapy because it allows for the placement of a high dose peak, the Bragg peak, at any desired depth by modulating proton energy. Currently, proton therapy treatment plans are carried out using data from X-ray CT scans, an imaging modality that generates tomographical maps of scaled photon linear attenuation coefficients, commonly known as Hounsfield units. However, to perform the treatment planning, one requires knowledge of the spatial distribution of electron density within the patient. In clinical practice Hounsfield units are converted to electron densities through an empirically derived relationship generated from measurements with …


An Improved Defect Classification Algorithm For Six Printing Defects And Its Implementation On Real Printed Circuit Board Images, Norrima Mokhtar May 2012

An Improved Defect Classification Algorithm For Six Printing Defects And Its Implementation On Real Printed Circuit Board Images, Norrima Mokhtar

Mokhtar Norrima

Because decisions made by human inspectors often involve subjective judgment, in addition to being intensive and therefore costly, an automated approach for printed circuit board (PCB) inspection is preferred to eliminate subjective discrimination and thus provide fast, quantitative, and dimensional assessments. In this study, defect classification is essential to the identification of defect sources. Therefore, an algorithm for PCB defect classification is presented that consists of well-known conventional operations, including image difference, image subtraction, image addition, counted image comparator, flood-fill, and labeling for the classification of six different defects, namely, missing hole, pinhole, underetch, short-circuit, open-circuit, and mousebite. The defect …


The Semi-Analytic Mode Matching (Samm) Algorithm For Efficient Computation Of Nearfield Scattering In Lossy Ground From Borehole Sources, Ann W. Morgenthaler, He Zhan, Carey M. Rappaport Apr 2012

The Semi-Analytic Mode Matching (Samm) Algorithm For Efficient Computation Of Nearfield Scattering In Lossy Ground From Borehole Sources, Ann W. Morgenthaler, He Zhan, Carey M. Rappaport

Carey Rappaport

The three dimensional semi-analytic mode matching (SAMM) algorithm is used to determine nearfield scattering from underground targets in lossy soil, where the source is a dipole placed within a borehole in the ground. Scattering is described by moderately low-order superpositions of spherical modes placed at multiple user-specified coordinate scattering centers (CSCs), the mode coefficients are found numerically by least-squares fitting all boundary conditions at discrete points along the relevant interfaces while at the same time obeying radiation conditions. SAMM results are compared with a completely different method: the Half-Space Born Approximation (HSBA). Good agreement between methods serves to validate both …


The Semi-Analytic Mode Matching (Samm) Algorithm For Efficient Computation Of Near Field Scattering From Borehole Antennas In Lossy Ground, Ann W. Morgenthaler, He Zhan, Carey M. Rappaport Apr 2012

The Semi-Analytic Mode Matching (Samm) Algorithm For Efficient Computation Of Near Field Scattering From Borehole Antennas In Lossy Ground, Ann W. Morgenthaler, He Zhan, Carey M. Rappaport

Carey Rappaport

The 3D semi-analytic mode matching (SAMM) algorithm is used to determine nearfield scattering from realistic targets buried in lossy, possibly rough soil where the source is a dipole placed within a borehole in the ground. SAMM has been successfully implemented as a forward model for inverse scattering algorithms, and can be used as a GPR design tool which is both cheaper and more efficient than experimentation. SAMM can be (and has been) used for geophysical, medical, and biological applications, including mine detection, pollution detection, microwave tumor detection. Other possible applications that could utilize SAMM are cell structure characterization, wall penetrating …


Hardware Implementation Of Image Space Reconstruction Algorithm Using Fpgas, Javier Morales, Nayda Santiago, Miriam Leeser, Alejandro Fernandez Apr 2012

Hardware Implementation Of Image Space Reconstruction Algorithm Using Fpgas, Javier Morales, Nayda Santiago, Miriam Leeser, Alejandro Fernandez

Miriam Leeser

The Image Space Reconstruction Algorithm (ISRA) has been used in hyperspectral imaging applications to monitor changes in the environment and specifically, changes in coral reef, mangrove, and sand in coastal areas. This algorithm is one of a set of iterative methods used in the hyperspectral imaging area to estimate abundance. However, ISRA is highly computational, making it difficult to obtain results in a timely manner. We present the use of specialized hardware in the implementation of this algorithm, specifically the use of VHDL and FPGAs. The implementation of ISRA algorithm has been divided into hardware and software units. The hardware …


Field Programmable Gate Arrays To Accelerate Sub-Surface Imaging Problems, Miriam Leeser Apr 2012

Field Programmable Gate Arrays To Accelerate Sub-Surface Imaging Problems, Miriam Leeser

Miriam Leeser

No abstract provided.


Phase Unwrapping Using Reconfigurable Hardware, Sherman Braganza, Miriam Leeser, W. C. Warger Ii, C. M. Warner, C. A. Dimarzio Apr 2012

Phase Unwrapping Using Reconfigurable Hardware, Sherman Braganza, Miriam Leeser, W. C. Warger Ii, C. M. Warner, C. A. Dimarzio

Miriam Leeser

The most computationally intensive part of the minimum LP Norm phase unwrapping algorithm[1] (its kernel) is the 2D Discrete Cosine Transform(DCT) that computes the variable p in the equation Qp=c using the Preconditioned Conjugate Gradient (PCG) method. The separability of the DCT means that the 2D transform can be decomposed into a series of 1D DCTS that compute the transforms of the rows followed by the transforms of the columns. Furthermore, the DCT can be expressed in terms of a Fast Fourier Transform (FFT), which allows the hardware implementation to use a pre-designed FFT core. This poster presents a design …


Phase Unwrapping Using Reconfigurable Hardware, Sherman Braganza, Miriam Leeser, W. C. Warger Ii, C. M. Warner, C. A. Dimarzio Apr 2012

Phase Unwrapping Using Reconfigurable Hardware, Sherman Braganza, Miriam Leeser, W. C. Warger Ii, C. M. Warner, C. A. Dimarzio

Charles A. DiMarzio

The most computationally intensive part of the minimum LP Norm phase unwrapping algorithm[1] (its kernel) is the 2D Discrete Cosine Transform(DCT) that computes the variable p in the equation Qp=c using the Preconditioned Conjugate Gradient (PCG) method. The separability of the DCT means that the 2D transform can be decomposed into a series of 1D DCTS that compute the transforms of the rows followed by the transforms of the columns. Furthermore, the DCT can be expressed in terms of a Fast Fourier Transform (FFT), which allows the hardware implementation to use a pre-designed FFT core. This poster presents a design …


Computational Algorithm To Evaluate Product Disassembly Cost Index, Ibrahim Zeid, Surendra M. Gupta Apr 2012

Computational Algorithm To Evaluate Product Disassembly Cost Index, Ibrahim Zeid, Surendra M. Gupta

Ibrahim Zeid

Environmentally conscious manufacturing is an important paradigm in today's engineering practice. Disassembly is a crucial factor in implementing this paradigm. Disassembly allows the reuse and recycling of parts and products that reach their ""death"" after their life cycle ends. There are many questions that must be answered before a disassembly decision can be reached. The most important question is economical. The cost of disassembly versus the cost of scrapping a product is always considered. This paper develops a computational tool that allows decision-makers to calculate the disassembly cost of a product. The tool makes it simple to perform ""what if"" …


Computational Algorithm To Evaluate Product Disassembly Cost Index, Ibrahim Zeid, Surendra M. Gupta Sep 2010

Computational Algorithm To Evaluate Product Disassembly Cost Index, Ibrahim Zeid, Surendra M. Gupta

Surendra M. Gupta

Environmentally conscious manufacturing is an important paradigm in today's engineering practice. Disassembly is a crucial factor in implementing this paradigm. Disassembly allows the reuse and recycling of parts and products that reach their ""death"" after their life cycle ends. There are many questions that must be answered before a disassembly decision can be reached. The most important question is economical. The cost of disassembly versus the cost of scrapping a product is always considered. This paper develops a computational tool that allows decision-makers to calculate the disassembly cost of a product. The tool makes it simple to perform ""what if"" …


A Fully Automated Non-External Marker 4d-Ct Sorting Algorithm Using A Serial Cine Scanning Protocol, Greg Carnes, Stewart Gaede, Edward Yu, Jake Van Dyk, Jerry Battista, Ting-Yim Lee Apr 2009

A Fully Automated Non-External Marker 4d-Ct Sorting Algorithm Using A Serial Cine Scanning Protocol, Greg Carnes, Stewart Gaede, Edward Yu, Jake Van Dyk, Jerry Battista, Ting-Yim Lee

Edward Yu

Current 4D-CT methods require external marker data to retrospectively sort image data and generate CT volumes. In this work we develop an automated 4D-CT sorting algorithm that performs without the aid of data collected from an external respiratory surrogate. The sorting algorithm requires an overlapping cine scan protocol. The overlapping protocol provides a spatial link between couch positions. Beginning with a starting scan position, images from the adjacent scan position (which spatial match the starting scan position) are selected by maximizing the normalized cross correlation (NCC) of the images at the overlapping slice position. The process was continued by 'daisy …


In Vivo Ultrasonic Attenuation Slope Estimates For Detecting Cervical Ripening In Rats: Preliminary Results, Timothy A. Bigelow, Barbara L. Mcfarlin, William D. O'Brien Jr., Michael L. Oelze Mar 2008

In Vivo Ultrasonic Attenuation Slope Estimates For Detecting Cervical Ripening In Rats: Preliminary Results, Timothy A. Bigelow, Barbara L. Mcfarlin, William D. O'Brien Jr., Michael L. Oelze

Timothy A. Bigelow

To effectively postpone preterm birth, cervical ripening needs to be detected and delayed. As the cervix ripens, the spacing between the collagen fibers increases and fills with water, hyaluronan, decorin, and enzymes suggesting that the ultrasonic attenuation of the cervix should decrease. The decrease in ultrasonic attenuation may be detectable, leading to an effective means of detecting cervical ripening. Herein, the traditional attenuation slope-estimation algorithm based on measuring the downshift in center frequency of the ultrasonic backscattered signal with propagation depth was modified and applied to the cervix of rats. The modified algorithm was verified using computer simulations and an …


3d Thoracoscopic Ultrasound Volume Measurement Validation In An Ex Vivo And In Vivo Porcine Model Of Lung Tumours, V. Hornblower, E. Yu, A. Fenster, J. Battista, R. Malthaner Jan 2007

3d Thoracoscopic Ultrasound Volume Measurement Validation In An Ex Vivo And In Vivo Porcine Model Of Lung Tumours, V. Hornblower, E. Yu, A. Fenster, J. Battista, R. Malthaner

Edward Yu

The purpose of this study was to validate the accuracy and reliability of volume measurements obtained using three-dimensional (3D) thoracoscopic ultrasound (US) imaging. Artificial "tumours" were created by injecting a liquid agar mixture into spherical moulds of known volume. Once solidified, the "tumours" were implanted into the lung tissue in both a porcine lung sample ex vivo and a surgical porcine model in vivo. 3D US images were created by mechanically rotating the thoracoscopic ultrasound probe about its long axis while the transducer was maintained in close contact with the tissue. Volume measurements were made by one observer using the …


Velocity Imaging For The Liquid–Gas Interface In The Near Field Of An Atomizing Spray: Proof Of Concept, David L. Sedarsky, Megan E. Paciaroni, Mark A. Linne, James R. Gord, Terrence R. Meyer Mar 2006

Velocity Imaging For The Liquid–Gas Interface In The Near Field Of An Atomizing Spray: Proof Of Concept, David L. Sedarsky, Megan E. Paciaroni, Mark A. Linne, James R. Gord, Terrence R. Meyer

Terrence R Meyer

We describe adaptation of ballistic imaging for the liquid core of an atomizing spray. To describe unambiguously the forces that act to break apart the liquid core in a spray, one must directly measure the force vectors themselves. It would be invaluable, therefore, to obtain velocity and acceleration data at the liquid-gas interface. We employ double-image ballistic imaging to extract velocity information through the application of image analysis algorithms. This method is shown to be effective for liquid phase droplet features within the resolution limit of the imaging system. In light of these results, it is clear that a three- …


Signal Processing Strategies That Improve Performance And Understanding Of The Quantitative Ultrasound Spectral Fit Algorithm, Timothy A. Bigelow, William D. O'Brien Sep 2005

Signal Processing Strategies That Improve Performance And Understanding Of The Quantitative Ultrasound Spectral Fit Algorithm, Timothy A. Bigelow, William D. O'Brien

Timothy A. Bigelow

Quantifying the size of the tissue microstructure using the backscattered power spectrum has had limited success due to frequency-dependent attenuation along the propagation path, thus masking the frequency dependence of the scatterer size. Previously, the SPECTRAL FIT algorithm was developed to solve for total attenuation and scatterer size simultaneously [Bigelow et al., J. Acoust. Soc. Am. 117, 1431-1439 (2005)]. Herein, the outcomes from signal processing strategies on the SPECTRAL FIT algorithm are investigated. The signal processing methods can be grouped into two categories, viz., methods that improve the performance of the algorithm and methods that provide insight. The methods that …


Web Mining For Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis Feb 2003

Web Mining For Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis

Magdalini Eirinaki

Web personalization is the process of customizing a Web site to the needs of specific users, taking advantage of the knowledge acquired from the analysis of the user's navigational behavior (usage data) in correlation with other information collected in the Web context, namely, structure, content, and user profile data. Due to the explosive growth of the Web, the domain of Web personalization has gained great momentum both in the research and commercial areas. In this article we present a survey of the use of Web mining for Web personalization. More specifically, we introduce the modules that comprise a Web personalization …


An O(N) Algorithm For Stokes And Laplace Interactions Of Particles, Ashok S. Sangani, Guobiao Mo Jan 1996

An O(N) Algorithm For Stokes And Laplace Interactions Of Particles, Ashok S. Sangani, Guobiao Mo

Ashok S. Sangani

A method for computing Laplace and Stokes interactions among N spherical particles arbitrarily placed in a unit cell of a periodic array is described. The method is based on an algorithm by Greengard and Rokhlin [J. Comput. Phys. 73, 325 (1987)] for rapidly summing the Laplace interactions among particles by organizing the particles into a number of different groups of varying sizes. The far-field induced by each group of particles is expressed by a multipole expansion technique into an equivalent field with its singularities at the center of the group. The resulting computational effort increases only linearly with N. The …