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

Early prediction of test case verdict with bag-of-words vs. word embeddings 46

Early prediction of test case verdict with bag-of-words vs. ...

46th International conference on current trends in theory and practice of computer science Doctoral Student Research Forum, SOFSEM-SRF 2020

作者： Al-Sabbagh, Khaled Walid Staron, Miroslaw Ochodek, Miroslaw Meding, Wilhelm University of Gothenburg Computer Science and Engineering Department Gothenburg Sweden Institute of Computing Science Poznan University of Technology China

Regression testing is an important testing activity in continuous integration (CI) since it provides confidence that modified parts of the system have not adversely affected its expected behavior. As test suites grow in size over the evolutionary cycle of software, executing large test suites becomes costly and precluding. Since CI provides a large volume of data, machine learning approaches can be used to allow test orchestrators make inferences about which subset of test cases to run at each CI cycle. MeBoTS is a machine-learning-based method that utilizes CI data to improve test case selection (TCS). In order to decide which extraction algorithm is more suitable, we designed and performed an experiment to investigate the effect of using one of two widely used feature extraction algorithms-Bag of Words (BoW) and Word Embeddings (WE)-on the predictive performance of the MeBoTS classifier. We used stratified cross-validation and precision and recall measures to evaluate the performance of two machine-learning models trained on the input generated by the feature-extraction algorithms. the results from this experiment show a significant difference between the models' performance scores with a higher mean precision and recall scores for the BoW based classifier. We conclude that the use of BoW allows training a more accurate MeBoTS classifier than WE. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A graph-based tool to embed the π-calculus into a computational DPO framework 46

A graph-based tool to embed the π-calculus into a computati...

引用

46th International conference on current trends in theory and practice of computer science Doctoral Student Research Forum, SOFSEM-SRF 2020

作者： Andersen, Jakob L. Hellmuth, Marc Merkle, Daniel Nøjgaard, Nikolai Peressotti, Marco Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark Institute of Mathematics and Computer Science University of Greifswald Germany Harvard Medical School Department of Systems Biology BostonMA United States

Graph transformation approaches have been successfully used to analyse and design chemical and biological systems. Here we build on top of a DPO framework, in which molecules are modelled as typed attributed graphs and chemical reactions are modelled as graph transformations. Edges and vertexes can be labelled with first-order terms, which can be used to encode, e.g., steric information of molecules. While targeted to chemical settings, the computational framework is intended to be very generic and applicable to the exploration of arbitrary spaces derived via iterative application of rewrite rules, such as process calculi like Milner's π-calculus. To illustrate the generality of the framework, we introduce EpiM: a tool for computing execution spaces of π-calculus processes. EpiM encodes π-calculus processes as typed attributed graphs and then exploits the existing DPO framework to compute their dynamics in the form of graphs where nodes are π-calculus processes and edges are reduction steps. EpiM takes advantage of the graph-based representation and facilities offered by the framework, like efficient isomorphism checking to prune the space without resorting to explicit structural equivalences. EpiM is available as an online Python-based tool. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Talk More Listen Less: Energy-Efficient Neighbor Discovery in Wireless Sensor Networks

Talk More Listen Less: Energy-Efficient Neighbor Discovery i...

引用

Annual IEEE International conference on computer Communications

作者： Ying Qiu Shining Li Xiangsen Xu Zhigang Li School of Computer Science Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9781467399548

Neighbor discovery is a fundamental service for initialization and managing network dynamics in wireless sensor networks and mobile sensing applications. In this paper, we present a novel design principle named Talk More Listen Less (TMLL) to reduce idle-listening in neighbor discovery protocols by learning the fact that more beacons lead to fewer wakeups. We propose an extended neighbor discovery model for analyzing wakeup schedules in which beacons are not necessarily placed in the wakeup slots. Furthermore, we are the first to consider channel occupancy rate in discovery protocols by introducing a new metric to trade off among duty-cycle, latency and channel occupancy rate. Guided by the TMLL principle, we have designed Nihao, a family of energy-efficient asynchronous neighbor discovery protocols for symmetric and asymmetric cases. We compared Nihao with existing state of the art protocols via analysis and real-world testbed experiments. the result shows that Nihao significantly outperforms the others both in theory and practice.

