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

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

来源：评论

学校读者我要写书评

暂无评论

Using the Findings of a Mapping Study to Conduct a Research Project: A Case in Knowledge Management in Software Testing

Using the Findings of a Mapping Study to Conduct a Research ...

引用

Euromicro Conference on Software Engineering and Advanced Applications (SEAA)

作者： Érica F. Souza Ricardo A. Falbo Nandamudi L. Vijaykumar Department of Computer Federal Technological University of Parana UTFPR Cornelio Brazil Department of Computer Science Federal University of Espírito Santo Brazil Lab. of Comp. and Applied Math. National Institute for Space Research Brazil

A mapping study provides a broad overview of a research area in order to determine whether there is research evidence on a particular topic. Results of a systematic mapping may identify suitable areas for performing future research. In this paper, we discuss our experience in using the findings of a mapping study on Knowledge Management (KM) in Software Testing for performing a real research project, which also applied other empirical approaches. The main goals of this paper are: (i) to reinforce the importance of a systematic mapping in the conduction of a research project by discussing a real case of such application, and (ii) to present the results of our survey on the most important aspects of KM when applied to software testing.

关键词： Software testing Ontologies Software Software engineering Systematics Planning

来源：评论

学校读者我要写书评

暂无评论

Advantages of computer simulation in enhancing students’ learning about landform evolution: A case study using the grand canyon

引用

Journal of Geoscience Education 2016年第1期64卷 60-73页

作者： Luo, Wei Pelletier, Jon Duffin, Kirk Ormand, Carol Hung, Wei-Chen Shernoff, David J. Zhai, Xiaoming Iverson, Ellen Whalley, Kyle Gallaher, Courtney Furness, Walter Department of Geography Northern Illinois University Davis Hall DeKalb 60115 IL United States Department of Geosciences University of Arizona 1040 E. Fourth Street Tucson 85721 AZ United States Department of Computer Science Northern Illinois University DeKalb 60115 IL United States Science Education Resource Center Carleton College W-SERC One North College Street Northfield 55057 MN United States Department of Educational Technology Research and Assessment (ETRA) Northern Illinois University DeKalb 60115 IL United States Graduate School of Applied and Professional Psychology Rutgers University 152 Frelinghuysen Road Piscataway 08854-8020 NJ United States Engineering Math and Physical Science Division College of Lake County 19351 West Washington Street Grayslake 60030-1198 IL United States

