corpusid
int64 16
20.3M
| abstract
stringlengths 1
10k
| updated
stringdate 2020-04-14 15:01:41
2022-09-05 04:04:16
| externalids
dict | url
stringlengths 78
78
| title
stringlengths 3
300
| authors
listlengths 0
398
| venue
stringlengths 0
300
| year
int64 1.84k
2.02k
⌀ | referencecount
int64 0
4.73k
| citationcount
int64 0
95k
| influentialcitationcount
int64 0
16.2k
| isopenaccess
bool 2
classes | s2fieldsofstudy
listlengths 2
13
⌀ | publicationtypes
listlengths 1
5
⌀ | publicationdate
timestamp[s]date 1842-06-01 00:00:00
2022-08-30 00:00:00
⌀ | journal
dict | syntactic
listlengths 0
71
| semantic
listlengths 0
96
| union
listlengths 0
106
| enhanced
listlengths 0
167
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1,072
|
In this paper, closed-form approximated expressions are pr oposed for the convergence time (or number of iterations required for convergence) and for the Intersymb ol Interference (ISI) as a function of time valid during the stages of the iterative deconvolution process. T he new derivations are valid for the noiseless, real and two independent quadrature carrier case and for type of b lind equalizers where the error that is fed into the adaptive mechanism which updates the equalizer’s taps c an be expressed as a polynomial function of order three of the equalized output like in Godard’s algorithm. Up to now, the equalizer’s performance (convergence time and ISI as a function of time) could be obtained only via s imulation when the channel coefficients were known. The new proposed expressions are based on the knowled ge of the initial ISI and channel power (which is measurable) and eliminate the need to carry out any more th e above mentioned simulation.
|
2022-08-20T19:04:53.989Z
|
{
"ACL": null,
"DBLP": "conf/icinco/Pinchas11",
"ArXiv": null,
"MAG": "2406411789",
"CorpusId": "1072",
"PubMed": null,
"DOI": "10.5220/0003529204110414",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/eaa525134c0c4bb9e7f980c0fb463e4a6289efd6
|
An Approximated Expression for the Convergence Time of Adaptive Blind Equalizers
|
[
{
"authorId": "1995885",
"name": "M. Pinchas"
}
] |
ICINCO
| 2,011
| 5
| 1
| 0
| true
|
[
{
"category": "Engineering",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | null |
{
"name": null,
"volume": null,
"pages": "411-414"
}
|
[
"channel coefficient",
"blind equalizer",
"isi",
"intersymbol interference"
] |
[
"blind equalizer",
"decision feedback equalizers",
"closed-form expression",
"isi",
"channel coefficient"
] |
[
"decision feedback equalizers",
"closed-form expression",
"intersymbol interference",
"channel coefficient",
"blind equalizer",
"isi"
] |
[
"bit error rate",
"signal receivers",
"data communication systems",
"rayleigh fading",
"time division multiple access",
"blind equalization",
"quadrature amplitude modulation",
"multipath channels",
"cochannel interference",
"multiple access interference",
"frequency selective fading",
"multiuser detection",
"additive white gaussian noise",
"transceivers",
"channel capacity",
"fir filters",
"interference alignment",
"frequency estimation",
"channel estimation",
"orthogonal frequency division multiplexing",
"fading channels",
"constant modulus algorithms",
"ofdm",
"communication channels",
"signal to noise ratio",
"probability",
"signal detection",
"computer systems",
"medium access control",
"wireless telecommunication systems",
"fading (radio)",
"multipath propagation",
"spread spectrum communication",
"radio interference",
"code division multiple access",
"signal interference",
"white noise",
"gaussian noise (electronic)",
"information theory",
"signal processing",
"interference channels",
"degrees of freedom (mechanics)",
"frequency allocation",
"adaptive algorithms",
"mathematics",
"computer science",
"network protocols",
"computer networks",
"communication systems",
"telecommunication systems",
"spurious signal noise",
"communication",
"engineering",
"multiplexing",
"transmitters",
"mimo systems",
"robotic manipulators",
"telecommunication traffic",
"software",
"internet",
"antennas",
"robots",
"telecommunication networks",
"robotics"
] |
1,074
|
Conversational implicatures are usually described as being licensed by the disobeying or flouting of some principle by the speaker in cooperative dialogue. However, such work has failed to distinguish cases of the speaker flouting such a principle from cases where the speaker is either deceptive or holds a mistaken belief. In this paper, we demonstrate how the three different cases can be distinguished in terms of the beliefs ascribed to the speaker of the utterance. We argue that in the act of distinguishing the speaker's intention and ascribing such beliefs, the intended inference can be made by the hearer. This theory is implemented in ViewGen, a pre-existing belief modelling system used in a medical counselling domain.
|
2022-09-04T04:13:46.746Z
|
{
"ACL": null,
"DBLP": "journals/corr/cmp-lg-9806005",
"ArXiv": "cmp-lg/9806005",
"MAG": "1628630936",
"CorpusId": "1074",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/3bffede944c68595ca4bf67982e35abd97209bc1
|
Eliminating deceptions and mistaken belief to infer conversational implicature
|
[
{
"authorId": "144975865",
"name": "Mark G. Lee"
},
{
"authorId": "2971978",
"name": "Y. Wilks"
}
] |
ArXiv
| 1,998
| 17
| 18
| 0
| false
|
[
{
"category": "Philosophy",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1998-06-05T00:00:00
|
{
"name": "ArXiv",
"volume": "cmp-lg/9806005",
"pages": null
}
|
[
"inference",
"dialogue"
] |
[
"dialogue",
"inference",
"spoken dialogue",
"target speaker",
"probabilistic inference"
] |
[
"target speaker",
"spoken dialogue",
"probabilistic inference",
"dialogue",
"inference"
] |
[
"voice conversion",
"dialogue systems",
"speech communication",
"inference engines",
"bayesian methods",
"probability distributions",
"argumentation",
"linguistics",
"natural language processing",
"artificial intelligence",
"probability",
"logic programming",
"autonomous agents",
"natural languages",
"computer science",
"mathematics",
"computer programming languages",
"formal logic",
"multiagent system",
"semantics",
"computer programming"
] |
1,075
|
This paper presents a method for large corpus analysis to semantically classify an entire clause. In particular, we use cooccurrence statistics among similar clauses to determine the aspectual class of an input clause. The process examines linguistic features of clauses that are relevant to aspectual classification. A genetic algorithm determines what combinations of linguistic features to use for this task.
|
2022-08-28T22:27:21.184Z
|
{
"ACL": null,
"DBLP": "journals/corr/cmp-lg-9610002",
"ArXiv": "cmp-lg/9610002",
"MAG": "1555291760",
"CorpusId": "1075",
"PubMed": null,
"DOI": "10.7916/D87D33G0",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/b6d7a2edb36081d9015c19962f6441abbed18a41
|
Gathering Statistics to Aspectually Classify Sentences with a Genetic Algorithm
|
[
{
"authorId": "2087287",
"name": "Eric V. Siegel"
},
{
"authorId": "145590324",
"name": "K. McKeown"
}
] |
ArXiv
| 1,996
| 21
| 12
| 0
| false
|
[
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1996-10-21T00:00:00
|
{
"name": "ArXiv",
"volume": "cmp-lg/9610002",
"pages": null
}
|
[
"genetic algorithms",
"linguistics",
"correlation analysis"
] |
[
"correlation analysis",
"genetic algorithms",
"linguistics",
"classification models",
"particle swarm optimization (pso)"
] |
[
"correlation analysis",
"genetic algorithms",
"linguistics",
"classification models",
"particle swarm optimization (pso)"
] |
[
"mathematics",
"artificial intelligence",
"classification methods",
"optimization problems",
"optimization",
"swarm intelligence",
"computer science",
"computer systems"
] |
1,076
|
In this paper, we present a method of estimating referents of demonstrative pronouns, personal pronouns, and zero pronouns in Japanese sentences using examples, surface expressions, topics and foci. Unlike conventional work which was semantic markers for semantic constraints, we used examples for semantic constraints and showed in our experiments that examples are as useful as semantic markers. We also propose many new methods for estimating referents of pronouns. For example, we use the form "X of Y" for estimating referents of demonstrative adjectives. In addition to our new methods, we used many conventional methods. As a result, experiments using these methods obtained a precision rate of 87% in estimating referents of demonstrative pronouns, personal pronouns, and zero pronouns for training sentences, and obtained a precision rate of 78% for test sentences.
|
2022-09-02T06:21:24.412Z
|
{
"ACL": "W99-0206",
"DBLP": "conf/acl/MurataIN99a",
"ArXiv": "cs/9912004",
"MAG": "2950473928",
"CorpusId": "1076",
"PubMed": null,
"DOI": "10.3115/1608810.1608819",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/7cbc4cc92d9c293545c0bd722a1fe1022acb1446
|
Pronoun Resolution in Japanese Sentences Using Surface Expressions and Examples
|
[
{
"authorId": "1697381",
"name": "M. Murata"
},
{
"authorId": "1714134",
"name": "H. Isahara"
},
{
"authorId": "2162080",
"name": "M. Nagao"
}
] |
COREF@ACL
| 1,999
| 32
| 13
| 1
| true
|
[
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1999-06-22T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CL/9912004",
"pages": null
}
|
[
"japanese",
"semantics"
] |
[
"syntactic structure",
"illustrative examples",
"semantics",
"semantic information",
"syntactics"
] |
[
"semantic information",
"syntactic structure",
"japanese",
"illustrative examples",
"syntactics",
"semantics"
] |
[
"natural language processing",
"asian continental ancestry group",
"linear matrix inequalities",
"computational linguistics",
"artificial intelligence",
"natural languages",
"genotype",
"genetic association",
"matrix algebra",
"database systems",
"computer science",
"linguistics",
"single nucleotide polymorphism",
"genetic analysis",
"mathematics",
"computer systems",
"bioinformatics"
] |
1,077
|
An approach to analyze the performance of the code division multiple access (CDMA) scheme, which is a core technology used in modern wireless communication systems, is provided. The approach characterizes the objective system by the eigenvalue spectrum of a cross-correlation matrix composed of signature sequences used in CDMA communication, which enable us to handle a wider class of CDMA systems beyond the basic model reported by Tanaka in Europhys. Lett., 54 (2001) 540. The utility of the scheme is shown by analyzing a system in which the generation of signature sequences is designed for enhancing the orthogonality.
|
2022-09-03T22:37:19.466Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0607043",
"ArXiv": "cs/0607043",
"MAG": "2081785908",
"CorpusId": "1077",
"PubMed": null,
"DOI": "10.1209/epl/i2006-10380-5",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/9588a6e943c5da734ca70d778d4e3f7899666a50
|
Analysis of CDMA systems that are characterized by eigenvalue spectrum
|
[
{
"authorId": "2010376",
"name": "K. Takeda"
},
{
"authorId": "2068638345",
"name": "S. Uda"
},
{
"authorId": "2329517",
"name": "Y. Kabashima"
}
] |
ArXiv
| 2,006
| 28
| 69
| 5
| true
|
[
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-07-11T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0607043",
"pages": null
}
|
[
"multiple access",
"wireless communication system",
"cdma system",
"orthogonality",
"communication",
"eigenvalues"
] |
[
"code division multiple access",
"cdma system",
"eigenvalues",
"multiple access",
"wireless communications",
"communication",
"wireless",
"wireless communication system",
"communication systems",
"orthogonality",
"eigenvectors",
"frequency bands"
] |
[
"wireless communications",
"eigenvectors",
"multiple access",
"wireless communication system",
"cdma system",
"orthogonality",
"wireless",
"frequency bands",
"communication",
"code division multiple access",
"communication systems",
"eigenvalues"
] |
[
"computer networks",
"wireless networks",
"frequency division multiple access",
"multiple access interference",
"multiplexing",
"fading channels",
"global system for mobile communications",
"cellular telephone systems",
"frequency allocation",
"radio",
"antennas",
"communication channels",
"computer systems",
"eigenvalues and eigenfunctions",
"computer science",
"packet networks",
"spread spectrum communication",
"radio interference",
"signal to noise ratio",
"mobile computing",
"mobile telecommunication systems",
"telecommunication traffic",
"data communication systems",
"wireless telecommunication systems",
"matrix algebra",
"fading (radio)",
"signal receivers",
"signal interference",
"signal processing",
"telecommunication networks",
"telecommunication systems",
"mathematics",
"bit error rate",
"signal detection",
"spurious signal noise",
"engineering",
"probability"
] |
1,080
|
Previous work in the context of natural language querying of temporal databases has established a method to map automatically from a large subset of English time-related questions to suitable expressions of a temporal logic-like language, called TOP. An algorithm to translate from TOP to the TSQL2 temporal database language has also been defined. This paper shows how TOP expressions could be translated into a simpler logic-like language, called BOT. BOT is very close to traditional first-order predicate logic (FOPL), and hence existing methods to manipulate FOPL expressions can be exploited to interface to time-sensitive applications other than TSQL2 databases, maintaining the existing English-to-TOP mapping.
|
2022-09-01T18:33:14.331Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CL-9906020",
"ArXiv": "cs/9906020",
"MAG": "1579387006",
"CorpusId": "1080",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/8fd71a53c4a8c0a60072c3d38eeeffc6c4a286db
|
Temporal Meaning Representations in a Natural Language Front-End
|
[
{
"authorId": "1752430",
"name": "Ion Androutsopoulos"
}
] |
ArXiv
| 1,999
| 37
| 8
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1999-06-22T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CL/9906020",
"pages": null
}
|
[
"database systems",
"natural languages",
"temporal database"
] |
[
"natural languages",
"temporal database",
"database systems",
"temporal logic",
"spatio-temporal database"
] |
[
"natural languages",
"temporal logic",
"temporal database",
"database systems",
"spatio-temporal database"
] |
[
"linguistics",
"semantics",
"formal logic",
"relational database",
"computer systems",
"moving objects",
"artificial intelligence",
"knowledge based systems",
"query languages",
"computer science",
"computer vision",
"computer imaging and vision"
] |
1,082
|
A method is presented for automatically augmenting the bilingual lexicon of an existing Machine Translation system, by extracting bilingual entries from aligned bilingual text. The proposed method only relies on the resources already available in the MT system itself. It is based on the use of bilingual lexical templates to match the terminal symbols in the parses of the aligned sentences.
|
2022-09-02T10:42:33.223Z
|
{
"ACL": "P98-2212",
"DBLP": "conf/acl/Turcato98",
"ArXiv": "cmp-lg/9807010",
"MAG": "2951116661",
"CorpusId": "1082",
"PubMed": null,
"DOI": "10.3115/980691.980781",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/1447cd0069a511c1daaae38eef01eba103ede535
|
Automatically Creating Bilingual Lexicons for Machine Translation from Bilingual Text
|
[
{
"authorId": "2854524",
"name": "D. Turcato"
}
] |
ACL
| 1,998
| 12
| 24
| 0
| true
|
[
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 1998-07-20T00:00:00
|
{
"name": null,
"volume": null,
"pages": "1299-1306"
}
|
[
"bilingual",
"machine translations"
] |
[
"bilingual",
"bilingual dictionary",
"machine translations",
"parallel corpora",
"bilingual corpora"
] |
[
"bilingual",
"machine translations",
"parallel corpora",
"bilingual dictionary",
"bilingual corpora"
] |
[
"multilingualism",
"natural language processing",
"translation (languages)",
"information theory",
"statistical machine translation",
"linguistics",
"artificial intelligence",
"natural languages",
"computational linguistics",
"automata theory",
"communication",
"speech transmission",
"statistical methods",
"computer science",
"semantics",
"database systems",
"formal languages and automata theory",
"speech communication",
"correlation analysis",
"computer systems",
"theoretical computer science",
"mathematics"
] |
1,083
|
Building on ideas from linguistics, psychology, and social sciences about the possible mechanisms of human decision-making, we propose a novel theoretical framework for the citation analysis. Given the existing trend to investigate citation statistics in the context of various forms of power and Zipfian laws, we show that the popular models of citation have poor predictive ability and can hardly provide for an adequate explanation of the observed behavior of the empirical data. An alternative model is then derived, using the apparatus of statistical mechanics. The model is applied to approximate the citation frequencies of scientific articles from two large collections, and it demonstrates a predictive potential much superior to the one of any of the citation models known to the authors from the literature. Some analytical properties of the developed model are discussed, and conclusions are drawn. Directions for future work are also given at the paper's end.
|
2022-09-04T08:01:00.672Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0703115",
"ArXiv": "cs/0703115",
"MAG": "1756193506",
"CorpusId": "1083",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/3856250444b4cd8bdf5a4e8465c76169af39698d
|
We cite as we communicate: A communication model for the citation process
|
[
{
"authorId": "2229767",
"name": "V. Kryssanov"
},
{
"authorId": "2536999",
"name": "E. Kuleshov"
},
{
"authorId": "35181773",
"name": "F. Rinaldo"
},
{
"authorId": "48145364",
"name": "Hitoshi Ogawa"
}
] |
ArXiv
| 2,007
| 67
| 5
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-03-22T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0703115",
"pages": null
}
|
[
"correlation analysis",
"communication models",
"linguistics",
"social sciences",
"frequencies"
] |
[
"communication",
"communication models",
"linguistics",
"social sciences",
"correlation analysis",
"frequencies"
] |
[
"correlation analysis",
"communication models",
"linguistics",
"social sciences",
"frequencies",
"communication"
] |
[
"mathematics",
"information theory",
"sociology",
"bandwidth",
"computer networks",
"computer science"
] |
1,084
|
The last decades’ tremendous advances in wireless communications havebeen driven mainly by personal communications. Radio resource allocationmechanisms for optimizing key metrics, such as average throughput and delay,are by now rather well-developed. However, with the increased interest inwireless machine-to-machine communication, new challenges emerge, such asmulti-hop connectivity, lossy and bursty links, battery-powered nodes, andchanging/unknown link parameters, among others. With these challenges inmind, this thesis studies real-time communication in wireless lossy networks,and how the resulting networking primitive can be used to design networkedcontrol systems with optimal closed-loop performance.First, we study optimal forwarding of deadline-constrained traffic overmulti-hop networks with losses on links described by finite-state Markovchains. We consider two problems: maximizing the probability that packetsare delivered within specified deadlines; and minimizing the expected energycost with a guaranteed probability of on-time delivery. Both problems fallinto the category of Markov Decision Processes and can be studied in a generaldynamic programming framework. Particular instances with Bernoulliand Gilbert-Elliot loss models, which admit insight and efficient computations,are discussed. Moreover, a number of extensions and variations ofthe deadline-constrained forwarding problem are investigated. These extensionsinclude systems with unknown channel states and unknown link lossmodels, scenarios with multiple concurrent flows, and solutions adapted toopportunistic routing and the recent WirelessHART standard.Second, we show how the solution for the deadline-constrained forwardingproblem can be used in the optimal co-design of networked control systems.Specifically, we consider the joint design of packet forwarding policies andcontrollers for wireless control loops where sensor data are sent to the controllerover an unreliable and energy-constrained multi-hop wireless network.For fixed sampling rate of the sensor, the co-design problem separates into twowell-defined and independent subproblems: transmission scheduling for maximizingthe deadline-constrained reliability and optimal control under packetloss. We develop optimal and implementable solutions for these subproblemsand show that the optimally co-designed system can be efficiently found.Finally, we study online shortest-path routing problems in which link delaysare time-varying and modeled by random processes with initially unknownparameters. The optimal path can only be estimated by routing packetsthrough the network and observing the realized delays. The aim is to finda routing policy that minimizes the regret (the cumulative delay difference)between the path chosen by the policy and the unknown optimal path. Weformulate the problem as a combinatorial bandit optimization problem andconsider several scenarios. For each scenario, we derive the tight asymptoticlower bound on the regret that has to be satisfied by any online routing policy.These bounds help us to understand the performance improvements wecan expect when (i) taking routing decisions at each hop rather than at thesource only, and (ii) observing per-link costs rather than aggregate path costs.Efficient algorithms are proposed and evaluated against the state-of-the-art.
|
2022-08-31T23:07:05.692Z
|
{
"ACL": null,
"DBLP": "phd/basesearch/Zou14",
"ArXiv": null,
"MAG": "564538625",
"CorpusId": "1084",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/9d51bdda2d7f0a79c1f06368581cde173c955db7
|
Real-time communication in wireless lossy networks
|
[
{
"authorId": "3437768",
"name": "Zhenhua Zou"
}
] | 2,014
| 140
| 1
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | null | null |
{
"name": "",
"volume": "",
"pages": null
}
|
[
"shortest path routing",
"optimal control",
"probability",
"routing problems",
"efficient algorithm",
"communication",
"packet loss",
"optimization problems",
"unknown parameters",
"radio resources",
"control loop",
"programming framework",
"wireless",
"sensors",
"markov chains",
"multihop wireless network",
"random processes",
"energy constraint",
"wireless communications",
"networked control systems",
"channel state",
"efficient computation",
"markov decision processes",
"routing algorithms",
"sensor data"
] |
[
"communication",
"wireless communications",
"wireless",
"wireless networks",
"packet loss",
"radio",
"probability",
"markov decision processes",
"programming framework",
"efficient computation",
"channel state",
"routing algorithms",
"networked controls",
"networked control systems",
"control systems",
"sensors",
"sensor data",
"multihop",
"optimal control",
"shortest path",
"shortest path routing",
"routing problems",
"random processes",
"optimization",
"efficient algorithm"
] |
[
"shortest path routing",
"control systems",
"networked controls",
"optimal control",
"probability",
"routing problems",
"efficient algorithm",
"communication",
"packet loss",
"radio",
"optimization problems",
"unknown parameters",
"radio resources",
"control loop",
"programming framework",
"wireless",
"sensors",
"markov chains",
"multihop wireless network",
"random processes",
"multihop",
"wireless networks",
"shortest path",
"energy constraint",
"wireless communications",
"networked control systems",
"channel state",
"efficient computation",
"routing algorithms",
"optimization",
"markov decision processes",
"sensor data"
] |
[
"network routing",
"computer systems",
"mathematics",
"computational efficiency",
"packet networks",
"wireless telecommunication systems",
"correlation analysis",
"adaptive control systems",
"cognitive radio",
"frequency division multiple access",
"remote control",
"map-reduce",
"parallel programming",
"computer hardware",
"markov processes",
"ad hoc networks",
"graph theory",
"sensor networks",
"wireless sensor networks",
"computer networks",
"control system analysis",
"linear matrix inequalities",
"channel state information",
"state feedback",
"channel estimation",
"routing protocols",
"computer science",
"theoretical computer science",
"telecommunication traffic",
"communication systems",
"telecommunication systems",
"process control",
"frequency allocation",
"robots",
"cloud computing",
"software architecture patterns",
"program processors",
"parallel algorithms",
"parallel architectures",
"computer programming languages",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"embedded systems",
"energy utilization",
"sensor nodes",
"matrix algebra",
"fading (radio)",
"rayleigh fading",
"multiplexing",
"channel capacity",
"transmitters",
"mimo systems",
"feedback control",
"communication channels",
"telecommunication networks",
"automation",
"data communication systems",
"robotics",
"software architecture",
"parallel processing systems",
"microprocessor chips",
"computer programming",
"bandwidth",
"local area networks",
"electricity",
"bit error rate",
"signal detection",
"fading channels",
"signal to noise ratio",
"information theory",
"signal receivers",
"antennas",
"feedback systems",
"engineering",
"software design",
"distributed systems",
"signal processing",
"software engineering",
"distributed computer systems"
] |
|
1,088
|
Copyright protection is a major issue in distributing digital content. On the other hand, improvements to usability are sought by content users. In this paper, we propose a secure traitor tracing scheme against key exposure (TTaKE) which contains the properties of both a traitor tracing scheme and a forward secure public key cryptosystem. Its structure fits current digital broadcasting systems and it may be useful in preventing traitors from making illegal decoders and in minimizing the damage from accidental key exposure. It can improve usability through these properties
|
2022-09-04T05:30:27.755Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0508011",
"ArXiv": "cs/0508011",
"MAG": "2086529990",
"CorpusId": "1088",
"PubMed": null,
"DOI": "10.1109/ISIT.2005.1523670",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/40c322465dbea043f4dd78290b86e67030a25176
|
A secure traitor tracing scheme against key exposure
|
[
{
"authorId": "1784355",
"name": "Kazuto Ogawa"
},
{
"authorId": "1717331",
"name": "Goichiro Hanaoka"
},
{
"authorId": "51006626",
"name": "H. Imai"
}
] |
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
| 2,005
| 10
| 5
| 0
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-08-02T00:00:00
|
{
"name": "Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.",
"volume": null,
"pages": "1873-1877"
}
|
[
"digital contents",
"copyright protections",
"public key cryptosystems",
"key exposure",
"broadcasting"
] |
[
"key exposure",
"copyright protections",
"digital contents",
"public keys",
"public key cryptosystems",
"cryptosystems",
"broadcasting"
] |
[
"cryptosystems",
"digital contents",
"copyright protections",
"public key cryptosystems",
"key exposure",
"public keys",
"broadcasting"
] |
[
"public key cryptography",
"digital rights management",
"digital watermarking",
"cryptography",
"forward security",
"communication channels",
"authentication",
"network security",
"image processing",
"security of data",
"cryptology",
"electronic document identification systems",
"digital signature",
"wireless telecommunication systems",
"computer networks",
"computer imaging and vision",
"computer security",
"communication systems",
"telecommunication systems",
"computer science",
"computer systems"
] |
1,090
|
Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary information (also called external knowledge, background knowledge, or side information) that an adversary gleans from other channels such as the web, public records, or domain knowledge. This paper explores how one can reason about privacy in the face of rich, realistic sources of auxiliary information. Specifically, we investigate the effectiveness of current anonymization schemes in preserving privacy when multiple organizations independently release anonymized data about overlapping populations.
1. We investigate composition attacks, in which an adversary uses independent anonymized releases to breach privacy. We explain why recently proposed models of limited auxiliary information fail to capture composition attacks. Our experiments demonstrate that even a simple instance of a composition attack can breach privacy in practice, for a large class of currently proposed techniques. The class includes k-anonymity and several recent variants.
2. On a more positive note, certain randomization-based notions of privacy (such as differential privacy) provably resist composition attacks and, in fact, the use of arbitrary side information.This resistance enables "stand-alone" design of anonymization schemes, without the need for explicitly keeping track of other releases.
We provide a precise formulation of this property, and prove that an important class of relaxations of differential privacy also satisfy the property. This significantly enlarges the class of protocols known to enable modular design.
|
2022-09-04T23:14:05.208Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0803-0032",
"ArXiv": "0803.0032",
"MAG": "2129157759",
"CorpusId": "1090",
"PubMed": null,
"DOI": "10.1145/1401890.1401926",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/11a651253f8603c01ed29c00c76673a67bd291c7
|
Composition attacks and auxiliary information in data privacy
|
[
{
"authorId": "2554473",
"name": "S. R. Ganta"
},
{
"authorId": "7993151",
"name": "S. Kasiviswanathan"
},
{
"authorId": "39765787",
"name": "Adam D. Smith"
}
] |
KDD
| 2,008
| 67
| 377
| 20
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2008-02-29T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0803.0032",
"pages": null
}
|
[
"data privacy",
"anonymization",
"k-anonymity",
"reasoning",
"privacy",
"background knowledge",
"data publishing",
"domain knowledge",
"differential privacies"
] |
[
"data privacy",
"privacy",
"individual privacy",
"data publishing",
"anonymization",
"background knowledge",
"anonymity",
"differential privacies",
"privacy protection",
"privacy and security"
] |
[
"data privacy",
"k-anonymity",
"anonymization",
"privacy protection",
"reasoning",
"privacy",
"background knowledge",
"data publishing",
"individual privacy",
"domain knowledge",
"anonymity",
"privacy and security",
"differential privacies"
] |
[
"privacy preserving",
"database systems",
"cryptography",
"ontology",
"formal languages",
"computer security",
"knowledge representation",
"knowledge based systems",
"authentication",
"network security",
"sensitive informations",
"data mining",
"computer systems",
"cryptology",
"semantics",
"linguistics",
"formal languages and automata theory",
"computer science",
"artificial intelligence",
"security of data",
"computer networks",
"access control",
"theoretical computer science"
] |
1,094
|
The purpose of this paper is to present a method for automatic classification of dialogue utterances and the results of applying that method to a corpus. Superficial features of a set of training utterances (which we will call cues) are taken as the basis for finding relevant utterance classes and for extracting rules for assigning these classes to new utterances. Each cue is assumed to partially contribute to the communicative function of an utterance. Instead of relying on subjective judgments for the tasks of finding classes and rules, we opt for using machine learning techniques to guarantee objectivity.
|
2022-09-01T02:09:28.136Z
|
{
"ACL": null,
"DBLP": "journals/corr/cmp-lg-9607022",
"ArXiv": "cmp-lg/9607022",
"MAG": "2963733529",
"CorpusId": "1094",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/3819b672fa3325221027110b686222745fe7b33d
|
A Machine Learning Approach to the Classification of Dialogue Utterances
|
[
{
"authorId": "47201638",
"name": "T. Andernach"
}
] |
ArXiv
| 1,996
| 19
| 32
| 3
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1996-02-07T00:00:00
|
{
"name": "ArXiv",
"volume": "cmp-lg/9607022",
"pages": null
}
|
[
"machine learning",
"dialogue",
"automatic classification"
] |
[
"machine learning",
"automatic classification",
"dialogue",
"classification methods",
"supervised machine learning"
] |
[
"classification methods",
"automatic classification",
"machine learning",
"dialogue",
"supervised machine learning"
] |
[
"computer systems",
"artificial intelligence",
"argumentation",
"linguistics",
"computer science",
"logic programming",
"autonomous agents",
"computer programming languages",
"formal logic",
"multiagent system",
"computer programming"
] |
1,095
|
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. This paper proposes two novel BCD adders called carry skip and carry look-ahead BCD adders respectively. Furthermore, in the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. It is not possible to realize quantum computing without reversible logic. Thus, this paper also paper provides the reversible logic implementation of the conventional BCD adder as the well as the proposed carry skip BCD adder using a recently proposed TSG gate. Furthermore, a new reversible gate called TS-3 is also being proposed and it has been shown that the proposed reversible logic implementation of the BCD adders is much better compared to recently proposed one, in terms of number of reversible gates used and garbage outputs produced. The reversible BCD circuits designed and proposed here form the basis of the decimal ALU of a primitive quantum CPU.
|
2022-09-04T08:50:51.003Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0603088",
"ArXiv": "cs/0603088",
"MAG": "2949072678",
"CorpusId": "1095",
"PubMed": null,
"DOI": "10.1109/VLSID.2006.122",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/95c352d421332ba8e28199cd3c853dde621b2ab4
|
Novel BCD adders and their reversible logic implementation for IEEE 754r format
|
[
{
"authorId": "2452409",
"name": "H. Thapliyal"
},
{
"authorId": "2322084",
"name": "S. Kotiyal"
},
{
"authorId": "145978057",
"name": "M. Srinivas"
}
] |
19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06)
| 2,006
| 25
| 85
| 7
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2006-01-03T00:00:00
|
{
"name": "19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06)",
"volume": null,
"pages": "6 pp.-"
}
|
[
"floating points",
"low power",
"cpu",
"adders",
"reversible logic",
"optical computing"
] |
[
"adders",
"ripple carry adders",
"reversible logic",
"low power",
"optical computing",
"cpu"
] |
[
"floating points",
"ripple carry adders",
"low power",
"cpu",
"adders",
"reversible logic",
"optical computing"
] |
[
"digital arithmetic",
"computer hardware",
"gpu",
"vlsi circuits",
"logic gates",
"optical data processing",
"optical filters",
"mathematics",
"computer science",
"program processors",
"field programmable gate array",
"imaging systems",
"wavelength division multiplexing",
"optical fibers",
"parallel processing systems",
"microprocessor chips",
"image reconstruction",
"telecommunication traffic",
"sensors",
"distributed systems",
"image analysis",
"image processing",
"telecommunication networks",
"distributed computer systems",
"computer imaging and vision",
"telecommunication systems",
"computer systems"
] |
1,099
|
Given a general source with countably infinite source alphabet and a general channel with arbitrary abstract channel input/channel output alphabets, we study the joint source-channel coding problem from the information-spectrum point of view. First, we generalize Feinstein's lemma (direct part) and Verdu-Han's lemma (converse part) so as to be applicable to the general joint source-channel coding problem. Based on these lemmas, we establish a sufficient condition as well as a necessary condition for the source to be reliably transmissible over the channel with asymptotically vanishing probability of error. It is shown that our sufficient condition is equivalent to the sufficient condition derived by Vembu, Verdu and Steinberg, whereas our necessary condition is shown to be stronger than or equivalent to the necessary condition derived by them. It turns out, as a direct consequence, that separation principle in a relevantly generalized sense holds for a wide class of sources and channels, as was shown in a quite dfifferent manner by Vembu, Verdu and Steinberg. It should also be remarked that a nice duality is found between our necessary and sufficient conditions, whereas we cannot fully enjoy such a duality between the necessary condition and the sufficient condition by Vembu, Verdu and Steinberg. In addition, we demonstrate a sufficient condition as well as a necessary condition for the epsilon-transmissibility. Finally, the separation theorem of the traditional standard form is shown to hold for the class of sources and channels that satisfy the semi-strong converse property.
|
2022-06-20T19:44:51.944Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0712-2959",
"ArXiv": "0712.2959",
"MAG": "2138879138",
"CorpusId": "1099",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/40f3fddd21d19be6da2d046ce08e3555d5a600f0
|
Joint Source-Channel Coding Revisited: Information-Spectrum Approach
|
[
{
"authorId": "2257228",
"name": "T. Han"
}
] |
ArXiv
| 2,007
| 13
| 8
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-12-18T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0712.2959",
"pages": null
}
|
[
"joint source-channel coding",
"sufficient conditions",
"probability"
] |
[
"channel coding",
"frequency bands",
"sufficient conditions",
"probability",
"radio channels"
] |
[
"frequency bands",
"probability",
"channel coding",
"sufficient conditions",
"radio channels",
"joint source-channel coding"
] |
[
"antennas",
"mathematics",
"image coding",
"bit error rate",
"fading channels",
"channel capacity",
"linear matrix inequalities",
"fading (radio)",
"radio transmission",
"wireless telecommunication systems",
"image processing",
"communication channels",
"signal to noise ratio",
"information theory",
"matrix algebra",
"signal detection",
"computer networks",
"communication systems",
"telecommunication systems",
"computer imaging and vision",
"signal processing",
"communication",
"computer science",
"computer systems",
"engineering"
] |
1,101
|
As a powerful cryptanalysis tool, the method of return-map attacks can be used to extract secret messages masked by chaos in secure communication schemes. Recently, a simple defensive mechanism was presented to enhance the security of chaotic parameter modulation schemes against return-map attacks. Two techniques are combined in the proposed defensive mechanism: multistep parameter modulation and alternative driving of two different transmitter variables. This paper re-studies the security of this proposed defensive mechanism against return-map attacks, and points out that the security was much over-estimated in the original publication for both ciphertext-only attack and known/chosen-plaintext attacks. It is found that a deterministic relationship exists between the shape of the return map and the modulated parameter, and that such a relationship can be used to dramatically enhance return-map attacks thereby making them quite easy to break the defensive mechanism.
|
2022-08-31T13:09:18.578Z
|
{
"ACL": null,
"DBLP": "journals/ijbc/LiCA06",
"ArXiv": "nlin/0501018",
"MAG": "2126238296",
"CorpusId": "1101",
"PubMed": null,
"DOI": "10.1142/S0218127406015507",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/421ac92c985cd9249022f4f313365de9158a3555
|
Return-Map Cryptanalysis Revisited
|
[
{
"authorId": "33128766",
"name": "S. Li"
},
{
"authorId": "145205045",
"name": "Guanrong Chen"
},
{
"authorId": "145463484",
"name": "G. Álvarez"
}
] |
Int. J. Bifurc. Chaos
| 2,005
| 62
| 32
| 2
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-01-08T00:00:00
|
{
"name": "Int. J. Bifurc. Chaos",
"volume": "16",
"pages": "1557-1568"
}
|
[
"transmitters",
"secure communications",
"chosen-plaintext attack",
"deterministic",
"cryptanalysis",
"secret messages"
] |
[
"cryptosystems",
"cryptanalysis",
"secret messages",
"communication",
"transmitters",
"ciphertexts",
"deterministic"
] |
[
"transmitters",
"cryptosystems",
"secure communications",
"chosen-plaintext attack",
"deterministic",
"cryptanalysis",
"ciphertexts",
"communication",
"secret messages"
] |
[
"signal receivers",
"antennas",
"public key cryptography",
"authentication",
"network security",
"stochastic",
"cryptology",
"encryption",
"steganography",
"communication channels",
"signal to noise ratio",
"signal detection",
"wireless telecommunication systems",
"security of data",
"cryptography",
"computer networks",
"stochastic processes",
"stochasticity",
"computer security",
"signal processing",
"communication systems",
"telecommunication systems",
"computer science",
"probability",
"numerical model",
"engineering",
"computer systems",
"mathematics"
] |
1,103
|
The water vapour in troposphere has been identified as one of the major errors in SAR interferograms, which can cause a spatial delay during two non-simultaneous acquisitions. The microwave-signal propagation path delay due to water vapour may reduce the reliability of deformation measurements. In this paper, it aims to assess the water vapour effect on interferograms, and apply synchronous MERIS data to reduce the effect on ASAR interferograms. Due to the co-existence of MERIS and ASAR on board of ENVISAT satellite, they can acquire data co-located in the same time and space. So it has a unique advantage to combine MERIS and ASAR data to reduce the tropospheric water vapour effect on ASAR interferograms. However, the method is not so well operational, and still existing some problems need to be further discussed, such as: how to deal with the cloud coverage over MERIS water vapour image; and how to register MERIS to ASAR from different reference systems, and so on. These will be discussed in this paper, and novel ideas are proposed to deal with them. The discussions are based on the application of the test site in the middle and lower reaches of Yangze River, southwest Hubei province, China.
|
2022-09-02T10:13:51.053Z
|
{
"ACL": null,
"DBLP": "conf/igarss/ZengLL07",
"ArXiv": null,
"MAG": "2142647918",
"CorpusId": "1103",
"PubMed": null,
"DOI": "10.1109/IGARSS.2007.4423244",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/373fdb8042e8cc95ac0225f9958de5e4eec91384
|
Correction of tropospheric water vapour effect on ASAR interferogram using synchronous MERIS data
|
[
{
"authorId": "1743983",
"name": "Q. Zeng"
},
{
"authorId": "2155507037",
"name": "Ying Li"
},
{
"authorId": "2141683726",
"name": "Xiaofan Li"
}
] |
2007 IEEE International Geoscience and Remote Sensing Symposium
| 2,007
| 6
| 8
| 0
| false
|
[
{
"category": "Environmental Science",
"source": "s2-fos-model"
},
{
"category": "Environmental Science",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-07-23T00:00:00
|
{
"name": "2007 IEEE International Geoscience and Remote Sensing Symposium",
"volume": null,
"pages": "2086-2089"
}
|
[
"envisat",
"interferograms"
] |
[
"interferograms",
"microwaves",
"envisat",
"radarsat-2",
"elastic deformation"
] |
[
"interferograms",
"microwaves",
"radarsat-2",
"elastic deformation",
"envisat"
] |
[
"geodetic satellites",
"signal processing",
"sar images",
"polarimetric sar",
"geology",
"haptic interactions",
"synthetic apertures",
"synthetic aperture radar",
"engineering",
"radar antennas",
"polarographic analysis",
"haptic systems",
"image classification",
"radar imaging",
"imaging systems",
"radar",
"antenna arrays",
"polarimeters",
"virtual reality",
"user interfaces",
"image reconstruction",
"computer hardware",
"communication channels",
"antennas",
"signal to noise ratio",
"matrix algebra",
"human computer interaction",
"image analysis",
"image processing",
"computer science",
"wireless telecommunication systems",
"mathematics",
"computer imaging and vision",
"computer networks",
"communication systems",
"telecommunication systems",
"computer systems"
] |
1,104
|
This invention relates to vehicles having parts connected with a sealing spring fastener, which comprises a U-shaped structure, on which an elastic body has been incorporated. The elastic body has a hermetically closed cavity within the U-shaped structure. The sealing spring fastener can form an assembly with an extension of a panel, preferably a plastic panel. The assembly or the fastener by itself can be engaged into the slot of a solid sheet, preferably a metal sheet, in a manner that one side of the sheet is sealed from the other side of the sheet in the vicinity of the slot. In a preferred version, the sealing fastener comprises a substantially non-elastic tough casing around portion of the elastic body in order to avoid rapture during insertion of the fastener into the slot.
|
2022-01-27T16:44:59.930Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0510011",
"ArXiv": "cs/0510011",
"MAG": "1552787686",
"CorpusId": "1104",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/f9d7af5a8a20b8596bc5a7594a01f4d344102834
|
Diophantus' 20th Problem and Fermat's Last Theorem for n=4: Formalization of Fermat's Proofs in the Coq Proof Assistant
|
[
{
"authorId": "11115809",
"name": "D. Delahaye"
},
{
"authorId": "1868264",
"name": "Micaela Mayero"
}
] |
ArXiv
| 2,005
| 36
| 1
| 0
| false
|
[
{
"category": "Materials Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-10-03T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0510011",
"pages": null
}
|
[
"vehicles"
] |
[
"isabelle/hol",
"vehicles",
"formal proofs",
"higher order logic",
"time slots"
] |
[
"time slots",
"isabelle/hol",
"formal proofs",
"vehicles",
"higher order logic"
] |
[
"wireless networks",
"wireless sensor networks",
"theorem provers",
"formal verifications",
"formal logic",
"engineering",
"wireless communications",
"packet networks",
"energy utilization",
"sensor nodes",
"routing algorithms",
"verification",
"artificial intelligence",
"computer networks",
"telecommunication traffic",
"wireless telecommunication systems",
"electricity",
"sensors",
"verification and validation",
"computer science",
"telecommunication networks",
"communication systems",
"telecommunication systems",
"computer hardware",
"software quality",
"computer systems",
"software design",
"software engineering"
] |
1,105
|
Statistical significance testing of differences in values of metrics like recall, precision and balanced F-score is a necessary part of empirical natural language processing. Unfortunately, we find in a set of experiments that many commonly used tests often underestimate the significance and so are less likely to detect differences that exist between different techniques. This underestimation comes from an independence assumption that is often violated. We point out some useful tests that do not make this assumption, including computationally-intensive randomization tests.
|
2022-09-05T03:16:02.322Z
|
{
"ACL": "C00-2137",
"DBLP": "journals/corr/cs-CL-0008005",
"ArXiv": "cs/0008005",
"MAG": "2057399676",
"CorpusId": "1105",
"PubMed": null,
"DOI": "10.3115/992730.992783",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/9dcf566fa1515896ac7df2c6ff4b158536cc584f
|
More accurate tests for the statistical significance of result differences
|
[
{
"authorId": "145561618",
"name": "A. Yeh"
}
] |
COLING
| 2,000
| 17
| 443
| 28
| true
|
[
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2000-07-31T00:00:00
|
{
"name": null,
"volume": null,
"pages": "947-953"
}
|
[
"statistical significance",
"natural language processing"
] |
[
"statistical significance",
"natural languages",
"natural language processing",
"test results",
"correlation analysis",
"natural language understanding",
"text processing"
] |
[
"text processing",
"correlation analysis",
"natural languages",
"natural language processing",
"test results",
"natural language understanding",
"statistical significance"
] |
[
"computational linguistics",
"data mining",
"information retrieval",
"mathematics",
"linguistics",
"semantics",
"artificial intelligence",
"sensors",
"knowledge representation",
"database systems",
"computer science",
"computer hardware",
"knowledge based systems",
"computer systems"
] |
1,107
|
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines newer systems such as scalable object stores and multimedia repositories. Such systems use a get/put interface to store objects. In principle, databases and filesystems can support such applications efficiently, allowing system designers to focus on complexity, deployment cost and manageability. Although theoretical work proves that certain storage policies behave optimally for some workloads, these policies often behave poorly in practice. Most storage benchmarks focus on short-term behavior or do not measure fragmentation. We compare SQL Server to NTFS and find that fragmentation dominates performance when object sizes exceed 256KB-1MB. NTFS handles fragmentation better than SQL Server. Although the performance curves will vary with other systems and workloads, we expect the same interactions between fragmentation and free space to apply. It is well-known that fragmentation is related to the percentage free space. We found that the ratio of free space to object size also impacts performance. Surprisingly, in both systems, storing objects of a single size causes fragmentation, and changing the size of write requests affects fragmentation. These problems could be addressed with simple changes to the filesystem and database interfaces. It is our hope that an improved understanding of fragmentation will lead to predictable storage systems that require less maintenance after deployment.
|
2022-08-27T04:33:24.112Z
|
{
"ACL": null,
"DBLP": "conf/cidr/SearsI07",
"ArXiv": "cs/0612111",
"MAG": "1613096453",
"CorpusId": "1107",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/824848a540180ef6725a76698e2dc9c4ee2df7d2
|
Fragmentation in Large Object Repositories
|
[
{
"authorId": "145879573",
"name": "R. Sears"
},
{
"authorId": "2143580",
"name": "C. Ingen"
}
] |
CIDR
| 2,006
| 31
| 8
| 1
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2006-12-21T00:00:00
|
{
"name": null,
"volume": null,
"pages": "298-305"
}
|
[
"sql",
"file systems",
"database systems",
"storage systems"
] |
[
"file systems",
"database systems",
"storage systems",
"sql",
"storage devices"
] |
[
"sql",
"storage systems",
"storage devices",
"file systems",
"database systems"
] |
[
"relational database",
"computer systems",
"flash memory",
"operating systems",
"knowledge based systems",
"query languages",
"computer science",
"embedded systems",
"artificial intelligence"
] |
1,108
|
In this paper, the relationship between the network synchronizability and the edge distribution of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network sychronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. It is shown by examples that the answer is negative. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, an example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.
|
2022-08-31T14:50:27.252Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0711-2442",
"ArXiv": "0711.2442",
"MAG": "1495932020",
"CorpusId": "1108",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/c94910c5ad8792a42a4f7168b68d51b038671a91
|
Are networks with more edges easier to synchronize?
|
[
{
"authorId": "8200163",
"name": "Z. Duan"
},
{
"authorId": "47825240",
"name": "Wenxu Wang"
},
{
"authorId": "2152505822",
"name": "Chao Liu"
},
{
"authorId": "145205045",
"name": "Guanrong Chen"
}
] |
ArXiv
| 2,007
| 34
| 2
| 0
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-11-15T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0711.2442",
"pages": null
}
|
[
"betweenness"
] |
[
"network architecture",
"betweenness",
"centrality measures",
"network components",
"edge crossing"
] |
[
"network components",
"network architecture",
"edge crossing",
"centrality measures",
"betweenness"
] |
[
"program compilers",
"computer networks",
"graph drawing",
"drawing (graphics)",
"social network analysis",
"graph theory",
"complex networks",
"social networks",
"parallel processing systems",
"computer programming languages",
"computer science",
"visualization",
"computer aided design",
"theoretical computer science",
"topology",
"world wide web",
"distributed systems",
"computer programming",
"human computer interaction",
"internet",
"distributed computer systems",
"computer systems"
] |
1,109
|
It is shown that while the mutual information curves for coded modulation (CM) and bit interleaved coded modulation (BICM) overlap in the case of a single input single output channel, the same is not true in multiple input multiple output (MIMO) channels. A method for mitigating fading in the presence of multiple transmit antennas, named coordinate interleaving (CI), is presented as a generalization of component interleaving for a single transmit antenna. The extent of any advantages of CI over BICM, relative to CM, is analyzed from a mutual information perspective; the analysis is based on an equivalent parallel channel model for CI. Several expressions for mutual information in the presence of CI and multiple transmit and receive antennas are derived. Results show that CI gives higher mutual information compared to that of BICM if proper signal mappings are used. Effects like constellation rotation in the presence of CI are also considered and illustrated; it is shown that constellation rotation can increase the constrained capacity.
|
2022-08-29T05:30:52.727Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0510072",
"ArXiv": "cs/0510072",
"MAG": "1866810641",
"CorpusId": "1109",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/8938c579b91497b6b56108abe230b02155704878
|
On Interleaving Techniques for MIMO Channels and Limitations of Bit Interleaved Coded Modulation
|
[
{
"authorId": "3051167",
"name": "D. M. Ionescu"
},
{
"authorId": "22594065",
"name": "Dung N. Doan"
},
{
"authorId": "144923581",
"name": "S. Gray"
}
] |
ArXiv
| 2,005
| 35
| 8
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-10-23T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0510072",
"pages": null
}
|
[
"receive antenna",
"mimo",
"mimo channel",
"coded modulation",
"multiple transmit antennas",
"channel model",
"mutual informations",
"transmit antenna",
"interleavings"
] |
[
"interleavings",
"mimo",
"mimo channel",
"coded modulation",
"mutual informations",
"multiple transmit antennas",
"transmit antenna",
"receive antenna",
"antennas",
"channel model",
"interleavers",
"multiple-input-multiple-output",
"bit interleaved coded modulation",
"antenna element",
"antenna arrays",
"multiple receive antennas",
"stbc",
"transmitting antenna"
] |
[
"transmitting antenna",
"receive antenna",
"antennas",
"mimo",
"mimo channel",
"stbc",
"antenna element",
"coded modulation",
"multiple transmit antennas",
"channel model",
"antenna arrays",
"mutual informations",
"transmit antenna",
"bit interleaved coded modulation",
"multiple receive antennas",
"interleavings",
"multiple-input-multiple-output",
"interleavers"
] |
[
"receiving antennas",
"wireless telecommunication systems",
"orthogonal frequency division multiplexing",
"mim devices",
"fading channels",
"channel capacity",
"mimo systems",
"matrix algebra",
"signal encoding",
"space time adaptive processing",
"space-time block codes",
"ofdm",
"antenna accessories",
"turbo codes",
"communication channels",
"signal to noise ratio",
"information theory",
"block codes",
"multipath propagation",
"model checking",
"concurrent program",
"fading (radio)",
"multiplexing",
"computer networks",
"communication systems",
"telecommunication systems",
"mathematics",
"data communication systems",
"quadrature amplitude modulation",
"low-density parity-check codes",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"signal processing",
"communication",
"bit error rate",
"embedded systems",
"architecture verification and validation",
"concurrency control",
"signal detection",
"computer science",
"computer systems",
"rayleigh fading",
"iterative decoding",
"graph theory",
"white noise",
"gaussian noise (electronic)",
"engineering",
"probability",
"architecting",
"database systems",
"theoretical computer science",
"software architecture",
"software design",
"software engineering"
] |
1,110
|
In recent work [quant-ph/0405174] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with "history", valid for quantization both irreversible and reversible classical CA directly using local transition rules. It is used language of vectors in Hilbert spaces instead of C*-algebras, but results may be compared in some cases. Finally, the quantum lattice gases, quantum walk and "bots" are also discussed briefly.
|
2022-09-04T20:00:42.496Z
|
{
"ACL": null,
"DBLP": "journals/corr/quant-ph-0406119",
"ArXiv": "quant-ph/0406119",
"MAG": "1546815411",
"CorpusId": "1110",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/7617e78f2a63f3044a2e7ec5156d7376b6b32819
|
On Quantum Cellular Automata
|
[
{
"authorId": "31795541",
"name": "A. Vlasov"
}
] |
ArXiv
| 2,004
| 25
| 510
| 42
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2004-06-17T00:00:00
|
{
"name": "ArXiv",
"volume": "quant-ph/0406119",
"pages": null
}
|
[
"quantization",
"cellular automata",
"standard model"
] |
[
"quantum gates",
"cellular",
"cellular automata",
"automata",
"standard model",
"quantization",
"finite state automata",
"push-down automata"
] |
[
"quantization",
"cellular automata",
"standard model",
"finite state automata",
"push-down automata",
"quantum gates",
"cellular",
"automata"
] |
[
"image compression",
"signal processing",
"artificial intelligence",
"automata theory",
"electronic document identification systems",
"the standard model",
"translation (languages)",
"finite automata",
"logic gates",
"wireless",
"cellular telephone systems",
"cellular radio systems",
"formal languages",
"image quality",
"image coding",
"engineering",
"computer science",
"formal languages and automata theory",
"authentication",
"cryptography",
"public key cryptography",
"computational linguistics",
"linguistics",
"field programmable gate array",
"radio",
"mobile computing",
"mobile telecommunication systems",
"communication channels",
"telecommunication traffic",
"signal to noise ratio",
"image analysis",
"image processing",
"theoretical computer science",
"security of data",
"cryptology",
"network security",
"database systems",
"computer hardware",
"wireless telecommunication systems",
"telecommunication networks",
"data communication systems",
"computer imaging and vision",
"computer security",
"computer networks",
"computer systems",
"communication systems",
"telecommunication systems"
] |
1,112
|
We introduce a notion of synchronization for higher-dimensional automata, based on coskeletons of cubical sets. Categorification transports this notion to the setting of categorical transition systems. We apply the results to study the semantics of an imperative programming language with message-passing.
|
2022-09-02T09:07:10.196Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-PL-0411001",
"ArXiv": "cs/0411001",
"MAG": "1830494936",
"CorpusId": "1112",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/06a54154f9d4002303ee5b4a38c13678f1bc48ce
|
Synchronization from a Categorical Perspective
|
[
{
"authorId": "2673471",
"name": "K. Worytkiewicz"
}
] |
ArXiv
| 2,004
| 33
| 8
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2004-11-01T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.PL/0411001",
"pages": null
}
|
[
"programming languages",
"transition system",
"semantics",
"automata"
] |
[
"automata",
"transition system",
"semantics",
"programming languages",
"finite state automata"
] |
[
"transition system",
"semantics",
"programming languages",
"finite state automata",
"automata"
] |
[
"model checking",
"computer programming languages",
"linguistics",
"translation (languages)",
"finite automata",
"formal languages",
"embedded systems",
"architecture verification and validation",
"computer programming",
"computational linguistics",
"automata theory",
"formal languages and automata theory",
"computer systems",
"architecting",
"computer science",
"database systems",
"theoretical computer science",
"software architecture",
"software design",
"software engineering"
] |
1,113
|
In this paper have written the results of the information analysis of structures. The obtained information estimation (IE) are based on an entropy measure of C. Shannon. Obtained IE is univalent both for the non-isomorphic and for the isomorphic graphs, algorithmically, it is asymptotically steady and has vector character. IE can be used for the solution of the problems ranking of structures by the preference, the evaluation of the structurization of subject area, the solution of the problems of structural optimization. Information estimations and method of the information analysis of structures it can be used in many fields of knowledge (Electrical Systems and Circuit, Image recognition, Computer technology, Databases and Bases of knowledge, Organic chemistry, Biology and others) and it can be base for the structure calculus.
|
2022-09-02T00:46:28.730Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0501088",
"ArXiv": "cs/0501088",
"MAG": "1656768917",
"CorpusId": "1113",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/0f218fcd19ffa337c891cf9868b5e5018756642f
|
Information estimations and analysis of structures
|
[
{
"authorId": "2930318",
"name": "A. Shaydurov"
}
] |
ArXiv
| 2,005
| 13
| 0
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-01-30T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0501088",
"pages": null
}
|
[
"structural optimization",
"database systems",
"information analysis"
] |
[
"estimation method",
"information analysis",
"structural optimization",
"optimization",
"database systems"
] |
[
"estimation method",
"optimization",
"information analysis",
"structural optimization",
"database systems"
] |
[
"numerical model",
"mathematics",
"information systems",
"topology",
"computer systems",
"computer science"
] |
1,115
|
In this paper, a sorting technique is presented that takes as input a data set whose primary key domain is known to the sorting algorithm, and works with an time efficiency of O(n+k), where k is the primary key domain. It is shown that the algorithm has applicability over a wide range of data sets. Later, a parallel formulation of the same is proposed and its effectiveness is argued. Though this algorithm is applicable over a wide range of general data sets, it finds special application (much superior to others) in places where sorting information that arrives in parts and in cases where input data is huge in size.
|
2022-06-20T11:22:21.635Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0505066",
"ArXiv": "cs/0505066",
"MAG": "1622536979",
"CorpusId": "1115",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/8566d3224b0172ca8b9ea69eba382a5b7728b03c
|
Decision Sort and its Parallel Implementation
|
[
{
"authorId": "2167147",
"name": "Udayan Khuarana"
}
] |
ArXiv
| 2,005
| 9
| 0
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-05-24T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0505066",
"pages": null
}
|
[
"parallel implementations"
] |
[
"parallel implementations",
"computational efficiency",
"integrated data",
"adaptive algorithms",
"hybrid algorithms"
] |
[
"integrated data",
"hybrid algorithms",
"computational efficiency",
"parallel implementations",
"adaptive algorithms"
] |
[
"data integration",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"theoretical computer science",
"program processors",
"parallel algorithms",
"parallel architectures",
"software",
"data handling",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"computer science",
"parallel processing systems",
"microprocessor chips",
"database systems",
"artificial intelligence",
"correlation analysis",
"mathematics",
"distributed systems",
"computer hardware",
"computer systems",
"distributed computer systems"
] |
1,119
|
Recommender systems typically require users' history data to provide a list of recommendations and such recommendations usually reside on the cloud/server. However, the release of such private data to the cloud has been shown to put users at risk. It is highly desirable to provide users high-quality personalized services while respecting their privacy. In this paper, we develop the first Enhanced Privacy-built-In Client for Personalized Recommendation (EpicRec) system that performs the data perturbation on the client side to protect users' privacy. Our system needs no assumption of trusted server and no change on the recommendation algorithms on the server side; and needs minimum user interaction in their preferred manner, which makes our solution fit very well into real world practical use. The design of EpicRec system incorporates three main modules: (1) usable privacy control interface that enables two user preferred privacy controls, overall and category-based controls, in the way they understand; (2) user privacy level quantification that automatically quantifies user privacy concern level from these user understandable inputs; (3) lightweight data perturbation algorithm that perturbs user private data with provable guarantees on both differential privacy and data utility. Using large-scale real world datasets, we show that, for both overall and category-based privacy controls, EpicRec performs best with respect to both perturbation quality and personalized recommendation, with negligible computational overhead. Therefore, EpicRec enables two contradictory goals, privacy preservation and recommendation accuracy. We also implement a proof-of-concept EpicRec system to demonstrate a privacy-preserving personal computer for movie recommendation with web-based privacy controls. We believe EpicRec is an important step towards designing a practical system that enables companies to monetize on user data using high quality personalized services with strong provable privacy protection to gain user acceptance and adoption of their services.
|
2022-09-03T04:21:26.545Z
|
{
"ACL": null,
"DBLP": "conf/ccs/ShenJ16",
"ArXiv": null,
"MAG": "2534826340",
"CorpusId": "1119",
"PubMed": null,
"DOI": "10.1145/2976749.2978316",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/8a90a27369c83dad90bafd9c0d639f049617e4c9
|
EpicRec: Towards Practical Differentially Private Framework for Personalized Recommendation
|
[
{
"authorId": "1774780",
"name": "Yilin Shen"
},
{
"authorId": "1705713",
"name": "Hongxia Jin"
}
] |
CCS
| 2,016
| 30
| 53
| 3
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Book",
"Conference"
] | 2016-10-24T00:00:00
|
{
"name": "Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security",
"volume": null,
"pages": null
}
|
[
"recommendation",
"recommendation algorithms",
"data perturbation",
"privacy protection",
"privacy preserving",
"privacy",
"privacy concerns",
"personalized recommendation",
"personalized service",
"recommender systems",
"recommendation accuracy",
"differential privacies",
"private data",
"user privacy"
] |
[
"recommendation",
"personalized service",
"personalized recommendation",
"recommender systems",
"recommendation algorithms",
"private data",
"privacy",
"privacy protection",
"user privacy",
"individual privacy",
"data perturbation",
"differential privacies",
"privacy preserving",
"recommendation accuracy",
"collaborative filtering",
"recommendation systems",
"privacy and security",
"security and privacy",
"data privacy"
] |
[
"data privacy",
"recommendation algorithms",
"privacy protection",
"data perturbation",
"privacy preserving",
"privacy",
"collaborative filtering",
"privacy concerns",
"individual privacy",
"personalized service",
"privacy and security",
"security and privacy",
"personalized recommendation",
"recommendation",
"recommendation systems",
"recommender systems",
"recommendation accuracy",
"differential privacies",
"private data",
"user privacy"
] |
[
"cryptography",
"data mining",
"computer security",
"personalizations",
"network security",
"access control",
"security systems",
"authentication",
"information retrieval",
"sensitive informations",
"database systems",
"cryptology",
"computer science",
"e-commerce",
"user interfaces",
"computer networks",
"security of data",
"computer systems",
"internet",
"information technology",
"human computer interaction"
] |
1,120
|
In knowledge bases where concepts have associated properties, there is a large amount of comparative information that is implicitly encoded in the values of the properties these concepts share. Although there have been previous approaches to generating riddles, none of them seem to take advantage of structured information stored in knowledge bases such as Thesaurus Rex, which organizes concepts according to the fine grained ad-hoc categories they are placed into by speakers in everyday language, along with associated properties or modifiers. Taking advantage of these shared properties, we have developed a riddle generator that creates riddles about concepts represented as common nouns. The base of these riddles are comparisons between the target concept and other entities that share some of its properties. In this paper, we describe the process we have followed to generate the riddles starting from the target concept and we show the results of the first evaluation we have carried out to test the quality of the resulting riddles.
|
2022-08-20T14:49:21.407Z
|
{
"ACL": "L16-1381",
"DBLP": "conf/lrec/GalvanFHM16",
"ArXiv": null,
"MAG": "2577799022",
"CorpusId": "1120",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/df92426a84dae5c076069dd7ec06cebf184b2072
|
Riddle Generation using Word Associations
|
[
{
"authorId": "39657912",
"name": "Paloma Galvan"
},
{
"authorId": "145547318",
"name": "Virginia Francisco"
},
{
"authorId": "1890781",
"name": "Raquel Hervás"
},
{
"authorId": "145814398",
"name": "Gonzalo Méndez"
}
] |
LREC
| 2,016
| 11
| 4
| 1
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2016-05-01T00:00:00
|
{
"name": "",
"volume": "",
"pages": "2407-2412"
}
|
[
"knowledge base"
] |
[
"knowledge base",
"domain knowledge",
"explicit knowledge",
"tacit knowledge",
"ontology"
] |
[
"tacit knowledge",
"explicit knowledge",
"domain knowledge",
"ontology",
"knowledge base"
] |
[
"knowledge management",
"knowledge based systems",
"semantics",
"artificial intelligence",
"computer science"
] |
1,121
|
We give the firstexact algorithmic study of facility location problems that deal with finding a median for acontinuum of demand points. In particular, we consider versions of the "continuousk-median (Fermat-Weber) problem" where the goal is to select one or more center points that minimize the average distance to a set of points in a demandregion. In such problems, the average is computed as an integral over the relevant region, versus the usual discrete sum of distances. The resulting facility location problems are inherently geometric, requiring analysis techniques of computational geometry. We provide polynomial-time algorithms for various versions of theL1 1-median (Fermat-Weber) problem. We also consider the multiple-center version of theL1k-median problem, which we prove is NP-hard for largek.
|
2022-09-03T19:38:12.996Z
|
{
"ACL": null,
"DBLP": "journals/ior/FeketeMB05",
"ArXiv": "cs/0310027",
"MAG": "2039808260",
"CorpusId": "1121",
"PubMed": null,
"DOI": "10.1287/opre.1040.0137",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/0d1444ce50c0ae6fb2dffbf6d1744c9f0d51e6fe
|
On the Continuous Fermat-Weber Problem
|
[
{
"authorId": "1707693",
"name": "S. Fekete"
},
{
"authorId": "41227416",
"name": "Joseph B. M. Mitchell"
},
{
"authorId": "47352209",
"name": "K. Beurer"
}
] |
Oper. Res.
| 2,003
| 80
| 77
| 0
| true
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2003-10-15T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CG/0310027",
"pages": null
}
|
[
"polynomial-time algorithms",
"geometry"
] |
[
"combinatorial problems",
"combinatorial optimization",
"geometry",
"polynomial-time algorithms",
"control point"
] |
[
"control point",
"geometry",
"combinatorial problems",
"combinatorial optimization",
"polynomial-time algorithms"
] |
[
"image coding",
"splines",
"curve fitting",
"combinatorial mathematics",
"optimization",
"polynomial approximation",
"image processing",
"computer aided design",
"mathematics",
"graph theory",
"computer imaging and vision",
"computer science",
"theoretical computer science"
] |
1,122
|
We try to establish a unified information theoretic approach to learning and to explore some of its applications. First, we define {\em predictive information} as the mutual information between the past and the future of a time series, discuss its behavior as a function of the length of the series, and explain how other quantities of interest studied previously in learning theory - as well as in dynamical systems and statistical mechanics - emerge from this universally definable concept. We then prove that predictive information provides the {\em unique measure for the complexity} of dynamics underlying the time series and show that there are classes of models characterized by {\em power-law growth of the predictive information} that are qualitatively more complex than any of the systems that have been investigated before. Further, we investigate numerically the learning of a nonparametric probability density, which is an example of a problem with power-law complexity, and show that the proper Bayesian formulation of this problem provides for the `Occam' factors that punish overly complex models and thus allow one {\em to learn not only a solution within a specific model class, but also the class itself} using the data only and with very few a priori assumptions. We study a possible {\em information theoretic method} that regularizes the learning of an undersampled discrete variable, and show that learning in such a setup goes through stages of very different complexities. Finally, we discuss how all of these ideas may be useful in various problems in physics, statistics, and, most importantly, biology.
|
2022-09-02T19:21:54.559Z
|
{
"ACL": null,
"DBLP": "journals/corr/physics-0009032",
"ArXiv": "physics/0009032",
"MAG": "2144021083",
"CorpusId": "1122",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/2edb75dfd62487feba92ff26547cd3832151851d
|
Information theory and learning: a physical approach
|
[
{
"authorId": "48677292",
"name": "I. Nemenman"
}
] |
ArXiv
| 2,000
| 91
| 14
| 1
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2000-09-08T00:00:00
|
{
"name": "ArXiv",
"volume": "physics/0009032",
"pages": null
}
|
[
"correlation analysis",
"bayesian methods",
"probability",
"mutual informations",
"information theory"
] |
[
"information theory",
"mutual informations",
"correlation analysis",
"probability",
"bayesian methods"
] |
[
"correlation analysis",
"bayesian methods",
"probability",
"mutual informations",
"information theory"
] |
[
"mathematics",
"artificial intelligence",
"communication",
"computer science"
] |
1,124
|
Distributed Denial-of-Service (DDoS) attacks are a major problem in the Internet today. In one form of a DDoS attack, a large number of compromised hosts send unwanted traffic to the victim, thus exhausting the resources of the victim and preventing it from serving its legitimate clients. One of the main mechanisms that have been proposed to deal with DDoS is filtering, which allows routers to selectively block unwanted traffic. Given the magnitude of DDoS attacks and the high cost of filters in the routers today, the successful mitigation of a DDoS attack using filtering crucially depends on the efficient allocation of filtering resources. In this paper, we consider a single router, typically the gateway of the victim, with a limited number of available filters. We study how to optimally allocate filters to attack sources, or entire domains of attack sources, so as to maximize the amount of good traffic preserved, under a constraint on the number of filters. We formulate the problem as an optimization problem and solve it optimally using dynamic programming, study the properties of the optimal allocation, experiment with a simple heuristic and evaluate our solutions for a range of realistic attack-scenarios. First, we look at a single-tier where the collateral damage is high due to the filtering at the granularity of domains. Second, we look at the two-tier problem where we have an additional constraint on the number of filters and the filtering is performed on the granularity of attackers and domains.
|
2022-06-20T12:08:35.631Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0612066",
"ArXiv": "cs/0612066",
"MAG": "1519247909",
"CorpusId": "1124",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/78fb836c05afad70911ff50222d28753bda25853
|
Optimal Filtering for DDoS Attacks
|
[
{
"authorId": "2857155",
"name": "Karim M. El Defrawy"
},
{
"authorId": "1706319",
"name": "A. Markopoulou"
},
{
"authorId": "1702632",
"name": "K. Argyraki"
}
] |
ArXiv
| 2,006
| 39
| 2
| 1
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-12-11T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0612066",
"pages": null
}
|
[
"denial-of-service",
"gateways (computer networks)",
"dos attacks",
"routers",
"internet",
"optimization problems"
] |
[
"dos attacks",
"internet",
"routers",
"gateways (computer networks)",
"optimization"
] |
[
"denial-of-service",
"gateways (computer networks)",
"optimization",
"dos attacks",
"routers",
"internet",
"optimization problems"
] |
[
"denial of service",
"internet protocols",
"wireless telecommunication systems",
"mathematics",
"computer crime",
"network security",
"telecommunication traffic",
"bandwidth",
"computer science",
"correlation analysis",
"transmission control protocol",
"denial of service attacks",
"intrusion detection",
"computer networks",
"communication systems",
"telecommunication systems",
"security of data",
"cryptography",
"telecommunication networks",
"congestion control (communication)",
"computer systems",
"computer security",
"cryptology"
] |
1,125
|
We demonstrate our game theory-based Texas Hold'em poker player. To overcome the computational difficulties stemming from Texas Hold'em's gigantic game tree, our player uses automated abstraction and real-time equilibrium approximation. Our player solves the first two rounds of the game in a large off-line computation, and solves the last two rounds in a real-time equilibrium approximation. Participants in the demonstration will be able to compete against our opponent and experience first-hand the cognitive abilities of our player. Some of the techniques used by our player, which does not directly incorporate any poker-specific expert knowledge, include such poker techniques as bluffing, slow-playing, check-raising, and semi-bluffing, all techniques normally associated with human play.
|
2022-08-31T17:39:21.720Z
|
{
"ACL": null,
"DBLP": "conf/atal/GilpinS06a",
"ArXiv": null,
"MAG": "2032029137",
"CorpusId": "1125",
"PubMed": null,
"DOI": "10.1145/1160633.1160911",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/2736204b93f90bf96835a6cf6dc84ef4930cc5bc
|
A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation
|
[
{
"authorId": "144720671",
"name": "Andrew Gilpin"
},
{
"authorId": "145714168",
"name": "T. Sandholm"
}
] |
AAMAS '06
| 2,006
| 10
| 36
| 3
| false
|
[
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-05-08T00:00:00
|
{
"name": null,
"volume": null,
"pages": "1453-1454"
}
|
[
"expert knowledge",
"demonstrations"
] |
[
"gameplay",
"game theory",
"demonstrations",
"expert knowledge",
"cognitive process"
] |
[
"cognitive process",
"gameplay",
"demonstrations",
"expert knowledge",
"game theory"
] |
[
"cognitive systems",
"game design",
"intelligent robots",
"robot programming",
"knowledge based systems",
"expert systems",
"artificial intelligence",
"interactive computer graphics",
"videogames",
"mobile robots",
"sensors",
"robotic manipulators",
"motion planning",
"computer science",
"user interfaces",
"computer imaging and vision",
"human computer interaction",
"robotics",
"computer hardware",
"robots"
] |
1,126
|
In agile software development, test code can considerably contribute to the overall source code size. Being a valuable asset both in terms of verification and documentation, the composition of a test suite needs to be well understood in order to identify opportunities as well as weaknesses for further evolution. In this paper, we argue that the visualization of structural characteristics is a viable means to support the exploration of test suites. Thanks to general agreement on a limited set of key test design principles, such visualizations are relatively easy to interpret. In particular, we present visualizations that support testers in (i) locating test cases; (ii) examining the relation between test code and production code; and (iii) studying the composition of and dependencies within test cases. By means of two case studies, we demonstrate how visual patterns help to identify key test suite characteristics.
|
2022-09-03T15:23:10.609Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0711-0607",
"ArXiv": "0711.0607",
"MAG": "2949100701",
"CorpusId": "1126",
"PubMed": null,
"DOI": "10.1109/ASEW.2008.4686316",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/a274cea5f3d7d2c39ad46e9b79d8e18393080727
|
Exploring the composition of unit test suites
|
[
{
"authorId": "2047164",
"name": "B. Rompaey"
},
{
"authorId": "1688862",
"name": "S. Demeyer"
}
] |
2008 23rd IEEE/ACM International Conference on Automated Software Engineering - Workshops
| 2,007
| 31
| 14
| 1
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2007-11-05T00:00:00
|
{
"name": "2008 23rd IEEE/ACM International Conference on Automated Software Engineering - Workshops",
"volume": null,
"pages": "11-20"
}
|
[
"verification",
"source codes",
"visualization",
"software development teams",
"agile software development"
] |
[
"agile methods",
"software",
"agile software development",
"software development",
"source codes",
"verification",
"visualization",
"visualization tools",
"test case generation",
"regression testing"
] |
[
"verification",
"source codes",
"visualization",
"software development",
"test case generation",
"software",
"software development teams",
"agile software development",
"visualization tools",
"regression testing",
"agile methods"
] |
[
"verification and validation",
"software engineering",
"human computer interaction",
"software project",
"software architecture",
"computer science",
"software design",
"computer software maintenance",
"correlation analysis",
"software quality",
"object oriented programming",
"mathematics",
"computer programming"
] |
1,128
|
The latest implementations of commercial UNIX to offer mainframe style capacity management on enterprise servers include: AIX Workload Manager (WLM), HP-UX Process Resource Manager (PRM), Solaris Resource Manager (SRM), as well as SGI and Compaq. The ability to manage server capacity is achieved by making significant modifications to the standard UNIX operating system so that processes are inherently tied to specific users. Those users, in turn, are granted only a certain fraction of system resources. Resource usage is monitored and compared with each users grant to ensure that the assigned entitlement constraints are met. In this paper, we begin by clearing up some of the confusion that has surrounded the motivation and the terminology behind the new technology. The common theme across each of the commercial implementations is the introduction of the fair-share scheduler. After reviewing some potential performance pitfalls, we present capacity planning guidelines for migrating to automated UNIX resource management.
|
2022-09-04T07:43:41.794Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-PF-0006015",
"ArXiv": "cs/0006015",
"MAG": "1597868135",
"CorpusId": "1128",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/5af1863d8af9b0a26eceb1a511b0ed09b1988356
|
UNIX Resource Managers: Capacity Planning and Resource Issues
|
[
{
"authorId": "3257525",
"name": "N. Gunther"
}
] |
ArXiv
| 2,000
| 11
| 0
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Review"
] | 2000-06-08T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.PF/0006015",
"pages": null
}
|
[
"servers",
"operating systems"
] |
[
"servers",
"user centered designs",
"operating systems",
"computing resource",
"virtual resource"
] |
[
"virtual resource",
"operating systems",
"servers",
"computing resource",
"user centered designs"
] |
[
"network virtualization",
"virtual machines",
"computer science",
"world wide web",
"security of data",
"cloud computing",
"user interfaces",
"human engineering",
"network management",
"virtual networks",
"internet",
"computer security",
"computer systems",
"human computer interaction",
"network architecture",
"telecommunication networks",
"virtualizations",
"distributed computer systems",
"computer networks",
"telecommunication systems"
] |
1,130
|
The roots of ATLAS (Argonne Tandem-Linac Accelerator System) date back to the early 1960’s. Located at the Argonne National Laboratory, the accelerator has been designated a National User Facility, which focuses primarily on heavy-ion nuclear physics. Like the accelerator it services, the control system has been in a constant state of evolution. The present real-time portion of the control system is based on the commercial product Vsystem [1]. While Vsystem has always been capable of distributed I/O processing, the latest offering of this product provides for the use of relatively inexpensive PC hardware and software. This paper reviews the status of the ATLAS control system, and describes first experiences with PC distributed I/O.
|
2022-06-20T11:05:47.244Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-OH-0111017",
"ArXiv": "cs/0111017",
"MAG": "2144828614",
"CorpusId": "1130",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/a04ed1dda5a38740eb7d6cdecf415bd7bd9b5c96
|
First Experiences Integrating PC Distributed I/O Into Argonne's ATLAS Control System
|
[
{
"authorId": "93657165",
"name": "F. Munson"
},
{
"authorId": "2092099",
"name": "D. Quock"
},
{
"authorId": "29333964",
"name": "S. Dean"
},
{
"authorId": "144425614",
"name": "K. J. Eder"
}
] |
ArXiv
| 2,001
| 9
| 1
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Review"
] | 2001-11-08T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.OH/0111017",
"pages": null
}
|
[
"control systems",
"computer hardware",
"nuclear physics",
"software"
] |
[
"control systems",
"hardware accelerators",
"co-processors",
"nuclear physics",
"computer hardware",
"software"
] |
[
"control systems",
"computer hardware",
"co-processors",
"hardware accelerators",
"nuclear physics",
"software"
] |
[
"computer systems",
"computer science",
"field programmable gate array",
"program processors",
"sensor data fusion",
"parallel processing systems",
"microprocessor chips",
"sensors",
"signal processing",
"distributed systems",
"engineering",
"distributed computer systems"
] |
1,131
|
Let $\mathcal{P}$ be an $\mathcal{H}$-polytope in $\mathbb{R}^d$ with vertex set $V$. The vertex centroid is defined as the average of the vertices in $V$. We prove that computing the vertex centroid of an $\mathcal{H}$-polytope is #P-hard. Moreover, we show that even just checking whether the vertex centroid lies in a given halfspace is already #P-hard for $\mathcal{H}$-polytopes. We also consider the problem of approximating the vertex centroid by finding a point within an $\epsilon$ distance from it and prove this problem to be #P-easy by showing that given an oracle for counting the number of vertices of an $\mathcal{H}$-polytope, one can approximate the vertex centroid in polynomial time. We also show that any algorithm approximating the vertex centroid to \emph{any} ``sufficiently'' non-trivial (for example constant) distance, can be used to construct a fully polynomial approximation scheme for approximating the centroid and also an output-sensitive polynomial algorithm for the Vertex Enumeration problem. Finally, we show that for unbounded polyhedra the vertex centroid can not be approximated to a distance of $d^{{1/2}-\delta}$ for any fixed constant $\delta>0$.
|
2022-02-13T16:01:26.025Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0806-3456",
"ArXiv": "0806.3456",
"MAG": "2116637163",
"CorpusId": "1131",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/89eb7f5f317ac8c24393c3e9582756f60e08c0cf
|
On Computing the Vertex Centroid of a Polyhedron
|
[
{
"authorId": "1713245",
"name": "Khaled M. Elbassioni"
},
{
"authorId": "1782967",
"name": "Hans Raj Tiwary"
}
] |
ArXiv
| 2,008
| 8
| 1
| 0
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2008-06-20T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0806.3456",
"pages": null
}
|
[
"polynomial approximation",
"approximation scheme",
"vertex set"
] |
[
"adjacent vertices",
"polynomial approximation",
"approximation scheme",
"bhattacharyya coefficient",
"vertex set"
] |
[
"polynomial approximation",
"approximation scheme",
"adjacent vertices",
"bhattacharyya coefficient",
"vertex set"
] |
[
"graph theory",
"approximation algorithms",
"graph g",
"coloring",
"mean shift",
"object tracking",
"theoretical computer science",
"approximation theory",
"graphic methods",
"vector quantization",
"image segmentation",
"target tracking",
"object recognition",
"computer science",
"mathematics",
"image coding",
"image analysis",
"image processing",
"sensors",
"pattern recognition",
"computer imaging and vision",
"computer hardware",
"machine learning",
"artificial intelligence"
] |
1,133
|
We define a quantitative constraint language subsuming two calculi well-known in QSR (Qualitative Spatial Reasoning): Frank's cone-shaped and projection-based calculi of cardinal direction relations. We show how to solve a CSP (Constraint Satisfaction Problem) expressed in the language.
|
2022-06-20T10:41:11.235Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-AI-0409046",
"ArXiv": "cs/0409046",
"MAG": "1663348817",
"CorpusId": "1133",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/c56a7fced9a52efe159fa4f2c55e08c98db458fa
|
A TCSP-like decidable constraint language generalising existing cardinal direction relations
|
[
{
"authorId": "1715976",
"name": "A. Isli"
}
] |
ArXiv
| 2,004
| 22
| 0
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2004-09-24T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.AI/0409046",
"pages": null
}
|
[
"communicating sequential processes",
"constraint language",
"reasoning"
] |
[
"constraint language",
"reasoning",
"communicating sequential processes",
"constraint satisfaction problems (csp)",
"constraint networks"
] |
[
"constraint language",
"reasoning",
"communicating sequential processes",
"constraint networks",
"constraint satisfaction problems (csp)"
] |
[
"query languages",
"ontology",
"formal languages",
"formal methods",
"model checking",
"computer programming languages",
"computer programming",
"artificial intelligence",
"database systems",
"semantics",
"linguistics",
"formal languages and automata theory",
"formal logic",
"embedded systems",
"architecture verification and validation",
"computer science",
"computer systems",
"theoretical computer science",
"architecting",
"software architecture",
"software design",
"software engineering"
] |
1,134
|
We analyze the performance and scalabilty of algorithms for the solution of large optimization problems on high-performance parallel architectures. Our case study uses the GPCG (gradient projection, conjugate gradient) algorithm for solving bound-constrained convex quadratic problems. Our implementation of the GPCG algorithm within the Toolkit for Advanced Optimization (TAO) is available for a wide range of high-performance architectures and has been tested on problems with over 2.5 million variables. We analyze the performance as a function of the number of variables, the number of free variables, and the preconditioner. In addition, we discuss how the software design facilitates algorithmic comparisons.
|
2022-09-04T04:31:05.502Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-MS-0101018",
"ArXiv": "cs/0101018",
"MAG": "2950242496",
"CorpusId": "1134",
"PubMed": null,
"DOI": "10.1145/502800.502805",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/8f3899c8726d8316dabb2d5152be73a2a572b371
|
A case study in the performance and scalability of optimization algorithms
|
[
{
"authorId": "145033312",
"name": "S. Benson"
},
{
"authorId": "1763017",
"name": "L. McInnes"
},
{
"authorId": "144241870",
"name": "J. J. Moré"
}
] |
TOMS
| 2,001
| 37
| 39
| 2
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2001-01-19T00:00:00
|
{
"name": "ACM Trans. Math. Softw.",
"volume": "27",
"pages": "361-376"
}
|
[
"preconditioners",
"parallel architectures",
"software design",
"optimization",
"optimization problems"
] |
[
"optimization",
"optimization problems",
"parallel architectures",
"preconditioners",
"software",
"software design"
] |
[
"preconditioners",
"parallel architectures",
"software design",
"optimization",
"software",
"optimization problems"
] |
[
"linear systems",
"numerical methods",
"parallel processing systems",
"software engineering",
"mathematics",
"computer science",
"correlation analysis",
"matrix algebra",
"distributed systems",
"distributed computer systems",
"computer systems"
] |
1,135
|
There are many classes of mathematical problems which give rise to matrices, where a large number of the elements are zero. In this case it makes sense to have a special matrix type to handle this class of problems where only the non-zero elements of the matrix are stored. Not only does this reduce the amount of memory to store the matrix, but it also means that operations on this type of matrix can take advantage of the a-priori knowledge of the positions of the non-zero elements to accelerate their calculations. A matrix type that stores only the non-zero elements is generally called sparse.
Until recently Octave has lacked a full implementation of sparse matrices. This article address the implementation of sparse matrices within Octave, including their storage, creation, fundamental algorithms used, their implementations and the basic operations and functions implemented for sparse matrices. Mathematical issues such as the return types of sparse operations, matrix fill-in and reordering for sparse matrix factorization is discussed in the context of a real example.
Benchmarking of Octave's implementation of sparse operations compared to their equivalent in Matlab are given and their implications discussed. Results are presented for multiplication and linear algebra operations for various matrix orders and densities. Furthermore, the use of Octave's sparse matrix implementation is demonstrated using a real example of a finite element model (FEM) problem. Finally, the method of using sparse matrices with Octave's oct-files is discussed. The means of creating, using and returning sparse matrices within oct-files is discussed as well as the differences between Octave's Sparse and Array classes.
|
2022-08-20T00:29:14.742Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0604006",
"ArXiv": "cs/0604006",
"MAG": "1541926521",
"CorpusId": "1135",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/1d407cead445ca888570bfb9eb09fb3f835c1015
|
Sparse Matrix Implementation in Octave
|
[
{
"authorId": "2060491936",
"name": "David Bateman"
},
{
"authorId": "143722510",
"name": "A. Adler"
}
] |
ArXiv
| 2,006
| 22
| 5
| 2
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-04-03T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0604006",
"pages": null
}
|
[
"multiplication",
"sparse matrices",
"matrix factorizations",
"matlab"
] |
[
"sparse approximations",
"sparse matrices",
"matrix factorizations",
"factorization",
"matlab",
"multiplication",
"dense matrices",
"lu factorization",
"sparse recovery",
"hardware implementations",
"finite element method"
] |
[
"dense matrices",
"sparse recovery",
"matlab",
"matrix factorizations",
"multiplication",
"hardware implementations",
"lu factorization",
"factorization",
"finite element method",
"sparse approximations",
"sparse matrices"
] |
[
"matrix algebra",
"signal reconstruction",
"software",
"recommender systems",
"multiplying circuits",
"field programmable gate array",
"linear systems",
"mathematics",
"approximation algorithms",
"signal processing",
"computer science",
"information retrieval",
"adders",
"integrated circuit layout",
"digital signal processing",
"computer hardware",
"graph theory",
"approximation theory",
"engineering",
"vlsi circuits",
"digital arithmetic",
"computer aided design",
"microprocessor chips",
"theoretical computer science"
] |
1,136
|
We return to the study of the relation of query complexity and soundness in probabilistically checkable proofs.We present a PCP verifier for languages that are Unique-Games-Hard and such that the verifier makes q queries, has almost perfect completeness, and has soundness error at most 2q/2q+ε, for arbitrarily small ε>0. For values of q of the form 2t-1, the soundness error is (q+1)/2q+ε.Charikar et al. show that there is a constant c such that for every language that has a verifier of query complexity q, and a ratio of soundness error to completeness smaller than cq/2q is decidable in polynomial time. Up to the value of the multiplicative constant and to the validity of the Unique Games Conjecture, our result is therefore tight.As a corollary, we show that approximating the Maximum Independent Set problem in graphs of degree Δ within a factor better than Δ/(log Δ)c is Unique-Games-Hard for a certain constant c>0.Our main technical results are (i) a connection between the Gowers uniformity of a Boolean function and the influence of its variables and (ii) the proof that "Gowers uniform" functions pass the "hypergraph linearity test" approximately with the same probability of a random function. The connection between Gowers uniformity and influence might have other applications.
|
2022-09-04T23:11:53.120Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-math-0510264",
"ArXiv": "math/0510264",
"MAG": "1975810219",
"CorpusId": "1136",
"PubMed": null,
"DOI": "10.1145/1132516.1132519",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/494f5d8212653649a86c7e201f2b63319613f9ae
|
Gowers uniformity, influence of variables, and PCPs
|
[
{
"authorId": "1720588",
"name": "Alex Samorodnitsky"
},
{
"authorId": "145340992",
"name": "L. Trevisan"
}
] |
STOC '06
| 2,005
| 50
| 132
| 18
| true
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-10-12T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/math/0510264",
"pages": null
}
|
[
"boolean functions",
"probability"
] |
[
"bipartite graphs",
"boolean functions",
"probability",
"query results",
"query processing",
"keyword queries",
"formal proofs"
] |
[
"boolean functions",
"query results",
"bipartite graphs",
"query processing",
"probability",
"formal proofs",
"keyword queries"
] |
[
"mathematics",
"graph theory",
"search engines",
"query languages",
"formal verifications",
"formal logic",
"keyword search",
"theoretical computer science",
"world wide web",
"database systems",
"verification",
"artificial intelligence",
"computer science",
"internet",
"computer systems",
"verification and validation",
"software quality",
"software design",
"software engineering"
] |
1,137
|
The axiom of recovery, while capturing a central intuition regarding belief change, has been the source of much controversy. We argue briefly against putative counterexamples to the axiom— while agreeing that some of their insight deserves to be preserved— and present additional recovery-like axioms in a framework that uses epistemic states, which encode preferences, as the object of revisions. This makes iterated revision possible and makes explicit the connection between iterated belief change and the axiom of recovery. We provide a representation theorem that connects the semantic conditions we impose on iterated revision and the additional syntactical properties mentioned. We also show interesting similarities between our framework and that of Darwiche-Pearl [5]. In particular, we show that the intuitions underlying the controversial (C2) postulate are captured by the recovery axiom and our recovery-like postulates (the latter can be seen as weakenings of (C2).
|
2022-08-27T20:02:19.259Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-AI-0207038",
"ArXiv": "cs/0207038",
"MAG": "1622943935",
"CorpusId": "1137",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/596380a598b578791d1e8b2563317866f9b1c498
|
Iterated revision and the axiom of recovery: a unified treatment via epistemic states
|
[
{
"authorId": "39078644",
"name": "S. Chopra"
},
{
"authorId": "1695281",
"name": "A. Ghose"
},
{
"authorId": "144405105",
"name": "T. Meyer"
}
] |
NMR
| 2,002
| 20
| 6
| 0
| false
|
[
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2002-07-09T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.AI/0207038",
"pages": null
}
|
[
"semantics"
] |
[
"epistemic logic",
"user preferences",
"semantics",
"kripke semantics",
"syntactics"
] |
[
"kripke semantics",
"user preferences",
"syntactics",
"semantics",
"epistemic logic"
] |
[
"formal logic",
"user interfaces",
"computational linguistics",
"modal logic",
"model checking",
"multiagent system",
"artificial intelligence",
"human computer interaction",
"database systems",
"embedded systems",
"architecture verification and validation",
"computer science",
"computer systems",
"architecting",
"software architecture",
"software design",
"software engineering"
] |
1,138
|
This paper presents how the space of spheres and shelling may be used to delete a point from a $d$-dimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear number of times.
This algorithm may be viewed as a variation of Heller's algorithm, which is popular in the geographic information system community. Unfortunately, Heller algorithm is false, as explained in this paper.
|
2022-08-28T18:55:02.629Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CG-9907023",
"ArXiv": "cs/9907023",
"MAG": "2952826634",
"CorpusId": "1138",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/7f05c5a6f1701e42750d8c520d6c7ea8b514903f
|
On Deletion in Delaunay Triangulation
|
[
{
"authorId": "1702676",
"name": "O. Devillers"
}
] |
ArXiv
| 1,999
| 30
| 25
| 2
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 1999-07-16T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CG/9907023",
"pages": null
}
|
[
"geographical information system",
"geographic information system"
] |
[
"geo-spatial",
"geographic information system",
"geographical information system",
"information systems",
"adaptive algorithms"
] |
[
"information systems",
"geo-spatial",
"adaptive algorithms",
"geographical information system",
"geographic information system"
] |
[
"computer systems",
"software",
"computer science"
] |
1,141
|
The ``first passage-time'' (FPT) problem is an important problem with a wide range of applications in mathematics, physics, biology and finance. Mathematically, such a problem can be reduced to estimating the probability of a (stochastic) process first to reach a critical level or threshold. While in other areas of applications the FPT problem can often be solved analytically, in finance we usually have to resort to the application of numerical procedures, in particular when we deal with jump-diffusion stochastic processes (JDP). In this paper, we develop a Monte-Carlo-based methodology for the solution of the FPT problem in the context of a multivariate jump-diffusion stochastic process. The developed methodology is tested by using different parameters, the simulation results indicate that the developed methodology is much more efficient than the conventional Monte Carlo method. It is an efficient tool for further practical applications, such as the analysis of default correlation and predicting barrier options in finance.
|
2022-09-03T18:37:30.403Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0702163",
"ArXiv": "cs/0702163",
"MAG": "1700427658",
"CorpusId": "1141",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/cd672378edf3051d60c0f30c9e2039ebc2601518
|
First Passage Time for Multivariate Jump-diffusion Stochastic Models With Applications in Finance
|
[
{
"authorId": "2141082713",
"name": "Di Zhang"
},
{
"authorId": "48179399",
"name": "R. Melnik"
}
] |
ArXiv
| 2,007
| 21
| 5
| 0
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-02-28T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0702163",
"pages": null
}
|
[
"mathematics",
"stochastic processes",
"probability",
"stochastic process"
] |
[
"stochastic",
"stochastic processes",
"stochastic process",
"mathematics",
"probability"
] |
[
"stochastic processes",
"probability",
"stochastic process",
"stochastic",
"mathematics"
] |
[
"random processes",
"stochasticity",
"numerical model"
] |
1,142
|
Software development approaches that are based on modeling a system before performing the actual implementation work have a long history in computing. Among the first ones were data(base) modeling approaches using the Entity/Relationship model and similar other techniques. During further development, modeling techniques became increasingly complete, covering not only data aspects, but also structural/topological and behavioral aspects of systems. Typical representatives of such full-scale modeling approaches are structured methods, such as Structured Analysis & Design, or object-oriented methods like the UML [2].
|
2022-08-28T07:42:04.655Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-SE-0201023",
"ArXiv": "cs/0201023",
"MAG": "1790850838",
"CorpusId": "1142",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/66658c7f5c5ed35a55e15b5209e085b6ebe0e3bc
|
Model-Based Software Engineering and Ada: Synergy for the Development of Safety-Critical Systems
|
[
{
"authorId": "3310569",
"name": "A. Blotz"
},
{
"authorId": "2064446872",
"name": "Franz Huber"
},
{
"authorId": "3056870",
"name": "H. Lötzbeyer"
},
{
"authorId": "144658639",
"name": "A. Pretschner"
},
{
"authorId": "3094566",
"name": "O. Slotosch"
},
{
"authorId": "2480230",
"name": "H. Zängerl"
}
] |
Ada Deutschland Tagung
| 2,002
| 20
| 6
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Engineering",
"source": "external"
}
] |
[
"JournalArticle"
] | 2002-01-26T00:00:00
|
{
"name": null,
"volume": null,
"pages": "37-52"
}
|
[
"safety critical systems",
"unified modeling language",
"object oriented",
"software development",
"software engineering",
"software reengineering"
] |
[
"software",
"software engineering",
"software reengineering",
"software development",
"engineering",
"safety critical systems",
"unified modeling language"
] |
[
"safety critical systems",
"unified modeling language",
"engineering",
"object oriented",
"software development",
"software engineering",
"software",
"software reengineering"
] |
[
"formal methods",
"model checking",
"real time systems",
"security systems",
"object oriented programming",
"computer programming languages",
"software project",
"software architecture",
"computer science",
"reengineering",
"formal logic",
"embedded systems",
"architecture verification and validation",
"knowledge based systems",
"mobile robots",
"field programmable gate array",
"online systems",
"digital signal processing",
"security of data",
"cryptography",
"computer programming",
"software design",
"computer software maintenance",
"reverse engineering",
"artificial intelligence",
"computer systems",
"architecting",
"robotics",
"computer hardware",
"signal processing",
"computer security",
"cryptology"
] |
1,143
|
The potential benefits of multiple-antenna systems may be limited by two types of channel degradations-rank deficiency and spatial fading correlation of the channel. In this paper, we assess the effects of these degradations on the diversity performance of multiple-input multiple-output (MIMO) systems, with an emphasis on orthogonal space-time block codes (OSTBC), in terms of the symbol error probability (SEP), the effective fading figure (EFF), and the capacity at low signal-to-noise ratio (SNR). In particular, we consider a general family of MIMO channels known as double-scattering channels-i.e., Rayleigh product MIMO channels-which encompasses a variety of propagation environments from independent and identically distributed (i.i.d.) Rayleigh to degenerate keyhole or pinhole cases by embracing both rank-deficient and spatial correlation effects. It is shown that a MIMO system with transmit and receive antennas achieves the diversity of order in a double-scattering channel with effective scatterers. We also quantify the combined effect of the spatial correlation and the lack of scattering richness on the EFF and the low-SNR capacity in terms of the correlation figures of transmit, receive, and scatterer correlation matrices. We further show the monotonicity properties of these performance measures with respect to the strength of spatial correlation, characterized by the eigenvalue majorization relations of the correlation matrices.
|
2022-09-04T17:17:07.250Z
|
{
"ACL": null,
"DBLP": "journals/tit/ShinW08",
"ArXiv": "cs/0511028",
"MAG": "2137965246",
"CorpusId": "1143",
"PubMed": null,
"DOI": "10.1109/TIT.2008.924672",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/6ceb41ac820d74e9da9c1593e607609934cf7c42
|
MIMO Diversity in the Presence of Double Scattering
|
[
{
"authorId": "1686120",
"name": "Hyundong Shin"
},
{
"authorId": "1748878",
"name": "M. Win"
}
] |
IEEE Transactions on Information Theory
| 2,005
| 131
| 180
| 4
| true
|
[
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-11-06T00:00:00
|
{
"name": "IEEE Transactions on Information Theory",
"volume": "54",
"pages": "2976-2996"
}
|
[
"space-time block codes",
"signal to noise ratio",
"spatial correlations",
"receive antenna",
"mimo",
"mimo channel",
"eigenvalues",
"probability",
"low signal-to-noise ratio",
"mimo systems",
"multiple-input-multiple-output",
"snr"
] |
[
"mimo",
"multiple-input-multiple-output",
"mimo channel",
"multiple antenna",
"antennas",
"antenna systems",
"block codes",
"probability",
"snr",
"spatial correlations",
"low snr",
"eigenvalues"
] |
[
"space-time block codes",
"signal to noise ratio",
"spatial correlations",
"receive antenna",
"antennas",
"mimo",
"mimo channel",
"low snr",
"multiple-input-multiple-output",
"probability",
"low signal-to-noise ratio",
"multiple antenna",
"block codes",
"mimo systems",
"eigenvalues",
"antenna systems",
"snr"
] |
[
"signal processing",
"correlation methods",
"receiving antennas",
"wireless telecommunication systems",
"orthogonal frequency division multiplexing",
"mim devices",
"fading channels",
"channel capacity",
"matrix algebra",
"acoustic intensity",
"communication channels",
"mathematics",
"beamforming",
"multiplexing",
"transmitters",
"bit error rate",
"information theory",
"eigenvalues and eigenfunctions",
"antenna accessories",
"engineering",
"fading (radio)",
"computer networks",
"communication systems",
"telecommunication systems",
"signal receivers",
"communication",
"antenna arrays",
"signal detection",
"computer science",
"computer systems"
] |
1,144
|
Transitive text mining - also named Swanson Linking (SL) after its primary and principal researcher - tries to establish meaningful links between literature sets which are virtually disjoint in the sense that each does not mention the main concept of the other. If successful, SL may give rise to the development of new hypotheses. In this communication we describe our approach to transitive text mining which employs co-occurrence analysis of the medical subject headings (MeSH), the descriptors assigned to papers indexed in PubMed. In addition, we will outline the current state of our web-based information system which will enable our users to perform literature-driven hypothesis building on their own.
|
2022-08-25T00:38:01.069Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0509020",
"ArXiv": "cs/0509020",
"MAG": "1782031232",
"CorpusId": "1144",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/be46bb44f6bcdcd7fc75c94eba582f150addc627
|
Transitive Text Mining for Information Extraction and Hypothesis Generation
|
[
{
"authorId": "2576523",
"name": "J. Stegmann"
},
{
"authorId": "40556779",
"name": "G. Grohmann"
}
] |
ArXiv
| 2,005
| 19
| 5
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-09-07T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0509020",
"pages": null
}
|
[
"information extraction",
"information systems",
"descriptors",
"subject headings",
"communication",
"text mining"
] |
[
"text mining",
"information extraction",
"communication",
"subject headings",
"descriptors",
"information systems",
"natural language processing",
"association rules",
"text document",
"textual data",
"text data",
"text mining techniques",
"web mining",
"association mining",
"data mining",
"knowledge discovery"
] |
[
"information extraction",
"information systems",
"data mining",
"web mining",
"textual data",
"text mining techniques",
"association mining",
"descriptors",
"subject headings",
"natural language processing",
"association rules",
"knowledge discovery",
"communication",
"text document",
"text mining",
"text data"
] |
[
"information analysis",
"information retrieval",
"computer systems",
"computer science",
"search engines",
"associative processing",
"object recognition",
"image retrieval",
"abstracting and indexing",
"artificial intelligence",
"natural languages",
"knowledge acquisition",
"database systems",
"information retrieval systems",
"text processing",
"world wide web",
"machine learning",
"pattern recognition",
"image segmentation",
"image enhancement",
"linguistics",
"semantics",
"knowledge management",
"computational linguistics",
"internet",
"image analysis",
"image processing",
"knowledge based systems",
"computer imaging and vision"
] |
1,145
|
Evidence-based medicine is critically dependent on three sources of information: a medical knowledge base, the patient's medical record and knowledge of available resources, including where appropriate, clinical protocols. Patient data is often scattered in a variety of databases and may, in a distributed model, be held across several disparate repositories. Consequently addressing the needs of an evidence- based medicine community presents issues of biomedical data integration, clinical interpretation and knowledge management. This paper outlines how the Health-e-Child project has approached the challenge of requirements specification for (bio-) medical data integration, from the level of cellular data, through disease to that of patient and population. The approach is illuminated through the requirements elicitation and analysis of Juvenile Idiopathic Arthritis (JIA), one of three diseases being studied in the EC-funded Health- e-Child project.
|
2022-09-04T15:09:05.731Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0707-0763",
"ArXiv": "0707.0763",
"MAG": "2118994281",
"CorpusId": "1145",
"PubMed": null,
"DOI": "10.1109/IDEAS.2007.45",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/cf3f45c145dd8712a55e3f66c0dea1a4510ec91c
|
The Requirements for Ontologies in Medical Data Integration: A Case Study
|
[
{
"authorId": "145009642",
"name": "A. Anjum"
},
{
"authorId": "2625914",
"name": "P. Bloodsworth"
},
{
"authorId": "1706030",
"name": "A. Branson"
},
{
"authorId": "1738439",
"name": "T. Hauer"
},
{
"authorId": "144117518",
"name": "R. McClatchey"
},
{
"authorId": "1717157",
"name": "K. Munir"
},
{
"authorId": "1710508",
"name": "D. Rogulin"
},
{
"authorId": "1746962",
"name": "Jetendr Shamdasani"
}
] |
11th International Database Engineering and Applications Symposium (IDEAS 2007)
| 2,007
| 32
| 31
| 0
| false
|
[
{
"category": "Medicine",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-07-05T00:00:00
|
{
"name": "11th International Database Engineering and Applications Symposium (IDEAS 2007)",
"volume": null,
"pages": "308-314"
}
|
[
"data integration",
"ontology",
"requirements analysis",
"requirements specifications",
"cellular",
"patient data",
"database systems",
"knowledge management",
"knowledge base"
] |
[
"ontology",
"data integration",
"knowledge base",
"patient data",
"database systems",
"knowledge management",
"requirements specifications",
"requirements analysis",
"cellular"
] |
[
"data integration",
"requirements analysis",
"database systems",
"requirements specifications",
"cellular",
"patient data",
"ontology",
"knowledge management",
"knowledge base"
] |
[
"data handling",
"requirements engineering",
"computer systems",
"wireless",
"cellular telephone systems",
"cellular radio systems",
"hospital data processing",
"semantics",
"knowledge based systems",
"software engineering",
"computer science",
"radio",
"mobile computing",
"mobile telecommunication systems",
"communication channels",
"telecommunication traffic",
"signal to noise ratio",
"medical computing",
"hospital information system",
"artificial intelligence",
"wireless telecommunication systems",
"telecommunication networks",
"data communication systems",
"signal processing",
"medical images",
"information systems",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"image analysis",
"image processing",
"bioinformatics",
"computer imaging and vision"
] |
1,146
|
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a class of continuous real-time models of reactive systems for which efficient model-checking algorithms have been devised. In this paper, we show that these algorithms can very easily be prototyped in the ELAN system. This paper argues through this example that rewriting based systems relying on rules and strategies are a good framework to prototype, study and test rather efficiently symbolic model-checking algorithms, i.e. algorithms which involve combination of graph exploration rules, deduction rules, constraint solving techniques and decision procedures.
|
2022-09-02T01:05:27.706Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0907-3123",
"ArXiv": "0907.3123",
"MAG": "1614449700",
"CorpusId": "1146",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/21b7357106a157044a24ed7731bc13d91559c224
|
Verification of Timed Automata Using Rewrite Rules and Strategies
|
[
{
"authorId": "2972051",
"name": "E. Beffara"
},
{
"authorId": "1706341",
"name": "Olivier Bournez"
},
{
"authorId": "49282487",
"name": "Hassen Kacem"
},
{
"authorId": "144999756",
"name": "C. Kirchner"
}
] |
ArXiv
| 2,001
| 43
| 4
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2001-06-01T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0907.3123",
"pages": null
}
|
[
"verification",
"prototyping",
"reactive system",
"timed automata",
"model checking",
"decision procedure",
"symbolic model checking"
] |
[
"verification",
"timed automata",
"timed systems",
"automata",
"reactive system",
"decision procedure"
] |
[
"verification",
"prototyping",
"reactive system",
"timed automata",
"timed systems",
"model checking",
"decision procedure",
"symbolic model checking",
"automata"
] |
[
"verification and validation",
"software development",
"formal methods",
"real time systems",
"translation (languages)",
"embedded systems",
"architecture verification and validation",
"decision theory",
"computability and decidability",
"satisfiability",
"finite automata",
"formal languages",
"software quality",
"software project",
"software architecture",
"formal logic",
"knowledge based systems",
"object oriented programming",
"mobile robots",
"field programmable gate array",
"online systems",
"digital signal processing",
"computational linguistics",
"automata theory",
"linguistics",
"computer systems",
"architecting",
"artificial intelligence",
"graph theory",
"formal languages and automata theory",
"software design",
"computer programming",
"robotics",
"computer hardware",
"signal processing",
"database systems",
"computer science",
"theoretical computer science",
"software engineering",
"engineering"
] |
1,150
|
This article presents a cognitively oriented viewpoint on design. It focuses on cognitive, dynamic aspects of real design, that is, the actual cognitive activity implemented by designers during their work on professional design projects. Rather than conceiving designing as problem solving—Simon's symbolic information processing (SIP) approach—or as a reflective practice or some other form of situated activity—the situativity (SIT) approach—we consider that, from a cognitive viewpoint, designing is most appropriately characterised as a construction of representations. After a critical discussion of the SIP and SIT approaches to design, we present our viewpoint. This presentation concerns the evolving nature of representations regarding levels of abstraction and degrees of precision, the function of external representations, and specific qualities of representation in collective design. Designing is described at three levels: the organisation of the activity, its strategies, and its design-representation construction activities (different ways to generate, transform, and evaluate representations). Even if we adopt a "generic design" stance, we claim that design can take different forms depending on the nature of the artefact, and we propose some candidates for dimensions that allow a distinction to be made between these forms of design. We discuss the potential specificity of HCI design, and the lack of cognitive design research occupied with the quality of design. We close our discussion of representational structures and activities by an outline of some directions regarding their functional linkages.
|
2022-09-03T14:10:05.977Z
|
{
"ACL": null,
"DBLP": "journals/hhci/Visser06",
"ArXiv": "0711.1227",
"MAG": "1661156547",
"CorpusId": "1150",
"PubMed": null,
"DOI": "10.1207/s15327051hci2101_4",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/037abd406237f17236595ef9b2bfc1e98c1ba66e
|
Designing as Construction of Representations: A Dynamic Viewpoint in Cognitive Design Research
|
[
{
"authorId": "152968732",
"name": "W. Visser"
}
] |
Hum. Comput. Interact.
| 2,006
| 215
| 132
| 14
| true
|
[
{
"category": "Art",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-03-01T00:00:00
|
{
"name": "Human–Computer Interaction",
"volume": "21",
"pages": "103 - 152"
}
|
[
"viewpoint",
"sip",
"design projects"
] |
[
"viewpoint",
"design projects",
"sip",
"systems design",
"architecture designs"
] |
[
"systems design",
"architecture designs",
"viewpoint",
"sip",
"design projects"
] |
[
"intelligent control",
"intelligent systems",
"software architecture",
"internet telephony",
"product design",
"curricula",
"artificial intelligence",
"computer systems",
"software design",
"internet protocols",
"voice/data communication systems",
"packet networks",
"computer aided design",
"education",
"computer science",
"software engineering",
"telecommunication traffic",
"telecommunication services",
"wireless telecommunication systems",
"telecommunication networks",
"data communication systems",
"computer networks",
"communication systems",
"telecommunication systems"
] |
1,151
|
ATM networks are quickly being adopted as backbones over various parts of the Internet. This article studies the dynamics and performance of the TCP/IP protocol over the ABR and UBR services of ATM networks. Specifically the buffering requirements in the ATM switches as well as the ATM edge devices. It is shown that with a good switch algorithm, ABR pushes congestion to the edges of the ATM network while UBR leaves it inside the ATM portion. As a result, the switch ABR buffer requirement for zero-packet-loss high-throughput TCP transmission is a sublinear function of the number of TCP connections.
|
2022-09-04T12:32:39.362Z
|
{
"ACL": null,
"DBLP": "journals/cm/KalyanaramanJF98",
"ArXiv": "cs/9809073",
"MAG": "2139131027",
"CorpusId": "1151",
"PubMed": null,
"DOI": "10.1109/35.685383",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/6aa2b056e1e8fe3e33825c6519554f7d90d9c5f5
|
Performance and Buffering Requirements of Internet Protocols over ATM ABR and UBR Services
|
[
{
"authorId": "1694760",
"name": "S. Kalyanaraman"
},
{
"authorId": "145889709",
"name": "R. Jain"
},
{
"authorId": "1680676",
"name": "S. Fahmy"
},
{
"authorId": "49849663",
"name": "R. Goyal"
},
{
"authorId": "2146040503",
"name": "Seong-Cheol Kim"
}
] |
IEEE Commun. Mag.
| 1,998
| 48
| 46
| 0
| true
|
[
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1998-06-01T00:00:00
|
{
"name": "IEEE Commun. Mag.",
"volume": "36",
"pages": "152-157"
}
|
[
"tcp",
"internet protocols",
"tcp connections",
"congestion",
"internet",
"atm networks"
] |
[
"internet",
"internet protocols",
"atm networks",
"tcp",
"tcp connections",
"congestion",
"packet loss"
] |
[
"tcp",
"internet protocols",
"tcp connections",
"packet loss",
"congestion",
"internet",
"atm networks"
] |
[
"congestion control (communication)",
"wireless telecommunication systems",
"network protocols",
"telecommunication traffic",
"transmission control protocol",
"packet networks",
"computer science",
"packet switching",
"asynchronous transfer mode",
"digital communication systems",
"computer networks",
"communication systems",
"telecommunication systems",
"telecommunication networks",
"data communication systems",
"telecommunication services",
"bandwidth",
"communication channels",
"computer systems"
] |
1,152
|
This paper introduces the CondorJ2 cluster management system. Traditionally, cluster management systems such as Condor employ a process-oriented approach with little or no use of modern database system technology. In contrast, CondorJ2 employs a data-centric, 3-tier web-application architecture for all system functions (e.g., job submission, monitoring and scheduling; node configuration, monitoring and management, etc.) except for job execution. Employing a data-oriented approach allows the core challenge (i.e., managing and coordinating a large set of distributed computing resources) to be transformed from a relatively low-level systems problem into a more abstract, higher-level data management problem. Preliminary results suggest that CondorJ2’s use of standard 3-tier software represents a significant step forward to the design and implementation of large clusters (1,000 to 10,000 nodes).
|
2022-09-05T02:52:19.664Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0612137",
"ArXiv": "cs/0612137",
"MAG": "2949937196",
"CorpusId": "1152",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/1112c1cd0e7b0c96a1f5231bd1767603466d4300
|
Turning Cluster Management into Data Management; A System Overview
|
[
{
"authorId": "2064638314",
"name": "Eric Robinson"
},
{
"authorId": "1765659",
"name": "D. DeWitt"
}
] |
CIDR
| 2,006
| 13
| 22
| 4
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference",
"Review"
] | 2006-12-01T00:00:00
|
{
"name": null,
"volume": null,
"pages": "120-131"
}
|
[
"process-oriented",
"job execution",
"large clusters",
"computing resource",
"data management",
"software",
"database systems",
"distributed computing"
] |
[
"data management",
"database systems",
"web application",
"job execution",
"computing resource",
"software",
"large clusters"
] |
[
"process-oriented",
"web application",
"job execution",
"large clusters",
"computing resource",
"data management",
"software",
"database systems",
"distributed computing"
] |
[
"enterprise resource management",
"world wide web",
"job scheduling",
"cloud computing",
"map-reduce",
"cluster computing",
"information management",
"computer science",
"computer systems",
"distributed computer systems",
"administrative data processing",
"business process",
"internet",
"grid computing",
"software architecture patterns",
"program processors",
"parallel architectures",
"information technology",
"management information systems",
"information systems",
"parallel processing systems",
"software architecture",
"microprocessor chips",
"distributed systems",
"software design",
"computer hardware",
"software engineering"
] |
1,154
|
Seven colorful cyberflowers with quotations from diverse cultures and times are presented as a “hortus conclusus,” an enclosed garden. The tradition of enclosed gardens has rich meanings in cultures that reach back to pre-history. This “enclosed garden” embraces aspirations symbolized in gardens throughout the world: a paradise of peace and tranquility, the Garden of Eden, a utopia of brotherhood and sisterhood, the place we seek, yet a place of fullness that beckons us to reach ever higher. It celebrates the wide world of learning and culture nurtured at the university – the “Flowers of Learning” that guide us on our journey.
|
2022-01-27T16:23:01.451Z
|
{
"ACL": null,
"DBLP": "conf/siggraph/Verostko07",
"ArXiv": null,
"MAG": "2062829539",
"CorpusId": "1154",
"PubMed": null,
"DOI": "10.1145/1280120.1280254",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/d756208eb603b9dcc8ab2b657e880ad01e8daae3
|
Flowers of learning: "Hortus Conclusus"
|
[
{
"authorId": "2966215",
"name": "R. Verostko"
}
] |
SIGGRAPH '07
| 2,007
| 0
| 0
| 0
| false
|
[
{
"category": "Art",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-08-05T00:00:00
|
{
"name": null,
"volume": null,
"pages": "322"
}
|
[
"university"
] |
[
"online learning",
"university"
] |
[
"university",
"online learning"
] |
[
"education",
"online systems",
"computer systems",
"computer science"
] |
1,156
|
Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work (Halpern and Rêgo 2006, arxiv.org/abs/0704.2014), we proposed a framework for representing and analyzing games with possibly unaware players, and suggested a generalization of Nash equilibrium appropriate for games with unaware players that we called generalized Nash equilibrium. Here, we use this framework to analyze other solution concepts that have been considered in the game-theory literature, with a focus on sequential equilibrium.
|
2022-09-04T23:29:17.005Z
|
{
"ACL": null,
"DBLP": "journals/ijgt/RegoH12",
"ArXiv": "0707.1904",
"MAG": "2071230904",
"CorpusId": "1156",
"PubMed": null,
"DOI": "10.1145/1324249.1324283",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/176882e5fe31b48aa8e4f5e879c334605238db6e
|
Generalized solution concepts in games with possibly unaware players
|
[
{
"authorId": "2653922",
"name": "L. Rêgo"
},
{
"authorId": "1691828",
"name": "Joseph Y. Halpern"
}
] |
TARK '07
| 2,007
| 27
| 55
| 2
| true
|
[
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-06-25T00:00:00
|
{
"name": "International Journal of Game Theory",
"volume": "41",
"pages": "131-155"
}
|
[
"nash equilibrium",
"game theory",
"solution concepts",
"reasoning"
] |
[
"solution concepts",
"nash equilibrium",
"game theory",
"reasoning",
"computer games"
] |
[
"reasoning",
"game theory",
"solution concepts",
"computer games",
"nash equilibrium"
] |
[
"ontology",
"formal languages",
"artificial intelligence",
"multiagent system",
"interactive computer graphics",
"semantics",
"linguistics",
"formal languages and automata theory",
"computer science",
"user interfaces",
"computer imaging and vision",
"theoretical computer science",
"human computer interaction"
] |
1,159
|
Data privacy is one of the key challenges faced by enterprises today. Anonymization techniques address this problem by sanitizing sensitive data such that individual privacy is preserved while allowing enterprises to maintain and share sensitive data. However, existing work on this problem make inherent assumptions about the data that are impractical in day-to-day enterprise data management scenarios. Further, application of existing anonymization schemes on enterprise data could lead to adversarial attacks in which an intruder could use information fusion techniques to inflict a privacy breach. In this paper, we shed light on the shortcomings of current anonymization schemes in the context of enterprise data. We define and experimentally demonstrate Web-based Information-Fusion Attack on anonymized enterprise data. We formulate the problem of finding a fusion resilient enterprise data anonymization and propose a prototype solution to address this problem.
|
2022-09-02T01:00:55.327Z
|
{
"ACL": null,
"DBLP": "conf/icde/GantaA08",
"ArXiv": "0801.1715",
"MAG": "2100225756",
"CorpusId": "1159",
"PubMed": null,
"DOI": "10.1109/ICDEW.2008.4498326",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/c65380389480a9503c56b234353ecc092bc82082
|
On breaching enterprise data privacy through adversarial information fusion
|
[
{
"authorId": "2554473",
"name": "S. R. Ganta"
},
{
"authorId": "145046802",
"name": "R. Acharya"
}
] |
2008 IEEE 24th International Conference on Data Engineering Workshop
| 2,008
| 34
| 6
| 0
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2008-01-10T00:00:00
|
{
"name": "2008 IEEE 24th International Conference on Data Engineering Workshop",
"volume": null,
"pages": "246-249"
}
|
[
"sensitive informations",
"data privacy",
"anonymization",
"privacy",
"individual privacy",
"data fusion",
"data management",
"fusion techniques",
"data anonymization"
] |
[
"enterprise information system",
"data privacy",
"privacy",
"individual privacy",
"data fusion",
"fusion techniques",
"anonymization",
"data anonymization",
"sensitive informations",
"data management",
"privacy protection",
"privacy and security"
] |
[
"sensitive informations",
"data privacy",
"anonymization",
"privacy protection",
"privacy",
"individual privacy",
"data fusion",
"privacy and security",
"data management",
"enterprise information system",
"fusion techniques",
"data anonymization"
] |
[
"access control",
"network security",
"privacy preserving",
"cryptography",
"computer security",
"sensors",
"information management",
"information systems",
"biometrics",
"image fusion",
"fusion reactions",
"nuclear physics",
"k-anonymity",
"computer networks",
"data mining",
"cryptology",
"computer science",
"computer hardware",
"information technology",
"database systems",
"computer systems",
"imaging systems",
"image enhancement",
"sensor data fusion",
"wavelet transforms",
"image reconstruction",
"image analysis",
"image processing",
"signal processing",
"mathematics",
"computer imaging and vision",
"engineering"
] |
1,160
|
In this paper we present an application of explanation-based learning (EBL) in the parsing module of a real-time English-Spanish machine translation system designed to translate closed captions. We discuss the efficiency/coverage trade-offs available in EBL and introduce the techniques we use to increase coverage while maintaining a high level of space and time efficiency. Our performance results indicate that this approach is effective.
|
2022-02-24T20:12:34.994Z
|
{
"ACL": "1999.tmi-1.16",
"DBLP": "journals/corr/cs-CL-9907008",
"ArXiv": "cs/9907008",
"MAG": "1629751244",
"CorpusId": "1160",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/1a22929e22a0c7591592d891a7476ca28cb3c2da
|
Explanation-based learning for Machine Translation
|
[
{
"authorId": "34565751",
"name": "J. Toole"
},
{
"authorId": "2822470",
"name": "F. Popowich"
},
{
"authorId": "49369272",
"name": "D. Nicholson"
},
{
"authorId": "2854524",
"name": "D. Turcato"
},
{
"authorId": "40110037",
"name": "P. McFetridge"
}
] |
TMI
| 1,999
| 13
| 5
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1999-07-06T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CL/9907008",
"pages": null
}
|
[
"parsing algorithm",
"machine translations"
] |
[
"machine translations",
"computational efficiency",
"trade",
"online learning",
"statistical machine translation"
] |
[
"trade",
"machine translations",
"parsing algorithm",
"online learning",
"computational efficiency",
"statistical machine translation"
] |
[
"commerce",
"natural language processing",
"translation (languages)",
"information theory",
"computational linguistics",
"formal languages",
"online systems",
"theoretical computer science",
"speech transmission",
"statistical methods",
"economics",
"artificial intelligence",
"natural languages",
"automata theory",
"linguistics",
"communication",
"database systems",
"formal languages and automata theory",
"computer systems",
"computer science",
"speech communication",
"correlation analysis",
"semantics",
"mathematics"
] |
1,161
|
Byzantine Agreement introduced in [Pease, Shostak, Lamport, 80] is a widely used building block of reliable distributed protocols. It simulates broadcast despite the presence of faulty parties within the network, traditionally using only private unicast links. Under such conditions, Byzantine Agreement requires more than 2/3 of the parties to be compliant. [Fitzi, Maurer, 00], constructed a Byzantine Agreement protocol for any compliant majority based on an additional primitive allowing transmission to any two parties simultaneously. They proposed a problem of generalizing these results to wider channels and fewer compliant parties. We prove that 2f < kh condition is necessary and sufficient for implementing broadcast with h compliant and f faulty parties using k-cast channels.
|
2022-09-04T11:04:34.249Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-DC-0012024",
"ArXiv": "cs/0012024",
"MAG": "1523836687",
"CorpusId": "1161",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/87c88e063eac5c0565b5cf77e492cdc5b4b61c1f
|
Byzantine Agreement with Faulty Majority using Bounded Broadcast
|
[
{
"authorId": "2071997059",
"name": "Jeffrey Considine"
},
{
"authorId": "27941605",
"name": "L. Levin"
},
{
"authorId": "4863025",
"name": "D. Metcalf"
}
] |
ArXiv
| 2,000
| 18
| 6
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2000-12-26T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.DC/0012024",
"pages": null
}
|
[
"broadcast",
"unicast"
] |
[
"byzantine failures",
"byzantine fault",
"broadcast",
"unicast",
"multicast traffic"
] |
[
"broadcast",
"byzantine failures",
"byzantine fault",
"multicast traffic",
"unicast"
] |
[
"ad hoc networks",
"broadcasting",
"fault tolerance",
"multicasts",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"routing algorithms",
"sensors",
"communication channels",
"software quality",
"fault tolerant computer systems",
"wireless telecommunication systems",
"telecommunication networks",
"bandwidth",
"data communication systems",
"telecommunication traffic",
"local area networks",
"computer networks",
"computer hardware",
"software design",
"distributed computer systems",
"communication systems",
"telecommunication systems",
"computer systems",
"computer science",
"software engineering"
] |
1,162
|
This paper studies the potential of identifying lexical paraphrases within a single corpus, focusing on the extraction of verb paraphrases. Most previous approaches detect individual paraphrase instances within a pair (or set) of comparable corpora, each of them containing roughly the same information, and rely on the substantial level of correspondence of such corpora. We present a novel method that successfully detects isolated paraphrase instances within a single corpus without relying on any a-priori structure and information. A comparison suggests that an instance-based approach may be combined with a vector based approach in order to assess better the paraphrase likelihood for many verb pairs.
|
2022-09-04T22:42:18.644Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CL-0312058",
"ArXiv": "cs/0312058",
"MAG": "1659776892",
"CorpusId": "1162",
"PubMed": null,
"DOI": "10.1075/cilt.260.09gli",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/0ecdb316ed5d1dcbe50c9256037eb5ebef625c58
|
Acquiring lexical paraphrases from a single corpus
|
[
{
"authorId": "2807469",
"name": "Oren Glickman"
},
{
"authorId": "7465342",
"name": "Ido Dagan"
}
] |
RANLP
| 2,003
| 15
| 24
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2003-12-25T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CL/0312058",
"pages": null
}
|
[] |
[
"parallel text",
"parallel corpora",
"syntactics",
"user information",
"information extraction"
] |
[
"information extraction",
"parallel corpora",
"user information",
"syntactics",
"parallel text"
] |
[
"natural language processing",
"data mining",
"information analysis",
"information retrieval",
"statistical machine translation",
"machine translations",
"recommender systems",
"personal information",
"computational linguistics",
"artificial intelligence",
"natural languages",
"computer science",
"database systems",
"information systems",
"speech transmission",
"statistical methods",
"translation (languages)",
"information theory",
"privacy",
"linguistics",
"semantics",
"computer systems",
"speech communication",
"correlation analysis",
"automata theory",
"communication",
"computer security",
"mathematics",
"formal languages and automata theory",
"theoretical computer science"
] |
1,163
|
Recently, various side-channel attacks on widely used encryption methods have been discovered. Extensive research is currently undertaken to develop new types of combined encryption and authentication mechanisms. Developers of security systems ask whether to implement methods recommended by international standards or to choose one of the new proposals. We explain the nature of the attacks and how they can be avoided, and recommend a sound, provably secure solution: the CCM standard.
|
2022-06-20T11:51:03.350Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0611050",
"ArXiv": "cs/0611050",
"MAG": "1679021467",
"CorpusId": "1163",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/f0cab00ab35e503640b61b846d86b0cd0f475726
|
HowTo Authenticate and Encrypt
|
[
{
"authorId": "39427631",
"name": "H. Thomann"
}
] |
ArXiv
| 2,006
| 31
| 0
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-11-13T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0611050",
"pages": null
}
|
[
"encryption",
"side channel attack",
"authentication protocols",
"security systems",
"provable security"
] |
[
"authentication",
"encryption",
"side channel attack",
"authentication protocols",
"security systems"
] |
[
"authentication",
"side channel attack",
"encryption",
"authentication protocols",
"security systems",
"provable security"
] |
[
"security of data",
"smart cards",
"cryptography",
"network security",
"computer security",
"cryptology",
"computer networks",
"computer science"
] |
1,164
|
In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson cluster process on the plane. We derive the distributional properties of the interference and provide upper and lower bounds for its distribution. We consider the probability of successful transmission in an interference-limited channel when fading is modeled as Rayleigh. We provide a numerically integrable expression for the outage probability and closed-form upper and lower bounds. We show that when the transmitter-receiver distance is large, the success probability is greater than that of a Poisson arrangement. These results characterize the performance of the system under geographical or MAC-induced clustering. We obtain the maximum intensity of transmitting nodes for a given outage constraint, i.e., the transmission capacity (of this spatial arrangement) and show that it is equal to that of a Poisson arrangement of nodes. For the analysis, techniques from stochastic geometry are used, in particular the probability generating functional of Poisson cluster processes, the Palm characterization of Poisson cluster processes, and the Campbell-Mecke theorem.
|
2022-09-05T00:02:53.665Z
|
{
"ACL": null,
"DBLP": "journals/tit/GantiH09",
"ArXiv": "0706.2434",
"MAG": "2143252188",
"CorpusId": "1164",
"PubMed": null,
"DOI": "10.1109/TIT.2009.2025543",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/088f712bc79e04ccc070fe1d2fcf3c603582a3c5
|
Interference and Outage in Clustered Wireless Ad Hoc Networks
|
[
{
"authorId": "10263373",
"name": "R. Ganti"
},
{
"authorId": "1736038",
"name": "M. Haenggi"
}
] |
IEEE Transactions on Information Theory
| 2,007
| 37
| 364
| 41
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-06-16T00:00:00
|
{
"name": "IEEE Transactions on Information Theory",
"volume": "55",
"pages": "4067-4086"
}
|
[
"transmission capacities",
"poisson point process",
"probability",
"wireless",
"outages",
"clustering algorithms",
"ad hoc networks",
"stochastic geometry",
"wireless networks",
"outage probability"
] |
[
"outages",
"outage probability",
"wireless",
"wireless networks",
"ad hoc networks",
"poisson point process",
"stochastic geometry",
"probability",
"closed-form expression",
"transmitters",
"mac protocol",
"clustering algorithms",
"transmission capacities",
"stochastic",
"geometry"
] |
[
"transmitters",
"transmission capacities",
"poisson point process",
"closed-form expression",
"geometry",
"probability",
"wireless",
"mac protocol",
"outages",
"clustering algorithms",
"ad hoc networks",
"stochastic geometry",
"stochastic",
"wireless networks",
"outage probability"
] |
[
"signal receivers",
"antennas",
"multiplexing",
"wireless ad hoc networks",
"rayleigh fading",
"bit error rate",
"mathematics",
"radio",
"medium access control",
"wireless telecommunication systems",
"fading (radio)",
"fading channels",
"data mining",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"stochastic processes",
"stochasticity",
"wireless communications",
"packet networks",
"communication channels",
"signal to noise ratio",
"signal detection",
"telecommunication networks",
"network protocols",
"computer networks",
"communication systems",
"telecommunication systems",
"computer science",
"telecommunication traffic",
"bandwidth",
"local area networks",
"data communication systems",
"computer hardware",
"numerical model",
"signal processing",
"internet",
"computer systems",
"engineering"
] |
1,168
|
We present a hierarchical method for segmenting text areas in natural images. The method assumes that the text is written with a contrasting color on a more or less uniform background. No assumption is made regarding the language or character set used to write the text. In particular, the text can contain simple graphics or symbols. The key feature of our approach is that we first concentrate on finding the background of the text, before testing whether there is actually text on the background. Since uniform areas are easy to find in natural images, and since text backgrounds define areas which contain "holes" (where the text is written) we thus look for uniform areas containing "holes" and label them as text backgrounds candidates. Each candidate area is then further tested for the presence of text within its convex hull. We tested our method on a database of 65 images including English and Urdu text. The method correctly segmented all the text areas in 63 of these images, and in only 4 of these were areas that do not contain text also segmented.
|
2022-09-03T05:41:21.185Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0801-4807",
"ArXiv": "0801.4807",
"MAG": "2100587279",
"CorpusId": "1168",
"PubMed": null,
"DOI": "10.1109/ICIP.2008.4712475",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/19b0ed9b64a3e975dc6690d3cdefa90120dd4d51
|
Automatic text area segmentation in natural images
|
[
{
"authorId": "1735260",
"name": "Syed Ali Raza Jafri"
},
{
"authorId": "144152688",
"name": "M. Boutin"
},
{
"authorId": "1741483",
"name": "E. Delp"
}
] |
2008 15th IEEE International Conference on Image Processing
| 2,008
| 9
| 14
| 1
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2008-01-30T00:00:00
|
{
"name": "2008 15th IEEE International Conference on Image Processing",
"volume": null,
"pages": "3196-3199"
}
|
[
"database systems",
"character sets"
] |
[
"text document",
"textual data",
"text data",
"database systems",
"color images",
"noisy image",
"high resolution image",
"reference image",
"digital image",
"image pairs"
] |
[
"textual data",
"digital image",
"character sets",
"image pairs",
"reference image",
"high resolution image",
"noisy image",
"database systems",
"text document",
"color images",
"text data"
] |
[
"text mining",
"image analysis",
"image processing",
"character recognition",
"image matching",
"imaging systems",
"image quality",
"superresolution",
"image denoising",
"edge detection",
"de-noising",
"computer systems",
"information retrieval systems",
"pattern recognition",
"color image processing",
"text processing",
"computer imaging and vision",
"image reconstruction",
"optical resolving power",
"image enhancement",
"wavelet transforms",
"spurious signal noise",
"statistical methods",
"image segmentation",
"computer science",
"information retrieval",
"machine learning",
"natural language processing",
"computational linguistics",
"data mining",
"mathematics",
"communication channels",
"signal to noise ratio",
"correlation analysis",
"artificial intelligence",
"natural languages",
"wireless telecommunication systems",
"signal processing",
"linguistics",
"semantics",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering"
] |
1,170
|
This article gives an impression of how existing RDFS based Semantic Web knowledge Web services can already now be integrated in the creation process of semantic nets in MS Visio with SemTalk. We present two examples: looking up object names in WordNet and using Ontobroker as an inference engine on ECCMA ontologies. This article shows how different 2D visualization techniques such as DAMLVisio or simple Visio shapes can be applied to Semantic Web models in order to address a broad range of users with very different expectations of the notation.
|
2022-07-01T05:03:56.655Z
|
{
"ACL": null,
"DBLP": "conf/iv/FilliesS02",
"ArXiv": null,
"MAG": "2157494798",
"CorpusId": "1170",
"PubMed": null,
"DOI": "10.1109/IV.2002.1028811",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/28b4345c820f9096c80eeb335f493dccac54a8a7
|
On visualizing the Semantic Web in MS office
|
[
{
"authorId": "2270373",
"name": "Christian Fillies"
},
{
"authorId": "1401813995",
"name": "York Sure-Vetter"
}
] |
Proceedings Sixth International Conference on Information Visualisation
| 2,002
| 20
| 5
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2002-11-07T00:00:00
|
{
"name": "Proceedings Sixth International Conference on Information Visualisation",
"volume": null,
"pages": "441-446"
}
|
[
"wordnet",
"semantic web",
"inference engines",
"visualization tools",
"semantics",
"ontology"
] |
[
"semantics",
"semantic web",
"ontology",
"wordnet",
"inference",
"inference engines",
"engine",
"visualization",
"visualization tools",
"web ontology language",
"semantic web services",
"domain ontologies",
"semantic information",
"syntactics",
"world wide web",
"web content",
"web information",
"ajax"
] |
[
"world wide web",
"semantic information",
"wordnet",
"inference",
"ontology",
"semantic web",
"ajax",
"visualization",
"web ontology language",
"domain ontologies",
"syntactics",
"semantic web services",
"visualization tools",
"semantics",
"web content",
"web information",
"inference engines",
"engine"
] |
[
"internet",
"lexical database",
"lexical semantics",
"javascript",
"web 2.0",
"web application",
"user interfaces",
"human computer interaction",
"description logic",
"computational linguistics",
"information theory",
"search engines",
"information technology",
"linguistics",
"artificial intelligence",
"engineering",
"computer science",
"natural language processing",
"scripting languages",
"formal logic",
"knowledge representation",
"formal languages",
"database systems",
"communication",
"natural languages",
"high level languages",
"knowledge based systems",
"formal languages and automata theory",
"computer systems",
"computer programming",
"theoretical computer science"
] |
1,171
|
Imagination is the critical point in developing of realistic artificial intelligence (AI) systems. One way to approach imagination would be simulation of its properties and operations. We developed two models: AI-Brain Network Hierarchy of Languages and Semantical Holographic Calculus as well as simulation system ScriptWriter that emulate the process of imagination through an automatic animation of English texts. The purpose of this paper is to demonstrate the model and to present ScriptWriter system this http URL&M=application/x-gtar for simulation of the imagination.
|
2022-06-20T11:15:03.891Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0606020",
"ArXiv": "cs/0606020",
"MAG": "1666292924",
"CorpusId": "1171",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/24cbd403d39719c37fe0f2f0c92973aba47e3bcb
|
Imagination as Holographic Processor for Text Animation
|
[
{
"authorId": "1694611",
"name": "V. Astakhov"
},
{
"authorId": "2060328037",
"name": "T. Astakhova"
},
{
"authorId": "2058627028",
"name": "B. Sanders"
}
] |
ArXiv
| 2,006
| 13
| 0
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-06-05T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0606020",
"pages": null
}
|
[
"http",
"artificial intelligence"
] |
[
"computer generated holograms",
"artificial intelligence",
"intelligent systems",
"expert systems",
"hierarchical structures"
] |
[
"hierarchical structures",
"expert systems",
"artificial intelligence",
"http",
"intelligent systems",
"computer generated holograms"
] |
[
"hierarchical system",
"computer science",
"servers",
"client server computer systems",
"internet protocols",
"computer systems",
"spatial light modulators",
"electron holography",
"reconstructed image",
"optical testing",
"world wide web",
"security of data",
"telecommunication traffic",
"multimedia systems",
"distributed computer systems",
"data communication systems",
"database systems",
"user interfaces",
"light modulation",
"optical data processing",
"holographic interferometry",
"image reconstruction",
"internet",
"computer security",
"telecommunication networks",
"human computer interaction",
"fiber optic networks",
"light transmission",
"imaging systems",
"image analysis",
"image processing",
"telecommunication systems",
"computer networks",
"optical fibers",
"computer imaging and vision",
"sensors",
"computer hardware"
] |
1,172
|
To protect sensitive information in a cross-tabulated table, it is a common practice to suppress some of the cells in the table. An analytic invariant is a power series in terms of the suppressed cells that has a unique feasible value and a convergence radius equal to $+\infty$. Intuitively, the information contained in an invariant is not protected even though the values of the suppressed cells are not disclosed. This paper gives an optimal linear-time algorithm for testing whether there exist nontrivial analytic invariants in terms of the suppressed cells in a given set of suppressed cells. This paper also presents NP-completeness results and an almost linear-time algorithm for the problem of suppressing the minimum number of cells in addition to the sensitive ones so that the resulting table does not leak analytic-invariant information about a given set of suppressed cells.
|
2022-08-28T10:42:04.475Z
|
{
"ACL": null,
"DBLP": "journals/siamcomp/Kao97",
"ArXiv": "cs/0101032",
"MAG": "2037550653",
"CorpusId": "1172",
"PubMed": null,
"DOI": "10.1137/S0097539793253589",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/75b46606c70efd525aa71ed493cb1edc317afab8
|
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
|
[
{
"authorId": "1704494",
"name": "M. Kao"
}
] |
SIAM J. Comput.
| 1,997
| 36
| 12
| 0
| true
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 1997-02-01T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CR/0101032",
"pages": null
}
|
[
"sensitive informations"
] |
[
"scale invariant",
"user information",
"polynomial space",
"adaptive algorithms",
"hybrid algorithms"
] |
[
"sensitive informations",
"scale invariant",
"hybrid algorithms",
"polynomial space",
"user information",
"adaptive algorithms"
] |
[
"privacy",
"access control",
"network security",
"descriptors",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"polynomial approximation",
"exact algorithms",
"recommender systems",
"personal information",
"software",
"computer security",
"cryptography",
"computer networks",
"object recognition",
"image retrieval",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"graph theory",
"approximation algorithms",
"information retrieval",
"computer science",
"cryptology",
"pattern recognition",
"image segmentation",
"image enhancement",
"database systems",
"artificial intelligence",
"correlation analysis",
"mathematics",
"theoretical computer science",
"approximation theory",
"machine learning",
"image analysis",
"image processing",
"computer systems",
"computer imaging and vision"
] |
1,174
|
In this paper, we introduce two deterministic models aimed at capturing the dynamics of congested Internet connections. The first model is a continuous-time model that combines a system of differential equations with a sudden change in one of the state variables. The second model is a discrete-time model with a time step that arises naturally from the system. Results from these models show good agreement with the well-known ns network simulator, better than the results of a previous, similar model. This is due in large part to the use of the sudden change to reflect the impact of lost data packets. We also discuss the potential use of this model in network traffic state estimation.
|
2022-09-02T12:02:01.532Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-NI-0409022",
"ArXiv": "cs/0409022",
"MAG": "1619647493",
"CorpusId": "1174",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/5efe6ee5d412ee5e7f124c76651c53d29ce87fb4
|
Two Models for the Study of Congested Internet Connections
|
[
{
"authorId": "3000630",
"name": "I. Frommer"
},
{
"authorId": "36120571",
"name": "E. Harder"
},
{
"authorId": "1868698",
"name": "B. Hunt"
},
{
"authorId": "2275775",
"name": "R. Lance"
},
{
"authorId": "144596753",
"name": "E. Ott"
},
{
"authorId": "9861772",
"name": "J. Yorke"
}
] |
ArXiv
| 2,004
| 19
| 7
| 3
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2004-09-13T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.NI/0409022",
"pages": null
}
|
[
"network traffic",
"continuous time",
"discrete-time model",
"deterministic models",
"differential equations",
"internet",
"data packet"
] |
[
"congestion",
"internet",
"deterministic",
"deterministic models",
"continuous time",
"discrete-time",
"differential equations",
"data packet",
"network traffic"
] |
[
"network traffic",
"discrete-time model",
"continuous time",
"discrete-time",
"deterministic models",
"deterministic",
"congestion",
"differential equations",
"internet",
"data packet"
] |
[
"telecommunication traffic",
"intrusion detection",
"network security",
"continuous time systems",
"discrete time control systems",
"stochastic processes",
"stochastic",
"congestion control (communication)",
"numerical methods",
"computer science",
"mobile ad hoc networks",
"wireless sensor networks",
"telecommunication networks",
"computer crime",
"cryptography",
"computer networks",
"linear systems",
"linear matrix inequalities",
"nonlinear control systems",
"probability",
"stochasticity",
"mathematics",
"ad hoc networks",
"routing protocols",
"wireless communications",
"energy utilization",
"sensor nodes",
"routing algorithms",
"telecommunication systems",
"security of data",
"cryptology",
"matrix algebra",
"adaptive control systems",
"feedback systems",
"control theory",
"numerical model",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"sensors",
"wireless telecommunication systems",
"electricity",
"computer systems",
"computer security",
"process control",
"bandwidth",
"communication channels",
"local area networks",
"data communication systems",
"computer hardware",
"communication systems",
"engineering",
"automation"
] |
1,177
|
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared rows, maximize the number of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize the number of pieces placed before the game ends. We furthermore show the extreme inapproximability of the first and last of these objectives to within a factor of p1-Ɛ, when given a sequence of p pieces, and the inapproximability of the third objective to within a factor of 2-Ɛ, for any Ɛ > 0. Our results hold under several variations on the rules of Tetris, including different models of rotation, limitations on player agility, and restricted piecesets.
|
2022-09-04T21:31:20.145Z
|
{
"ACL": null,
"DBLP": "conf/cocoon/DemaineHL03",
"ArXiv": "cs/0210020",
"MAG": "2952045762",
"CorpusId": "1177",
"PubMed": null,
"DOI": "10.1142/S0218195904001354",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/b88dc6683539b721f6848855052830af9a0ecdc1
|
Tetris is hard, even to approximate
|
[
{
"authorId": "2336853",
"name": "Ron Breukelaar"
},
{
"authorId": "1727384",
"name": "E. Demaine"
},
{
"authorId": "1808829",
"name": "S. Hohenberger"
},
{
"authorId": "1806151",
"name": "H. J. Hoogeboom"
},
{
"authorId": "1680388",
"name": "W. Kosters"
},
{
"authorId": "1397896615",
"name": "D. Liben-Nowell"
}
] |
Int. J. Comput. Geom. Appl.
| 2,002
| 35
| 182
| 12
| true
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2002-10-21T00:00:00
|
{
"name": "Int. J. Comput. Geom. Appl.",
"volume": "14",
"pages": "41-68"
}
|
[
"computer games"
] |
[
"computer games",
"gameplay",
"videogames",
"sub-arrays",
"integrality gaps"
] |
[
"videogames",
"gameplay",
"integrality gaps",
"computer games",
"sub-arrays"
] |
[
"human computer interaction",
"game design",
"combinatorial optimization",
"polynomial approximation",
"approximation ratios",
"game theory",
"interactive computer graphics",
"direction of arrival",
"computer science",
"optimization",
"graph theory",
"approximation algorithms",
"artificial intelligence",
"user interfaces",
"computer imaging and vision",
"antenna arrays",
"sensors",
"mathematics",
"theoretical computer science",
"approximation theory",
"communication channels",
"antennas",
"signal to noise ratio",
"matrix algebra",
"computer hardware",
"wireless telecommunication systems",
"signal processing",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"computer systems"
] |
1,178
|
A statistical model for segmentation and word discovery in continuous speech is presented. An incremental unsupervised learning algorithm to infer word boundaries based on this model is described. Results are also presented of empirical tests showing that the algorithm is competitive with other models that have been used for similar tasks.
|
2022-09-05T01:40:32.951Z
|
{
"ACL": "J01-3002",
"DBLP": "journals/coling/Venkataraman01",
"ArXiv": "cs/0111065",
"MAG": "2951577017",
"CorpusId": "1178",
"PubMed": null,
"DOI": "10.1162/089120101317066113",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/9048314823da03b3e24c5721a601e66bae2acc07
|
A Statistical Model for Word Discovery in Transcribed Speech
|
[
{
"authorId": "34847166",
"name": "A. Venkataraman"
}
] |
Computational Linguistics
| 2,001
| 30
| 124
| 15
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2001-09-01T00:00:00
|
{
"name": "Computational Linguistics",
"volume": "27",
"pages": "351-372"
}
|
[
"unsupervised learning",
"correlation analysis",
"continuous speech"
] |
[
"correlation analysis",
"continuous speech",
"unsupervised learning",
"stochastic processes",
"unsupervised learning method"
] |
[
"unsupervised learning method",
"correlation analysis",
"stochastic processes",
"unsupervised learning",
"continuous speech"
] |
[
"mathematics",
"probability",
"clustering algorithms",
"continuous speech recognition",
"data mining",
"computational linguistics",
"speech communication",
"hidden markov models",
"hidden markov model (hmm)",
"computer science",
"database systems",
"linguistics",
"markov processes",
"computer systems"
] |
1,179
|
Irreducible frequent patters (IFPs) are introduced for transactional databases. An IFP is such a frequent pattern (FP),(x1,x2,...xn), the probability of which, P(x1,x2,...xn), cannot be represented as a product of the probabilities of two (or more) other FPs of the smaller lengths. We have developed an algorithm for searching IFPs in transactional databases. We argue that IFPs represent useful tools for characterizing the transactional databases and may have important applications to bio-systems including the immune systems and for improving vaccination strategies. The effectiveness of the IFPs approach has been illustrated in application to a classification problem.
|
2022-08-30T09:06:32.027Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0512054",
"ArXiv": "cs/0512054",
"MAG": "1761509848",
"CorpusId": "1179",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/e94c1bd60a1b58d2f4c8d9326e45c205374d9c05
|
Irreducible Frequent Patterns in Transactional Databases
|
[
{
"authorId": "145465904",
"name": "G. Berman"
},
{
"authorId": "2870308",
"name": "V. Gorshkov"
},
{
"authorId": "2107999453",
"name": "Xidi Wang"
}
] |
ArXiv
| 2,005
| 17
| 1
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-12-13T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0512054",
"pages": null
}
|
[
"database systems",
"frequent patterns",
"probability"
] |
[
"frequent patterns",
"database systems",
"probability",
"association rules",
"frequent itemsets"
] |
[
"probability",
"frequent itemsets",
"database systems",
"frequent patterns",
"association rules"
] |
[
"mathematics",
"computer systems",
"data mining",
"computer science"
] |
1,181
|
A specification concerning string enhancements to ANSI Standard Fortran is presented for purposes of discussion and evaluation. American National Standards Institute Fortran Specification X3.9--1966 is used as the base line language. Linear graphs are used to formally define and otherwise demonstrate the proposed language extensions. Illustrative, short examples of the proposed string manipulation capabilities are presented. Reference is made to other extended Fortran languages, e.g., Fortran V.
|
2022-07-09T09:10:18.625Z
|
{
"ACL": null,
"DBLP": "journals/sigplan/Lambird71",
"ArXiv": null,
"MAG": "2005249278",
"CorpusId": "1181",
"PubMed": null,
"DOI": "10.1145/1115874.1115875",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/7ba1e3db0c1ea7a6b3efceb366c2cf4d5ec9a8b4
|
String enhancements to ANSI Standard Fortran (part 1)
|
[
{
"authorId": "11149539",
"name": "Robert J. Lambird"
}
] |
SIGP
| 1,971
| 0
| 3
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | null |
{
"name": "ACM SIGPLAN Notices",
"volume": "6",
"pages": "5-12"
}
|
[
"fortran (programming language)"
] |
[
"fortran 77",
"fortran (programming language)",
"fortran 90",
"formal specification",
"university"
] |
[
"formal specification",
"fortran 90",
"university",
"fortran (programming language)",
"fortran 77"
] |
[
"formal methods",
"real time systems",
"software engineering",
"formal languages",
"computer hardware description languages",
"computer programming languages",
"catalogue identifiers",
"education",
"program compilers",
"formal logic",
"knowledge based systems",
"object oriented programming",
"mobile robots",
"field programmable gate array",
"embedded systems",
"online systems",
"digital signal processing",
"computer science",
"linguistics",
"formal languages and automata theory",
"computer programming",
"distributed program",
"corrosion prevention",
"parallel processing systems",
"artificial intelligence",
"robotics",
"computer hardware",
"computer systems",
"signal processing",
"theoretical computer science",
"distributed computer systems",
"operating systems",
"solution methods",
"distributed systems",
"engineering",
"programming languages"
] |
1,182
|
A mediator is a well-known construct in game theory, and is an entity that plays on behalf of some of the agents who choose to use its services, while the rest of the agents participate in the game directly. We initiate a game theoretic study of sponsored search auctions, such as those used by Google and Yahoo!, involving {\em incentive driven} mediators. We refer to such mediators as {\em for-profit} mediators, so as to distinguish them from mediators introduced in prior work, who have no monetary incentives, and are driven by the altruistic goal of implementing certain desired outcomes. We show that in our model, (i) players/advertisers can improve their payoffs by choosing to use the services of the mediator, compared to directly participating in the auction; (ii) the mediator can obtain monetary benefit by managing the advertising burden of its group of advertisers; and (iii) the payoffs of the mediator and the advertisers it plays for are compatible with the incentive constraints from the advertisers who do dot use its services. A simple intuition behind the above result comes from the observation that the mediator has more information about and more control over the bid profile than any individual advertiser, allowing her to reduce the payments made to the auctioneer, while still maintaining incentive constraints. Further, our results indicate that there are significant opportunities for diversification in the internet economy and we should expect it to continue to develop richer structure, with room for different types of agents to coexist.
|
2022-06-20T11:06:16.015Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0707-1057",
"ArXiv": "0707.1057",
"MAG": "1590824375",
"CorpusId": "1182",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/d5f508c95deebdb6c2b644264b54aedda4fb8e19
|
For-profit mediators in sponsored search advertising
|
[
{
"authorId": "2109038109",
"name": "S. Singh"
},
{
"authorId": "1686063",
"name": "V. Roychowdhury"
},
{
"authorId": "2035070",
"name": "H. Gunadhi"
},
{
"authorId": "34892917",
"name": "B. Rezaei"
}
] |
ArXiv
| 2,007
| 16
| 0
| 0
| false
|
[
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Economics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-07-06T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0707.1057",
"pages": null
}
|
[
"game theory",
"internet"
] |
[
"game theory",
"incentive mechanism",
"internet",
"expected profits",
"incentive schemes"
] |
[
"incentive mechanism",
"incentive schemes",
"expected profits",
"game theory",
"internet"
] |
[
"peer-to-peer",
"sales",
"artificial intelligence",
"computer science",
"computer networks",
"distributed computer systems",
"economics",
"computer systems"
] |
1,183
|
We introduce the use, monitoring, and enforcement of integrity constraints in trust management-style authorization systems. We consider what portions of the policy state must be monitored to detect violations of integrity constraints. Then we address the fact that not all participants in a trust management system can be trusted to assist in such monitoring, and show how many integrity constraints can be monitored in a conservative manner so that trusted participants detect and report if the system enters a policy state from which evolution in unmonitored portions of the policy could lead to a constraint violation.
|
2022-06-18T12:39:08.482Z
|
{
"ACL": null,
"DBLP": "conf/sacmat/EtalleW05",
"ArXiv": "cs/0503061",
"MAG": "2888779807",
"CorpusId": "1183",
"PubMed": null,
"DOI": "10.1145/1063979.1063981",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/0de058944a64fc791873487e80393aee374079d5
|
Integrity constraints in trust management
|
[
{
"authorId": "3147598",
"name": "S. Etalle"
},
{
"authorId": "1729090",
"name": "W. Winsborough"
}
] |
SACMAT '05
| 2,005
| 31
| 10
| 0
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-03-23T00:00:00
|
{
"name": null,
"volume": null,
"pages": "1-10"
}
|
[
"authorization",
"trust management",
"trust management systems"
] |
[
"trust evaluation",
"trust management",
"authorization",
"trust relationship",
"functional dependency"
] |
[
"functional dependency",
"trust relationship",
"trust management",
"authorization",
"trust management systems",
"trust evaluation"
] |
[
"relational database",
"social networks",
"access control",
"security systems",
"network security",
"distributed computer systems",
"authentication",
"query languages",
"knowledge based systems",
"world wide web",
"computer security",
"security of data",
"cryptography",
"computer networks",
"computer systems",
"database systems",
"artificial intelligence",
"internet",
"computer science",
"cryptology"
] |
1,184
|
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of performance and the interpretation of those measurements for purposes of adaptation. Several examples of measurements and statistical interpretations are provided. Probability value adaptation is tested using an EA with 10 search operators against 10 test problems with results indicating that both the type of measurement and its statistical interpretation play significant roles in EA performance. We also find that selecting operators based on the prevalence of outliers rather than on average performance is able to provide considerable improvements to adaptive methods and soundly outperforms the non-adaptive case.
|
2022-09-04T02:30:50.695Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0907-0595",
"ArXiv": "0907.0595",
"MAG": "2009284788",
"CorpusId": "1184",
"PubMed": null,
"DOI": "10.1145/1143997.1144205",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/d2f342362f0ddfe06653f860e41ec67263587eaf
|
Use of statistical outlier detection method in adaptive evolutionary algorithms
|
[
{
"authorId": "2594662",
"name": "J. Whitacre"
},
{
"authorId": "49567734",
"name": "Q. Pham"
},
{
"authorId": "9079260",
"name": "R. Sarker"
}
] |
GECCO '06
| 2,006
| 26
| 61
| 3
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-07-08T00:00:00
|
{
"name": null,
"volume": null,
"pages": "1345-1352"
}
|
[
"selection operators",
"evolutionary algorithms",
"probability"
] |
[
"correlation analysis",
"evolutionary algorithms",
"probability",
"adaptive algorithms",
"evolutionary process"
] |
[
"evolutionary algorithms",
"correlation analysis",
"probability",
"evolutionary process",
"selection operators",
"adaptive algorithms"
] |
[
"genetic algorithms",
"mathematics",
"crossover operator",
"mutation operators",
"software",
"artificial intelligence",
"particle swarm optimization (pso)",
"computer science",
"optimization problems",
"optimization",
"swarm intelligence"
] |
1,185
|
We establish a relationship between the online mistake-bound model of learning and resource-bounded dimension. This connection is combined with the Winnow algorithm to obtain new results about the density of hard sets under adaptive reductions. This improves previous work of Fu (1995) and Lutz and Zhao (2000), and solves one of Lutz and Mayordomo's “Twelve Problems in Resource-Bounded Measure” (1999).
|
2022-09-03T20:19:04.559Z
|
{
"ACL": null,
"DBLP": "journals/eccc/ECCC-TR05-161",
"ArXiv": "cs/0512053",
"MAG": "2583315905",
"CorpusId": "1185",
"PubMed": null,
"DOI": "10.1137/050647517",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/5bff2322dd02a314d24f59c938abef72c17ecb9d
|
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
|
[
{
"authorId": "1742012",
"name": "J. M. Hitchcock"
}
] |
SIAM J. Comput.
| 2,005
| 27
| 14
| 1
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-12-13T00:00:00
|
{
"name": null,
"volume": null,
"pages": "408-419"
}
|
[
"online learning"
] |
[
"online learning",
"adaptive algorithms",
"computing resource",
"virtual resource",
"resource information"
] |
[
"virtual resource",
"online learning",
"computing resource",
"resource information",
"adaptive algorithms"
] |
[
"network virtualization",
"virtual machines",
"online systems",
"cloud computing",
"information management",
"resource discovery",
"software",
"network management",
"virtual networks",
"computer systems",
"information technology",
"database systems",
"peer-to-peer",
"grid computing",
"computer science",
"network architecture",
"telecommunication networks",
"virtualizations",
"internet",
"distributed computer systems",
"computer networks",
"parallel processing systems",
"telecommunication systems",
"distributed systems"
] |
1,189
|
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eigenvalue distribution of block matrices if the size of the blocks tends to infinity. While it considers random matrices, it takes an operator-valued free probability approach to achieve this goal. Using this method, one derives a system of equations, which can be solved numerically to compute the desired eigenvalue distribution. The paper initially tackles the problem for square block matrices, then extends the solution to rectangular block matrices. Finally, it deals with Wishart type block matrices. For two special cases, the results of our approach are compared with results from simulations. The first scenario investigates the limit eigenvalue distribution of block Toeplitz matrices. The second scenario deals with the distribution of Wishart type block matrices for a frequency selective slow-fading channel in a MIMO system for two different cases of $n_R=n_T$ and $n_R=2n_T$. Using this method, one may calculate the capacity and the Signal-to-Interference-and-Noise Ratio in large MIMO systems.
|
2022-09-02T13:20:46.600Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0610045",
"ArXiv": "cs/0610045",
"MAG": "1609433270",
"CorpusId": "1189",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/0e4be10ad921497bc2d17aee1c27e4fa074c2ad5
|
Spectra of large block matrices
|
[
{
"authorId": "32576263",
"name": "Reza Rashidi Far"
},
{
"authorId": "2621545",
"name": "T. Oraby"
},
{
"authorId": "3301848",
"name": "W. Bryc"
},
{
"authorId": "2576839",
"name": "R. Speicher"
}
] |
ArXiv
| 2,006
| 27
| 21
| 2
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-10-09T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0610045",
"pages": null
}
|
[
"mimo systems",
"frequency selective fading",
"eigenvalues",
"probability"
] |
[
"mimo",
"multiple-input-multiple-output",
"eigenvalues",
"probability",
"mimo systems"
] |
[
"mimo",
"multiple-input-multiple-output",
"probability",
"mimo systems",
"frequency selective fading",
"eigenvalues"
] |
[
"orthogonal frequency division multiplexing",
"communication channels",
"mathematics",
"signal to noise ratio",
"fading (radio)",
"fading channels",
"eigenvalues and eigenfunctions",
"wireless telecommunication systems",
"signal processing",
"bit error rate",
"signal detection",
"matrix algebra",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering",
"computer science",
"computer systems"
] |
1,190
|
We reformulate Pratt's tableau decision procedure of checking satisability of a set of formulas in PDL. Our formulation is simpler and more direct for implementation. Extending the method we give the rst Ex- pTime (optimal) tableau decision procedure not based on transformation for checking consistency of an ABox w.r.t. a TBox in PDL (here, PDL is treated as a description logic). We also prove the new result that the data complexity of the instance checking problem in PDL is coNP-complete.
|
2022-06-20T19:09:08.974Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0904-0721",
"ArXiv": "0904.0721",
"MAG": "2104832699",
"CorpusId": "1190",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/58f5c7b4f0dda62cd90f082ae9ec704771153b81
|
Optimal Tableau Decision Procedures for PDL
|
[
{
"authorId": "1912987",
"name": "Linh Anh Nguyen"
},
{
"authorId": "1732892",
"name": "A. Szałas"
}
] |
ArXiv
| 2,009
| 30
| 5
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2009-04-04T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0904.0721",
"pages": null
}
|
[
"decision procedure",
"description logic"
] |
[
"decision procedure",
"description logic",
"sequent calculus",
"natural deduction",
"decision tables"
] |
[
"sequent calculus",
"natural deduction",
"decision procedure",
"decision tables",
"description logic"
] |
[
"formal logic",
"decision theory",
"computability and decidability",
"satisfiability",
"model checking",
"knowledge representation",
"ontology",
"formal languages",
"artificial intelligence",
"automata theory",
"graph theory",
"embedded systems",
"architecture verification and validation",
"knowledge based systems",
"semantics",
"linguistics",
"formal languages and automata theory",
"computer science",
"theoretical computer science",
"computer systems",
"architecting",
"software architecture",
"software design",
"software engineering"
] |
1,191
|
We discuss stability for a class of learning algorithms with respect to noisy labels. The algorithms we consider are for regression, and they involve the minimization of regularized risk functionals, such as L(f) := 1/N sum_i (f(x_i)-y_i)^2+ lambda ||f||_H^2. We shall call the algorithm `stable' if, when y_i is a noisy version of f*(x_i) for some function f* in H, the output of the algorithm converges to f* as the regularization term and noise simultaneously vanish. We consider two flavors of this problem, one where a data set of N points remains fixed, and the other where N -> infinity. For the case where N -> infinity, we give conditions for convergence to f_E (the function which is the expectation of y(x) for each x), as lambda -> 0. For the fixed N case, we describe the limiting 'non-noisy', 'non-regularized' function f*, and give conditions for convergence. In the process, we develop a set of tools for dealing with functionals such as L(f), which are applicable to many other problems in learning theory.
|
2022-06-20T12:16:31.132Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0502016",
"ArXiv": "cs/0502016",
"MAG": "1643881101",
"CorpusId": "1191",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/42a9eaa2872a86f03f684087fda364b578d9668b
|
Stability Analysis for Regularized Least Squares Regression
|
[
{
"authorId": "48395540",
"name": "C. Rudin"
}
] |
ArXiv
| 2,005
| 13
| 4
| 0
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-02-03T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0502016",
"pages": null
}
|
[
"regularization"
] |
[
"regularization",
"global stability",
"asymptotic stability",
"asymptotical stability",
"regression model"
] |
[
"asymptotical stability",
"asymptotic stability",
"regression model",
"global stability",
"regularization"
] |
[
"control system stability",
"stability criteria",
"delay control systems",
"sufficient conditions",
"numerical example",
"linear matrix inequalities",
"correlation analysis",
"adaptive control systems",
"lyapunov functions",
"image reconstruction",
"control system analysis",
"control systems",
"time delay",
"numerical methods",
"matrix algebra",
"mathematics",
"process control",
"differential equations",
"image analysis",
"image processing",
"computer systems",
"automation",
"computer imaging and vision",
"computer science",
"engineering"
] |
1,192
|
A {\it dynamic $k$-coloring} of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex of degree at least 2 in $G$ will be adjacent to vertices with at least 2 different colors. The smallest number $k$ for which a graph $G$ can have a dynamic $k$-coloring is the {\it dynamic chromatic number}, denoted by $\chi_d(G)$. In this paper, we investigate the dynamic 3-colorings of claw-free graphs. First, we prove that it is $NP$-complete to determine if a claw-free graph with maximum degree 3 is dynamically 3-colorable. Second, by forbidding a kind of subgraphs, we find a reasonable subclass of claw-free graphs with maximum degree 3, for which the dynamically 3-colorable problem can be solved in linear time. Third, we give a linear time algorithm to recognize this subclass of graphs, and a linear time algorithm to determine whether it is dynamically 3-colorable. We also give a linear time algorithm to color the graphs in the subclass by 3 colors.
|
2022-06-30T08:22:07.487Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0711-2844",
"ArXiv": "0711.2844",
"MAG": "1828139935",
"CorpusId": "1192",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/dee710d75593277ac81bb556177e7d55541895ba
|
Dynamic 3-Coloring of Claw-free Graphs
|
[
{
"authorId": "48568490",
"name": "Xueliang Li"
},
{
"authorId": "46352126",
"name": "Wenli Zhou"
}
] |
ArXiv
| 2,007
| 7
| 0
| 0
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-11-18T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0711.2844",
"pages": null
}
|
[
"graph g",
"maximum degree"
] |
[
"coloring",
"free graphs",
"maximum degree",
"directed graphs",
"weighted graph"
] |
[
"graph g",
"weighted graph",
"free graphs",
"maximum degree",
"coloring",
"directed graphs"
] |
[
"polynomial approximation",
"graphic methods",
"approximation algorithms",
"graph theory",
"approximation theory",
"theoretical computer science",
"mathematics",
"computer science"
] |
1,196
|
Grids are experiencing a rapid growth in their application and along with this there is a requirement for a portal which is easy to use and scalable. We have responded to this requirement by developing an easy to use, scalable, web-based portal called G-Monitor. This paper proposes a generic architecture for a web portal into a grid environment and discusses our implementation and its application.
|
2022-09-01T06:04:23.273Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-DC-0302007",
"ArXiv": "cs/0302007",
"MAG": "2951253943",
"CorpusId": "1196",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/0c71243b88baf7364067d84b25cf6b60857d6fd0
|
G-Monitor: Gridbus web portal for monitoring and steering application execution on global grids
|
[
{
"authorId": "144468303",
"name": "M. Placek"
},
{
"authorId": "1709598",
"name": "R. Buyya"
}
] |
ArXiv
| 2,003
| 7
| 5
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2003-02-05T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.DC/0302007",
"pages": null
}
|
[
"grid environments",
"application execution"
] |
[
"application execution",
"computational grids",
"grid environments",
"grid systems",
"grid node",
"grid-based",
"architecture designs"
] |
[
"grid node",
"grid environments",
"grid systems",
"architecture designs",
"computational grids",
"grid-based",
"application execution"
] |
[
"grid computing",
"software architecture",
"parallel application",
"cloud computing",
"parallel processing systems",
"software design",
"multi core",
"parallel programming",
"communication",
"computer systems",
"distributed systems",
"software engineering",
"program processors",
"parallel algorithms",
"parallel architectures",
"computer programming languages",
"computer science",
"distributed computer systems",
"microprocessor chips",
"computer programming",
"computer hardware"
] |
1,197
|
Given the lack of word delimiters in written Japanese, word segmentation is generally considered a crucial first step in processing Japanese texts. Typical Japanese segmentation algorithms rely either on a lexicon and syntactic analysis or on pre-segmented data; but these are labor-intensive, and the lexico-syntactic techniques are vulnerable to the unknown word problem. In contrast, we introduce a novel, more robust statistical method utilizing unsegmented training data. Despite its simplicity, the algorithm yields performance on long kanji sequences comparable to and sometimes surpassing that of state-of-the-art morphological analyzers over a variety of error metrics. The algorithm also outperforms another mostly-unsupervised statistical algorithm previously proposed for Chinese. Additionally, we present a two-level annotation scheme for Japanese to incorporate multiple segmentation granularities, and introduce two novel evaluation metrics, both based on the notion of a compatible bracket, that can account for multiple granularities simultaneously.
|
2022-09-03T04:19:45.029Z
|
{
"ACL": null,
"DBLP": "journals/nle/AndoL03",
"ArXiv": "cs/0205009",
"MAG": "1998974009",
"CorpusId": "1197",
"PubMed": null,
"DOI": "10.1017/S1351324902002954",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/648eea2a1f12d696fcacb0ea8c19a98bc9a32e2f
|
Mostly-unsupervised statistical segmentation of Japanese kanji sequences
|
[
{
"authorId": "38070424",
"name": "R. Ando"
},
{
"authorId": "145810617",
"name": "Lillian Lee"
}
] |
Natural Language Engineering
| 2,002
| 55
| 40
| 6
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2002-05-10T00:00:00
|
{
"name": "Natural Language Engineering",
"volume": "9",
"pages": "127 - 149"
}
|
[
"syntactic analysis",
"segmentation methods",
"japanese",
"statistical methods",
"word segmentation"
] |
[
"correlation analysis",
"segmentation methods",
"word segmentation",
"syntactics",
"syntactic analysis"
] |
[
"syntactic analysis",
"correlation analysis",
"segmentation methods",
"japanese",
"statistical methods",
"syntactics",
"word segmentation"
] |
[
"natural language processing",
"mathematics",
"image segmentation",
"asian continental ancestry group",
"computational linguistics",
"character recognition",
"artificial intelligence",
"natural languages",
"image analysis",
"image processing",
"genotype",
"genetic association",
"database systems",
"pattern recognition",
"computer science",
"linguistics",
"semantics",
"computer imaging and vision",
"single nucleotide polymorphism",
"genetic analysis",
"computer systems",
"machine learning",
"bioinformatics"
] |
1,200
|
This paper applies an existing query translation method to cross-language patent retrieval. In our method, multiple dictionaries are used to derive all possible translations for an input query, and collocational statistics are used to resolve translation ambiguity. We used Japanese/English parallel patent abstracts to perform comparative experiments, where our method outperformed a simple dictionary-based query translation method, and achieved 76% of monolingual retrieval in terms of average precision.
|
2022-08-28T09:54:59.575Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CL-0206034",
"ArXiv": "cs/0206034",
"MAG": "1651808957",
"CorpusId": "1200",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/c29ff5f6fae43725ef2e4267ef1ab988e8f0cfbd
|
Applying a Hybrid Query Translation Method to Japanese/English Cross-Language Patent Retrieval
|
[
{
"authorId": "143851549",
"name": "Masatoshi Fukui"
},
{
"authorId": "2992232",
"name": "Shigeto Higuchi"
},
{
"authorId": "2070089660",
"name": "Youichi Nakatani"
},
{
"authorId": "2110304340",
"name": "Masao Tanaka"
},
{
"authorId": "143800037",
"name": "Atsushi Fujii"
},
{
"authorId": "48015371",
"name": "Tetsuya Ishikawa"
}
] |
ArXiv
| 2,002
| 18
| 7
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2002-06-24T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CL/0206034",
"pages": null
}
|
[
"japanese",
"correlation analysis",
"query translations"
] |
[
"query translations",
"correlation analysis",
"user query",
"query results",
"query processing"
] |
[
"query results",
"query translations",
"correlation analysis",
"japanese",
"query processing",
"user query"
] |
[
"cross-language information retrieval",
"mathematics",
"asian continental ancestry group",
"search engines",
"query languages",
"natural language processing",
"translation (languages)",
"information retrieval",
"genotype",
"genetic association",
"world wide web",
"database systems",
"artificial intelligence",
"natural languages",
"computational linguistics",
"automata theory",
"linguistics",
"computer science",
"single nucleotide polymorphism",
"genetic analysis",
"internet",
"computer systems",
"semantics",
"formal languages and automata theory",
"bioinformatics",
"theoretical computer science"
] |
1,202
|
This paper introduces the concept of fitness cloud as an alternative way to visualize and analyze search spaces than given by the geographic notion of fitness landscape. It is argued that the fitness cloud concept overcomes several deficiencies of the landscape representation. Our analysis is based on the correlation between fitness of solutions and fitnesses of nearest solutions according to some neighboring. We focus on the behavior of local search heuristics, such as hill climber, on the well-known NK fitness landscape. In both cases the fitness vs. fitness correlation is shown to be related to the epistatic parameter K.
|
2022-09-01T07:02:05.185Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-0709-4010",
"ArXiv": "0709.4010",
"MAG": "2949893013",
"CorpusId": "1202",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/f3ff1fbaea70db82d4e60d41c913188fb9169286
|
Local Search Heuristics: Fitness Cloud versus Fitness Landscape
|
[
{
"authorId": "31330325",
"name": "P. Collard"
},
{
"authorId": "1753815",
"name": "S. Vérel"
},
{
"authorId": "1758554",
"name": "Manuel Clergue"
}
] |
ECAI
| 2,007
| 7
| 28
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 2007-09-25T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/0709.4010",
"pages": null
}
|
[] |
[
"fitness functions",
"cloud services",
"correlation coefficient",
"candidate solution",
"heuristic search algorithms"
] |
[
"correlation coefficient",
"heuristic search algorithms",
"cloud services",
"candidate solution",
"fitness functions"
] |
[
"correlation analysis",
"modular robots",
"distributed database systems",
"commerce",
"cloud providers",
"mobile devices",
"computing paradigm",
"computing resource",
"computing environments",
"software as a service",
"communication",
"evolutionary algorithms",
"optimization problems",
"genetic algorithms",
"mathematics",
"robot applications",
"robotic manipulators",
"industrial robots",
"data communication systems",
"parallel processing systems",
"query languages",
"economics",
"virtual machines",
"virtualizations",
"grid computing",
"mobile computing",
"cloud computing",
"artificial intelligence",
"robots",
"mobile robots",
"robotics",
"computer systems",
"distributed systems",
"database systems",
"wireless telecommunication systems",
"telecommunication networks",
"computer science",
"distributed computer systems",
"computer networks",
"communication systems",
"telecommunication systems"
] |
1,203
|
Recently, several multi-agent system (MAS) development approaches have been proposed and constituted on a goal basis to support the cooperation in a concurrent new product development (CNPD) environment. However, in a CNPD process, different cooperation requirements take place at different stages and need different workgroups to be involved. The goal-driven MAS development approaches only provide a partial solution. This research has proposed a two-phased process-driven approach to develop the MAS framework for fulfilling the overall CNPD cooperation requirement. In the process-driven cooperation requirements analysis phase, the desired CNPD process and cooperation workflow are defined. Next, the MAS specification design phase derives the MAS specification, including the agent classes, their conversations and system configuration, from the CNPD process and cooperation workflow. Finally, an empirical case is developed to verify the feasibility of the proposed approach.
|
2022-02-13T15:59:36.430Z
|
{
"ACL": null,
"DBLP": "conf/csie/JuanLO09",
"ArXiv": null,
"MAG": "2155258478",
"CorpusId": "1203",
"PubMed": null,
"DOI": "10.1109/CSIE.2009.869",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/fb9e3dc6c712874cbbc9ca950ef3f40e7266d302
|
A Process-Driven Approach to Develop Multi-agent System for Cooperation in Concurrent New Product Development
|
[
{
"authorId": "1727041",
"name": "Y. Juan"
},
{
"authorId": "3298797",
"name": "Jiun-Shiung Lin"
},
{
"authorId": "1400441520",
"name": "C. Ou-Yang"
}
] |
2009 WRI World Congress on Computer Science and Information Engineering
| 2,009
| 13
| 1
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2009-03-31T00:00:00
|
{
"name": "2009 WRI World Congress on Computer Science and Information Engineering",
"volume": "4",
"pages": "547-552"
}
|
[
"requirements analysis",
"multiagent system"
] |
[
"multi-agent",
"multiagent system",
"intelligent agents",
"software agents",
"requirements analysis"
] |
[
"requirements analysis",
"multi-agent",
"software agents",
"intelligent agents",
"multiagent system"
] |
[
"requirements engineering",
"artificial intelligence",
"software engineering",
"computer science"
] |
1,204
|
The regression depth of a hyperplane with respect to a set of n points in \Reald is the minimum number of points the hyperplane must pass through in a rotation to vertical. We generalize hyperplane regression depth to k -flats for any k between 0 and d-1 . The k=0 case gives the classical notion of center points. We prove that for any k and d , deep k -flats exist, that is, for any set of n points there always exists a k -flat with depth at least a constant fraction of n . As a consequence, we derive a linear-time (1+ɛ) -approximation algorithm for the deepest flat. We also show how to compute the regression depth in time O(nd-2+nlog n) when 1≤ k≤ d-2.
|
2022-09-03T18:23:59.296Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CG-9912013",
"ArXiv": "cs/9912013",
"MAG": "1980255024",
"CorpusId": "1204",
"PubMed": null,
"DOI": "10.1145/336154.336218",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/32032e5cf0c5079b63b083abf55718b14027ce6e
|
Multivariate Regression Depth
|
[
{
"authorId": "1693008",
"name": "M. Bern"
},
{
"authorId": "1719358",
"name": "D. Eppstein"
}
] |
SCG '00
| 1,999
| 43
| 18
| 2
| true
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 1999-12-20T00:00:00
|
{
"name": "Discrete & Computational Geometry",
"volume": "28",
"pages": "1-17"
}
|
[] |
[
"regression model",
"control point",
"multiple regression",
"correlation analysis",
"polynomial space"
] |
[
"correlation analysis",
"polynomial space",
"multiple regression",
"regression model",
"control point"
] |
[
"mathematics",
"polynomial approximation",
"exact algorithms",
"image coding",
"splines",
"curve fitting",
"graph theory",
"approximation algorithms",
"image processing",
"computer aided design",
"theoretical computer science",
"approximation theory",
"computer imaging and vision",
"computer science"
] |
1,206
|
Currently, computational linguists and cognitive scientists working in the area of discourse and dialogue argue that their subjective judgments are reliable using several different statistics, none of which are easily interpretable or comparable to each other. Meanwhile, researchers in content analysis have already experienced the same difficulties and come up with a solution in the kappa statistic. We discuss what is wrong with reliability measures as they are currently used for discourse and dialogue work in computational linguistics and cognitive science, and argue that we would be better off as a field adopting techniques from content analysis.
|
2022-09-04T18:22:59.669Z
|
{
"ACL": "J96-2004",
"DBLP": "journals/corr/cmp-lg-9602004",
"ArXiv": "cmp-lg/9602004",
"MAG": "2949896162",
"CorpusId": "1206",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/613b6c9a85ae338cd3b405dc019c8edb1c15717c
|
Assessing Agreement on Classification Tasks: The Kappa Statistic
|
[
{
"authorId": "1694130",
"name": "J. Carletta"
}
] |
Comput. Linguistics
| 1,996
| 21
| 2,434
| 264
| false
|
[
{
"category": "Psychology",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Sociology",
"source": "external"
}
] |
[
"JournalArticle"
] | 1996-02-27T00:00:00
|
{
"name": "ArXiv",
"volume": "cmp-lg/9602004",
"pages": null
}
|
[
"classification methods",
"correlation analysis",
"computational linguistics",
"cognitive science",
"dialogue"
] |
[
"classification methods",
"correlation analysis",
"computational linguistics",
"dialogue",
"linguistics",
"cognitive science"
] |
[
"classification methods",
"computational linguistics",
"correlation analysis",
"cognitive science",
"linguistics",
"dialogue"
] |
[
"computer systems",
"database systems",
"mathematics",
"cognitive systems",
"argumentation",
"computer science",
"artificial intelligence",
"logic programming",
"autonomous agents",
"computer programming languages",
"formal logic",
"multiagent system",
"computer programming"
] |
1,208
|
We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has applications in graphics and computer-aided geometric design. The algorithm can operate on polynomials represented in any basis that satisfies a few conditions. The power basis, the Bernstein basis, and the first-kind Chebyshev basis are among those compatible with the algorithm. The main novelty of our algorithm is an analysis showing that its running is bounded only in terms of the condition number of the polynomial's zeros and a constant depending on the polynomial basis.
|
2022-06-30T15:26:17.380Z
|
{
"ACL": null,
"DBLP": "journals/siamsc/SrijuntongsiriV08",
"ArXiv": "cs/0608090",
"MAG": "2949811604",
"CorpusId": "1208",
"PubMed": null,
"DOI": "10.1137/060668043",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/fdf25b07f26a20c3421d20f8977b98a17abd1fd0
|
A Condition Number Analysis of a Line-Surface Intersection Algorithm
|
[
{
"authorId": "2790718",
"name": "Gun Srijuntongsiri"
},
{
"authorId": "1692336",
"name": "S. Vavasis"
}
] |
SIAM J. Sci. Comput.
| 2,006
| 36
| 9
| 0
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-08-22T00:00:00
|
{
"name": "SIAM J. Sci. Comput.",
"volume": "30",
"pages": "1064-1081"
}
|
[
"computer aided geometric design",
"condition numbers",
"polynomial basis"
] |
[
"condition numbers",
"adaptive algorithms",
"hybrid algorithms",
"polynomial basis",
"eigenvalues"
] |
[
"computer aided geometric design",
"condition numbers",
"hybrid algorithms",
"adaptive algorithms",
"eigenvalues",
"polynomial basis"
] |
[
"computer aided design",
"number theory",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"software",
"eigenvalues and eigenfunctions",
"finite fields",
"computer science",
"numerical methods",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"matrix algebra",
"cryptography",
"information theory",
"mathematics",
"artificial intelligence",
"correlation analysis",
"cryptology",
"communication",
"computer security"
] |
1,212
|
Analyses language modeling in spoken dialogue systems for accessing a database. The use of several language models obtained by exploiting dialogue predictions gives better results than the use of a single model for the whole dialogue interaction. For this reason, several models have been created, each one for a specific system question, such as the request for or the confirmation of a parameter. The use of dialogue-dependent language models increases the performance both at the recognition level and at the understanding level, especially on answers to system requests. Moreover, using other methods to increase the performance, like the automatic clustering of vocabulary words or the use of better acoustic models during recognition, does not affect the improvements given by dialogue-dependent language models. The system used in our experiments is Dialogos, the Italian spoken dialogue system used for accessing railway timetable information over the telephone. The experiments were carried out on a large corpus of dialogues collected using Dialogos.
|
2022-09-04T10:58:22.474Z
|
{
"ACL": null,
"DBLP": "conf/icassp/PopoviciB97",
"ArXiv": "cmp-lg/9612002",
"MAG": "2104906421",
"CorpusId": "1212",
"PubMed": null,
"DOI": "10.1109/ICASSP.1997.596055",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/dde3da879cb5ac02968f51cbfb1ad031116b920b
|
Specialized language models using dialogue predictions
|
[
{
"authorId": "40436320",
"name": "C. Popovici"
},
{
"authorId": "2349051",
"name": "P. Baggia"
}
] |
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing
| 1,996
| 23
| 36
| 1
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 1996-12-12T00:00:00
|
{
"name": "1997 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"volume": "2",
"pages": "815-818 vol.2"
}
|
[
"vocabulary",
"dialogue systems",
"language model",
"telephone",
"acoustic model",
"clustering algorithms",
"dialogue",
"database systems"
] |
[
"language model",
"dialogue",
"spoken dialogue",
"dialogue systems",
"database systems",
"clustering algorithms",
"vocabulary",
"acoustics",
"acoustic model",
"telephone"
] |
[
"vocabulary",
"spoken dialogue",
"acoustics",
"dialogue systems",
"telephone",
"acoustic model",
"database systems",
"clustering algorithms",
"dialogue",
"language model"
] |
[
"linguistics",
"speech communication",
"signal processing",
"natural language processing",
"engineering",
"computer systems",
"data mining",
"argumentation",
"computational linguistics",
"artificial intelligence",
"natural languages",
"computer science",
"logic programming",
"autonomous agents",
"semantics",
"computer programming languages",
"formal logic",
"multiagent system",
"computer programming"
] |
1,214
|
An account of utterance interpretation in discourse needs to face the issue of how the discourse context controls the space of interacting preferences. Assuming a discourse processing architecture that distinguishes the grammar and pragmatics subsystems in terms of monotonic and nonmonotonic inferences, I will discuss how independently motivated default preferences interact in the interpretation of intersentential pronominal anaphora. In the framework of a general discourse processing model that integrates both the grammar and pragmatics subsystems, I will propose a fine structure of the preferential interpretation in pragmatics in terms of defeasible rule interactions. The pronoun interpretation preferences that serve as the empirical ground draw from the survey data specifically obtained for the present purpose.
|
2022-09-05T00:55:25.993Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cmp-lg-9506016",
"ArXiv": "cmp-lg/9506016",
"MAG": "1567300353",
"CorpusId": "1214",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/360f5a780a3a77b264caa0d13d5ed808837a770b
|
Indefeasible Semantics and Defeasible Pragmatics
|
[
{
"authorId": "1709723",
"name": "M. Kameyama"
}
] |
ArXiv
| 1,994
| 57
| 52
| 0
| false
|
[
{
"category": "Sociology",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Review"
] | 1994-07-31T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cmp-lg/9506016",
"pages": null
}
|
[
"inference",
"distinguishers",
"semantics"
] |
[
"semantics",
"user preferences",
"inference",
"defeasible logic",
"default logic"
] |
[
"distinguishers",
"user preferences",
"default logic",
"semantics",
"defeasible logic",
"inference"
] |
[
"cryptanalysis",
"block ciphers",
"hash functions",
"user interfaces",
"non-monotonic reasoning",
"inference engines",
"authentication",
"cryptology",
"security of data",
"cryptography",
"network security",
"human computer interaction",
"logic programming",
"knowledge representation",
"artificial intelligence",
"computer security",
"computer networks",
"computer science",
"computer programming languages",
"formal logic",
"knowledge based systems",
"computer programming"
] |
1,215
|
In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logic programs, and more precisely for the fragment of LinLog (Andreoli, 1992) that consists of the language LO (Andreoli & Pareschi, 1991) enriched with the constant 1. We use constraints to symbolically and finitely represent possibly infinite collections of provable goals. We define a fixpoint semantics based on a new operator in the style of TP working over constraints. An application of the fixpoint operator can be computed algorithmically. As sufficient conditions for termination, we show that the fixpoint computation is guaranteed to converge for propositional LO. To our knowledge, this is the first attempt to define an effective fixpoint semantics for linear logic programs. As an application of our framework, we also present a formal investigation of the relations between LO and Disjunctive Logic Programming (Minker et al., 1991). Using an approach based on abstract interpretation, we show that DLP fixpoint semantics can be viewed as an abstraction of our semantics for LO. We prove that the resulting abstraction is correct and complete (Cousot & Cousot, 1977; Giacobazzi & Ranzato, 1997) for an interesting class of LO programs encoding Petri Nets.
|
2022-09-01T01:08:06.917Z
|
{
"ACL": null,
"DBLP": "journals/tplp/BozzanoDM02",
"ArXiv": "cs/0102025",
"MAG": "2951883497",
"CorpusId": "1215",
"PubMed": null,
"DOI": "10.1017/S1471068402001254",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/7521dd10f5cfe9902c0f994fe282e84deb832982
|
An effective fixpoint semantics for linear logic programs
|
[
{
"authorId": "1696837",
"name": "M. Bozzano"
},
{
"authorId": "1710860",
"name": "G. Delzanno"
},
{
"authorId": "145864838",
"name": "M. Martelli"
}
] |
Theory and Practice of Logic Programming
| 2,001
| 50
| 19
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2001-02-23T00:00:00
|
{
"name": "Theory and Practice of Logic Programming",
"volume": "2",
"pages": "85 - 122"
}
|
[
"linear logic",
"petri nets",
"logic programs",
"logic programming",
"sufficient conditions",
"semantics",
"abstract interpretation"
] |
[
"well founded semantics",
"logic programs",
"semantics",
"linear logic",
"sufficient conditions",
"logic programming",
"abstract interpretation",
"petri nets"
] |
[
"petri nets",
"linear logic",
"logic programs",
"logic programming",
"sufficient conditions",
"well founded semantics",
"semantics",
"abstract interpretation"
] |
[
"graph theory",
"computer programming languages",
"formal logic",
"linear matrix inequalities",
"static analysis",
"theoretical computer science",
"computer programming",
"artificial intelligence",
"matrix algebra",
"software engineering",
"program compilers",
"computer science",
"mathematics",
"parallel processing systems",
"distributed systems",
"distributed computer systems",
"computer systems"
] |
1,218
|
Reconfigurable computing refers to the use of processors, such as Field Programmable Gate Arrays (FPGAs), that can be modified at the hardware level to take on different processing tasks. A reconfigurable computing platform describes the hardware and software base on top of which modular extensions can be created, depending on the desired application. Such reconfigurable computing platforms can take on varied designs and implementations, according to the constraints imposed and features desired by the scope of applications. This paper introduces a PC-based reconfigurable computing platform software frameworks that is flexible and extensible enough to abstract the different hardware types and functionality that different PCs may have. The requirements of the software platform, architectural issues addressed, rationale behind the decisions made, and frameworks design implemented are discussed.
|
2022-06-20T12:04:53.460Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-AR-0405015",
"ArXiv": "cs/0405015",
"MAG": "1651861930",
"CorpusId": "1218",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/b14ce06cd5a4bb9e70c489a0d1cdf4233a547519
|
A High-Level Reconfigurable Computing Platform Software Frameworks
|
[
{
"authorId": "144467855",
"name": "D. Nathan"
},
{
"authorId": "2162927",
"name": "K. M. Kit"
},
{
"authorId": "2677822",
"name": "Kelly Choo Hon Min"
},
{
"authorId": "3123788",
"name": "P. W. Chin"
},
{
"authorId": "3139413",
"name": "A. Weisensee"
}
] |
ArXiv
| 2,004
| 5
| 2
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2004-05-04T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.AR/0405015",
"pages": null
}
|
[
"computer hardware",
"reconfigurable architectures",
"fpgas",
"computing resource",
"programmable gate array",
"software",
"software frameworks"
] |
[
"reconfigurable architectures",
"fpgas",
"computing resource",
"software frameworks",
"software",
"computer hardware",
"programmable gate array"
] |
[
"computer hardware",
"reconfigurable architectures",
"fpgas",
"computing resource",
"programmable gate array",
"software",
"software frameworks"
] |
[
"computer science",
"field programmable gate array",
"cloud computing",
"logic gates",
"computer programming",
"computer systems"
] |
1,220
|
The paper compares computational aspects of four approaches to compute conservation laws of single Differential Equations (DEs) or systems of them, ODEs and PDEs. The only restriction, required by two of the four corresponding computer algebra programs, is that each DE has to be solvable for a leading derivative. Extra constraints for the conservation laws can be specified. Examples include new conservation laws that are non-polynomial in the functions, that have an explicit variable dependence and families of conservation laws involving arbitrary functions. The following equations are investigated in examples: Ito, Liouville, Burgers, Kadomtsev–Petviashvili, Karney–Sen–Chu–Verheest, Boussinesq, Tzetzeica, Benney.
|
2022-09-04T19:23:48.011Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-SC-0301027",
"ArXiv": "cs/0301027",
"MAG": "2949131684",
"CorpusId": "1220",
"PubMed": null,
"DOI": "10.1017/S0956792501004715",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/94d7fcf94b166636c1ebca72b8d9adf83a30384d
|
A comparison of four approaches to the calculation of conservation laws
|
[
{
"authorId": "145662441",
"name": "Thomas Wolf"
}
] |
European Journal of Applied Mathematics
| 2,002
| 90
| 155
| 11
| true
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2002-04-01T00:00:00
|
{
"name": "European Journal of Applied Mathematics",
"volume": "13",
"pages": "129 - 152"
}
|
[
"differential equations"
] |
[
"differential equations",
"relational algebra",
"ordinary differential equations",
"difference equations",
"partial differential equations"
] |
[
"ordinary differential equations",
"difference equations",
"partial differential equations",
"relational algebra",
"differential equations"
] |
[
"nonlinear equations",
"mathematics",
"relational database",
"numerical methods",
"knowledge based systems",
"query languages",
"artificial intelligence",
"database systems",
"computer science",
"computer systems"
] |
1,221
|
An observational study was conducted on a professional designer working on a design project in aerospace industry. The protocol data were analyzed in order to gain insight into the actions the designer used for the development of a solution to the corresponding problem. Different processes are described: from the "simple" evocation of a solution existing in memory, to the elaboration of a "new" solution out of mnesic entities without any clear link to the current problem. Control is addressed in so far as it concerns the priority among the different types of development processes: the progression from evocation of a "standard" solution to elaboration of a "new" solution is supposed to correspond to the resulting order, that is, the one in which the designer's activity proceeds. Short discussions of * the double status of "problem" and "solution," * the problem/solution knowledge units in memory and their access, and * the different abstraction levels on which problem and solution representations are developed, are illustrated by the results.
|
2022-09-01T20:15:45.061Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0612006",
"ArXiv": "cs/0612006",
"MAG": "2276312211",
"CorpusId": "1221",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/cb06cf42cbab7c3ba467d23690213f053a22c21c
|
Evocation and elaboration of solutions: Different types of problem-solving actions. An empirical study on the design of an aerospace artifact
|
[
{
"authorId": "152968732",
"name": "W. Visser"
}
] |
ArXiv
| 1,990
| 11
| 20
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Art",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Psychology",
"source": "external"
}
] |
[
"JournalArticle"
] | 1990-11-20T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0612006",
"pages": null
}
|
[
"development processes",
"design projects"
] |
[
"combinatorial problems",
"combinatorial optimization",
"development processes",
"random access memory",
"engineers"
] |
[
"random access memory",
"combinatorial problems",
"development processes",
"engineers",
"combinatorial optimization",
"design projects"
] |
[
"random access storage",
"combinatorial mathematics",
"process engineering",
"software design",
"optical fibers",
"optimization",
"product design",
"curricula",
"parallel processing systems",
"microprocessor chips",
"graph theory",
"software engineering",
"process control",
"sensors",
"mathematics",
"computer aided design",
"education",
"distributed systems",
"computer hardware",
"theoretical computer science",
"computer science",
"automation",
"distributed computer systems",
"engineering",
"computer systems"
] |
1,222
|
The real monetary economy is grounded upon monetary flow equilibration or the activity of actualizing monetary flow continuity at each economic agent except for the central bank. Every update of monetary flow continuity at each agent constantly causes monetary flow equilibration at the neighborhood agents. Every monetary flow equilibration as the activity of shooting the mark identified as monetary flow continuity turns out to be off the mark, and constantly generate the similar activities in sequence. Monetary flow equilibration ceaselessly reverberating in the economy performs two functions. One is to seek an organization on its own, and the other is to perturb the ongoing organization. Monetary flow equilibration as the agency of seeking and perturbing its organization also serves as a means of predicting its behavior. The likely organizational behavior could be the one that remains most robust against monetary flow equilibration as an agency of applying perturbations.
|
2022-09-02T03:57:25.171Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CE-0104013",
"ArXiv": "cs/0104013",
"MAG": "1666831020",
"CorpusId": "1222",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/db7ff55aed131ed928c7b6228ddecc2e9127b501
|
Shooting Over or Under the Mark: Towards a Reliable and Flexible Anticipation in the Economy
|
[
{
"authorId": "2739288",
"name": "K. Matsuno"
}
] |
ArXiv
| 2,001
| 6
| 2
| 0
| false
|
[
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2001-04-08T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CE/0104013",
"pages": null
}
|
[
"economics"
] |
[
"economics",
"intelligent agents",
"software agents",
"economic development",
"autonomous agents"
] |
[
"economic development",
"autonomous agents",
"software agents",
"intelligent agents",
"economics"
] |
[
"multiagent system",
"artificial intelligence",
"computer science"
] |
1,223
|
We report here on a study of interannotator agreement in the coreference task as defined by the Message Understanding Conference (MUC-6 and MUC-7). Based on feedback from annotators, we clarified and simplified the annotation specification. We then performed an analysis of disagreement among several annotators, concluding that only 16% of the disagreements represented genuine disagreement about coreference; the remainder of the cases were mostly typographical errors or omissions, easily reconciled. Initially, we measured interannotator agreement in the low 80’s for precision and recall. To try to improve upon this, we ran several experiments. In our final experiment, we separated the tagging of candidate noun phrases from the linking of actual coreferring expressions. This method shows promise -- interannotator agreement climbed to the low 90s -- but it needs more extensive validation. These results position the research community to broaden the coreference task to multiple languages, and possibly to different kinds of coreference.
|
2022-09-04T23:44:13.281Z
|
{
"ACL": null,
"DBLP": "journals/corr/cmp-lg-9803001",
"ArXiv": "cmp-lg/9803001",
"MAG": "1522587593",
"CorpusId": "1223",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/a340eadd28c01de25b49d6b75285a6d7ab5073ab
|
Automating Coreference: The Role of Annotated Training Data
|
[
{
"authorId": "145148360",
"name": "L. Hirschman"
},
{
"authorId": "2066645774",
"name": "Patricia Robinson"
},
{
"authorId": "5416402",
"name": "J. Burger"
},
{
"authorId": "2200382",
"name": "M. Vilain"
}
] |
ArXiv
| 1,998
| 11
| 59
| 14
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1998-03-02T00:00:00
|
{
"name": "ArXiv",
"volume": "cmp-lg/9803001",
"pages": null
}
|
[
"validation"
] |
[
"validation",
"relation extraction",
"semantic information",
"automation",
"integrated data"
] |
[
"semantic information",
"automation",
"integrated data",
"relation extraction",
"validation"
] |
[
"semantics",
"engineering",
"data integration",
"information extraction",
"verification and validation",
"data handling",
"natural language processing",
"data mining",
"information analysis",
"information retrieval",
"software quality",
"database systems",
"artificial intelligence",
"natural languages",
"computer science",
"information systems",
"software design",
"computer systems",
"linguistics",
"software engineering"
] |
1,224
|
The output of Chinese word segmentation can vary according to different linguistic definitions of words and different engineering requirements, and no single standard can satisfy all linguists and all computer applications. Most of the disagreements in language processing come from the segmentation of morphologically derived words (MDWs). This paper presents a system that can be conveniently customized to meet various user-defined standards in the segmentation of MDWs. In this system, all MDWs contain word trees where the root nodes correspond to maximal words and leaf nodes to minimal words. Each non-terminal node in the tree is associated with a resolution parameter which determines whether its daughters are to be displayed as a single word or separate words. Different outputs of segmentation can then be obtained from the different cuts of the tree, which are specified by the user through the different value combinations of those resolution parameters. We thus have a single system that can be customized to meet different segmentation specifications.
|
2022-08-31T19:29:21.410Z
|
{
"ACL": "O03-4001",
"DBLP": "journals/ijclclp/Wu03",
"ArXiv": null,
"MAG": "2098594428",
"CorpusId": "1224",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/fb3b98ad2266d7b8bae87ff9133e7205111dc982
|
Customizable Segmentation of Morphologically Derived Words in Chinese
|
[
{
"authorId": "40046594",
"name": "Andi Wu"
}
] |
Int. J. Comput. Linguistics Chin. Lang. Process.
| 2,003
| 119
| 39
| 1
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2003-02-01T00:00:00
|
{
"name": "Int. J. Comput. Linguistics Chin. Lang. Process.",
"volume": "8",
"pages": null
}
|
[
"chinese word segmentation",
"linguistics",
"computer applications",
"engineering"
] |
[
"part of speech",
"chinese word segmentation",
"word segmentation",
"linguistics",
"engineering",
"computer applications"
] |
[
"part of speech",
"word segmentation",
"engineering",
"linguistics",
"computer applications",
"chinese word segmentation"
] |
[
"natural language processing",
"computational linguistics",
"character recognition",
"software",
"artificial intelligence",
"natural languages",
"database systems",
"pattern recognition",
"computer science",
"semantics",
"computer systems",
"machine learning"
] |
1,225
|
In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivision version). A naive version uses twelve calls. We also show that any method for obtaining a regular subdivision using the standard de Casteljau algorithm requires at least 4 calls. Thus, our method is optimal. We give another subdivision algorithm using only three calls to the de Casteljau algorithm. Instead of being regular, the subdivision pattern is diamond-like. Finally, we present a "spider-like" subdivision scheme producing six subtriangles in four calls to the de Casteljau algorithm.
|
2022-09-02T03:20:15.517Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0606061",
"ArXiv": "cs/0606061",
"MAG": "1660125032",
"CorpusId": "1225",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/db56cb657f56bdb629844465681876bcea50540e
|
On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches
|
[
{
"authorId": "1772142",
"name": "J. Gallier"
}
] |
ArXiv
| 2,006
| 17
| 3
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-06-13T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0606061",
"pages": null
}
|
[] |
[
"adaptive algorithms",
"hybrid algorithms",
"computational efficiency",
"image patches"
] |
[
"adaptive algorithms",
"computational efficiency",
"hybrid algorithms",
"image patches"
] |
[
"software",
"theoretical computer science",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"object recognition",
"optical resolving power",
"computer science",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"pattern recognition",
"image segmentation",
"image quality",
"image reconstruction",
"artificial intelligence",
"correlation analysis",
"mathematics",
"machine learning",
"image analysis",
"image processing",
"computer imaging and vision"
] |
1,228
|
This work has been motivated by two long term goals: to understand how humans learn language and to build programs that can understand language. Using a representation that makes the relevant features explicit is a prerequisite for successful learning and understanding. Therefore, I chose to represent relations between individual words explicitly in my model. Lexical attraction is defined as the likelihood of such relations. I introduce a new class of probabilistic language models named lexical attraction models which can represent long distance relations between words and I formalize this new class of models using information theory.
Within the framework of lexical attraction, I developed an unsupervised language acquisition program that learns to identify linguistic relations in a given sentence. The only explicitly represented linguistic knowledge in the program is lexical attraction. There is no initial grammar or lexicon built in and the only input is raw text. Learning and processing are interdigitated. The processor uses the regularities detected by the learner to impose structure on the input. This structure enables the learner to detect higher level regularities. Using this bootstrapping procedure, the program was trained on 100 million words of Associated Press material and was able to achieve 60% precision and 50% recall in finding relations between content-words. Using knowledge of lexical attraction, the program can identify the correct relations in syntactically ambiguous sentences such as "I saw the Statue of Liberty flying over New York." (Copies available exclusively from MIT Libraries Rm. 14-0551, Cambridge, MA 02139-4307 Ph. 617-253-5668; Fax 617-253-1690.)
|
2022-09-04T02:01:14.759Z
|
{
"ACL": null,
"DBLP": "journals/corr/cmp-lg-9805009",
"ArXiv": "cmp-lg/9805009",
"MAG": "2153208746",
"CorpusId": "1228",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/90555710735a217e2f449697ad664b7783026f32
|
Discovery of linguistic relations using lexical attraction
|
[
{
"authorId": "2808366",
"name": "Deniz Yuret"
}
] |
ArXiv
| 1,998
| 46
| 132
| 12
| false
|
[
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1998-05-27T00:00:00
|
{
"name": "ArXiv",
"volume": "cmp-lg/9805009",
"pages": null
}
|
[
"language acquisition",
"linguistics",
"libraries",
"surface acoustic waves",
"information theory",
"language model"
] |
[
"linguistics",
"language model",
"information theory",
"language acquisition",
"syntactic structure",
"libraries"
] |
[
"language acquisition",
"syntactic structure",
"language model",
"linguistics",
"libraries",
"information theory",
"surface acoustic waves"
] |
[
"natural language processing",
"syntactics",
"computational linguistics",
"education",
"communication",
"acoustic surface wave devices",
"artificial intelligence",
"natural languages",
"database systems",
"acoustic waves",
"computer science",
"semantics",
"computer systems",
"acoustics",
"signal processing",
"engineering"
] |
1,229
|
Martin-Lof's definition of random sequences of cbits as those not belonging to any set of constructive zero Lebesgue measure is reformulated in the language of Algebraic Probability Theory.
The adoption of the Pour-El Richards theory of computability structures on Banach spaces allows us to give a natural noncommutative extension of Martin-Lof's definition, characterizing the random elements of a chain Von Neumann algebra.
In the particular case of the minimally informative noncommutative alphabet our definition reduces to the definition of a random sequence of qubits.
|
2022-06-20T10:58:52.308Z
|
{
"ACL": null,
"DBLP": "journals/corr/chao-dyn-9909031",
"ArXiv": "chao-dyn/9909031",
"MAG": "1561956196",
"CorpusId": "1229",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/aebd659f4319a68297ba57bfb6f144a223182a2a
|
Noncommutative Martin-Lof randomness : on the concept of a random sequence of qubits
|
[
{
"authorId": "30510945",
"name": "G. Segre"
}
] |
ArXiv
| 1,999
| 19
| 0
| 0
| false
|
[
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 1999-09-21T00:00:00
|
{
"name": "ArXiv",
"volume": "chao-dyn/9909031",
"pages": null
}
|
[
"computability",
"random sequence",
"banach spaces",
"probability"
] |
[
"random sequence",
"pseudorandom sequences",
"probability",
"computability",
"banach spaces"
] |
[
"random sequence",
"banach spaces",
"probability",
"pseudorandom sequences",
"computability"
] |
[
"random number generation",
"topology",
"mathematics",
"binary sequences",
"cryptography",
"computability and decidability",
"turing machines",
"number theory",
"random processes",
"information theory",
"cryptology",
"formal logic",
"automata theory",
"formal languages",
"graph theory",
"numerical methods",
"communication",
"computer security",
"artificial intelligence",
"formal languages and automata theory",
"linguistics",
"theoretical computer science",
"computer science"
] |
1,230
|
Wireless sensor networks (WSNs) have attracted considerable attention in recent years and motivate a host of new challenges for distributed signal processing. The problem of distributed or decentralized estimation has often been considered in the context of parametric models. However, the success of parametric methods is limited by the appropriateness of the strong statistical assumptions made by the models. In this paper, a more flexible nonparametric model for distributed regression is considered that is applicable in a variety of WSN applications including field estimation. Here, starting with the standard regularized kernel least-squares estimator, a message-passing algorithm for distributed estimation in WSNs is derived. The algorithm can be viewed as an instantiation of the successive orthogonal projection (SOP) algorithm. Various practical aspects of the algorithm are discussed and several numerical simulations validate the potential of the approach.
|
2022-09-04T06:42:13.056Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0507039",
"ArXiv": "cs/0507039",
"MAG": "3023884129",
"CorpusId": "1230",
"PubMed": null,
"DOI": "10.1117/12.620194",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/4ac9742937b0a108699f1fcff4c0f261b3af8cc8
|
Regression in sensor networks: training distributively with alternating projections
|
[
{
"authorId": "2498294",
"name": "J. Predd"
},
{
"authorId": "1697413",
"name": "S. Kulkarni"
},
{
"authorId": "145967056",
"name": "H. Poor"
}
] |
SPIE Optics + Photonics
| 2,005
| 34
| 35
| 0
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] |
[
"JournalArticle"
] | 2005-07-17T00:00:00
|
{
"name": null,
"volume": "5910",
"pages": null
}
|
[
"wsn applications",
"message passing algorithm",
"wireless sensor networks",
"wsns",
"signal processing",
"sensor networks"
] |
[
"sensors",
"sensor networks",
"wireless sensor networks",
"wsns",
"wireless",
"wireless sensor",
"signal processing"
] |
[
"wsn applications",
"message passing algorithm",
"wireless sensor",
"wireless sensor networks",
"wsns",
"sensors",
"wireless",
"signal processing",
"sensor networks"
] |
[
"inference engines",
"belief propagation",
"graphical model",
"information theory",
"wireless telecommunication systems",
"wireless communications",
"energy utilization",
"sensor nodes",
"routing algorithms",
"computer hardware",
"radio",
"engineering",
"routers",
"embedded systems",
"artificial intelligence",
"backpropagation algorithm",
"graph theory",
"bayesian methods",
"graphic methods",
"communication",
"computer networks",
"communication systems",
"telecommunication systems",
"electricity",
"computer science",
"telecommunication traffic",
"bandwidth",
"computer systems",
"neural networks",
"theoretical computer science",
"telecommunication networks",
"machine learning"
] |
1,232
|
We develop a new technique for proving cell-probe lower bounds for static data structures. Previous lower bounds used a reduction to communication games, which was known not to be tight by counting arguments. We give the first lower bound for an explicit problem which breaks this communication complexity barrier. In addition, our bounds give the first separation between polynomial and near linear space. Such a separation is inherently impossible by communication complexity.Using our lower bound technique and new upper bound constructions, we obtain tight bounds for searching predecessors among a static set of integers. Given a set Y of n integers of l bits each, the goal is to efficiently find PREDECESSOR (x) = max (y ∈ Y | y ≤ x). For this purpose, we represent Y on a RAM with word length b using S ≥ nl bits of space. Defining a = lg S/n, we show that the optimal search time is, up to constant factors: min(logbn, lgl-lg n / n, lg(l/a) / lg(a/lg n * lg l/a), lg (l/a) / lg (lg (l/a) / lg (lg n / a)).In external memory (b > l), it follows that the optimal strategy is to use either standard B-trees, or a RAM algorithm ignoring the larger block size. In the important case of b = l = γ lg n, for γ > 1 (i.e. polynomial universes), and near linear space (such as S = n • lgO(1) n), the optimal search time is Θ(lg l). Thus, our lower bound implies the surprising conclusion that van Emde Boas' classic data structure from [FOCS'75] is optimal in this case. Note that for space n1+ε, a running time of O(lg l / lg lg l) was given by Beame and Fich [STOC'99].
|
2022-09-04T23:34:19.962Z
|
{
"ACL": null,
"DBLP": "journals/corr/abs-cs-0603043",
"ArXiv": "cs/0603043",
"MAG": "2949195484",
"CorpusId": "1232",
"PubMed": null,
"DOI": "10.1145/1132516.1132551",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/ce10a217fb4871fe75860417ddf2a58eaefb2b79
|
Time-space trade-offs for predecessor search
|
[
{
"authorId": "1738800",
"name": "M. Patrascu"
},
{
"authorId": "1695440",
"name": "M. Thorup"
}
] |
STOC '06
| 2,006
| 26
| 212
| 24
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2006-03-10T00:00:00
|
{
"name": "ArXiv",
"volume": "abs/cs/0603043",
"pages": null
}
|
[
"communication",
"optimal strategies"
] |
[
"trade",
"communication",
"optimal strategies",
"random access memory",
"search process"
] |
[
"trade",
"random access memory",
"search process",
"communication",
"optimal strategies"
] |
[
"commerce",
"random access storage",
"evolutionary algorithms",
"search engines",
"game theory",
"optimal solutions",
"economics",
"parallel processing systems",
"microprocessor chips",
"genetic algorithms",
"world wide web",
"artificial intelligence",
"computer systems",
"distributed systems",
"computer hardware",
"internet",
"computer science",
"distributed computer systems"
] |
1,234
|
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. The algorithm has been implemented on SparcStations, and for large randomly generated synthetic tree databases (some having tens of thousands of trees) it can associatively search for trees with a small error, in a matter of tenths of a second to few seconds.
|
2022-08-13T14:11:44.176Z
|
{
"ACL": "C96-2145",
"DBLP": "journals/corr/cmp-lg-9604003",
"ArXiv": "cmp-lg/9604003",
"MAG": "2952198704",
"CorpusId": "1234",
"PubMed": null,
"DOI": "10.3115/993268.993317",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/5886fd5f385a6e75e0ad1867783416e2913e4518
|
Error-tolerant Tree Matching
|
[
{
"authorId": "1723120",
"name": "Kemal Oflazer"
}
] |
COLING
| 1,996
| 12
| 9
| 1
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle",
"Conference"
] | 1996-04-11T00:00:00
|
{
"name": null,
"volume": null,
"pages": "860-864"
}
|
[
"query tree",
"natural language processing",
"lexical database",
"efficient algorithm",
"database systems",
"translation systems"
] |
[
"efficient algorithm",
"database systems",
"query tree",
"natural languages",
"natural language processing",
"translation systems",
"lexical database"
] |
[
"query tree",
"natural languages",
"natural language processing",
"lexical database",
"efficient algorithm",
"database systems",
"translation systems"
] |
[
"rfid systems",
"linguistics",
"semantics",
"artificial intelligence",
"computational efficiency",
"computer systems",
"computer aided language translation",
"statistical machine translation",
"machine translations",
"authentication",
"rf-id tags",
"cryptography",
"computer science",
"theoretical computer science",
"speech transmission",
"statistical methods",
"translation (languages)",
"information theory",
"security of data",
"rfid",
"cryptology",
"speech communication",
"correlation analysis",
"computational linguistics",
"automata theory",
"communication",
"computer security",
"tracked objects",
"radio waves",
"mathematics",
"formal languages and automata theory",
"object tracking",
"target tracking",
"signal processing",
"object recognition",
"sensors",
"engineering",
"pattern recognition",
"image segmentation",
"computer hardware",
"machine learning",
"image analysis",
"image processing",
"computer imaging and vision"
] |
1,236
|
The provably asymptotically fastest algorithm within a factor of 5 for formally described problems will be constructed. The main idea is to enumerate all programs provably equivalent to the original problem by enumerating all proofs. The algorithm could be interpreted as a generalization and improvement of Levin search, which is, within a multiplicative constant, the fastest algorithm for inverting functions. Blum's speed-up theorem is avoided by taking into account only programs for which a correctness proof exists. Furthermore, it is shown that the fastest program that computes a certain function is also one of the shortest programs provably computing this function. To quantify this statement, the definition of Kolmogorov complexity is extended, and two new natural measures for the complexity of a function are defined.
|
2022-06-18T15:54:21.847Z
|
{
"ACL": null,
"DBLP": "journals/corr/cs-CC-0102018",
"ArXiv": "cs/0102018",
"MAG": "1785329278",
"CorpusId": "1236",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/f24c6cfb9ecd3478d59ebf96b5f604101f28385e
|
An effective Procedure for Speeding up Algorithms
|
[
{
"authorId": "144154444",
"name": "Marcus Hutter"
}
] |
ArXiv
| 2,001
| 35
| 1
| 0
| false
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2001-02-21T00:00:00
|
{
"name": "ArXiv",
"volume": "cs.CC/0102018",
"pages": null
}
|
[] |
[
"formal proofs",
"adaptive algorithms",
"hybrid algorithms",
"efficient algorithm",
"optimization problems"
] |
[
"hybrid algorithms",
"formal proofs",
"efficient algorithm",
"adaptive algorithms",
"optimization problems"
] |
[
"evolutionary algorithms",
"particle swarm optimization (pso)",
"formal verifications",
"formal logic",
"computational efficiency",
"software",
"correlation analysis",
"genetic algorithms",
"optimization",
"swarm intelligence",
"verification",
"artificial intelligence",
"theoretical computer science",
"computer science",
"mathematics",
"verification and validation",
"software quality",
"software design",
"software engineering"
] |
1,237
|
In the context of the Semantic Web, several approaches for combining ontologies, given in terms of theories of classical first-order logic and rule bases, have been proposed. They either cast rules into classical logic or limit the interaction between rules and ontologies. Autoepistemic logic (AEL) is an attractive formalism which allows overcoming these limitations by serving as a uniform host language to embed ontologies and nonmonotonic logic programs into it. For the latter, so far only the propositional setting has been considered. In this article, we present three embeddings of normal and three embeddings of disjunctive nonground logic programs under the stable model semantics into first-order AEL. While all embeddings correspond with respect to objective ground atoms, differences arise when considering nonatomic formulas and combinations with first-order theories. We compare the embeddings with respect to stable expansions and autoepistemic consequences, considering the embeddings by themselves, as well as combinations with classical theories. Our results reveal differences and correspondences of the embeddings, and provide useful guidance in the choice of a particular embedding for knowledge combination.
|
2022-09-04T11:09:13.337Z
|
{
"ACL": null,
"DBLP": "journals/tocl/BruijnEPT11",
"ArXiv": "0811.0359",
"MAG": "2157081549",
"CorpusId": "1237",
"PubMed": null,
"DOI": "10.1145/1929954.1929957",
"PubMedCentral": null
}
|
https://www.semanticscholar.org/paper/58f19ae88d665fcb8c3ac74c708635d9e127085b
|
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
|
[
{
"authorId": "2781962",
"name": "J. Bruijn"
},
{
"authorId": "72431510",
"name": "Thomas Eiter"
},
{
"authorId": "1708607",
"name": "A. Polleres"
},
{
"authorId": "2756122",
"name": "H. Tompits"
}
] |
TOCL
| 2,007
| 136
| 44
| 1
| true
|
[
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] |
[
"JournalArticle"
] | 2007-01-06T00:00:00
|
{
"name": null,
"volume": null,
"pages": "304-309"
}
|
[
"logic programs",
"semantic web",
"first order logic",
"stable model",
"ontology",
"rule base"
] |
[
"logic programs",
"stable model",
"knowledge base",
"semantics",
"semantic web",
"ontology",
"first order logic",
"rule base"
] |
[
"semantics",
"logic programs",
"semantic web",
"first order logic",
"stable model",
"ontology",
"rule base",
"knowledge base"
] |
[
"logic programming",
"world wide web",
"formal logic",
"knowledge based systems",
"computer programming languages",
"internet",
"artificial intelligence",
"computer programming",
"computer science"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.