关键词： Wireless sensor networks Neighbor Beacons Listening channel occupancy design theory Energy efficiency Speaking protocols initialization

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7147 LNCS卷 V-VII页

作者： Bieliková, Mária Friedrich, Gerhard Gottlob, Georg Katzenbeisser, Stefan Turán, György Slovak University of Technology Bratislava Slovakia Alpen-Adria-Universität Klagenfurt Austria University of Oxford United Kingdom Technische Universität Darmstadt Germany University of Illinois Chicago IL United States University of Szeged Hungary

来源：评论

学校读者我要写书评

暂无评论

Management of multi-queue switches in QoS networks 03

Management of multi-queue switches in QoS networks

引用

35th Annual ACM Symposium on theory of Computing

作者： Azar, Yossi Richter, Yossi School of Computer Science Tel-Aviv University Tel-Aviv Israel

ISBN: (纸本)9781581136746

the concept of Quality of Service (QoS) networks has gained growing attention recently, as the traffic volume in the Internet constantly increases, and QoS guarantees are essential to ensure proper operation of most communication based applications. A QoS switch serves m incoming queues by transmitting packets arriving at these queues through one output port, one packet per time unit. Each packet is marked with a value indicating its guaranteed quality of service. Since the queues have bounded capacity and the rate of arriving packets can be much higher than the transmission rate, packets can be lost due to insufficient queue space. the goal is to maximize the total value of transmitted packets. this problem encapsulates two dependent questions: admission control, namely which packets to discard in case of queue overflow, and scheduling, i.e. which queue to use for transmission in each time unit. We use competitive analysis to study online switch performance in QoS based networks. Specifically, we provide a novel generic technique that decouples the admission control and scheduling problems. Our technique transforms any single queue admission control strategy (preemptive or nonpreemptive) to a scheduling and admission control algorithm for our general m queues model, whose competitive ratio is at most twice the competitive ratio of the given admission control strategy. We use our technique to derive concrete algorithms for the general preemptive and nonpreemptive cases, as well as for the interesting special cases of the 2-value model and the unit value model. To the best of our knowledge this is the first result combining both scheduling and admission control decisions for arbitrary packets sequences in multi-queue switches. We also provide a 1.58-competitive randomized algorithm for the unit value case. this case is interesting by itself since most current networks (e.g. IP networks) only support a best-effort service in which all packets streams are treated equal

关键词： Queueing networks

来源：评论

学校读者我要写书评

暂无评论

On how characteristics that hinder test data generation using symbolic execution combine: An analysis of the SF100 benchmark

On how characteristics that hinder test data generation usin...

引用

computer science Society (SCCC) International conference Chilean FLAGGED

作者： Marcelo Medeiros Eler Andre Takeshi Endo Vinicius H. S. Durelli Danilo Medeiros Eler EACH/USP Sao Paulo SP Brazil UTFPR Cornelio Procopio PR Brazil Universidade de São Paulo São Carlos SP Brazil FCT/UNESP Presidente Prudente SP Brazil

ISBN: (纸本)9781509033409

Symbolic execution has made great strides in the last two decades. However, some characteristics of programs still pose significant challenges to test data generation techniques that use symbolic execution and constraint solving. these challenges present themselves in the form of path explosion, constraint complexity, dependency, and exception-dependent paths. the few studies conducted to date to examine the distribution of such characteristics only investigate them separately. We posit that understanding how the combination of these characteristics appear in real world software may provide a more in-depth knowledge of the limitations of current tools and test data generation techniques. thus, we analyzed a benchmark comprising 100 open source Java programs to get some insight into the frequency of methods that have combinations of the studied characteristics and the distribution of methods whose path constraints share similar structures.

关键词： Complexity theory Explosions Java Arrays Printers Benchmark testing Software

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6543 LNCS卷 V-VI页

作者： Černá, Ivana Gyimothy, Tibor Hromkovč, Juraj Jeffery, Keith Královič, Rastislav Vukolic, Marko Wolf, Stefan

来源：评论

学校读者我要写书评

暂无评论

A case study: do high school GPA/SAT scores predict the performance of freshmen engineering students?

A case study: do high school GPA/SAT scores predict the perf...

引用

Frontiers in Education (FIE) conference

作者： T. Abdel-Salam P. Kaufftnann K. Williamson Engineering Program East Carolina University USA

