Exploring developments in Web based relationship marketing within the hotel industry This paper provides a content analysis study of the application of World Wide Web marketing by the hotel industry . There is a lack of historical perspective on industry related Web marketing applications and this paper attempts to resolve this with a two-year follow-up case study of the changing use of the Web to develop different types of relationships . Specifically , the aims are : -LRB- 1 -RRB- to identify key changes in the way hotels are using the Web ; -LRB- 2 -RRB- to look for evidence of the adoption of a relationship marketing -LRB- RM -RRB- model as a strategy for the development of hotel Web sites and the use of new technologies ; and , -LRB- 3 -RRB- To investigate the use of multimedia in hotel Web sites . The development and strategic exploitation of the Internet has transformed the basis of marketing . Using the evidence from a Web content survey this study reveals the way relationships are being created and managed within the hotel industry by its use of the Web as a marketing tool . The authors have collected evidence by means of a descriptive study on the way hotels build and create relationships with their Web presence delivering multimedia information as well as channel and interactive means of communication . In addition a strategic framework is offered as the means to describe the mechanism and orientation of Web based marketing by hotels . The study utilizes a model by Gilbert -LRB- 1996 -RRB- as a means of developing a measurement instrument to allow a content analysis of the current approach by hotels to the development of Web sites . The results indicate hotels are aware of the new uses of Web technology and are promoting hotel products in the global electronic market in new and sophisticated ways

O O O B I I I O O B I O O O O O O O O O O O B I I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O B O B I I O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O

web based relationship marketing
hotel industry
world wide web marketing
hotel web sites
multimedia
web content survey
global electronic market


A simple graphic approach for observer decomposition Based upon the proposition that the roles of inputs and outputs in a physical system and those in the corresponding output-injection observer do not really have to be consistent , a systematic procedure is developed in this work to properly divide a set of sparse system models and measurement models into a number of independent subsets with the help of a visual aid . Several smaller sub-observers can then be constructed accordingly to replace the original one . The size of each sub-observer may be further reduced by strategically selecting one or more appended states . These techniques are shown to be quite effective in relieving on-line computation load of the output-injection observers and also in identifying detectable sub-systems

O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I

graphic approach
observer decomposition
sparse system models
measurement models
independent subsets
online computation load
detectable subsystems


On the emergence of rules in neural networks A simple associationist neural network learns to factor abstract rules -LRB- i.e. , grammars -RRB- from sequences of arbitrary input symbols by inventing abstract representations that accommodate unseen symbol sets as well as unseen but similar grammars . The neural network is shown to have the ability to transfer grammatical knowledge to both new symbol vocabularies and new grammars . Analysis of the state-space shows that the network learns generalized abstract structures of the input and is not simply memorizing the input strings . These representations are context sensitive , hierarchical , and based on the state variable of the finite-state machines that the neural network has learned . Generalization to new symbol sets or grammars arises from the spatial nature of the internal representations used by the network , allowing new symbol sets to be encoded close to symbol sets that have already been learned in the hidden unit space of the network . The results are counter to the arguments that learning algorithms based on weight adaptation after each exemplar presentation -LRB- such as the long term potentiation found in the mammalian nervous system -RRB- can not in principle extract symbolic knowledge from positive examples as prescribed by prevailing human linguistic theory and evolutionary psychology

O O O O O O O O O O B I I B O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O

associationist neural network
learns
abstract rules
neural network
symbolic knowledge

state-space
cognitive neurosciences
associationist learning


Tracking nonparameterized object contours in video We propose a new method for contour tracking in video . The inverted distance transform of the edge map is used as an edge indicator function for contour detection . Using the concept of topographical distance , the watershed segmentation can be formulated as a minimization . This new viewpoint gives a way to combine the results of the watershed algorithm on different surfaces . In particular , our algorithm determines the contour as a combination of the current edge map and the contour , predicted from the tracking result in the previous frame . We also show that the problem of background clutter can be relaxed by taking the object motion into account . The compensation with object motion allows to detect and remove spurious edges in background . The experimental results confirm the expected advantages of the proposed method over the existing approaches

O B I I O B O O O O O O B I O B O O B I I O O B I O O O O B I I O O O O O O O O B I O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O

contour tracking
nonparameterized object contours
edge indicator function
topographical distance
watershed segmentation
minimization
background clutter
object motion
video
inverted distance transform
edge map

motion analysis
motion estimation
edge detection


Modeling daily realized futures volatility with singular spectrum analysis Using singular spectrum analysis -LRB- SSA -RRB- , we model the realized volatility and logarithmic standard deviations of two important futures return series . The realized volatility and logarithmic standard deviations are constructed following the methodology of Andersen et al. -LSB- J. Am . Stat . Ass . 96 -LRB- 2001 -RRB- 42-55 -RSB- using intra-day transaction data . We find that SSA decomposes the volatility series quite well and effectively captures both the market trend -LRB- accounting for about 34-38 % of the total variance in the series -RRB- and , more importantly , a number of underlying market periodicities . Reliable identification of any periodicities is extremely important for options pricing and risk management and we believe that SSA can be a useful addition to the financial practitioners ' toolbox

O B I I I O B I I O B I I O B O O O O O O O O B I I O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O B I O O O O B O O O O O O O B I O O

daily realized futures volatility
singular spectrum analysis
ssa
logarithmic standard deviations
return series
intraday transaction data
market trend
market periodicities
risk management
options pricing
financial practitioners


Managing system risk Companies are increasingly required to provide assurance that their systems are secure and conform to commercial security standards . Senior business managers are ultimately responsible for the security of their corporate systems and for the implications in the event of a failure . Businesses will be exposed to unquantified security risks unless they have a formal risk management framework in place to enable risks to be identified , evaluated and managed . Failure to assess and manage risks can lead to a business suffering serious financial impacts , commercial embarrassment and fines or sanctions from regulators . This is both a key responsibility and opportunity for Management Services Practitioners

O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

risk management framework
commercial security standards


A comparison of computational color constancy Algorithms . II . Experiments with image data For pt.I see ibid. , vol . 11 , no. 9 , p.972-84 -LRB- 2002 -RRB- . We test a number of the leading computational color constancy algorithms using a comprehensive set of images . These were of 33 different scenes under 11 different sources representative of common illumination conditions . The algorithms studied include two gray world methods , a version of the Retinex method , several variants of Forsyth 's -LRB- 1990 -RRB- gamut-mapping method , Cardei et al. 's -LRB- 2000 -RRB- neural net method , and Finlayson et al. 's color by correlation method -LRB- Finlayson et al. 1997 , 2001 ; Hubel and Finlayson 2000 -RRB- . We discuss a number of issues in applying color constancy ideas to image data , and study in depth the effect of different preprocessing strategies . We compare the performance of the algorithms on image data with their performance on synthesized data . All data used for this study are available online at http://www.cs.sfu.ca/~color/data , and implementations for most of the algorithms are also available -LRB- http://www.cs.sfu.ca/~color/code -RRB- . Experiments with synthesized data -LRB- part one of this paper -RRB- suggested that the methods which emphasize the use of the input data statistics , specifically color by correlation and the neural net algorithm , are potentially the most effective at estimating the chromaticity of the scene illuminant . Unfortunately , we were unable to realize comparable performance on real images . Here exploiting pixel intensity proved to be more beneficial than exploiting the details of image chromaticity statistics , and the three-dimensional -LRB- 3-D -RRB- gamut-mapping algorithms gave the best performance

O O O B I I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O B O O O O O O O O O O O O O O B I O O O O O O B I I O O O O O B I O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O B O O B I O O O O O O O O O O O O B O O O B I O O O O O O O O O O O B O O O O O O O O O O O O O O


Affine invariants of convex polygons In this correspondence , we prove that the affine invariants , for image registration and object recognition , proposed recently by Yang and Cohen -LRB- see ibid. , vol .8 , no. 7 , p.934-46 , July 1999 -RRB- are algebraically dependent . We show how to select an independent and complete set of the invariants . The use of this new set leads to a significant reduction of the computing complexity without decreasing the discrimination power

B I O B I O O O O O O O O B I O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

affine invariants
convex polygons
image registration
object recognition

algebraically dependent. invariants
complexity reduction
convex quadruplet
feature vector


