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

21st Annual Conference on World Wide Web, WWW'12

作者： Adeyanju, Ibrahim Song, Dawei Albakour, M-Dyaa Kruschwitz, Udo De Roeck, Anne Fasli, Maria IDEAS Research Institute Robert Gordon University St Andrews Street Aberdeen AB25 1HG United Kingdom School of Computer Science and Electronic Engineering University of Essex Wivenhoe Park Colchester C04 3SQ United Kingdom Centre for Research in Computing Open University Walton Hall Milton Keynes MK7 6AA United Kingdom

ISBN: (纸本)9781450312301

Query recommendation is becoming a common feature of web search engines especially those for Intranets where the context is more restrictive. This is because of its utility for supporting users to find relevant information in less time by using the most suitable query terms. Selection of queries for recommendation is typically done by mining web documents or search logs of previous users. We propose the integration of these approaches by combining two models namely the concept hierarchy, typically built from an Intranet's documents, and the query flow graph, typically built from search logs. However, we build our concept hierarchy model from terms extracted from a subset (training set) of search logs since these are more representative of the user view of the domain than any concepts extracted from the collection. We then continually adapt the model by incorporating query refinements from another subset (test set) of the user search logs. This process implies learning from or reusing previous users' querying experience to recommend queries for a new but similar user query. The adaptation weights are extracted from a query flow graph built with the same logs. We evaluated our hybrid model using documents crawled from the Intranet of an academic institution and its search logs. The hybrid model was then compared to a concept hierarchy model and query flow graph built from the same collection and search logs respectively. We also tested various strategies for combining information in the search logs with respect to the frequency of clicked documents after query refinement. Our hybrid model significantly outperformed the concept hierarchy model and query flow graph when tested over two different periods of the academic year. We intend to further validate our experiments with documents and search logs from another institution and devise better strategies for selecting queries for recommendation from the hybrid model. Copyright is held by the International World Wide Web

关键词： Intranets

来源：评论

学校读者我要写书评

暂无评论

High surface quality tool path generation strategy for sculptured surfaces machining

High surface quality tool path generation strategy for sculp...

引用

IEEE International Conference on Signal Processing, Communications and computing (ICSPCC)

作者： Long Chen Dong Yu Cong Geng Yue Sun Wang Feng School of Computer Science and Technology University of Science and Technology Hefei Anhui China School of Computer Science and Technology University of Science and Technology of China Hefei Anhui P. R. China National Engineering Research Centre for High-end CNC Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang Liaoning China National Engineering Research Centre for High-end CNC Shenyang Institute of Computing Technology of Chinese Academy of Sciences Shenyang Liaoning P. R. China Shenyang Institute of Computing Technology of Chinese Academy of Sciences Shenyang Shenyang Liaoning P. R. China Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang Liaoning China

In five-axis computer numerically controlled (CNC) machining of sculptured surface parts, the application of high surface quality machining is recognized as an economically viable manufacturing technology. Compared with the traditional CNC machining, high surface quality machining can effectively improve the surface quality. To meet the demands of high surface quality machining, this paper presents a toolpath generation strategy. Based on the constant scallop height and the interference detection, the initial smallest-posture-changes tool path is firstly created. Then, the other tool paths is generated as a kind of the diagonal curve between the offset curves by the initial tool path. At last, the tool path smoothing technology is applied to the generated tool path. This path strategy can ensure higher level of quality of the surface being machined, and less tool path sharp corners. Therefore, the high surface quality tool path can maintain the needs of machining. Based on these techniques, experimental results are given to verify the proposed approach.

关键词： Machining Interference Surface treatment computer numerical control Feeds Manufacturing computers

来源：评论

学校读者我要写书评

暂无评论

Function Substitution: Towards Constraint Solving in Software Testing

Function Substitution: Towards Constraint Solving in Softwar...

引用

International Conference on Quality Software

