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

International Conference on Information science and Applications (ICISA)

作者： Doo soo Chang Yong suk Choi Dept. of Computer and Software Hanyang University Seoul Korea Division of Computer Science and Engineering Hanyang University Seoul Korea

Question and answer archives have become useful information resources with increase of community based question and answer service. For effective question and answering system, it is important to find semantically similar questions and retrieve its answer from the archive for user's question. In this paper, we propose a weighted combination of retrieval models for question and answer archives. In contrast to well-known translation based language model, the proposed model reflects significance of each word in user's question by giving variant weight to the word depending on its part-of-speech. In experiment, our model improves performance considerably when compared to conventional ones.

关键词： Information retrieval Probability Computational modeling Estimation Research and development Educational institutions Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

FB+-tree: Indexing based on key ranges

FB+-tree: Indexing based on key ranges

引用

IEEE International Conference on Networking, Sensing and Control

作者： Cui Yu Josef Boyd Dept. Computer Science & Software Engineering Monmouth University West Long Branch NJ USA

The present idea is a fast indexing technique that builds an indexing structure based on multi-level key ranges typically for large data storage systems. It is explained based on the B + -tree and designed to reside in main memory. Point searches and range searches are helped by early termination of searches for non-existent data. Range searches can be processed depth-first or breath-first. One group of multiple searches can be processed with one pass on the indexing structure to minimize total cost. Implementation options and strategies are explained to show the flexibility of this technology for easy adaption and high efficiency. This indexing structure can be tuned to speed up queries directed at popular ranges of index or index ranges of particular interest to the user.

关键词： Lead

来源：评论

学校读者我要写书评

暂无评论

The Impact of Static and Dynamic Pairs on Pair Programming

The Impact of Static and Dynamic Pairs on Pair Programming

引用

International Conference on Secure software Integration and Reliability Improvement Companion (SSIRI-C)

作者： Rajendran Swamidurai David Umphress Department of Mathematics and Computer Science Alabama State University Montgomery USA Dept. of Computer Science and Software Engineering Auburn University Auburn USA

Pair programming is a programming technique in which pair of people doing programming on a single machine. The programming pair consists of a driver and a navigator or observer. The driver addresses the operational issues; i.e., responsible for implementing the current module in hand. The navigator addresses the strategic issues; i.e., keeps in mind the strategic direction the code must take. Pair programming is a dynamic process and pairing aids the rapid dispersal of system knowledge through the team while developing it. Since most of the pair programming experiments were not conducted as described in extreme programming and the empirical evidence of pair programming is mixed we were not got the true picture about the impact created by pair programming on software development. In this paper, we evaluated the dynamic pair programming methodology with static pair programming and traditional individual programming. The empirical evidence shows that static pair programming is the most expensive and slower technology than dynamic pair programming and individual programming technologies. It also indicates that dynamic pair programming is the fastest software development methodology than static pair programming and traditional individual programming methodologies.

关键词： software Dynamic programming Programming profession IP networks Educational institutions Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Investigating the impact of peer code review and pair programming on test-driven development

Investigating the impact of peer code review and pair progra...

引用

IEEE Southeastcon

作者： Rajendran Swamidurai Brad Dennis Uma Kannan Department of Mathematics and Computer Science Alabama State University Montgomery USA Dept. of Computer Science and Software Engineering Auburn University Auburn USA

Pair programming and peer code review are two collaborative inspection methods that improve the quality of software. These light-weight review techniques are low-cost alternatives to formal inspections and rigorous reviews that commonly remove 90% of software defects before even the first test case is run. While pair programming has many advocates, evidence suggests that pair programming is not as useful as claimed and the requirement of the pairs to co-locate is hindrance on many development projects. Peer code reviews, however, have been shown to be just as effective as pair programming and are a better fit for many of today's software efforts that are being developed collaboratively, but asynchronously, in the cloud. In this paper we demonstrate peer review's effectiveness as compared to pair programming in the context of Test Driven Development (TDD), a popular agile programming technique that's rapidly gaining mainstream acceptance. The empirical evidence also shows that equal quality programs can be produced at a lower cost (28% less than pair programming) using a peer review technique in TDD as compared with traditional pair programming.

