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

IEEE Conference on Network Softwarization (NetSoft)

作者： Niels Bouten Maxim Claeys Rashid Mijumbi Jeroen Famaey Steven Latré Joan Serrat Department of Mathematics and Computer Science University of Antwerp Antwerp Belgium Department of Information Technology iMinds Ghent Belgium Telecommunications Software and Systems Group Waterford Institute of Technology Ireland Network Engineering Department Universitat Politècnica de Catalunya Barcelona Spain

Network Function Virtualization (NFV) has been proposed as a paradigm to increase the cost-efficiency, flexibility and innovation in network service provisioning. By leveraging IT virtualization techniques in combination with programmable networks, NFV is able to decouple network functionality from the physical devices on which they are deployed. This opens up new business opportunities for both Infrastructure Providers (InPs) as well as Service Providers (SPs), where the SP can request to deploy a chain of Virtual Network Functions (VNFs) on top of which its service can run. However, current NFV approaches lack the possibility for SPs to define location requirements and constraints on the mapping of virtual functions and paths onto physical hosts and links. Nevertheless, many scenarios can be envisioned in which the SP would like to attach placement constraints for efficiency, resilience, legislative, privacy and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SPs to define such placement restrictions. This newfound ability to add constraints to Service Function Chain (SFC) requests also introduces an additional risk that SFCs with conflicting constraints are requested or automatically generated. Therefore, a framework is proposed that allows the InP to check the validity of a set of constraints and provide feedback to the SP. To achieve this, the SFC request and relevant information on the physical topology are modeled as an ontology of which the consistency can be checked using a semantic reasoner. Enabling semantic validation of SFC requests, eliminates inconsistent SFCs requests from being transferred to the embedding algorithm.

关键词： Semantics Virtualization Indium phosphide III-V semiconductor materials Resilience Privacy Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Opinion mining on Twitter data for airline services

Opinion mining on Twitter data for airline services

引用

2015 5th International Workshop on computer science and engineering: Information Processing and Control engineering, WCSE 2015-IPCE

作者： Pugsee, Pakawan Chongvisuit, Tuangrath Nakorn, Kananant Na Innovative Network and Software Engineering Technology Laboratory Department of Mathematics and Computer Science Faculty of Science Chulalongkorn University Bangkok10330 Thailand

Opinion mining on Twitter data for airline services is a valuable application which assists user in collecting messages expressing the positive opinion or the negative comment. The objective of the application is to analyze messages about airline services on Twitter data by sentiment analysis. The proposed technique uses information about syntax and semantics of words in the message to define features before learning by Naïve Bayes and generate the classification model. Then, this application can classify opinions or comments about the airline services on the variety of Twitter messages. Therefore, customers of airline services can know how good the service quality is. In addition, the airline service providers can improve services by customer satisfaction and also meet customer requirements. Furthermore, the application can help users to collect the information to make a decision for airline services. The result of application performance testing shows that the accuracy and the precision are about 70%.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

High-availability Deployment for Large Enterprises

High-availability Deployment for Large Enterprises

引用

2016 IEEE International Conference on Progress in Informatics and Computing

作者： Huahui Lyu Ping Li Ruihong Yan Hongjie Qian Bin Sheng Information Department China Southern Power Grid Department of Mathematics and Information Technology The Education University of Hong Kong Department of Computer Science and Engineering Shanghai Jiao Tong University UM-SJTU Joint Institute Shanghai Jiao Tong University The State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences

With the explosive growth of data capacity, large enterprises increasingly rely on business information systems. A highly informational and data-centralized grid company that engages in high-frequency businesses will face major business failures, incalculable impacts and irreparable damages once data errors occur. The development of an effective high-availability information system has become a hot topic for grid companies. Based on the analysis of pioneer enterprises or businesses(mainly IT enterprises), this paper summarizes the development mode of gradual deployment, and further proposes an extended architecture suitable for large enterprises such as grid companies in order to provide references and suggestions for the gradual deployment of high-availability information systems.