Search for efficient solutions of multi-criterion problems by target-level method The target-level method is considered for solving continuous multi-criterion maximization problems . In the first step , the decision-maker specifies a target-level point -LRB- the desired criterion values -RRB- ; then in the set of vector evaluations we seek points that are closest to the target point in the Chebyshev metric . The vector evaluations obtained in this way are in general weakly efficient . To identify the efficient evaluations , the second step maximizes the sum of the criteria on the set generated in step 1 . We prove the relationship between the evaluations and decisions obtained by the proposed procedure , on the one hand , and the efficient -LRB- weakly efficient -RRB- evaluations and decisions , on the other hand . If the Edgeworth-Pareto hull of the set of vector evaluations is convex , the set of efficient vector evaluations can be approximated by the proposed method

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Design and implementation of a 3-D mapping system for highly irregular shaped objects with application to semiconductor manufacturing The basic technology for a robotic system is developed to automate the packing of polycrystalline silicon nuggets into fragile fused silica crucible in Czochralski -LRB- melt pulling -RRB- semiconductor wafer production . The highly irregular shapes of the nuggets and the packing constraints make this a difficult and challenging task . It requires the delicate manipulation and packing of highly irregular polycrystalline silicon nuggets into a fragile fused silica crucible . For this application , a dual optical 3-D surface mapping system that uses active laser triangulation has been developed and successfully tested . One part of the system measures the geometry profile of a nugget being packed and the other the profile of the nuggets already in the crucible . A resolution of 1 mm with 15-KHz sampling frequency is achieved . Data from the system are used by the packing algorithm , which determines optimal nugget placement . The key contribution is to describe the design and implementation of an efficient and robust 3-D imaging system to map highly irregular shaped objects using conventional components in context of real commercial manufacturing processes

O O O O O B I I O B I I I O O O B I O O O O O B I O O O O O O O B I I O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I I I O O O O O O B I I I I I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O B I I

3d mapping system
highly irregular shaped objects
semiconductor manufacturing
robotic system
polycrystalline silicon nuggets
fragile fused silica crucible
sampling frequency
packing algorithm
commercial manufacturing processes
dual optical 3d surface mapping system
active laser triangulation

czochralski semiconductor wafer production


Binocular model for figure-ground segmentation in translucent and occluding images A Fourier-based solution to the problem of figure-ground segmentation in short baseline binocular image pairs is presented . Each image is modeled as an additive composite of two component images that exhibit a spatial shift due to the binocular parallax . The segmentation is accomplished by decoupling each Fourier component in one of the resultant additive images into its two constituent phasors , allocating each to its appropriate object-specific spectrum , and then reconstructing the foreground and background using the inverse Fourier transform . It is shown that the foreground and background shifts can be computed from the differences of the magnitudes and phases of the Fourier transform of the binocular image pair . While the model is based on translucent objects , it also works with occluding objects

B I O O O O O O B I O O O O O O O O O O B I I I I O O O O O O O O O O O O O O B O O O B I O O O B I O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O B O B O O B I I O O O O O O B O B O O O O O O O O O O O O O O O O O O B I I O O O O O O O B I O O O O O B I

binocular model
occluding images
images
short baseline binocular image pairs
spatial shift
binocular parallax
phasors
foreground
background
inverse fourier transform
binocular image pair
translucent objects
occluding objects

figure-ground segmentation
translucent images
image segmentation
fourier-based solution
component images
fourier component decoupling
object-specific spectrum


Plenoptic image editing This paper presents a new class of interactive image editing operations designed to maintain consistency between multiple images of a physical 3D scene . The distinguishing feature of these operations is that edits to any one image propagate automatically to all other images as if the -LRB- unknown -RRB- 3D scene had itself been modified . The modified scene can then be viewed interactively from any other camera viewpoint and under different scene illuminations . The approach is useful first as a power-assist that enables a user to quickly modify many images by editing just a few , and second as a means for constructing and editing image-based scene representations by manipulating a set of photographs . The approach works by extending operations like image painting , scissoring , and morphing so that they alter a scene 's plenoptic function in a physically-consistent way , thereby affecting scene appearance from all viewpoints simultaneously . A key element in realizing these operations is a new volumetric decomposition technique for reconstructing an scene 's plenoptic function from an incomplete set of camera viewpoints

B I I O O O O O O O B I I I O O O O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B O O B O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O B I O O O O O O O

interactive image editing operations
multiple images
physical 3d scene
modified scene
camera viewpoint
image painting
scissoring
morphing
plenoptic function
volumetric decomposition technique
plenoptic image editing


Who Wants To Be A Millionaire -LRB- R -RRB- : The classroom edition This paper introduces a version of the internationally popular television game show Who Wants To Be A Millionaire -LRB- R -RRB- that has been created for use in the classroom using Microsoft PowerPoint -LRB- R -RRB- . A suggested framework for its classroom use is presented , instructions on operating and editing the classroom version of Who Wants To Be A Millionaire -LRB- R -RRB- are provided , and sample feedback from students who have played the classroom version of Who Wants To Be A Millionaire -LRB- R -RRB- is offered

O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O

who wants to be a millionaire(r)
classroom version
undergraduate business students
student contestants


Diffraction limit for a circular mask with a periodic rectangular apertures array A mask with periodic apertures imaging system is adopted very widely and plays a leading role in modern technology for uses such as pinhole cameras , coded imaging systems , optical information processing , etc. because of its high resolution , its infinite depth of focus , and its usefulness over a broad frequency spectra ranging from visible light to X-rays and gamma rays . While the masks with periodic apertures investigated in the literature are limited only to far-field diffraction , they do not take the shift of apertures within the mask into consideration . Therefore the derivation of the far-field diffraction for a single aperture can not be applied to a mask with periodic apertures . The far-field diffraction formula modified for a multiaperture mask has been proposed in the past , the analysis remains too complicated to offer some practical guidance for mask design . We study a circular mask with periodic rectangular apertures and develop an easier way to interpret it . First , the near-field diffraction intensity of a circular aperture is calculated by means of Lommel 's function . Then the convolution of the circular mask diffraction with periodic rectangular apertures is put together , and we can present a simple mathematical tool to analyze the mask properties including the intensity distribution , blurring aberration , and the criterion of defining the far - or near-field diffraction . This concept can also be expanded to analyze different types of masks with the arbitrarily shaped apertures

B I O O B I O O B I I I O B O B I O O O O O O O O O O O O O O O O O O B I O B I I O B I I O O O O O B I O O B I I I O O O O O O B I I O O B I O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B I O O O O O O B O B I O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I O O B I I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I

diffraction limit
circular mask
periodic rectangular apertures array
pinhole cameras
coded imaging systems
optical information processing
high resolution
infinite depth of focus
broad frequency spectra
visible light
gamma rays
periodic apertures
mask
single aperture
periodic rectangular apertures
convolution
arbitrarily shaped apertures

x rays
far-field diffraction
far-field diffraction formula
multiaperture mask
circular mask diffraction
near-field diffraction


An object-oriented version of SIMLIB -LRB- a simple simulation package -RRB- This paper introduces an object-oriented version of SIMLIB -LRB- an easy-to-understand discrete-event simulation package -RRB- . The object-oriented version is preferable to the original procedural language versions of SIMLIB in that it is easier to understand and teach simulation from an object point of view . A single-server queue simulation is demonstrated using the object-oriented SIMLIB

O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O B

object-oriented version
discrete-event simulation


Optical recognition of three-dimensional objects with scale invariance using a classical convergent correlator We present a real-time method for recognizing three-dimensional -LRB- 3-D -RRB- objects with scale invariance . The 3-D information of the objects is codified in deformed fringe patterns using the Fourier transform profilometry technique and is correlated using a classical convergent correlator . The scale invariance property is achieved using two different approaches : the Mellin radial harmonic decomposition and the logarithmic radial harmonic filter . Thus , the method is invariant for changes in the scale of the 3-D target within a defined interval of scale factors . Experimental results show the utility of the proposed method

B I O O O O B I O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O B I I O O B I I I O O O O O B I I O O B I O O O O O O O O O B I I I O O B I I I O O O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O

fourier transform profilometry technique

3d object recognition
real-time method
3-d information
scale invariance property


Building a better game through dynamic programming : a Flip analysis Flip is a solitaire board game produced by craft woodworkers . We analyze Flip and suggest modifications to the rules to make the game more marketable . In addition to being an interesting application of dynamic programming , this case shows the use of operations research in managerial decision making

O O O O O B I O O B I O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O B I I

