Large-Scale Optimization of Hierarchical Features for Saliency Prediction in Natural Images
|
|
- Jeffrey Roberts
- 8 years ago
- Views:
Transcription
1 Large-Scae Optimization of Hierarchica Features for Saiency Prediction in Natura Images Eeonora Vig Harvard University Michae Dorr Harvard Medica Schoo David Cox Harvard University Abstract Saiency prediction typicay reies on hand-crafted (mutiscae) features that are combined in different ways to form a master saiency map, which encodes oca image conspicuity. Recent improvements to the state of the art on standard benchmarks such as MIT1003 have been achieved mosty by incrementay adding more and more hand-tuned features (such as car or face detectors) to existing modes [18, 4, 22, 34]. In contrast, we here foow an entirey automatic data-driven approach that performs a arge-scae search for optima features. We identify those instances of a richy-parameterized bio-inspired mode famiy (hierarchica neuromorphic networks) that successfuy predict image saiency. Because of the high dimensionaity of this parameter space, we use automated hyperparameter optimization to efficienty guide the search. The optima bend of such mutiayer features combined with a simpe inear cassifier achieves exceent performance on severa image saiency benchmarks. Our modes outperform the state of the art on MIT1003, on which features and cassifiers are earned. Without additiona training, these modes generaize we to two other image saiency data sets, Toronto and NUSEF, despite their different image content. Finay, our agorithm scores best of a the 23 modes evauated to date on the MIT300 saiency chaenge [16], which uses a hidden test set to faciitate an unbiased comparison. 1. Introduction The visua word surrounding us is astonishingy compex. Yet, humans appear to perceive their environment and navigate in it amost effortessy. One bioogica key strategy to reduce the computationa oad and bandwidth requirements is seective, space-variant attention. Effective attentiona mechanisms guide the gaze of the observer to saient and informative ocations in the visua fied. Mimicking such a seective processing has been the subject of in- Now at Xerox Research Centre Europe. Image Human edn Judd CovSa Figure 1. Saiency prediction exampe from the MIT300 chaenge. Our mode, Ensembe of Deep Networks (edn), comes cosest to human data on this benchmark; aso shown are Judd and CovSa (ranked 2nd and 3rd, respectivey). tense research both in neuroscience [15]andincomputervision, where saiency-based preprocessing has found a wide appicabiity from image/video compression and quaity assessment to object and action recognition. Eary agorithms for saiency prediction typicay foowed the Feature Integration Theory [31] andfusedtogether hand-crafted image features such as orientation, contrast, coor extracted on mutipe scaes. These modes differ in their approach to combine individua feature maps into one master map. Many approaches, incudingthecassicaittiandkoch [14] mode, compute normaized center-surround difference maps of the individua features and combine these using a weighting scheme. A more recent fusion scheme expresses feature conspicuity by the equiibrium distribution of a fuy connected graph [10]. Other approaches defined saiency in terms of information theory, e.g. bysef-information[33], information maximization [5], or discriminant saiency that distinguishes target from nu hypotheses [7]. Recenty, spectrum-based methods demonstrated good performance despite ow computationa compexity [12, 11, 28]. Finay, severa data-driven agorithms have been proposed that use ML techniques to predict saiency. Whie Kienze et a. [19] directyearnedacassifierfromfixated image patches, many authors earned the weights associated with a set of predefined features, e.g. [18, 34, 4]. Recent improvements to the state of the art have been achieved mosty by incrementay adding more and more hand-tuned features to such existing modes [18, 4, 22, 34]. For exampe, state-of-the-art performance on the MIT1003 eye-tracking benchmark is achieved by training a cassifier 1
2 on a combination of a arge variety of both ow-eve and high-eve features, incuding object detectors for cars, faces, persons, and the horizon [18, 4]. More recenty, however, image feature earning has gained momentum in the computer vision community, as aresutoftheapproach ssuperiorperformanceonsevera vision tasks ranging from scene cassification to object and face recognition (e.g.[20, 24, 1]). Inthecontext ofsaiency, first attempts empoyed independent component anaysis to earn V1-ike features [5] forgazeprediction,whereasthe authors in [29] earnedhigh-eveconceptsinanunsuper- vised way from fixated image patches. In this work, we expore the usefuness of such bioinspired hierarchica features to predict where peope ook in natura images. Our approach is structured as foows. We generate a arge number of instances of a richyparameterized bio-inspired hierarchica mode famiy, and seect those that are predictive of image saiency. The combination of severa independent modes shoud improve performance [27], but a brute-force search for the best mixture is computationay prohibitive. Therefore, we use hyperparameter optimization [2, 3] tospeedupthesearch both for individua modes and their combinations and find a discriminative image representation for saiency. We then demonstrate that a simpe inear cassifier that operates on such representation outperforms the state of the art on the MIT1003 benchmark [18]. Moreover, these representations that were earned on MIT1003 generaize we to two other image saiency data sets, Toronto [5] and NUSEF [26], despite their different image content. Additionay, we show that our mode outperforms a 22 agorithms evauated to date on the MIT300 saiency benchmark (see Figure 1 and [16]). Our resuts demonstrate that aricher,automaticay-derivedbaseofhierarchicafeatures can chaenge the state of the art in saiency prediction. In summary, we make severa contributions to the fied. First, we introduce hierarchica feature earning to the area of visua saiency, yieding state-of-the-art resuts on four benchmarks, incuding an independent third-party evauation with a hidden test set. Furthermore, we impemented an automated approach to optimize hierarchica features for saiency prediction, as opposed to a more traditiona use of hand-tuned features. Finay, we make pubicy avaiabe the software to compute our saiency maps at 2. Bio-inspired saiency features We start by reviewing the broad cass of bioogicayinspired visua representations that we use here and present adjustments to this architecture to suit the task at hand. We then outine ways to efficienty search this vast representation space for instances that are particuary discriminative for saiency. We combine these buiding bocks and describe our feature earning pipeine in Section Richy-parameterized mutiayer visua representations Typica saiency features are hand-tuned and have a oose connection to the architecture of bioogica visua systems. To derive more compex, bioogicay more pausibe saiency features, we consider a broad cass of bio-inspired hierarchica modes [24] thathaspreviousybeenshownto exce in various recognition tasks from face verification [24] and identification to object recognition [3]. These modes beong to the more genera cass of convoutiona neura networks [21] and,accordingy,haveahierarchicamuti- ayer structure. Inspired by the organizationa principes in the primate visua cortex, hierarchies are assembed from inear fitering and non-inear transformation stages. More specificay, each network ayer is comprised of asetofoperationsthatcorrespondtobasicmechanisms known to take pace in the visua cortex. These operations are parameterized by a arge number of architectura variabes, hence, are highy configurabe. We can here ony give a very brief overview and refer the reader to [24, 25]for more detais of exact ayer ayout, range of parameters, and ademonstrationoftheeffectivenessofsuchrepresentations in the context of face recognition. The set of operations: 1. Linear fitering by convoution with a bank of random uniform fiters: Fi = N 1 Φ i, where N 1 is the normaized input (mutichanne image or feature map) of ayer, {1, 2, 3}, andφ i,i {1,...,k },is arandomfiter. Thisoperationproducesastackofk feature maps F. Parameters: fiter shapes s f s f,s f {3, 5, 7, 9} and fiter count k {16, 32, 64, 128, 256] 2. Activation with a bounded activation function: A = Activate(F ) such that Activate(x) = γmax γmin x if x>γmax if x<γmin otherwise Parameters: γmin {, 0}, γ max {1, + } 3. Spatia smoothing by pooing over a spatia neighborhood a a : P = Poo(A ) such that ( ) P p = Downsampe α (A ) p 1 a a (2) Parameters: a {3, 5, 7, 9}, exponent p {1, 2, 10}, α downsamping factor 4. Loca normaization by the activity of neighbors across space (b b neighborhood) and feature maps k : N = Normaize(P ) such that N = { C Ĉ 2 ρ C if ρ Ĉ 2 > τ otherwise (1) (3)
3 where C = P δ ˆP with δ {0, 1} controing whether or not the oca mean ˆP is subtracted, and Ĉ = C 1 b b k Parameters: ρ stretching param., τ threshod, δ, b Any individua instantiation of this famiy of visua representations can contain an arbitrary number of ayers that are stacked on top of each other. To constrain the computationa compexity, we here consider ony one- to three-ayer (L1 L3) feature extractors (aso caed modes ). In the foowing, we describe our changes to generaize this architecture to the task of saiency prediction. A major difference of this work is reated to the genera purpose of these features. The origina approach aimed at obtaining a compact, fixed-size representation of an image that can then be fed into cassifiers for a singe, goba decision (e.g. faceidentity).incontrast,hereweseekocaized representations of images. We keep the input image at high resoution and abe individua pixes of the output feature map by their saiency. Furthermore, the modes in [24] were imited to grayscae input. Because of the importance of coor in determining the saiency of a region we extend the modes to mutispectra input. Additionay, we aso consider the YUV coor space, which provides decorreated uminance and chrominance channes (simiar to the coor space empoyed by the human visua system). YUV has been shown to give better resuts than RGB for saiency prediction (e.g. [28]). In addition to evauating individua modes, we augment our feature set by representation bending. Bycombining together mutipe good representations one can take advantage of the structura diversity of the individua modes in the bend. Such bending strategies have been shown to significanty boost performance [27, 24] Guided search for optima saiency features The guiding principe in the architectura design of the above mode famiy was configurabiity. To aow for a great variety of feed-forward architectures, the mode cass is richy parameterized. Depending on the number of ayers, modes have up to 43 architectura parameters (see Sec. 2.1). The performance of any singe mode instantiation may range from chance to state-of-the-art performance depending on parameter configurations. To find good representations for a specific task, we perform a arge-scae search over the space of a possibe mode candidates, which are cross-vaidated on a separate screening set. In principe, modes can be drawn entirey randomy. Indeed, random search was found to be an effective approach to search for particuary discriminative representations for recognition tasks [24]. However, for arge enough probems, random search is sti prohibitivey computationay expensive. For exampe, in [24], good representations were found ony after an exhaustive search of amost 13,000 modes. Therefore, the mode search shoud not be random but guided towards better regions of the parameter space. Recenty, automated hyperparameter optimization [2, 3] was proposed to use Bayesian optimization methods to guide search in a arge parameter space. In an object recognition scenario, these optimization agorithms achieved the same resuts as an exhaustive random search agorithm, in a fraction of the time required by random search [3]. Here, we use the pubicy avaiabe toobox of Bergstra et a. [3] to more efficienty search the vast bioinspired mode space for optima saiency features. This method invoves defining (i) a search space (as an expression graph) and (ii) a oss function to be minimized. In addition to a description of the bio-inspired mode cass, the search space aso contains the hyperparameters of cassifiers, such as the strength of reguarization. The oss function we use is defined in the next section Feature earning pipeine To evauate the performance of our bioogicay-inspired representations, we foow the standard saiency earning pipeine of Judd et a. [18]. This offers a standardized way to evauate new features and makes our approach directy comparabe with the baseine method of [18]. Saiency prediction is formaized as a supervised earning probem. A training set of saient (i.e.thepositivecass) and non-saient (negative cass) image regions is obtained from ground-truth empirica saiency maps (aso caed fixation density maps) derived from rea eye movement data. For each image in the training set, we randomy pick 10 saient sampes from the top 20% saient regions and 10 non-saient sampes from the bottom 70% saient areas of the empirica saiency map. At these seected ocations, features are extracted from the image and normaized (over the entire training set) to zero mean and unit variance. Finay, the abeed feature vectors are fed into an L2-reguarized, inear, L2-oss SVM, which is trained to predict for each ocation in a new test image its probabiity of fixation (see Fig. 2). To search for good representations for saiency prediction, we consider a subset of 600 images of the MIT1003 eye movement data set [18], and perform mode search on this set. To estimate the prediction error, we perform 6- fod cross-vaidation. In the testing phase, we consider the continuous output w T x + b of the SVM. By threshoding these continuous saiency maps, image regions above the threshod are cassified as saient. A systematic variation of the threshod eads to an ROC curve; the oss function to be minimized by the hyperparameter optimization agorithm (Sec. 2.2)isthen1-AUC(i.e.theAreaUndertheROC Curve). Note that both the architectura and earning parameters (parameter C of the inear SVM) were tuned simuta-
4 Test images Fixation map L3 Feature extraction TESTING TRAINING Optima bend of L1, L2, L3 features: Train images Normaize Labeed feature vectors L1 Normaize 1 Linear SVM... L2 Normaize edn saiency map Figure 2. Schematic diagram of our pipeine. Good Li mutiayer feature extractors are found by guided hyperparameter search (not shown) and combined into an optima bend. Resuting feature vectors are abeed with empirica gaze data and fed into a inear SVM. For detais on operations inside each i ayer see Sec neousy by hyperparameter optimization. To identify those instances (or combinations thereof) of the above described bio-inspired mode famiy that successfuy predict image saiency, we adopt a two-step search procedure. First, we search for we-performing individua L1, L2, and L3 modes, keep these and perform another search for optima combinations of these seected modes. Our fina saiency mode is an ensembe of individua modes, hence the name Ensembe of Deep Networks (edn). In the first screening stage, we independenty screened approximatey 2000 L1, 2200 L2, and 2800 L3 modes on RGB input. For the sake of comparison, a fraction of these modes was screened with random search ( 1200 L2 and 2400 L3 modes) and the rest with the more efficient guided search (Sec. 2.2). We partiay rey on random search, because the best configurations returned by this type of search tend to be ess correated than those found by guided search. The rationae is that a greater diversity in individua modes may have a positive effect on the performance of mode bends. In addition, we separatey screened about 1900 L1, 1700 L2, and 1900 L3 modes on YUV input. Of these, about 600 L3 modes were drawn randomy. In the second search stage, we seected 5 to 10 topperforming modes from each mode cass (a cass being defined by the number of ayers, the input coor space, and the type of screening), and screened unconstrained combinations of up to 8 of these modes. The best ensembe was found after around 1000 trias and consists of 6 architecturay diverse modes: three L3-RGB modes found with random search, and one L2-YUV and two L3-YUV modes found with guided search. We note that other combinations, incuding those with L1 modes, were aso found among top-performing resuts. Fig. 3 shows exampe outputs of individua modes and the optima bend. The entire screening was performed on a arge CPU custer and took approximatey 1 week. Figure 3. Output of best individua L1, L2, L3 (YUV) modes and the optima bend. Left to right, top: input, histogram-matched edn saiency map (bend of 6 Li modes), human saiency map; Midde: raw L1, L2, and L3 output; Bottom: L1, L2, L3 output histogram-matched to the human saiency map. Whie L1 modes detect edges, L2 and L3 capture higher-order structures Center bias and smoothness Severa studies have pointed out that gaze is biased to the image center (often irrespective of the center features). More and more modes expicity incorporate this bias (e.g. [17, 32]). We foow [18] and extend our earned features with a simpe 1-D measure of the distance of each pixe to the image center. Because some reference modes do not account for this bias, for a fair comparison, we incorporate the same distance-to-center feature in these modes as we. In addition, we report resuts aso without this center feature. However, it shoud be noted that some agorithms aready have an impicit center bias due to border effects. As a fina step, saiency maps are often smoothed to bet-
5 ter match the distribution of eye movements [17]. We determine the optima Gaussian bur eve (σ=30px) through cross-vaidation on a subset of the training set. 3. Evauation: eye movement prediction Because of the tight ink between saiency, attention, and eye movements, saiency modes are typicay evauated in terms of how we they predict human gaze in natura scenes. We foow the same approach here Data sets Feature search and performance evauation were conducted on the MIT1003 [18] dataset. Totestthegenera- izabiity of the mode, we use three additiona benchmarks, Toronto [5], NUSEF [26], and MIT300 [16]. The MIT1003 data set [18] consistsof1003imagesand the eye movement data of 15 observers who free-viewed these images. Because the feature search stage used 600 of these images for training, the remaining 403 served as test images. The Toronto benchmark [5] containseyemovement data from 20 subjects watching 120 images. It is considered a hard data set due to the ack of particuary saient regions (such as faces/peope). The recenty proposed NUSEF [26] ismadeupof758semanticay-rich images incuding affective content (expressive faces, nudes, unpeasant concepts). A tota of 75 observers viewed parts of the image set. We here ony consider the pubicy avaiabe part (441 images). Finay, for an independent evauation, we submitted our mode for third-party evauation on the MIT300 saiency benchmark [16]. This set consists of 300 images viewed by 39 observers whose gaze data is not pubic. To date, 23 saiency modes have been evauated on this patform Evauation protoco We foow the evauation procedure outined in Sec In addition to ROC anaysis, for the sake of comprehensiveness, we consider three other common evauation metrics: the Earth Mover s Distance (EMD, in the context of saiency see [34]), Normaized Scanpath Saiency (NSS) [23], and a simiarity score [17]. As reference for comparisons, we consider 11 stateof-the-art saiency agorithms: GBVS [10], the mutiscae quaternion DCT signature on YUV input (denoted QDCT) [28], Judd [18], AWS [8], CovSa [6] (withco- variances + means), Tavakoi [30], AIM [5], Goferman [9], ICL [13], Image Signature (with LAB coor space) [11], and Boost [4], a with defaut parameters. This seection is based on the top-performing modes from two recent and comprehensive reviews/taxonomies [4, 16]. To estimate the effective performance range, we used two contro measures. First, we computed eave-one-sub- Mode RGB YUV L L L edn Tabe 1. AUC scores of best individua modes and the optima ensembe of top modes on MIT1003. Performance increases with mode compexity (i.e. # ayers) and the use of YUV. The optima ensembe of Deep Networks (aso found through automated screening) gives highest performance. No center bias at this point. ject-out empirica saiency maps and used these to predict the eye movements of the eft-out viewer. Since peope are sti the best predictors of where other peope ook, this measure constitutes an upper bound for prediction. Our ower bound comes from the above-mentioned center bias (e.g. [32]): a simpe measure based on the distance of each pixe to the image center predicts eye movements we Resuts on the MIT1003 benchmark First, we anayzed individua mode performance by systematicay varying two meta-parameters: the number of ayers in each mode (1, 2, or 3) and the input coor space (RGB or YUV). Performance (AUC) of the best cassspecific modes is shown in Tabe 1. Consistent with expectations, performance increases with mode compexity (L1 < L2 < L3), i.e. modes with more ayers achieve higher invariance. Confirming previous findings, use of the YUV coor space gives significanty higher prediction performance than RGB. For the choice of the search agorithm, guided search not ony is more efficient than random search (360 iterations give better resuts than 2400 w/o guidance) but aso exceeds the best random search performance. The most significant performance boost is achieved with ensembes of mutipe good representations (see Tabe 1, edn). In contrast to [25], however, bends are not imited to the combination of the top modes, but derived again in an automated fashion through guided screening. Bending is so beneficia because combinations take advantage of the diversity of individua modes. This expains why individuay weaker modes (such as L3-RGB or L2-YUV) are aso represented in the best bend. One aspect of diversity is the scae on which individua modes operate. From the combination of mutipe modes tuned to different scaes, a mutiscae mode emerges. Performance of the various saiency agorithms (baseines, contros, and our best bend) is summarized as averages over a MIT1003 test images in the top part of Tabe 2. edn outperforms a individua saiency agorithms for a four metrics. A sma further performance gain (for AUC and EMD) can ony be achieved by Boosting [4], i.e. optimay bending many top-performing agorithms from this
6 MIT1003 Toronto Nusef AUC EMD sim NSS w/ C w/o C w/ C w/o C w/ C w/o C w/ C w/o C Chance Cntr QDCT ICL CovSa Signature GBVS Tavakoi Goferman AIM Judd AWS edn Boost Boost+eDN Human Chance Cntr CovSa ICL Signature GBVS QDCT Goferman Tavakoi AIM Judd AWS edn Boost Boost+eDN Human Chance QDCT Cntr Tavakoi ICL GBVS Signature CovSa Goferman Judd AIM AWS edn Human Tabe 2. Performance of saiency agorithms with (w/ C) and without (w/o C) center bias on the MIT1003, Toronto, and NUSEF benchmarks for four metrics: AUC, simiarity (sim), Normaized Scanpath Saiency (NSS) (the higher the better for a three) and EMD (ower better). Feature search ony used AUC as objective function. edn outperforms individua modes on MIT1003, on which features and cassifier are earned. A sma further improvement can ony be achieved by bending mutipe individua top-performing agorithms (see Boost [4] and Boost+eDN). edn generaizes we to Toronto and NUSEF, despite their different image content. Sma border artifacts (due to repeated fitering) make edn inherenty biased to the center hence the performance advantage in w/o C case.
7 tabe (Judd [18], GBVS [10], AWS [8] and Torraba). We aso note that Boosting resuts get better with incusion of edn features, e.g AUCforMIT1003(seeTabe2). Many image processing steps used in saiency computations introduce border artifacts (see [33]foradetaiedanaysis of severa agorithms). Because of repeated fitering across mutipe ayers, our saiency maps suffer from some border effects as we. Hence, simiary to GBVS, even our non-centered maps ( w/o C in Tabe 2) are sti impicity biased to the center and have a performance advantage. Exampe saiency maps for our agorithm and some reference methods are shown in Fig Generaization to other data sets To assess how we our earned features generaize to other data sets, we first evauated them on the Toronto and NUSEF benchmarks. Resuts are shown in Tabe 2 (ower part). Despite being trained on a different data set, edn outperforms the state-of-the-art approaches. This is surprising, considering the significant database-specific differences in image content. NUSEF was deiberatey created to investigate semantics-driven attention to affective content. Conversey, Toronto acks particuar regions of interest (peope, faces), so that gaze is ess coherent across viewers. Finay, on the MIT300 saiency benchmark, our mode achieves AUC ( simiarity and EMD), sighty better than the second best mode of Judd et a. with AUC (0.506 simiarity and 3.13 EMD) see [16]. 4. Discussion and concusion Hierarchica feature earning has become a common approach in computer vision, but has not been adequatey expored in the context of saiency prediction. Here, we addressed this issue and efficienty searched a arge poo of richy parameterized neuromorphic modes for those representations that are discriminative for saiency. Through automated representation bending, we assembed powerfu combinations of diverse mutiayer architectures that outperform the state of the art. In notabe contrast to topperforming hand-tuned modes, our approach makes no assumptions about what ower-eve features (coor, contrast, etc.) or higher-eve concepts (faces, cars, text, horizon) attract the eyes. Instead, we aow the hierarchica modes to earn such compex patterns from gaze-abeed natura images (e.g. seetoprowinfigure4). We beieve our integrated and bioogicay-pausibe approach is therefore conceptuay ceaner and more generic than approaches that rey on domain-specific hand-crafted features. Athough trained ony on part of the MIT1003 benchmark, our representations generaize we to three other eye movement data sets, in spite of their different image content. Despite the arge size of the mode space (i.e. the mode famiy is as incusive as possibe), good candidates are found quicky (within a coupe of hundred trias) through nove hyperparameter optimization agorithms. Our resuts show that methods empoying rich, automaticay-derived feedforward representations can chaenge the state of the art in the fied of saiency prediction. Acknowedgments. This work was supported by the Nationa Science Foundation (IIS ) and a gift from Inte Corporation. Eeonora Vig was supported by a feowship within the Postdoc-Programme of the German Academic Exchange Service (DAAD, D/11/41189). References [1] Y. Bengio, A. Courvie, and P. Vincent. Representation earning: A review and new perspectives. arxiv preprint arxiv: , [2] J. Bergstra, R. Bardenet, Y. Bengio, and B. Kég. Agorithms for hyper-parameter optimization. In NIPS 25, , 3 [3] J. Bergstra, D. Yamins, and D. Cox. Making a science of mode search: Hyperparameter optimization in hundreds of dimensions for vision architectures. In ICML,2013.2, 3 [4] A. Borji. Boosting bottom-up and top-down visua features for saiency estimation. In CVPR,2012.1, 2, 5, 6 [5] N. Bruce and J. Tsotsos. Saiency based on information maximization. In NIPS 18,pages , 2, 5 [6] E. Erdem and A. Erdem. Visua saiency estimation by nonineary integrating features using region covariances. Journa of vision,13(4), [7] D. Gao and N. Vasconceos. Bottom-up saiency is a discriminant process. In ICCV,pages1 6, [8] A. Garcia-Diaz, X. R. Fdez-Vida, X. M. Pardo, and R. Dosi. Decorreation and distinctiveness provide with human-ike saiency. In Advanced Concepts for Inteigent Vision Systems,pages ,2009.5, 7 [9] S. Goferman, L. Zenik-Manor, and A. Ta. Context-aware saiency detection. PAMI, 34(10): , [10] J. Hare, C. Koch, and P. Perona. Graph-based visua saiency. In NIPS 19,pages ,2007.1, 5, 7 [11] X. Hou, J. Hare, and C. Koch. Image signature: Highighting sparse saient regions. PAMI,34(1),2012.1, 5 [12] X. Hou and L. Zhang. Saiency detection: A spectra residua approach. In CVPR,pages1 8, [13] X. Hou and L. Zhang. Dynamic visua attention: Searching for coding ength increments. In NIPS, [14] L. Itti, C. Koch, and E. Niebur. A mode of saiencybased visua attention for rapid scene anaysis. IEEE PAMI, 20(11): , [15] L. Itti, G. Rees, and J. K. Tsotsos, editors. Neurobioogy of Attention. Esevier, San Diego, CA, [16] T. Judd, F. Durand, and A. Torraba. MIT saiency benchmark. 1, 2, 5, 7
8 Image Human edn Judd GBVS Boost AWS AIM Figure 4. Sampe images from MIT1003 [18] with ground truth (Human), proposed (edn) and reference saiency maps. Saiency maps were histogram-matched to the corresponding fixation density map for visuaization. edn maps are more consistent with human maps. [17] T. Judd, F. Durand, and A. Torraba. A benchmark of computationa modes of saiency to predict human fixations. MIT tech report,2012.4, 5 [18] T. Judd, K. Ehinger, F. Durand, and A. Torraba. Learning to predict where humans ook. In ICCV, pages , , 2, 3, 4, 5, 7, 8 [19] W. Kienze, F. A. Wichmann, B. Schökopf, and M. O. Franz. A Nonparametric Approach to Bottom-Up Visua Saiency. In NIPS,pages , [20] A. Krizhevsky, I. Sutskever, and G. Hinton. Imagenet cassification with deep convoutiona neura networks. In NIPS 25, pages , [21] Y. LeCun and Y. Bengio. Convoutiona networks for images, speech, and time series. The handbook of brain theory and neura networks,3361, [22] Y. Lu, W. Zhang, C. Jin, and S. Xue. Learning attention map from images. In CVPR,pages , [23] R. J. Peters, A. Iyer, L. Itti, and C. Koch. Components of bottom-up gaze aocation in natura images. Vision research, 45(18): , [24] N. Pinto and D. D. Cox. Beyond Simpe Features: A Large-Scae Feature Search Approach to Unconstrained Face Recognition. IEEE Automated Face and Gesture Recognition, , 3 [25] N. Pinto, D. Doukhan, J. J. DiCaro, and D. D. Cox. A highthroughput screening approach to discovering good forms of bioogicay inspired visua representation. PLoS Comput Bio,2009.2, 5 [26] S. Ramanathan, H. Katti, N. Sebe, M. Kankanhai, and T.- S. Chua. An eye fixation database for saiency detection in images. In ECCV,pages30 43,2010.2, 5 [27] R. E. Schapire. The boosting approach to machine earning: An overview. Noninear Estimation and Cassification. Lecture Notes in Statist.,pages ,2003.2, 3 [28] B. Schauerte and R. Stiefehagen. Quaternion-based spectra saiency detection for eye fixation prediction. In ECCV, pages , , 3, 5 [29] C. Shen, M. Song, and Q. Zhao. Learning high-eve concepts by training a deep network on eye fixations. In NIPS Deep Learning and Unsup Feat Learn Workshop, [30] H. R. Tavakoi, E. Rahtu, and J. Heikkiä. Fast and efficient saiency detection using sparse samping and kerne density estimation. In Image Anaysis,pages [31] A. M. Treisman and G. Geade. A feature-integration theory of attention. Cognitive psychoogy, 12(1):97 136, [32] P. Tseng, R. Carmi, I. Cameron, D. Munoz, and L. Itti. Quantifying center bias of observers in free viewing of dynamic natura scenes. Journa of Vision,9(7),2009.4, 5 [33] L. Zhang, M. H. Tong, T. K. Marks, H. Shan, and G. W. Cottre. SUN: A Bayesian framework for saiency using natura statistics. Journa of Vision, 8(7):1 20, , 7 [34] Q. Zhao and C. Koch. Learning a saiency map using fixated ocations in natura scenes. Journa of Vision, 11(3), , 5
Face Hallucination and Recognition
Face Haucination and Recognition Xiaogang Wang and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {xgwang1, xtang}@ie.cuhk.edu.hk http://mmab.ie.cuhk.edu.hk Abstract.
More informationONE of the most challenging problems addressed by the
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, VOL. 44, NO. 9, SEPTEMBER 2006 2587 A Mutieve Context-Based System for Cassification of Very High Spatia Resoution Images Lorenzo Bruzzone, Senior Member,
More informationSecure Network Coding with a Cost Criterion
Secure Network Coding with a Cost Criterion Jianong Tan, Murie Médard Laboratory for Information and Decision Systems Massachusetts Institute of Technoogy Cambridge, MA 0239, USA E-mai: {jianong, medard}@mit.edu
More informationFRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS. Karl Skretting and John Håkon Husøy
FRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS Kar Skretting and John Håkon Husøy University of Stavanger, Department of Eectrica and Computer Engineering N-4036 Stavanger,
More informationTeamwork. Abstract. 2.1 Overview
2 Teamwork Abstract This chapter presents one of the basic eements of software projects teamwork. It addresses how to buid teams in a way that promotes team members accountabiity and responsibiity, and
More informationFixed income managers: evolution or revolution
Fixed income managers: evoution or revoution Traditiona approaches to managing fixed interest funds rey on benchmarks that may not represent optima risk and return outcomes. New techniques based on separate
More informationWHITE PAPER UndERsTAndIng THE VAlUE of VIsUAl data discovery A guide To VIsUAlIzATIons
Understanding the Vaue of Visua Data Discovery A Guide to Visuaizations WHITE Tabe of Contents Executive Summary... 3 Chapter 1 - Datawatch Visuaizations... 4 Chapter 2 - Snapshot Visuaizations... 5 Bar
More informationAustralian Bureau of Statistics Management of Business Providers
Purpose Austraian Bureau of Statistics Management of Business Providers 1 The principa objective of the Austraian Bureau of Statistics (ABS) in respect of business providers is to impose the owest oad
More informationMulti-Robot Task Scheduling
Proc of IEEE Internationa Conference on Robotics and Automation, Karsruhe, Germany, 013 Muti-Robot Tas Scheduing Yu Zhang and Lynne E Parer Abstract The scheduing probem has been studied extensivey in
More informationFast Robust Hashing. ) [7] will be re-mapped (and therefore discarded), due to the load-balancing property of hashing.
Fast Robust Hashing Manue Urueña, David Larrabeiti and Pabo Serrano Universidad Caros III de Madrid E-89 Leganés (Madrid), Spain Emai: {muruenya,darra,pabo}@it.uc3m.es Abstract As statefu fow-aware services
More informationA Latent Variable Pairwise Classification Model of a Clustering Ensemble
A atent Variabe Pairwise Cassification Mode of a Custering Ensembe Vadimir Berikov Soboev Institute of mathematics, Novosibirsk State University, Russia berikov@math.nsc.ru http://www.math.nsc.ru Abstract.
More informationWHITE PAPER BEsT PRAcTIcEs: PusHIng ExcEl BEyond ITs limits WITH InfoRmATIon optimization
Best Practices: Pushing Exce Beyond Its Limits with Information Optimization WHITE Best Practices: Pushing Exce Beyond Its Limits with Information Optimization Executive Overview Microsoft Exce is the
More informationAdvanced ColdFusion 4.0 Application Development - 3 - Server Clustering Using Bright Tiger
Advanced CodFusion 4.0 Appication Deveopment - CH 3 - Server Custering Using Bri.. Page 1 of 7 [Figures are not incuded in this sampe chapter] Advanced CodFusion 4.0 Appication Deveopment - 3 - Server
More informationBite-Size Steps to ITIL Success
7 Bite-Size Steps to ITIL Success Pus making a Business Case for ITIL! Do you want to impement ITIL but don t know where to start? 7 Bite-Size Steps to ITIL Success can hep you to decide whether ITIL can
More informationChapter 3: JavaScript in Action Page 1 of 10. How to practice reading and writing JavaScript on a Web page
Chapter 3: JavaScript in Action Page 1 of 10 Chapter 3: JavaScript in Action In this chapter, you get your first opportunity to write JavaScript! This chapter introduces you to JavaScript propery. In addition,
More information3.3 SOFTWARE RISK MANAGEMENT (SRM)
93 3.3 SOFTWARE RISK MANAGEMENT (SRM) Fig. 3.2 SRM is a process buit in five steps. The steps are: Identify Anayse Pan Track Resove The process is continuous in nature and handed dynamicay throughout ifecyce
More informationBetting Strategies, Market Selection, and the Wisdom of Crowds
Betting Strategies, Market Seection, and the Wisdom of Crowds Wiemien Kets Northwestern University w-kets@keogg.northwestern.edu David M. Pennock Microsoft Research New York City dpennock@microsoft.com
More informationGREEN: An Active Queue Management Algorithm for a Self Managed Internet
: An Active Queue Management Agorithm for a Sef Managed Internet Bartek Wydrowski and Moshe Zukerman ARC Specia Research Centre for Utra-Broadband Information Networks, EEE Department, The University of
More informationVirtual trunk simulation
Virtua trunk simuation Samui Aato * Laboratory of Teecommunications Technoogy Hesinki University of Technoogy Sivia Giordano Laboratoire de Reseaux de Communication Ecoe Poytechnique Federae de Lausanne
More informationChapter 3: e-business Integration Patterns
Chapter 3: e-business Integration Patterns Page 1 of 9 Chapter 3: e-business Integration Patterns "Consistency is the ast refuge of the unimaginative." Oscar Wide In This Chapter What Are Integration Patterns?
More informationeg Enterprise vs. a Big 4 Monitoring Soution: Comparing Tota Cost of Ownership Restricted Rights Legend The information contained in this document is confidentia and subject to change without notice. No
More informationSPOTLIGHT. A year of transformation
WINTER ISSUE 2014 2015 SPOTLIGHT Wecome to the winter issue of Oasis Spotight. These newsetters are designed to keep you upto-date with news about the Oasis community. This quartery issue features an artice
More informationCONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS
Dehi Business Review X Vo. 4, No. 2, Juy - December 2003 CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS John N.. Var arvatsouakis atsouakis DURING the present time,
More informationLearning from evaluations Processes and instruments used by GIZ as a learning organisation and their contribution to interorganisational learning
Monitoring and Evauation Unit Learning from evauations Processes and instruments used by GIZ as a earning organisation and their contribution to interorganisationa earning Contents 1.3Learning from evauations
More informationCERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society
CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY Course Offered By: Indian Environmenta Society INTRODUCTION The Indian Environmenta Society (IES) a dynamic and fexibe organization with a goba vision
More informationBooks on Reference and the Problem of Library Science
Practicing Reference... Learning from Library Science * Mary Whisner ** Ms. Whisner describes the method and some of the resuts reported in a recenty pubished book about the reference interview written
More informationAutomatic Structure Discovery for Large Source Code
Automatic Structure Discovery for Large Source Code By Sarge Rogatch Master Thesis Universiteit van Amsterdam, Artificia Inteigence, 2010 Automatic Structure Discovery for Large Source Code Page 1 of 130
More informationAn Idiot s guide to Support vector machines (SVMs)
An Idiot s guide to Support vector machines (SVMs) R. Berwick, Viage Idiot SVMs: A New Generation of Learning Agorithms Pre 1980: Amost a earning methods earned inear decision surfaces. Linear earning
More informationLecture 7 Datalink Ethernet, Home. Datalink Layer Architectures
Lecture 7 Dataink Ethernet, Home Peter Steenkiste Schoo of Computer Science Department of Eectrica and Computer Engineering Carnegie Meon University 15-441 Networking, Spring 2004 http://www.cs.cmu.edu/~prs/15-441
More informationScheduling in Multi-Channel Wireless Networks
Scheduing in Muti-Channe Wireess Networks Vartika Bhandari and Nitin H. Vaidya University of Iinois at Urbana-Champaign, USA vartikab@acm.org, nhv@iinois.edu Abstract. The avaiabiity of mutipe orthogona
More informationSimultaneous Routing and Power Allocation in CDMA Wireless Data Networks
Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,
More informationNormalization of Database Tables. Functional Dependency. Examples of Functional Dependencies: So Now what is Normalization? Transitive Dependencies
ISM 602 Dr. Hamid Nemati Objectives The idea Dependencies Attributes and Design Understand concepts normaization (Higher-Leve Norma Forms) Learn how to normaize tabes Understand normaization and database
More informationA Similarity Search Scheme over Encrypted Cloud Images based on Secure Transformation
A Simiarity Search Scheme over Encrypted Coud Images based on Secure Transormation Zhihua Xia, Yi Zhu, Xingming Sun, and Jin Wang Jiangsu Engineering Center o Network Monitoring, Nanjing University o Inormation
More informationOracle. L. Ladoga Rybinsk Res. Volga. Finland. Volga. Dnieper. Dnestr. Danube. Lesbos. Auditing Oracle Applications Peloponnesus
N o r w e g i a n S e a White 60ûN ATLANTIC OCEAN UNITED KINGDOM Rio Douro Hebrid Bay of Biscay Garonne Faroe Isands Shetand Isands Orkney Isands North Loire ine Rhone Rhine Po Ebe Adriatic Batic Guf of
More informationEFFICIENT CLUSTERING OF VERY LARGE DOCUMENT COLLECTIONS
Chapter 1 EFFICIENT CLUSTERING OF VERY LARGE DOCUMENT COLLECTIONS Inderjit S. Dhion, James Fan and Yuqiang Guan Abstract An invauabe portion of scientific data occurs naturay in text form. Given a arge
More informationSELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH. Ufuk Cebeci
SELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH Ufuk Cebeci Department of Industria Engineering, Istanbu Technica University, Macka, Istanbu, Turkey - ufuk_cebeci@yahoo.com Abstract An Enterprise
More informationLeakage detection in water pipe networks using a Bayesian probabilistic framework
Probabiistic Engineering Mechanics 18 (2003) 315 327 www.esevier.com/ocate/probengmech Leakage detection in water pipe networks using a Bayesian probabiistic framework Z. Pouakis, D. Vaougeorgis, C. Papadimitriou*
More informationREADING A CREDIT REPORT
Name Date CHAPTER 6 STUDENT ACTIVITY SHEET READING A CREDIT REPORT Review the sampe credit report. Then search for a sampe credit report onine, print it off, and answer the questions beow. This activity
More informationBig Data projects and use cases. Claus Samuelsen IBM Analytics, Europe csa@dk.ibm.com
Big projects and use cases Caus Samuesen IBM Anaytics, Europe csa@dk.ibm.com IBM Sofware Overview of BigInsights IBM BigInsights Scientist Free Quick Start (non production): IBM Open Patform BigInsights
More informationArt of Java Web Development By Neal Ford 624 pages US$44.95 Manning Publications, 2004 ISBN: 1-932394-06-0
IEEE DISTRIBUTED SYSTEMS ONLINE 1541-4922 2005 Pubished by the IEEE Computer Society Vo. 6, No. 5; May 2005 Editor: Marcin Paprzycki, http://www.cs.okstate.edu/%7emarcin/ Book Reviews: Java Toos and Frameworks
More informationChapter 1 Structural Mechanics
Chapter Structura echanics Introduction There are many different types of structures a around us. Each structure has a specific purpose or function. Some structures are simpe, whie others are compex; however
More informationMeasuring operational risk in financial institutions
Measuring operationa risk in financia institutions Operationa risk is now seen as a major risk for financia institutions. This paper considers the various methods avaiabe to measure operationa risk, and
More informationAN APPROACH TO THE STANDARDISATION OF ACCIDENT AND INJURY REGISTRATION SYSTEMS (STAIRS) IN EUROPE
AN APPROACH TO THE STANDARDSATON OF ACCDENT AND NJURY REGSTRATON SYSTEMS (STARS) N EUROPE R. Ross P. Thomas Vehice Safety Research Centre Loughborough University B. Sexton Transport Research Laboratory
More informationA Supplier Evaluation System for Automotive Industry According To Iso/Ts 16949 Requirements
A Suppier Evauation System for Automotive Industry According To Iso/Ts 16949 Requirements DILEK PINAR ÖZTOP 1, ASLI AKSOY 2,*, NURSEL ÖZTÜRK 2 1 HONDA TR Purchasing Department, 41480, Çayırova - Gebze,
More informationEducation sector: Working conditions and job quality
European Foundation for the Improvement of Living and Working Conditions sector: Working conditions and job quaity Work pays a significant roe in peope s ives, in the functioning of companies and in society
More informationOn Capacity Scaling in Arbitrary Wireless Networks
On Capacity Scaing in Arbitrary Wireess Networks Urs Niesen, Piyush Gupta, and Devavrat Shah 1 Abstract arxiv:07112745v3 [csit] 3 Aug 2009 In recent work, Özgür, Lévêque, and Tse 2007) obtained a compete
More informationl l ll l l Exploding the Myths about DETC Accreditation A Primer for Students
Expoding the Myths about DETC Accreditation A Primer for Students Distance Education and Training Counci Expoding the Myths about DETC Accreditation: A Primer for Students Prospective distance education
More informationPricing Internet Services With Multiple Providers
Pricing Internet Services With Mutipe Providers Linhai He and Jean Warand Dept. of Eectrica Engineering and Computer Science University of Caifornia at Berkeey Berkeey, CA 94709 inhai, wr@eecs.berkeey.edu
More informationIntroduction to XSL. Max Froumentin - W3C
Introduction to XSL Max Froumentin - W3C Introduction to XSL XML Documents Stying XML Documents XSL Exampe I: Hamet Exampe II: Mixed Writing Modes Exampe III: database Other Exampes How do they do that?
More informationWith the arrival of Java 2 Micro Edition (J2ME) and its industry
Knowedge-based Autonomous Agents for Pervasive Computing Using AgentLight Fernando L. Koch and John-Jues C. Meyer Utrecht University Project AgentLight is a mutiagent system-buiding framework targeting
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1 Scaabe Muti-Cass Traffic Management in Data Center Backbone Networks Amitabha Ghosh, Sangtae Ha, Edward Crabbe, and Jennifer
More informationVendor Performance Measurement Using Fuzzy Logic Controller
The Journa of Mathematics and Computer Science Avaiabe onine at http://www.tjmcs.com The Journa of Mathematics and Computer Science Vo.2 No.2 (2011) 311-318 Performance Measurement Using Fuzzy Logic Controer
More informationBusiness schools are the academic setting where. The current crisis has highlighted the need to redefine the role of senior managers in organizations.
c r o s os r oi a d s REDISCOVERING THE ROLE OF BUSINESS SCHOOLS The current crisis has highighted the need to redefine the roe of senior managers in organizations. JORDI CANALS Professor and Dean, IESE
More informationACO and SVM Selection Feature Weighting of Network Intrusion Detection Method
, pp. 129-270 http://dx.doi.org/10.14257/ijsia.2015.9.4.24 ACO and SVM Seection Feature Weighting of Network Intrusion Detection Method Wang Xingzhu Furong Coege Hunan, University of Arts and Science,
More informationPacket Classification with Network Traffic Statistics
Packet Cassification with Network Traffic Statistics Yaxuan Qi and Jun Li Research Institute of Information Technoogy (RIIT), Tsinghua Uniersity Beijing, China, 100084 Abstract-- Packet cassification on
More informationHuman Capital & Human Resources Certificate Programs
MANAGEMENT CONCEPTS Human Capita & Human Resources Certificate Programs Programs to deveop functiona and strategic skis in: Human Capita // Human Resources ENROLL TODAY! Contract Hoder Contract GS-02F-0010J
More informationA New Statistical Approach to Network Anomaly Detection
A New Statistica Approach to Network Anomay Detection Christian Caegari, Sandrine Vaton 2, and Michee Pagano Dept of Information Engineering, University of Pisa, ITALY E-mai: {christiancaegari,mpagano}@ietunipiit
More informationInsertion and deletion correcting DNA barcodes based on watermarks
Kracht and Schober BMC Bioinformatics (2015) 16:50 DOI 10.1186/s12859-015-0482-7 METHODOLOGY ARTICLE Open Access Insertion and deetion correcting DNA barcodes based on watermarks David Kracht * and Steffen
More informationLet s get usable! Usability studies for indexes. Susan C. Olason. Study plan
Let s get usabe! Usabiity studies for indexes Susan C. Oason The artice discusses a series of usabiity studies on indexes from a systems engineering and human factors perspective. The purpose of these
More informationTake me to your leader! Online Optimization of Distributed Storage Configurations
Take me to your eader! Onine Optimization of Distributed Storage Configurations Artyom Sharov Aexander Shraer Arif Merchant Murray Stokey sharov@cs.technion.ac.i, {shraex, aamerchant, mstokey}@googe.com
More informationTraffic classification-based spam filter
Traffic cassification-based spam fiter Ni Zhang 1,2, Yu Jiang 3, Binxing Fang 1, Xueqi Cheng 1, Li Guo 1 1 Software Division, Institute of Computing Technoogy, Chinese Academy of Sciences, 100080, Beijing,
More informationInterpreting Individual Classifications of Hierarchical Networks
Interpreting Individua Cassifications of Hierarchica Networks Wi Landecker Michae D. Thomure Luís M. A. Bettencourt Meanie Mitche Garrett T. Kenyon SFI WORKING PAPER: 2013-02-007 SFI Working Papers contain
More informationEnabling Direct Interest-Aware Audience Selection
Enabing Direct Interest-Aware Audience Seection ABSTRACT Arie Fuxman Microsoft Research Mountain View, CA arief@microsoft.com Zhenhui Li University of Iinois Urbana-Champaign, Iinois zi28@uiuc.edu Advertisers
More informationST. MARKS CONFERENCE FACILITY MARKET ANALYSIS
ST. MARKS CONFERENCE FACILITY MARKET ANALYSIS Prepared by: Lambert Advisory, LLC Submitted to: St. Marks Waterfronts Forida Partnership St. Marks Conference Center Contents Executive Summary... 1 Section
More information(12) Patent Application Publication (10) Pub. N0.: US 2006/0105797 A1 Marsan et al. (43) Pub. Date: May 18, 2006
(19) United States US 20060105797A (12) Patent Appication Pubication (10) Pub. N0.: US 2006/0105797 A1 Marsan et a. (43) Pub. Date: (54) METHOD AND APPARATUS FOR (52) US. C...... 455/522 ADJUSTING A MOBILE
More informationNetwork/Communicational Vulnerability
Automated teer machines (ATMs) are a part of most of our ives. The major appea of these machines is convenience The ATM environment is changing and that change has serious ramifications for the security
More informationThe Web Insider... The Best Tool for Building a Web Site *
The Web Insider... The Best Too for Buiding a Web Site * Anna Bee Leiserson ** Ms. Leiserson describes the types of Web-authoring systems that are avaiabe for buiding a site and then discusses the various
More informationInfrastructure for Business
Infrastructure for Business The IoD Member Broadband Survey Infrastructure for Business 2013 #5 The IoD Member Broadband Survey The IoD Member Broadband Survey Written by: Corin Tayor, Senior Economic
More informationAdvance PLM Software Solutions for Complex Business Processes
Advance PLM Software Soutions for Compex Business Processes Abstract As customers word-wide camour for more technoogicay rich products, be it a car, or a smartphone, manufacturers are having to contend
More informationSNMP Reference Guide for Avaya Communication Manager
SNMP Reference Guide for Avaya Communication Manager 03-602013 Issue 1.0 Feburary 2007 2006 Avaya Inc. A Rights Reserved. Notice Whie reasonabe efforts were made to ensure that the information in this
More informationFinance 360 Problem Set #6 Solutions
Finance 360 Probem Set #6 Soutions 1) Suppose that you are the manager of an opera house. You have a constant margina cost of production equa to $50 (i.e. each additiona person in the theatre raises your
More informationHow To Deiver Resuts
Message We sha make every effort to strengthen the community buiding programme which serves to foster among the peope of Hong Kong a sense of beonging and mutua care. We wi continue to impement the District
More informationProtection Against Income Loss During the First 4 Months of Illness or Injury *
Protection Against Income Loss During the First 4 Months of Iness or Injury * This note examines and describes the kinds of income protection that are avaiabe to workers during the first 6 months of iness
More informationEarly access to FAS payments for members in poor health
Financia Assistance Scheme Eary access to FAS payments for members in poor heath Pension Protection Fund Protecting Peope s Futures The Financia Assistance Scheme is administered by the Pension Protection
More informationCLOUD service providers manage an enterprise-class
IEEE TRANSACTIONS ON XXXXXX, VOL X, NO X, XXXX 201X 1 Oruta: Privacy-Preserving Pubic Auditing for Shared Data in the Coud Boyang Wang, Baochun Li, Member, IEEE, and Hui Li, Member, IEEE Abstract With
More informationNo. of Pages 15, Model 5G ARTICLE IN PRESS. Contents lists available at ScienceDirect. Electronic Commerce Research and Applications
Eectronic Commerce Research and Appications xxx (2008) xxx xxx 1 Contents ists avaiabe at ScienceDirect Eectronic Commerce Research and Appications journa homepage: www.esevier.com/ocate/ecra 2 Forecasting
More informationSpherical Correlation of Visual Representations for 3D Model Retrieval
Noname manuscript No. (wi be inserted by the editor) Spherica Correation of Visua Representations for 3D Mode Retrieva Ameesh Makadia Kostas Daniiidis the date of receipt and acceptance shoud be inserted
More informationeffect on major accidents
An Investigation into a weekend (or bank hoiday) effect on major accidents Nicoa C. Heaey 1 and Andrew G. Rushton 2 1 Heath and Safety Laboratory, Harpur Hi, Buxton, Derbyshire, SK17 9JN 2 Hazardous Instaations
More informationWINMAG Graphics Management System
SECTION 10: page 1 Section 10: by Honeywe WINMAG Graphics Management System Contents What is WINMAG? WINMAG Text and Graphics WINMAG Text Ony Scenarios Fire/Emergency Management of Fauts & Disabement Historic
More informationNCH Software MoneyLine
NCH Software MoneyLine This user guide has been created for use with MoneyLine Version 2.xx NCH Software Technica Support If you have difficuties using MoneyLine pease read the appicabe topic before requesting
More informationWe focus on systems composed of entities operating with autonomous control, such
Middeware Architecture for Federated Contro Systems Girish Baiga and P.R. Kumar University of Iinois at Urbana-Champaign A federated contro system (FCS) is composed of autonomous entities, such as cars,
More informationConference Paper Service Organizations: Customer Contact and Incentives of Knowledge Managers
econstor www.econstor.eu Der Open-Access-Pubikationsserver der ZBW Leibniz-Informationszentrum Wirtschaft The Open Access Pubication Server of the ZBW Leibniz Information Centre for Economics Kirchmaier,
More informationDelhi Business Review X Vol. 4, No. 2, July - December 2003. Mohammad Talha
Dehi Business Review X Vo. 4, No. 2, Juy - December 2003 TREATMENT TMENT OF GOODWILL IN ACCOUNTING Mohammad Taha GOODWILL is usuay ony recorded in an accounting system when a company purchases an unincorporated
More informationSTRUCTURING WAYFINDING TASKS WITH IMAGE SCHEMATA
STRUCTURING WAYFINDING TASKS WITH IMAGE SCHEMATA By Martin M. Rauba A THESIS Submitted in Partia Fufiment of the Requirements for the Degree of Master of Science (in Spatia Information Science and Engineering)
More informationABSTRACT. Categories and Subject Descriptors. General Terms. Keywords 1. INTRODUCTION. Jun Yin, Ye Wang and David Hsu
Jun Yin, Ye Wang and David Hsu ABSTRACT Prompt feedback is essentia for beginning vioin earners; however, most amateur earners can ony meet with teachers and receive feedback once or twice a week. To hep
More informationLADDER SAFETY Table of Contents
Tabe of Contents SECTION 1. TRAINING PROGRAM INTRODUCTION..................3 Training Objectives...........................................3 Rationae for Training.........................................3
More informationStoring Shared Data on the Cloud via Security-Mediator
Storing Shared Data on the Coud via Security-Mediator Boyang Wang, Sherman S. M. Chow, Ming Li, and Hui Li State Key Laboratory of Integrated Service Networks, Xidian University, Xi an, China Department
More informationIntroduction the pressure for efficiency the Estates opportunity
Heathy Savings? A study of the proportion of NHS Trusts with an in-house Buidings Repair and Maintenance workforce, and a discussion of eary experiences of Suppies efficiency initiatives Management Summary
More informationAdvantages and Disadvantages of Sampling. Vermont ASQ Meeting October 26, 2011
Advantages and Disadvantages of Samping Vermont ASQ Meeting October 26, 2011 Jeffrey S. Soomon Genera Dynamics Armament and Technica Products, Inc. Wiiston, VT 05495 Outine I. Definition and Exampes II.
More informationTeach yourself Android application development - Part I: Creating Android products
Teach yoursef Android appication deveopment - Part I: Creating Android products Page 1 of 7 Part of the EE Times Network A Artices Products Course TechPaper Webinars Login Register Wecome, Guest HOME DESIGN
More informationNiagara Catholic. District School Board. High Performance. Support Program. Academic
Niagara Cathoic District Schoo Board High Performance Academic Support Program The Niagara Cathoic District Schoo Board, through the charisms of faith, socia justice, support and eadership, nurtures an
More informationAn Integrated Data Management Framework of Wireless Sensor Network
An Integrated Data Management Framework of Wireess Sensor Network for Agricutura Appications 1,2 Zhao Liang, 2 He Liyuan, 1 Zheng Fang, 1 Jin Xing 1 Coege of Science, Huazhong Agricutura University, Wuhan
More informationFast b-matching via Sufficient Selection Belief Propagation
Fast b-matching via Sufficient Seection Beief Propagation Bert Huang Computer Science Department Coumbia University New York, NY 127 bert@cs.coumbia.edu Tony Jebara Computer Science Department Coumbia
More informationOracle Project Financial Planning. User's Guide Release 11.1.2.2
Orace Project Financia Panning User's Guide Reease 11.1.2.2 Project Financia Panning User's Guide, 11.1.2.2 Copyright 2012, Orace and/or its affiiates. A rights reserved. Authors: EPM Information Deveopment
More information(12) United States Patent Rune
(12) United States Patent Rune US006304913B1 (10) Patent N0.: (45) Date of Patent: US 6,304,913 B1 on. 16, 2001 (54) INTERNET SYSTEM AND METHOD FOR SELECTING A CLOSEST SERVER FROM A PLURALITY OF ALTERNATIVE
More informationIMPLEMENTING THE RATE STRUCTURE: TIERING IN THE FEE-FOR-SERVICE SYSTEM
The New Jersey Department of Human Services Division of Deveopmenta Disabiities 1 IMPLEMENTING THE RATE STRUCTURE: TIERING IN THE FEE-FOR-SERVICE SYSTEM Eizabeth M. Shea Assistant Commissioner Thomas S.
More information1##111##1111#1#111i#lllil
1##111##1111#1#111i#i 140334197x SWP 6/90 GROWTH AND PERFORMANCE CONTRASTS BETWEEN TYPES OF SMALL FIRMS PROFESSOR SUE BIRLEY & DR PAUL WESTHEAD Cranfieid Entrepreneurship Research Centre Cranfied Schoo
More informationSensing Meets Mobile Social Networks: The Design, Implementation and Evaluation of the CenceMe Application
Sensing Meets Mobie Socia Networks: The Design, Impementation and Evauation of the CenceMe Appication Emiiano Miuzzo, Nichoas D. Lane, Kristóf Fodor, Ronad Peterson, Hong Lu, Mirco Musoesi, Shane B. Eisenman,
More informationADVANCED ACCOUNTING SOFTWARE FOR GROWING BUSINESSES
ADVANCED ACCOUNTING SOFTWARE FOR GROWING BUSINESSES Product Features 1. System 2. Saes Ledger Unimited companies with password protection User security Muti-user system: 1 user comes as standard, up to
More informationHealth Literacy Online
Heath Literacy Onine A guide to writing and designing easy-to-use heath Web sites Strategies Actions Testing Methods Resources HEALTH OF & HUMAN SERVICES USA U.S. Department of Heath and Human Services
More information