19,592 Hits in 4.4 sec

Page 6550 of Mathematical Reviews Vol. , Issue 87k [page]

1987 Mathematical Reviews  
(D-FRNK-I) Nearly optimal hierarchies for network and formula size. Acta Inform. 23 (1986), no. 2, 217-221.  ...  The authors consider the question: “How large are the ‘gaps’ in the complexity hierarchies for Boolean functions with respect to network size and formula size?”  ... 

Exploring the Memory-Bandwidth Tradeoff in an Information-Centric Network [article]

James Roberts
2013 arXiv   pre-print
We evaluate this tradeoff for some simple cache network structures under realistic assumptions concerning the size of the content catalogue and its popularity distribution.  ...  Derived cost formulas reveal the relative impact of various cost, traffic and capacity parameters, allowing an appraisal of possible future network architectures.  ...  The normalized tradeoff formulas can be used to determine the optimal siting of caches for given costs and traffic volumes.  ... 
arXiv:1309.5220v1 fatcat:cgkp3ytvxjet5ntyvahf5iapvy

Extracting Navigation Hierarchies from Networks with Genetic Algorithms

Stefan John, Michael Granitzer, Denis Helic
2016 Proceedings of the 12th International Conference on Web Information Systems and Technologies  
A methodology for assessing the quality of navigational network hierarchies. 2. An algorithmic approach for the creation of optimized navigation hierarchies. 3.  ...  Information networks are nowadays an important source of knowledge, indispensable for our daily tasks. Because of their size, however, efficient navigation can be a challenge.  ...  Interestingly, however, the relative improvement is nearly the same for both networks. This suggests that our algorithm performs well independently of the size and structure of the network.  ... 
doi:10.5220/0005760600630074 dblp:conf/webist/JohnGH16 fatcat:xyvj2wbzkjcr5kvyy4rsg5qxs4

Location of the public service facilities in an urban comprehensive park using a multi-hierarchy and multi-constrained configuration model

Jie Yin, Bohao Su, Chenjing Fan, Qiuyuan Li
2020 Journal of Urban Management  
in urban comprehensive parks has to be optimized dynamically in accordance with user needs and local conditions.  ...  This study provides a reference for the efficient operation and sustainable development of urban comprehensive parks.  ...  Acknowledgments We would like to thank the reviewers for their helpful comments and suggestions.  ... 
doi:10.1016/j.jum.2020.04.001 fatcat:lpq7oozbj5cszcxwl6vmzxwrqa

Optimization of synchronization in gradient clustered networks

Xingang Wang, Liang Huang, Ying-Cheng Lai, Choy Heng Lai
2007 Physical Review E  
We consider complex clustered networks with a gradient structure, where sizes of the clusters are distributed unevenly.  ...  Such networks describe more closely actual networks in biophysical systems and in technological applications than previous models.  ...  , all networks possess nearly identical synchronizability.  ... 
doi:10.1103/physreve.76.056113 pmid:18233724 fatcat:7eocggb6vjggda4yucvpmus4k4

Memory hierarchy considerations for cost-effective cluster computing

Xing Du, Xiaodong Zhang, Zhichun Zhu
2000 IEEE transactions on computers  
We present an analytical model for evaluating the performance impact of memory hierarchies and networks on cluster computing.  ...  The cost-effectiveness of a cluster computing platform for a given budget and for certain types of applications is mainly determined by its memory hierarchy and the interconnection network configurations  ...  We are thankful to Stefan Kubricht and N. Wagner for reading the paper and for their comments. Finally, we wish to thank the anonymous referees for their constructive and insightful comments.  ... 
doi:10.1109/12.869323 fatcat:izc5732aqfg43bgcjxusnyieji

Continuous Approximations in the Study of Hierarchies

Timothy Van Zandt
1995 The Rand Journal of Economics  
I also show, for a particular model of balanced hierarchies, that ignoring rounding operators and integer constraints in formulae derived from the discrete model can be a valid approximation, when hierarchies  ...  The research assistance and comments of Archishman Chakraborty, consultations with Edward Reingold on regularity properties of trees, and the comments of two anonymous referees have been very helpful.  ...  two in nearly all models of hierarchies.  ... 
doi:10.2307/2556007 fatcat:x5fm5uilbvcvhpqccmawba6zp4

Hierarchical Network Exploration using Gaussian Mixture Models [article]

James Mathews, Saad Nadeem, Maryam Pouryahya, Zehor Belkhatir, Joseph O Deasy, Allen Tannenbaum
2019 bioRxiv   pre-print
We present a framework based on optimal mass transport to construct for a given network a supernode hierarchy which can be used for unsupervised interactive data exploration.  ...  The computation of GMT for all adjacent edge pairs in the network is highly parallelizable and performed only once prior to exploration, allowing real-time interactivity.  ...  CONCLUSION AND FUTURE WORK We presented a supernode hierarchy construction based on the modified optimal mass transport methodology developed for Gaussian mixture models [6] .  ... 
doi:10.1101/623157 fatcat:zmb4dbd6efbxhocqzyvfpk37yy

