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

New Security Paradigms Workshop, NSPW 2015

作者： Benenson, Zinaida Lenzini, Gabriele Oliveira, Daniela Parkin, Simon Uebelacker, Sven Computer Science Department Friedrich-Alexander-Universität Erlangen-Nürnberg Germany Interdisciplinary Centre for Security Reliability and Trust University of Luxembourg Luxembourg Electrical and Computer Engineering Department University of Florida United States Department of Computer Science University College London London United Kingdom Security in Distributed Applications Hamburg University of Technology Germany

ISBN: (纸本)9781450337540

Psychology and neuroscience literature shows the existance of upper bounds on the human capacity for executing cognitive tasks and for information processing. These bounds are where, demonstrably, people start experiencing cognitive strain and consequently committing errors in the tasks execution. We argue that the usable security discipline should scientifically understand such bounds in order to have realistic expectations about what people can or cannot attain when coping with security tasks. This may shed light on whether Johnny will be ever be able to encrypt. We propose a conceptual framework for evaluation of human capacities in security that also assigns systems to complexity categories according to their security and usability. From what we have initiated in this paper, we ultimately aim at providing designers of security mechanisms and policies with the ability to say: "This feature of the security mechanism X or this security policy element Y is inappropriate, because this evidence shows that it is beyond the capacity of its target community". © 2015 ACM.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Observation of quantum equilibration in dilute Bose gases

引用

Physical Review A 2016年第6期94卷 063603-063603页

作者： Linxiao Niu (牛临潇) Pengju Tang (唐鹏举) Baoguo Yang (杨保国) Xuzong Chen (陈徐宗) Biao Wu (吴飙) Xiaoji Zhou (周小计) School of Electronics Engineering and Computer Science Peking University Beijing 100871 China International Center for Quantum Materials School of Physics Peking University Beijing 100871 China Collaborative Innovation Center of Quantum Matter Beijing 100871 China Wilczek Quantum Center Department of Physics and Astronomy Shanghai Jiao Tong University Shanghai 200240 China Synergetic Innovation Center for Quantum Effects and Applications Hunan Normal University Changsha 410081 China

We investigate experimentally the dynamical relaxation of a nonintegrable quantum many-body system to its equilibrium state. A Bose-Einstein condensate is loaded into the first excited band of an optical lattice and let to evolve up to a few hundreds of milliseconds. Signs of quantum equilibration are observed. There is a period of time, roughly 40 ms long, during which both the aspect ratio of the cloud and its momentum distribution remain constant. In particular, the momentum distribution has a flat top and is not a Gaussian thermal distribution. After this period, the cloud becomes classical as its momentum distribution becomes Gaussian.

关键词： Bosons Quantum statistical mechanics Ultracold gases Hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Improving latent factor models via personalized feature projection for one class recommendation 15

Improving latent factor models via personalized feature proj...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhao, Tong McAuley, Julian King, Irwin Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications Shenzhen Research Institute Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong Department of Computer Science and Engineering UC San Diego San DiegoCA United States

ISBN: (纸本)9781450337946

Latent Factor models, which transform both users and items into the same latent feature space, are one of the most successful and ubiquitous models in recommender systems. Most existing models in this paradigm define both users' and items' latent factors to be of the same size and use an inner product to represent a user's 'compatibility' with an item. Intuitively, users' factors encode 'preferences' while item factors encode 'properties', so that the inner product encodes how well an item matches a user's preferences. However, a user's opinion of an item may be more complex, for example each dimension of each user's opinion may depend on a combination of multiple item factors simultaneously. Thus it may be better to view each dimension of a user's preference as a personalized projection of an item's properties so that the preference model can capture complex relationships between items' properties and users' preferences. Therefore, in this paper we propose a novel personalized feature projection method to model users' preferences over items. Specifically, for each user, we define a personalized projection matrix, which takes the place of user-specific factors from existing models. This matrix describes a mapping between items' factors and users' preferences in order to build personalized preference models for each user and item. The proposed personalized feature projection method is quite general and existing latent factor models, for example, can be cast as a special case. We present three objective functions to optimize predictions in the form of ranked lists of users' preferences over items, and demonstrate how each can be used to improve one-class recommendation performance. Experiments are conducted on four real-world datasets and our results show that our personalized feature projection method outperforms several state-of-the-art methods on various evaluation metrics. © 2015 ACM.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Fluid structure interaction in HPC multi-code coupling

Fluid structure interaction in HPC multi-code coupling

引用

作者： Cajas, J.C. Zavala, M. Houzeaux, G. Casoni, E. Vázquez, M. Moulinec, C. Fournier, Y. Computer Applications for Science and Engineering Barcelona Supercomputing Center Spain Scientific Computing Department Science and Technology Facilities Council Daresbury Laboratory Warrington United Kingdom Research and Development Électricité de France Chatou France