dynamic programming
flip analysis
operations research
managerial decision making
solitaire board game
craft woodworkers


Geotensity : combining motion and lighting for 3D surface reconstruction This paper is about automatically reconstructing the full 3D surface of an object observed in motion by a single static camera . Based on the two paradigms , structure from motion and linear intensity subspaces , we introduce the geotensity constraint that governs the relationship between four or more images of a moving object . We show that it is possible in theory to solve for 3D Lambertian surface structure for the case of a single point light source and propose that a solution exists for an arbitrary number point light sources . The surface may or may not be textured . We then give an example of automatic surface reconstruction of a face under a point light source using arbitrary unknown object motion and a single fixed camera

O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I I O O O O O O O O O O O B I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O B I I I O O O O O O O O B I I I I O O O O O O O O O O O O O O O O B I I O O O O O B I I O O O O O O O O O O

full 3d surface
single static camera
linear intensity subspaces
geotensity constraint
3d lambertian surface structure
single point light source
arbitrary number point light sources
automatic surface reconstruction
point light source

linear image subspaces
structure-from-motion


Centroid detection based on optical correlation We propose three correlation-based methods to simultaneously detect the centroids of multiple objects in an input scene . The first method is based on the modulus of the moment function , the second method is based on squaring the moment function , and the third method works with a single intensity filter . These methods are invariant to changes in the position , orientation , and scale of the object and result in good noise-smoothing performance . We use spatial light modulators -LRB- SLMs -RRB- to directly implement the input of the image and filter information for the purpose of these approaches . We present results showing simulations from different approaches and provide comparisons between optical-correlation - and digital-moment-based methods . Experimental results corresponding to an optical correlator using SLMs for the centroid detection are also presented

B I O O B I O O O O O O O O O B O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B O B O O B O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O

optical correlation
centroid detection
centroids
multiple objects
input scene
single intensity filter
position
orientation
scale
spatial light modulators
optical correlator

correlation-based methods
moment function modulus
moment function squaring
noise-smoothing performance
digital-moment-based methods


Block truncation image bit plane coding Block truncation coding -LRB- BTC -RRB- is a successful image compression technique due to its simple and fast computational burden . The bit rate is fixed to 2.0 bits/pixel , whose performance is moderate in terms of compression ratio compared to other compression schemes such as discrete cosine transform -LRB- DCT -RRB- , vector quantization -LRB- VQ -RRB- , wavelet transform coding -LRB- WTC -RRB- , etc. . Two kinds of overheads are required for BTC coding : bit plane and quantization values , respectively . A new technique is presented to reduce the bit plane overhead . Conventional bit plane overhead is 1.0 bits/pixel ; we decrease it to 0.734 bits/pixel while maintaining the same decoded quality as absolute moment BTC -LRB- AMBTC -RRB- does for the `` Lena '' image . Compared to other published bit plane coding strategies , the proposed method outperforms all of the existing methods

O O B I I I B I I O O O O O O B I I O O O O O O O O O O B I O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I I O O B I I O O O O O O O O O O O O O O B I O B I I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O

image bit plane coding
block truncation coding
image compression technique
bit rate
performance
compression ratio
bit plane overhead
decoded quality
absolute moment btc
ambtc
quantization values


One-step digit-set-restricted modified signed-digit adder using an incoherent correlator based on a shared content-addressable memory An efficient one-step digit-set-restricted modified signed-digit -LRB- MSD -RRB- adder based on symbolic substitution is presented . In this technique , carry propagation is avoided by introducing reference digits to restrict the intermediate carry and sum digits to -LCB- 1,0 -RCB- and -LCB- 0,1 -RCB- , respectively . The proposed technique requires significantly fewer minterms and simplifies system complexity compared to the reported one-step MSD addition techniques . An incoherent correlator based on an optoelectronic shared content-addressable memory processor is suggested to perform the addition operation . In this technique , only one set of minterms needs to be stored , independent of the operand length

O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O B I O B I O O O O O O O O O O O O O O O O O B O O B I O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O B O O O O O O O O B I

incoherent correlator
symbolic substitution
reference digits
intermediate carry
sum digits
minterms
system complexity
addition operation
operand length

one-step digit-set-restricted modified signed-digit adder


Scale-invariant segmentation of dynamic contrast-enhanced perfusion MR images with inherent scale selection Selection of the best set of scales is problematic when developing signal-driven approaches for pixel-based image segmentation . Often , different possibly conflicting criteria need to be fulfilled in order to obtain the best trade-off between uncertainty -LRB- variance -RRB- and location accuracy . The optimal set of scales depends on several factors : the noise level present in the image material , the prior distribution of the different types of segments , the class-conditional distributions associated with each type of segment as well as the actual size of the -LRB- connected -RRB- segments . We analyse , theoretically and through experiments , the possibility of using the overall and class-conditional error rates as criteria for selecting the optimal sampling of the linear and morphological scale spaces . It is shown that the overall error rate is optimized by taking the prior class distribution in the image material into account . However , a uniform -LRB- ignorant -RRB- prior distribution ensures constant class-conditional error rates . Consequently , we advocate for a uniform prior class distribution when an uncommitted , scale-invariant segmentation approach is desired . Experiments with a neural net classifier developed for segmentation of dynamic magnetic resonance -LRB- MR -RRB- images , acquired with a paramagnetic tracer , support the theoretical results . Furthermore , the experiments show that the addition of spatial features to the classifier , extracted from the linear or morphological scale spaces , improves the segmentation result compared to a signal-driven approach based solely on the dynamic MR signal . The segmentation results obtained from the two types of features are compared using two novel quality measures that characterize spatial properties of labelled images

O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I I O O O O O O O O O O O O O O O B I O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I

inherent scale selection
noise level
optimal sampling
experiments
neural net classifier
paramagnetic tracer
quality measures
labelled images

dynamic contrast-enhanced perfusion mr images


Optical encoding of color three-dimensional correlation Three-dimensional -LRB- 3D -RRB- correlation of color images , considering the color distribution as the third dimension , has been shown to be useful for color pattern recognition tasks . Nevertheless , 3D correlation can not be directly performed on an optical correlator , that can only process two-dimensional -LRB- 2D -RRB- signals . We propose a method to encode 3D functions onto 2D ones in such a way that the Fourier transform and correlation of these signals , that can be optically performed , encode the 3D Fourier transform and correlation of the 3D signals . The theory for the encoding is given and experimental results obtained in an optical correlator are shown

B I O O O O O O O O O O B I O O O B I O O O O O O O O O O O O B I I I O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O

optical encoding
3d correlation
color images
color distribution
color pattern recognition tasks
optical correlator
fourier transform

color three-dimensional correlation
3d function encoding
3d fourier transform


Self-calibration from image derivatives This study investigates the problem of estimating camera calibration parameters from image motion fields induced by a rigidly moving camera with unknown parameters , where the image formation is modeled with a linear pinhole-camera model . The equations obtained show the flow to be separated into a component due to the translation and the calibration parameters and a component due to the rotation and the calibration parameters . A set of parameters encoding the latter component is linearly related to the flow , and from these parameters the calibration can be determined . However , as for discrete motion , in general it is not possible to decouple image measurements obtained from only two frames into translational and rotational components . Geometrically , the ambiguity takes the form of a part of the rotational component being parallel to the translational component , and thus the scene can be reconstructed only up to a projective transformation . In general , for full calibration at least four successive image frames are necessary , with the 3D rotation changing between the measurements . The geometric analysis gives rise to a direct self-calibration method that avoids computation of optical flow or point correspondences and uses only normal flow measurements . New constraints on the smoothness of the surfaces in view are formulated to relate structure and motion directly to image derivatives , and on the basis of these constraints the transformation of the viewing geometry between consecutive images is estimated . The calibration parameters are then estimated from the rotational components of several flow fields . As the proposed technique neither requires a special set up nor needs exact correspondence it is potentially useful for the calibration of active vision systems which have to acquire knowledge about their intrinsic parameters while they perform other tasks , or as a tool for analyzing image sequences in large video databases

O O O O O O O O O O O B I I O B I I O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O B I O B I I

camera calibration parameters
image motion fields
rigidly moving camera
image formation
calibration parameters
image measurements
rotational components
optical flow
point correspondences
normal flow measurements
active vision systems
image sequences
large video databases

linear pinhole-camera model
translational components
direct self-calibration method
depth distortion