作者： Xin Feng Simon Marr Tony O'Callaghan Zhi Quan Zhou Jacques Carette Division of Science and Technology BNU-HKBU United International College Zhuhai China Marine Robotics Research Centre University of Limerick Limerick Ireland Interaction Design Centre University of Limerick Limerick Ireland School of Computer Science and Software Engineering University of Wollongong Wollongong Australia Department of Computing and Software McMaster University Hamilton Canada

Constraint solving is a fundamental tenet of most test case generation strategies. However, conventional constraint solving methods were not designed in consideration of that aspect of test case generation. It has led to a situation where test case generation techniques can miss test cases when constraints contain function invocations. This is due to the fact that, when solving constraints to generate test cases, function invocations are not effectively handled and, as a result, solutions to some constraints are not found even though they do exist. This problem occurs in both specification-based and code-based testing. To address the problem, this paper presents a function substitution method that transforms test case constraints that contain certain types of functions into equivalent constraints that do not contain those functions. The transformation preserves the solution space and avoids missed test cases. As a result, the completeness of test case generation can be improved.

关键词： Educational institutions Input variables Marketing and sales Software Frequency modulation Software testing

来源：评论

学校读者我要写书评

暂无评论

Diversity-driven self-adaptation in evolutionary algorithms

Diversity-driven self-adaptation in evolutionary algorithms

引用

International Conference on Advances in Intelligent Control and computer engineering

作者： Zeng, Fanchao Decraene, James Low, Malcolm Yoke Hean Zhou, Suiping Cai, Wentong Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Singapore

ISBN: (纸本)9789400702851

Pareto-based multi-objective optimization problems (MOPs) are currently best solved using evolutionary algorithms. Nevertheless, the performance of these nature-inspired stochastic search algorithms still depends on the suitability of their parameter settings with respect to specific optimization problems. The tuning of the parameters is a crucial task which concerns resolving the contrary goals of convergence and diversity. To address this issue, we propose a diversity-driven self-adaptive mechanism (SAM) for the simulated binary crossover. This novel technique exploits and optimizes the balance between exploration and exploitation during the evolutionary process. This "explore first and exploit later" approach is addressed through the automated and dynamic adjustment of the distribution index of the simulated binary crossover (SBX) operator. We conducted a series of experiments where SAM is applied to the Non-dominated Sorting Genetic Algorithm to solve the Sphere, Rastrigin, and ZDT optimization problems. Our experimental results have shown that our proposed self adaptation mechanism can produce promising results for both single and multi-objective problem sets. © 2011 Springer science+Business Media B.V.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Erratum: Search for new phenomena in final states with large jet multiplicities and missing transverse momentum at = 8 TeV proton-proton collisions using the ATLAS experiment

引用

Journal of High Energy Physics 2014年第1期2014卷 1-18页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams T. N. Addy J. Adelman S. Adomeit T. Adye S. Aefsky T. Agatonovic-Jovin J. A. Aguilar-Saavedra M. Agustoni S. P. Ahlen A. Ahmad M. Ahsan G. Aielli T. P. A. Åkesson G. Akimoto A. V. Akimov M. A. Alam J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti L. Alio J. Alison B. M. M. Allbrooke L. J. Allison P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso F. Alonso A. Altheimer B. Alvarez Gonzalez M. G. Alviggi K. Amako Y. Amaral Coutinho C. Amelung V. V. Ammosov S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders K. J. Anderson A. Andreazza V. Andrei X. S. Anduaga S. Angelidakis P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai A. T. H. Arce S. Arfaoui J.-F. Arguin S. Argyropoulos E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal O. Arslan A. Artamonov G. Artoni D. Arutinov S. Asai N. Asbah S. Ask B. Åsman L. Asquith K. Assamagan R. Astalos A. Astbury M. Atkinson N. B. Atlay B. Auerbach E. Auge K. Augsten M. Aurousseau G. Avolio D. Axen G. Azuelos Y. Azuma M. A. Baak C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus J. Backus Mayes E. Badescu P. Bagiacchi P. Bagnaia Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker S. Baker P. Balek F. Balli E. Banas Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov T. Barber E. L. Barberio D. Barberis M. Barbero D. Y. Bardin T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton V. Bartsch A. B Fakultät für Mathematik und Physik Albert-Ludwigs-Universität Freiburg Germany Physikalisches Institut University of Bonn Bonn Germany Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States of America Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona Barcelona Spain LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics Oklahoma State University Stillwater United States of America Department of Physics and Astronomy Michigan State University East Lansing United States of America Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel DSM/IRFU (Institut de Recherches sur les Lois Fondamentales de l’Univers) CEA Saclay (Commissariat à l’Energie Atomique et aux Energies Alternatives) Gif-sur-Yvette France Department of Physics Stockholm University Stockholm Sweden INFN Gruppo Collegato di Udine Udine Italy Department of Physics King’s College London London United Kingdom AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton United States of America Department of Physics Hampton University Hampton United States of America Department of Physics Yale University New Haven United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Brandeis University Waltham United States of America Vinca Institute of Nuclear Sciences University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas - LIP Lisboa Portug

