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

International Conference on Global Software Engineering (ICGSE)

作者： Dean Knudson Stavros Kalafatis Carsten Kleiner Stephen Zahos Barbara Seegebarth Jonas Deeterfelt Iman Avazpour Kristian Sandahl Peter Gorder Jeewani Ginige Alex Radermacher Hugo Caballero Humberto Gomez Mikael Roos Computer Science Dept. North Dakota State University Fargo ND USA ECE Department Texas A& M University College Station TX USA Computer Science Dept. Hannover University of Applied Sciences & Arts Hannover Germany Agricultural and Biological Eng. University of Illinois at Urbana-Champaign Urbana IL USA Institute of Marketing Technische Universitat Braunschweig Braunschweig Germany Linkopings universitet Linkoping SE School of IT Deakin University Burwood Australia Department of Computer and Information Science Linkoping University Linkoping SE Sweden Department of Mechanical and Aerospace Engineering Univ. of Colorado Colorado Springs CO USA Sch. of Comput. Eng. & Math. Western Sydney Univ. Sydney NSW Australia Departamento de Ingenieria Mecanica Universidad del Norte Barranquilla Colombia Department of Computer Science and Engineering Blekinge Institute of Technology (BTH) Karlskrona Sweden

Today it is very common for software systems to be built by teams located in more than one country. For example, a project team may be located in the US while the team lead resides in Sweden. How then should students be trained for this kind of work? Senior design or capstone projects offer students real-world hands-on experience but rarely while working internationally. One reason is that most instructors do not have international business contacts that allow them to find project sponsors in other countries. Another reason is the fear of having to invest a huge amount of time managing an international project. In this paper we present the general concepts related to "International Capstone Project Exchanges", the basic model behind the exchanges (student teams are led by an industry sponsor residing in a different country) and several alternate models that have been used in practice. We will give examples from projects in the US, Germany, Sweden, Australia, and Colombia. We have extended the model beyond software projects to include engineering projects as well as marketing, and journalism. We conclude with a description of an International Capstone Project Exchange website that we have developed to aid any university in establishing their own international project exchange.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heavy hitters and the structure of local privacy

arXiv

引用

arXiv 2017年

作者： Bun, Mark Nelson, Jelani Stemmer, Uri Department of Computer Science Princeton University John A. Paulson School of Engineering and Applied Sciences Harvard University Dept. of Computer Science and Applied Math Weizmann Institute of Science

We present a new locally differentially private algorithm for the heavy hitters problem which achieves optimal worst-case error as a function of all standardly considered parameters. Prior work obtained error rates which depend optimally on the number of users, the size of the domain, and the privacy parameter, but depend sub-optimally on the failure probability. We strengthen existing lower bounds on the error to incorporate the failure probability, and show that our new upper bound is tight with respect to this parameter as well. Our lower bound is based on a new understanding of the structure of locally private protocols. We further develop these ideas to obtain the following general results beyond heavy hitters. Advanced Grouposition: In the local model, group privacy for k users degrades proportionally to ≈ √k, instead of linearly in k as in the central model. Stronger group privacy yields improved max-information guarantees, as well as stronger lower bounds (via "packing arguments"), over the central model. Building on a transformation of Bassily and Smith (STOC 2015), we give a generic transformation from any non-interactive approximate-private local protocol into a pure-private local protocol. Again in contrast with the central model, this shows that we cannot obtain more accurate algorithms by moving from pure to approximate local privacy. Copyright © 2017, The Authors. All rights reserved.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Schur multipliers and mixed unitary maps

arXiv

引用

arXiv 2018年

作者： Harris, Samuel J. Levene, Rupert H. Paulsen, Vern I. Plosker, Sarah Rahaman, Mizanur Institute for Quantum Computing Dept. of Pure Math. University of Waterloo WaterlooONN2L 3G1 Canada School of Mathematics and Statistics University College Dublin Belfield Dublin 4 Ireland Department of Mathematics and Computer Science Brandon University BrandonMBR7A 6A9 Canada

We consider the tensor product of the completely depolar- ising channel on d×d matrices with the map of Schur multiplication by a k ×k correlation matrix and characterise, via matrix theory methods, when such a map is a mixed (random) unitary channel. When d = 1, this recovers a result of O'Meara and Pereira, and for larger d is equiva- lent to a result of Haagerup and Musat that was originally obtained via the theory of factorisation through von Neumann algebras. We obtain a bound on the distance between a given correlation matrix for which this tensor product is nearly mixed unitary and a correlation matrix for which such a map is exactly mixed unitary. This bound allows us to give an elementary proof of another result of Haagerup and Musat about the closure of such correlation matrices without appealing to the theory of von Neumann algebras. Copyright © 2018, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Teaching global disruption and information technology online

引用

Interactions 2016年第6期23卷 40-43页

作者： Tomlinson, Bill Patterson, Donald J. Nardi, Bonnie Department of Informatics University of California Irvine United States Math. and Computer Science Department Westmont College Santa BarbaraCA United States