关键词： cloud computing gradual deployment grid company high availability

来源：评论

学校读者我要写书评

暂无评论

An extended catalog of galaxy-galaxy strong gravitational lenses discovered in DES using convolutional neural networks

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Report on the fourth workshop on sustainable software for science: practice and experiences (WSSSPE4)

arXiv

引用

arXiv 2017年

作者： Katz, Daniel S. Niemeyer, Kyle E. Gesing, Sandra Hwang, Lorraine Bangerth, Wolfgang Hettrick, Simon Idaszak, Ray Salac, Jean Chue Hong, Neil Núñez-Corrales, Santiago Allen, Alice Geiger, R. Stuart Miller, Jonah Chen, Emily Dubey, Anshu Lago, Patricia University of Illinois Urbana–ChampaignIL United States School of Mechanical Industrial and Manufacturing Engineering Oregon State University CorvallisOR United States Center for Research Computing Department of Computer Science and Engineering University of Notre Dame IN United States University of California DavisCA United States Department of Mathematics Colorado State University Fort CollinsCO United States Software Sustainability Institute Southampton United Kingdom RENCI University of North Carolina at Chapel Hill Chapel HillNC United States University of Virginia CharlottesvilleVA United States University of Edinburgh United Kingdom University of Illinois at Urbana-Champaign IL United States Astrophysics Source Code Library Astronomy Department University of Maryland College ParkMD United States BerkeleyCA United States Perimeter Institute for Theoretical Physics Department of Physics University of Guelph GuelphON Canada University of Illinois at Urbana-Champaign United States Mathematics and Computer Science Division Argonne National Laboratory LemontIL United States University of Chicago ChicagoIL United States Vrije Universiteit Amsterdam Netherlands

This report records and discusses the Fourth Workshop on Sustainable software for science: Practice and Experiences (WSSSPE4). The report includes a description of the keynote presentation of the workshop, the mission and vision statements that were drafted at the workshop and finalized shortly after it, a set of idea papers, position papers, experience papers, demos, and lightning talks, and a panel discussion. The main part of the report covers the set of working groups that formed during the meeting, and for each, discusses the participants, the objective and goal, and how the objective can be reached, along with contact information for readers who may want to join the group. Finally, we present results from a survey of the workshop attendees. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROscience 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

Identification of FIR systems with Quantized Inputs and Observations

引用

IFAC-PapersOnLine 2015年第28期48卷 674-679页

作者： Guo, Jin Wang, Le Yi Yin, George Zhao, Yanlong Zhang, Ji-Feng School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Department of Electrical and Computer Engineering Wayne State University DetroitMI48202 United States Department of Mathematics Wayne State University DetroitMI48202 United States Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

This paper introduces identification algorithms for finite impulse response systems under quantized output observations and general quantized inputs. While asymptotically efficient algorithms for quantized identification under periodic inputs are available, their counterpart under general inputs has encountered technical difficulties and evaded satisfactory resolutions. Under quantized inputs, this paper resolves this issue with constructive solutions. A two-step algorithm is developed, which demonstrates desired convergence properties including strong convergence, mean-square convergence, convergence rates, asymptotic normality, and asymptotical efficiency in terms of the Cramér-Rao lower bound. Some essential conditions on input excitation are derived that ensure identifiability and convergence. It is shown that by a suitable selection of the algorithm's weighting matrix, the estimates become asymptotically efficient. The strong and mean-square convergence rates are explicitly obtained. Optimal input design is discussed. Numerical examples are included to illustrate the main results of this paper © 2015

关键词： FIR filters Efficiency Identification (control systems) Impulse response Asymptotic efficiency Asymptotically efficient Finite impulse response system Identification algorithms Input design Mean square convergences non periodic input quantization

来源：评论

学校读者我要写书评

暂无评论

Covering the egonet: A crowdsourcing approach to social circle discovery on twitter 9

Covering the egonet: A crowdsourcing approach to social circ...

引用

9th International Conference on Web and Social Media, ICWSM 2015

