发布求助

文献互助智能选刊最新文献

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021)最新文献

筛选

英文中文

Energy-Efficient NoC-Based Systems for Real-Time Multimedia Applications using Approximate Computing 基于近似计算的高效节能的实时多媒体应用系统

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15750

Wagner Penny, D. Palomino, M. Porto, B. Zatt

引用次数: 0

Shared Memory Verification for Multicore Chip Designs 多核芯片设计的共享内存验证

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15760

Marleson Graf, L. Santos

引用次数: 0

Towards Automatic Fake News Detection in Digital Platforms: Properties, Limitations, and Applications 面向数字平台的虚假新闻自动检测:属性、限制和应用

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15754

Julio C. S. Reis, Fabrício Benevenuto

{"title":"Towards Automatic Fake News Detection in Digital Platforms: Properties, Limitations, and Applications","authors":"Julio C. S. Reis, Fabrício Benevenuto","doi":"10.5753/CTD.2021.15754","DOIUrl":"https://doi.org/10.5753/CTD.2021.15754","url":null,"abstract":"Digital platforms, including social media systems and messaging applications, have become a place for campaigns of misinformation that affect the credibility of the entire news ecosystem. The emergence of fake news in these environments has quickly evolved into a worldwide phenomenon, where the lack of scalable fact-checking strategies is especially worrisome. In this context, this thesis aim at investigating practical approaches for the automatic detection of fake news disseminated in digital platforms. Particularly, we explore new datasets and features for fake news detection to assess the prediction performance of current supervised machine learning approaches. We also propose an unbiased framework for quantifying the informativeness of features for fake news detection, and present an explanation of factors contributing to model decisions considering data from different scenarios. Finally, we propose and implement a new mechanism that accounts for the potential occurrence of fake news within the data, significantly reducing the number of content pieces journalists and fact-checkers have to go through before finding a fake story.","PeriodicalId":236085,"journal":{"name":"Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

The Balanced Connected k-Partition Problem: Polyhedra and Algorithms 平衡连通k划分问题:多面体及其算法

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15763

M. J. Ota, F. Miyazawa, Phablo F. S. Moura

引用次数: 0

Synthesizing Realistic Human Dance Motions Conditioned by Musical Data using Graph Convolutional Networks 利用图卷积网络合成音乐数据条件下的逼真人体舞蹈动作

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15762

João Pedro Moreira Ferreira, Renato Martins, E. R. Nascimento

引用次数: 0

Concurrency and Interference Analysis of Kernels on GPUs gpu上内核的并发性与干扰分析

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15757

Pablo Carvalho, Lúcia M. A. Drummond, C. Bentes

{"title":"Concurrency and Interference Analysis of Kernels on GPUs","authors":"Pablo Carvalho, Lúcia M. A. Drummond, C. Bentes","doi":"10.5753/CTD.2021.15757","DOIUrl":"https://doi.org/10.5753/CTD.2021.15757","url":null,"abstract":"Heterogeneous systems employing CPUs and GPUs are becoming increasingly popular in large-scale data centers and cloud environments. In these platforms, sharing a GPU across different applications is an important feature to improve hardware utilization and system throughput. However, under scenarios where GPUs are competitively shared, some challenges arise. The decision on the simultaneous execution of different kernels is made by the hardware and depends on the kernels resource requirements. Besides that, it is very difficult to understand all the hardware variables involved in the simultaneous execution decisions, in order to describe a formal allocation method. In this work, we studied the impact that kernel resource requirements have in concurrent execution and used machine learning (ML) techniques to infer the interference caused by the concurrent execution, and to classify the slowdown that results from this interference. The ML techniques were analyzed over the GPU benchmark suites, Rodinia, Parboil and SHOC. Our results showed that, from the features selected in the analysis, the number of blocks per grid, number of threads per block, and number of registers are the resource consumption features that most affect the performance of the concurrent execution.","PeriodicalId":236085,"journal":{"name":"Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125458224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Discovery and Application of Data Dependencies 数据依赖关系的发现和应用

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15749

Eduardo H. M. Pena, E. Almeida

{"title":"Discovery and Application of Data Dependencies","authors":"Eduardo H. M. Pena, E. Almeida","doi":"10.5753/CTD.2021.15749","DOIUrl":"https://doi.org/10.5753/CTD.2021.15749","url":null,"abstract":"This work makes contributions that reach central problems in connection with data dependencies. The first problem regards the discovery of dependencies of high expressive power. We introduce an efficient algorithm for the discovery of denial constraints: a type of dependency that has enough expressive power to generalize other important types of dependencies and to express complex business rules. The second problem concerns the application of dependencies for improving data consistency. We present a modification for traditional dependency discovery approaches that enables the dependency discovery algorithms to return reliable results even if they run on data containing some inconsistent records. Also, we present a system for detecting violations of dependencies efficiently. Our extensive experimental evaluation shows that our system is up to three orders-of-magnitude faster than state-of-the-art solutions, especially for larger datasets and massive numbers of dependency violations. The last contribution in this work regards the application of dependencies in query optimization. We present a system for the automatic discovery and selection of functional dependencies. Our experimental evaluation shows that our system selects relevant functional dependencies that help reducing the overall query response time for various types of query workloads.","PeriodicalId":236085,"journal":{"name":"Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021)","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Sunflower Theorems in Monotone Circuit Complexity 单调电路复杂性中的向日葵定理

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15761

B. P. Cavalar, Y. Kohayakawa

{"title":"Sunflower Theorems in Monotone Circuit Complexity","authors":"B. P. Cavalar, Y. Kohayakawa","doi":"10.5753/CTD.2021.15761","DOIUrl":"https://doi.org/10.5753/CTD.2021.15761","url":null,"abstract":"Alexander Razborov (1985) developed the approximation method to obtain lower bounds on the size of monotone circuits deciding if a graph contains a clique. Given a \"small\" circuit, this technique consists in finding a monotone Boolean function which approximates the circuit in a distribution of interest, but makes computation errors in that same distribution. To prove that such a function is indeed a good approximation, Razborov used the sunflower lemma of ErdH{o}s and Rado (1960). This technique was improved by Alon and Boppana (1987) to show lower bounds for a larger class of monotone computational problems. In that same work, the authors also improved the result of Razborov for the clique problem, using a relaxed variant of sunflowers. More recently, Rossman (2010) developed another variant of sunflowers, now called \"robust sunflowers\", to obtain lower bounds for the clique problem in random graphs. In the following years, the concept of robust sunflowers found applications in many areas of computational complexity, such as DNF sparsification, randomness extractors and lifting theorems. Even more recent was the breakthrough result of Alweiss, Lovett, Wu and Zhang (2020), which improved Rossman's bound on the size of hypergraphs without robust sunflowers. This result was employed to obtain a significant progress on the sunflower conjecture. In this work, we will show how the recent progress in sunflower theorems can be applied to improve monotone circuit lower bounds. In particular, we will show the best monotone circuit lower bound obtained up to now, breaking a 20-year old record of Harnik and Raz (2000). We will also improve the lower bound of Alon and Boppana for the clique function in a slightly more restricted range of clique sizes. Our exposition is self-contained. These results were obtained in a collaboration with Benjamin Rossman and Mrinal Kumar.","PeriodicalId":236085,"journal":{"name":"Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122636073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks 酉量子行走与非齐次随机行走关系的刻画

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15756

M. G. Andrade, F. Marquezino, Daniel R. Figueiredo

{"title":"Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks","authors":"M. G. Andrade, F. Marquezino, Daniel R. Figueiredo","doi":"10.5753/CTD.2021.15756","DOIUrl":"https://doi.org/10.5753/CTD.2021.15756","url":null,"abstract":"Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.","PeriodicalId":236085,"journal":{"name":"Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114821144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the Helly Property of Some Intersection Graphs 关于若干交图的Helly性质

Anais do XXXIV Concurso de Teses e Dissertações da SBC (CTD-SBC 2021) Pub Date : 2021-07-18 DOI: 10.5753/CTD.2021.15752

T. Santos, J. Szwarcfiter, U. Souza, C. Bornstein

引用次数: 2

1
2

下一页尾页

联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1

京公网安备 11010802042870号

Book学术文献互助

Book学术文献互助群
群号：481959085

Book学术官方微信