检索结果-内蒙古大学图书馆

arXiv 2019年

作者： Jacobs, C. Collett, T. Glazebrook, K. Buckley-Geer, E. Diehl, H.T. Lin, H. McCarthy, C. Qin, A.K. Odden, C. Caso Escudero, M. Dial, P. Yung, V.J. Gaitsch, S. Pellico, A. Lindgren, K.A. Abbott, T.M.C. Annis, J. Avila, S. Brooks, D. Burke, D.L. Carnero Rosell, A. Carrasco Kind, M. Carretero, J. da Costa, L.N. de Vicente, J. Fosalba, P. Frieman, J. García-Bellido, J. Gaztanaga, E. Goldstein, D.A. Gruen, D. Gruendl, R.A. Gschwend, J. Hollowood, D.L. Honscheid, K. Hoyle, B. James, D.J. Krause, E. Kuropatkin, N. Lahav, O. Lima, M. Maia, M.A.G. Marshall, J.L. Miquel, R. Plazas, A.A. Roodman, A. Sanchez, E. Scarpine, V. Serrano, S. Sevilla-Noarbe, I. Smith, M. Sobreira, F. Suchyta, E. Swanson, M.E.C. Tarle, G. Vikram, V. Walker, A.R. Zhang, Y. Centre for Astrophysics and Supercomputing Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia Swinburne University of Technology HawthornVIC3122 Australia Institute of Cosmology & Gravitation University of Portsmouth Portsmouthpo1 3fx United Kingdom Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States School of Software and Electrical Engineering Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia Phillips Academy AndoverMA01810 United States Cerro Tololo Inter-American Observatory National Optical Astronomy Observatory Casilla 603 La Serena Chile Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States Instituto de Fisica Teorica UAM/CSIC Universidad Autonoma de Madrid Madrid28049 Spain Department of Physics & Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Kavli Institute for Particle Astrophysics & Cosmology Stanford University P. O. Box 2450 StanfordCA94305 United States SLAC National Accelerator Laboratory Menlo ParkCA94025 United States Madrid Spain Laboratório Interinstitucional de e-Astronomia - LIneA Rua Gal. José Cristino 77 Rio de Janeiro RJ20921-400 Brazil Department of Astronomy University of Illinois at Urbana-Champaign 1002 W. Green Street UrbanaIL61801 United States National Center for Supercomputing Applications 1205 West Clark St. UrbanaIL61801 United States Barcelona Institute of Science and Technology Campus UAB Bellaterra [Barcelona08193 Spain Observatório Nacional Rua Gal. José Cristino 77 Rio de Janeiro RJ20921-400 Brazil Barcelona08034 Spain Campus UAB Carrer de Can Magrans s/n Barcelona08193 Spain Kavli Institute for Cosmological Physics University of Chicago ChicagoIL60637 United States California Institute of Technology 1200 East California Blvd MC 249-17 PasadenaCA91125 United States Department of Physics Stanford University 382 Via Pueblo Mall Sta

We search Dark Energy Survey (DES) Year 3 imaging for galaxy-galaxy strong gravitational lenses using convolutional neural networks, extending previous work with new training sets and covering a wider range of redshifts and colors. We train two neural networks using images of simulated lenses, then use them to score postage stamp images of 7.9 million sources from the Dark Energy Survey chosen to have plausible lens colors based on simulations. We examine 1175 of the highest-scored candidates and identify 152 probable or definite lenses. Examining an additional 20,000 images with lower scores, we identify a further 247 probable or definite candidates. After including 86 candidates discovered in earlier searches using neural networks and 26 candidates discovered through visual inspection of blue-near-red objects in the DES catalog, we present a catalog of 511 lens candidates. Copyright © 2019, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Improvising web search using concept based clustering

引用

WSEAS Transactions on computers 2014年第Pt.1期13卷 338-350页

作者： Indumathi, D Chitra, A Bineeshia, J Department of Computer Science and Engineering PSG College of Technology CoimbatoreTamilnadu641004 India Department of Computer Applications PSG College of Technology CoimbatoreTamilnadu641004 India

The user profile is an elementary component of any application based on personalization. The existing strategies of user profile considers only objects which interests the user (positive preferences of the user), and not on objects which does not interest the user (negative preferences of the user). This paper focuses on personalization in search engine and the proposed approach consists of three steps. At first, an algorithm for concept extraction is employed in which concepts are extracted and the relations between these concepts are obtained from the web-snippets returned by the search engine. Second, a user profile strategy is employed to build a concept-based user profile which predicts the conceptual preferences of the user. Building user profile comprises of identifying the concept preference pair by Spy Naive Bayes Classifier (Spy NB-C) method and learning the users preferences represented by feature weights vectors by Ranking-Support Vector Machine(R-SVM). Third, the concept relations together with the predicted conceptual preferences of the user, is given as input to personalized concept-based clustering algorithm to find the conceptually related queries. To cluster ambiguous queries into different clusters of queries a personalized clustered query-concept bi-partite graph is created by making use of the extracted concepts and click through data. This suggested personalized query recommendations to the individual users based on their interests. From the experimental results, it is observed that the user profile which captured both the preferences of the user increased the separation between dissimilar queries and similar queries. Improvements in F-measure and DCG score shows that the quality of query clusters resulted provided personalised results to the users.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Hiding secret text in quick response code and transforming the position of the secret data using rotation transformation

引用

Research Journal of Applied sciences, engineering and Technology 2014年第19期7卷 4124-4129页

作者： Ramya, V. Gopinath, G. School of Computer Science Engineering and Applications Bharathidasan University Tiruchirappalli Tamil Nadu 620023 India

In order to provide high security and safety in the field of information hiding, this study proposes a novel technology using Steganography. An exotic steganographic algorithm, is used in this study, which Hides the secret text data in a 2D plane (Here, in our case let the 2D plane be the QR code), after encryption and the position of the secret data will be changed using rotation transformation. The proposed algorithm has been tested under various imperceptibility characters such as PSNR, MSE, Human Vision Quality Metrics and Histograms are compared to both cover image and the stego image. This novel algorithm shows Lower MSE, higher PSNR values and it is evident that the proposed algorithm is robust to JPEG attacks. © Maxwell Scientific Organization, 2014.

关键词： Cryptography Information hiding Quick response codes Steganography Transformation

来源：评论

学校读者我要写书评

暂无评论

Reducing Degeneracy in Maximum Entropy Models of Networks

引用

Physical Review Letters 2015年第15期114卷 158701-158701页

作者： Szabolcs Horvát Éva Czabarka Zoltán Toroczkai Department of Physics and Interdisciplinary Center for Network Science & Applications University of Notre Dame Notre Dame Indiana 46556 USA Department of Mathematics University of South Carolina Columbia South Carolina 29208 USA Department of Computer Science and Engineering University of Notre Dame Notre Dame Indiana 46556 USA

Based on Jaynes’s maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered by the degeneracy problem characterized by spontaneous symmetry breaking, where predictions fail. Here we show that degeneracy appears when the corresponding density of states function is not log-concave, which is typically the consequence of nonlinear relationships between the constraining observables. Exploiting these nonlinear relationships here we propose a solution to the degeneracy problem for a large class of systems via transformations that render the density of states function log-concave. The effectiveness of the method is demonstrated on examples.

关键词： STATISTICAL physics THERMODYNAMICS ENTROPY IRREVERSIBLE processes (Thermodynamics) SECOND law of thermodynamics

来源：评论

学校读者我要写书评

暂无评论

Zero Distortion technique: An approach to image Steganography on color images using strength of chaotic sequence 14

Zero Distortion technique: An approach to image Steganograph...

引用

International Conference on Information and Communication Technology for Competitive Strategies, ICTCS 2014

作者： Shivani Yadav, Virendra Kumar Batham, Saumya Computer Science and Engineering ABES Engineering College Ghaziabad India Master of Computer Applications ABES Engineering College Ghaziabad India

ISBN: (纸本)9781450332163

Steganography is a powerful technique to hide data, i.e. the existence of the private and sensitive data cannot be pursued by the intruder. Combination of cryptography with steganography gives a powerful impact. It becomes a tedious task for the steganalyst to break the code. There are several techniques for performing steganography, out of which LSB is the widely used technique. Limitations of these techniques are like, it degrades the quality of the cover image, blurring, less amount of data can be hidden. Zero Distortion Technique has been proposed to overcome these limitations. Proposed technique consider the image only as a reference and hides data in the locations of the image. The bits of the cover image remains untouched which provides zero distortion in the cover image chaotic sequence is used to encrypt the elements of location matrix. Experimental results on certain color images gives better results in terms of amount of data which can be hidden i.e. in RGB bands. Proposed technique is efficient as there is no distortion in the cover image.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Dark energy survey year 1 results: Cosmological constraints from cluster abundances and weak lensing

arXiv

引用

arXiv 2020年

作者： Abbott, T.M.C. Aguena, M. Alarcon, A. Allam, S. Allen, S. Annis, J. Avila, S. Bacon, D. Bechtol, K. Bermeo, A. Bernstein, G.M. Bertin, E. Bhargava, S. Bocquet, S. Brooks, D. Brout, D. Buckley-Geer, E. Burke, D.L. Carnero Rosell, A. Carrasco Kind, M. Carretero, J. Castander, F.J. Cawthon, R. Chang, C. Chen, X. Choi, A. Costanzi, M. Crocce, M. da Costa, L.N. Davis, T.M. de Vicente, J. DeRose, J. Desai, S. Diehl, H.T. Dietrich, J.P. Dodelson, S. Doel, P. Drlica-Wagner, A. Eckert, K. Eifler, T.F. Elvin-Poole, J. Estrada, J. Everett, S. Evrard, A.E. Farahi, A. Ferrero, I. Flaugher, B. Fosalba, P. Frieman, J. García-Bellido, J. Gatti, M. Gaztanaga, E. Gerdes, D.W. Giannantonio, T. Giles, P. Grandis, S. Gruen, D. Gruendl, R.A. Gschwend, J. Gutierrez, G. Hartley, W.G. Hinton, S.R. Hollowood, D.L. Honscheid, K. Hoyle, B. Huterer, D. James, D.J. Jarvis, M. Jeltema, T. Johnson, M.W.G. Johnson, M.D. Kent, S. Krause, E. Kron, R. Kuehn, K. Kuropatkin, N. Lahav, O. Li, T.S. Lidman, C. Lima, M. Lin, H. MacCrann, N. Maia, M.A.G. Mantz, A. Marshall, J.L. Martini, P. Mayers, J. Melchior, P. Mena-Fernández, J. Menanteau, F. Miquel, R. Mohr, J.J. Nichol, R.C. Nord, B. Ogando, R.L.C. Palmese, A. Paz-Chinchón, F. Plazas, A.A. Prat, J. Rau, M.M. Romer, A.K. Roodman, A. Rooney, P. Rozo, E. Rykoff, E.S. Sako, M. Samuroff, S. Sánchez, C. Sanchez, E. Saro, A. Scarpine, V. Schubnell, M. Scolnic, D. Serrano, S. Sevilla-Noarbe, I. Sheldon, E. Allyn. Smith, J. Smith, M. Suchyta, E. Swanson, M.E.C. Tarle, G. Thomas, D. To, C. Troxel, M.A. Tucker, D.L. Varga, T.N. von der Linden, A. Walker, A.R. Wechsler, R.H. Weller, J. Wilkinson, R.D. Wu, H. Yanny, B. Zhang, Y. Zhang, Z. Zuntz, J. Collaboration, D.E.S. Cerro Tololo Inter-American Observatory National Optical Astronomy Observatory Casilla 603 La Serena Chile Departamento de Física Matemática Instituto de Física Universidade de São Paulo CP 66318 São Paulo SP05314-970 Brazil Laboratório Interinstitucional de e-Astronomia - LIneA Rua Gal. José Cristino 77 Rio de Janeiro RJ20921-400 Brazil Barcelona08034 Spain Campus UAB Carrer de Can Magrans s/n Barcelona08193 Spain Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States Department of Physics Stanford University 382 Via Pueblo Mall StanfordCA94305 United States Instituto de Fisica Teorica UAM/CSIC Universidad Autonoma de Madrid Madrid28049 Spain Institute of Cosmology and Gravitation University of Portsmouth PortsmouthPO1 3FX United Kingdom LSST 933 North Cherry Avenue TucsonAZ85721 United States Physics Department 2320 Chamberlin Hall University of Wisconsin-Madison 1150 University Avenue MadisonWI53706-1390 United States Department of Physics and Astronomy Pevensey Building University of Sussex BrightonBN1 9QH United Kingdom Department of Physics and Astronomy University of Pennsylvania PhiladelphiaPA19104 United States CNRS UMR 7095 Institut d'Astrophysique de Paris ParisF-75014 France Sorbonne Universités UPMC Univ Paris 06 UMR 7095 Institut d'Astrophysique de Paris ParisF-75014 France Argonne National Laboratory 9700 South Cass Avenue LemontIL60439 United States Faculty of Physics Ludwig-Maximilians-Universität Scheinerstr. 1 Munich81679 Germany Department of Physics & Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Kavli Institute for Particle Astrophysics & Cosmology Stanford University P. O. Box 2450 StanfordCA94305 United States SLAC National Accelerator Laboratory Menlo ParkCA94025 United States Madrid Spain Department of Astronomy University of Illinois at Urbana-Champaign 1002 W. Green Street UrbanaIL61801 United States National Center

We perform a joint analysis of the counts and weak lensing signal of redMaPPer clusters selected from the Dark Energy Survey (DES) Year 1 dataset. Our analysis uses the same shear and source photometric redshifts estimates as were used in the DES combined probes analysis. Our analysis results in surprisingly low values for S8 = σ8(Ωm/0.3)0.5 = 0.65 ± 0.04, driven by a low matter density parameter, Ωm = 0.179+0−0..031038, with σ8 − Ωm posteriors in 2.4σ tension with the DES Y1 3x2pt results, and in 5.6σ with the Planck CMB analysis. These results include the impact of post-unblinding changes to the analysis, which did not improve the level of consistency with other data sets compared to the results obtained at the unblinding. The fact that multiple cosmological probes (supernovae, baryon acoustic oscillations, cosmic shear, galaxy clustering and CMB anisotropies), and other galaxy cluster analyses all favor significantly higher matter densities suggests the presence of systematic errors in the data or an incomplete modeling of the relevant physics. Cross checks with X-ray and microwave data, as well as independent constraints on the observable-mass relation from SZ selected clusters, suggest that the discrepancy resides in our modeling of the weak lensing signal rather than the cluster abundance. Repeating our analysis using a higher richness threshold (λ ≥ 30) significantly reduces the tension with other probes, and points to one or more richness-dependent effects not captured by our model. Copyright © 2020, The Authors. All rights reserved.

关键词： Systematic errors

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Cloud Services with Profit Optimization

引用

Procedia computer science 2015年 54卷 24-30页

作者： M. Jaiganesh B. Ramadoss A. Vincent Antony Kumar S. Mercy Department of Information Technology PSNA College of Engg. and Tech Dindigul Tamilnadu India Department of Computer Applications National Institute of Technology Thiruchirappalli Tamilnadu India Department of Information Science & Engineering Banglore Institute of Technology Banglore Karnataka India

Cloud computing is a promising computing paradigm which allows distribution of services from a pool of resources. The services are required by the clients through on-demand via pay and use method. The greatest utilization of resources and maximum profits with scheduling is the main goal of the cloud service providers. The major issue in cloud computing is scheduling of services with improved global throughput and job scheduling. Since, cloud computing is a service based one, the performance evaluation is an important criteria to be dealt with. In this paper, we propose a Priority based Queuing model to evaluate the services leased by the cloud service providers. We consider general service time and response time for arriving requests and the waiting requests are stored in the queue. The services are considered to be SaaS (Software as a Service), PaaS (Platform as a Service) and IaaS (Infrastructure as a Service). We construct this using Queuing model with markovian arrival rate, general service rate, ‘m’ number of servers, priority queue discipline and a buffer of size ‘r’. The advantage of the proposed analytical model is within the time span, the cloud service provider schedules his services to result in maximum profit.

关键词： Performance evaluation Cloud computing Profit optimization Queuing model.

来源：评论

学校读者我要写书评

暂无评论

A New Evolutionary Multi-objective Algorithm for Convex Hull Maximization

A New Evolutionary Multi-objective Algorithm for Convex Hull...

引用

IEEE Congress on Evolutionary Computation

作者： Wenjing Hong Guanzhou Lu Peng Yang Yong Wang Ke Tang USTC-Birmingham Joint Research Institute in Intelligent Computation and its Applications (UBRI) School of Computer Science and Technology University of Science and Technology of China Hefei China 230027 School of Information Science and Engineering Central South University Changsha China 410083

ISBN: (纸本)9781479974931

Many real-world problems often have several, usually conflicting objectives. Traditional multi-objective optimization problems (MOPs) usually search for the Pareto-optimal solutions for this predicament. A special class of MOPs, the convex hull maximization problems which prefer solutions on the convex hull, has posed a new challenge for existing approaches for solving traditional MOPs, as a solution on the Pareto front is not necessarily a good solution for convex hull maximization. In this work, the difference between traditional MOPs and the convex hull maximization problems is discussed and a new Evolutionary Convex Hull Maximization Algorithm (ECHMA) is proposed to solve the convex hull maximization problems. Specifically, a Convex Hull-based sorting with Convex Hull of Individual Minima (CH-CHIM-sorting) is introduced, as well as a novel selection scheme, Extreme Area Extract-based selection (EAE-selection). Experimental results show that ECHMA significantly outperforms the existing approaches for convex hull maximization and evolutionary multi-objective optimization approaches in achieving a better approximation to the convex hull more stably and with a more uniformly distributed set of solutions.

关键词： multi-objective optimization convex hull maximization multi-objective evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

QACtools: A Quality Assessment and Quality Control Tool for Next-Generation Sequencing Data

QACtools: A Quality Assessment and Quality Control Tool for ...

引用

2015年中国智能自动化学术会议

作者： Dandan Song Ning Li Lejian Liao Beijing Lab of Intelligent Information Technology School of Computer Science and Technology Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology

In recent years, next-generation sequencing technologies have been widely used, and are rapidly changing the landscape of genetics with unimaginable speed. However, the preliminary quality control regulations including trimming adaptor sequences, quality statistics, and depth and coverage statistics need to be applied to raw reads before further analysis. QACtools implements various utilities for processing raw reads in the FASTQ format and alignments in the BAM *** analyzes some relevant properties of next-generation sequencing data such as average read length, base quality scores, and so on. Additionally, to our knowledge,none of the other tools support depth and coverage statistic that have been provided in our tool for analysis of large DNA sequencing data. It is crucial for overcoming errors in base calling and assembly. We suppose tool is useful for the quality control of NGS data to perform further analysis. This software is an open source application freely available at https://***/projects/qactools/.

关键词： NGS data analysis Quality control FASTQ format BAM format

来源：评论

学校读者我要写书评

暂无评论

An approach to mining information from telephone graph using graph mining techniques

An approach to mining information from telephone graph using...

引用

International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)

作者： Bapuji Rao S. N. Mishra R&D Raconsys Consultancy Services Pvt. Ltd Bhubaneswar India Dept. of Computer Science Engineering and Applications Indira Gandhi Institute of Technology (IGIT) Sarang India

ISBN: (纸本)9781467392228

Among various properties of social network, one of the important properties is to study strong community effect where social entity in a network forms a group which is closely connected. Groups formed out of such properties are communities, clusters, cohesive subgroups or modules. The authors have observed that individuals interact more frequently within a group rather than group interaction. Detection of similar groups in a social network is known as community detection. Finding such type of communities and analyzing, helps in knowledge and pattern mining. This paper focuses on methods to study a real world social network communications using the basic concepts of graph theory. For this purpose, the authors have considered telephone network. The authors have proposed an algorithm for extracting different network provider's sub-graphs, weak and strong connected sub-graphs and extracting incoming and outgoing calls of subscribers which have direct application for studying the human behavior in telephone network. The proposed algorithm has been implemented in C++ programming language and obtained satisfactory result.

关键词： Social network services Writing Collaboration Electronic mail Knowledge engineering Graph theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：