作者： Dykstra, Karmen Lijffijt, Jefrey Gionis, Aristides Department of Information and Computer Science Aalto University Finland Intelligent Systems Laboratory Department of Engineering Mathematics University of Bristol United Kingdom

ISBN: (纸本)9781577357339

Twitter and other social media provide the functionality of manually grouping users into lists. The goal is to enable selective viewing of content and easier information acquisition. However, creating lists manually requires significant time and effort. To mitigate this effort, a number of recent methods attempt to create lists automatically using content and/or network structure, but results are far from perfect. In this work, we study the power of the millions of lists that are already created by other twitter users in order to "crowdsource" the task of list creation. We find that in a large dataset, collected specifically for this study, an optimal matching of existing lists from other twitter users to the ground-truth lists in ego nets gives an F1score of 0:43, while the best existing method achieves only 0:*** explore the informativeness of features derived from network structure, existing lists, and posted content. We observe that different types of features are informative for different lists, and introduce a simple algorithm for ranking candidate lists. The proposed algorithm outperforms existing methods, but still falls short of the optimal selection of existing lists. © Copyright 2015, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Curse of Dimensionality and Variable Selection in Nonlinear Non-parametric System Identification

引用

IFAC-PapersOnLine 2015年第28期48卷 1279-1284页

作者： Bai, Er-Wei Zhao, Wenxiao Zheng, Wei Xing University of Iowa Department of Electrical and Computer Engineering Iowa52242 United States School of Electronics Electrical Engineering and Computer Science Queens University Belfast United Kingdom Key Laboratory of Systems and Control Academy of Mathematics and Systems Science National Center for Mathematics and Interdisciplinary Sciences Chinese Academy of Sciences Queens University Beijing China School of Computing Engineering and Mathematics University of Western Sydney Chinese Academy of Sciences PenrithNSW2751 Australia

The problem of variable selection in system identification of a high dimensional nonlinear non-parametric system is described. The inherent difficulty, the curse of dimensionality, is introduced. Some recent results of variable selection in system identification are presented. Finally, a simulation example is given to justify the theoretical results. © 2015

关键词： Parameter estimation Religious buildings Curse of dimensionality High dimensional Non parametric Simulation example Variable selection

来源：评论

学校读者我要写书评

暂无评论

Omnidirectional chargability with directional antennas

Omnidirectional chargability with directional antennas

引用

International Conference on Network Protocols

作者： Haipeng Dai Xiaoyu Wang Alex X. Liu Fengmin Zhang Yang Zhao Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu CHINA Department of Computer Science and Engineering Michigan State University East Lansing MI USA Shanghai key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai CHINA

ISBN: (纸本)9781509032822

Wireless Power Transfer (WPT) has received more and more attentions because of its convenience and reliability. In this paper, we first propose the notion of omnidirectional charging by which an area is omnidirectionally charged if a device with directional antennas at any position in the area with any orientation can be charged by directional chargers with power being no smaller than a given threshold. We present our empirical charging model based on field experimental results using off-the-shelf WPT products. Next, we consider the problem of detecting whether the target area achieves omnidirectional charging given a deterministic deployment of chargers. We develop piecewise constant approximation and area discretization techniques to partition the target area into subareas and approximate powers from chargers as constants. Then we propose the Minimum Coverage Set extraction technique which reduces the continuous search space to a discrete one and thereby allows a fast detection algorithm. Moreover, we consider the problem of determining the probability that the target area achieves omnidirectional charging given a random deployment of chargers. We first replace the target area by grid points on triangular lattices to reduce the search space from infinite to finite, then approximate chargers' power with reasonable relaxation, and derive an upper bound of the omnidirectional charging probability. Finally, we conduct both simulation and field experiments, and the results show that our algorithm outperforms comparison algorithms by at least 120%, and the consistency degree of our theoretical results and field experimental results is larger than 93.6%.

关键词： Wireless sensor networks Wireless communication Directional antennas Adaptation models Joining processes Conferences Protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：