关键词： software Context software measurement

来源：评论

学校读者我要写书评

暂无评论

Scalable Security Analysis Using a Partition and Merge Approach in an Infrastructure as a Service Cloud

Scalable Security Analysis Using a Partition and Merge Appro...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Jin B. Hong Taehoon Eom Jong Sou Park Dong Seong Kim Dept. of Computer Science and Software Engineering University of Canterbury Christchurch New Zealand Dept. of Computer Engineering Korea Aerospace University Seoul South Korea

Attack representation models (ARMs), such as an Attack Graph and Attack Tree, are widely used for security modeling and analysis. However, they suffer from a scalability problem if the size of a networked system becomes too large. Previous work focused on model simplifications (also known as pruning), but it may lose security information. To cope with the scalability problem without losing any security information, we propose to use a partition and merge approach (PMA) in an Infrastructure as a Service (IaaS) Cloud. The ARM is simplified into many sub-ARMs in the partition process, and the results obtained from them are combined in the merge process. We conduct a performance analysis using the PMA and we compare it against an exhaustive search method.

关键词： Security Scalability Cloud computing Computational complexity Logic gates Conferences Joining processes

来源：评论

学校读者我要写书评

暂无评论

THE ASTROPY PROJECT: BUILDING AN INCLUSIVE, OPEN-science PROJECT AND STATUS OF THE V2.0 CORE PACKAGE

arXiv

引用

arXiv 2018年