Bill Tomlinson, University of California, Irvine Donald J. Patterson, Westmont College, and Bonnie Nardi, University of California, Irvine, delivered a curse titled 'ICS 5: Global Disruption and Information Technology' under Computing within LIMIT.. ICS 5 was one of the first online courses to be offered across the nine undergraduate campuses of the University of California system. The course has been offered three times to date: Winter 2015, Fall 2015, and Spring 2016. There were three primary curricular goals. The first was to educate students about the science of global change. The second was to educate students about the sociotechnical approach to technology design, which the three instructors have pursued throughout their careers. The third was to engage students in understanding and critiquing their own values and the processes by which such values may be brought to bear in the creation of sociotechnical solutions to global change. The authors structured the course as a descent into the problems in the early weeks, and then an ascent to solutions, ideas for solutions, and case studies of successes in the later weeks. A key premise of the course is that while technology may be able to address some aspects of sustainability, the core problem lies with the nature of current industrialized society. Despite their efforts, the authors found that many students struggled to grasp the core premise of LIMITS. Computing within LIMITS is critically important to the future of the computing discipline, and potentially a powerful transformative force in the world more broadly.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

New Convergence Aspects of Stochastic Gradient Algorithms

arXiv

引用

arXiv 2018年

作者： Nguyen, Lam M. Nguyen, Phuong Ha Richtárik, Peter Scheinberg, Katya Takáč, Martin van Dijk, Marten IBM Research Thomas J. Watson Research Center Yorktown HeightsNY10598 United States Department of Electrical and Computer Engineering University of Connecticut StorrsCT06268 United States Computer Electrical and Math. Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal Kazakhstan School of Operations Research and Information Engineering Cornell University IthacaNY14850 United States Department of Industrial and Systems Engineering Lehigh University BethlehemPA18015 United States

The classical convergence analysis of SGD is carried out under the assumption that the norm of the stochastic gradient is uniformly bounded. While this might hold for some loss functions, it is violated for cases where the objective function is strongly convex. In Bottou et al. (2018), a new analysis of convergence of SGD is performed under the assumption that stochastic gradients are bounded with respect to the true gradient norm. We show that for stochastic problems arising in machine learning such bound always holds;and we also propose an alternative convergence analysis of SGD with diminishing learning rate regime. We then move on to the asynchronous parallel setting, and prove convergence of Hogwild! algorithm in the same regime in the case of diminished learning rate. It is well-known that SGD converges if a sequence of learning rates {ηt} satisfies P∞t=0 ηt → ∞ and P∞t=0 ηt2 t} is a diminishing sequence and P∞t=0 ηt → ∞. In other words, we extend the current state-of-the-art class of learning rates satisfying the convergence of SGD. Copyright © 2018, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Completely simple endomorphism rings of modules

arXiv

引用

arXiv 2017年

作者： Bovdi, V. Salim, M. Ursul, Mihail Department of Math. Sciences Uae University Al-Ain United Arab Emirates Department of Mathematics and Computer Science University of Technology Lae Papua New Guinea

It is proved that if Apis a countable elementary abelian p-group, then: (i) The ring End (Ap) does not admit a nondiscrete locally compact ring topology. (ii) Under (CH) the simple ring End (Ap)/I, where I is the ideal of End (Ap) consisting of all endo-morphisms with finite images, does not admit a nondiscrete locally compact ring topology. (iii) The finite topology on End(Ap) is the only second metrizable ring topology on it. Moreover, a characterization of completely simple endomorphism rings of the endomor-phism rings of modules over commutative rings is also obtained. Copyright © 2017, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

An arcsine law for markov random walks

arXiv

引用

arXiv 2017年

作者： Alsmeyer, Gerold Buckmann, Fabian Inst. Math. Stochastics Department of Mathematics and Computer Science University of Münster Orléans-Ring 10 MünsterD-48149 Germany

The classic arcsine law for the number Nn>: = n-1Σk=1n1{Sk> 0} of positive terms, as n → ∞, in an ordinary random walk (Sn)n≥0is extended to the case when this random walk is governed by a positive recurrent Markov chain (Mn)n≥0on a countable state space S, that is, for a Markov random walk (Mn, Sn)n≥0with positive recurrent discrete driving chain. More precisely, it is shown that n-1Nn>converges in distribution to a generalized arcsine law with parameter ρ ∈ [0, 1] (the classic arcsine law if ρ = 1/2) iff the Spitzer condition lim n→∞ 1/n Σk=1nPi(Sn> 0) = ρ holds true for some and then all i ∈ S, where Pi:= P(|M0= i) for i ∈ S. It is also proved, under an extra assumption on the driving chain if 0 i(Sn> 0) = ρ. For an ordinary random walk, this was shown by Doney [7] for 0 MSC Codes 60J15 (Primary) 60J10 60G50 (Secondary) Copyright © 2017, The Authors. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Organ-on-a-Chip: Ex vivo Dynamics of Human Glioblastoma Cells in a Microvasculature-on-a-Chip System Correlates with Tumor Heterogeneity and Subtypes (Adv. Sci. 8/2019)