Three-dimensional geometrical optics code for indoor propagation This paper presents a program , GO 3D , for computing the fields of a transmitter in an indoor environment using geometrical optics . The program uses an `` image tree '' data structure to construct the images needed to compute all the rays carrying fields above a preset `` threshold '' value , no matter how many reflections are needed . The paper briefly describes the input file required to define wall construction , the floor plan , the transmitter , and the receiver locations . A case study consisting of a long corridor with a small room on one side is used to demonstrate the features of the GO 3D program

O O O O O B I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O

indoor propagation
wall construction
floor plan
transmitter
receiver locations

three-dimensional geometrical optics
3d geometrical optics code
image tree data structure
image construction
ray tracing
data visualisation


Application of multiprocessor systems for computation of jets The article describes the implementation of methods for numerical solution of gas-dynamic problems on a wide class of multiprocessor systems , conventionally characterized as `` cluster '' systems . A standard data-transfer interface - the so-called message passing interface - is used for parallelization of application algorithms among processors . Simulation of jets escaping into a low-pressure region is chosen as a computational example

O O B I O B I I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O

multiprocessor systems
computation of jets
message passing interface

gas-dynamic problems
cluster systems
data-transfer interface
low-pressure region


Correction to construction of panoramic image mosaics with global and local alignment For original paper see ibid. , vol . 36 , no. 2 , p. 101-30 -LRB- 2000 -RRB- . The authors had given a method for the construction of panoramic image mosaics with global and local alignment . Unfortunately a mistake had led to an incorrect equation which whilst making little difference in many cases , for faster -LRB- and assured -RRB- convergence , the correct formulae given here should be used

O O O O B I I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Effective moving cast shadow detection for monocular color traffic image sequences For an accurate scene analysis using monocular color traffic image sequences , a robust segmentation of moving vehicles from the stationary background is generally required . However , the presence of moving cast shadow may lead to an inaccurate vehicle segmentation , and as a result , may lead to further erroneous scene analysis . We propose an effective method for the detection of moving cast shadow . By observing the characteristics of cast shadow in the luminance , chrominance , gradient density , and geometry domains , a combined probability map , called a shadow confidence score -LRB- SCS -RRB- , is obtained . From the edge map of the input image , each edge pixel is examined to determine whether it belongs to the vehicle region based on its neighboring SCSs . The cast shadow is identified as those regions with high SCSs , which are outside the convex hull of the selected vehicle edge pixels . The proposed method is tested on 100 vehicle images taken under different lighting conditions -LRB- sunny and cloudy -RRB- , viewing angles -LRB- roadside and overhead -RRB- , vehicle sizes -LRB- small , medium , and large -RRB- , and colors -LRB- similar to the road and not -RRB- . The results indicate that an average error rate of around 14 % is obtained while the lowest error rate is around 3 % for large vehicles

B I I I I O B I I I I O O B I I O B I I I I O O B I O B I O O B I O O O O O O O O O B I I O O O O B I I O O O O O O O O O O B I I O O O O O O O O O O B I I O O O O O O B I O O B O B O B I O O B I O O B I I O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O B I I I O O O O O O O O B I O O O B I O B O B O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O

effective moving cast shadow detection
monocular color traffic image sequences
accurate scene analysis
robust segmentation
moving vehicles
stationary background
moving cast shadow
inaccurate vehicle segmentation
erroneous scene analysis
luminance
chrominance
gradient density
geometry domains
combined probability map
shadow confidence score
input image
cast shadow
convex hull
selected vehicle edge pixels
lighting conditions
vehicle images
sunny
cloudy
viewing angles
vehicle sizes
average error rate


Building 3D anatomical scenes on the Web We propose a new service for building user-defined 3D anatomical structures on the Web . The Web server is connected to a database storing more than 1000 3D anatomical models reconstructed from the Visible Human . Users may combine existing models as well as planar oblique slices in order to create their own structured anatomical scenes . Furthermore , they may record sequences of scene construction and visualization actions . These actions enable the server to construct high-quality video animations , downloadable by the user . Professionals and students in anatomy , medicine and related disciplines are invited to use the server and create their own anatomical scenes

O B I I O O O O O O O O O O O O O O O O O O O B I O O O O B O O O O B I I O O O B I O O O O O O O O O B I I O O O O O O B I I O O O O O O O O B I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

3d anatomical scenes
web server
database
3d anatomical models
visible human
planar oblique slices
structured anatomical scenes
visualization
scene construction

world wide web
user-defined 3d anatomical structures
volume visualization
surface reconstruction
applet-based rendering engine
java
high-quality video animation


Inverse problems for a mathematical model of ion exchange in a compressible ion exchanger A mathematical model of ion exchange is considered , allowing for ion exchanger compression in the process of ion exchange . Two inverse problems are investigated for this model , unique solvability is proved , and numerical solution methods are proposed . The efficiency of the proposed methods is demonstrated by a numerical experiment

B I O O B I O B I O O B I I O B I O B I O O O O O B I I O O O O B I O O B I O O O O O O B I O O O O B I I O O O O O O O O O O O O O O O

inverse problems
mathematical model
ion exchange
compressible ion exchanger
ion exchanger compression
unique solvability
numerical solution methods


Restoration of broadband imagery steered with a liquid-crystal optical phased array In many imaging applications , it is highly desirable to replace mechanical beam-steering components -LRB- i.e. , mirrors and gimbals -RRB- with a nonmechanical device . One such device is a nematic liquid crystal optical phased array -LRB- LCOPA -RRB- . An LCOPA can implement a blazed phase grating to steer the incident light . However , when a phase grating is used in a broadband imaging system , two adverse effects can occur . First , dispersion will cause different incident wavelengths arriving at the same angle to be steered to different output angles , causing chromatic aberrations in the image plane . Second , the device will steer energy not only to the first diffraction order , but to others as well . This multiple-order effect results in multiple copies of the scene appearing in the image plane . We describe a digital image restoration technique designed to overcome these degradations . The proposed postprocessing technique is based on a Wiener deconvolution filter . The technique , however , is applicable only to scenes containing objects with approximately constant reflectivities over the spectral region of interest . Experimental results are presented to demonstrate the effectiveness of this technique

O O B I O O O O B I I O O B I O O O O O O O O O O O O O B O B O O O B I O O O O O O B I I I I I O O O O O O O O O B I I O O O O O O O O O O O O O O O O B I I O O O O O O O O O B O O O B I O O O O O O O O O O B I O O B I O O B I O O O O O O O O O O O O B I I O O O O O O O O O O O O B I O O O O O O B I O O O O B I I I O O O O O O O O B I O O O O B I I O O O O O O O O O O O O O O B I I O O B I I I O O O O O O O O O O O O

liquid-crystal optical phased array steering


Computer processing of data on mental impairments during the acute period of concussion The article presents results of computer processing of experimental information obtained from patients during the acute period of concussion . A number of computational procedures are described

B I O O O B I O O B I I I O O O O O B I O O O O O O O O B I I I O O O O B I O O

computer processing
mental impairments
acute period of concussion
computational procedures


The creation of a high-fidelity finite element model of the kidney for use in trauma research A detailed finite element model of the human kidney for trauma research has been created directly from the National Library of Medicine Visible Human Female -LRB- VHF -RRB- Project data set . An image segmentation and organ reconstruction software package has been developed and employed to transform the 2D VHF images into a 3D polygonal representation . Nonuniform rational B-spline -LRB- NURBS -RRB- surfaces were then mapped to the polygonal surfaces , and were finally utilized to create a robust 3D hexahedral finite element mesh within a commercially available meshing software . The model employs a combined viscoelastic and hyperelastic material model to successfully simulate the behaviour of biological soft tissues . The finite element model was then validated for use in biomechanical research

O O O O O O O O O O B O O O B I O O O O O O O O B O B I O O O O O O B I I I O O O O O O O O O O O B I O B I B I O O O O O O O O B I I O O B I I O O O O O B O O O O O O O B I O O O O O O O O O B I I I I O O O O O O O O O O O O O O B I I O O O O O O B I I O O O O O O O O O O O B I

kidney
trauma research
national library of medicine
image segmentation
organ reconstruction
software package
3d polygonal representation
2d vhf images
nurbs
polygonal surfaces
3d hexahedral finite element mesh
hyperelastic material model
biological soft tissues
biomechanical research

