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

arXiv 2019年

作者： Wade, G.A. Pigulski, A. Begy, S. Shultz, M. Handler, G. Sikora, J. Neilson, H. Cugier, H. Erba, C. Moffat, A.F.J. Pablo, B. Popowicz, A. Weiss, W. Zwintz, K. Dept. of Physics & Space Science Royal Military College of Canada PO Box 17000 Station Forces KingstonONK7K 0C6 Canada Instytut Astronomiczny Uniwersytet Wroclawski Kopernika 11 Wroclaw51-622 Poland Dept. of Physics and Astronomy University of Delaware 217 Sharp Lab NewarkDE19716 United States Nicolaus Copernicus Astronomical Center Bartycka 18 Warszawa00-716 Poland Dept. of Physics Engineering Physics and Astronomy Queen's University 99 University Avenue KingstonONK7L 3N6 Canada Dept. of Astronomy & Astrophysics University of Toronto 50 St. George Street TorontoONM5S 3H4 Canada Université de Montréal C.P. 6128 Succ. Centre-Ville MontréalQCH3C 3J7 Canada American Association of Variable Star Observers 49 Bay State Road CambridgeMA02138 United States Silesian University of Technology Institute of Automatic Control Akademicka 16 Gliwice Poland Institut für Astrophysik Universität Wien Türkenschanzstrasse 17 WienA-1180 Austria Institut für Astro- und Teilchenphysik Universität Innsbruck Technikerstrasse 25/8 InnsbruckA-6020 Austria

Recent BRITE-Constellation space photometry of the slowly rotating, magnetic β Cep pulsator ξ1 CMa permits a new analysis of its pulsation properties. Analysis of the two-colour BRITE data reveals the well-known single pulsation period of 0.209 d, along with its first and second harmonics. A similar analysis of SMEI and TESS observations yields compatible results, with the higher precision TESS observations also revealing several low-amplitude modes with frequencies below 5 d−1;some of these are likely g modes. The phase lag between photometric and radial velocity maxima - equal to 0.334 cycles - is significantly larger than the typical value of 1/4 observed in other large-amplitude β Cep stars. The phase lag, as well as the strong dependence of phase of maximum light on wavelength, can be reconciled with seismic models only if the dominant mode is the fundamental radial mode. We employ all published photometric and radial velocity measurements, spanning over a century, to evaluate the stability of the pulsation period. The O−C diagram exhibits a clear parabolic shape consistent with a mean rate of period change PÛ = 0.34±0.02 s/cen. The residuals from the best-fit parabola exhibit scatter that is substantially larger than the uncertainties. In particular, dense sampling obtained during the past ∼20 years suggests more complex and rapid period variations. Those data cannot be coherently phased with the mean rate of period change, and instead require PÛ ∼ 0.9 s/cen. We examine the potential contributions of binarity, stellar evolution, and stellar rotation and magnetism to understand the apparent period evolution. Copyright © 2019, The Authors. All rights reserved.

关键词： Photometry

来源：评论

学校读者我要写书评

暂无评论

Optimality analysis of if-conversion transformation

Optimality analysis of if-conversion transformation

引用

24th High Performance Computing Symposium, HPC 2016, Part of the 2016 Spring Simulation Multi-Conference, SpringSim 2016

作者： Elkhouly, Reem El-Mahdy, Ahmed Elmasry, Amr Alexandria Egypt Dept. of Computer Engineering and Automatic Control Tanta University Tanta Egypt Dept. of Computer Engineering and Systems Alexandria University Alexandria Egypt

ISBN: (纸本)9781510824256