作者： Price-Whelan, A.M. Günther, H.M. Lim, P.L. Crawford, S.M. Conseil, S. Shupe, D.L. Craig, M.W. Dencheva, N. Ginsburg, A. VanderPlas, J.T. Bradley, L.D. Pérez-Suárez, D. de Val-Borro, M. Aldcroft, T.L. Cruz, K.L. Robitaille, T.P. Tollerud, E.J. Ardelean, C. Babej, T. Bachetti, M. Bamford, S.P. Barentsen, G. Barmby, P. Baumbach, A. Biscani, F. Boquien, M. Bostroem, K.A. Bouma, L.G. Brammer, G.B. Breytenbach, H. Buddelmeijer, H. Burke, D.J. Calderone, G. Cara, M. Cardoso, J.V.M. Cheedella, S. Copin, Y. Crichton, D. D’Avella, D. Deil, C. Depagne, É. Dietrich, J.P. Donath, A. Droettboom, M. Earl, N. Erben, T. Fabbro, S. Ferreira, L.A. Garrison, L.H. Gibbons, S.L.J. Goldstein, D.A. Gommers, R. Greco, J.P. Greenfield, P. Groener, A.M. Hagen, A. Hirst, P. Homeier, D. Horton, A.J. Hosseinzadeh, G. Hu, L. Hunkeler, J.S. Ivezić, Ž. Jain, A. Jenness, T. Kanarek, G. Kendrew, S. Kern, N.S. Kerzendorf, W.E. King, J. Kirkby, D. Kulkarni, A.M. Kumar, A. Lee, A. Lenz, D. Littlefair, S.P. Ma, Z. Macleod, D.M. Mastropietro, M. McCully, C. Montagnac, S. Morris, B.M. Mueller, M. Mumford, S.J. Muna, D. Murphy, N.A. Nelson, S. Nguyen, G.H. Ninan, J.P. Nöthe, M. Ogaz, S. Oh, S. Parejko, J.K. Parley, N. Pascual, S. Patil, A.A. Plunkett, A.L. Prochaska, J.X. Janga, V. Reddy Sabater, J. Sakurikar, P. Sherbert, L.E. Shih, A.Y. Sick, J. Singanamalla, S. Singer, L.P. Sladen, P.H. Streicher, O. Teuben, P. Thomas, S.W. Tremblay, G.R. Turner, J.E.H. Terrón, V. van Kerkwijk, M.H. de la Vega, A. Watkins, L.L. Weaver, B.A. Whitmore, J.B. Woillez, J. Department of Astrophysical Sciences Princeton University PrincetonNJ08544 United States Kavli Institute for Astrophysics and Space Research Massachusetts Institute of Technology 70 Vassar St. CambridgeMA02139 United States Space Telescope Science Institute 3700 San Martin Dr. BaltimoreMD21218 United States South African Astronomical Observatory PO Box 9 Observatory Cape Town7935 South Africa Univ Lyon Univ Lyon1 Ens de Lyon CNRS Centre de Recherche Astrophysique de Lyon UMR5574 Saint-Genis-LavalF-69230 France Caltech/IPAC 1200 E. California Blvd PasadenaCA91125 United States Department of Physics and Astronomy Minnesota State University Moorhead 1104 7th Ave S MoorheadMN56563 United States National Radio Astronomy Observatory 1003 Lopezville Rd SocorroNM87801 United States eScience Institute University of Washington 3910 15th Ave NE SeattleWA98195 United States University College London/Research IT Services Gower St LondonWC1E 6BT United Kingdom Astrochemistry Laboratory NASA Goddard Space Flight Center 8800 Greenbelt Road GreenbeltMD20771 United States Harvard-Smithsonian Center for Astrophysics 60 Garden St. CambridgeMA02138 United States Department of Physics and Astronomy Hunter College City University of New York 695 Park Avenue New YorkNY10065 United States Physics Graduate Center of the City University of New York New YorkNY United States Department of Astrophysics American Museum of Natural History New YorkNY United States Aperio Software Ltd. Headingley Enterprise and Arts Centre Bennett Road LeedsLS6 3HN United Kingdom Department of Physics & Astronomy University of Western Ontario 1151 Richmond St LondonONN5X4H1 Canada Department of Theoretical Physics & Astrophysics Masaryk University Kotlarska 2 Brno61137 Czech Republic INAF-Osservatorio Astronomico di Cagliari via della Scienza 5 SelargiusI-09047 Italy School of Physics & Astronomy University of Nottingham University Park NottinghamNG7 2RD Unit

The Astropy project supports and fosters the development of open-source and openly-developed Python packages that provide commonly-needed functionality to the astronomical community. A key element of the Astropy project is the core package astropy, which serves as the foundation for more specialized projects and packages. In this article, we provide an overview of the organization of the Astropy project and summarize key features in the core package as of the recent major release, version 2.0. We then describe the project infrastructure designed to facilitate and support development for a broader ecosystem of inter-operable packages. We conclude with a future outlook of planned new features and directions for the broader Astropy project. Copyright © 2018, The Authors. All rights reserved.

关键词： Astrophysics

来源：评论

学校读者我要写书评

暂无评论

Exploiting community emotion for microblog event detection

Exploiting community emotion for microblog event detection

引用

2014 Conference on Empirical Methods in Natural Language Processing, EMNLP 2014

作者： Ou, Gaoyan Chen, Wei Wang, Tengjiao Wei, Zhongyu Li, Binyang Yang, Dongqing Wong, Kam-Fai Key Laboratory of High Confidence Software Technologies Ministry of Education China School of Electronics Engineering and Computer Science Peking University China Shenzhen Research Institute Chinese University of Hong Kong Hong Kong Dept. of Information Science and Technology University of International Relations China

ISBN: (纸本)9781937284961