high-fidelity finite element model
visible human female project
medical data set
physically based animation
nonuniform rational b-spline surfaces
viscoelastic model


The maximum possible EVPI In this paper we calculate the maximum expected value of perfect information -LRB- EVPI -RRB- for any probability distribution for the states of the world . This maximum EVPI is an upper bound for the EVPI with given probabilities and thus an upper bound for any partial information about the states of the world

O O O O O O O O O O O B I I I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

expected value of perfect information
probability distribution

decision analysis
operations research
management science
optimisation


Choice from a three-element set : some lessons of the 2000 presidential campaign in the United States We consider the behavior of four choice rules - plurality voting , approval voting , Borda count , and self-consistent choice - when applied to choose the best option from a three-element set . It is assumed that the two main options are preferred by a large majority of the voters , while the third option gets a very small number of votes and influences the election outcome only when the two main options receive a close number of votes . When used to rate the main options , Borda count and self-consistent choice contain terms that allow both for the `` strength of preferences '' of the voters and the rating of the main candidates by voters who vote for the third option . In this way , it becomes possible to determine more reliably the winner when plurality voting or approval voting produce close results

O O O O O O O O O O B I I O O O O O O O O O O O O O B I O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O

2000 presidential campaign
plurality voting
approval voting
borda count

three-element set
self-consistent choice


Adaptive filtering for noise reduction in hue saturation intensity color space Even though the hue saturation intensity -LRB- HSI -RRB- color model has been widely used in color image processing and analysis , the conversion formulas from the RGB color model to HSI are nonlinear and complicated in comparison with the conversion formulas of other color models . When an RGB image is degraded by random Gaussian noise , this nonlinearity leads to a nonuniform noise distribution in HSI , making accurate image analysis more difficult . We have analyzed the noise characteristics of the HSI color model and developed an adaptive spatial filtering method to reduce the magnitude of noise and the nonuniformity of noise variance in the HSI color space . With this adaptive filtering method , the filter kernel for each pixel is dynamically adjusted , depending on the values of intensity and saturation . In our experiments we have filtered the saturation and hue components and generated edge maps from color gradients . We have found that by using the adaptive filtering method , the minimum error rate in edge detection improves by approximately 15 %

B I O B I O B I I I I O O O O B B O O O O O O O O O O B I I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I I O O O O B I I O O O O O O O O O O O O O O O O O B I I I O O O O O O O O B O B I O O B I I O O O B I O O O B I O O B O O O O O O O O O B O B O O O O O O O O B O O O O B I I O B I O O O O O O O O B I O O O B I I O B I O O O O O

adaptive filtering
noise reduction
hue saturation intensity color space
color image processing
rgb color model
random gaussian noise
nonuniform noise distribution
accurate image analysis
adaptive spatial filtering method
nonuniformity
noise variance
hsi color space
filter kernel
pixel
saturation
intensity
generated edge maps
color gradients
edge detection
minimum error rate


Innovative phase unwrapping algorithm : hybrid approach We present a novel algorithm based on a hybrid of the global and local treatment of a wrapped map . The proposed algorithm is especially effective for the unwrapping of speckle-coded interferogram contour maps . In contrast to earlier unwrapping algorithms by region , we propose a local discontinuity-restoring criterion to serve as the preprocessor or postprocessor of our hybrid algorithm , which makes the unwrapping by region much easier and more efficient . With this hybrid algorithm , a robust , stable , and especially time effective phase unwrapping can be achieved . Additionally , the criterion and limitation of this hybrid algorithm are fully described . The robustness , stability , and speed of this hybrid algorithm are also studied . The proposed algorithm can be easily upgraded with minor modifications to solve the unwrapping problem of maps with phase inconsistency . Both numerical simulation and experimental applications demonstrate the effectiveness of the proposed algorithm

O B I I O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O B I O O B I O O O O O O O O O O

phase unwrapping algorithm
local treatment
wrapped map
unwrapping algorithms
postprocessor
hybrid algorithm
unwrapping problem
phase inconsistency
numerical simulation

robust stable time effective phase unwrapping


Fully automatic algorithm for region of interest location in camera calibration We present an automatic method for region of interest -LRB- ROI -RRB- location in camera calibration used in computer vision inspection . An intelligent ROI location algorithm based on the Radon transform is developed to automate the calibration process . The algorithm remains robust even if the anchor target has a notable rotation angle in the target plane . This method functions well although the anchor target is not carefully positioned . Several improvement methods are studied to avoid the algorithm 's huge time/space consumption problem . The algorithm runs about 100 times faster if these improvement methods are applied . Using this method fully automatic camera calibration is achieved without human interactive ROI specification . Experiments show that this algorithm can help to calibrate the intrinsic parameters of the zoom lens and the camera parameters quickly and automatically

B I I O O O B I O B I O O O O O O O O O O O O O O B I O O B I I O O O B I I O O O B I O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O B I O O B I O O O

fully automatic algorithm
interest location
camera calibration
computer vision inspection
roi location algorithm
radon transform
calibration process
rotation angle
intrinsic parameters
zoom lens
camera parameters

region of interest location
time/space consumption problem
fully automatic camera calibration
human interactive specification


Efficient two-level image thresholding method based on Bayesian formulation and the maximum entropy principle An efficient method for two-level thresholding is proposed based on the Bayes formula and the maximum entropy principle , in which no assumptions of the image histogram are made . An alternative criterion is derived based on maximizing entropy and used for speeding up the searching algorithm . Five forms of conditional probability distributions-simple , linear , parabola concave , parabola convex , and S-function-are employed and compared to each other for optimal threshold determination . The effect of precision on optimal threshold determination is discussed and a trade-off precision epsilon = 0.001 is selected experimentally . Our experiments demonstrate that the proposed method achieves a significant improvement in speed from 26 to 57 times faster than the exhaustive search method

O O B I O O O B I O O B I I O O O O O O O O O O O O O O O B I I O O O O O O O B I O O O O O O O O O O O B O O O O O O B I O O O O O O O O O O B I O B I O O O O O O O O O O B I I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bayesian formulation
maximum entropy principle
image histogram
entropy
searching algorithm
parabola concave
parabola convex
optimal threshold determination
image thresholding

two-level image thresholding method
conditional probability distributions
s-function
trade-off precision
image segmentation


A generalized PERT/CPM implementation in a spreadsheet This paper describes the implementation of the traditional PERT/CPM algorithm for finding the critical path in a project network in a spreadsheet . The problem is of importance due to the recent shift of attention to using the spreadsheet environment as a vehicle for delivering management science/operations research -LRB- MS/OR -RRB- techniques to end-users

O O O O O O B O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O

generalized pert/cpm implementation
ms/or techniques


Designing and delivering a university course - a process -LRB- or operations -RRB- management perspective With over 30 years of academic experience in both engineering and management faculties , involving trial and error experimentation in teaching as well as reading relevant literature and observing other instructors in action , the author has accumulated a number of ideas , regarding the preparation and delivery of a university course , that should be of interest to other instructors . This should be particularly the case for those individuals who have had little or no teaching experience -LRB- e.g. those whose graduate education was recently completed at research-oriented institutions providing little guidance with respect to teaching -RRB- . A particular perspective is used to convey the ideas , namely one of viewing the preparation and delivery of a course as two major processes that should provide outputs or outcomes that are of value to a number of customers , in particular , students

O O O O O O O O O O O O O B I O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

management perspective
academic experience
management faculties

university course delivery
engineering faculties
search-oriented institutions


Regularization of linear regression problems The study considers robust estimation of linear regression parameters by the regularization method , the pseudoinverse method , and the Bayesian method allowing for correlations and errors in the data . Regularizing algorithms are constructed and their relationship with pseudoinversion , the Bayesian approach , and BLUE is investigated

O O O O O O O O B I O B I I O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O B O O B I O O B O O

robust estimation
linear regression parameters
pseudoinverse method
bayesian method
pseudoinversion
bayesian approach
blue

linear regression problems regularization


Novel denoising algorithm for obtaining a superresolved position estimation We present a new algorithm that uses the randomness of the noise pattern to achieve high positioning accuracy by applying a modified averaging operation . Using the suggested approach , noise sensitivity of the positioning accuracy can be significantly reduced . This new improved algorithm can improve the performances of tracking systems used for military as well as civil applications . The concept is demonstrated theoretically as well as by optical experiment

O B I O O O B I I O O O O O O O O O O O O O O O B I I O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O B I