control-flow dependence has always been posited as a substantial dilemma against program acceleration. With the availability of instruction-level parallel architectures, ifconversion optimization has become pivotal for extracting parallelism from serial programs. While many if-conversion optimization heuristics have been proposed in the literature, few of them investigated the proximity to optimality paying more concern to the input program subjectively. In this paper, we study the effectiveness of the LLVM if-conversion transformation using a broad range optimality analysis technique. The whole optimization space of branch instructions within an arbitrarily selected hotspot function of a program is analyzed, tackling the best-performing combination sequence of converted or non-converted branches. In order to precisely observe the influence of selectively converted branches we magnify individual function call and study the behavior with different call circumstances and input data detecting the impact of data size and distribution. We implemented our technique on LLVM 3.6.1 compilation infrastructure and experimented on several representative kernels of the SPEC-CPU2006 vl.l benchmarks suite running on a multicore system of Intel(R) Xeon(R) 3.50GHz processors. Our findings show a performance gain up to 22.7% at the best optimization over the standard optimized code, indicating the need for more aggressive compilation optimization that is able to capture the individual characteristics of every branch. © 2016 Society for Modeling & Simulation International (SCS).

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

automatic microtubule tracking in fluorescence images of cells doped with increasing concentrations of taxol and nocodazole

arXiv

引用

arXiv 2018年

作者： Varrecchia, Marilena Levine, Joshua Olmo, Gabriella Grangetto, Marco Gai, Marta Di Cunto, Ferdinando Dept. of Control and Computing Engineering Politecnico di Torino Corso Duca degli Abruzzi 24 Torino Italy Computer Science Dept. Corso Svizzera 185 Torino Italy Department of Molecular Biotechnology and Health Sciences University of Torino Via Nizza 52 Torino Italy Neuroscience Institute Cavalieri Ottolenghi University of Torino c.o. Azienda Ospedaliero-Universitaria San Luigi Gonzaga Regione Gonzole 10 Orbassano Italy

In this paper we explore detection and tracking of astral microtubules, a sub-population of microtubules which only exists during and immediately before mitosis and aids in the spindle orientation by connecting it to the cell cortex. Its analysis can be useful to determine the presence of certain diseases, such as brain pathologies and cancer. The proposed algorithm focuses on overcoming the problems regarding fluorescence microscopy images and microtubule behaviour by using various image processing techniques and is then compared with three existing algorithms, tested on consistent sets of images. Copyright © 2018, The Authors. All rights reserved.

关键词： Fluorescence microscopy

来源：评论

学校读者我要写书评

暂无评论

Blogcrawl: Customized crawling of online communities

UPB Scientific Bulletin, Series C: Electrical Engineering an...

引用

UPB Scientific Bulletin, Series C: Electrical Engineering and computer science 2017年第2期79卷 3-14页

作者： Stavarache, Lucia Larise Balint, Mihaela Dascalu, Mihai Trausan-Matu, Stefan Nistor, Nicolae Dept. of Computer Science University Politehnica of Bucharest Romania Faculty of Automatic Control and Computers University Politehnica of Bucharest Research Institute for Artificial Intelligence of the Romanian Academy Academy of Romanian Scientists Romania Ludwig-Maximilians-Universität München Germany Walden University United States

With half of the world already connected to the Internet, we are facing a growing amount of information available online, that is expected to increase exponentially in the following years. Educational environments are transitioning from closed structures to open, collaborative environments, using technology to build virtual classrooms. In this paper we present a customized crawler dedicated to alternative knowledge building environments used for potential community inquiry, that is unique in its power to combine data extraction and indexing capabilities that facilitate discourse-driven community network analysis integrated into the ReaderBench framework.

关键词： computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

Computing the Shapley Value in Allocation problems: Approximations and bounds, with an application to the Italian VQR research assessment program

arXiv

引用

arXiv 2017年

作者： Lupia, Francesco Mendicelli, Angelo Ribichini, Andrea Scarcello, Francesco Schaerf, Marco Dept. of Computer Science Modeling Electronics and Systems Engineering University of Calabria Rende87036 Italy Dept. of Physics Sapienza University Rome00185 Italy Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University Rome00185 Italy

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a #P-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. We describe useful properties that allow us to greatly simplify the instances of allocation problems, without affecting the Shapley value of any player. Moreover, we propose algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been implemented and tested on a real-world application of allocation problems, namely, the Italian research assessment program, known as VQR. For the large university considered in the experiments, the problem involves thousands of agents and goods (here, researchers and their research products). The algorithms described in the paper are able to compute the Shapley value for most of those agents, and to get a good approximation of the Shapley value for all of them. Copyright © 2017, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Clustering in block Markov chains