引用

Advanced science 2019年第8期6卷 1970046-1970046页

作者： Yang Xiao Dongjoo Kim Burak Dura Kerou Zhang Runchen Yan Huamin Li Edward Han Joshua Ip Pan Zou Jun Liu Ann Tai Chen Alexander O. Vortmeyer Jiangbing Zhou Rong Fan Department of Biomedical Engineering Yale University New Haven CT 06520 USA School of Computer Science Carnegie Mellon University Pittsburgh PA 15213 USA Applied Math Program Yale University New Haven CT 06520 USA Department of Neurosurgery Yale School of Medicine New Haven CT 06520 USA Department of Pathology Indiana University Health Pathology Laboratory Indianapolis IN 46202 USA Yale Comprehensive Cancer Center New Haven CT 06520 USA

来源：评论

学校读者我要写书评

暂无评论

The functional model for maximal dissipative operators: An approach in the spirit of operator knots

arXiv

引用

arXiv 2018年

作者： Brown, Malcolm Marletta, Marco Naboko, Serguei Wood, Ian School of Computer Science Cardiff University Queen’s Buildings 5 The Parade CardiffCF24 3AA United Kingdom School of Mathematics Cardiff University Senghennydd Road CardiffCF24 4AG United Kingdom Department of Math. Physics Institute of Physics St. Petersburg State University 1 Ulianovskaia St. Petergoff St. Petersburg198504 Russia School of Mathematics Statistics and Actuarial Sciences University of Kent CanterburyCT2 7FS United Kingdom

In this article we develop a functional model for a general maximal dissipative operator. We construct the selfadjoint dilation of such operators. Unlike previous functional models, our model is given explicitly in terms of parameters of the original operator, making it more useful in concrete applications. For our construction we introduce an abstract framework for working with a maximal dissipative operator and its anti-dissipative adjoint and make use of the Štraus characteristic function in our setting. Explicit formulae are given for the selfadjoint dilation, its resolvent, a core and the completely non-selfadjoint subspace;minimality of the dilation is shown. The abstract theory is illustrated by the example of a Schrödinger operator on a half-line with dissipative potential, and boundary condition and connections to existing theory are discussed. Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Density Functional Theory-based modeling and calculations of a polyamide molecular unit for studying forward-osmosis-dewatering of microalgae

Density Functional Theory-based modeling and calculations of...

引用

IEEE International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management

作者： Jester N. Itliong Al Rey C. Villagracia Joaquin Lorenzo V. Moreno Gian Paolo O. Bernardo Kurt Irvin M. Rojas Melanie Y. David Robby B. Manrique Allan Abraham B. Padama Aristotle T. Ubando Alvin B. Culaba Jo-Shu Chang Nelson B. Arboleda Wei-Hsin Chen Hui Lin Ong Hideaki Kasai Physics Department De La Salle University and Applied Physics Department Eulogio “Amang” Rodriguez Institute of Science and Technology Manila Philippines Physics Department De La Salle University Manila Philippines Mechanical Engineering Dept. De La Salle University Manila Philippines Institute of Math. Sci. & Physics University University of the Philippines Los Baños Laguna Philippines Dept. of Chemical Engineering National Cheng Kung University Tainan Taiwan Dept. of Aeronautics & Astronautics National Cheng Kung University Tainan Taiwan School of Materials Engineering Universiti Malaysia Perlis Perlis Malaysia Akashi College National Institute of Technolgy Hyogo Japan

Both the preparation of a reliable all-atom model of a polyamide (PA) membrane and the determination of its electrostatic parameters are considered significant challenges in a proposal to study forward-osmosis-dewatering of microalgae using molecular dynamics (MD). Density functional theory (DFT)-based calculations can effectively calculate for optimized structure and electrostatic properties, thus, employed to model and characterize the PA membrane starting from its molecular unit. The performed structural optimization resulted to the most stable configuration of the PA unit with bond length values that showed strong stability in the molecule such as the amide bond length of 1.413 A which was found to differ from that of a related study by ～3%. The calculated charge density distributions, electrostatic potential isosurface, and Mulliken charges on the PA unit provided potential binding sites and insights on the formation of amide bonds on the PA molecule. The non-amide-bonded nitrogen atom of m-phenylene diamine (MPD) was found to be the most active site in the molecule due to its highest magnitude of negative charge (positive Coulomb potential), suggesting that amide bond-formation with a carbon atom of a trimesoyl chloride (TMC) monomer is most likely to occur during polymerization. The calculated charges in the amide group and the zero-net sum of these charges also agreed reasonably well with another study. The results are of vital importance in parameterizing the interaction potentials of PA for use in the MD simulations.

关键词： Electric potential Electrostatics Optimization Physics Isosurfaces Polymers Biomembranes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：