denoising algorithm
superresolved position estimation
high positioning accuracy
modified averaging operation
noise sensitivity
tracking systems
civil applications
optical experiment

noise pattern randomness
military applications


Hybrid simulation of space plasmas : models with massless fluid representation of electrons . IV . Kelvin-Helmholtz instability For pt.III . see Prikl . Mat . Informatika , MAKS Press , no. 4 , p. 5-56 -LRB- 2000 -RRB- . This is a survey of the literature on hybrid simulation of the Kelvin-Helmholtz instability . We start with a brief review of the theory : the simplest model of the instability - a transition layer in the form of a tangential discontinuity ; compressibility of the medium ; finite size of the velocity shear region ; pressure anisotropy . We then describe the electromagnetic hybrid model -LRB- ions as particles and electrons as a massless fluid -RRB- and the main numerical schemes . We review the studies on two-dimensional and three-dimensional hybrid simulation of the process of particle mixing across the magnetopause shear layer driven by the onset of a Kelvin-Helmholtz instability . The article concludes with a survey of literature on hybrid simulation of the Kelvin-Helmholtz instability in finite-size objects : jets moving across the magnetic field in the middle of the field reversal layer ; interaction between a magnetized plasma flow and a cylindrical plasma source with zero own magnetic field

B I O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I I O O O O B I I O O B I I O O O O O

hybrid simulation
space plasmas
massless fluid representation
transition layer
tangential discontinuity
pressure anisotropy
electromagnetic hybrid model
magnetopause shear layer
field reversal layer
magnetized plasma flow
cylindrical plasma source

kelvin-helmholtz instability
three-dimensional hybrid simulation


Multispectral color image capture using a liquid crystal tunable filter We describe the experimental setup of a multispectral color image acquisition system consisting of a professional monochrome CCD camera and a tunable filter in which the spectral transmittance can be controlled electronically . We perform a spectral characterization of the acquisition system taking into account the acquisition noise . To convert the camera output signals to device-independent color data , two main approaches are proposed and evaluated . One consists in applying regression methods to convert from the K camera outputs to a device-independent color space such as CIEXYZ or CIELAB . Another method is based on a spectral model of the acquisition system . By inverting the model using a principal eigenvector approach , we estimate the spectral reflectance of each pixel of the imaged surface

B I I I O O B I I I O O O O O O O B I I I I O O O O B I I O O B I O O O B I O O O O O O O O B I O O B I O O O O B I O O O O B I I O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O B O B O O O O O O O B I O O B I O O O O O O O B I I O O O O B I O O B O O B I

device-independent color data
independent color space


Estimation of error in curvature computation on multi-scale free-form surfaces A novel technique for multi-scale curvature computation on a free-form 3-D surface is presented . This is achieved by convolving local parametrisations of the surface with 2-D Gaussian filters iteratively . In our technique , semigeodesic coordinates are constructed at each vertex of the mesh . Smoothing results are shown for 3-D surfaces with different shapes indicating that surface noise is eliminated and surface details are removed gradually . A number of evolution properties of 3-D surfaces are described . Next , the surface Gaussian and mean curvature values are estimated accurately at multiple scales which are then mapped to colours and displayed directly on the surface . The performance of the technique when selecting different directions as an arbitrary direction for the geodesic at each vertex are also presented . The results indicate that the error observed for the estimation of Gaussian and mean curvatures is quite low after only one iteration . Furthermore , as the surface is smoothed iteratively , the error is further reduced . The results also show that the estimation error of Gaussian curvature is less than that of mean curvature . Our experiments demonstrate that estimation of smoothed surface curvatures are very accurate and not affected by the arbitrary direction of the first geodesic line when constructing semigeodesic coordinates . Our technique is independent of the underlying triangulation and is also more efficient than volumetric diffusion techniques since 2-D rather than 3-D convolutions are employed . Finally , the method presented here is a generalisation of the Curvature Scale Space method for 2-D contours . The CSS method has outperformed comparable techniques within the MPEG-7 evaluation framework . As a result , it has been selected for inclusion in the MPEG-7 package of standards

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O B I I O O O O O B O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

local parametrisations
2d gaussian filters
surface noise
evolution properties
mean curvature values
semigeodesic coordinates
underlying triangulation
volumetric diffusion techniques
convolutions
curvature scale space method

multi-scale curvature computation
free-form 3d surface
surface gaussian values
mpeg-7 evaluation framework


Two-step integral imaging for orthoscopic three-dimensional imaging with improved viewing resolution We present a two-step integral imaging system to obtain 3-D orthoscopic real images . By adopting a nonstationary micro-optics technique , we demonstrate experimentally the potential usefulness of two-step integral imaging

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

two-step integral imaging
resolution improved viewing
two-step integral imaging system
3-d orthoscopic real images
nonstationary micro-optics technique
3-d image reconstruction
liquid crystal light valve
display device
lclv
pickup lenslet array


Lung metastasis detection and visualization on CT images : a knowledge-based method A solution to the problem of lung metastasis detection on computed tomography -LRB- CT -RRB- scans of the thorax is presented . A knowledge-based top-down approach for image interpretation is used . The method is inspired by the manner in which a radiologist and radiotherapist interpret CT images before radiotherapy is planned . A two-dimensional followed by a three-dimensional analysis is performed . The algorithm first detects the thorax contour , the lungs and the ribs , which further help the detection of metastases . Thus , two types of tumors are detected : nodules and metastases located at the lung extremities . A method to visualize the anatomical structures segmented is also presented . The system was tested on 20 patients -LRB- 988 total images -RRB- from the Oncology Department of La Chaux-de-Fonds Hospital and the results show that the method is reliable as a computer-aided diagnostic tool for clinical purpose in an oncology department

B I I O O O B I O O O O O O O O O O B I I O B I O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O

lung metastasis detection
ct images
computed tomography
oncology
thorax
image interpretation

data visualization
knowledge-based top-down approach
two-dimensional analysis
three-dimensional analysis
computer-aided diagnostic tool
medical imaging
knowledge representation


Iterative regularized least-mean mixed-norm image restoration We develop a regularized mixed-norm image restoration algorithm to deal with various types of noise . A mixed-norm functional is introduced , which combines the least mean square -LRB- LMS -RRB- and the least mean fourth -LRB- LMF -RRB- functionals , as well as a smoothing functional . Two regularization parameters are introduced : one to determine the relative importance of the LMS and LMF functionals , which is a function of the kurtosis , and another to determine the relative importance of the smoothing functional . The two parameters are chosen in such a way that the proposed functional is convex , so that a unique minimizer exists . An iterative algorithm is utilized for obtaining the solution , and its convergence is analyzed . The novelty of the proposed algorithm is that no knowledge of the noise distribution is required , and the relative contributions of the LMS , the LMF , and the smoothing functionals are adjusted based on the partially restored image . Experimental results demonstrate the effectiveness of the proposed algorithm

O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O

noise
smoothing functional
regularization parameters
kurtosis
unique minimizer
iterative algorithm
convergence
partially restored image

iterative regularized least-mean mixed-norm image restoration


Elimination of zero-order diffraction in digital holography A simple method to suppress the zero-order diffraction in the reconstructed image of digital holography is presented . In this method , the Laplacian of a detected hologram is used instead of the hologram itself for numerical reconstruction by computing the discrete Fresnel integral . This method can significantly improve the image quality and give better resolution and higher accuracy of the reconstructed image . The main advantages of this method are its simplicity in experimental requirements and convenience in data processing

O O O O O B I O O O O O O O O O O B I O B I O O O O O O O O B O O B I O O O O O O O O O O O O O B I I O O O O O O O B I O O O O O O B O O B I O O O O O O O O O O O O O O O O B I

reconstructed image
laplacian
detected hologram
discrete fresnel integral
image quality
accuracy
data processing
digital holography

zero-order diffraction suppression
numerical image reconstruction
image resolution
image. processing


Strain contouring using Gabor filters : principle and algorithm Moire interferometry is a powerful technique for high sensitivity in-plane deformation contouring . However , from an engineering viewpoint , the derivatives of displacement , i.e. , strain , are the desired parameter . Thus there is a need to differentiate the displacement field . Optical and digital methods have been proposed for this differentiation . Optical methods provide contours that still need to be quantified , while digital methods suffer from drawbacks inherent in the digital differentiation process . We describe a novel approach of strain segmentation for the moire pattern using a multichannel Gabor filter . Appropriate filter design allows for user-specific segmentation , which is essentially in engineering design and analysis

