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

A structured view on weighted counting with relations to counting, quantum computation and applications

学校读者我要写书评

暂无评论

arXiv 2017年

作者： de Campos, Cassio P. Stamoulis, Georgios Weyland, Dennis Queen’s University Belfast United Kingdom Department of Information and Computing Sciences Utrecht University Netherlands Department of Data Science & Knowledge Engineering Maastricht University Netherlands Google Zürich Switzerland

Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights of all paths (instead of just computing the number of accepting paths). Useful closure properties and plenty of applications make weighted counting problems interesting. The general definition of these problems captures even undecidable problems, but it turns out that obtaining an exponentially small additive approximation is just as hard as solving conventional counting problems. In many cases such an approximation is sufficient and working with weighted counting problems tends to be very convenient. We present a structured view on weighted counting by defining classes that depend on the range of the function that assigns weights to paths and by showing the relationships between these different classes. These classes constitute generalizations of the usual counting problems. Weighted counting allows us to easily cast a number of famous results of computational complexity in its terms, especially regarding counting and quantum computation. Moreover, these classes are flexible enough and capture the complexity of various problems in fields such as probabilistic graphical models and stochastic combinatorial optimization. Using the weighted counting terminology and our results, we are able to simplify and answer some open questions in those fields. Copyright © 2017, The Authors. All rights reserved.

关键词： Turing machines

The Effect of Online Channel Addition on Store Performance:Empirical Evidence from Chinese Chain Retailers

学校读者我要写书评

暂无评论

Journal of Systems science and Information 2021年第4期9卷 356-377页

作者： Yixin WANG Qiguo GONG Tingyan WANG Xin TIAN School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China Shanghai HEADING Information Engineering Co. LtdShanghai 201112China Key Labomtory of Big Data Mining and Knowledge Managements Chinese Academy of SciencesBeijing 100190China Nuffield Department of Medicine University of OxfordSouth Parks RoadOxford OXl 3SYUnited Kingdom NIHR Oxford Biomedical Research Centre Big Data InstituteUniversity of OxfordOld Road CampusOxford OX37LFUnited Kingdom Research Center on Fictitious Economy&Data Science Chinese Academy of SciencesBeijing 100190China

With the rapid development of e-Commerce and takeaway platforms, retailers have gradually developed multi-channel operations. However, limited empirical studies explored the effects of an online channel offered by takeaway platforms on the store performance. Does an online channel addition have a synergy effect or a cannibalization effect on store performance? We empirically investigate these effects by analyzing a large dataset including diverse samples collected from multiple retailers across various regions. The dataset includes 2115 stores across 25 retailers for 10 months that includes two types of retail formats and covers 16 provinces and 21 cities of China. We study the impacts of the newly introduced online channel on the incumbent offline channel and the overall store *** empirical results reveal that the online channel addition mainly has a synergy effect. Specifically,for the overall store, it has a positive effect on the sales and product variety, whereas it has a negative effect on the basket size. Surprisingly, an online channel addition also has a positive effect on the offline sales. Our study adds novel values to multi-channel retailing literature by empirically researching the cannibalization and synergy effect of a new type of online channel, offered by takeaway platforms. It can provide insights for retail enterprises who are interested in introducing O2 O model.

关键词： online channel addition cannibalization effect synergy effect propensity score matching(PSM) different-in-different(DID)method

Object Level Depth Reconstruction for Category Level 6D Object Pose Estimation From Monocular RGB Image

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Fan, Zhaoxin Song, Zhenbo Xu, Jian Wang, Zhicheng Wu, Kejian Liu, Hongyan He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China Nreal China