Microblog has become a major platform for information about real-world events. Automatically discovering realworld events from microblog has attracted the attention of many researchers. However, most of existing work ignore the importance of emotion information for event detection. We argue that people's emotional reactions immediately reflect the occurring of real-world events and should be important for event detection. In this study, we focus on the problem of communityrelated event detection by community emotions. To address the problem, we propose a novel framework which include the following three key components: microblog emotion classification, community emotion aggregation and community emotion burst detection. We evaluate our approach on real microblog data sets. Experimental results demonstrate the effectiveness of the proposed framework. © 2014 Association for Computational Linguistics.

关键词： Behavioral research

来源：评论

学校读者我要写书评

暂无评论

A Round Robin with Multiple Feedback Job Scheduler in Hadoop

A Round Robin with Multiple Feedback Job Scheduler in Hadoop

引用

2014 IEEE International Conference on Progress in Informatics and Computing

作者： Yintian Wang Ruonan Rao Yinglin Wang School of Software Shanghai Jiaotong University Dept. of Computer Science & Engineering Shanghai Jiaotong University Dept. of Computer Science and Technology Shanghai University of Finance and Economics

Hadoop is a distributed software platform for processing big data on a large cluster, which implements core mechanism of Google's GFS and MapR educe. The MapR educe job scheduling algorithm is one of the core technologies of Hadoop. The default job scheduler of Hadoop is FIFO, which will start the job in the order as itis submitted, and this causes the job tobe started later when itis submitted later. This paper uses the round robin with a multiple feedback algorithm tosolve this problem. With this scheduler, the job which is submitted late, will get quick response and be started without long delay. And the results of experiments on the Hadoop benchmark GridM ix indicate that this algorithm can reduce the average response time by 10%-50%.

关键词： Map Reduce Hadoop Job Schedule round-robin with multiple feedback

来源：评论

学校读者我要写书评

暂无评论

A framework for the service provisioning of community-contributed web APIs

A framework for the service provisioning of community-contri...

引用

Canadian Conference on Electrical and computer engineering (CCECE)

作者： Daniel Vijayakumar Qusay H. Mahmoud School of Computer Science University of Guelph Guelph Canada Dept. of Electrical Computer and Software Engineering Institute of Technology Oshawa Canada

With the increased adoption of cloud computing in recent years due to its projected benefits as a computing-as-a-utility paradigm, the industry has consequently seen a rise in software-as-a-service via Web services. Serving as a safe and valuable interface between the provider's data and outsider parties who have a potential use for the data, services allow developers to enhance the value of their applications by integrating with them. Initially, standardization and research efforts were geared largely towards enterprise use-cases of Web services. This resulted in the global Web service vision becoming largely privatized. But in recent years, the number and diversity of Web APIs have increased tremendously and developers have additionally become more open and decentralized. This poses the interesting problem of aggregating the vast number of distributed codebases and exposing them as consumable services for the benefit of all. The existing enterprise-oriented standards are unable to cater to such a scenario. We respond to this by presenting an alternative to the status quo of service registries. We specifically argue for the feasibility of a RESTful framework for the design and implementation of an open service registry that serves a community of Web services that can be contributed to or consumed by any developer on the Web.

关键词： Standards Prototypes Servers Mashups Registers Communities

来源：评论

学校读者我要写书评

暂无评论

Service Security for Smart Grid System

Service Security for Smart Grid System

引用

International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

作者： Inshil Doh Jiyoung Lim Kijoon Chae Dept. of Computer Science and Engineering Ewha Womans University Seoul Korea Dept. of Computer Software Korean Bible University Seoul Korea

ISBN: (纸本)9781479978915

One of major application service areas in M2M (Machine-to-Machine) is the smart grid system. In smart grid systems, information and communications technology are used to gather and act on information that is related to the behaviors of consumers and suppliers. The technology is to improve the efficiency, reliability, and economics of the production and distribution of electricity. To make the system more reliable, security is a very important issue. In this paper, we propose secure system architecture and a mechanism to provide security for smart grid system robustness and reliability.

关键词： Smart grids Servers Encryption Privacy Smart meters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：