B I O B I O O O B B I O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O B I O O O O O B O B I O O O O O O O O O O B I O O O O O O O B O O O O O O O O B I O O O O O O B I I O O B I O O O O O O O O O B I O O

strain contouring
gabor filters
algorithm
moire interferometry
displacement
digital methods
optical methods
differentiation
strain segmentation
multichannel gabor filter
filter design
engineering design


Autofocus system for microscope A technique is developed for microscope autofocusing , which is called the eccentric light beam approach with high resolution , wide focusing range , and compact construction . The principle is described . The theoretical formula of the eccentric light beam approach deduced can be applied not only to an object lens whose objective plane is just at the focal plane , but also to an object lens whose objective plane is not at the focal plane . The experimental setup uses a semiconductor laser device as the light source . The laser beam that enters into the microscope is eccentric with the main light axis . A defocused signal is acquired by a symmetrical silicon photocell for the change of the reflected light position caused by differential amplification and processed by a microprocessor . Then the electric signal is power-amplified and drives a dc motor , which moves a fine working platform to an automatic focus of the microscope . The result of the experiments shows a + or-0 .1 - mu m precision of autofocusing for a range of + or-500 - mu m defocusing . The system has high reliability and can meet the requirements of various accurate micro measurement systems

B I O O O O O O O B I O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O B I O B I O O O O O O O O O O O B I O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I I O O B I O O O O B I I O O O O O B I I O O B I O O O O B O O O O O O O O O O B I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I I

autofocus system
microscope autofocusing
eccentric light beam approach
object lens
objective plane
semiconductor laser
main light axis
defocused signal
symmetrical silicon photocell
reflected light position
differential amplification
microprocessor
dc motor
fine working platform
high reliability
micro measurement systems


An inverse problem for a model of a hierarchical structure We consider the inverse problem for the identification of the coefficient in a parabolic equation . The model is applied to describe the functioning of a hierarchical structure ; it is also relevant for heat-conduction theory . Unique solvability of the inverse problem is proved

O B I O O O O O B I O O O B I O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O B I O O B I O O

inverse problem
hierarchical structure
parabolic equation
unique solvability


A survey of interactive mesh-cutting techniques and a new method for implementing generalized interactive mesh cutting using virtual tools In our experience , mesh-cutting methods can be distinguished by how their solutions address the following major issues : definition of the cut path , primitive removal and re-meshing , number of new primitives created , when re-meshing is performed , and representation of the cutting tool . Many researchers have developed schemes for interactive mesh cutting with the goals of reducing the number of new primitives created , creating new primitives with good aspect ratios , avoiding a disconnected mesh structure between primitives in the cut path , and representing the path traversed by the tool as accurately as possible . The goal of this paper is to explain how , by using a very simple framework , one can build a generalized cutting scheme . This method allows for any arbitrary cut to be made within a virtual object , and can simulate cutting surface , layered surface or tetrahedral objects using a virtual scalpel , scissors , or loop cautery tool . This method has been implemented in a real-time , haptic-rate surgical simulation system allowing arbitrary cuts to be made on high-resolution patient-specific models

O O O O O O O O O O O O B I I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

generalized interactive mesh cutting
virtual tools
cutting tool
disconnected mesh structure
virtual object
tetrahedral objects
layered surface

cut path definition
re-meshing
real-time system
haptic-rate surgical simulation system
high-resolution patient-specific models
rendering
haptic interfaces