arXiv

引用

arXiv 2017年

作者： Sanders, Jaron Proutière, Alexandre Yun, Se-Young Kth Royal Institute of Technology School of Electrical Engineering Dept. of Automatic Control Osquldasväg 10 Stockholm10044 Sweden Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Dept. of Quantum and Computer Engineering Mekelweg 4 Delft2628CD Netherlands Korea Advanced Institute of Science and Technology Dept. of Industrial and Systems Engineering 291 Daehak-ro Eoeun-dong Yuseong-gu Korea Republic of

This paper considers cluster detection in Block Markov Chains (BMCs). These Markov chains are characterized by a block structure in their transition matrix. More precisely, the n possible states are divided into a finite number of K groups or clusters, such that states in the same cluster exhibit the same transition rates to other states. One observes a trajectory of the Markov chain, and the objective is to recover, from this observation only, the (initially unknown) clusters. In this paper we devise a clustering procedure that accurately, efficiently, and provably detects the clusters. We first derive a fundamental information-theoretical lower bound on the detection error rate satisfied under any clustering algorithm. This bound identifies the parameters of the BMC, and trajectory lengths, for which it is possible to accurately detect the clusters. We next develop two clustering algorithms that can together accurately recover the cluster structure from the shortest possible trajectories, whenever the parameters allow detection. These algorithms thus reach the fundamental detectability limit, and are optimal in that sense. Copyright © 2017, The Authors. All rights reserved.

关键词： Asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

Virtual control Labs Experimentation: The Water Tank System

引用

IFAC-PapersOnLine 2016年第6期49卷 87-92页

作者： Galan, Daniel Heradio, Ruben Torre, Luis de la Dormido, Sebastian Esquembre, Francisco Dept. of Computer Science and Automatic Control Universidad Nacional de Educación a Distancia Juan del Rosal 16 MadridE-28040 Spain Dept. of Software Engineering and Computer Systems Universidad Nacional de Educación a Distancia Juan del Rosal 16 MadridE-28040 Spain Dept. of Mathematics Universidad de Murcia Campus de Espinardo MurciaE-30071 Spain

This paper describes a new way to perform automated experiments using virtual laboratories. Experiments are developed and executed using a new software tool: the Experiment Editor. This tool uses virtual laboratories applications designed with educational purposes. The main features/advantages of the Experiment Editor are: 1) the possibility of modifying the initial functionality of the laboratories (i.e. adding new controllers to the plant), 2) analyzing the obtained results during the experiment and performing complex or repetitive tasks in a simple way, 3) and any others explained in the paper. To illustrate the utility of the Experiment Editor a very well-known system is used: the water tank system. © 2016

关键词： Distance education computer aided software engineering computer software Experiments Laboratories Water tanks Easy java(script) Simulations Experimentation Language Repetitive task Simulations Tank system Tool use Virtual control Virtual laboratories

来源：评论

学校读者我要写书评

暂无评论

Information theoretic security of quantum key distribution overcoming the repeaterless secret key capacity bound

arXiv

引用

arXiv 2018年

作者： Tamaki, Kiyoshi Lo, Hoi-Kwong Wang, Wenyuan Lucamarini, Marco Graduate School of Science and Engineering for Education University of Toyama Gofuku 3190 Toyama930-8555 Japan Center for Quantum Information and Quantum Control Department of Physics Dept. of Electrical & Computer Engineering University of Toronto TorontoM5S 3G4 Canada Toshiba Research Europe Ltd 208 Cambridge Science Park CambridgeCB4 0GZ United Kingdom