来源：评论

学校读者我要写书评

暂无评论

Chinese Parsing Model Based on Constraint Dependency Grammar

Chinese Parsing Model Based on Constraint Dependency Grammar

引用

International Conference on Consumer Electronics, Communications and Networks

作者： Peng Li Lejian Liao Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of Technology

ISBN: (纸本)9781457714146

Constraint Dependency Grammar (CDG) is a formalism representing grammatical rules as constraints on dependency relations. It reduces the structural ambiguity via constraint-propagation without generating individual parse trees. In this paper, we propose a high quality parsing model for Chinese, which defines the phrase molecule lexicalizing the CDG at the word-level. Ternary constraints are used to improve the accuracy and efficiency of parsing.

关键词： Constraint Dependency Grammar Parsing Chinese

来源：评论

学校读者我要写书评

暂无评论

Provisioning OpenCL Capable Infrastructure with Infiniband Verbs

Provisioning OpenCL Capable Infrastructure with Infiniband V...

引用

International Symposium on parallel and Distributed computing

作者： Christopher J. Reynolds Zsolt Lichtenberger Stephen Winter Centre for Parallel Computing School of Electronics and Computer Science University of Westminster London UK

The availability of low cost high performance hardware such as graphical processing units (GPUs) has been the driving force for considerable change in both traditional high performance computing (HPC), and more recently the data centre. Vendor independent methods of accessing such hardware include the recently standardised OpenCL framework. However, using GPUs as accelerators for certain computational algorithms requires careful provisioning of infrastructure in order to balance cost, power consumption, and device utilization. In this paper we describe vOpenCL, an architecture for provisioning OpenCL capable hardware. vOpenCL works by transparently offloading processing from traditional cluster nodes, to a remotely located farm of OpenCL capable processors such as GPUs. vOpenCL differs from existing provisioning solutions since it provides mechanisms to optimize the data transfers between components. This is achieved through the use of a module/plug in which fully exploits the Infiniband interconnect architecture. We provide full analysis of vOpenCL and all of its plugins, in a range of scenarios including from within virtualized environments. For certain algorithms, we demonstrate that the Infiniband plug in can provide significant performance benefits.

关键词： Graphics processing unit Servers Sockets IP networks Kernel Libraries Time measurement

来源：评论

学校读者我要写书评

暂无评论

Trusted Block as a Service: Towards Sensitive Applications on the Cloud

Trusted Block as a Service: Towards Sensitive Applications o...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Jianan Hao Wentong Cai Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore

Cloud computing grows rapidly as today's advanced information technology. However, by allowing outsourcing computation on the Cloud, users risk of disclosing privacy and obtaining forged results. These potential threats block sensitive applications to join the Cloud. In this paper, we characterize sensitive applications on the Cloud (SAND) problem and define two critical security requirements: confidentiality and verifiability. The former refers to the protection of sensitive programs/data from disclosing to other users or even the Cloud administrators. The latter concerns with user's capability to verify whether computing results are faithfully calculated. To address SAND, we propose a new Cloud model, Trusted Block as a Service (TBaaS), to provide a confidential and verifiable environment for each sensitive application. TBaaS limits Cloud provider's access of sensitive applications while granting user the ability to verify whether the computation is faithfully carried out. Moreover, it offers high flexibility and low performance overhead.

关键词： Virtual machine monitors Encryption Protocols Hardware Software

来源：评论

学校读者我要写书评

暂无评论

Scientific workflow makespan reduction through cloud augmented Desktop Grids

Scientific workflow makespan reduction through cloud augment...

引用

2011 3rd IEEE International Conference on Cloud computing Technology and science, CloudCom 2011

作者： Reynolds, Christopher J. Winter, Stephen Terstyanszky, Gabor Z. Kiss, Tamas Greenwell, Pamela Acs, Sandor Kacsuk, Peter Centre for Parallel Computing School of Electronics and Computer Science University of Westminster London United Kingdom Dept. of Biomedical Sciences University of Westminster London United Kingdom MTA SZTAKI Computer and Automation Research Institute Hungarian Academy of Sciences Budapest Hungary

ISBN: (纸本)9780769546223

Scientific workflows are common in biomedical research, particularly for molecular docking simulations such as those used in drug discovery. Such workflows typically involve data distribution between computationally demanding stages which are usually mapped onto large scale compute resources. Volunteer or Desktop Grid (DG) computing can provide such infrastructure but has limitations resulting from the heterogeneous nature of the compute nodes. These constraints mean that reducing the makespan of a given workflow stage submitted to a DG becomes problematic. Late jobs can significantly affect the makespan, often completing long after the bulk of the computation has finished. In this paper we present a system capable of significantly reducing the makespan of a scientific workflow. Our system comprises a DG which is dynamically augmented with an infrastructure as a service (IaaS) Cloud. Using this solution, the Cloud resources are used to process replicated late jobs. Our system comprises a core component termed the scheduler, which implements an algorithm to perform late job detection, Cloud resource management (instantiation and reuse), and job monitoring. We offer a formal definition of this algorithm, whilst we also provide an evaluation of our prototype using a production scientific workflow. © 2011 IEEE.

关键词： Infrastructure as a service (IaaS)

来源：评论

学校读者我要写书评

暂无评论

A semantic model for integrated content management, localisation and language technology processing

A semantic model for integrated content management, localisa...

引用

2nd International Workshop on the Multilingual Semantic Web 2011, MSW 2011 - In Conjunction with the International Semantic Web Conference, ISWC 2011

作者： Jones, Dominic O'Connor, Alexander Abgaz, Yalemisew M. Lewis, David Centre for Next Generation Localisation School of Computer Science and Statistics Trinity College Dublin Ireland Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland School of Computing Dublin City University Dublin Ireland

Providers of products and services are faced with the dual challenge of supporting the languages and individual needs of the global customer while also accommodating the increasing relevance of user-generated content. As a result, the content and localisation industries must now evolve rapidly from manually processing predicable content which arrives in large jobs to the highly automated processing of streams of fast moving, heterogeneous and unpredictable content. This requires a new generation of digital content management technologies that combine the agile flow of content from developers to localisers and consumers with the data-driven language technologies needed to handle the volume of content required to feed the demands of global markets. Data-driven technologies such as statistical machine translation, cross-lingual information retrieval, sentiment analysis and automatic speech recognition, all rely on high quality training content, which in turn must be continually harvested based on the human quality judgments made across the end-to-end content processing flow. This paper presents the motivation, approach and initial semantic models of a collection of research demonstrators where they represent a part of, or a step towards, documenting in a semantic model the multi-lingual semantic web.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：