Recently, RGBD-based category-level 6D object pose estimation has achieved promising improvement in performance, however, the requirement of depth information prohibits broader applications. In order to relieve this problem, this paper proposes a novel approach named Object Level Depth reconstruction Network (OLD-Net) taking only RGB images as input for category-level 6D object pose estimation. We propose to directly predict object-level depth from a monocular RGB image by deforming the category-level shape prior into object-level depth and the canonical NOCS representation. Two novel modules named Normalized Global Position Hints (NGPH) and Shape-aware Decoupled Depth Reconstruction (SDDR) module are introduced to learn high fidelity object-level depth and delicate shape representations. At last, the 6D object pose is solved by aligning the predicted canonical representation with the back-projected object-level depth. Extensive experiments on the challenging CAMERA25 and REAL275 datasets indicate that our model, though simple, achieves state-of-the-art performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Image reconstruction

ARCH-COMP20 category report: Continuous and hybrid systems with nonlinear dynamics 7th

学校读者我要写书评

暂无评论

ARCH-COMP20 category report: Continuous and hybrid systems w...

7th International Workshop on Applied Verification of Continuous and Hybrid Systems, ARCH 2020

作者： Geretti, Luca Dit Sandretto, Julien Alexandre Althoff, Matthias Benet, Luis Chapoutot, Alexandre Chen, Xin Collins, Pieter Forets, Marcelo Freire, Daniel Immler, Fabian Kochdumper, Niklas Sanders, David P. Schilling, Christian Department of Computer Science University of Verona Verona Italy ENSTA Paris Institut Polytechnique de Paris Palaiseau France Technische Universität München Munich Germany Mexico University of Dayton DaytonOH United States Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Universidad de la República Montevideo Uruguay Computer Science Department Carnegie Mellon University United States Mexico City Mexico Department of Mathematics Massachusetts Institute of Technology CambridgeMA United States IST Austria Klosterneuburg Austria

We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. © 2020 EasyChair. All rights reserved.

关键词： Hybrid systems

Edge-minimum saturated k-planar drawings

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chaplick, Steven Klute, Fabian Parada, Irene Rollin, Jonathan Ueckerdt, Torsten Department of Data Science and Knowledge Engineering Maastricht University Netherlands Utrecht University Netherlands TU Eindhoven Netherlands Department of Mathematics and Computer Science FernUniversität in Hagen Germany Institute of Theoretical Informatics Karlsruhe Institute of Technology Germany

For a class D of drawings of loopless (multi-)graphs in the plane, a drawing D ∈ D is saturated when the addition of any edge to D results in D0 ∈/ D—this is analogous to saturated graphs in a graph class as introduced by Turán (1941) and Erdös, Hajnal, and Moon (1964). We focus on k-planar drawings, that is, graphs drawn in the plane where each edge is crossed at most k times, and the classes D of all k-planar drawings obeying a number of restrictions, such as having no crossing incident edges, no pair of edges crossing more than once, or no edge crossing itself. While saturated k-planar drawings are the focus of several prior works, tight bounds on how sparse these can be are not well understood. We establish a generic framework to determine the minimum number of edges among all n-vertex saturated k-planar drawings in many natural classes. For example, when incident crossings, multicrossings and selfcrossings are all allowed, the sparsest n-vertex saturated k-planar drawings have 2/k−(k mod 2) (n − 1) edges for any k ≥ 4, while if all that is forbidden, the sparsest such drawings have 2(k + 1)/k (k-1) (n − 1) edges for any k ≥ 6. Copyright © 2020, The Authors. All rights reserved.

关键词：

ARCH-COMP21 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics 8th

学校读者我要写书评

暂无评论

ARCH-COMP21 Category Report: Continuous and Hybrid Systems w...

8th International Workshop on Applied Verification of Continuous and Hybrid Systems, ARCH 2021

作者： Geretti, Luca Sandretto, Julien Alexandre Dit Althoff, Matthias Benet, Luis Chapoutot, Alexandre Collins, Pieter Duggirala, Parasara Sridhar Forets, Marcelo Kim, Edward Linares, Uziel Sanders, David P. Schilling, Christian Wetzlinger, Mark Department of Computer Science University of Verona Verona Italy ENSTA Paris Institut Polytechnique de Paris Palaiseau France Technische Universität München Munich Germany Mexico Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Department of Computer Science University of North Carolina at Chapel Hill United States Universidad de la República Montevideo Uruguay Mexico City Mexico Department of Mathematics Massachusetts Institute of Technology CambridgeMA United States University of Konstanz Konstanz Germany Aalborg University Aalborg Denmark