Fluid structure interaction (FSI) problems are of great interest in many applied fields such as aerodynamics, renewable energy generation, nuclear energy generation, vehicles design and biophysical systems research. This kind of problems can be addressed using a monolithic or a staggered approach. The monolithic scheme usually provides robustness and stability in the simulation process but involves extensive code rewriting and is usually less flexible than the staggered approach. The later usually suffers instability in the coupling algorithm but it allows to reuse previously existing code for the physical components of the problem. Extreme-scaling codes for computational fluid dynamics (CFD) and computational solid dynamics (CSD) have been developed for high end machines through the years, and have proven to run efficiently on the most powerful supercomputing infrastructure available. This makes the staggered multi-code coupling approach particularly attractive for FSI simulations on high performance computing (HPC) systems. However, besides the physical difficulties belonging to the FSI simulations, multi-code coupling poses its own computational challenges, as it involves extra communication between two a priori independent parallel applications. This creates an extra level of load imbalance and synchronization points that have to be carefully considered in order to maintain the efficiency of the separated codes, as well as of the whole coupling. In this paper, a staggered approach for FSI problems is presented. Two instances of the same extreme-scale code are used, Alya-Nastin for the CFD simulation and Alya-solidz for the CSD simulation. Characteristics of the parallel code coupling are presented and a validation test case is considered. © Civil-Comp Press, 2015.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Foreword

Proceedings of the 2016 International Conference on Image Pr...

引用

Proceedings of the 2016 International Conference on Image Processing, computer Vision, and Pattern Recognition, IPCV 2016 2016年