State-of-the-art in orthopaedic surgical navigation with a focus on medical image modalities This paper presents a review of surgical navigation systems in orthopaedics and categorizes these systems according to the image modalities that are used for the visualization of surgical action . Medical images used to be an essential part of surgical education and documentation as well as diagnosis and operation planning over many years . With the recent introduction of navigation techniques in orthopaedic surgery , a new field of application has been opened . Today surgical navigation systems - also known as image-guided surgery systems - are available for various applications in orthopaedic surgery . They visualize the position and orientation of surgical instruments as graphical overlays onto a medical image of the operated anatomy on a computer monitor . Preoperative image data such as computed tomography scans or intra operatively generated images -LRB- for example , ultrasonic , endoscopic or fluoroscopic images -RRB- are suitable for this purpose . A new category of medical images termed ` surgeon-defined anatomy ' has been developed that exclusively relies upon the usage of navigation technology . Points on the anatomy are digitized interactively by the surgeon and are used to build up an abstract geometrical model of the bony structures to be operated on . This technique may be used when no other image data is available or appropriate for a given application

O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O B I O O O O O O B I I O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O

orthopaedic surgical navigation
medical image modalities
surgical education
surgical instruments
graphical overlays
computer monitor
computed tomography scans
intra operatively generated images
abstract geometrical model
bony structures

surgical action visualization
medical image processing
image-guided surgery systems
surgeon-defined anatomy
image registration


Adaptive digital watermarking using fuzzy logic techniques Digital watermarking has been proposed for copyright protection in our digital society . We propose an adaptive digital watermarking scheme based on the human visual system model and a fuzzy logic technique . The fuzzy logic approach is employed to obtain the different strengths and lengths of a watermark by the local characteristics of the image in our proposed scheme . In our experiments , this scheme provides a more robust and imperceptible watermark

B I I O B I I O O O O O O B I O O B I O O O O B I I O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I

adaptive digital watermarking
fuzzy logic techniques
copyright protection
digital society
human visual system model
local characteristics
imperceptible watermark


Limits for computational electromagnetics codes imposed by computer architecture The algorithmic complexity of the innermost loops that determine the complexity of algorithms in computational electromagnetics -LRB- CEM -RRB- codes are analyzed according to their operation count and the impact of the underlying computer hardware . As memory chips are much slower than arithmetic processors , codes that involve a high data movement compared to the number of arithmetic operations are executed comparatively slower . Hence , matrix-matrix multiplications are much faster than matrix-vector multiplications . It is seen that it is not sufficient to compare only the complexity , but also the actual performance of algorithms to judge on faster execution . Implications involve FDTD loops , LU factorizations , and iterative solvers for dense matrices . Run times on two reference platforms , namely an Athlon 900 MHz and an HP PA 8600 processor , verify the findings

O O B I I O O B I O B I O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O

computational electromagnetics codes
computer architecture
algorithmic complexity
innermost loops
operation count
computer hardware
memory chips
data movement
fdtd loops
lu factorizations
iterative solvers
dense matrices

cem codes
matrix-matrix multiplications
matrix-vector multiplications


Motion estimation using modified dynamic programming A new method for computing precise estimates of the motion vector field of moving objects in a sequence of images is proposed . Correspondence vector-field computation is formulated as a matching optimization problem for multiple dynamic images . The proposed method is a heuristic modification of dynamic programming applied to the 2-D optimization problem . Motion-vector-field estimates using real movie images demonstrate good performance of the algorithm in terms of dynamic motion analysis

B I O B I I O O O O O B I O O B I I O B I O O O O O O O O O O O O O O O B I I O B I I O O O O O O B I O B I O O O O O O O O O O B I I O O O O O B O O O B I I

modified dynamic programming
motion estimation
precise estimates
motion vector field
moving objects
matching optimization problem
multiple dynamic images
heuristic modification
dynamic programming
real movie images
algorithm
dynamic motion analysis

image sequence
vector-field computation
2-d optimization problem
motion vector field estimates


Statistical inference with partial prior information based on a Gauss-type inequality Potter and Anderson -LRB- 1983 -RRB- have developed a Bayesian decision procedure requiring the specification of a class of prior distributions restricted to have a minimal probability content for a given subset of the parameter space . They do not , however , provide a method for the selection of that subset . We show how a generalization of Gauss ' inequality can be used to determine the relevant parameter subset

O O O B I I O O O O O O O O O O O O O O B I I O O O O O O O B I O O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bayesian decision procedure
prior distributions
minimal probability content
parameter space
partial prior information

gauss inequality
prior-to-posterior sensitivity


Modeling the labor market as an evolving institution : model ARTEMIS A stylized French labor market is modeled as an endogenously evolving institution . Boundedly rational firms and individuals strive to decrease the cost or increase utility . The labor market is coordinated by a search process and decentralized setting of hiring standards , but intermediaries can speed up matching . The model reproduces the dynamics of the gross flows and spectacular changes in mobility patterns of some demographic groups when the oil crisis in the 1970 's occurred , notably the sudden decline of the integration in good jobs . The internal labor markets of large firms are shown to increase unemployment if the secondary -LRB- temporary or bad -RRB- jobs do not exist

O O O O O O O O O O O O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O B I O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O

french labor market
endogenously evolving institution
jobs
spectacular changes
mobility patterns
demographic groups

artemis model
simulation model
endogenous intermediary


Who wants to see a $ million error ? Inspired by the popular television show `` Who Wants to Be a Millionaire ? '' , this case discusses the monetary decisions contestants face on a game consisting of 15 increasingly difficult multiple choice questions . Since the game continues as long as a contestant answers correctly , this case , at its core , is one of sequential decision analysis , amenable to analysis via stochastic dynamic programming . The case is also suitable for a course dealing with single decision analysis , allowing for discussion of utility theory and Bayesian probability revision . In developing a story line for the case , the author has sprinkled in much background material on probability and statistics . This material is placed in a historical context , illuminating some of the influential scholars involved in the development of these subjects as well as the birth of operations research and the management sciences

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O

operations research
decision analysis
stochastic dynamic programming
statistics

game theory
educational course
probabilistic models


Fresh tracks -LSB- food processing -RSB- Bar code labels and wireless terminals linked to a centralized database accurately track meat products from receiving to customers for Farmland Foods

O O O B I O B I I O B I O O O O O O O O O O O O O O B I

food processing
bar code labels
wireless terminals
farmland foods

automatic data capture
intermec technologies


Information architecture for bilingual Web sites Creating an information architecture for a bilingual Web site presents particular challenges beyond those that exist for single and multilanguage sites . This article reports work in progress on the development of a content-based bilingual Web site to facilitate the sharing of resources and information between Speech and Language Therapists . The development of the information architecture is based on a combination of two aspects : an abstract structural analysis of existing bilingual Web designs focusing on the presentation of bilingual material , and a bilingual card-sorting activity conducted with potential users . Issues for bilingual developments are discussed , and some observations are made regarding the use of card-sorting activities

B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O

information architecture
language therapists
bilingual developments

content-based bilingual web site
speech therapists
bilingual card-sorting activity
world wide web


Analyzing the potential of a firm : an operations research approach An approach to analyzing the potential of a firm , which is understood as the firm 's ability to provide goods or -LRB- and -RRB- services to be supplied to a marketplace under restrictions imposed by a business environment in which the firm functions , is proposed . The approach is based on using linear inequalities and , generally , mixed variables in modelling this ability for a broad spectrum of industrial , transportation , agricultural , and other types of firms and allows one to formulate problems of analyzing the potential of a firm as linear programming problems or mixed programming problems with linear constraints . This approach generalizes a previous one which was proposed for a more narrow class of models , and allows one to effectively employ a widely available software for solving practical problems of the considered kind , especially for firms described by large scale models of mathematical programming

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

operations research
or
linear inequalities
linear programming
mixed programming
mathematical programming

firm potential analysis
industrial firms
transportation firms
agricultural firms
large-scale models


All-optical XOR gate using semiconductor optical amplifiers without additional input beam The novel design of an all-optical XOR gate by using cross-gain modulation of semiconductor optical amplifiers has been suggested and demonstrated successfully at 10 Gb/s . Boolean AB and AB of the two input signals A and B have been obtained and combined to achieve the all-optical XOR gate . No additional input beam such as a clock signal or continuous wave light is used in this new design , which is required in other all-optical XOR gates

O O O O B I I O O O O O O B O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O

all-optical-xor gate
cross-gain modulation
boolean logic
10 gbit/s


Gifts to a science academic librarian Gifts , by their altruistic nature , perfectly fit into the environment of universities and academic libraries . As a university 's community and general public continue to donate materials , libraries accept donations willingly , both in-kind and monetary . Eight steps of gift processing are listed in the paper . Positive and negative aspects of gift acceptance are discussed . Gifts bring value for academic libraries . Gifts can be considered additional routes to contribute to library collections without direct purchases , options to add money to the library budget , and the cement of social relationships . But , unfortunately , large donations are time-consuming , labor-intensive and costly to process . Great amounts of staff time and processing space are two main negative aspects that cause concern and put the value of gift acceptance under consideration by librarians . Some strategies in handling gifts are recommended . To be effective , academic science librarians need to approach gifts as an investment . Librarians are not to be forced by moral and public notions and should be able to make professional decisions in evaluating proposed collections

O O O B I I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O

science academic librarian
academic libraries
donations
gift processing
library collections
budget
staff time
professional decisions

research libraries
acquisitions
gift books


Trust in online advice Many people are now influenced by the information and advice they find on the Internet , much of it of dubious quality . This article describes two studies concerned with those factors capable of influencing people 's response to online advice . The first study is a qualitative account of a group of house-hunters attempting to find worthwhile information online . The second study describes a survey of more than 2,500 people who had actively sought advice over the Internet . A framework for understanding trust in online advice is proposed in which first impressions are distinguished from more detailed evaluations . Good Web design can influence the first process , but three key factors-source credibility , personalization , and predictability-are shown to predict whether people actually follow the advice given

O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O

internet
survey
web design
personalization

online advice trust
online mortgage advice
source credibility
predictability
e-commerce
house buying advice


Decisions , decisions , decisions : a tale of special collections in the small academic library A case study of a special collections department in a small academic library and how its collections have been acquired and developed over the years is described . It looks at the changes that have occurred in the academic environment and what effect , if any , these changes may have had on the department and how it has adapted to them . It raises questions about development and acquisitions policies and procedures

O O O O O O O O O B I O O B I I O B I O O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O

special collections
small academic library
case study
acquisitions policies


Evaluation of combined dispatching and routeing strategies for a flexible manufacturing system This paper deals with the evaluation of combined dispatching and routeing strategies on the performance of a flexible manufacturing system . Three routeing policies - no alternative routings , alternative routeing dynamics and alternative routeing plans - are considered with four dispatching rules with finite buffer capacity . In addition , the effect of changing part mix ratios is also discussed . The performance measures considered are makespan , average machine utilization , average flow time and average delay at local input buffers . Simulation results indicate that the alternative routings dynamic policy gives the best results in three performance measures except for average delay at local input buffers . Further , the effect of changing part mix ratios is not significant

O O O O O O O O O B I I O O O O O O O O O O O O O O O O O B I I O O O O O O B I O O O O O O O O O O O O O B I O B I I O O O O O O O O B I I O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O

alternative routings
flexible manufacturing system
dispatching rules
finite buffer capacity
part mix ratios
average flow time


Teaching management science with spreadsheets : From decision models to decision support The 1990s were a decade of enormous change for management science -LRB- MS -RRB- educators . While the outlook at the beginning of the decade was somewhat bleak , the renaissance in MS education brought about by the use of spreadsheets as the primary delivery vehicle for quantitative modeling techniques has resulted in a much brighter future . This paper takes inventory of the current state of MS education and suggests some promising new directions in the area of decision support systems for MS educators to consider for the future

O B I O B O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I I O O O O O O O O

management science
ms education
spreadsheets
quantitative modeling
decision support systems


Product and process innovations in the life cycle of an industry Filson -LRB- 2001 -RRB- uses industry-level data on firm numbers , price , quantity and quality along with an equilibrium model of industry evolution to estimate the nature and effects of quality and cost improvements in the personal computer industry and four other new industries . This paper studies the personal computer industry in more detail and shows that the model explains some peculiar patterns that can not be explained by previous life-cycle models . The model estimates are evaluated using historical studies of the evolution of the personal computer industry and patterns that require further model development are described

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

technological change
life-cycle models
industry dynamics
personal computer market
microelectronics
pc industry
production cost


Information architecture : looking ahead It may be a bit strange to consider where the field of information architecture -LRB- IA -RRB- is headed . After all , many would argue that it 's too new to be considered as a field at all , or that it is mislabeled , and by no means is there a widely accepted definition of what information architecture actually is . Practicing information architects probably number in the thousands , and this vibrant group is already building various forms of communal infrastructure , ranging from an IA journal and a self-organizing `` library '' of resources to a passel of local professional groups and degree-granting academic programs . So the profession has achieved a beachhead that will enable it to stabilize and perhaps even grow during these difficult times

B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O

information architecture
information architects
communal infrastructure
local professional groups