aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
math0304100 | 2115080784 | The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the Blum-Shub-Smale model over the complex numbers, P differs from NP. We prove two weak v... | As for earlier earlier approaches to the @math -conjecture, some investigations into @math were initiated by de Melo and Svaiter @cite_8 (in the special case of constant polynomials) and Moreira @cite_14 . Unfortunately, not much more is known than (a) @math is usually'' bounded below by @math (where @math is @math and... | {
"cite_N": [
"@cite_14",
"@cite_8"
],
"mid": [
"1582746416",
"1542260560"
],
"abstract": [
"Let Or(n) (the cost of n) be the minimum number of arithmetic operations needed to obtain n starting from 1. We prove that Or(n) > log n -log log n for almost all n E N, and, given ? > 0, Or(n) 1 t... |
cs0304003 | 2949728882 | Inevitability properties in branching temporal logics are of the syntax forall eventually , where is an arbitrary (timed) CTL formula. In the sense that "good things will happen", they are parallel to the "liveness" properties in linear temporal logics. Such inevitability properties in dense-time logics can be analyzed... | In @cite_32 , proposed an efficient symbolic model-checking algorithm for TCTL. However, the algorithm does not distinguish between Zeno and non-Zeno computations. Instead, the authors proposed to modify TAs with Zeno computations to ones without. In comparison, our greatest fixpoint evaluation algorithm is innately ab... | {
"cite_N": [
"@cite_32"
],
"mid": [
"2167668895"
],
"abstract": [
"Finite-state programs over real-numbered time in a guarded-command language with real-valued clocks are described. Model checking answers the question of which states of a real-time program satisfy a branching-time specification. ... |
cs0304003 | 2949728882 | Inevitability properties in branching temporal logics are of the syntax forall eventually , where is an arbitrary (timed) CTL formula. In the sense that "good things will happen", they are parallel to the "liveness" properties in linear temporal logics. Such inevitability properties in dense-time logics can be analyzed... | Several verification tools for TA have been devised and implemented so far @cite_8 @cite_24 @cite_2 @cite_34 @cite_14 @cite_16 @cite_28 @cite_21 @cite_6 @cite_35 @cite_9 . UPPAAL @cite_0 @cite_14 is one of the popular tool with DBM technology. It supports safety (reachability) analysis in forward reasoning techniques. ... | {
"cite_N": [
"@cite_35",
"@cite_14",
"@cite_4",
"@cite_8",
"@cite_28",
"@cite_9",
"@cite_21",
"@cite_16",
"@cite_6",
"@cite_24",
"@cite_0",
"@cite_2",
"@cite_31",
"@cite_34",
"@cite_11"
],
"mid": [
"",
"",
"2145000217",
"1874725288",
... |
cs0304003 | 2949728882 | Inevitability properties in branching temporal logics are of the syntax forall eventually , where is an arbitrary (timed) CTL formula. In the sense that "good things will happen", they are parallel to the "liveness" properties in linear temporal logics. Such inevitability properties in dense-time logics can be analyzed... | Kronos @cite_8 @cite_9 is a full TCTL model-checker with DBM technology and both forward and backward reasoning capability. Experiments to demonstrate how to use Kronos to verify several TCTL bounded inevitability properties is demonstrated in @cite_9 . ( Bouonded inevitabilities are those inevitabilities specified wit... | {
"cite_N": [
"@cite_9",
"@cite_8"
],
"mid": [
"2080267935",
"1874725288"
],
"abstract": [
"In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner s... |
1708.02883 | 2742168128 | Consider a structured matrix factorization model where one factor is restricted to have its columns lying in the unit simplex. This simplex-structured matrix factorization (SSMF) model and the associated factorization techniques have spurred much interest in research topics over different areas, such as hyperspectral u... | The first framework to be reviewed is pure-pixel search in HU in remote sensing @cite_27 or separable NMF in machine learning @cite_45 . Both assume that for every @math , there exists an index @math such that [ i_k = . ] The above assumption is called the pure-pixel assumption in HU or separability assumption in separ... | {
"cite_N": [
"@cite_35",
"@cite_36",
"@cite_41",
"@cite_9",
"@cite_32",
"@cite_19",
"@cite_27",
"@cite_45",
"@cite_10"
],
"mid": [
"2040399008",
"2125126993",
"2046793177",
"1966872876",
"2951734015",
"1969013340",
"2185164352",
"1854811422",
... |
1708.02883 | 2742168128 | Consider a structured matrix factorization model where one factor is restricted to have its columns lying in the unit simplex. This simplex-structured matrix factorization (SSMF) model and the associated factorization techniques have spurred much interest in research topics over different areas, such as hyperspectral u... | To give insights into how the geometry of the pure-pixel case can be utilized for SSMF, we briefly describe a pure-pixel search framework based on maximum volume inscribed simplex (MVIS) @cite_4 @cite_47 . The MVIS framework considers the following problem where we seek to find a simplex @math such that it is inscribed... | {
"cite_N": [
"@cite_47",
"@cite_4"
],
"mid": [
"2050041778",
"2157321686"
],
"abstract": [
"Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspectral scene. Many existing hyp... |
1708.02883 | 2742168128 | Consider a structured matrix factorization model where one factor is restricted to have its columns lying in the unit simplex. This simplex-structured matrix factorization (SSMF) model and the associated factorization techniques have spurred much interest in research topics over different areas, such as hyperspectral u... | While MVES is appealing in its recovery guarantees, the pursuit of SSMF frameworks is arguably not over. The MVES problem is non-convex and NP-hard in general @cite_21 . Our numerical experience is that the convergence of an MVES algorithm to a good result could depend on the starting point. Hence, it is interesting to... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2026302893"
],
"abstract": [
"The problem of finding a d -simplex of maximum volume in an arbitrary d -dimensional V -polytope, for arbitrary d , was shown by [GKL] in 1995 to be NP-hard. They conjectured that the corresponding problem for H -polytopes is also... |
1708.02884 | 2951525085 | The size of a software artifact influences the software quality and impacts the development process. In industry, when software size exceeds certain thresholds, memory errors accumulate and development tools might not be able to cope anymore, resulting in a lengthy program start up times, failing builds, or memory prob... | Size measurement is also well studied. Research investigating software size has shown that size can be used to assess productivity @cite_27 and defects @cite_25 in practice. @cite_18 have shown that simple metrics like lines of code are well suited to assess software complexity and maintainability in a similar environm... | {
"cite_N": [
"@cite_27",
"@cite_18",
"@cite_25"
],
"mid": [
"2134304939",
"2077418553",
"2120999344"
],
"abstract": [
"Some current object-oriented analysis methods provide use cases. Scenarios or similar concepts to describe functional requirements for software systems. The autho... |
1708.02884 | 2951525085 | The size of a software artifact influences the software quality and impacts the development process. In industry, when software size exceeds certain thresholds, memory errors accumulate and development tools might not be able to cope anymore, resulting in a lengthy program start up times, failing builds, or memory prob... | Regarding the field of mining software repositories, many studies focus on predicting defects like Zimmermann @cite_19 . Other studies have used software repositories to investigate refactoring practices (cf. @cite_5 ). However, to the best knowledge of the authors, no studies have been reported so far combining aspect... | {
"cite_N": [
"@cite_19",
"@cite_5"
],
"mid": [
"2125346455",
"2113157806"
],
"abstract": [
"Software development results in a huge amount of data: changes to source code are recorded in version archives, bugs are reported to issue tracking systems, and communications are archived in e-mai... |
1708.02716 | 2743832495 | Recognizing freehand sketches with high arbitrariness is greatly challenging. Most existing methods either ignore the geometric characteristics or treat sketches as handwritten characters with fixed structural ordering. Consequently, they can hardly yield high recognition performance even though sophisticated learning ... | In 2012, @cite_11 released a dataset containing 20,000 sketches distributed over 250 object categories. These sketches are drawn from daily objects, but humans can only correctly identify the sketch category with the accuracy 73 Hand-crafted features share similar spirit with image classification methods, including fea... | {
"cite_N": [
"@cite_22",
"@cite_1",
"@cite_23",
"@cite_16",
"@cite_11"
],
"mid": [
"2161969291",
"",
"2151103935",
"2048568806",
"1972420097"
],
"abstract": [
"We study the question of feature sets for robust visual object recognition; adopting linear SVM based hum... |
1708.02716 | 2743832495 | Recognizing freehand sketches with high arbitrariness is greatly challenging. Most existing methods either ignore the geometric characteristics or treat sketches as handwritten characters with fixed structural ordering. Consequently, they can hardly yield high recognition performance even though sophisticated learning ... | Recently, deep neural networks (DNNs) have achieved great success @cite_2 by replacing hand-crafted representation with learning strategy. @cite_30 @cite_21 leverage a well-designed convolutional neural network(CNN) architecture for sketch recognition.According to their experimental results, their method surpass the be... | {
"cite_N": [
"@cite_30",
"@cite_21",
"@cite_1",
"@cite_2",
"@cite_25",
"@cite_12"
],
"mid": [
"2950166981",
"2493181180",
"",
"",
"2949877834",
"2013585293"
],
"abstract": [
"We propose a multi-scale multi-channel deep neural network framework that, for the... |
1708.02716 | 2743832495 | Recognizing freehand sketches with high arbitrariness is greatly challenging. Most existing methods either ignore the geometric characteristics or treat sketches as handwritten characters with fixed structural ordering. Consequently, they can hardly yield high recognition performance even though sophisticated learning ... | CNNs and RNNs are two branches of neural network. CNNs have obtained great success in many practical application @cite_2 @cite_27 . LeNet @cite_7 is a classical CNN architecture, which has been used in handwritten number recognition. Wang @cite_8 use Siamese network to retrieve 3D model by sketch. However, all the abov... | {
"cite_N": [
"@cite_8",
"@cite_27",
"@cite_7",
"@cite_2"
],
"mid": [
"2952320381",
"1686810756",
"2154579312",
""
],
"abstract": [
"Retrieving 3D models from 2D human sketches has received considerable attention in the areas of graphics, image retrieval, and computer visio... |
1708.02716 | 2743832495 | Recognizing freehand sketches with high arbitrariness is greatly challenging. Most existing methods either ignore the geometric characteristics or treat sketches as handwritten characters with fixed structural ordering. Consequently, they can hardly yield high recognition performance even though sophisticated learning ... | In order to exploit appropriate learning architecture for sketch recognition, @cite_30 @cite_21 develop a network named as Sketch-A-Net (SAN), which enlarges the pooling sizes and patches of filters to cater the sparse character of sketches. Different from traditional images, sketches involve inherent sequential proper... | {
"cite_N": [
"@cite_30",
"@cite_21"
],
"mid": [
"2950166981",
"2493181180"
],
"abstract": [
"We propose a multi-scale multi-channel deep neural network framework that, for the first time, yields sketch recognition performance surpassing that of humans. Our superior performance is a result... |
1708.02716 | 2743832495 | Recognizing freehand sketches with high arbitrariness is greatly challenging. Most existing methods either ignore the geometric characteristics or treat sketches as handwritten characters with fixed structural ordering. Consequently, they can hardly yield high recognition performance even though sophisticated learning ... | The sequential property is not proprietary for sketches. Many works resort to RNN to improve the performance in speech recognition @cite_18 and text generation @cite_28 . RNN is specialized for processing input sequence, which can bridge the hidden units and deliver the outputs from former sequence to the latter. Howev... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_28",
"@cite_3",
"@cite_10"
],
"mid": [
"2115730999",
"2950635152",
"196214544",
"",
"1924770834"
],
"abstract": [
"In this paper, we show how new training principles and optimization techniques for neural networks can be u... |
1708.02716 | 2743832495 | Recognizing freehand sketches with high arbitrariness is greatly challenging. Most existing methods either ignore the geometric characteristics or treat sketches as handwritten characters with fixed structural ordering. Consequently, they can hardly yield high recognition performance even though sophisticated learning ... | Sarvadevabhatla @cite_25 take orders of strokes as a sequence and feed their features to GRU. In this way, a long-term sequential and structural regularities of stoke can be exploited. As a result, they achieve the best recognition performance. However, stroke order varies severely in the same kind, which results in th... | {
"cite_N": [
"@cite_25"
],
"mid": [
"2949877834"
],
"abstract": [
"Freehand sketching is an inherently sequential process. Yet, most approaches for hand-drawn sketch recognition either ignore this sequential aspect or exploit it in an ad-hoc manner. In our work, we propose a recurrent neural netw... |
1708.02760 | 2743858606 | The ability to ask questions is a powerful tool to gather information in order to learn about the world and resolve ambiguities. In this paper, we explore a novel problem of generating discriminative questions to help disambiguate visual instances. Our work can be seen as a complement and new extension to the rich rese... | . The goal of image captioning is to automatically generate natural language description of images @cite_33 . The CNN-LSTM framework has been commonly adopted and shows good performance @cite_25 @cite_17 @cite_0 @cite_44 @cite_18 . Xu al @cite_55 introduce attention mechanism to exploit spatial information from image c... | {
"cite_N": [
"@cite_35",
"@cite_18",
"@cite_33",
"@cite_60",
"@cite_55",
"@cite_6",
"@cite_0",
"@cite_44",
"@cite_19",
"@cite_25",
"@cite_17"
],
"mid": [
"2220981600",
"2952322859",
"2949769367",
"2549599535",
"2950178297",
"2953106684",
"18... |
1708.02760 | 2743858606 | The ability to ask questions is a powerful tool to gather information in order to learn about the world and resolve ambiguities. In this paper, we explore a novel problem of generating discriminative questions to help disambiguate visual instances. Our work can be seen as a complement and new extension to the rich rese... | . A closely related task to VDQG is REG, where the model is required to generate unambiguous object descriptions. Referring expression has been studied in Natural Language Processing (NLP) @cite_43 @cite_22 @cite_52 . Kazemzadeh al @cite_27 introduce the first large-scale dataset for the REG in real-world scenes. They ... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_28",
"@cite_41",
"@cite_29",
"@cite_52",
"@cite_43",
"@cite_27",
"@cite_49",
"@cite_59",
"@cite_16"
],
"mid": [
"2949107813",
"",
"",
"2571175805",
"2963735856",
"",
"1533917153",
"2251512949",... |
1708.02861 | 2745029067 | Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throughput with decentralized transmission. In this paper, we propose a decentralized multi-cell-aware opportunistic random access (MA-ORA) protocol that achieves the optimal throughput scaling in a... | On the one hand, there are extensive studies on handling interference management of cellular networks with multiple base stations @cite_31 @cite_44 . While it has been elusive to find the optimal strategy with respect to the Shannon-theoretic capacity in multiuser cellular networks, interference alignment (IA) was rece... | {
"cite_N": [
"@cite_35",
"@cite_18",
"@cite_22",
"@cite_7",
"@cite_41",
"@cite_48",
"@cite_36",
"@cite_42",
"@cite_6",
"@cite_44",
"@cite_43",
"@cite_40",
"@cite_31",
"@cite_34",
"@cite_13",
"@cite_11"
],
"mid": [
"2012454404",
"",
"",
... |
1708.03020 | 2963492344 | We consider a non-stationary sequential stochastic optimization problem, in which the underlying cost functions change over time under a variation budget constraint. We propose an @math -variation functional to quantify the change, which yields less variation for dynamic function sequences whose changes are constrained... | Bandit convex optimization is a combination of stochastic optimization and online convex optimization, where the stationary benchmark in hindsight of a sequence of arbitrary convex functions @math is used to evaluate regrets. At each time @math , only the function evaluation at the queried point @math (or its noisy ver... | {
"cite_N": [
"@cite_10",
"@cite_4",
"@cite_6"
],
"mid": [
"2473549844",
"2952840318",
"2151056989"
],
"abstract": [
"We consider the adversarial convex bandit problem and we build the first @math -time algorithm with @math -regret for this problem. To do so we introduce three new ... |
1906.00097 | 2947328144 | As deep learning applications continue to become more diverse, an interesting question arises: Can general problem solving arise from jointly learning several such diverse tasks? To approach this question, deep multi-task learning is extended in this paper to the setting where there is no obvious overlap between task a... | Parameters in two architectures are if they have some learnable tensor in common. An alignment across architectures implies how tasks are related, and how much they are related. The goal of DMTL is to improve performance across tasks through joint training of aligned architectures, exploiting inter-task regularities. I... | {
"cite_N": [
"@cite_61",
"@cite_67",
"@cite_62",
"@cite_26",
"@cite_60",
"@cite_36",
"@cite_65",
"@cite_52",
"@cite_0",
"@cite_43",
"@cite_45",
"@cite_63",
"@cite_2",
"@cite_23",
"@cite_5",
"@cite_46",
"@cite_25"
],
"mid": [
"2964262254",
... |
1906.00097 | 2947328144 | As deep learning applications continue to become more diverse, an interesting question arises: Can general problem solving arise from jointly learning several such diverse tasks? To approach this question, deep multi-task learning is extended in this paper to the setting where there is no obvious overlap between task a... | The classical approach to DMTL considers a joint model across tasks in which some aligned layers are shared completely across tasks, and the remaining layers remain task-specific @cite_1 . In practice, the most common approach is to share all layers except for the final classification layers @cite_61 @cite_22 @cite_50 ... | {
"cite_N": [
"@cite_61",
"@cite_31",
"@cite_14",
"@cite_22",
"@cite_7",
"@cite_54",
"@cite_1",
"@cite_3",
"@cite_39",
"@cite_24",
"@cite_43",
"@cite_27",
"@cite_45",
"@cite_50",
"@cite_47",
"@cite_13"
],
"mid": [
"2964262254",
"2065180801",
... |
1906.00097 | 2947328144 | As deep learning applications continue to become more diverse, an interesting question arises: Can general problem solving arise from jointly learning several such diverse tasks? To approach this question, deep multi-task learning is extended in this paper to the setting where there is no obvious overlap between task a... | One approach to overcome the alignment problem is to design an entirely new architecture that integrates information from different tasks and is maximally shared across tasks @cite_62 @cite_21 @cite_53 . Such an approach can even be used to share knowledge across disparate modalities @cite_53 . However, by disregarding... | {
"cite_N": [
"@cite_62",
"@cite_8",
"@cite_28",
"@cite_53",
"@cite_21",
"@cite_16"
],
"mid": [
"2964056935",
"2963216850",
"2963393838",
"2626792426",
"2556468274",
"2963704251"
],
"abstract": [
"Modern discriminative predictors have been shown to match nat... |
1906.00110 | 2947039732 | The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and or costs), compared to a centralized system design. H... | While in many text book examples, Nash equilibria are typically bad'' and highlight a failure of cooperation (e.g., Prisoner's Dilemma, tragedy of the commons, etc.), research shows that in many application domains, even the worst game-theoretic equilibria are often fairly close to the optimal outcome @cite_18 . Howeve... | {
"cite_N": [
"@cite_0",
"@cite_18",
"@cite_36"
],
"mid": [
"2139774323",
"2136124238",
"2132467626"
],
"abstract": [
"(This article originally appeared in Management Science, November 1967, Volume 14, Number 3, pp. 159-182, published by The Institute of Management Sciences.) The p... |
1906.00110 | 2947039732 | The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and or costs), compared to a centralized system design. H... | More specifically, we revisited 's virus inoculation game @cite_32 in this paper. Traditional virus propagation models studied virus infection in terms of birth and death rates of viruses @cite_2 @cite_16 as well as through local interactions on networks @cite_6 @cite_3 @cite_43 (e.g., the Internet @cite_11 @cite_1 ). ... | {
"cite_N": [
"@cite_1",
"@cite_32",
"@cite_3",
"@cite_6",
"@cite_43",
"@cite_2",
"@cite_15",
"@cite_16",
"@cite_11"
],
"mid": [
"",
"2152769037",
"2108050790",
"2153692272",
"2140697769",
"114870970",
"2142897866",
"",
"2123279152"
],
"a... |
1906.00184 | 2947908969 | Image-to-image translation models have shown remarkable ability on transferring images among different domains. Most of existing work follows the setting that the source domain and target domain keep the same at training and inference phases, which cannot be generalized to the scenarios for translating an image from an... | Image generation has been widely investigated in recent years. Most of works focus on modeling the natural image distribution. Generative Adversarial Network (GAN) @cite_10 was firstly proposed to generate images from random variables by a two-player minimax game: a generator G tries to create fake but plausible images... | {
"cite_N": [
"@cite_26",
"@cite_10",
"@cite_33",
"@cite_16"
],
"mid": [
"2739748921",
"2099471712",
"2962879692",
"2593414223"
],
"abstract": [
"",
"We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train... |
1906.00184 | 2947908969 | Image-to-image translation models have shown remarkable ability on transferring images among different domains. Most of existing work follows the setting that the source domain and target domain keep the same at training and inference phases, which cannot be generalized to the scenarios for translating an image from an... | Zero-Shot Learning (ZSL) was first introduced by @cite_0 , where train and test classes are disjoint for object recognition. Traditional methods for ZSL are based on learning an embedding from the visual space to the semantic space. In the test period, the semantic vector of an unseen sample is extracted and the most l... | {
"cite_N": [
"@cite_12",
"@cite_4",
"@cite_28",
"@cite_0",
"@cite_19",
"@cite_24",
"@cite_27",
"@cite_5",
"@cite_15",
"@cite_13",
"@cite_25",
"@cite_20"
],
"mid": [
"",
"2950700180",
"",
"2134270519",
"2950276680",
"2963784503",
"2400717... |
1906.00117 | 2947794021 | Recently, a method [7] was proposed to generate contrastive explanations for differentiable models such as deep neural networks, where one has complete access to the model. In this work, we propose a method, Model Agnostic Contrastive Explanations Method (MACEM), to generate contrastive explanations for classification ... | Trust and transparency of AI systems has received a lot of attention recently @cite_35 . Explainability is considered to be one of the cornerstones for building trustworthy systems and has been of particular focus in the research community @cite_16 @cite_37 . Researchers are trying to build better performing interpreta... | {
"cite_N": [
"@cite_35",
"@cite_37",
"@cite_14",
"@cite_36",
"@cite_9",
"@cite_32",
"@cite_24",
"@cite_19",
"@cite_2",
"@cite_5",
"@cite_16",
"@cite_13"
],
"mid": [
"",
"2625712209",
"2282479846",
"2617799811",
"1996796871",
"2499224235",
... |
1906.00230 | 2947920725 | This paper is concerned with the robustness of VAEs to adversarial attacks. We highlight that conventional VAEs are brittle under attack but that methods recently introduced for disentanglement such as @math -TCVAE (, 2018) improve robustness, as demonstrated through a variety of previously proposed adversarial attacks... | In a @math -VAE @cite_14 , a free parameter @math multiplies the @math term in @math above. This objective @math remains a lower bound on the evidence. | {
"cite_N": [
"@cite_14"
],
"mid": [
"2753738274"
],
"abstract": [
"Learning an interpretable factorised representation of the independent data generative factors of the world without supervision is an important precursor for the development of artificial intelligence that is able to learn and rea... |
1906.00230 | 2947920725 | This paper is concerned with the robustness of VAEs to adversarial attacks. We highlight that conventional VAEs are brittle under attack but that methods recently introduced for disentanglement such as @math -TCVAE (, 2018) improve robustness, as demonstrated through a variety of previously proposed adversarial attacks... | A is the total correlation (TC) for @math , a generalisation of mutual information to multiple variables @cite_25 . With this mean-field @math , Factor and @math -TCVAEs upweight this term, so we have an objective @math . @cite_28 gives a differentiable, stochastic approximation to @math , rendering this decomposition ... | {
"cite_N": [
"@cite_28",
"@cite_13",
"@cite_25",
"@cite_11"
],
"mid": [
"2964127395",
"",
"2095439994",
"2108384452"
],
"abstract": [
"We decompose the evidence lower bound to show the existence of a term measuring the total correlation between latent variables. We use thi... |
1906.00230 | 2947920725 | This paper is concerned with the robustness of VAEs to adversarial attacks. We highlight that conventional VAEs are brittle under attack but that methods recently introduced for disentanglement such as @math -TCVAE (, 2018) improve robustness, as demonstrated through a variety of previously proposed adversarial attacks... | We now have a set of @math layers of @math variables: @math . The evidence lower bound for models of this form is: The simplest VAE with a hierarchy of conditional stochastic variables in the generative model is the Deep Latent Gaussian Model @cite_5 . The forward model factorises as a chain: Each @math is a Gaussian d... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2962897886"
],
"abstract": [
"We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed generative models, endowed with a new algorithm for scalable inference and learning. Our algorithm introduc... |
1906.00230 | 2947920725 | This paper is concerned with the robustness of VAEs to adversarial attacks. We highlight that conventional VAEs are brittle under attack but that methods recently introduced for disentanglement such as @math -TCVAE (, 2018) improve robustness, as demonstrated through a variety of previously proposed adversarial attacks... | To perform amortised variational inference one introduces a recognition network, which can be any directed acyclic graph where each node, each distribution over each @math , is Gaussian conditioned on its parents. This could be a chain, as in @cite_5 : Again, marginalising out intermediate @math layers, we see @math @m... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2962897886"
],
"abstract": [
"We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed generative models, endowed with a new algorithm for scalable inference and learning. Our algorithm introduc... |
1906.00230 | 2947920725 | This paper is concerned with the robustness of VAEs to adversarial attacks. We highlight that conventional VAEs are brittle under attack but that methods recently introduced for disentanglement such as @math -TCVAE (, 2018) improve robustness, as demonstrated through a variety of previously proposed adversarial attacks... | This is the hierarchical version of the collapse of @math units in a single-layer VAE @cite_17 , but now the collapse is over entire layers @math . It is part of the motivation for the Ladder VAE @cite_1 and BIVA @cite_35 . 2pt | {
"cite_N": [
"@cite_35",
"@cite_1",
"@cite_17"
],
"mid": [
"2913002991",
"2963135265",
"2963275229"
],
"abstract": [
"With the introduction of the variational autoencoder (VAE), probabilistic latent variable models have received renewed attention as powerful generative models. How... |
cs0112007 | 2949074981 | In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight u... | One of the first optimizations was the DHP algorithm proposed by @cite_25 . This algorithm uses a hashing scheme to collect upper bounds on the frequencies of the candidate patterns for the following pass. Patterns of which it is already known that they will turn up infrequent can then be eliminated from further consid... | {
"cite_N": [
"@cite_25"
],
"mid": [
"2030969394"
],
"abstract": [
"In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large item... |
cs0112007 | 2949074981 | In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight u... | The sampling algorithm proposed by Toivonen @cite_3 performs at most two scans through the database by picking a random sample from the database, then finding all frequent patterns that probably hold in the whole database, and then verifying the results with the rest of the database. In the cases where the sampling met... | {
"cite_N": [
"@cite_3"
],
"mid": [
"1597561788"
],
"abstract": [
"Discovery of association rules .is an important database mining problem. Current algorithms for finding association rules require several passes over the analyzed database, and obviously the role of I O overhead is very significant... |
cs0112007 | 2949074981 | In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight u... | The DIC algorithm, proposed by @cite_12 , tries to reduce the number of passes over the database by dividing the database into intervals of a specific size. First, all candidate patterns of size @math are generated. The frequencies of the candidate sets are then counted over the first interval of the database. Based on... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2037965136"
],
"abstract": [
"We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and y... |
cs0112007 | 2949074981 | In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight u... | Also, current state-of-the-art algorithms for frequent itemset mining, such as Opportunistic Project @cite_6 and DCI @cite_14 use several techniques within the same algorithm and switch between these techniques using several simple, but not waterproof heuristics. | {
"cite_N": [
"@cite_14",
"@cite_6"
],
"mid": [
"2064853889",
"2032226242"
],
"abstract": [
"Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an... |
cs0112011 | 1632815424 | We investigate ways to support interactive mining sessions, in the setting of association rule mining. In such sessions, users specify conditions (queries) on the associations to be generated. Our approach is a combination of the integration of querying conditions inside the mining phase, and the incremental querying o... | The idea that queries can be integrated in the mining algorithm was initially launched by Srikant, Vu, and Agrawal @cite_24 , who considered queries that are Boolean expressions over the presence or absence of certain items in the rules. Queries specifically as bodies or heads were not discussed. The authors considered... | {
"cite_N": [
"@cite_24"
],
"mid": [
"1538285186"
],
"abstract": [
"The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of associa... |
cs0112011 | 1632815424 | We investigate ways to support interactive mining sessions, in the setting of association rule mining. In such sessions, users specify conditions (queries) on the associations to be generated. Our approach is a combination of the integration of querying conditions inside the mining phase, and the incremental querying o... | Also Lakshmanan, Ng, Han and Pang worked on the integration of constraints on itemsets in mining, considering conjunctions of conditions on itemsets such as those considered here, as well as others (arbitrary Boolean combinations were not discussed) @cite_9 @cite_7 . Of the various strategies for the so-called CAP'' al... | {
"cite_N": [
"@cite_9",
"@cite_23",
"@cite_7",
"@cite_2"
],
"mid": [
"2125714474",
"1972870286",
"2085638007",
"2148693963"
],
"abstract": [
"Currently, there is tremendous interest in providing ad-hoc mining capabilities in database management systems. As a first step tow... |
cs0202008 | 2952049303 | Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper... | Chord @cite_0 and CFS @cite_7 suggest alternatives to making the query response travel down the reverse query path back to the query issuer. Chord suggests iterative searches where the query issuer contacts each node on the query path one-by-one for the item of interest until one of the nodes is found to have the item.... | {
"cite_N": [
"@cite_0",
"@cite_7"
],
"mid": [
"2118428193",
"2150676586"
],
"abstract": [
"A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that ad... |
cs0202008 | 2952049303 | Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper... | Consistent hashing work by @cite_3 looks at relieving hot spots at origin web servers by caching at intermediate caches between client caches and origin servers. Requests for items originate at the leaf clients of a conceptual tree and travel up through intermediate caches toward the origin server at the root of the tr... | {
"cite_N": [
"@cite_3"
],
"mid": [
"2020765652"
],
"abstract": [
"We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such... |
cs0202008 | 2952049303 | Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper... | Cohen and Kaplan study the effect that aging through cascaded caches has on the miss rates of web client caches @cite_10 . For each object an intermediate cache refreshes its copy of the object when its age exceeds a fraction of the lifetime duration. The intermediate cache does not push this refresh to the client; ins... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2157170064"
],
"abstract": [
"The Web is a distributed system, where data is stored and disseminated from both origin servers and caches. Origin servers provide the most up-to-date copy whereas caches store and serve copies that had been cached for a while. Or... |
cs0204018 | 2952290399 | We study one dimension in program evolution, namely the evolution of the datatype declarations in a program. To this end, a suite of basic transformation operators is designed. We cover structure-preserving refactorings, but also structure-extending and -reducing adaptations. Both the object programs that are subject t... | Formal program transformation @cite_0 separates two concerns: the development of an initial, maybe inefficient program the correctness of which can easily be shown, and the stepwise derivation of a better implementation in a semantics-preserving manner. Partsch's textbook @cite_8 describes the formal approach to this k... | {
"cite_N": [
"@cite_0",
"@cite_17",
"@cite_3",
"@cite_8"
],
"mid": [
"2023299380",
"1988290118",
"1554561354",
""
],
"abstract": [
"A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, luc... |
cs0204018 | 2952290399 | We study one dimension in program evolution, namely the evolution of the datatype declarations in a program. To this end, a suite of basic transformation operators is designed. We cover structure-preserving refactorings, but also structure-extending and -reducing adaptations. Both the object programs that are subject t... | There is a large body of research addressing the related problem of database schema evolution @cite_11 as relevant, for example, in database re- and reverse engineering @cite_9 . The schema transformations themselves can be compared with our datatype transformations only at a superficial level because of the different ... | {
"cite_N": [
"@cite_9",
"@cite_18",
"@cite_6",
"@cite_11"
],
"mid": [
"1544920330",
"",
"2583677609",
"2215315499"
],
"abstract": [
"The paper presents a DBMS-independent database reverse engineering (DBRE) methodology based on a generic process model and on transformation... |
cs0204018 | 2952290399 | We study one dimension in program evolution, namely the evolution of the datatype declarations in a program. To this end, a suite of basic transformation operators is designed. We cover structure-preserving refactorings, but also structure-extending and -reducing adaptations. Both the object programs that are subject t... | The transformational approach to program evolution is nowadays called refactoring @cite_19 @cite_4 , but the idea is not new @cite_15 @cite_12 . Refactoring means to improve the structure of code so that it becomes more comprehensible, maintainable, and adaptable. Interactive refactoring tools are being studied and use... | {
"cite_N": [
"@cite_4",
"@cite_7",
"@cite_21",
"@cite_19",
"@cite_5",
"@cite_15",
"@cite_16",
"@cite_13",
"@cite_12"
],
"mid": [
"2153887189",
"1487314578",
"2172168118",
"1487664366",
"1546190629",
"2133528651",
"1996710532",
"2120426933",
... |
cs0206040 | 2949146353 | Application development for distributed computing "Grids" can benefit from tools that variously hide or enable application-level management of critical aspects of the heterogeneous environment. As part of an investigation of these issues, we have developed MPICH-G2, a Grid-enabled implementation of the Message Passing ... | A variety of approaches have been proposed to programming Grid applications, including object systems @cite_35 @cite_40 , Web technologies @cite_11 @cite_26 , problem solving environments @cite_28 @cite_34 , CORBA, workflow systems, high-throughput computing systems @cite_27 @cite_8 , and compiler-based systems @cite_3... | {
"cite_N": [
"@cite_35",
"@cite_26",
"@cite_8",
"@cite_28",
"@cite_3",
"@cite_40",
"@cite_27",
"@cite_34",
"@cite_11"
],
"mid": [
"",
"2147342997",
"2140332639",
"2006523031",
"",
"",
"2162232794",
"2019693854",
""
],
"abstract": [
"... |
cs0208023 | 2132313847 | The advent of multicast and the growth and complexity of the Internet has complicated network protocol design and evaluation. Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such an approach may be useful for average case analysis but does not cover boundary-po... | There is a large body of literature dealing with verification of protocols. Verification systems typically address well-defined properties --such as safety , liveness , and responsiveness @cite_41 -- and aim to detect violations of these properties. In general, the two main approaches for protocol verification are theo... | {
"cite_N": [
"@cite_41",
"@cite_22",
"@cite_39",
"@cite_2"
],
"mid": [
"2005307131",
"2119895020",
"2099078002",
"2034717157"
],
"abstract": [
"This paper addresses the problem of designing stabilizing computer communication protocols modelled by communicating finite state... |
cs0208023 | 2132313847 | The advent of multicast and the growth and complexity of the Internet has complicated network protocol design and evaluation. Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such an approach may be useful for average case analysis but does not cover boundary-po... | Reachability analysis algorithms @cite_21 , on the other hand, try to inspect reachable protocol states, and suffer from the state space explosion' problem. To circumvent this problem, state reduction techniques could be used @cite_25 . These algorithms, however, do not synthesize network topologies. Reduced reachabili... | {
"cite_N": [
"@cite_0",
"@cite_21",
"@cite_25"
],
"mid": [
"2033263591",
"2023949272",
"1540501475"
],
"abstract": [
"In this article we present a comprehensive survey of various approaches for the verification of cache coherence protocols based on state enumeration, (symbolic mod... |
cs0208023 | 2132313847 | The advent of multicast and the growth and complexity of the Internet has complicated network protocol design and evaluation. Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such an approach may be useful for average case analysis but does not cover boundary-po... | There is a good number of publications dealing with conformance testing @cite_24 @cite_27 @cite_26 @cite_5 . However, conformance testing verifies that an implementation (as a black box) adheres to a given specification of the protocol by constructing input output sequences. Conformance testing is useful during the imp... | {
"cite_N": [
"@cite_24",
"@cite_5",
"@cite_27",
"@cite_26"
],
"mid": [
"2073074602",
"1965028135",
"2158348156",
"2029755436"
],
"abstract": [
"Abstract We present simple randomized algorithms for the fault detection problem : Given a specification in the form of a determi... |
cs0208023 | 2132313847 | The advent of multicast and the growth and complexity of the Internet has complicated network protocol design and evaluation. Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such an approach may be useful for average case analysis but does not cover boundary-po... | Automatic test generation techniques have been used in several fields. VLSI chip testing @cite_16 uses test vector generation to detect target faults. Test vectors may be generated based on circuit and fault models, using the fault-oriented technique, that utilizes implication techniques. These techniques were adopted ... | {
"cite_N": [
"@cite_29",
"@cite_16"
],
"mid": [
"1962021926",
"1554885925"
],
"abstract": [
"We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a finite state machine (FSM) model of the protocol and uses a mix of forward and backward se... |
cs0208023 | 2132313847 | The advent of multicast and the growth and complexity of the Internet has complicated network protocol design and evaluation. Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such an approach may be useful for average case analysis but does not cover boundary-po... | @cite_36 , a simulation-based stress testing framework based on heuristics was proposed. However, that method does not provide automatic topology generation, nor does it address performance issues. The VINT @cite_17 tools provide a framework for Internet protocols simulation. Based on the network simulator (NS) @cite_3... | {
"cite_N": [
"@cite_36",
"@cite_31",
"@cite_23",
"@cite_17"
],
"mid": [
"1544819167",
"2031849950",
"1835764870",
"1494182064"
],
"abstract": [
"We propose a method for using simulation to analyze the robustness of multiparty (multicast-based) protocols in a systematic fas... |
cs0208029 | 2953092023 | Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease. This article has two goals: to give a tutorial of ... | The multiparadigm language Leda was developed for educational purposes @cite_117 . It is sequential, supports functional and object-oriented programming, and has basic support for backtracking and a simple form of logic programming that is a subset of Prolog. | {
"cite_N": [
"@cite_117"
],
"mid": [
"1600021945"
],
"abstract": [
"Offering an alternative approach to multiparadigm programming concepts, this work presents the four major language paradigms - imperative, object-oriented, functional and logical - through a new, common language called Leda. It: ... |
cs0210015 | 2130323825 | We consider the prospect of a processor that can perform interval arithmetic at the same speed as conventional floating-point arithmetic. This makes it possible for all arithmetic to be performed with the superior security of interval methods without any penalty in speed. In such a situation the IEEE floating-point sta... | For most of the time since the beginning of interval arithmetic, two systems have coexisted. One was the official one, where intervals were bounded, and division by an interval containing zero was undefined. Recognizing the unpracticality of this approach, there was also a definition of extended'' interval arithmetic @... | {
"cite_N": [
"@cite_0",
"@cite_5",
"@cite_4"
],
"mid": [
"2129480103",
"53281316",
"2067648572"
],
"abstract": [
"List of Figures. List of Tables. Preface. 1. Preliminaries. 2. Software Environments. 3. On Preconditioning. 4. Verified Solution of Nonlinear Systems. 5. Optimization... |
cs0210024 | 1661438368 | We introduce a new class of scheduling problems in which the optimization is performed by the worker (single "machine") who performs the tasks. A typical worker's objective is to minimize the amount of work he does (he is "lazy"), or more generally, to schedule as inefficiently (in some sense) as possible. The worker i... | Recently Hepner and Stein @cite_5 published a pseudo-polynomial-time algorithm for minimizing the makespan subject to preemption constraint II, thus resolving an open problem from an earlier version of this paper @cite_3 . They also extend the LBP to the parallel setting, in which there are multiple bureaucrats. | {
"cite_N": [
"@cite_5",
"@cite_3"
],
"mid": [
"1565331571",
"2568731922"
],
"abstract": [
"We study the problem of minimizing makespan for the Lazy Bureaucrat Scheduling Problem. We give a pseudopolynomial time algorithm for a preemptive scheduling problem, resolving an open problem by We... |
quant-ph0210020 | 2949678910 | Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f) as the square root of RC(f). We then use this result to prove the... | @cite_2 studied a query complexity measure they called @math , for Merlin-Arthur. In our notation, @math equals the maximum of @math over all @math with @math . observed that @math , where @math is the number of queries needed given arbitrarily many rounds of interaction with a prover. They also used error-correcting c... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2085180799"
],
"abstract": [
"It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones (N. Nisan, SIAM J. Comput.20, No. 6 (1991), 999?1007). Motivated by a question if randomization can significantly speed... |
cs0212026 | 1666765554 | Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, w... | We now review loop checking in more details. To our best knowledge, among all existing loop checking mechanisms only OS-check @cite_18 , EVA-check @cite_13 and VAF-check @cite_14 are suitable for logic programs with function symbols. They rely on a structural characteristic of infinite SLD-derivations, namely, the grow... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_13"
],
"mid": [
"89799265",
"1981314990",
"1975546131"
],
"abstract": [
"",
"Two complete loop checking mechanisms have been presented in the literature for logic programs with functions: OS-check and EVA-check. OS-check is computati... |
cs0212026 | 1666765554 | Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, w... | OS-check (for OverSize loop check) was first introduced by Shalin @cite_18 @cite_11 and was then formalized by Bol @cite_19 . It is based on a function @math that can have one of the three following definitions: for any atoms @math and @math , either @math , either @math (resp. @math ) is the count of symbols appearing... | {
"cite_N": [
"@cite_19",
"@cite_18",
"@cite_11"
],
"mid": [
"2135124683",
"89799265",
"1985933047"
],
"abstract": [
"In the framework of Lloyd and Shepherdson [16], partial deduction involves the creation of SLDNF-trees for a given program and some goals up to certain halting poin... |
cs0212026 | 1666765554 | Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, w... | EVA-check (for Extented Variant Atoms loop check) was introduced by Shen @cite_13 . It is based on the notion of . EVA-check says that an SLD-derivation may be infinite if it generates an atomic subgoal @math that is a generalized variant of some of its ancestor @math , @math is a variant of @math except for some argum... | {
"cite_N": [
"@cite_13"
],
"mid": [
"1975546131"
],
"abstract": [
"The Equality check and the Subsumption check are weakly sound, but are not complete even for function-free logic programs. Although the OverSize (OS) check is complete for positive logic programs, it is too general in the sense th... |
cs0212026 | 1666765554 | Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, w... | VAF-check (for Variant Atoms loop check for logic programs with Functions) was proposed by Shen @cite_14 . It is based on the notion of . VAF-check says that an SLD-derivation may be infinite if it generates an atomic subgoal @math that is an expanded variant of some of its ancestor @math , @math is a variant of @math ... | {
"cite_N": [
"@cite_14"
],
"mid": [
"1981314990"
],
"abstract": [
"Two complete loop checking mechanisms have been presented in the literature for logic programs with functions: OS-check and EVA-check. OS-check is computationally efficient but quite unreliable in that it often misidentifies infin... |
cs0212045 | 1877185759 | Community identification algorithms have been used to enhance the quality of the services perceived by its users. Although algorithms for community have a widespread use in the Web, their application to portals or specific subsets of the Web has not been much studied. In this paper, we propose a technique for local com... | A considerable amount of research has been developed on community identification over the Web. Most of the approaches focus on analyzing text content, considering vector-space models for the objects usually related to Information Retrieval @cite_7 , hyperlink structure connecting the pages @cite_5 @cite_12 @cite_4 , ma... | {
"cite_N": [
"@cite_4",
"@cite_7",
"@cite_6",
"@cite_3",
"@cite_5",
"@cite_12"
],
"mid": [
"",
"197486081",
"2005124845",
"2079672501",
"2020423193",
""
],
"abstract": [
"",
"Disclosed is a novel and improved magnetic separator or filter, as well as an ... |
cs0212045 | 1877185759 | Community identification algorithms have been used to enhance the quality of the services perceived by its users. Although algorithms for community have a widespread use in the Web, their application to portals or specific subsets of the Web has not been much studied. In this paper, we propose a technique for local com... | Besides, we are considering community identification applied to a local context instead of the whole Web. Our approach aims to adapt the graph based community identification algorithm described in @cite_5 . Some modifications to @cite_5 that takes into account user information have already been proposed in @cite_10 . H... | {
"cite_N": [
"@cite_5",
"@cite_10"
],
"mid": [
"2020423193",
"1968509530"
],
"abstract": [
"The World Wide Web grows through a decentralized, almost anarchic process, and this has resulted in a large hyperlinked corpus without the kind of logical organization that can be built into more t... |
quant-ph0212071 | 1522728444 | We apply algorithmic information theory to quantum mechanics in order to shed light on an algorithmic structure which inheres in quantum mechanics. There are two equivalent ways to define the (classical) Kolmogorov complexity K(s) of a given classical finite binary string s. In the standard way, K(s) is defined as the ... | Our aim is to generalize algorithmic information theory in order to understand the algorithmic feature of quantum mechanics. There are related works whose purpose is mainly to define the information content of an individual pure quantum state, i.e., to define the of the quantum state @cite_4 @cite_3 @cite_2 , while we ... | {
"cite_N": [
"@cite_4",
"@cite_3",
"@cite_2"
],
"mid": [
"2106534004",
"2762038352",
"1999580286"
],
"abstract": [
"We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum... |
quant-ph0212071 | 1522728444 | We apply algorithmic information theory to quantum mechanics in order to shed light on an algorithmic structure which inheres in quantum mechanics. There are two equivalent ways to define the (classical) Kolmogorov complexity K(s) of a given classical finite binary string s. In the standard way, K(s) is defined as the ... | In quantum mechanics, what is represented by a matrix is either a quantum state or a measurement operator. In this paper we generalize the universal probability to a matrix-valued function in different way from @cite_2 , and identify it with an analogue of a POVM. We do not stick to defining the information content of ... | {
"cite_N": [
"@cite_2"
],
"mid": [
"1999580286"
],
"abstract": [
"We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix ( universal probability') as a starting point, and define complexity (an operator) as its negative logarithm. A number ... |
quant-ph0212071 | 1522728444 | We apply algorithmic information theory to quantum mechanics in order to shed light on an algorithmic structure which inheres in quantum mechanics. There are two equivalent ways to define the (classical) Kolmogorov complexity K(s) of a given classical finite binary string s. In the standard way, K(s) is defined as the ... | In each of @cite_4 and @cite_3 , the quantum Kolmogorov complexity of a qubit string was defined as a quantum generalization of the standard definition of classical Kolmogorov complexity; the length of the shortest input for the universal decoding algorithm @math to output a finite binary string. Both @cite_4 and @cite... | {
"cite_N": [
"@cite_4",
"@cite_3",
"@cite_2"
],
"mid": [
"2106534004",
"2762038352",
"1999580286"
],
"abstract": [
"We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum... |
0705.4604 | 1556312007 | In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded temporal formula to be verified is translated into a monadic first-order logic over difference inequalities, which we call monadic differenc... | We take a different approach. By encoding the runtime problem as a satisfiability problem for a monadic first-order logic, we arrive at a different type of algorithm. This algorithm is capable of utilizing a powerful decision structure for difference logic which inherits some of the strengths of binary decision diagram... | {
"cite_N": [
"@cite_20"
],
"mid": [
"2080267935"
],
"abstract": [
"In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations in... |
0705.3468 | 2950373299 | Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concer... | There are three different tabling schemes, namely OLDT and SLG @cite_27 @cite_10 , CAT @cite_20 @cite_35 , and iteration-based tabling including linear tabling @cite_23 @cite_18 @cite_33 @cite_7 @cite_17 and DRA @cite_15 . SLG @cite_16 is a formalization based on OLDT for computing well-founded semantics for general pr... | {
"cite_N": [
"@cite_35",
"@cite_18",
"@cite_33",
"@cite_7",
"@cite_27",
"@cite_23",
"@cite_2",
"@cite_15",
"@cite_16",
"@cite_10",
"@cite_20",
"@cite_17"
],
"mid": [
"1574950491",
"2950622282",
"2096979400",
"",
"1522225310",
"2169591289",
... |
0705.3468 | 2950373299 | Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concer... | In SLG-WAM, a consumer fails after it exhausts all the existing answers and its state is preserved by freezing the stack so that it can be reactivated after new answers are generated. The CAT approach does not freeze the stack but instead copies the stack segments between the consumer and its producer into a separate a... | {
"cite_N": [
"@cite_26"
],
"mid": [
"2118889869"
],
"abstract": [
"The Copying Approach to Tabling, abbrv. CAT, is an alternative to SLG-WAM and based on total copying of the areas that the SLG-WAM freezes to preserve execution states of suspended computations. The disadvantage of CAT as pointed ... |
0705.3468 | 2950373299 | Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concer... | The DRA method @cite_15 is also iteration based, but it identifies looping clauses dynamically and iterates the execution of looping clauses to compute fixpoints. While in linear tabling iteration is performed on only top-most looping subgoals, in DRA iteration is performed on every looping subgoal. In ET* @cite_2 , ev... | {
"cite_N": [
"@cite_15",
"@cite_18",
"@cite_33",
"@cite_2"
],
"mid": [
"2155945137",
"2950622282",
"2096979400",
"1528738961"
],
"abstract": [
"Tabled logic programming (LP) systems have been applied to elegantly and quickly solving very complex problems (e.g., model check... |
0705.3468 | 2950373299 | Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concer... | The two consumption strategies have been compared in XSB @cite_5 as two scheduling strategies. The lazy strategy is called local scheduling and the eager strategy is called single-stack scheduling . Another strategy, called batched scheduling , is similar to local scheduling but top-most looping subgoals do not have to... | {
"cite_N": [
"@cite_5",
"@cite_31"
],
"mid": [
"1518621415",
"2130683061"
],
"abstract": [
"Tabled evaluations ensure termination of logic programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the first one e... |
0705.3468 | 2950373299 | Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concer... | Semi-naive optimization is a fundamental idea for reducing redundancy in bottom-up evaluation of logic database queries @cite_21 @cite_32 . As far as we know, its impact on top-down evaluation had been unknown before @cite_17 . OLDT @cite_27 and SLG @cite_10 do not need this technique since it is not iterative and the ... | {
"cite_N": [
"@cite_21",
"@cite_32",
"@cite_27",
"@cite_15",
"@cite_10",
"@cite_17"
],
"mid": [
"2132063146",
"1588644244",
"1522225310",
"2155945137",
"1997210046",
"2151952683"
],
"abstract": [
"This paper surveys and compares various strategies for proce... |
0705.3468 | 2950373299 | Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concer... | Semi-naive optimization does not solve all the problems of recomputation in linear tabling. Recall the Warren's example: Assume there is a very costly non-tabled subgoal preceding p(X,Z) , then the subgoal has to be executed in each iteration even with semi-naive optimization. This example demonstrates the acuteness of... | {
"cite_N": [
"@cite_15"
],
"mid": [
"2155945137"
],
"abstract": [
"Tabled logic programming (LP) systems have been applied to elegantly and quickly solving very complex problems (e.g., model checking). However, techniquescurren tly employed for incorporating tabling in an existing LP system are q... |
0705.3243 | 2102136055 | Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculating statistics about the internet, it can introduce bias that corrupts these estimates. This paper reports on a theoretical and experimental ... | Internet mapping by traceroute sampling was pioneered by Pansiot and Grad in @cite_10 , and the scale-free nature of the degree distribution was observed by Faloutsos, Faloutsos, and Faloutsos in @cite_21 . Since 1998, the Cooperative Association for Internet Data Analysis (CAIDA) project has archived traceroute data t... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_11",
"@cite_21",
"@cite_1",
"@cite_2",
"@cite_16",
"@cite_10",
"@cite_17"
],
"mid": [
"1971795786",
"2107648668",
"1540064387",
"2912257242",
"2120511087",
"1519020025",
"2060730631",
"2090223505",
... |
0705.3243 | 2102136055 | Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculating statistics about the internet, it can introduce bias that corrupts these estimates. This paper reports on a theoretical and experimental ... | In addition to traceroute sampling, maps of the AS graph have been generated in two different ways, using BGP tables and using the WHOIS database. A recent paper by Mahadevan, Krioukov, Fomenkov, Dimitropoulos, claffy, and Vahdat provides a detailed comparison of the graphs that result from each of these measurement te... | {
"cite_N": [
"@cite_6"
],
"mid": [
"2139905147"
],
"abstract": [
"We calculate an extensive set of characteristics for Internet AS topologies extracted from the three data sources most frequently used by the research community: traceroutes, BGP, and WHOIS. We discover that traceroute and BGP topo... |
0706.3265 | 1929816335 | This paper studies the gap between quantum one-way communication complexity Q(f) and its classical counterpart C(f), under the unbounded-error setting, i.e., it is enough that the success probability is strictly greater than 1 2. It is proved that for any (total or partial) Boolean function f, Q(f) = ⌈C(f) 2⌉, i.e., th... | Partial Total Boolean Functions. For total functions, the one-way quantum communication complexity is nicely characterized or bounded below in several ways. Klauck @cite_22 characterized the one-way communication complexity of total Boolean functions by the number of different rows of the communication matrix in the ex... | {
"cite_N": [
"@cite_10",
"@cite_22",
"@cite_20",
"@cite_11"
],
"mid": [
"2171253836",
"2083425572",
"2611161794",
"2148488235"
],
"abstract": [
"Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n . Bu... |
0706.3265 | 1929816335 | This paper studies the gap between quantum one-way communication complexity Q(f) and its classical counterpart C(f), under the unbounded-error setting, i.e., it is enough that the success probability is strictly greater than 1 2. It is proved that for any (total or partial) Boolean function f, Q(f) = ⌈C(f) 2⌉, i.e., th... | Private-coin Public-coin Models. The exponential quantum classical separations in @cite_13 and @cite_11 still hold under the public-coin model where Alice and Bob share random coins, since the one-way classical public-coin model can be simulated by the one-way classical private-coin model with additional @math -bit com... | {
"cite_N": [
"@cite_19",
"@cite_13",
"@cite_11"
],
"mid": [
"2088263428",
"203155997",
"2148488235"
],
"abstract": [
"Abstract We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the mode... |
0706.3265 | 1929816335 | This paper studies the gap between quantum one-way communication complexity Q(f) and its classical counterpart C(f), under the unbounded-error setting, i.e., it is enough that the success probability is strictly greater than 1 2. It is proved that for any (total or partial) Boolean function f, Q(f) = ⌈C(f) 2⌉, i.e., th... | Unbounded-error Models. Since the seminal paper @cite_17 , the unbounded-error (classical) one-way communication complexity has been developed in the literature @cite_8 @cite_12 @cite_2 . (Note that in the classical setting, the difference of communication cost between one-way and two-way models is at most @math bit.) ... | {
"cite_N": [
"@cite_18",
"@cite_8",
"@cite_2",
"@cite_5",
"@cite_12",
"@cite_17"
],
"mid": [
"605043455",
"2143355494",
"2074760215",
"2949863531",
"1515707347",
"2008671796"
],
"abstract": [
"",
"We prove a general lower bound on the complexity of unbo... |
0706.4298 | 1624353584 | How to pass from local to global scales in anonymous networks? How to organize a selfstabilizing propagation of information with feedback. From the Angluin impossibility results, we cannot elect a leader in a general anonymous network. Thus, it is impossible to build a rooted spanning tree. Many problems can only be so... | @cite_3 designs a self-stabilizing Barrier Synchonization algorithm in asynchronous anonymous complet networks. For the other topologies the authors use the network with a root, the program is not uniform, but only semi-uniform. An interesting question is to give a solution to this problem in a general connected asynch... | {
"cite_N": [
"@cite_3",
"@cite_2"
],
"mid": [
"1722576058",
"149453019"
],
"abstract": [
"We show how fault-tolerance can be effectively added to several types of faults in program computations that use barrier synchronization. We divide the faults that occur in practice into two classes,... |
1406.6937 | 2133769104 | Abstract The most common method to validate a DEVS model against the requirements is to simulate it several times under different conditions, with some simulation tool. The behavior of the model is compared with what the system is supposed to do. The number of different scenarios to simulate is usually infinite, theref... | There are several works that use verification techniques, like model checking, to verify the correctness of a model. For instance, Napoli and Parente @cite_30 present a model-checking algorithm for Hierarchical Finite State Machines as an abstract DEVS model. They also focus on the generation of simulation configuratio... | {
"cite_N": [
"@cite_30",
"@cite_13",
"@cite_12"
],
"mid": [
"196245653",
"1498432697",
"2110806620"
],
"abstract": [
"Recently there has been a great attention from the scientific community towards the use of the model-checking technique as a tool for test generation in the simula... |
1406.6937 | 2133769104 | Abstract The most common method to validate a DEVS model against the requirements is to simulate it several times under different conditions, with some simulation tool. The behavior of the model is compared with what the system is supposed to do. The number of different scenarios to simulate is usually infinite, theref... | K. J. Hong and T. G. Kim @cite_31 introduce a method for the verification of discrete event models. They propose a formalism, Time State Reachability Graph (TSRG), to specify modules of a discrete event model and a methodology for the generation of test sequences to test such modules at an I O level. Later, a graph the... | {
"cite_N": [
"@cite_24",
"@cite_31"
],
"mid": [
"2400188976",
"2118645685"
],
"abstract": [
"Discrete event simulations can be used to analyse natural and artificial phenomena. To this end, one provides models whose behaviours are characterized by discrete events in a discrete timeline. B... |
1406.6937 | 2133769104 | Abstract The most common method to validate a DEVS model against the requirements is to simulate it several times under different conditions, with some simulation tool. The behavior of the model is compared with what the system is supposed to do. The number of different scenarios to simulate is usually infinite, theref... | @cite_23 present a framework to test DEVS tools. In their framework they combine black-box and white-box testing approaches. Actually, this work is not really related to ours because they do not validate or verify a DEVS model, whereas they test DEVS implementations. However, it is useful to see how they introduce soft... | {
"cite_N": [
"@cite_23"
],
"mid": [
"2395032752"
],
"abstract": [
"The Discrete-Event system Specification (DEVS) is a widely used formalism for discrete-event modelling and simulation. A variety of DEVS modelling and simulation tools have been implemented. Diverse implementations with platform-s... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | Statistical distributions similar to the ones considered in this paper have been previously applied to characterize the dynamics of the behavior ow crowds of Web users. In an early contribution, @cite_29 analyzed browsing behaviors and found that the number of links a user is likely to follow on a Web site is distribut... | {
"cite_N": [
"@cite_5",
"@cite_29",
"@cite_34",
"@cite_25"
],
"mid": [
"2157579446",
"2089192108",
"2058465497",
"2105535951"
],
"abstract": [
"We present a study of anonymized data capturing a month of high-level communication activities within the whole of the Microsoft ... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | While attention dynamics on shorter time scales have been modeled using random fields @cite_15 , structured models @cite_12 , or differential equations @cite_22 , long term temporal dynamics of collective attention have previously been modeled using mixtures of power-law and Poisson distributions @cite_4 or systems of ... | {
"cite_N": [
"@cite_30",
"@cite_26",
"@cite_4",
"@cite_22",
"@cite_9",
"@cite_15",
"@cite_25",
"@cite_12"
],
"mid": [
"1977332720",
"2963503659",
"2042034885",
"2127492100",
"",
"2056797132",
"2105535951",
""
],
"abstract": [
"Many cultural ... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | With respect to time series retrieved from Google Trends, epidemic models based on differential equations involving exogenous end endogenous influences have been discussed in @cite_4 . There, they were used as means of classifying, i.e. distinguishing, different types of attention dynamics. Trend analysis based on data... | {
"cite_N": [
"@cite_18",
"@cite_4"
],
"mid": [
"1971994493",
"2042034885"
],
"abstract": [
"The Social Web makes visible the ebb and flow of popular interest in topics both newsworthy (\"GulfSpill\") and trivial (\"Lolcat\"). Understanding this emergent behavior is a fundamental goal for ... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | In a delightful synchronicity, Cannarella and Spechler @cite_17 , Ribeiro @cite_19 , and we ourselves @cite_8 all published analyzes on how attention to social media evolves over time in early 2014. While @cite_17 was uploaded to arXiv, @cite_19 and @cite_17 were both presented at the International World Wide Web Confe... | {
"cite_N": [
"@cite_19",
"@cite_8",
"@cite_17"
],
"mid": [
"2950068977",
"",
"1674853078"
],
"abstract": [
"Driven by outstanding success stories of Internet startups such as Facebook and The Huffington Post, recent studies have thoroughly described their growth. These highly visi... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | The work by Cannarella and Spechler from Princeton is noteworthy for triggering a brief but fierce media frenzy. Just as in the work presented here, the results in @cite_17 were obtained from analyzing Google Trends time series. Differing from our approach, Cannarella and Spechler considered epidemic models to analyze ... | {
"cite_N": [
"@cite_37",
"@cite_17"
],
"mid": [
"89990147",
"1674853078"
],
"abstract": [
"Internet memes are phenomena that rapidly gain popularity or notoriety on the Internet. Often, modifications or spoofs add to the profile of the original idea thus turning it into a phenomenon that ... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | However, data that directly reflects engagement played an important role in Ribeiro's analysis performed at CMU @cite_19 . He considered statistics available from , a subsidiary of which provides Web traffic data that are gathered using the toolbar, a plugin that volunteers install in their browsers so that can track w... | {
"cite_N": [
"@cite_19"
],
"mid": [
"2950068977"
],
"abstract": [
"Driven by outstanding success stories of Internet startups such as Facebook and The Huffington Post, recent studies have thoroughly described their growth. These highly visible online success stories, however, overshadow an untold... |
1406.6529 | 2282629128 | We analyze general trends and pattern in time series that characterize the dynamics of collective attention to social media services and Web-based businesses. Our study is based on search frequency data available from Google Trends and considers 175 different services. For each service, we collect data from 45 differen... | Given this discussion, the approach and results presented here mark a middle ground. On the one hand, we consider simple diffusion models rather than (intricate) models for the epidemic spread of novelties. On the other hand, the statistical basis for our analysis far exceeds those in @cite_17 @cite_19 . Neither Cannar... | {
"cite_N": [
"@cite_19",
"@cite_17"
],
"mid": [
"2950068977",
"1674853078"
],
"abstract": [
"Driven by outstanding success stories of Internet startups such as Facebook and The Huffington Post, recent studies have thoroughly described their growth. These highly visible online success stor... |
1406.6973 | 1562703808 | Statements about entities occur everywhere, from newspapers and web pages to structured databases. Correlating references to entities across systems that use different identifiers or names for them is a widespread problem. In this paper, we show how shared knowledge between systems can be used to solve this problem. We... | The research by ( @cite_1 , @cite_6 and @cite_0 ) are archetypal of the approaches that have been followed for solving this class of problems. Because of the simplicity of the model, much of the attention has focussed on the development of algorithms capable of correctly performing the matching between attributes. Furt... | {
"cite_N": [
"@cite_0",
"@cite_1",
"@cite_6"
],
"mid": [
"2159481891",
"2108991785",
"2085099553"
],
"abstract": [
"Identity uncertainty is a pervasive problem in real-world data analysis. It arises whenever objects are not labeled with unique identifiers or when those identifiers... |
1708.04801 | 2746114819 | Stochastic gradient descent (SGD) is a popular stochastic optimization method in machine learning. Traditional parallel SGD algorithms, e.g., SimuParallel SGD, often require all nodes to have the same performance or to consume equal quantities of data. However, these requirements are difficult to satisfy when the paral... | Delay SGD algorithms first appeared in 's work @cite_6 . In a delay SGD algorithm, current model parameters add the gradient of older model parameters in @math iterations ( @math is a random number where @math , in which @math is a constant). The iteration step for delay SGD algorithms is In the Hogwild! algorithm @cit... | {
"cite_N": [
"@cite_0",
"@cite_15",
"@cite_6"
],
"mid": [
"2951781666",
"2188647300",
""
],
"abstract": [
"Stochastic Gradient Descent (SGD) is a popular algorithm that can achieve state-of-the-art performance on a variety of machine learning tasks. Several researchers have recent... |
1708.04801 | 2746114819 | Stochastic gradient descent (SGD) is a popular stochastic optimization method in machine learning. Traditional parallel SGD algorithms, e.g., SimuParallel SGD, often require all nodes to have the same performance or to consume equal quantities of data. However, these requirements are difficult to satisfy when the paral... | Along with parallel SGD algorithms, many other kinds of numerical optimization algorithms have been proposed, such as PASSCoDe @cite_19 and CoCoA @cite_7 . They share many new features, such as fast convergence speed in the end of training phase. Most of them are formulated from the dual coordinate descent (ascent) per... | {
"cite_N": [
"@cite_19",
"@cite_7"
],
"mid": [
"2950002113",
"2963861706"
],
"abstract": [
"Stochastic Dual Coordinate Descent (SDCD) has become one of the most efficient ways to solve the family of @math -regularized empirical risk minimization problems, including linear SVM, logistic re... |
1708.04866 | 2766615649 | Cybercrime markets support the development and diffusion of new attack technologies, vulnerability exploits, and malware. Whereas the revenue streams of cyber attackers have been studied multiple times in the literature, no quantitative account currently exists on the economics of attack acquisition and deployment. Yet... | The economics and development of underground markets have perhaps been first tackled by @cite_75 . On the other hand, @cite_65 showed that cybercrime economics are distinctively problematic in that the lack of effective rule enforcement mechanisms may hinder fair trading, and as a consequence the existence of the marke... | {
"cite_N": [
"@cite_35",
"@cite_22",
"@cite_36",
"@cite_42",
"@cite_65",
"@cite_32",
"@cite_0",
"@cite_43",
"@cite_51",
"@cite_16",
"@cite_75"
],
"mid": [
"2153532176",
"2515415680",
"2513861733",
"2122551442",
"",
"2744879410",
"2110271878"... |
1708.04866 | 2766615649 | Cybercrime markets support the development and diffusion of new attack technologies, vulnerability exploits, and malware. Whereas the revenue streams of cyber attackers have been studied multiple times in the literature, no quantitative account currently exists on the economics of attack acquisition and deployment. Yet... | Recent work studied the services and monetization schemes of cyber criminals, e.g. to launder money through acquisition of expensive goods @cite_50 , or renting infected systems @cite_16 @cite_74 . The provision of the technological means by which these attacks are perpetrated remain however relatively unexplored @cite... | {
"cite_N": [
"@cite_38",
"@cite_36",
"@cite_6",
"@cite_57",
"@cite_72",
"@cite_74",
"@cite_50",
"@cite_5",
"@cite_46",
"@cite_16"
],
"mid": [
"",
"2513861733",
"2091692346",
"",
"1412796528",
"2345976710",
"2014005029",
"1815362064",
"21... |
1708.04866 | 2766615649 | Cybercrime markets support the development and diffusion of new attack technologies, vulnerability exploits, and malware. Whereas the revenue streams of cyber attackers have been studied multiple times in the literature, no quantitative account currently exists on the economics of attack acquisition and deployment. Yet... | The presence of a cybcercrime economy that absorbs vulnerabilities and generates attacks motivated the security community to study the devision of legitimate' vulnerability markets that attract security researchers away from the illegal marketplaces @cite_44 . Whereas several market mechanisms have been proposed @cite_... | {
"cite_N": [
"@cite_41",
"@cite_36",
"@cite_3",
"@cite_44",
"@cite_63",
"@cite_2",
"@cite_31"
],
"mid": [
"2117405938",
"2513861733",
"1427242644",
"2021348304",
"",
"",
"2107449619"
],
"abstract": [
"Software vulnerability disclosure has become a c... |
1708.04903 | 2745522234 | Non-linear, especially convex, objective functions have been extensively studied in recent years in which approaches relies crucially on the convexity property of cost functions. In this paper, we present primal-dual approaches based on configuration linear programs to design competitive online algorithms for problems ... | In this paper, we systematically strengthen natural LPs by the construction of the configuration LPs presented in @cite_15 . propose a scheme that consists of solving the new LPs (with exponential number of variables) and rounding the fractional solutions to integer ones using decoupling inequalities. By this method, t... | {
"cite_N": [
"@cite_15",
"@cite_12"
],
"mid": [
"2009636784",
"2294025081"
],
"abstract": [
"We present a new framework for solving optimization problems with a diseconomy of scale. In such problems, our goal is to minimize the cost of resources used to perform a certain task. The cost of... |
1708.04675 | 2746492579 | Convolution Neural Networks on Graphs are important generalization and extension of classical CNNs. While previous works generally assumed that the graph structures of samples are regular with unified dimensions, in many applications, they are highly diverse or even not well defined. Under some circumstances, e.g. chem... | Besides above papers on constructing convolution layer on graphs, many others studied the problem from a different angle. @cite_31 first investigated learning a network from a set of heterogeneous graphs to predict node-level feature as well as to do graph completion, although it is based on node sequence selection. @c... | {
"cite_N": [
"@cite_31",
"@cite_25"
],
"mid": [
"2406128552",
"2963984147"
],
"abstract": [
"Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, direc... |
1708.04675 | 2746492579 | Convolution Neural Networks on Graphs are important generalization and extension of classical CNNs. While previous works generally assumed that the graph structures of samples are regular with unified dimensions, in many applications, they are highly diverse or even not well defined. Under some circumstances, e.g. chem... | Recently, @cite_19 investigated a similar problem as ours by learning edge-conditioned feature weight matrix from edge features using a separate filter-generating network @cite_22 , while @cite_19 's application is on point cloud classification. There are other studies about learning on graph data such as @cite_5 that ... | {
"cite_N": [
"@cite_19",
"@cite_5",
"@cite_22",
"@cite_17"
],
"mid": [
"2949455170",
"2950191616",
"",
"2366141641"
],
"abstract": [
"A number of problems can be formulated as prediction on graph-structured data. In this work, we generalize the convolution operator from re... |
1708.04675 | 2746492579 | Convolution Neural Networks on Graphs are important generalization and extension of classical CNNs. While previous works generally assumed that the graph structures of samples are regular with unified dimensions, in many applications, they are highly diverse or even not well defined. Under some circumstances, e.g. chem... | For chemical compounds, naturally modeled as graphs, @cite_6 @cite_10 @cite_7 made several successful trials of applying neural networks to learn representations for predictive tasks, which were usually tackled by handcrafted features @cite_28 or hashing @cite_26 . Whereas, due to the constraints of spatial convolution... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_7",
"@cite_28",
"@cite_1",
"@cite_6",
"@cite_16",
"@cite_10"
],
"mid": [
"2604306554",
"",
"2949858440",
"2189911347",
"2950774882",
"",
"",
"2214665483"
],
"abstract": [
"Empirical scoring functio... |
1708.04862 | 2745485852 | We study the problem of coalitional manipulation---where @math manipulators try to manipulate an election on @math candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted settings. We focus on minimizing the maximum score obtainable by a non-preferred c... | The computational complexity of coalitional manipulation problems was studied extensively. For general scoring rules @math , most earlier work considered the case where the number of candidates is bounded: Conitzer at al. @cite_1 show that when @math is bounded, @math -UCM is solvable in polynomial time. | {
"cite_N": [
"@cite_1"
],
"mid": [
"1972375916"
],
"abstract": [
"In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols ... |
1708.04862 | 2745485852 | We study the problem of coalitional manipulation---where @math manipulators try to manipulate an election on @math candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted settings. We focus on minimizing the maximum score obtainable by a non-preferred c... | In the weighted case, the situation is different: for all positional scoring rules @math , except plurality-like rules, @math -WCM is @math -hard when @math @cite_1 @cite_19 @cite_3 . In particular, this holds for Borda-WCM. However, the computational hardness of Borda-UCM still remained open for quite some time, until... | {
"cite_N": [
"@cite_1",
"@cite_3",
"@cite_0",
"@cite_19",
"@cite_23"
],
"mid": [
"1972375916",
"1493942848",
"",
"1977012944",
"104706817"
],
"abstract": [
"In multiagent settings where the agents have different preferences, preference aggregation is a central issu... |
1708.04862 | 2745485852 | We study the problem of coalitional manipulation---where @math manipulators try to manipulate an election on @math candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted settings. We focus on minimizing the maximum score obtainable by a non-preferred c... | @cite_10 present two additional heuristics: iteratively, assign the largest un-allocated score to the candidate with the largest gap (), or to the candidate with the largest ratio of gap divided by the number of scores yet-to-be-allocated to this candidate (). To the best of our knowledge, these algorithms do not have ... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2052020474"
],
"abstract": [
"We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson's and Baldwin's voting rules, which are based on Borda voting. We argue that these rules have a number of desirable comput... |
1708.04862 | 2745485852 | We study the problem of coalitional manipulation---where @math manipulators try to manipulate an election on @math candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted settings. We focus on minimizing the maximum score obtainable by a non-preferred c... | As discussed, configuration linear programs were also used in scheduling literature, for example for the following two problems which were extensively studied before: In the so-called @cite_11 , Santa Claus has @math presents that he wishes to distribute between @math kids, and @math is the value that kid @math has to ... | {
"cite_N": [
"@cite_15",
"@cite_11"
],
"mid": [
"2135932424",
"1978593916"
],
"abstract": [
"One of the classic results in scheduling theory is the @math -approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines; ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.