The long geological time needed for landform development and evolution poses a challenge for understanding and appreciating the processes involved. The Web-based Interactive Landform Simulation Model—Grand Canyon (WILSIM-GC, http://***/landform/) is an educational tool designed to help students better understand such processes, using the Grand Canyon as an example. Although the project is still ongoing, here, we present the I nitial results of using the WILSIM-GC in an introductory physical geography laboratory course. We used a quasiexperimental design to assess the efficacy of WILSIM-GC as a tool for teaching landform development and evolution. Students were assigned to a control group or a treatment group, alphabetically by last name. Pretests and posttests were administered to measure students’ understanding of the concepts and processes related to Grand Canyon formation and evolution. Results show that, although both the interactive simulation and a more-traditional, paper-based exercise were effective in helping students learn landform evolution processes, there were several advantages and affordances to the simulation approach. The improvement effect from pretest to posttest scores was large for the treatment group, but small to moderate for the control group. In addition, for those questions requiring higher-level thinking, the percentage of students answering correctly was higher in the treatment group than it was in the control group. Furthermore, responses to the attitudinal survey indicate that students generally favor the interactive simulation approach. We can leverage these advantages to enhance students’ learning by integrating interactive simulation exercises into curricular materials, including materials for online or hybrid courses and flipped classrooms. © 2016 National Association of Geoscience Teachers.

关键词： Grand Canyon Landform evolution Learning Simulation model Treatment/control experiment

来源：评论

学校读者我要写书评

暂无评论

Asymptotically truthful equilibrium selection in large congestion games 14

Asymptotically truthful equilibrium selection in large conge...

引用

15th ACM Conference on Economics and Computation, EC 2014

作者： Rogers, Ryan M. Roth, Aaron Applied Math and Computational Science Department University of Pennsylvania Philadelphia PA United States Computer and Information Science Department University of Pennsylvania Philadelphia PA United States

ISBN: (纸本)9781450325653

Studying games in the complete information model makes them analytically tractable. However, large n player interactions are more realistically modeled as games of incomplete information, where players may know little to nothing about the types of other players. Unfortunately, games in incomplete information settings lose many of the nice properties of complete information games: the quality of equilibria can become worse, the equilibria lose their ex-post properties, and coordinating on an equilibrium becomes even more difficult. Because of these problems, we would like to study games of incomplete information, but still implement equilibria of the complete information game induced by the (unknown) realized player types. This problem was recently studied by Kearns et al [Kearns et al. 2014], and solved in large games by means of introducing a weak mediator: their mediator took as input reported types of players, and output suggested actions which formed a correlated equilibrium of the underlying game. Players had the option to play independently of the mediator, or ignore its suggestions, but crucially, if they decided to opt-in to the mediator, they did not have the power to lie about their type. In this paper, we rectify this deficiency in the setting of large congestion games. We give, in a sense, the weakest possible mediator: it cannot enforce participation, verify types, or enforce its suggestions. Moreover, our mediator implements a Nash equilibrium of the complete information game. We show that it is an (asymptotic) ex-post equilibrium of the incomplete information game for all players to use the mediator honestly, and that when they do so, they end up playing an approximate Nash equilibrium of the induced complete information game. In particular, truthful use of the mediator is a Bayes-Nash equilibrium in any Bayesian game for any prior. © 2014 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A Parallel Repetition Theorem for Entangled Projection Games

A Parallel Repetition Theorem for Entangled Projection Games

引用

Annual IEEE Conference on Computational Complexity

作者： Irit Dinur David Steurer Thomas Vidick Department of Computer Science and Applied Math The Weizmann Institute Israel Departement of Computer Science Cornell University USA Centre for Quantum Technologies NUS Singapore

We study the behavior of the entangled value of two-player one-round projection games under parallel repetition. We show that for any projection game G of entangled value 1 - ε c) k ), for some universal constant c ≥ 1. Previously parallel repetition with an exponential decay in k was only known for the case of XOR and unique games. To prove the theorem we extend an analytical framework recently introduced by Dinur and Steurer for the study of the classical value of projection games under parallel repetition. Our proof, as theirs, relies on the introduction of a simple relaxation of the entangled value that is perfectly multiplicative. The main technical component of the proof consists in showing that the relaxed value remains tightly connected to the entangled value, thereby establishing the parallel repetition theorem. More generally, we obtain results on the behavior of the entangled value under products of arbitrary (not necessarily identical) projection games. Relating our relaxed value to the entangled value is done by giving an algorithm for converting a relaxed variant of quantum strategies that we call “vector quantum strategy” to a quantum strategy. The algorithm is considerably simpler in case the bipartite distribution of questions in the game has good expansion properties. When this is not the case, rounding relies on a quantum analogue of Holenstein's correlated sampling lemma which may be of independent interest. Our “quantum correlated sampling lemma” generalizes results of van Dam and Hayden on universal embezzlement to the following approximate scenario: two isolated parties, given classical descriptions of arbitrary bipartite states |ψ〉, |φ〉 respectively such that |ψ〉 ≈ |φ〉, are able to locally generate a joint entangled state|Ψ〉 ≈ |ψ〉 ≈ |φ〉 using an initial entangled state that is independent of their inputs.

关键词： Games Quantum entanglement Vectors Cryptography Complexity theory computer science

来源：评论

学校读者我要写书评

暂无评论

On learning parametric-output HMMs

On learning parametric-output HMMs

引用

30th International Conference on Machine Learning, ICML 2013

作者： Kontorovich, Aryeh Nadler, Boaz Weiss, Roi Department of Computer Science Ben-Gurion University Beer Sheva 84105 Israel Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot 76100 Israel

ISBN: (纸本)9781629933061

We present a novel approach to learning an HMM whose outputs are distributed according to a parametric family. This is done by decoupling the learning task into two steps: first estimating the output parameters, and then estimating the hidden state transition probabilities. The first step is accomplished by fitting a mixture model to the output stationary distribution. Given the parameters of this mixture model, the second step is formulated as the solution of an easily solvable convex quadratic program. We provide an error analysis for the estimated transition probabilities and show they are robust to small perturbations in the estimates of the mixture parameters. Finally, we support our analysis with some encouraging empirical results. Copyright 2013 by the author(s).

关键词： Mixtures

来源：评论

学校读者我要写书评

暂无评论

Case recommendation based on fuzzy clustering in personalization web services

引用

2013 3rd International Symposium on Chemical Engineering and Material Properties, ISCEMP 2013

作者： Chen, Xue Gang Zhang, Jia Lu Cheng, Jie Ren Department of Computer science Xiangnan University Chenzhou 423000 China Department of Math Xiangnan University Chenzhou 423000 China College of Applied Science and Technology Hainan University Hainan China

ISBN: (纸本)9783037858363