作者： Abd-Wahab, Mohd Helmy Al-Bakry, Abbas Al-Holou, Nizar Arabnia, Hamid R. Bhattacharya, Mahua Martinez Castillo, Juan Jose Daimi, Kevin Deligiannidis, Leonidas Djoudi, Lamia Atma Duong, Trung Eshaghian-Wilner, Mary Mehrnoosh Gravvanis, George A. Huang, Ruizhu Jandieri, George Kim, Byung-Gyu Kim, Tai-hoon Korovin, Iakov Lai, Guoming Lee, Hyo Jong Bin Mansor, Muhammad Naufal Marsh, Andrew Mostafaeipour, Ali Park, James J. Patil, Shashikant Ponalagusamy, R. Schaefer, Gerald Singh, Akash Solo, Ashu M.G. Swee, Sim Kok Thomas, Jaya Tinetti, Fernando G. Vladimir, Hahanov Wang, Shiuh-Jeng Yang, Mary Yoe, Hyun You, Jane Zhao, Wenbing Department of Computer Engineering University Tun Hussein Onn Malaysia Malaysia University of IT and Communications Baghdad Iraq Electrical and Computer Engineering Department IEEE/SEM-Computer Chapter University of Detroit Mercy DetroitMI United States University of Georgia United States ABV Indian Institute of Information Technology and Management MHRD Government of India India Acantelys Alan Turing Nikola Tesla Research Group and GIPEB Universidad Nacional Abierta Venezuela Computer Science and Software Engineering Programs Department of Mathematics Computer Science and Software Engineering University of Detroit Mercy DetroitMI United States Department of Computer Information Systems Wentworth Institute of Technology BostonMA United States Synchrone Technologies France Rutgers University State University of New Jersey New Jersey United States University of Southern California California United States Electrical Engineering University of California Los Angeles Los Angeles [UCLA CA United States Advanced Scientific Computing Applied Math and Applications Research Group Applied Mathematics and Numerical Computing and Department of ECE School of Engineering Democritus University of Thrace Xanthi Greece Texas Advanced Computing Center University of Texas AustinTX United States Georgian Technical University Tbilisi Georgia Institute of Cybernetics Georgian Academy of Science Georgia Multimedia Processing CommunicationsLab.[MPCL Department of Computer Science and Engineering College of Engineering SunMoon University Korea Republic of School of Information and Computing Science University of Tasmania Australia Southern Federal University Russia Computer Science and Technology Sun Yat-Sen University Guangzhou China Center for Advanced Image and Information Technology Division of Computer Science and Engineering Chonbuk National University Korea Republic of Faculty of Engineering Technology Kampus Uniciti Alam Universiti Malaysia Perlis UniMAP Malaysi

来源：评论

学校读者我要写书评

暂无评论

Exploiting game theoretic analysis for link recommendation in social networks 15

Exploiting game theoretic analysis for link recommendation i...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhao, Tong Zhao, H. Vicky King, Irwin Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications Shenzhen Research Institute Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering Chinese University of Hong Kong Shatin N.T. Hong Kong Electrical and Computer Engineering Department University of Alberta EdmontonAB Canada

ISBN: (纸本)9781450337946

The popularity of Online Social Networks (OSNs) has attracted great research interests in different fields. In Economics, researchers use game theory to analyze the mechanism of network formation, which is called Network Formation Game. While in computer science, much effort has been done in building machine learning models to predict future or missing links. However, there are few works considering how to combine game theoretic analysis and machine learning models. Therefore, in this paper, we study the problem of Exploiting Game Theoretic Analysis for Link Recommendation in Social Networks. Our goal is to improve link recommendation accuracy via leveraging the power of Network Formation Games into machine learning models. We present two different approaches to solve this problem. First, we propose a three-phase method that straightforwardly combines game theoretic analysis with machine learning models. Second, we develop a unified model, BPRLGT, that incorporates Network Formation Game into a Bayesian ranking framework for link recommendation. Specifically, BPRLGT takes advantage of network topology and we design a game theoretic sampling approach to improve its training process. The experiments are conducted on four real world datasets and the results on all datasets demonstrate that both our proposed three-phase method and the unified ranking model outperform the baseline methods. © 2015 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Incremental updating approximations in confidential dominance relation based rough set

引用

Kongzhi yu Juece/Control and Decision 2016年第6期31卷 1027-1031页

作者： Gou, Guang-Lei Wang, Guo-Yin School of Information Science and Technology Southwest Jiaotong University Chengdu610031 China Big Data Mining and Applications Center Chongqing Institute of Green and Intelligent Technology of Chinese Academy of Science Chongqing400714 China School of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China

Confidential dominance relation based rough set is a model of incomplete ordered information processing, computation of approximations of which is a core issue. In real-life applications, the attribute set is dynamically changed. According to the variation of the attribute set, confidential dominance and dominated class are firstly calculated. Then the principles of incremental updating approximations are discussed when some attributes are added or deleted. Furthermore, incremental approaches and algorithms in the confidential dominance relation based on rough set are proposed. Finally, the experiments on UCI datasets developed on Matlab are designed to evaluate the performance of the proposed incremental updating method and non-incremental updating method. The results show that the proposed algorithms are effective and feasible under the variation of the attribute set. © 2016, Editorial Office of Control and Decision. All right reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient cross-layer reliable retransmission scheme for the human body shadowing in IEEE 802.15.6-based wireless body sensor networks

An efficient cross-layer reliable retransmission scheme for ...

引用

Research in Adaptive and Convergent Systems, RACS 2015

作者： Tseng, Hsueh-Wen Wu, Yi-Zhang Wu, Ruei-Yu Chou, Shih-Chun Department of Computer Science and Engineering National Chung-Hsing University Taiwan Department of Management Information Systems Hwa Hsia University of Technology Taiwan Innovative DigiTech-Enabled Applications and Services Institute Institute for Information Industry Taiwan

ISBN: (纸本)9781450337380

Recently, wireless body area networks (WBANs) provide solutions for the aging population problem. IEEE 802.15.6 is able to achieve low complexity, low cost, high reliability, ultra-low power, and short range wireless communication in or around the human body for WBANs. However, human activities affect transmission signals of sensor nodes and human body interference may continue a period time. If the sensor nodes immediately retransmit the failed frames, they may suffer from the body interference again. Therefore, we propose an efficient cross-layer reliable retransmission scheme (CL-RRS) in IEEE 802.15.6 without additional control overheads. CL-RRS not only detects the information of the sensor nodes with failed frames to allocate retransmission resources, but also increases the successful probability of frame retransmission. Our simulation results show that CL-RRS significantly improves frame loss rate and average transmission latency, as well as reduces power consumption. © 2015 ACM.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Ontology construction for explicit description of domain knowledge

Ontology construction for explicit description of domain kno...

引用

International Conference on Innovation Information in Computing Technologies (ICIICT)

作者： R. Mervin S. Murugesh A. Jaya Department of Computer Science and Engineering Research Scholar Department of Computer Applications Research Scholar Department of Computer Applications B.S. Abdur Rahman University Chennai Tamil Nadu India

In the modern era numerous information are available in the World Wide Web which makes it difficult to get the semantic information. Ontologies plays vital role after the evolution of the Semantic Web. Ontologies are used in various domains. Ontology is used to refine the search with semantics and give the best result to the user. This paper portrays the construction of two different domain ontologies i.e. Knowledge Based Question Answering System (KBQA) and software requirements elicitation from unstructured text.

关键词： Ontologies Online banking Semantics Software Technological innovation Data mining Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Large supports are required for well-supported nash equilibria

Large supports are required for well-supported nash equilibr...

引用

18th International Workshop on ApproximationAlgorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015

作者： Anbalagan, Yogesh Huang, Hao Lovett, Shachar Norin, Sergey Vetta, Adrian Wu, Hehui School of Computer Science McGill University Montreal Canada Institute for Mathematics and its Applications University of Minnesota Minneapolis United States Computer Science and Engineering Department University of California San Diego United States Department of Mathematics and Statistics McGill University Montreal Canada Department of Mathematics University of Mississippi University United States

We prove that for any constant k and any Ε © Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, and Hehui Wu.

ISBN: (纸本)9783939897897

We prove that for any constant k and any Ε © Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, and Hehui Wu.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：