We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2021. This year, 5 tools Ariadne, CORA, DynIbex, JuliaReach and Kaa (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on five benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. © 2021, EasyChair. All rights reserved.

关键词： Hybrid systems

Partitioning vectors into quadruples: Worst-case analysis of a matching-based algorithm

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Ficker, Annette M.C. Erlebach, Thomas Mihalák, Matúš Spieksma, Frits C.R. Faculty of Economics and Business KU Leuven Leuven Belgium Department of Informatics University of Leicester Leicester United Kingdom Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven Netherlands

Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the quad. The problem is to partition the given 4k vectors into k quads with minimum total cost. We analyze a straightforward matching-based algorithm, and prove that this algorithm is a 23-approximation algorithm for this problem. We further analyze the performance of this algorithm on a hierarchy of special cases of the problem, and prove that, in one particular case, the algorithm is a 54-approximation algorithm. Our analysis is tight in all cases except *** codes 68Q25 Copyright © 2018, The Authors. All rights reserved.

关键词： Vectors

Drivers for strategic choice of cloud computing as online service in SMEs

学校读者我要写书评

暂无评论

Drivers for strategic choice of cloud computing as online se...

International Conference on Information Systems, ICIS 2012

作者： Li, Min Yu, Yan Zhao, J. Leon Li, Xin University of Science and Technology China-City University of Hong Kong Joint Advanced Research Center 166 Renai Road Dushu Lake Higher Education Town Suzhou China Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China 59 Zhongguancun Street Haidian District Beijing China Department of Information Systems City University of Hong Kong Tat Chee Avenue Kowloon Hong Kong

ISBN: (纸本)9781627486040

Cloud Computing Service (CCS) paradigm is changing IT strategy of organizations in the digital world. CCS that requires few upfront investments and uses lease-based pricing is especially relevant to the Small and Medium Enterprises (SMEs), which have limited resources and may not know their true valuation for the IT prior to adoption. Thus, this research aims to investigate the influential factors of SMEs' strategic choice of CCS as online service. Relying upon Technology-Organization-Environment (TOE) paradigm, we identify both generic and context-specific factors from the three aspects and explain how the identified factors affect SMEs' CCS strategic choices. We hope this research can make contributions to innovation diffusion theory and IT strategy literature. We also hope the research with progress going on can generate insights for the CCS vendors who care about the sector of SME as well as the government administrators to make appropriate policies or supports for SMEs.

关键词： Cloud computing

OCBMLC: An overlapping clustering based multi-label classification algorithm

学校读者我要写书评

暂无评论

OCBMLC: An overlapping clustering based multi-label classifi...

IEEE International Conference on Cloud Computing and Big data Analysis (ICCCBDA)

作者： Liwen Peng Yongguo Liu Huan Liao Peng Zhang Knowledge and Data Engineering Laboratory of Chinese Medicine University of Electronic Science and Technology of China Chengdu China College English Department Guangdong University of Foreign Studies Guangzhou China School of Science Southwest University of Science and Technology Mianyang China

ISBN: (纸本)9781509045006

This paper explores the clustering based multi-label classification problem. We propose an overlapping clustering based multi-label classification method (OCBMLC). In the experiment we compare three multi-label classification algorithms that are based on clustering. In the experimental setting section, we use three clustering methods for datasets before multi-label classification. Two popular multi-label benchmark datasets are used in our experiments: emotions dataset and yeast dataset. We employ micro F1-measure and hamming loss as multi-label classification performance evaluation metrics. The experimental results demonstrate that various clustering algorithms generate different performance of the multi-label classification, and the overlapping clustering based multi-label classification algorithm may adapt to multi-label classification more.

关键词： Bioinformatics