Aiming at the problems of no strong real-time performance and poor scalability using traditional filtering recommendation technology, and a novel case recommended based on fuzzy clustering is proposed in this paper. Using case-based reasoning technology to personalized recommendation system, and the old case is clustered using fuzzy clustering algorithm, and a classification model is built, and the target case-the case base is converted to the target case-case class to reduce the most case retrieval space of the target case's the nearest neighbors. The experimental results indicate that this method can effectively improve the real-time performance, and it is used in E-commerce recommendation systems, and the degree of recommendation results universe of discourse is improved. © (2013) Trans Tech Publications, Switzerland.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

The δ- sensitivity and its application to stochastic optimal control of nonlinear diffusions.

The δ- sensitivity and its application to stochastic optima...

引用

American Control Conference

作者： Evangelos A. Theodorou Emo Todorov the Department of Computer Science and Engineering University of Washington Seattle. Departments of Computer Science and Engineering and Applied Math University of Washington

ISBN: (纸本)9781479901777

We provide optimal control laws by using tools from stochastic calculus of variations and the mathematical concept of δ-sensitivity. The analysis relies on logarithmic transformations of the value functions and the use of linearly solvable Partial Differential Equations(PDEs). We derive the corresponding optimal control as a function of the δ-sensitivity of the logarithmic transformation of the value function for the case of nonlinear diffusion processes affine in control and noise.

关键词： nonlinear diffusions PDEs value functions

来源：评论

学校读者我要写书评

暂无评论

PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring

PCPs via Low-Degree Long Code and Hardness for Constrained H...

引用

Annual IEEE Symposium on Foundations of computer science

作者： Irit Dinur Venkatesan Guruswami Dept. of Applied Math and Computer Science The Weizmann Institute of Science Rehovot Israel Computer Science Department Carnegie Mellon University Pittsburgh USA

We develop new techniques to incorporate the recently proposed “short code” (a low-degree version of the long code) into the construction and analysis of PCPs in the classical “Label Cover + Fourier Analysis” framework. As a result, we obtain more size-efficient PCPs that yield improved hardness results for approximating CSPs and certain coloringtype problems. In particular, we show a hardness for a variant of hypergraph coloring (with hyperedges of size 6), with a gap between 2 and exp(2 Ω (√log log N)) number of colors where N is the number of vertices. This is the first hardness result to go beyond the O(log N) barrier for a coloring-type problem. Our hardness bound is a doubly exponential improvement over the previously known O(log log N)-coloring hardness for 2-colorable hypergraphs, and an exponential improvement over the (logN) Ω(1) -coloring hardness for O(1)-colorable hypergraphs. Stated in terms of “covering complexity,” we show that for 6-ary Boolean CSPs, it is hard to decide if a given instance is perfectly satisfiable or if it requires more than 2Ω(√log log N) assignments for covering all of the constraints. While our methods do not yield a result for conventional hypergraph coloring due to some technical reasons, we also prove hardness of (log N) Ω(1) -coloring 2-colorable 6-uniform hypergraphs (this result relies just on the long code). A key algebraic result driving our analysis concerns a very low-soundness error testing method for Reed-Muller codes. We prove that if a function β : F 2 m → F 2 is 2 Ω(d) far in absolute distance from polynomials of degree m-d, then the probability that deg(βg) ≤ m-3d/4 for a random degree d/4 polynomial g is doubly exponentially small in d.

关键词： Frequency modulation Polynomials Color Testing Approximation methods Noise computer science

来源：评论

学校读者我要写书评

暂无评论

Multi-Robot Active SLAM with Relative Entropy Optimization

Multi-Robot Active SLAM with Relative Entropy Optimization

引用

American Control Conference

作者： Michail Kontitsis Evangelos A. Theodorou Emanuel Todorov Department of Electrical Engineering University of Denver Colorado Department of Computer Science and Engineering University of Washington Seattle Department of Computer Science and Engineering and the Applied Math Department University of Washington Seattle

ISBN: (纸本)9781479901777

This paper presents a new approach for Active Simultaneous Localization and Mapping that uses the Relative Entropy (RE) optimization method to select trajectories which minimize both the localization error and the corresponding uncertainty bounds. To that end we construct a planning cost function which includes, besides the state and control cost, a term that encapsulates the uncertainty of the state. This term is the trace of the state covariance matrix produced by the estimator, in this case an Extended Kalman Filter. The role of the RE method is to iteratively guide the selection of the trajectories towards the ones minimizing the aforementioned cost. Once the method has converged, the result is a near-optimal path in terms of achieving the pre-defined goal in the state space while also improving the localization error and the total uncertainty. In essence the method integrates motion planning with robot localization. To evaluate the approach we consider scenarios with single and multiple robots navigating in presence of obstacles and various conditions of landmark densities. The results show a behavior consistent with our expectations.

关键词： Relative Entropy Optimization SLAM RE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：