The Role of Conceptual Relations in Word Sense Disambiguation [article]

David Fernandez-Amoros, Julio Gonzalo, Felisa Verdejo
2001 arXiv   pre-print
We finally obtain a 42% improvement over the original algorithm, and show that measures of conceptual distance are not worse indicators for sense disambiguation than measures based on word-coocurrence  ...  We use a generalized form of this measure, introducing many (parameterized) refinements and performing an exhaustive evaluation of all meaningful combinations.  ...  Acknowledgments This work has been supported by a Ph.D. research grant from the Comunidad Autónoma de Madrid, and also by the Spanish Comisión Interministerial de Ciencia y Tecnología, project Hermes (  ... 
arXiv:cs/0107005v1 fatcat:mufj74oblbdn5if6p3wcw7folm

Agglomerative genetic algorithm for clustering in social networks

Marek Lipczak, Evangelos Milios
2009 Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09  
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches.  ...  This makes the algorithm practically useful independently of the size of the network.  ...  We would like to thank Dirk Arnold and Malcolm Heywood from Dalhousie University for their comments and valuable input.  ... 
doi:10.1145/1569901.1570068 dblp:conf/gecco/LipczakM09 fatcat:hg4uecyma5ckjgwxgwcy2yonve

Analysis of selected prioritization methods in the analytic hierarchy process

J Jablonsky
2015 Journal of Physics, Conference Series  
A crucial problem in the analytic hierarchy process (or its extension analytic network process) deriving priorities form pairwise comparison matrices.  ...  The results of methods are compared on a set of randomly generated matrices of different sizes and consistency levels.  ...  Analytic hierarchy/network process AHP is a powerful and popular tool for analysis of general decision making problems.  ... 
doi:10.1088/1742-6596/622/1/012033 fatcat:st3ny5h6fjhnvla5tpyf73ipc4

A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations

C. Ponce, D. S. Bindel, P. S. Vassilevski
2018 SIAM Journal on Scientific Computing  
A key difference between our multigrid framework and typical multigrid approaches is the use of a novel multiplicative coarse-grid correction to enable a dynamic multigrid hierarchy.  ...  Multigrid is a highly scalable class of methods most often used for solving large linear systems.  ...  Convergence rates using a synthetic network. Each network size is sampled four times. The solid lines represent the mean at each network size.  ... 
doi:10.1137/16m1109965 fatcat:o3fz4jqjrrffxc2xcr5xdgdol4

Body Surface Area Misconceptions1

Thomas H. Slone
1993 Risk Analysis  
Gold and Bonnie R. Stern for helpful comments.  ...  may provide an optimal solution to the problem of maximizing surface area for diffusion of oxygen and carbon dioxide.  ...  The dimension is typically estimated by comparing the relationship between ruler size and measured size.  ... 
doi:10.1111/j.1539-6924.1993.tb00736.x pmid:8234944 fatcat:2softdhb2bcxrlvrikqnzl4tde

Transfer Learning with Deep CNNs for Gender Recognition and Age Estimation [article]

Philip Smith, Cuixian Chen
2018 arXiv   pre-print
In this project, competition-winning deep neural networks with pretrained weights are used for image-based gender recognition and age estimation.  ...  Finally, a hierarchy of deep CNNs is tested that first classifies subjects by gender, and then uses separate male and female age models to predict age.  ...  For MORPH-II, all images are scaled down to 200x240. All input is standardized before being fed into the network. The batch size is set to 50, and models are trained for 60 epochs.  ... 
arXiv:1811.07344v1 fatcat:xuxtf6iwzzgtrkgi6ipqi7vriy

Exploiting Loop-Carried Stream Reuse for Scientific Computing Applications on the Stream Processor

Weixia XU, Qiang DOU, Ying ZHANG, Gen LI, Xuejun YANG
2010 International Journal of Communications, Network and System Sciences  
We then perform several representative microbenchmarks and scientific stream programs with and without our optimization on Isim, a cycle-accurate stream processor simulator.  ...  Experimental results show that our algorithms can effectively exploit loop-carried stream reuse for scientific stream programs and thus greatly improve the performance of memory-bound scientific stream  ...  In Figure 7 (a), the load traffics of P2Q2d1 are nearly 2/3 of the other two implementations whatever the array size is.  ... 
doi:10.4236/ijcns.2010.31003 fatcat:4aq6b4vlgvcctfmybzgrgthtom
« Previous Showing results 1 — 15 out of 19,592 results