the current study examines the performance of freshman students in a new engineering program at East Carolina University and compares it to their performance at high school. ECU's engineering program started in Fall 2004 and it differs from many other engineering programs in three primary ways: (1) it emphasizes the application of engineering theory to the real world by engaging freshman students in hands-on engineering activities, (2) the mathematics and science content are integrated with the engineering courses, and (3) the students are working very closely with the engineering faculty and their mates in a team-based learning process (cohort system). the performance of the students in the engineering program is evaluated based on the details of their grades in engineering, and general education courses. Meanwhile, their GPA and Scholastic Aptitude Test (SAT) scores is used to evaluate their performance in high school

关键词： computer aided software engineering Engineering students Educational institutions Testing Mathematics Education courses Collaboration Performance evaluation Economic forecasting

来源：评论

学校读者我要写书评

暂无评论

Efficient and flexible crowdsourcing of specialized tasks with precedence constraints

Efficient and flexible crowdsourcing of specialized tasks wi...

引用

IEEE Annual Joint conference: INFOCOM, IEEE computer and Communications Societies

作者： Avhishek Chatterjee Michael Borokhovich Lav R. Varshney Sriram Vishwanath University of Illinois at Urbana-Champaign The University of Texas at Austin

ISBN: (纸本)9781467399548

Many companies now use crowdsourcing to leverage external (as well as internal) crowds to perform specialized work, and so methods of improving efficiency are critical. Tasks in crowdsourcing systems with specialized work have multiple steps and each step requires multiple skills. Steps may have different flexibilities in terms of obtaining service from one or multiple agents, due to varying levels of dependency among parts of steps. Steps of a task may have precedence constraints among them. Moreover, there are variations in loads of different types of tasks requiring different skill-sets and availabilities of different types of agents with different skill-sets. Considering these constraints together necessitates the design of novel schemes to allocate steps to agents. In addition, large crowdsourcing systems require allocation schemes that are simple, fast, decentralized and offer customers (task requesters) the freedom to choose agents. In this work we study the performance limits of such crowdsourcing systems and propose efficient allocation schemes that provably meet the performance limits under these additional requirements. We demonstrate our algorithms on data from a crowdsourcing platform run by a non-profit company and show significant improvements over current practice.

关键词： Crowdsourcing Resource management Companies computer science Numerical models Stochastic processes conferences

来源：评论

学校读者我要写书评

暂无评论

Open Problem: Running time complexity of accelerated 1-regularized PageRank 35

Open Problem: Running time complexity of accelerated 1-regul...

引用

35th conference on Learning theory, COLT 2022

作者： Fountoulakis, Kimon Yang, Shenghao David R. Cheriton School of Computer Science University of Waterloo Waterloo Canada

Who reads the search results beyond the first page in Google Search? An exaggerated answer to this question is nearly nobody. this motivates approximate personalized ranking of web-pages that are only immediately relevant to a user instead of ranking all web pages that exist. the results in Google Search, Twitter and other popular search engines traditionally utilize the Personalized PageRank (PPR) vector to rank the results in their search engines. Additionally, there is a plethora of applications beyond the web (Gleich, 2015) which are modelled using PPR. In recent work by Andersen et al. (2006);Gleich and Mahoney (2014);Fountoulakis et al. (2019), it was shown that small probabilities in PPR vector, e.g., web pages beyond the first page in Google Search, can be thresholded out automatically by utilizing `1-regularization or equivalently by early termination. Both versions result in approximate computation of PPR. the current fastest method for computing the `1-regularized PPR uses proximal gradient method and requires Õ((αρ)−1) total running time, where α is the teleportation parameter and ρ is a parameter which controls the level of sparsity in the `1-regularized PPR. It is important to note that the running time complexity does not depend on the size of the underlying graph (e.g. the length of the PPR vector). Such property has become a prerequisite to probe modern large scale networks. A seemingly natural way to build an even faster algorithm for computing the `1-regularized PPR is to accelerate the proximal gradient method and consequently reduce the running time complexity to Õ((√αρ)−1). this will lead to a speed-up by a factor of 1/√α and improve the running time of various network analytic methods which build upon PPR. However, the original analysis of the proximal gradient method in Fountoulakis et al. (2019) does not apply to the accelerated version. While we have empirical evidence that indicates accelerated proximal gradient requires less total running

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：