Quantum key distribution is a way to distribute secret keys to distant users with information theoretic security and key rates suitable for real-world applications. Its rate-distance figure, however, is limited by the natural loss of the communication channel and can never surpass a theoretical limit known as point-to-point secret key capacity. Recently, a new type of quantum key distribution with an intermediate relay was proposed to overcome this limit (M. Lucamarini, Z. L. Yuan, J. F. Dynes and A. J. Shields, Nature, 2018). However, a standard application of the decoy state method limited the security analysis of this scheme to hold under restrictive assumptions for the eavesdropper. Hence, overcoming the point-to-point secret key capacity with an information-theoretic secure scheme is still an open question. Here, we propose a novel way to use decoy states to answer this question. The key idea is to switch between a Test mode and a Code mode, the former enabling the decoy state parameter estimation and the latter generating a key through a phase encoding protocol. This way, we confirm the scaling properties of the original scheme and overcome the secret key capacity at long distances. Our work plays a key role to unlock the potential of practical secure quantum communications. Copyright © 2018, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

L_p-TV Model for Structure Extraction with End-to-End Contour learning

L_p-TV Model for Structure Extraction with End-to-End Contou...

引用

Annual Conference of the IEEE Industrial Electronics Society

作者： Chunwei Song Wangmeng Zuo Baraka Maiseli Huijun Gao Dept. Control Science and Engineering Harbin Institute of Technology Harbin China Dept. Electronics and Telecommunication Engineering University of Dar es Salaam Dar es Salaam Tanzania School of Computer Science and Technology Harbin Institute of Technology Harbin China

Structure extraction is important for human perception. However, for various textured images, computers can hardly achieve this goal. Despite a plethora of studies to address the challenge, results from most previous methods contain unwanted artifacts and over-smoothed structures. Therefore, to address the weaknesses, we have proposed a variational model with end-to-end contour learning capability. Our formulation dwells in two observations: likelihood for representation of residual textures may be well abstracted using super Gaussian distribution, and edge metrics with semantic meaning may benefit structure preservation. The augmented Lagrangian method is adopted for optimal computation. Compared with classical approaches, our method offers a higher performance in structure extraction, including situations where the images have significant non-uniformity of the scale features.

关键词： Image edge detection Computational modeling TV Semantics Gaussian distribution Mathematical model Adaptation models

来源：评论

学校读者我要写书评

暂无评论

Multiagent coverage problems: The trade-off between anarchy and stability

arXiv

引用

arXiv 2017年

作者： Ramaswamy, Vinod Paccagnan, Dario Marden, Jason R. Dept. of Electrical Computer and Energy Engineering University of Colorado BoulderCO80309 United States Automatic Control Laboratory ETH Zürich Zurich Switzerland Electrical and Computer Engineering Department UC Santa Barbara Santa BarbaraCA93106 United States

Networked systems are ubiquitous in today's world with examples spanning from ecology to the social and engineering sciences. Much of the research in networked systems is analytical, where the focus is on characterizing (and potentially inuencing) the emergent collective behavior, e.g., predicting the distribution of animals and humans in a given ecological system. A more recent trend of research focuses on the design of networked systems capable of achieving diverse and highly coordinated collective behavior in the absence of centralized control, e.g., designing a team of unmanned aerial vehicles to monitor the perimeter of a wild fire. Unfortunately, our understanding of how microscopic behavior impacts the macroscopic phenomena in network systems is inadequate for meeting the demands of this emerging design task. This paper focuses on an instance of this design task for a well-studied class of coverage problems where the goal is to allocate a collection of agents to a subset of resources in order to maximize the cumulative value of the covered resources. Our first result demonstrates that any agent-based algorithm relying solely on local information induces a fundamental trade-off between the best and worst case performance guarantees, as measured by the price of anarchy and price of stability. This result highlights how the information available to the agents translates to constraints on the achievable efficiency guarantees in networked control systems. Our second results demonstrates how to use an additional piece of system-level information to breach these limitations, thereby improving the system's performance. Copyright © 2017, The Authors. All rights reserved.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：