Computational Datasets
Collection
3 items
•
Updated
Dataset Viewer (First 5GB)
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
sequencelengths 1
5
⌀ | publicationdate
timestamp[s]date 1842-06-01 00:00:00
2022-08-30 00:00:00
⌀ | journal
dict | syntactic
sequencelengths 0
71
| semantic
sequencelengths 0
96
| union
sequencelengths 0
106
| enhanced
sequencelengths 0
167
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
16 | Volunteered Geographic Information (VGI) tools appear to enhance the possibilities offered by a collaborative approach to planning. The present paper analyzes both the results of experiences of the author and of those available in the literature, highlighting possible advantages and disadvantages. After a brief introduction to the meaning of e-democracy, the second part focuses on the role of ICT in collaborative planning, proceeding in the third part to an illustration of an initial panorama of knowledge gathered using ICT in such processes, while discussing criticisms and opportunities. The fourth part discusses the U-city paradigm as a driver of change in urban planning participation processes. Research perspectives are then outlined in the final part. | 2022-08-28T10:16:42.597Z | {
"ACL": null,
"DBLP": "journals/fi/Rotondo12",
"ArXiv": null,
"MAG": "2142154367",
"CorpusId": "16",
"PubMed": null,
"DOI": "10.3390/fi4020563",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f484c290244e8fa9b9e64a19a6385ad05543886d | The U-City Paradigm: Opportunities and Risks for E-Democracy in Collaborative Planning | [
{
"authorId": "2194162",
"name": "F. Rotondo"
}
] | Future Internet | 2,012 | 49 | 20 | 0 | true | [
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2012-06-05T00:00:00 | {
"name": "Future Internet",
"volume": "4",
"pages": "563-574"
} | [
"ict"
] | [
"geo-spatial data",
"geospatial information",
"geo-spatial",
"ict",
"information and communication technologies"
] | [
"geospatial information",
"ict",
"geo-spatial data",
"geo-spatial",
"information and communication technologies"
] | [
"spatial data",
"geographic information system",
"information technology",
"software",
"computer science"
] |
26 | In this paper, we introduce a field-programmable gate array (FPGA) hardware architecture for the realization of an algorithm for computing the eigenvalue decomposition (EVD) of para-Hermitian polynomial matrices. Specifically, we develop a parallelized version of the second-order sequential best rotation (SBR2) algorithm for polynomial matrix EVD (PEVD). The proposed algorithm is an extension of the parallel Jacobi method to para-Hermitian polynomial matrices, as such it is the first architecture devoted to PEVD. Hardware implementation of the algorithm is achieved via a highly pipelined, non-systolic FPGA architecture. The proposed architecture is scalable in terms of the size of the input para-Hermitian matrix. We demonstrate the decomposition accuracy of the architecture through FPGA-in-the-loop hardware co-simulations. Results confirm that the proposed solution gives low execution times while reducing the number of resources required from the FPGA. | 2022-02-13T16:00:07.412Z | {
"ACL": null,
"DBLP": "conf/fpt/KasapR12",
"ArXiv": null,
"MAG": "1994418445",
"CorpusId": "26",
"PubMed": null,
"DOI": "10.1109/FPT.2012.6412125",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7011b84b03f1d992962c4a6c87459f7742bc3165 | FPGA-based design and implementation of an approximate polynomial matrix EVD algorithm | [
{
"authorId": "12653318",
"name": "Server Kasap"
},
{
"authorId": "144237481",
"name": "Soydan Redif"
}
] | 2012 International Conference on Field-Programmable Technology | 2,012 | 16 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2012-12-01T00:00:00 | {
"name": "2012 International Conference on Field-Programmable Technology",
"volume": null,
"pages": "135-140"
} | [
"computer hardware",
"hardware implementations",
"fpga architectures",
"proposed architectures",
"eigenvalue decomposition",
"field programmable gate array",
"hardware architecture"
] | [
"field programmable gate array",
"hardware implementations",
"programmable gate array",
"computer hardware",
"hardware architecture",
"eigenvalues",
"eigenvalue decomposition"
] | [
"computer hardware",
"hardware implementations",
"fpga architectures",
"programmable gate array",
"proposed architectures",
"eigenvalue decomposition",
"field programmable gate array",
"eigenvalues",
"hardware architecture"
] | [
"computer science",
"logic gates",
"network architecture",
"eigenvalues and eigenfunctions",
"computer networks",
"matrix algebra",
"mathematics"
] |
32 | Stress shielding is a well-known failure factor in hip implants. This work proposes a design concept for hip implants, using a combination of metallic stem with a polymer coating (polyether ether ketone (PEEK)). The proposed design concept is simulated using titanium alloy stems and PEEK coatings with thicknesses varying from 100 to 400 μm. The Finite Element analysis of the cancellous bone surrounding the implant shows promising results. The effective von Mises stress increases between 81 and 92% for the complete volume of cancellous bone. When focusing on the proximal zone of the implant, the increased stress transmission to the cancellous bone reaches between 47 and 60%. This increment in load transferred to the bone can influence mineral bone loss due to stress shielding, minimizing such effect, and thus prolonging implant lifespan. | 2022-09-02T03:41:44.559Z | {
"ACL": null,
"DBLP": "journals/cmmm/Anguiano-Sanchez16",
"ArXiv": null,
"MAG": "2294576422",
"CorpusId": "32",
"PubMed": "27051460",
"DOI": "10.1155/2016/6183679",
"PubMedCentral": "4808658"
} | https://www.semanticscholar.org/paper/298eb77d076209f5168f6f1fe27450bda37a21cf | Influence of PEEK Coating on Hip Implant Stress Shielding: A Finite Element Analysis | [
{
"authorId": "1409483450",
"name": "Jesica Anguiano-Sanchez"
},
{
"authorId": "2721717",
"name": "O. M. Romero"
},
{
"authorId": "49882892",
"name": "H. Siller"
},
{
"authorId": "1402178059",
"name": "J. Díaz-Elizondo"
},
{
"authorId": "1399517270",
"name": "E. Flores-Villalba"
},
{
"authorId": "144005583",
"name": "C. Rodríguez"
}
] | Comput. Math. Methods Medicine | 2,016 | 38 | 36 | 2 | true | [
{
"category": "Materials Science",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "s2-fos-model"
},
{
"category": "Materials Science",
"source": "external"
},
{
"category": "Medicine",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2016-03-14T00:00:00 | {
"name": "Computational and Mathematical Methods in Medicine",
"volume": "2016",
"pages": null
} | [
"finite element analysis",
"von mises stress"
] | [
"finite element analysis",
"finite element method",
"von mises stress",
"correlation analysis",
"systems design"
] | [
"finite element analysis",
"correlation analysis",
"systems design",
"finite element method",
"von mises stress"
] | [
"mathematics",
"intelligent control",
"intelligent systems",
"artificial intelligence",
"computer systems",
"computer science"
] |
38 | This paper proposes an RF signal generator using a time domain harmonic suppression technique based on Fourier series analysis. The circuit consists of four differential ring voltage control oscillators (VCO's) with phase differences and the pulse signal summing circuit. By summing pulse signals from VCO's with appropriate phase differences determined by Fourier series in time domain, the third and fifth harmonics can be cancelled without filters. To confirm the validity, a prototypal RF signal generator was fabricated in 90-nm CMOS technology. As a result, we succeeded in generating an RF signal from digital pulse signals. The frequency range is from 1.1 to 3.7GHz with 1-V power supply. The suppression of both the third and fifth harmonics are below -48dBc at 1.1GHz and -42dBc at 3.7GHz. | 2022-08-20T17:57:30.660Z | {
"ACL": null,
"DBLP": "journals/ieiceee/NakanoAIM12",
"ArXiv": null,
"MAG": "2007182960",
"CorpusId": "38",
"PubMed": null,
"DOI": "10.1587/elex.9.270",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/13b8b5bcc8e13ee69e7104a7107ba1663e818260 | RF signal generator using time domain harmonic suppression technique in 90nm CMOS | [
{
"authorId": "2053358173",
"name": "Kazuo Nakano"
},
{
"authorId": "3299508",
"name": "S. Amakawa"
},
{
"authorId": "1812191",
"name": "N. Ishihara"
},
{
"authorId": "1738592",
"name": "K. Masu"
}
] | IEICE Electron. Express | 2,012 | 6 | 0 | 0 | true | [
{
"category": "Engineering",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Engineering",
"source": "external"
}
] | [
"JournalArticle"
] | null | {
"name": "IEICE Electron. Express",
"volume": "9",
"pages": "270-275"
} | [
"rf signal",
"fourier",
"low phase noise",
"time domain",
"frequency ranges"
] | [
"rf signal",
"time domain",
"fourier",
"low phase noise",
"pulse train"
] | [
"rf signal",
"fourier",
"low phase noise",
"time domain",
"pulse train",
"frequency ranges"
] | [
"wireless telecommunication systems",
"microwaves",
"fourier transforms",
"fourier analysis",
"variable frequency oscillators",
"phase noise",
"time domain analysis",
"signal processing",
"antennas",
"computer networks",
"communication systems",
"telecommunication systems",
"spurious signal noise",
"engineering",
"computer science",
"computer systems",
"communication channels",
"signal to noise ratio"
] |
46 | Let G be a maximal planar graph with p vertices, and let Ck(G) denote the number of cycles of length k in G. We first present tight bounds for C3(G) and C4(G) in terms of p. We then give bounds for Ck(G) when 5 ≤ k ≤ p, and consider in particular bounds for Cp(G), in terms of p. Some conjectures and unsolved problems are stated. | 2022-09-01T14:34:31.733Z | {
"ACL": null,
"DBLP": "journals/jgt/HakimiS79",
"ArXiv": null,
"MAG": "2098281668",
"CorpusId": "46",
"PubMed": null,
"DOI": "10.1002/jgt.3190030108",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f23d163a74290aa078c31e49538a435862ed403b | On the number of cycles of length k in a maximal planar graph | [
{
"authorId": "144779600",
"name": "S. Hakimi"
},
{
"authorId": "1762506",
"name": "E. Schmeichel"
}
] | J. Graph Theory | 1,979 | 4 | 40 | 6 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1979-03-01T00:00:00 | {
"name": "J. Graph Theory",
"volume": "3",
"pages": "69-86"
} | [
"graph g",
"planar graph"
] | [
"planar graph",
"vertex set",
"plane graphs",
"directed graphs",
"weighted graph"
] | [
"graph g",
"weighted graph",
"planar graph",
"plane graphs",
"vertex set",
"directed graphs"
] | [
"polynomial approximation",
"graphic methods",
"graph theory",
"theoretical computer science",
"computer science"
] |
47 | Table look-up is an attractive approach to implementing multiplication; however, the size of the requisite multiplication table is prohibitively large for wide operands. A novel transformation which reduces the number of table entries from 2/sup 2b/ to 2/sup b/, where b is the width of the operands, is presented. Two implementation schemes are presented. > | 2022-02-13T16:01:27.040Z | {
"ACL": null,
"DBLP": "journals/tc/Ling90",
"ArXiv": null,
"MAG": "2046952501",
"CorpusId": "47",
"PubMed": null,
"DOI": "10.1109/12.53588",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/fb00d20a2a8b19e72b0ceb0c60e43a1c01dde290 | An Approach to Implementing Multiplication with Small Tables | [
{
"authorId": "31769355",
"name": "Heuey Ling"
}
] | IEEE Trans. Computers | 1,990 | 1 | 17 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1990-05-01T00:00:00 | {
"name": "IEEE Trans. Computers",
"volume": "39",
"pages": "717-718"
} | [
"multiplication",
"table lookup"
] | [
"multiplication",
"multiplier",
"hardware implementations",
"sharing schemes"
] | [
"multiplier",
"sharing schemes",
"multiplication",
"hardware implementations",
"table lookup"
] | [
"frequency multiplying circuits",
"secret images",
"secret sharing schemes",
"multiplying circuits",
"field programmable gate array",
"secret sharing",
"steganography",
"information theory",
"adders",
"integrated circuit layout",
"digital signal processing",
"computer hardware",
"security of data",
"network security",
"cryptography",
"communication",
"vlsi circuits",
"digital arithmetic",
"computer aided design",
"microprocessor chips",
"signal processing",
"computer science",
"computer security",
"computer networks",
"cryptology",
"mathematics",
"engineering"
] |
55 | AdaBoost.MH is a boosting algorithm that is considered to be one of the most accurate algorithms for multilabel classification. It works by iteratively building a committee of weak hypotheses of decision stumps. To build the weak hypotheses, in each iteration, AdaBoost.MH obtains the whole extracted features and examines them one by one to check their ability to characterize the appropriate category. Using Bag-Of-Words for text representation dramatically increases the computational time of AdaBoost.MH learning, especially for large-scale datasets. In this paper we demonstrate how to improve the efficiency and effectiveness of AdaBoost.MH using latent topics, rather than words. A well-known probabilistic topic modelling method, Latent Dirichlet Allocation, is used to estimate the latent topics in the corpus as features for AdaBoost.MH. To evaluate LDA-AdaBoost.MH, the following four datasets have been used: Reuters-21578-ModApte, WebKB, 20-Newsgroups and a collection of Arabic news. The experimental results confirmed that representing the texts as a small number of latent topics, rather than a large number of words, significantly decreased the computational time of AdaBoost.MH learning and improved its performance for text categorization. | 2022-09-02T13:39:12.971Z | {
"ACL": null,
"DBLP": "journals/jis/Al-SalemiAN15",
"ArXiv": null,
"MAG": "2065235656",
"CorpusId": "55",
"PubMed": null,
"DOI": "10.1177/0165551514551496",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/987dbe601d2becca52af60dd2f758d0832337e56 | LDA-AdaBoost.MH: Accelerated AdaBoost.MH based on latent Dirichlet allocation for text categorization | [
{
"authorId": "1399765025",
"name": "Bassam Al-Salemi"
},
{
"authorId": "9281840",
"name": "Mohd Juzaiddin Abd. Aziz"
},
{
"authorId": "2480890",
"name": "S. Noah"
}
] | J. Inf. Sci. | 2,015 | 27 | 21 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2015-02-01T00:00:00 | {
"name": "Journal of Information Science",
"volume": "41",
"pages": "27 - 40"
} | [
"text representation",
"computational efficiency",
"adaptive boosting",
"boosting",
"text classification"
] | [
"adaptive boosting",
"text classification",
"document classification",
"text representation",
"computational efficiency",
"latent variable",
"latent factor",
"weak classifiers",
"boosting",
"haar-like features",
"svm",
"text document",
"document categorization"
] | [
"svm",
"document classification",
"latent variable",
"weak classifiers",
"text representation",
"computational efficiency",
"adaptive boosting",
"boosting",
"haar-like features",
"document categorization",
"text classification",
"text document",
"latent factor"
] | [
"support vector machine",
"text processing",
"information retrieval systems",
"correlation analysis",
"text mining",
"theoretical computer science",
"classifiers",
"face detection",
"matrix factorizations",
"natural language processing",
"computational linguistics",
"data mining",
"information retrieval",
"database systems",
"mathematics",
"computer science",
"machine learning",
"face recognition",
"recommender systems",
"factorization",
"artificial intelligence",
"natural languages",
"computer systems",
"pattern recognition",
"image processing",
"matrix algebra",
"linguistics",
"semantics",
"computer imaging and vision"
] |
66 | Smart buildings combine ICT and IoT technologies (e.g., smart appliances, sensors, actuators and smart meters) in order to provide supervision functions for Building Management Systems (BMS), which are capable to monitor and control both their physical elements (e.g., energy systems, network and storage facilities) and conceptual elements (e.g., building users, usage scenarios, security and trust and intrusion). To develop such systems, there is a need for a common information base which is expressive and flexible enough to describe building elements, their characteristics and interrelationships, as well as the constraints that apply to them. Despite the plethora of existing BMS models, there is still a lack of a common model showing a large compatibility and interoperability with existing BMS. Therefore, we introduce in this paper FUSE-IT ontology which provides a unified view of smart buildings by merging IoT/BMS ontologies such as Semantic Sensor Network (SSN), Smart Appliances REFerence (SAREF), Smart Energy Aware Systems (SEAS), among others. The obtained model is the basis of smart BMS we are aimed to implement within the FUSE-IT project to ensure global physical and cyber security, trust and safety in critical sites. | 2022-08-27T04:03:58.234Z | {
"ACL": null,
"DBLP": "conf/icin/AhvarSTIPBGC17",
"ArXiv": null,
"MAG": "2606067556",
"CorpusId": "66",
"PubMed": null,
"DOI": "10.1109/ICIN.2017.7899430",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/cd011cece28bb726f7e99e0f0f2e244ad234b80a | Ontology-based model for trusted critical site supervision in FUSE-IT | [
{
"authorId": "2444673",
"name": "S. Ahvar"
},
{
"authorId": "144025806",
"name": "Gabriel Santos"
},
{
"authorId": "3160280",
"name": "Nouredine Tamani"
},
{
"authorId": "8714567",
"name": "Bernard Istasse"
},
{
"authorId": "1683082",
"name": "Isabel Praça"
},
{
"authorId": "26279291",
"name": "Paul-Emmanuel Brun"
},
{
"authorId": "1397038647",
"name": "Y. Ghamri-Doudane"
},
{
"authorId": "145107973",
"name": "N. Crespi"
}
] | 2017 20th Conference on Innovations in Clouds, Internet and Networks (ICIN) | 2,017 | 18 | 7 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2017-03-07T00:00:00 | {
"name": "2017 20th Conference on Innovations in Clouds, Internet and Networks (ICIN)",
"volume": null,
"pages": "313-315"
} | [
"internet of things",
"ict",
"energy aware",
"cyber security",
"sensors",
"semantics",
"ontology",
"sensor networks",
"smart energy"
] | [
"ontology",
"smart homes",
"internet of things",
"ict",
"sensors",
"semantics",
"sensor networks",
"energy aware",
"cyber security"
] | [
"internet of things",
"ict",
"energy aware",
"cyber security",
"sensors",
"semantics",
"ontology",
"sensor networks",
"smart energy",
"smart homes"
] | [
"architecture types",
"internet",
"information and communication technologies",
"wireless sensor networks",
"computer crime",
"computer hardware",
"routers",
"wireless telecommunication systems",
"routing algorithms",
"embedded systems",
"smart cities",
"intelligent buildings",
"smart environment",
"software architecture",
"computer science",
"information technology",
"wireless communications",
"energy utilization",
"sensor nodes",
"security of data",
"telecommunication traffic",
"bandwidth",
"computer networks",
"communication systems",
"telecommunication systems",
"computer systems",
"ubiquitous computing",
"automation",
"ambient intelligence",
"software design",
"electricity",
"computer security",
"telecommunication networks",
"user interfaces",
"engineering",
"artificial intelligence",
"software engineering",
"human computer interaction"
] |
94 | Abstract This study examined the extent to which previous experience with duration in first language (L1) vowel distinctions affects the use of duration when perceiving vowels in a second language (L2). Native speakers of Greek (where duration is not used to differentiate vowels) and Japanese (where vowels are distinguished by duration) first identified and rated the eleven English monophthongs, embedded in /bVb/ and /bVp/ contexts, in terms of their L1 categories and then carried out discrimination tests on those English vowels. The results demonstrated that both L2 groups were sensitive to durational cues when perceiving the English vowels. However, listeners were found to temporally assimilate L2 vowels to L1 category/categories. Temporal information was available in discrimination only when the listeners’ L1 duration category/categories did not interfere with the target duration categories and hence the use of duration in such cases cannot be attributed to its perceptual salience as has been proposed. | 2022-09-04T03:57:07.509Z | {
"ACL": null,
"DBLP": "journals/phonetica/Lengeris09",
"ArXiv": null,
"MAG": "2072963766",
"CorpusId": "94",
"PubMed": "19776666",
"DOI": "10.1159/000235659",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/994b244379186e920a187c1b0978ba5bba799baa | Perceptual Assimilation and L2 Learning: Evidence from the Perception of Southern British English Vowels by Native Speakers of Greek and Japanese | [
{
"authorId": "2686522",
"name": "A. Lengeris"
}
] | Phonetica | 2,009 | 46 | 44 | 6 | false | [
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Psychology",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Medicine",
"source": "external"
}
] | [
"JournalArticle"
] | 2009-09-01T00:00:00 | {
"name": "Phonetica",
"volume": "66",
"pages": "169 - 187"
} | [
"japanese"
] | [
"time windows",
"human visual systems",
"online learning",
"form perception",
"test results"
] | [
"time windows",
"form perception",
"japanese",
"human visual systems",
"online learning",
"test results"
] | [
"routing algorithms",
"pattern recognition, visual",
"asian continental ancestry group",
"image quality",
"image coding",
"online systems",
"sensors",
"computer networks",
"pattern recognition",
"genotype",
"genetic association",
"image analysis",
"image processing",
"computer systems",
"computer hardware",
"computer science",
"machine learning",
"single nucleotide polymorphism",
"genetic analysis",
"computer imaging and vision",
"artificial intelligence",
"bioinformatics"
] |
105 | Inverter-based implementation of operational-transconductance amplifiers (OTAs) is an attractive approach for low-voltage realization of analog sub-systems. However, the high sensitivity of inverter-like amplifiers performance to process and temperature variations limits the achievable performance of the whole system, across process and temperature corners. In this paper, a tuning technique is proposed to maintain inverter-based amplifier performance across process and temperature corners without requiring additional voltage headroom than that required by the inverter circuit. The introduced technique is used to implement a third order continuous-time (CT) ΣΔ analog-to-digital converter (ADC). A 74 dB signal-to-noise and distortion ratio (SNDR) is achieved, for a signal bandwidth of 64 kHz at a sampling frequency of 6.4 MHz, while consuming 400 μA from 0.8 V, supply, in 65 nm CMOS technology. | 2022-02-13T15:55:57.971Z | {
"ACL": null,
"DBLP": "conf/socc/MostafaI15",
"ArXiv": null,
"MAG": "2289530163",
"CorpusId": "105",
"PubMed": null,
"DOI": "10.1109/SOCC.2015.7406916",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/bfedff9893a1def07bde07160f84d1951f5cb82a | A Tunable Inverter-Based, Low-Voltage OTA for Continuous-Time ΣΔ ADC | [
{
"authorId": "47931812",
"name": "I. Mostafa"
},
{
"authorId": "39411727",
"name": "A. Ismail"
}
] | 2015 28th IEEE International System-on-Chip Conference (SOCC) | 2,015 | 21 | 0 | 0 | false | [
{
"category": "Engineering",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2015-09-01T00:00:00 | {
"name": "2015 28th IEEE International System-on-Chip Conference (SOCC)",
"volume": null,
"pages": "74-77"
} | [
"operational transconductance amplifiers",
"ota",
"signal bandwidth",
"continuous time"
] | [
"ota",
"transconductors",
"transconductance",
"continuous time",
"operational transconductance amplifiers",
"transconductance amplifier",
"signal bandwidth",
"bandwidth"
] | [
"transconductance amplifier",
"continuous time",
"bandwidth",
"operational transconductance amplifiers",
"signal bandwidth",
"transconductors",
"transconductance",
"ota"
] | [
"feedback amplifiers",
"continuous time systems",
"computer networks",
"gates (transistor)",
"amplifiers (electronic)",
"bandpass amplifiers",
"linear systems",
"linear matrix inequalities",
"computer science",
"integrated circuit layout",
"engineering",
"matrix algebra",
"vlsi circuits",
"computer aided design",
"microprocessor chips",
"mathematics",
"computer hardware"
] |
107 | There is a large, popular, and growing literature on "scale-free" networks with the Internet along with metabolic networks representing perhaps the canonical examples. While this has in many ways reinvigorated graph theory, there is unfortunately no consistent, precise definition of scale-free graphs and few rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many inherent contradictions and that the most celebrated claims regarding the Internet and biology are verifiably false. In this paper, we introduce a structural metric that allows us to differentiate between all simple, connected graphs having an identical degree sequence, which is of particular interest when that sequence satisfies a power law relationship. We demonstrate that the proposed structural metric yields considerable insight into the claimed properties of SF graphs and provides one possible measure of the extent to which a graph is scale-free. This structural view can be related to previously studied graph properties such as the various notions of self-similarity, likelihood, betweenness and assortativity. Our approach clarifies much of the confusion surrounding the sensational qualitative claims in the current literature, and offers a rigorous and quantitative alternative, while suggesting the potential for a rich and interesting theory. This paper is aimed at readers familiar with the basics of Internet technology and comfortable with a theorem-proof style of exposition, but who may be unfamiliar with the existing literature on scale-free networks. | 2022-09-05T01:04:01.840Z | {
"ACL": null,
"DBLP": "journals/im/LiADW05",
"ArXiv": "cond-mat/0501169",
"MAG": "2104828803",
"CorpusId": "107",
"PubMed": null,
"DOI": "10.1080/15427951.2005.10129111",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8dd09cfe9d7b2d4a13e02693112b1f8afa37f222 | Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications | [
{
"authorId": "47681110",
"name": "Lun Li"
},
{
"authorId": "3293014",
"name": "D. Alderson"
},
{
"authorId": "145838187",
"name": "J. Doyle"
},
{
"authorId": "1744426",
"name": "W. Willinger"
}
] | Internet Math. | 2,005 | 256 | 605 | 48 | true | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Biology",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-01-01T00:00:00 | {
"name": "Internet Mathematics",
"volume": "2",
"pages": "431 - 523"
} | [
"scale-free",
"betweenness",
"connected graph",
"graph theory",
"internet"
] | [
"free graphs",
"network architecture",
"internet",
"graph theory",
"connected graph",
"betweenness",
"formal proofs",
"directed graphs",
"weighted graph"
] | [
"weighted graph",
"network architecture",
"formal proofs",
"free graphs",
"scale-free",
"betweenness",
"connected graph",
"graph theory",
"directed graphs",
"internet"
] | [
"graphic methods",
"computer networks",
"formal verifications",
"formal logic",
"graph g",
"complex networks",
"social networks",
"theoretical computer science",
"computer science",
"verification",
"artificial intelligence",
"polynomial approximation",
"topology",
"world wide web",
"verification and validation",
"software quality",
"software design",
"software engineering"
] |
110 | This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical, or expected, in context. We apply a new statistical approach to representing the context of a word through lexical co-occurrence networks. The implementation was trained and evaluated on a large corpus, and results show that the inclusion of second-order co-occurrence relations improves the performance of our implemented lexical choice program. | 2022-09-04T11:04:27.341Z | {
"ACL": "P97-1067",
"DBLP": "conf/acl/Edmonds97",
"ArXiv": "cs/9811009",
"MAG": "2788969586",
"CorpusId": "110",
"PubMed": null,
"DOI": "10.3115/976909.979684",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/af55b01c7e330e78a845772c60bf39e0596463d2 | Choosing the Word Most Typical in Context Using a Lexical Co-occurrence Network | [
{
"authorId": "145660941",
"name": "P. Edmonds"
}
] | ACL | 1,997 | 11 | 97 | 7 | true | [
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1997-07-07T00:00:00 | {
"name": null,
"volume": null,
"pages": "507-509"
} | [] | [
"network architecture",
"correlation analysis",
"syntactics",
"part of speech",
"network components"
] | [
"part of speech",
"network architecture",
"network components",
"correlation analysis",
"syntactics"
] | [
"natural language processing",
"computer networks",
"program compilers",
"mathematics",
"computational linguistics",
"artificial intelligence",
"natural languages",
"computer science",
"parallel processing systems",
"computer programming languages",
"database systems",
"linguistics",
"semantics",
"distributed systems",
"computer programming",
"computer systems",
"distributed computer systems"
] |
112 | Reiter proposed a semantics for knowledge-based Golog programs with sensing where program execution can be conditioned on tests involving explicit references to what the agent knows and does not know. An important result of this work is that reasoning about knowledge after the execution of actions can be reduced to classical reasoning from an initial first-order theory. However, it is limited in that tests can only refer to what is known about the current state, knowledge about knowledge is not considered, and the reduction does not apply to formulas with quantifying-in. This is in large part due to the choice of the underlying formalism, which is Reiter's version of the situation calculus. In this paper we show that, by moving to a new situation calculus recently proposed by Lakemeyer and Levesque, we cannot only reconstruct Reiter's foundations for knowledge-based programs but we can significantly go beyond them, which includes removing the above restrictions and more. | 2022-09-04T22:31:29.984Z | {
"ACL": null,
"DBLP": "conf/kr/ClassenL06",
"ArXiv": null,
"MAG": "175138913",
"CorpusId": "112",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/6f30988144d35741ea0e13d9413f5059171d874f | Foundations for Knowledge-Based Programs using ES | [
{
"authorId": "38204277",
"name": "Jens Claßen"
},
{
"authorId": "1779592",
"name": "G. Lakemeyer"
}
] | KR | 2,006 | 26 | 19 | 2 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2006-06-02T00:00:00 | {
"name": null,
"volume": null,
"pages": "318-328"
} | [
"program execution",
"reasoning",
"semantics"
] | [
"semantics",
"program execution",
"reasoning",
"domain knowledge",
"explicit knowledge"
] | [
"reasoning",
"explicit knowledge",
"domain knowledge",
"program execution",
"semantics"
] | [
"ontology",
"formal languages",
"knowledge management",
"knowledge based systems",
"program processors",
"program compilers",
"linguistics",
"formal languages and automata theory",
"artificial intelligence",
"parallel processing systems",
"microprocessor chips",
"computer programming languages",
"theoretical computer science",
"computer science",
"distributed systems",
"computer hardware",
"computer programming",
"distributed computer systems",
"computer systems"
] |
113 | A graphic monitor program is described. It was developed at Carnegie-Mellon University for the CDC G21 computer, which is a general purpose, batch-processing system with remote entry. The existing G21 system and the graphics hardware are described. The graphic monitor is a resident auxiliary monitor which provides comprehensive managerial capability over the graphical system in response to commands from the human user. It also will respond to commands from a user program through a similar interface, where routine calls take the place of manual actions. Thus the human and program can interact on a symmetrical and equal basis through the medium of the graphic monitor.
The choices made in designing the graphic monitor, given the constraints of the existing hardware and computer system, are discussed.
The structure of the monitor program and the human and program interfaces are described. There is also a transient swapping version with a small resident part, and provision for swapped used submonitors. | 2022-02-13T16:01:26.365Z | {
"ACL": null,
"DBLP": "journals/cacm/BondRC69",
"ArXiv": null,
"MAG": "2023874040",
"CorpusId": "113",
"PubMed": null,
"DOI": "10.1145/363269.363273",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/b4f9611adafc9bd10bdc545e067caf6528060ce9 | An interactive graphical display monitor in a batch-processing environment with remote entry | [
{
"authorId": "2471086",
"name": "A. H. Bond"
},
{
"authorId": "16706866",
"name": "Jerry Rightnour"
},
{
"authorId": "145597191",
"name": "L. Coles"
}
] | CACM | 1,969 | 17 | 2 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1969-11-01T00:00:00 | {
"name": "Commun. ACM",
"volume": "12",
"pages": "595-603"
} | [
"computer hardware",
"computer systems",
"graphics hardware",
"general purpose",
"university"
] | [
"graphical representations",
"university",
"general purpose",
"graphics hardware",
"computer hardware",
"computer systems"
] | [
"computer hardware",
"computer systems",
"graphics hardware",
"graphical representations",
"general purpose",
"university"
] | [
"computer science",
"interactive computer graphics",
"gpu",
"visualization",
"graphic methods",
"program processors",
"education",
"user interfaces",
"computer imaging and vision",
"human computer interaction",
"graph theory",
"parallel processing systems",
"microprocessor chips",
"theoretical computer science",
"distributed systems",
"distributed computer systems"
] |
114 | How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex geometry. We obtain a nearly quadratic lower bound on the complexity of randomized volume algorithms for convex bodies in Ropfn (the current best algorithm has complexity roughly n4, conjectured to be n3). Our main tools, dispersion of random determinants and dispersion of the length of a random point from a convex body, are of independent interest and applicable more generally; in particular, the latter is closely related to the variance hypothesis from convex geometry. This geometric dispersion also leads to lower bounds for matrix problems and property testing | 2022-09-02T08:57:43.539Z | {
"ACL": null,
"DBLP": "conf/focs/RademacherV06",
"ArXiv": "cs/0608054",
"MAG": "2043657648",
"CorpusId": "114",
"PubMed": null,
"DOI": "10.1109/FOCS.2006.26",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/495f26a2f968a56c64e01f2350954260d1458398 | Dispersion of Mass and the Complexity of Randomized Geometric Algorithms | [
{
"authorId": "1768081",
"name": "Luis Rademacher"
},
{
"authorId": "1737804",
"name": "S. Vempala"
}
] | 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) | 2,006 | 57 | 18 | 1 | true | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-08-12T00:00:00 | {
"name": "2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)",
"volume": null,
"pages": "729-738"
} | [
"geometry"
] | [
"geometry",
"adaptive algorithms",
"nonconvex",
"efficient algorithm",
"optimization problems"
] | [
"geometry",
"nonconvex",
"efficient algorithm",
"adaptive algorithms",
"optimization problems"
] | [
"computational efficiency",
"software",
"correlation analysis",
"theoretical computer science",
"computer science",
"mathematics"
] |
119 | The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve som problems in program interface design, using fewer and simpler concepts than the Unified Modelling Language (UML). | 2022-09-03T14:53:33.216Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0802-1586",
"ArXiv": "0802.1586",
"MAG": null,
"CorpusId": "119",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/81073e94d6d94f560382872fa3c19a3a8cf864dd | Program Promises | [
{
"authorId": "2466707",
"name": "D. Aredo"
},
{
"authorId": "145907404",
"name": "M. Burgess"
},
{
"authorId": "2070023176",
"name": "Simen Hagen"
}
] | ArXiv | 2,008 | 17 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2008-02-12T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0802.1586",
"pages": null
} | [
"unified modeling language",
"modeling languages",
"programming models",
"som",
"distributed systems"
] | [
"programming models",
"unified modeling language",
"modeling languages",
"system theory",
"programming languages"
] | [
"unified modeling language",
"modeling languages",
"system theory",
"programming models",
"programming languages",
"som",
"distributed systems"
] | [
"software engineering",
"object oriented programming",
"computer programming languages",
"computational linguistics",
"linguistics",
"artificial intelligence",
"parallel programming",
"self organizing maps",
"distributed computer systems",
"computer science",
"computer programming",
"database systems",
"program processors",
"parallel algorithms",
"parallel architectures",
"conformal mapping",
"computer systems",
"parallel processing systems",
"microprocessor chips",
"mathematics",
"computer hardware"
] |
122 | We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of size $k+1$ in polynomial time. It is defined an unique class problems to be worth to search an efficient solving algorithm. The problems, which are outside of this class, are inherently exponential. We show that the Hamiltonian cycle problem is inherently exponential. | 2022-09-04T21:08:42.987Z | {
"ACL": null,
"DBLP": "journals/corr/cs-DS-9903010",
"ArXiv": "cs/9903010",
"MAG": "1552617269",
"CorpusId": "122",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ece6e38017729b58a3d03c09ba305c2125a243c3 | A class of problems of NP to be worth to search an efficient solving algorithm | [
{
"authorId": "1803555",
"name": "A. Plotnikov"
}
] | ArXiv | 1,999 | 15 | 2 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 1999-03-11T00:00:00 | {
"name": "ArXiv",
"volume": "cs.DS/9903010",
"pages": null
} | [] | [
"adaptive algorithms",
"hybrid algorithms",
"classification models",
"supervised classification",
"classification methods"
] | [
"classification methods",
"hybrid algorithms",
"classification models",
"supervised classification",
"adaptive algorithms"
] | [
"computer systems",
"evolutionary algorithms",
"particle swarm optimization (pso)",
"image classification",
"software",
"computer science",
"genetic algorithms",
"optimization problems",
"optimization",
"swarm intelligence",
"imaging systems",
"artificial intelligence",
"correlation analysis",
"mathematics",
"image reconstruction",
"image analysis",
"image processing",
"computer imaging and vision"
] |
126 | Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a parking lot. The authors show how the model supports polynomial space computation, using certain car configurations as building blocks to construct boolean circuits for a cpu and memory. They consider the use of cars of length 3 crucial to their construction, and conjecture that cars of size 2 only, which we'll call `Size 2 Rush Hour', do not support polynomial space computation. We settle this conjecture by showing that the required building blocks are constructible in Size 2 Rush Hour. Furthermore, we consider Unit Rush Hour, which was hitherto believed to be trivial, show its relation to maze puzzles, and provide empirical support for its hardness. | 2022-08-28T20:20:29.850Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0502068",
"ArXiv": "cs/0502068",
"MAG": "1774345111",
"CorpusId": "126",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f51b3ffb1bababaacc0968040804cb604174311e | Limits of Rush Hour Logic Complexity | [
{
"authorId": "143871691",
"name": "J. Tromp"
},
{
"authorId": "2702975",
"name": "Rudi L. Cilibrasi"
}
] | ArXiv | 2,005 | 3 | 16 | 2 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-02-15T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0502068",
"pages": null
} | [
"cpu",
"polynomial space"
] | [
"polynomial space",
"boolean functions",
"cpu",
"parallel computation",
"efficient computation"
] | [
"boolean functions",
"parallel computation",
"efficient computation",
"cpu",
"polynomial space"
] | [
"mathematics",
"parallel algorithms",
"parallel computing",
"computational efficiency",
"gpu",
"polynomial approximation",
"exact algorithms",
"parallel processing systems",
"parallel architectures",
"theoretical computer science",
"program processors",
"graph theory",
"approximation algorithms",
"distributed systems",
"computer science",
"microprocessor chips",
"approximation theory",
"distributed computer systems",
"computer hardware",
"computer systems"
] |
127 | We present a new feature extraction approach to online Chinese handwriting recognition based on continuous-density hidden Markov models (CDHMM). Given an online handwriting sample, a sequence of time-ordered dominant points are extracted first, which include stroke-endings, points corresponding to local extrema of curvature, and points with a large distance to the chords formed by pairs of previously identified neighboring dominant points. Then, at each dominant point, a 6-dimensional feature vector is extracted, which consists of two coordinate features, two delta features, and two double-delta features. Its effectiveness has been confirmed by experiments for a recognition task with a vocabulary of 9119 Chinese characters and CDHMMs trained from about 10 million samples using both maximum likelihood and discriminative training criteria. | 2022-05-13T13:50:26.843Z | {
"ACL": null,
"DBLP": "conf/icdar/MaHS09",
"ArXiv": null,
"MAG": "2107437841",
"CorpusId": "127",
"PubMed": null,
"DOI": "10.1109/ICDAR.2009.24",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/55b2583fb53944437cdcf2e92e32f9506f414d90 | A Study of Feature Design for Online Handwritten Chinese Character Recognition Based on Continuous-Density Hidden Markov Models | [
{
"authorId": "2109705242",
"name": "Lei Ma"
},
{
"authorId": "2316043",
"name": "Qiang Huo"
},
{
"authorId": "145814852",
"name": "Yu Shi"
}
] | 2009 10th International Conference on Document Analysis and Recognition | 2,009 | 19 | 7 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2009-07-26T00:00:00 | {
"name": "2009 10th International Conference on Document Analysis and Recognition",
"volume": null,
"pages": "526-530"
} | [
"vocabulary",
"hidden markov models",
"handwritten chinese character",
"discriminative training",
"maximum likelihood",
"chinese characters",
"chinese character recognition",
"hidden markov model (hmm)",
"handwriting recognition"
] | [
"hand-written characters",
"character recognition",
"handwritten chinese character",
"chinese characters",
"chinese character recognition",
"hidden markov models",
"hidden markov model (hmm)",
"markov model",
"handwriting recognition",
"vocabulary",
"maximum likelihood",
"discriminative training"
] | [
"vocabulary",
"hidden markov models",
"hand-written characters",
"handwritten chinese character",
"discriminative training",
"maximum likelihood",
"chinese characters",
"chinese character recognition",
"hidden markov model (hmm)",
"character recognition",
"handwriting recognition",
"markov model"
] | [
"linguistics",
"markov processes",
"computational linguistics",
"speech communication",
"maximum likelihood estimation",
"likelihood functions",
"pattern recognition",
"correlation analysis",
"database systems",
"mathematics",
"machine learning",
"computer systems",
"artificial intelligence",
"computer science"
] |
130 | Abstract A fundamental problem in artificial intelligence isthat nobody really knows what intelligence is. Theproblem is especially acute when we need to con-sider artificial systems which are significantly dif-ferent to humans. In this paper we approach thisproblem in the following way: We take a numberof well known informal definitions of human intelli-gence that have been given by experts, and extracttheir essential features. These are then mathemat-ically formalised to produce a general measure ofintelligence for arbitrary machines. We believe thatthis measure formally captures the concept of ma-chine intelligence in the broadest reasonable sense. 1 Introduction Most of us think that we recogniseintelligence whenwe see it, but we are not really sure how to pre-cisely define or measure it. We informally judgethe intelligence of others by relying on our past ex-periences in dealing with people. Naturally, thisnaive approach is highly subjective and imprecise.A more principled approach would be to use oneof the many standard intelligence tests that areavailable. Contrary to popular wisdom, these tests,when correctly applied by a professional, deliverstatisticallyconsistentresults andhaveconsiderablepower to predict the future performance of individ-uals in many mentally demanding tasks. However,while these tests work well for humans, if we wishto measure the intelligence of other things, perhapsof a monkey or a new machine learning algorithm,they are clearly inappropriate.One response to this problem might be to de-velop specific kinds of tests for specific kinds of en-tities; just as intelligence tests for children differto intelligence tests for adults. While this workswell when testing humans of different ages, it comesundone when we need to measure the intelligenceof entities which are profoundly different to eachother in terms of their cognitive capacities, speed,senses, environments in which they operate, and soon. To measure the intelligence of such diverse sys-tems in a meaningful way we must step back fromthe specifics of particular systems and establish theunderlying fundamentals of what it is that we arereally trying to measure. That is, we need to estab-lish a notion of intelligence that goes beyond thespecifics of particular kinds of systems.The difficulty of doing this is readily apparent.Consider, for example, the memory and numericalcomputation tasks that appear in some intelligencetests and which were once regarded as defining hall-marks of human intelligence. We now know thatthese tasks are absolutely trivial for a machine andthus do not test the machine’s intelligence. Indeedeven the mentally demanding task of playing chesshas been largely reduced to brute force search. Astechnology advances, our concept of what intelli-gence is continues to evolve with it.How then are we to develop a concept of intelli-gence that is applicable to all kinds ofsystems? Anyproposed definition must encompass the essence ofhuman intelligence, as well as other possibilities, ina consistent way. It should not be limited to anyparticular set of senses, environments or goals, norshould it be limited to any specific kind of hard-ware, such as silicon or biological neurons. It shouldbe based on principles which are sufficiently funda-mental so as to be unlikely to alter over time. Fur-thermore, the intelligence measure should ideally beformally expressed, objective, and practically real-isable.This paper approaches this problem in the fol-lowing way. In Section 2 we consider a range of def-initions of human intelligence that have been putforward by well known psychologists. From thesewe extract the most common and essential featuresand use them to create an informal definition ofintelligence. Section 3 then introduces the frame-1 | 2022-09-04T23:27:48.703Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0605024",
"ArXiv": "cs/0605024",
"MAG": "1941295027",
"CorpusId": "130",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/215379780993ed63aa6bfc44a536f685252acf04 | A Formal Measure of Machine Intelligence | [
{
"authorId": "34313265",
"name": "S. Legg"
},
{
"authorId": "144154444",
"name": "Marcus Hutter"
}
] | ArXiv | 2,006 | 16 | 72 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-04-14T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0605024",
"pages": null
} | [
"machine learning",
"computer hardware"
] | [
"test results",
"combinatorial problems",
"combinatorial optimization",
"artificial intelligence",
"computing environments"
] | [
"computing environments",
"computer hardware",
"machine learning",
"artificial intelligence",
"test results",
"combinatorial problems",
"combinatorial optimization"
] | [
"cloud computing",
"computer science",
"sensors",
"combinatorial mathematics",
"optimization",
"computer systems",
"graph theory",
"mathematics",
"theoretical computer science"
] |
135 | Current peer-to-peer file-sharing systems mostly work on wired networks. Mobile ad hoc network is characterized as multihop wireless communications between mobile devices. Five routing approaches with different complexity are proposed to enable peer-to-peer file-sharing over mobile ad hoc networks. The complexity of the proposed approaches is evaluated and compared. It is concluded that the cross-layer protocols perform better than simply overlaying peer-to-peer searching protocol on mobile ad hoc networks. | 2022-09-04T20:57:14.654Z | {
"ACL": null,
"DBLP": "conf/percom/DingB04",
"ArXiv": null,
"MAG": "2135861925",
"CorpusId": "135",
"PubMed": null,
"DOI": "10.1109/PERCOMW.2004.1276914",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f7ed96d1ed8488e938e3181a502ca933d429c1d1 | Peer-to-peer file-sharing over mobile ad hoc networks | [
{
"authorId": "48654361",
"name": "G. Ding"
},
{
"authorId": "1712275",
"name": "B. Bhargava"
}
] | IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second | 2,004 | 11 | 215 | 7 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2004-03-14T00:00:00 | {
"name": "IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second",
"volume": null,
"pages": "104-108"
} | [
"peer-to-peer file sharing",
"mobile devices",
"file-sharing system",
"wireless communications",
"mobile ad hoc",
"peer-to-peer",
"routing algorithms",
"ad hoc networks",
"multihop"
] | [
"file sharing",
"network architecture",
"mobile devices",
"multihop",
"wireless",
"wireless communications",
"communication",
"peer-to-peer",
"communication networks",
"mesh network",
"communication protocols",
"transport protocols"
] | [
"peer-to-peer file sharing",
"multihop",
"mobile devices",
"network architecture",
"file-sharing system",
"file sharing",
"wireless communications",
"mobile ad hoc",
"peer-to-peer",
"communication",
"wireless",
"communication networks",
"ad hoc networks",
"transport protocols",
"communication protocols",
"routing algorithms",
"mesh network"
] | [
"wireless telecommunication systems",
"sensors",
"mobile computing",
"computer networks",
"mobile ad hoc networks",
"distributed computer systems",
"internet",
"radio",
"telecommunication networks",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"transmission control protocol",
"data communication systems",
"network protocols",
"wireless mesh networks (wmn)",
"communication systems",
"telecommunication systems",
"computer hardware",
"computer science",
"routing protocols",
"computer systems",
"telecommunication traffic",
"bandwidth",
"communication channels",
"local area networks",
"congestion control (communication)"
] |
141 | Protecting data from malicious computer users continues to grow in importance. Whether preventing unauthorized access to personal photographs, ensuring compliance with federal regulations, or ensuring the integrity of corporate secrets, all applications require increased security to protect data from talented intruders. Specifically, as more and more files are preserved on disk the requirement to provide secure storage has increased in importance. This paper presents a survey of techniques for securely storing data, including theoretical approaches, prototype systems, and existing systems currently available. Due to the wide variety of potential solutions available and the variety of techniques to arrive at a particular solution, it is important to review the entire field prior to selecting an implementation that satisfies particular requirements. This paper provides an overview of the prominent characteristics of several systems to provide a foundation for making an informed decision. Initially, the paper establishes a set of criteria for evaluating a storage solution based on confidentiality, integrity, availability, and performance. Then, using these criteria, the paper explains the relevant characteristics of select storage systems and provides a comparison of the major differences. | 2022-08-30T10:27:43.945Z | {
"ACL": null,
"DBLP": "journals/corr/cs-OS-0409034",
"ArXiv": "cs/0409034",
"MAG": "1623304972",
"CorpusId": "141",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a877883b0e0d2c165ea2da58109954d53e6954c5 | Securing Data in Storage: A Review of Current Research | [
{
"authorId": "119712555",
"name": "P. Stanton"
}
] | ArXiv | 2,004 | 43 | 17 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Review"
] | 2004-09-17T00:00:00 | {
"name": "ArXiv",
"volume": "cs.OS/0409034",
"pages": null
} | [
"storage systems"
] | [
"storage systems",
"storage devices",
"malicious behavior",
"secret key",
"data security"
] | [
"storage systems",
"malicious behavior",
"secret key",
"storage devices",
"data security"
] | [
"computer systems",
"malicious nodes",
"malwares",
"intrusion detection",
"public key cryptography",
"encryption",
"flash memory",
"data privacy",
"network security",
"computer science",
"ad hoc networks",
"wireless sensor networks",
"routing protocols",
"operating systems",
"computer crime",
"authentication",
"security of data",
"cryptography",
"embedded systems",
"privacy",
"computer networks",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"wireless communications",
"energy utilization",
"sensor nodes",
"wireless telecommunication systems",
"computer security",
"cryptology",
"telecommunication traffic",
"bandwidth",
"communication channels",
"telecommunication networks",
"local area networks",
"data communication systems",
"computer hardware",
"electricity",
"communication systems",
"telecommunication systems",
"engineering"
] |
145 | Broadcast networks are often used in modern communication systems. A common broadcast network is a single hop shared media system, where a transmitted message is heard by all neighbors, such as some LAN networks. In this work we consider a more complex environment, in which a transmitted message is heard only by a group of neighbors, such as Ad-Hoc networks, satellite and radio networks, as well as wireless multistation backbone system for mobile communication. It is important to design efficient algorithms for such environments. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n*lg(n)) message transmission complexity. Our distributed solution uses a propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the known point-to-point model. | 2022-06-20T12:15:14.448Z | {
"ACL": null,
"DBLP": "journals/corr/cs-DC-9909011",
"ArXiv": "cs/9909011",
"MAG": "1619605337",
"CorpusId": "145",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/43ba9519a5a17c0d47439bd104f80c477f0ea7f4 | Distributed Algorithms in Multihop Broadcast Networks | [
{
"authorId": "1735597",
"name": "I. Cidon"
},
{
"authorId": "3299563",
"name": "O. Mokryn"
}
] | ArXiv | 1,999 | 13 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1999-09-08T00:00:00 | {
"name": "ArXiv",
"volume": "cs.DC/9909011",
"pages": null
} | [
"mobile communications",
"lan",
"broadcast",
"radio networks",
"leader election",
"wireless",
"ad hoc networks",
"efficient algorithm",
"multihop",
"communication systems"
] | [
"efficient algorithm",
"multihop",
"broadcast",
"data broadcast",
"communication",
"communication systems",
"lan",
"ad hoc networks",
"radio",
"wireless",
"radio networks",
"mobile communications",
"leader election"
] | [
"mobile communications",
"lan",
"broadcast",
"communication",
"leader election",
"wireless",
"communication systems",
"ad hoc networks",
"efficient algorithm",
"multihop",
"data broadcast",
"radio networks",
"radio"
] | [
"mobile telecommunication systems",
"local area networks",
"broadcasting",
"distributed algorithm",
"computer systems",
"routers",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"computational efficiency",
"wireless telecommunication systems",
"mobile computing",
"wireless networks",
"radio communication",
"radio broadcasting",
"communication channels",
"telecommunication networks",
"parallel algorithms",
"computer science",
"telecommunication traffic",
"bandwidth",
"data communication systems",
"computer networks",
"computer hardware",
"theoretical computer science",
"telecommunication systems",
"wireless communications",
"packet networks",
"parallel processing systems",
"distributed systems",
"distributed computer systems"
] |
148 | We address the problem of automatically constructing a thesaurus by clustering words based on corpus data. We view this problem as that of estimating a joint distribution over the Cartesian product of a partition of a set of nouns and a partition of a set of verbs, and propose a learning algorithm based on the Minimum Description Length (MDL) Principle for such estimation. We empirically compared the performance of our method based on the MDL Principle against the Maximum Likelihood Estimator in word clustering, and found that the former outperforms the latter. We also evaluated the method by conducting pp-attachment disambiguation experiments using an automatically constructed thesaurus. Our experimental results indicate that such a thesaurus can be used to improve accuracy in disambiguation. | 2022-09-05T00:56:45.194Z | {
"ACL": "C96-1003",
"DBLP": "journals/corr/cmp-lg-9605014",
"ArXiv": "cmp-lg/9605014",
"MAG": "1964268963",
"CorpusId": "148",
"PubMed": null,
"DOI": "10.3115/992628.992633",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/70553687a7fd9369474edc22971e11cecd5514f7 | Clustering Words with the MDL Principle | [
{
"authorId": "2118384241",
"name": "Hang Li"
},
{
"authorId": "145629164",
"name": "N. Abe"
}
] | COLING | 1,996 | 62 | 38 | 1 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1996-05-11T00:00:00 | {
"name": "ArXiv",
"volume": "cmp-lg/9605014",
"pages": null
} | [
"maximum likelihood estimate",
"clustering algorithms",
"maximum likelihood estimator",
"maximum likelihood estimation"
] | [
"maximum likelihood",
"maximum likelihood estimator",
"maximum likelihood estimation",
"maximum likelihood estimate",
"word sense disambiguation"
] | [
"word sense disambiguation",
"maximum likelihood estimator",
"maximum likelihood",
"maximum likelihood estimation",
"maximum likelihood estimate",
"clustering algorithms"
] | [
"word segmentation",
"likelihood functions",
"mathematics",
"data mining",
"natural language processing",
"computational linguistics",
"character recognition",
"correlation analysis",
"computer science",
"artificial intelligence",
"natural languages",
"database systems",
"pattern recognition",
"linguistics",
"semantics",
"computer systems",
"machine learning"
] |
153 | We consider the Godel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard Godel algebra [0,1], and prove strong completeness of the Fischer Servi intuitionistic modal logic IK plus the prelinearity axiom with respect to this semantics. We axiomatize also the bi-modal analogues of classical T , S4 and S5, obtained by restricting to models over frames satisfying the [0,1]-valued versions of the structural properties which characterize these logics. As an application of the completeness theorems we obtain a representation theorem for bi-modal Godel algebras. | 2022-09-04T05:36:21.556Z | {
"ACL": null,
"DBLP": "journals/logcom/CaicedoR15",
"ArXiv": "1110.2407",
"MAG": "2169921622",
"CorpusId": "153",
"PubMed": null,
"DOI": "10.1093/logcom/exs036",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7e6dba2d331750c3f1d31d249aa6dfc18a71d7f9 | Bi-modal Gödel logic over [0, 1]-valued Kripke frames | [
{
"authorId": "1753722",
"name": "X. Caicedo"
},
{
"authorId": "1805286",
"name": "R. Rodríguez"
}
] | J. Log. Comput. | 2,011 | 40 | 54 | 3 | true | [
{
"category": "Philosophy",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2011-10-11T00:00:00 | {
"name": "ArXiv",
"volume": "abs/1110.2407",
"pages": null
} | [
"frames",
"modal logic",
"semantics",
"kripke model"
] | [
"kripke model",
"frames",
"modal logic",
"semantics",
"kripke semantics"
] | [
"modal logic",
"kripke semantics",
"frames",
"semantics",
"kripke model"
] | [
"formal logic",
"structural frames",
"artificial intelligence",
"hidden markov models",
"markov random fields",
"hidden markov model (hmm)",
"computer science",
"markov processes",
"image segmentation",
"correlation analysis",
"image analysis",
"image processing",
"mathematics",
"computer imaging and vision"
] |
157 | Nous donnons ici quelques resultats sur les fonctions recursives au moyen des fibrations. Une premiere approche de cette formalisation avait ete faite par P. Mulry en utilisant la theorie des topos. En utilisant les resultats trouves ici, nous donnons les premieres definitions pour une formalisation abstraite des fonctions partielles. | 2022-04-22T04:41:07.410Z | {
"ACL": null,
"DBLP": "journals/ita/Mijoule95",
"ArXiv": null,
"MAG": "1603906406",
"CorpusId": "157",
"PubMed": null,
"DOI": "10.1051/ita/1995290301931",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/310f1a47791172ea103618816e00e2c68c04e1fa | Fibrations and Recursivity | [
{
"authorId": "2096420327",
"name": "Richard Mijoule"
}
] | RAIRO Theor. Informatics Appl. | 1,995 | 10 | 0 | 0 | true | null | [
"JournalArticle"
] | null | {
"name": "RAIRO Theor. Informatics Appl.",
"volume": "29",
"pages": "193-208"
} | [] | [
"intercarrier interference",
"mai",
"intercell interference",
"formal semantics"
] | [
"formal semantics",
"mai",
"intercell interference",
"intercarrier interference"
] | [
"formal methods",
"formal languages",
"multiple access interference",
"radio interference",
"carrier frequency offsets",
"frequency division multiplexing",
"ofdm systems",
"bit error rate",
"signal interference",
"formal logic",
"linguistics",
"formal languages and automata theory",
"spread spectrum communication",
"fading (radio)",
"signal encoding",
"frequency estimation",
"frequency allocation",
"ofdm",
"channel estimation",
"orthogonal frequency division multiplexing",
"communication channels",
"signal to noise ratio",
"probability",
"spurious signal noise",
"artificial intelligence",
"theoretical computer science",
"code division multiple access",
"signal receivers",
"signal detection",
"telecommunication traffic",
"data communication systems",
"wireless telecommunication systems",
"signal processing",
"mathematics",
"computer science",
"telecommunication networks",
"computer systems",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering"
] |
158 | For practical wireless DS-CDMA systems, channel estimation is imperfect due to noise and interference. The impact of channel estimation error on multiuser detection (MUD) is analyzed under the framework of the replica method. System performance is obtained in the large system limit for optimal MUD, linear MUD and turbo MUD, and is validated by the numerical results of finite systems. | 2022-09-04T05:52:25.430Z | {
"ACL": null,
"DBLP": "conf/globecom/LiP04b",
"ArXiv": "cs/0501047",
"MAG": "1596699513",
"CorpusId": "158",
"PubMed": null,
"DOI": "10.1109/GLOCOM.2004.1379047",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/340ede90d0fdcf15150b9f2a5abe872c4b1b2ad3 | Impact of channel estimation error on multiuser detection via the replica method | [
{
"authorId": "49404051",
"name": "Husheng Li"
},
{
"authorId": "145967056",
"name": "H. Poor"
}
] | IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. | 2,004 | 29 | 5 | 1 | false | [
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2004-11-29T00:00:00 | {
"name": "IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.",
"volume": "6",
"pages": "3636-3640 Vol.6"
} | [
"multiuser detection",
"channel estimation",
"numerical results",
"wireless",
"ds-cdma system",
"channel estimation errors"
] | [
"channel estimation",
"channel estimation errors",
"estimation method",
"multiuser detection",
"multi-user detectors",
"wireless",
"cdma system",
"numerical results"
] | [
"estimation method",
"multiuser detection",
"numerical results",
"channel estimation",
"cdma system",
"wireless",
"ds-cdma system",
"channel estimation errors",
"multi-user detectors"
] | [
"numerical model",
"code division multiple access",
"signal receivers",
"signal interference",
"wireless telecommunication systems",
"numerical methods",
"communication channels",
"radio",
"ds-cdma",
"channel state information",
"multiple access interference",
"mathematics",
"signal to noise ratio",
"signal detection",
"spurious signal noise",
"computer networks",
"communication systems",
"telecommunication systems",
"diversity reception",
"mobile radio systems",
"direct sequence systems",
"radio links",
"fading (radio)",
"rayleigh fading",
"multiplexing",
"channel capacity",
"transmitters",
"mimo systems",
"spread spectrum communication",
"radio interference",
"signal processing",
"computer science",
"computer systems",
"cellular radio systems",
"multipath propagation",
"radio receivers",
"interference suppression",
"bit error rate",
"fading channels",
"information theory",
"antennas",
"engineering",
"telecommunication traffic",
"probability",
"communication",
"telecommunication networks"
] |
161 | Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a two-stage VC generation algorithm that generates compact VCs whose size is worst-case quadratic in the size of the source fragment, and is close to linear in practice.This two-stage VC generation algorithm has been implemented as part of the Extended Static Checker for Java. It has allowed us to check large and complex methods that would otherwise be impossible to check due to time and space constraints. | 2022-09-04T19:12:06.372Z | {
"ACL": null,
"DBLP": "conf/popl/FlanaganS01",
"ArXiv": null,
"MAG": "1992431017",
"CorpusId": "161",
"PubMed": null,
"DOI": "10.1145/360204.360220",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/5152efb643850236f96daecdbb5d879782ffde77 | Avoiding exponential explosion: generating compact verification conditions | [
{
"authorId": "144692078",
"name": "C. Flanagan"
},
{
"authorId": "1804564",
"name": "J. Saxe"
}
] | POPL '01 | 2,001 | 22 | 262 | 29 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | null | {
"name": null,
"volume": null,
"pages": "193-205"
} | [
"verification",
"code fragments",
"java"
] | [
"verification",
"verification method",
"java",
"adaptive algorithms",
"post-conditions"
] | [
"verification",
"code fragments",
"post-conditions",
"verification method",
"adaptive algorithms",
"java"
] | [
"verification and validation",
"code clone",
"model checking",
"formal verifications",
"software",
"object oriented programming",
"computer programming languages",
"high level languages",
"software quality",
"clone detection",
"source codes",
"embedded systems",
"architecture verification and validation",
"computer science",
"computer programming",
"software design",
"computer software maintenance",
"software engineering",
"computer systems",
"architecting",
"software architecture"
] |
162 | The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the $\eta$-bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a deterministic pushdown automaton ${\cal M}$. We then exhibit a complete formal system for deducing equivalent pairs of such vectors. | 2022-09-03T22:12:18.456Z | {
"ACL": null,
"DBLP": "journals/siamcomp/Senizergues05",
"ArXiv": "cs/0008018",
"MAG": "2022264236",
"CorpusId": "162",
"PubMed": null,
"DOI": "10.1137/S0097539700377256",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/974267bbb05a78ee2677c140e2a3a1c904731f24 | The Bisimulation Problem for Equational Graphs of Finite Out-Degree | [
{
"authorId": "1743477",
"name": "Géraud Sénizergues"
}
] | SIAM J. Comput. | 2,000 | 51 | 48 | 7 | true | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2000-08-22T00:00:00 | {
"name": "SIAM J. Comput.",
"volume": "34",
"pages": "1025-1106"
} | [
"automation",
"deterministic"
] | [
"boolean functions",
"deterministic",
"push-down automata",
"automation",
"nondeterministic finite automaton"
] | [
"boolean functions",
"automation",
"nondeterministic finite automaton",
"push-down automata",
"deterministic"
] | [
"mathematics",
"engineering",
"translation (languages)",
"number of state",
"pipeline processing systems",
"finite automata",
"stochastic",
"computational linguistics",
"automata theory",
"linguistics",
"program processors",
"stochastic processes",
"stochasticity",
"database systems",
"formal languages and automata theory",
"parallel processing systems",
"microprocessor chips",
"probability",
"numerical model",
"computer systems",
"theoretical computer science",
"distributed systems",
"computer hardware",
"computer science",
"distributed computer systems"
] |
167 | Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various parameters regarding the interaction of knowledge with time and regarding the language used. All the logics considered involve the discrete time linear temporal logic operators "next" and "until" and an operator for the knowledge of each of a number of agents. Both the single-agent and multiple-agent cases are studied: in some instances of the latter there is also an operator for the common knowledge of the group of all agents. Four different semantic properties of agents are considered: whether they (i) have a unique initial state, (ii) operate synchronously, (iii) have perfect recall, and (iv) learn. The property of no learning is essentially dual to perfect recall. Not all settings of these parameters lead to recursively axiomatizable logics, but sound and complete axiomatizations are presented for all the ones that do. | 2022-09-04T19:17:41.590Z | {
"ACL": null,
"DBLP": "journals/corr/cs-LO-0208033",
"ArXiv": "cs/0208033",
"MAG": "1645519945",
"CorpusId": "167",
"PubMed": null,
"DOI": "10.1137/S0097539797320906",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/3a0d6ec2a7a0111cbf899d15f222e61b8e71559a | Complete Axiomatizations for Reasoning about Knowledge and Time | [
{
"authorId": "1691828",
"name": "Joseph Y. Halpern"
},
{
"authorId": "1780250",
"name": "R. V. D. Meyden"
},
{
"authorId": "9083969",
"name": "Moshe Y. Vardi"
}
] | SIAM J. Comput. | 2,002 | 21 | 190 | 19 | true | [
{
"category": "Philosophy",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2002-08-20T00:00:00 | {
"name": "ArXiv",
"volume": "cs.LO/0208033",
"pages": null
} | [
"discrete-time",
"reasoning",
"single-agent",
"linear temporal logic",
"semantics"
] | [
"reasoning",
"discrete-time",
"linear temporal logic",
"temporal logic",
"software agents",
"intelligent agents",
"semantics"
] | [
"reasoning",
"discrete-time",
"single-agent",
"software agents",
"linear temporal logic",
"temporal logic",
"intelligent agents",
"semantics"
] | [
"ontology",
"formal languages",
"discrete time control systems",
"multi-agent",
"multiagent system",
"model checking",
"automata theory",
"formal logic",
"linguistics",
"formal languages and automata theory",
"nonlinear control systems",
"linear matrix inequalities",
"artificial intelligence",
"embedded systems",
"architecture verification and validation",
"theoretical computer science",
"adaptive control systems",
"feedback systems",
"control theory",
"matrix algebra",
"computer science",
"computer systems",
"architecting",
"process control",
"mathematics",
"software architecture",
"automation",
"software design",
"engineering",
"software engineering"
] |
170 | We consider the problem of coloring Erdös-Rényi and regular random graphs of finite connectivity using q colors. It has been studied so far using the cavity approach within the so-called one-step replica symmetry breaking (1RSB) ansatz. We derive a general criterion for the validity of this ansatz and, applying it to the ground state, we provide evidence that the 1RSB solution gives exact threshold values c(q) for the transition from the colorable to the uncolorable phase with q colors. We also study the asymptotic thresholds for q>>1 finding c(q) =2q ln q-ln q-1+o (1) in perfect agreement with rigorous mathematical bounds, as well as the nature of excited states, and give a global phase diagram of the problem. | 2022-09-04T06:23:59.789Z | {
"ACL": null,
"DBLP": "journals/corr/cond-mat-0403725",
"ArXiv": "cond-mat/0403725",
"MAG": "1980731606",
"CorpusId": "170",
"PubMed": "15600563",
"DOI": "10.1103/PhysRevE.70.046705",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f379e4b8621092fad560b65098dea35c7678df40 | Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs | [
{
"authorId": "2909402",
"name": "F. Krzakala"
},
{
"authorId": "1774629",
"name": "A. Pagnani"
},
{
"authorId": "1817094",
"name": "M. Weigt"
}
] | Physical review. E, Statistical, nonlinear, and soft matter physics | 2,004 | 83 | 55 | 5 | true | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Physics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Medicine",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-03-30T00:00:00 | {
"name": "Physical review. E, Statistical, nonlinear, and soft matter physics",
"volume": "70 4 Pt 2",
"pages": "\n 046705\n "
} | [
"random graphs",
"coloring problems",
"coloring"
] | [
"coloring",
"random graphs",
"global stability",
"asymptotic stability",
"asymptotical stability"
] | [
"coloring problems",
"asymptotical stability",
"random graphs",
"asymptotic stability",
"global stability",
"coloring"
] | [
"graph coloring",
"control system stability",
"stability criteria",
"delay control systems",
"sufficient conditions",
"numerical example",
"graph theory",
"random processes",
"linear matrix inequalities",
"adaptive control systems",
"lyapunov functions",
"control system analysis",
"control systems",
"time delay",
"numerical methods",
"theoretical computer science",
"probability",
"matrix algebra",
"process control",
"differential equations",
"computer systems",
"mathematics",
"computer science",
"automation",
"engineering"
] |
171 | Presently, tree coders are the best bi-level image coders. The current ISO standard, JBIG, is a good example. By organising code length calculations properly a vast number of possible models (trees) can be investigated within reasonable time prior to generating code. Three general-purpose coders are constructed by this principle. A multi-pass free tree coding scheme produces superior compression results for all test images. A multi-pass fast free template coding scheme produces much better results than JBIG for difficult images, such as halftonings. Rissanen's algorithm 'Context' is presented in a new version that without sacrificing speed brings it close to the multi-pass coders in compression performance. | 2022-08-24T09:46:35.915Z | {
"ACL": null,
"DBLP": "conf/dcc/MartinsF96",
"ArXiv": null,
"MAG": "2129182828",
"CorpusId": "171",
"PubMed": null,
"DOI": "10.1109/DCC.1996.488332",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/229de59406eaf24f158e497ea3a22f9d6ae1ef9b | Bi-level image compression with tree coding | [
{
"authorId": "2937905",
"name": "B. Martins"
},
{
"authorId": "1709891",
"name": "S. Forchhammer"
}
] | Proceedings of Data Compression Conference - DCC '96 | 1,996 | 18 | 26 | 6 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 1996-03-31T00:00:00 | {
"name": "Proceedings of Data Compression Conference - DCC '96",
"volume": null,
"pages": "270-279"
} | [
"coding scheme",
"compression performance",
"image compression",
"code length"
] | [
"reference image",
"color images",
"digital image",
"image compression",
"compression ratio (machinery)",
"code length",
"general purpose",
"compression performance"
] | [
"compression performance",
"compression ratio (machinery)",
"digital image",
"reference image",
"image compression",
"code length",
"general purpose",
"coding scheme",
"color images"
] | [
"data compression",
"imaging systems",
"image analysis",
"image processing",
"image matching",
"image quality",
"image coding",
"coding errors",
"ldpc codes",
"program processors",
"network coding",
"pattern recognition",
"color image processing",
"image reconstruction",
"computer imaging and vision",
"signal encoding",
"bit error rate",
"low-density parity-check codes",
"parallel processing systems",
"microprocessor chips",
"multicasts",
"information theory",
"machine learning",
"image segmentation",
"computer science",
"communication channels",
"signal to noise ratio",
"probability",
"iterative decoding",
"channel capacity",
"graph theory",
"matrix algebra",
"distributed systems",
"computer hardware",
"wireless telecommunication systems",
"telecommunication networks",
"bandwidth",
"data communication systems",
"communication",
"artificial intelligence",
"signal processing",
"mathematics",
"theoretical computer science",
"distributed computer systems",
"computer networks",
"communication systems",
"telecommunication systems",
"computer systems",
"engineering"
] |
172 | To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are equivalent to convolving the samples with a reconstruction filter; this covers all commonly used schemes, including trilinear and cubic interpolation. We first outline the formal basis of interpolation in three-dimensional signal processing theory. We then propose numerical metrics that can be used to measure filter characteristics that are relevant to the appearance of images generated using that filter. We apply those metrics to several previously used filters and relate the results to isosurface images of the interpolations. We show that the choice of interpolation scheme can have a dramatic effect on image quality, and we discuss the cost/benefit tradeoff inherent in choosing a filter.<<ETX>> | 2022-09-04T22:14:05.890Z | {
"ACL": null,
"DBLP": "conf/visualization/MarschnerL94",
"ArXiv": null,
"MAG": "2111794246",
"CorpusId": "172",
"PubMed": null,
"DOI": "10.1109/VISUAL.1994.346331",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/959a84bc27f953c91561df8833d25f2847ec2911 | An evaluation of reconstruction filters for volume rendering | [
{
"authorId": "2593798",
"name": "S. Marschner"
},
{
"authorId": "144524076",
"name": "R. Lobb"
}
] | Proceedings Visualization '94 | 1,994 | 28 | 339 | 50 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1994-10-17T00:00:00 | {
"name": "Proceedings Visualization '94",
"volume": null,
"pages": "100-107"
} | [
"reconstruction",
"signal processing",
"image quality"
] | [
"reconstruction",
"interpolation algorithms",
"signal processing",
"image quality",
"spline interpolation",
"color images",
"reference image",
"digital image"
] | [
"interpolation algorithms",
"spline interpolation",
"digital image",
"reference image",
"image quality",
"reconstruction",
"signal processing",
"color images"
] | [
"numerical control systems",
"splines",
"image analysis",
"image processing",
"image matching",
"image reconstruction",
"engineering",
"pattern recognition",
"color image processing",
"process control",
"machining",
"computer control systems",
"computer aided design",
"computer imaging and vision",
"machine learning",
"image segmentation",
"automation",
"computer aided manufacturing",
"software",
"computer science",
"artificial intelligence"
] |
173 | The easy-hard-easy pattern in the difficulty of combinatorial search problems as constraints are added has been explained as due to a competition between the decrease in number of solutions and increased pruning. We test the generality of this explanation by examining one of its predictions: if the number of solutions is held fixed by the choice of problems, then increased pruning should lead to a monotonic decrease in search cost. Instead, we find the easy-hard-easy pattern in median search cost even when the number of solutions is held constant, for some search methods. This generalizes previous observations of this pattern and shows that the existing theory does not explain the full range of the peak in search cost. In these cases the pattern appears to be due to changes in the size of the minimal unsolvable subproblems, rather than changing numbers of solutions. | 2022-09-03T03:16:19.083Z | {
"ACL": null,
"DBLP": "journals/jair/MammenH97",
"ArXiv": "cs/9707101",
"MAG": "2950953913",
"CorpusId": "173",
"PubMed": null,
"DOI": "10.1613/jair.370",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/86b3fc8bcdb6361cdc0a89275ba780721a1f6726 | A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty | [
{
"authorId": "2663403",
"name": "Dorothy L. Mammen"
},
{
"authorId": "144157926",
"name": "T. Hogg"
}
] | J. Artif. Intell. Res. | 1,997 | 22 | 47 | 3 | true | [
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 1997-06-30T00:00:00 | {
"name": "J. Artif. Intell. Res.",
"volume": "7",
"pages": "47-66"
} | [] | [
"search process",
"search engines",
"investment costs",
"capital investment",
"combinatorial problems"
] | [
"search engines",
"search process",
"combinatorial problems",
"capital investment",
"investment costs"
] | [
"world wide web",
"evolutionary algorithms",
"combinatorial mathematics",
"investments",
"internet",
"genetic algorithms",
"graph theory",
"economics",
"computer science",
"artificial intelligence",
"theoretical computer science"
] |
176 | With the increasing in complexion of large-scale activities in business process, workflow model has been focused on highly than before. In this research, a new workflow model (WfM) with two layers (Step and Task layers) was proposed, which leads to process logic and concrete affairs couple loose, and deals with problems of simple logic of directed graph WfM and complex realization of net structure WfM. With the half structure model, process logic is defined during design, and real tasks route is chosen in practice, which enhances the flexibility of WfM. Besides, the notion, document-driven workflow, was introduced in that WfM. The parsing process of documents, the design format of documents and the delivery technology were also given. In order to accomplish a complete WfM, we integrated WfM and organization model in both static and dynamic ways. Finally we delineate the realization of S-T platform based on that WfM in this paper. | 2022-08-25T04:11:08.543Z | {
"ACL": null,
"DBLP": "conf/apscc/ZhaoXM06",
"ArXiv": null,
"MAG": null,
"CorpusId": "176",
"PubMed": null,
"DOI": "10.1109/APSCC.2006.103",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/112fa3232d4d7cfc2b4109fa0dee4891e6f083ae | The Research and Realization of a New Workflow Model with Step-Task Two Layers Based on Document | [
{
"authorId": "46586837",
"name": "Lin Zhao"
},
{
"authorId": "143801516",
"name": "J. Xing"
},
{
"authorId": "46643492",
"name": "Lingguo Meng"
}
] | APSCC | 2,006 | 17 | 5 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | null | {
"name": null,
"volume": null,
"pages": "285-292"
} | [
"parsing algorithm",
"business process",
"directed graphs"
] | [
"business process",
"electronic document",
"text document",
"bpm",
"routing scheme"
] | [
"bpm",
"electronic document",
"parsing algorithm",
"business process",
"routing scheme",
"text document",
"directed graphs"
] | [
"word processing",
"natural language processing",
"computational linguistics",
"formal languages",
"information systems",
"routing protocols",
"routing algorithms",
"text mining",
"information retrieval systems",
"graph theory",
"text processing",
"artificial intelligence",
"natural languages",
"database systems",
"linguistics",
"formal languages and automata theory",
"computer systems",
"routers",
"wireless telecommunication systems",
"computer networks",
"information retrieval",
"theoretical computer science",
"data mining",
"computer science",
"semantics",
"telecommunication traffic",
"bandwidth",
"communication systems",
"telecommunication systems",
"telecommunication networks"
] |
181 | Interest in grid computing has grown significantly over the past five years. Management of distributed cluster resources is a key issue in grid computing. Central to management of resources is the effectiveness of resource allocation, as it determines the overall utility of the system. In this paper, we propose a new grid system that consists of grid federation agents which couple together distributed cluster resources to enable a cooperative environment. The agents use a computational economy methodology, that facilitates QoS scheduling, with a cost-time scheduling heuristic based on a scalable, shared federation directory. We show by simulation, while some users that are local to popular resources can experience higher cost and/or longer delays, the overall users' QoS demands across the federation are better met. Also, the federation's average case message passing complexity is seen to be scalable, though some jobs in the system may lead to large numbers of messages before being scheduled | 2022-09-04T23:09:17.258Z | {
"ACL": null,
"DBLP": "conf/cluster/RanjanBH05",
"ArXiv": "cs/0605060",
"MAG": "1968867007",
"CorpusId": "181",
"PubMed": null,
"DOI": "10.1109/CLUSTR.2005.347038",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c1842e6b818b7e572140dee401eb56893f5f6fe8 | A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters | [
{
"authorId": "144928956",
"name": "R. Ranjan"
},
{
"authorId": "1709598",
"name": "R. Buyya"
},
{
"authorId": "145098019",
"name": "A. Harwood"
}
] | 2005 IEEE International Conference on Cluster Computing | 2,005 | 58 | 37 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2005-09-01T00:00:00 | {
"name": "2005 IEEE International Conference on Cluster Computing",
"volume": null,
"pages": "1-11"
} | [
"grid computing",
"qos",
"grid systems"
] | [
"grid node",
"grid computing",
"qos",
"grid environments",
"computational grids",
"grid systems",
"multiagent system",
"time delay",
"queueing delays"
] | [
"time delay",
"qos",
"grid node",
"grid environments",
"grid systems",
"computational grids",
"grid computing",
"queueing delays",
"multiagent system"
] | [
"computer systems",
"quality of service",
"parallel processing systems",
"queuing network",
"artificial intelligence",
"computer science",
"telecommunication traffic",
"bandwidth",
"distributed systems",
"queueing theory",
"telecommunication networks",
"computer networks",
"distributed computer systems",
"telecommunication systems"
] |
187 | Gaussian mixture models (GMM) and support vector machines (SVM) are introduced to classify faults in a population of cylindrical shells. The proposed procedures are tested on a population of 20 cylindrical shells and their performance is compared to the procedure, which uses multi-layer perceptrons (MLP). The modal properties extracted from vibration data are used to train the GMM, SVM and MLP. It is observed that the GMM produces 98%, SVM produces 94% classification accuracy while the MLP produces 88% classification rates. | 2022-09-02T04:55:05.440Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0705-0197",
"ArXiv": "0705.0197",
"MAG": "2004012946",
"CorpusId": "187",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/768a67872f5d9d21306d4d567819277955c60ae6 | Fault Classification in Cylinders Using Multilayer Perceptrons, Support Vector Machines and Guassian Mixture Models | [
{
"authorId": "1740675",
"name": "T. Marwala"
},
{
"authorId": "2746742",
"name": "Unathi Mahola"
},
{
"authorId": "47204741",
"name": "S. Chakraverty"
}
] | ArXiv | 2,007 | 26 | 5 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-05-01T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0705.0197",
"pages": null
} | [
"classification rates",
"svm",
"support vector machine",
"vibration data",
"multilayer perceptrons",
"gaussian mixtures"
] | [
"support vector machine",
"multilayer perceptrons",
"support vector",
"svm",
"gaussians",
"gaussian mixtures",
"vibration data",
"classification rates"
] | [
"classification rates",
"svm",
"support vector",
"support vector machine",
"vibration data",
"gaussians",
"multilayer perceptrons",
"gaussian mixtures"
] | [
"classification methods",
"classifiers",
"vibration signal",
"gaussian distribution",
"neural networks",
"computer systems",
"machine learning",
"wavelet transforms",
"fault detection",
"gaussian noise (electronic)",
"computer science",
"artificial intelligence",
"image processing",
"mathematics",
"engineering",
"signal to noise ratio",
"computer imaging and vision",
"signal processing"
] |
190 | We consider a general multiple-antenna network with multiple sources, multiple destinations, and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or nonclustered). We first study the multiple-antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link are increased, whereas CF continues to perform optimally. We also study the multiple-antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source-destination pair and multiple relays, each node with a single antenna, and show that even under the ideal assumption of full-duplex relays and a clustered network, this virtual multiple-input multiple-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains in effect. | 2022-09-05T02:26:52.927Z | {
"ACL": null,
"DBLP": "journals/tit/YukselE07",
"ArXiv": "cs/0609122",
"MAG": "1838709606",
"CorpusId": "190",
"PubMed": null,
"DOI": "10.1109/TIT.2007.904972",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/e161d3659a48c47a9018d4f8fa5ca59d94a93ae6 | Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective | [
{
"authorId": "144769056",
"name": "M. Yuksel"
},
{
"authorId": "1766950",
"name": "E. Erkip"
}
] | IEEE Transactions on Information Theory | 2,006 | 111 | 351 | 37 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2006-09-21T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "53",
"pages": "3371-3393"
} | [
"direct links",
"half-duplex",
"geometry",
"diversity-multiplexing trade-off",
"antennas",
"mimo",
"decode-and-forward",
"multiple-input-multiple-output",
"wireless",
"relay channels",
"half-duplex relay",
"full-duplex",
"single antenna",
"cooperative systems",
"multiple access relay channel"
] | [
"multiple antenna",
"antennas",
"wireless",
"multiplexing",
"decode-and-forward relay",
"geometry",
"relay channels",
"multiple access",
"single antenna",
"mimo",
"cooperative systems"
] | [
"direct links",
"half-duplex",
"antennas",
"diversity-multiplexing trade-off",
"geometry",
"mimo",
"decode-and-forward",
"multiplexing",
"multiple access",
"multiple antenna",
"wireless",
"relay channels",
"multiple access relay channel",
"half-duplex relay",
"full-duplex",
"single antenna",
"cooperative systems",
"decode-and-forward relay",
"multiple-input-multiple-output"
] | [
"cooperative communication",
"mimo systems",
"wireless telecommunication systems",
"fading (radio)",
"diversity gain",
"outage probability",
"orthogonal frequency division multiplexing",
"cooperative relay",
"transmit power",
"cooperative networks",
"outage performance",
"power constraints",
"cooperative transmission",
"symbol error rates",
"optimal power allocation",
"analytical results",
"nakagami-m fading",
"communication channels",
"signal to noise ratio",
"wireless networks",
"frequency division multiple access",
"multiple access interference",
"fading channels",
"beamforming",
"transmitters",
"radio",
"amplify-and-forward (af)",
"channel capacity",
"two sources",
"relay node",
"mobile antennas",
"relay selection",
"wireless sensor networks",
"communication",
"computer networks",
"communication systems",
"telecommunication systems",
"bit error rate",
"signal detection",
"probability",
"cognitive radio",
"cooperative relaying",
"power allocations",
"numerical results",
"power control",
"channel state information",
"closed-form expression",
"outages",
"cooperative diversity",
"signal encoding",
"rayleigh fading",
"signal processing",
"wireless communications",
"packet networks",
"frequency allocation",
"spread spectrum communication",
"radio interference",
"signal receivers",
"information theory",
"network coding",
"ad hoc networks",
"mobile telecommunication systems",
"antenna arrays",
"directional patterns (antenna)",
"energy utilization",
"sensor nodes",
"routing algorithms",
"computer science",
"computer systems",
"mathematics",
"numerical methods",
"code division multiple access",
"diversity reception",
"engineering",
"telecommunication traffic",
"data communication systems",
"signal interference",
"multicasts",
"routers",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"sensors",
"telecommunication networks",
"matrix algebra",
"electricity",
"spurious signal noise",
"bandwidth",
"local area networks",
"computer hardware"
] |
195 | Given a language L and a nondeterministic finite automaton M , we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long the shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), the words matching a general pattern, and the bordered words. Along the way, we improve a bound of Horváth, Karhumäki and Kleijn on the shortest non-palindrome. | 2022-06-30T20:22:35.650Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0711-3183",
"ArXiv": null,
"MAG": "135810796",
"CorpusId": "195",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/46e3696d20c84748d781cc9d7a8088e6fd378ff9 | Finite automata, palindromes, patterns, and borders | [
{
"authorId": "2068151009",
"name": "Terry Anderson"
},
{
"authorId": "1735273",
"name": "N. Rampersad"
},
{
"authorId": "1751477",
"name": "N. Santean"
},
{
"authorId": "1679162",
"name": "J. Shallit"
}
] | ArXiv | 2,007 | 39 | 3 | 0 | false | [
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | null | {
"name": "ArXiv",
"volume": "abs/0711.3183",
"pages": null
} | [
"finite automata",
"nondeterministic finite automaton",
"finite automaton"
] | [
"finite automata",
"automata",
"finite automaton",
"automation",
"nondeterministic finite automaton"
] | [
"automation",
"nondeterministic finite automaton",
"finite automaton",
"finite automata",
"automata"
] | [
"engineering",
"translation (languages)",
"number of state",
"pipeline processing systems",
"automata theory",
"formal languages",
"computational linguistics",
"linguistics",
"program processors",
"formal languages and automata theory",
"database systems",
"parallel processing systems",
"microprocessor chips",
"theoretical computer science",
"computer systems",
"distributed systems",
"computer hardware",
"computer science",
"distributed computer systems"
] |
198 | One of the key concepts in testing is that of adequate test sets. A test selection criterion decides which test sets are adequate. In this paper, a language schema for specifying a large class of test selection criteria is developed; the schema is based on two operations for building complex criteria from simple ones. Basic algebraic properties of the two operations are derived.
In the second part of the paper, a simple language-an instance of the general schema-is studied in detail, with the goal of generating small adequate test sets automatically. It is shown that one version of the problem is intractable, while another is solvable by an efficient algorithm. An implementation of the algorithm is described. | 2022-06-20T13:02:27.929Z | {
"ACL": null,
"DBLP": "journals/corr/cs-SE-9912018",
"ArXiv": "cs/9912018",
"MAG": "2141853395",
"CorpusId": "198",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d7583f927112b13e3e6716fda1e3f620498f47e7 | Computation in an algebra of test selection criteria | [
{
"authorId": "34959436",
"name": "J. Pachl"
},
{
"authorId": "1745839",
"name": "S. Zaks"
}
] | ArXiv | 1,999 | 14 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 1999-12-24T00:00:00 | {
"name": "ArXiv",
"volume": "cs.SE/9912018",
"pages": null
} | [
"test samples",
"efficient algorithm",
"genetic selection"
] | [
"relational schemas",
"database schemas",
"efficient algorithm",
"test case generation",
"test case selection"
] | [
"test case selection",
"database schemas",
"test samples",
"test case generation",
"efficient algorithm",
"genetic selection",
"relational schemas"
] | [
"software engineering",
"database systems",
"machine learning",
"computational efficiency",
"genetic analysis",
"relational data models",
"computer science",
"computer systems",
"artificial intelligence",
"theoretical computer science",
"bioinformatics",
"relational database",
"knowledge based systems",
"query languages"
] |
201 | We show that the absolute worst case time complexity for Hopcroft's minimization algorithm applied to unary languages is reached only for de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires O(n log n) steps by carefully choosing the splitting sets and processing these sets in a FIFO mode. We refine the previous result by showing that the Berstel/Carton example is actually the absolute worst case time complexity in the case of unary languages. We also show that a LIFO implementation will not achieve the same worst time complexity for the case of unary languages. Lastly, we show that the same result is valid also for the cover automata and a modification of the Hopcroft's algorithm, modification used in minimization of cover automata. | 2022-07-31T02:55:31.573Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0705-1986",
"ArXiv": "0705.1986",
"MAG": "1588292369",
"CorpusId": "201",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/af573f1992e23d6e07d251b2b073e393fe481a7d | On the Hopcroft's minimization algorithm | [
{
"authorId": "143936370",
"name": "A. Paun"
}
] | ArXiv | 2,007 | 21 | 3 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-05-14T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0705.1986",
"pages": null
} | [
"automata"
] | [
"finite state automata",
"push-down automata",
"automata",
"optimization",
"adaptive algorithms"
] | [
"push-down automata",
"finite state automata",
"optimization",
"automata",
"adaptive algorithms"
] | [
"translation (languages)",
"finite automata",
"mathematics",
"formal languages",
"software",
"computational linguistics",
"automata theory",
"linguistics",
"formal languages and automata theory",
"computer science",
"database systems",
"theoretical computer science",
"computer systems"
] |
204 | High operating speed, fault tolerance (FT), low power and reconfiguration become today dominant issues during development and design of linear feedback shift registers (LFSRs), used as sequence generators, with randomness properties, in a process of testing complex CMOS VLSI ICs. In our design solution, we accomplish FT by using triple modular redundancy (TMR), i.e., a hardware scheme that uses spatial redundancy. For reduction of dynamic power consumption, clock-gating technique, as a simple and effective method, is implemented. The reconfigurable FPGA architecture provides us a feature to program and configure the degree of the primitive polynomial that the LFSR uses. High speed of operation, over 100 MHz, during testing is achieved by using circuits fabricated in submicron technology. An architecture which integrates in a single structure (IP core) all aforementioned design issues, named fault tolerant reconfigurable low-power pseudo-random number generator (FT_RLRG), is described in this article. The design of FT_RLRG is of practical interest in testing triple modular FT systems in the presence of single event upsets (SEUs), especially in a case when the design is SRAM-based. As an IP core the FT_RLRG has been implemented both on FPGA and ASIC technology. The main idea was to design a low-cost and low-power hardware structure which is able to adjust to any standards (past, present and future) operating at high-speed with different polynomials (currently up to 32nd order). The performance of FT_RLRG in respect to speed of operation (up to 150 MHz for FPGA and ASIC designs), low hardware overhead (0.033 mm2 area for ASIC and up to 530 slices for FPGA) and low-power consumption (0.45 mW for ASIC), for three different FPGA architecture (Spartan-3E, Virtex-4 and Virtex-6LP) and as an ASIC design implemented in 130 nm SiGe BiCMOS technology, have been estimated. | 2022-08-20T13:43:20.511Z | {
"ACL": null,
"DBLP": "journals/jcsc/SavicSNPJ14",
"ArXiv": null,
"MAG": "2060553380",
"CorpusId": "204",
"PubMed": null,
"DOI": "10.1142/S0218126614500029",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/f9c8be897b494fc894588f2f5573237a98a39f12 | Reconfigurable Low Power Architecture for Fault Tolerant Pseudo-Random number Generation | [
{
"authorId": "2076487050",
"name": "N. Savic"
},
{
"authorId": "1796738",
"name": "M. Stojcev"
},
{
"authorId": "50547984",
"name": "T. Nikolic"
},
{
"authorId": "46560561",
"name": "V. Petrovic"
},
{
"authorId": "2004099",
"name": "G. Jovanovic"
}
] | J. Circuits Syst. Comput. | 2,014 | 26 | 5 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Engineering",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2014-02-05T00:00:00 | {
"name": "J. Circuits Syst. Comput.",
"volume": "23",
"pages": null
} | [
"hardware overheads",
"fault-tolerant",
"computer hardware",
"fault tolerance",
"single event upsets",
"low-power consumption",
"random number generators",
"low power",
"ip core",
"asic",
"pseudo-random numbers",
"fpga architectures",
"vlsi",
"linear feedback shift registers",
"shift registers",
"field programmable gate array",
"triple modular redundancy"
] | [
"low power",
"low-power consumption",
"fault-tolerant",
"random numbers",
"random number generators",
"random number generation",
"linear feedback shift registers",
"shift registers",
"vlsi",
"triple modular redundancy",
"computer hardware",
"clock gating",
"field programmable gate array",
"single event upsets",
"asic",
"architecture designs",
"pseudo-random numbers",
"soft error",
"xilinx fpga"
] | [
"single event upsets",
"low power",
"ip core",
"pseudo-random numbers",
"fault tolerance",
"fault-tolerant",
"low-power consumption",
"asic",
"architecture designs",
"linear feedback shift registers",
"hardware overheads",
"computer hardware",
"random numbers",
"soft error",
"shift registers",
"random number generation",
"clock gating",
"random number generators",
"fpga architectures",
"xilinx fpga",
"vlsi",
"field programmable gate array",
"triple modular redundancy"
] | [
"static random access storage",
"computer control systems",
"programmable logic controllers",
"software quality",
"fault tolerant computer systems",
"electric power supplies to apparatus",
"software architecture",
"stream ciphers",
"built-in self test",
"computer science",
"computer aided design",
"microprocessor chips",
"integrated circuit testing",
"cryptography",
"number theory",
"random processes",
"vlsi circuits",
"software",
"software design",
"computer networks",
"distributed computer systems",
"application specific integrated circuits",
"security of data",
"integrated circuit layout",
"cryptology",
"numerical methods",
"probability",
"software engineering",
"computer systems",
"computer security",
"mathematics"
] |
206 | Artificial life models, swarm intelligent and evolutionary computation algorithms are usually built on fixed size populations. Some studies indicate however that varying the population size can increase the adaptability of these systems and their capability to react to changing environments. In this paper we present an extended model of an artificial ant colony system designed to evolve on digital image habitats. We will show that the present swarm can adapt the size of the population according to the type of image on which it is evolving and reacting faster to changing images, thus converging more rapidly to the new desired regions, regulating the number of his image foraging agents. Finally, we will show evidences that the model can be associated with the Mathematical Morphology Watershed algorithm to improve the segmentation of digital grey-scale images. KEYWORDS: Swarm Intelligence, Perception and Image Processing, Pattern Recognition, Mathematical Morphology, Social Cognitive Maps, Social Foraging, Self-Organization, Distributed Search. | 2022-09-02T02:27:53.424Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0512004",
"ArXiv": "cs/0512004",
"MAG": "1639612572",
"CorpusId": "206",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a04b31e8d08e46d00a043c82ec8093f5a39ec6e4 | Self-Regulated Artificial Ant Colonies on Digital Image Habitats | [
{
"authorId": "144784322",
"name": "C. Fernandes"
},
{
"authorId": "144548853",
"name": "Vitorino Ramos"
},
{
"authorId": "145881692",
"name": "A. Rosa"
}
] | ArXiv | 2,005 | 15 | 51 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-11-30T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0512004",
"pages": null
} | [
"mathematical morphology",
"pattern recognition",
"digital image",
"water-shed algorithm",
"cognitive maps",
"evolutionary computation",
"swarm intelligence",
"population structure",
"image processing"
] | [
"digital image",
"evolutionary computation",
"swarm intelligence",
"mathematical morphology",
"water-shed algorithm",
"image processing",
"pattern recognition",
"cognitive maps"
] | [
"mathematical morphology",
"pattern recognition",
"digital image",
"water-shed algorithm",
"cognitive maps",
"evolutionary computation",
"swarm intelligence",
"population structure",
"image processing"
] | [
"image segmentation",
"machine learning",
"image analysis",
"fuzzy cognitive map",
"evolutionary algorithms",
"artificial intelligence",
"population genetics",
"computer imaging and vision",
"cognitive systems",
"conformal mapping",
"genetic algorithms",
"computer science",
"gene frequency",
"variation (genetics)",
"mathematics",
"single nucleotide polymorphism",
"genetic variability",
"genetic analysis",
"bioinformatics"
] |
210 | We propose a very simple randomised data structure that stores an approximation from above of a lattice-valued function. Computing the function value requires a constant number of steps, and the error probability can be balanced with space usage, much like in Bloom filters. The structure is particularly well suited for functions that are bottom on most of their domain. We then show how to use our methods to store in a compact way the bad-character shift function for variants of the Boyer-Moore text search algorithms. As a result, we obtain practical implementations of these algorithms that can be used with large alphabets, such as Unicode collation elements, with a small setup time. The ideas described in this paper have been implemented as free software under the GNU General Public License within the MG4J project (this http URL). | 2022-08-27T18:05:51.897Z | {
"ACL": null,
"DBLP": "journals/corr/cs-DS-0306046",
"ArXiv": "cs/0306046",
"MAG": "1665662095",
"CorpusId": "210",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/62c192d8893d4c6b7a55ff4ef42c822aa9145631 | Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search | [
{
"authorId": "1733343",
"name": "P. Boldi"
},
{
"authorId": "1737624",
"name": "S. Vigna"
}
] | ArXiv | 2,003 | 21 | 1 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-06-11T00:00:00 | {
"name": "ArXiv",
"volume": "cs.DS/0306046",
"pages": null
} | [
"software",
"probability",
"http"
] | [
"probability",
"software",
"http",
"approximation scheme",
"text document"
] | [
"approximation scheme",
"probability",
"http",
"software",
"text document"
] | [
"polynomial approximation",
"approximation algorithms",
"mathematics",
"servers",
"client server computer systems",
"internet protocols",
"computer science",
"text mining",
"information retrieval systems",
"graph theory",
"approximation theory",
"world wide web",
"security of data",
"telecommunication traffic",
"multimedia systems",
"distributed computer systems",
"data communication systems",
"database systems",
"user interfaces",
"text processing",
"information retrieval",
"theoretical computer science",
"internet",
"computer security",
"telecommunication networks",
"computer systems",
"human computer interaction",
"natural language processing",
"computational linguistics",
"data mining",
"telecommunication systems",
"artificial intelligence",
"natural languages",
"linguistics",
"semantics"
] |
219 | Objective: The objective was to use eye tracking to trace the underlying changes in attention allocation associated with the performance effects of clutter, stress, and task difficulty in visual search and noticing tasks. Background: Clutter can degrade performance in complex domains, yet more needs to be known about the associated changes in attention allocation, particularly in the presence of stress and for different tasks. Frequently used and relatively simple eye tracking metrics do not effectively capture the various effects of clutter, which is critical for comprehensively analyzing clutter and developing targeted, real-time countermeasures. Method: Electronic medical records (EMRs) were chosen as the application domain for this research. Clutter, stress, and task difficulty were manipulated, and physicians’ performance on search and noticing tasks was recorded. Several eye tracking metrics were used to trace attention allocation throughout those tasks, and subjective data were gathered via a debriefing questionnaire. Results: Clutter degraded performance in terms of response time and noticing accuracy. These decrements were largely accentuated by high stress and task difficulty. Eye tracking revealed the underlying attentional mechanisms, and several display-independent metrics were shown to be significant indicators of the effects of clutter. Conclusion: Eye tracking provides a promising means to understand in detail (offline) and prevent (in real time) major performance breakdowns due to clutter. Application: Display designers need to be aware of the risks of clutter in EMRs and other complex displays and can use the identified eye tracking metrics to evaluate and/or adjust their display. | 2022-08-26T11:11:15.732Z | {
"ACL": null,
"DBLP": "journals/hf/MoacdiehS15a",
"ArXiv": null,
"MAG": "2136552552",
"CorpusId": "219",
"PubMed": "25850110",
"DOI": "10.1177/0018720814564594",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ef207ac1e4a970db539dedb2c3eb8f29aebe4581 | Clutter in Electronic Medical Records | [
{
"authorId": "2054926",
"name": "N. Moacdieh"
},
{
"authorId": "1682002",
"name": "N. Sarter"
}
] | Hum. Factors | 2,015 | 50 | 30 | 1 | false | [
{
"category": "Medicine",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Medicine",
"source": "external"
}
] | [
"JournalArticle"
] | 2015-01-05T00:00:00 | {
"name": "Human Factors: The Journal of Human Factors and Ergonomics Society",
"volume": "57",
"pages": "591 - 606"
} | [
"clutter (information theory)",
"background clutter"
] | [
"clutter (information theory)",
"clutter background",
"ground clutter",
"background clutter",
"clutter suppression",
"health records",
"ehr",
"display system"
] | [
"clutter (information theory)",
"health records",
"ground clutter",
"background clutter",
"clutter background",
"ehr",
"clutter suppression",
"display system"
] | [
"radar",
"records management",
"object detection",
"target tracking",
"object recognition",
"information systems",
"space time adaptive processing",
"radar systems",
"display devices",
"signal processing",
"computer hardware",
"medical computing",
"sensors",
"pattern recognition",
"image segmentation",
"computer systems",
"block codes",
"fading (radio)",
"multiplexing",
"fading channels",
"antennas",
"data communication systems",
"radar imaging",
"user interfaces",
"engineering",
"computer science",
"artificial intelligence",
"medical images",
"database systems",
"machine learning",
"image analysis",
"image processing",
"bit error rate",
"information theory",
"signal detection",
"communication channels",
"signal to noise ratio",
"wireless telecommunication systems",
"human computer interaction",
"bioinformatics",
"computer imaging and vision",
"probability",
"communication",
"computer networks",
"communication systems",
"telecommunication systems",
"mathematics"
] |
220 | We present a new framework for the crucial challenge of self-organization of a large sensor network. The basic scenario can be described as follows: Given a large swarm of immobile sensor nodes that have been scattered in a polygonal region, such as a street network. Nodes have no knowledge of size or shape of the environment or the position of other nodes. Moreover, they have no way of measuring coordinates, geometric distances to other nodes, or their direction. Their only way of interacting with other nodes is to send or to receive messages from any node that is within communication range. The objective is to develop algorithms and protocols that allow self-organization of the swarm into large-scale structures that reflect the structure of the street network, setting the stage for global routing, tracking and guiding algorithms.Our algorithms work in two stages: boundary recognition and topology extraction. All steps are strictly deterministic, yield fast distributed algorithms, and make no assumption on the distribution of nodes in the environment, other than sufficient density. | 2022-09-05T02:58:34.635Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0510048",
"ArXiv": "cs/0510048",
"MAG": "2056762216",
"CorpusId": "220",
"PubMed": null,
"DOI": "10.1145/1109557.1109668",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/da1fac9fdcf44c6db7db08f08acf9186e326d66d | Deterministic boundary recognition and topology extraction for large sensor networks | [
{
"authorId": "1750993",
"name": "A. Kröller"
},
{
"authorId": "1707693",
"name": "S. Fekete"
},
{
"authorId": "3345801",
"name": "D. Pfisterer"
},
{
"authorId": "145160227",
"name": "S. Fischer"
}
] | SODA '06 | 2,005 | 20 | 208 | 10 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2005-10-17T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0510048",
"pages": null
} | [
"sensor nodes",
"routing algorithms",
"deterministic",
"topology",
"distributed algorithm",
"communication",
"sensor networks"
] | [
"deterministic",
"topology",
"sensors",
"sensor networks",
"wireless sensor networks",
"sensor nodes",
"communication",
"routing algorithms"
] | [
"sensor nodes",
"communication",
"deterministic",
"topology",
"wireless sensor networks",
"sensors",
"distributed algorithm",
"routing algorithms",
"sensor networks"
] | [
"stochastic",
"wireless communications",
"energy utilization",
"computer hardware",
"parallel algorithms",
"computer networks",
"routers",
"wireless telecommunication systems",
"embedded systems",
"stochastic processes",
"stochasticity",
"electricity",
"computer science",
"parallel processing systems",
"telecommunication traffic",
"bandwidth",
"communication systems",
"telecommunication systems",
"computer systems",
"probability",
"numerical model",
"engineering",
"distributed systems",
"telecommunication networks",
"mathematics",
"distributed computer systems"
] |
225 | We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach that employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs. | 2022-09-01T22:14:14.304Z | {
"ACL": null,
"DBLP": "journals/tocl/ShenYYSY03",
"ArXiv": "cs/0204031",
"MAG": "1976132254",
"CorpusId": "225",
"PubMed": null,
"DOI": "10.1145/937555.937556",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/b4e3434ea0088171405093fa257722bef0a6060e | A dynamic approach to characterizing termination of general logic programs | [
{
"authorId": "1744468",
"name": "Yi-Dong Shen"
},
{
"authorId": "2887414",
"name": "Jia-Huai You"
},
{
"authorId": "38410481",
"name": "Li-Yan Yuan"
},
{
"authorId": "27284588",
"name": "S. S. Shen"
},
{
"authorId": "152290618",
"name": "Qiang Yang"
}
] | TOCL | 2,002 | 36 | 22 | 4 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2002-04-12T00:00:00 | {
"name": "ArXiv",
"volume": "cs.LO/0204031",
"pages": null
} | [
"logic programs",
"termination analysis",
"source codes"
] | [
"logic programs",
"termination analysis",
"source codes",
"answer set semantics",
"dynamic logic",
"multivalued logic",
"stable model",
"disjunctive logic programs",
"well founded semantics"
] | [
"disjunctive logic programs",
"source codes",
"logic programs",
"dynamic logic",
"well founded semantics",
"termination analysis",
"stable model",
"answer set semantics",
"multivalued logic"
] | [
"answer set programming",
"software engineering",
"logic programming",
"modal logic",
"answer set",
"many valued logics",
"knowledge representation",
"computer science",
"computer programming languages",
"formal logic",
"logic gates",
"logic design",
"boolean functions",
"knowledge based systems",
"semantics",
"computer programming",
"artificial intelligence",
"field programmable gate array",
"mathematics",
"computer hardware"
] |
233 | In this second part of our two-part paper, we consider the capacity analysis for wireless mobile systems with multiple-antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple-antenna system where both the transmitter and receiver know the channel's statistical law. We analyze the capacity for additive white Gaussian noise (AWGN) channels, fading channels with full channel state information (CSI) at the receiver, fading channels with no CSI, and fading channels with partial CSI at the receiver. For each type of channels, we study the capacity value as well as issues such as the existence, uniqueness, and characterization of the capacity-achieving measures for different types of moment constraints. The results are applicable to both Rayleigh and Rician fading channels in the presence of arbitrary line-of-sight and correlation profiles. | 2022-08-31T19:00:02.193Z | {
"ACL": null,
"DBLP": "journals/corr/cs-IT-0411012",
"ArXiv": "cs/0411012",
"MAG": "2114087588",
"CorpusId": "233",
"PubMed": null,
"DOI": "10.1109/TIT.2005.853327",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/c29ce990cafac387a6c72288deef9b06086cda14 | Capacity analysis for continuous alphabet channels with side information, part II: MIMO channels | [
{
"authorId": "1716627",
"name": "M. Fozunbal"
},
{
"authorId": "1721818",
"name": "S. McLaughlin"
},
{
"authorId": "2062753594",
"name": "R. W. Schafer"
}
] | IEEE Transactions on Information Theory | 2,004 | 45 | 6 | 0 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2004-11-06T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "51",
"pages": "3086-3101"
} | [
"transmitters",
"partial csi",
"discrete-time",
"csi",
"mimo channel",
"white gaussian noise",
"mobile systems",
"wireless",
"awgn",
"rician fading",
"channel state information",
"fading channels"
] | [
"mimo",
"mimo channel",
"wireless",
"mobile systems",
"multiple antenna",
"antennas",
"antenna systems",
"discrete-time",
"transmitters",
"white gaussian noise",
"gaussian noise (electronic)",
"awgn",
"gaussians",
"rayleigh fading",
"channel state",
"channel state information",
"csi",
"partial csi",
"rician fading",
"fading channels"
] | [
"transmitters",
"partial csi",
"gaussian noise (electronic)",
"discrete-time",
"csi",
"antennas",
"mimo",
"mimo channel",
"rayleigh fading",
"white gaussian noise",
"channel state",
"mobile systems",
"wireless",
"multiple antenna",
"awgn",
"rician fading",
"gaussians",
"channel state information",
"antenna systems",
"fading channels"
] | [
"signal receivers",
"signal to noise ratio",
"discrete time control systems",
"wireless telecommunication systems",
"orthogonal frequency division multiplexing",
"mim devices",
"channel capacity",
"mimo systems",
"matrix algebra",
"white noise",
"wireless networks",
"state feedback",
"channel estimation",
"radio",
"beamforming",
"multiplexing",
"additive noise",
"fading (radio)",
"gaussian distribution",
"antenna accessories",
"communication channels",
"signal detection",
"signal processing",
"nonlinear control systems",
"linear matrix inequalities",
"computer networks",
"communication systems",
"telecommunication systems",
"information theory",
"mathematics",
"wireless communications",
"packet networks",
"feedback control",
"spurious signal noise",
"bit error rate",
"antenna arrays",
"engineering",
"adaptive control systems",
"feedback systems",
"control theory",
"computer science",
"computer systems",
"communication",
"telecommunication traffic",
"probability",
"process control",
"telecommunication networks",
"automation"
] |
235 | A hypermedia application offers its users much freedom to navigate through a large hyperspace. Adaptive hypermedia (AH) offers personalized content, presentation, and navigation support. Many adaptive hypermedia systems (AHS) are tightly integrated with one specific application and/or use a limited number of techniques and methods. This makes it difficult to capture all of them in one generic model. In this paper we examine adaptation questions stated in the very beginning of the AH era and elaborate on their recent interpretations. We will reconsider design issues for application independent generic AHS, review open questions of system extensibility introduced in adjacent research fields and try to come up with an up-to-date taxonomy of adaptation techniques and an extensive set of requirements for a new adaptive system reference model or architecture, to be developed in the future. | 2022-09-05T02:12:37.001Z | {
"ACL": null,
"DBLP": "journals/nrhm/KnutovBP09",
"ArXiv": null,
"MAG": "2128211639",
"CorpusId": "235",
"PubMed": null,
"DOI": "10.1080/13614560902801608",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/aa19d2316b62c6a75f812c653f182d52f8599e08 | AH 12 years later: a comprehensive survey of adaptive hypermedia methods and techniques | [
{
"authorId": "1707305",
"name": "E. Knutov"
},
{
"authorId": "1831425",
"name": "P. D. Bra"
},
{
"authorId": "1691997",
"name": "Mykola Pechenizkiy"
}
] | New Rev. Hypermedia Multim. | 2,009 | 117 | 232 | 22 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Review"
] | 2009-04-01T00:00:00 | {
"name": "New Review of Hypermedia and Multimedia",
"volume": "15",
"pages": "38 - 5"
} | [
"hypermedia",
"adaptive hypermedia systems",
"hypermedia systems",
"adaptive hypermedia",
"adaptive systems"
] | [
"adaptive hypermedia",
"adaptive hypermedia systems",
"hypermedia",
"hypermedia systems",
"hypertext",
"adaptive systems"
] | [
"hypermedia",
"adaptive hypermedia systems",
"hypermedia systems",
"adaptive hypermedia",
"adaptive systems",
"hypertext"
] | [
"hypertext systems",
"user interfaces",
"e-learning",
"architecture types",
"information retrieval systems",
"world wide web",
"human computer interaction",
"information systems",
"education",
"software architecture",
"database systems",
"information retrieval",
"internet",
"computer science",
"computer systems",
"software design",
"software engineering"
] |
237 | Data-intensive computing has positioned itself as a valuable programming paradigm to efficiently approach problems requiring processing very large volumes of data. This paper presents a pilot study about how to apply the data-intensive computing paradigm to evolutionary computation algorithms. Two representative cases (selectorecombinative genetic algorithms and estimation of distribution algorithms) are presented, analyzed, and discussed. This study shows that equivalent data-intensive computing evolutionary computation algorithms can be easily developed, providing robust and scalable algorithms for the multicore-computing era. Experimental results show how such algorithms scale with the number of available cores without further modification. | 2022-09-02T06:10:23.215Z | {
"ACL": null,
"DBLP": "conf/gecco/Llora09",
"ArXiv": null,
"MAG": "2095687898",
"CorpusId": "237",
"PubMed": null,
"DOI": "10.1145/1569901.1570087",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/00dc41f2abbd4145d8bb7cf3452ab1d4dcbc54ad | Data-intensive computing for competent genetic algorithms: a pilot study using meandre | [
{
"authorId": "1822628",
"name": "Xavier Llorà"
}
] | GECCO | 2,009 | 36 | 13 | 1 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"Book",
"JournalArticle",
"Conference"
] | 2009-07-08T00:00:00 | {
"name": "Proceedings of the 11th Annual conference on Genetic and evolutionary computation",
"volume": null,
"pages": null
} | [
"distribution algorithms",
"evolutionary computation",
"genetic algorithms",
"computing paradigm"
] | [
"genetic algorithms",
"evolutionary programming",
"computing paradigm",
"evolutionary computation",
"distribution algorithms",
"multi core",
"programming languages",
"evolutionary algorithms",
"evolutionary computation techniques",
"adaptive algorithms",
"efficient algorithm",
"optimization problems"
] | [
"evolutionary algorithms",
"genetic algorithms",
"programming languages",
"optimization problems",
"evolutionary computation techniques",
"evolutionary computation",
"efficient algorithm",
"computing paradigm",
"adaptive algorithms",
"distribution algorithms",
"multi core",
"evolutionary programming"
] | [
"artificial intelligence",
"computer programming languages",
"linguistics",
"correlation analysis",
"genetic programming",
"particle swarm optimization (pso)",
"computational efficiency",
"grid computing",
"cloud computing",
"software",
"estimation of distribution algorithms",
"program processors",
"computer programming",
"computer science",
"mathematics",
"optimization",
"swarm intelligence",
"theoretical computer science",
"parallel processing systems",
"computer systems",
"probability distributions",
"microprocessor chips",
"distributed systems",
"probability",
"computer hardware",
"distributed computer systems"
] |
242 | The large majority of commercially available multiple-input multiple-output (MIMO) radio channel measurement devices (sounders) is based on time-division multiplexed switching (TDMS) of a single transmit/receive radio frequency chain into the elements of a transmit/receive antenna array. While being cost-effective, such a solution can cause significant measurement errors due to phase noise and frequency offset in the local oscillators. In this paper, we systematically analyze the resulting errors and show that, in practice, overestimation of channel capacity by several hundred percent can occur. Overestimation is caused by phase noise (and to a lesser extent by frequency offset), leading to an increase of the MIMO channel rank. Our analysis furthermore reveals that the impact of phase errors is, in general, most pronounced if the physical channel has low rank (typical for line-of-sight or poor scattering scenarios). The extreme case of a rank-1 physical channel is analyzed in detail. The capacity bounds derived in this paper show excellent agreement with measurement results. In light of the findings of this paper, the results obtained through MIMO channel measurement campaigns using TDMS-based channel sounders should be interpreted with great care. | 2022-09-03T05:00:50.575Z | {
"ACL": null,
"DBLP": "journals/tit/BaumB11",
"ArXiv": "0709.1441",
"MAG": "2131773789",
"CorpusId": "242",
"PubMed": null,
"DOI": "10.1109/TIT.2011.2165129",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/636503a0bec74d22ee0cebccdd8ac36ac78d3614 | Information-Theoretic Analysis of MIMO Channel Sounding | [
{
"authorId": "1865519",
"name": "D. Baum"
},
{
"authorId": "1691809",
"name": "H. Bölcskei"
}
] | IEEE Transactions on Information Theory | 2,007 | 90 | 17 | 0 | true | [
{
"category": "Business",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-09-10T00:00:00 | {
"name": "IEEE Transactions on Information Theory",
"volume": "57",
"pages": "7555-7577"
} | [
"local oscillators",
"receive antenna",
"mimo",
"mimo channel",
"physical channels",
"phase noise",
"antenna arrays",
"channel measurements",
"radio channels",
"frequency offsets",
"channel capacity",
"radio",
"multiple-input-multiple-output"
] | [
"mimo",
"radio channels",
"radio",
"antennas",
"antenna arrays",
"phase noise",
"frequency offsets",
"local oscillators",
"channel capacity"
] | [
"local oscillators",
"receive antenna",
"antennas",
"mimo",
"mimo channel",
"multiple-input-multiple-output",
"physical channels",
"phase noise",
"antenna arrays",
"channel measurements",
"radio channels",
"channel capacity",
"radio",
"frequency offsets"
] | [
"receiving antennas",
"wireless telecommunication systems",
"orthogonal frequency division multiplexing",
"mim devices",
"fading channels",
"mimo systems",
"matrix algebra",
"communication channels",
"virtual channels",
"spurious signal noise",
"signal to noise ratio",
"ultra-wideband (uwb)",
"channel model",
"channel estimation",
"multiplexing",
"fading (radio)",
"radio transmission",
"information theory",
"signal encoding",
"frequency estimation",
"ofdm",
"computer networks",
"communication systems",
"telecommunication systems",
"mathematics",
"noc",
"routing algorithms",
"interconnection networks",
"signal processing",
"broadband networks",
"multipath propagation",
"signal receivers",
"bit error rate",
"signal detection",
"communication",
"frequency allocation",
"computer science",
"computer systems",
"routers",
"microprocessor chips",
"network architecture",
"parallel processing systems",
"engineering",
"telecommunication traffic",
"bandwidth",
"code division multiple access",
"probability",
"data communication systems",
"computer hardware",
"distributed systems",
"telecommunication networks",
"distributed computer systems"
] |
247 | Constraint Programming (CP)[1] has been successfully appl ied to both constraint satisfaction and constraint optimization prob lems. A wide variety of specialized global constraints provide critical assistan ce i achieving a good model that can take advantage of the structure of the problem in the search for a solution. However, a key outstanding issue is the representation of ’a d-hoc’ constraints that do not have an inherent combinatorial nature, and hence are n ot modelled well using narrowly specialized global constraints. We attempt to address this issue by considering a hybrid of search and compilation. Specificall y we suggest the use of Reduced Ordered Multi-Valued Decision Diagrams (ROMDDs ) a the supporting data structure for a generic global constraint. We g iv an algorithm for maintaining generalized arc consistency (GAC) on this cons traint that amortizes the cost of the GAC computation over a root-to-leaf path in th e search tree without requiring asymptotically more space than used for the MD D. Furthermore we present an approach for incrementally maintaining the redu c property of the MDD during the search, and show how this can be used for provid ing omain entailment detection. Finally we discuss how to apply our ap proach to other similar data structures such as AOMDDs and Case DAGs. The techni que used can be seen as an extension of the GAC algorithm for the regular la ngu ge constraint on finite length input [2]. | 2022-09-03T03:47:49.290Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0702170",
"ArXiv": "cs/0702170",
"MAG": null,
"CorpusId": "247",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a005c83193a5cdd06052e685a2cd716ef49a44b4 | Generic Global Constraints based on MDDs | [
{
"authorId": "93489491",
"name": "Peter Tiedemann"
},
{
"authorId": "30443435",
"name": "H. Andersen"
},
{
"authorId": "1801719",
"name": "R. Pagh"
}
] | ArXiv | 2,007 | 22 | 0 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-02-28T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0702170",
"pages": null
} | [
"decision diagram",
"optimization problems",
"constraint programming"
] | [
"decision diagram",
"constraint programming",
"optimization problems",
"optimization",
"detection algorithm"
] | [
"optimization",
"constraint programming",
"decision diagram",
"detection algorithm",
"optimization problems"
] | [
"mathematics",
"computer programming",
"binary decision diagrams",
"signal detection",
"correlation analysis",
"computer science",
"decision theory",
"finite automata",
"logic design",
"boolean functions",
"signal processing",
"artificial intelligence",
"automata theory",
"field programmable gate array",
"engineering",
"formal languages and automata theory",
"computer hardware",
"theoretical computer science"
] |
252 | The paper gives a brief review of the expectation-maximization algorithm (Dempster 1977) in the comprehensible framework of discrete mathematics. In Section 2, two prominent estimation methods, the relative-frequency estimation and the maximum-likelihood estimation are presented. Section 3 is dedicated to the expectation-maximization algorithm and a simpler variant, the generalized expectation-maximization algorithm. In Section 4, two loaded dice are rolled. A more interesting example is presented in Section 5: The estimation of probabilistic context-free grammars. | 2022-09-04T08:32:18.749Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0412015",
"ArXiv": "cs/0412015",
"MAG": "1765214094",
"CorpusId": "252",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/45f80e5bf39d499848fa801d930b004ada866087 | A Tutorial on the Expectation-Maximization Algorithm Including Maximum-Likelihood Estimation and EM Training of Probabilistic Context-Free Grammars | [
{
"authorId": "2694275",
"name": "D. Prescher"
}
] | ArXiv | 2,004 | 32 | 36 | 2 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Review"
] | 2004-12-03T00:00:00 | {
"name": "ArXiv",
"volume": "abs/cs/0412015",
"pages": null
} | [
"estimation method",
"maximum likelihood estimation",
"context-free",
"mathematics",
"dempster"
] | [
"maximum likelihood",
"maximum likelihood estimator",
"maximum likelihood estimation",
"estimation method",
"dempster",
"mathematics",
"frequency estimation"
] | [
"estimation method",
"maximum likelihood estimator",
"maximum likelihood",
"frequency estimation",
"maximum likelihood estimation",
"context-free",
"mathematics",
"dempster"
] | [
"numerical model",
"likelihood functions",
"frequency allocation",
"context free languages",
"combination rules",
"sensor data fusion",
"correlation analysis",
"communication channels",
"telecommunication traffic",
"data communication systems",
"automata theory",
"formal languages",
"dempster-shafer theory",
"sensors",
"signal processing",
"wireless telecommunication systems",
"telecommunication networks",
"computer systems",
"formal languages and automata theory",
"linguistics",
"formal logic",
"data fusion",
"computer hardware",
"engineering",
"computer networks",
"communication systems",
"telecommunication systems",
"computer science",
"theoretical computer science",
"artificial intelligence"
] |
256 | Beyond the local constraints imposed by grammar, words concatenated in long sequences carrying a complex message show statistical regularities that may reflect their linguistic role in the message. In this paper, we perform a systematic statistical analysis of the use of words in literary English corpora. We show that there is a quantitative relation between the role of content words in literary English and the Shannon information entropy defined over an appropriate probability distribution. Without assuming any previous knowledge about the syntactic structure of language, we are able to cluster certain groups of words according to their specific role in the text. | 2022-09-05T01:13:31.631Z | {
"ACL": null,
"DBLP": "journals/corr/cond-mat-0109218",
"ArXiv": "cond-mat/0109218",
"MAG": "1604188556",
"CorpusId": "256",
"PubMed": null,
"DOI": "10.1142/S0219525902000493",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/d95b4e275d71ac1a1172d02346b1edb388d91b1a | Entropic Analysis of the Role of Words in Literary Texts | [
{
"authorId": "2245726",
"name": "M. Montemurro"
},
{
"authorId": "2320797",
"name": "D. Zanette"
}
] | Adv. Complex Syst. | 2,001 | 18 | 47 | 1 | true | [
{
"category": "Linguistics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Physics",
"source": "external"
}
] | [
"JournalArticle"
] | 2001-09-12T00:00:00 | {
"name": "ArXiv",
"volume": "cond-mat/0109218",
"pages": null
} | [
"linguistics",
"probability distributions",
"correlation analysis",
"syntactic structure"
] | [
"correlation analysis",
"syntactic structure",
"linguistics",
"probability",
"probability distributions",
"syntactics"
] | [
"correlation analysis",
"syntactic structure",
"linguistics",
"probability distributions",
"probability",
"syntactics"
] | [
"mathematics",
"natural language processing",
"computational linguistics",
"artificial intelligence",
"natural languages",
"database systems",
"computer science",
"semantics",
"computer systems"
] |
262 | We study the complexity of robust quantum algorithms. These still work with high probability if the n input bits are noisy. We exhibit a robust quantum algorithm that recovers the complete input with high probability using O(n) queries. This implies that every n-bit function can be quantum computed robustly with O(n) queries, which contrasts with Feige et al.’s Ω(n logn) classical bound for PARITY. We also give similar bounds on the degrees of multilinear polynomials that robustly approximate Boolean functions. | 2022-09-04T11:09:23.618Z | {
"ACL": null,
"DBLP": "journals/corr/quant-ph-0309220",
"ArXiv": null,
"MAG": "2116377806",
"CorpusId": "262",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/25a8bac13298c25887dbad3a38a65fbce900951a | Robust Quantum Algorithms and Polynomials | [
{
"authorId": "1747509",
"name": "H. Buhrman"
},
{
"authorId": "145512400",
"name": "I. Newman"
},
{
"authorId": "1721834",
"name": "H. Röhrig"
},
{
"authorId": "1863449",
"name": "R. D. Wolf"
}
] | ArXiv | 2,003 | 9 | 18 | 2 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Economics",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | null | {
"name": "ArXiv",
"volume": "quant-ph/0309220",
"pages": null
} | [
"boolean functions",
"probability"
] | [
"probability",
"boolean functions",
"parity bits",
"adaptive algorithms",
"quantum gates"
] | [
"boolean functions",
"parity bits",
"probability",
"quantum gates",
"adaptive algorithms"
] | [
"mathematics",
"turbo codes",
"distributed video coding",
"wyner-ziv",
"logic gates",
"software",
"quadrature amplitude modulation",
"signal encoding",
"low-density parity-check codes",
"convolutional codes",
"code division multiple access",
"additive white gaussian noise",
"data communication systems",
"programming theory",
"video coding",
"imaging systems",
"field programmable gate array",
"computer science",
"fading (radio)",
"rayleigh fading",
"orthogonal frequency division multiplexing",
"communication channels",
"signal to noise ratio",
"iterative decoding",
"channel capacity",
"graph theory",
"matrix algebra",
"bit error rate",
"information theory",
"white noise",
"gaussian noise (electronic)",
"computer systems",
"image coding",
"computer programming languages",
"video processing",
"visual communication",
"motion estimation",
"image reconstruction",
"computer hardware",
"signal detection",
"fading channels",
"wireless telecommunication systems",
"signal processing",
"theoretical computer science",
"communication",
"image processing",
"computer programming",
"computer imaging and vision",
"image analysis",
"computer networks",
"communication systems",
"telecommunication systems",
"engineering"
] |
266 | We describe our software package Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) recently publicly released. BLOPEX is available as a stand-alone serial library, as an external package to PETSc (Portable, Extensible Toolkit for Scientific Computation, a general purpose suite of tools developed by Argonne National Laboratory for the scalable solution of partial differential equations and related problems), and is also built into hypre (High Performance Preconditioners, a scalable linear solvers package developed by Lawrence Livermore National Laboratory). The present BLOPEX release includes only one solver—the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) method for symmetric eigenvalue problems. hypre provides users with advanced high-quality parallel multigrid preconditioners for linear systems. With BLOPEX, the same preconditioners can now be efficiently used for symmetric eigenvalue problems. PETSc facilitates the integration of independently developed application modules, with strict attention to component interoperability, and makes BLOPEX extremely easy to compile and use with preconditioners that are available via PETSc. We present the LOBPCG algorithm in BLOPEX for hypre and PETSc. We demonstrate numerically the scalability of BLOPEX by testing it on a number of distributed and shared memory parallel systems, including a Beowulf system, SUN Fire 880, an AMD dual-core Opteron workstation, and IBM BlueGene/L supercomputer, using PETSc domain decomposition and hypre multigrid preconditioning. We test BLOPEX on a model problem, the standard 7-point finite-difference approximation of the 3-D Laplacian, with the problem size in the range of $10^5$-$10^8$. | 2022-09-05T00:37:29.060Z | {
"ACL": null,
"DBLP": "journals/siamsc/KnyazevALO07",
"ArXiv": "0705.2626",
"MAG": "3102398037",
"CorpusId": "266",
"PubMed": null,
"DOI": "10.1137/060661624",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/11bd8ba186e461298e51bab9f2f70621dd1d560b | Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in hypre and PETSc | [
{
"authorId": "2395242",
"name": "A. Knyazev"
},
{
"authorId": "2707372",
"name": "M. Argentati"
},
{
"authorId": "2225401",
"name": "I. Lashuk"
},
{
"authorId": "2863169",
"name": "E. Ovtchinnikov"
}
] | SIAM J. Sci. Comput. | 2,007 | 75 | 88 | 5 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-05-17T00:00:00 | {
"name": "SIAM J. Sci. Comput.",
"volume": "29",
"pages": "2224-2239"
} | [
"preconditioners",
"shared memories",
"libraries",
"linear systems",
"software",
"general purpose",
"eigenvalue problem",
"partial differential equations",
"eigenvalues"
] | [
"eigenvalues",
"software",
"libraries",
"general purpose",
"partial differential equations",
"differential equations",
"preconditioners",
"iterative solvers",
"eigenvalue problem",
"linear systems"
] | [
"preconditioners",
"shared memories",
"differential equations",
"libraries",
"linear systems",
"software",
"general purpose",
"eigenvalue problem",
"partial differential equations",
"iterative solvers",
"eigenvalues"
] | [
"numerical methods",
"program processors",
"parallel architectures",
"education",
"matrix algebra",
"computer science",
"eigenvalues and eigenfunctions",
"mathematics",
"parallel processing systems",
"microprocessor chips",
"distributed systems",
"computer hardware",
"distributed computer systems",
"computer systems"
] |
268 | We present a robot localization system using biologically-inspired vision. Our system models two extensively studied human visual capabilities: (1) extracting the "gist" of a scene to produce a coarse localization hypothesis, and (2) refining it by locating salient landmark regions in the scene. Gist is computed here as a holistic statistical signature of the image, yielding abstract scene classification and layout. Saliency is computed as a measure of interest at every image location, efficiently directing the time-consuming landmark identification process towards the most likely candidate locations in the image. The gist and salient landmark features are then further processed using a Monte-Carlo localization algorithm to allow the robot to generate its position. We test the system in three different outdoor environments - building complex (126times180 ft. area, 3794 testing images), vegetation-filled park (270times360 ft. area, 7196 testing images), and open-field park (450times585 ft. area, 8287 testing images) - each with its own challenges. The system is able to localize, on average, within 6.0, 10.73, and 32.24 ft., respectively, even with multiple kidnapped-robot instances. | 2022-09-03T07:56:08.560Z | {
"ACL": null,
"DBLP": "conf/iros/SiagianI07",
"ArXiv": null,
"MAG": "2097989758",
"CorpusId": "268",
"PubMed": null,
"DOI": "10.1109/IROS.2007.4399349",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/9b9e54d5dff153b92c336fbdfcdd66823dbb5b91 | Biologically-inspired robotics vision monte-carlo localization in the outdoor environment | [
{
"authorId": "1973892",
"name": "Christian Siagian"
},
{
"authorId": "7326223",
"name": "L. Itti"
}
] | 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems | 2,007 | 70 | 66 | 4 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2007-12-10T00:00:00 | {
"name": "2007 IEEE/RSJ International Conference on Intelligent Robots and Systems",
"volume": null,
"pages": "1723-1730"
} | [
"monte carlo localization",
"localization algorithm",
"localization system",
"robots",
"robotics",
"robot localization"
] | [
"robotics",
"localization algorithm",
"localization system",
"robots",
"robot localization",
"localization technique",
"correlation analysis",
"reference image",
"color images",
"digital image"
] | [
"monte carlo localization",
"localization technique",
"localization system",
"robots",
"localization algorithm",
"correlation analysis",
"digital image",
"reference image",
"robotics",
"robot localization",
"color images"
] | [
"robot applications",
"wireless sensor networks",
"mathematics",
"image analysis",
"image processing",
"image matching",
"image quality",
"computer science",
"pattern recognition",
"color image processing",
"mobile robots",
"wireless communications",
"energy utilization",
"sensor nodes",
"routing algorithms",
"computer imaging and vision",
"machine learning",
"image segmentation",
"computer networks",
"electricity",
"sensors",
"artificial intelligence",
"engineering",
"computer hardware"
] |
271 | Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem are based on a time memory tradeoff. Staying in this category, we will present a new approach using discrete logarithm rather than a direct representation of the involved polynomials. This provides an alternative to the previously known algorithms which improves in some case the computational complexity. | 2022-09-01T07:51:32.334Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0701069",
"ArXiv": "cs/0701069",
"MAG": "2054488092",
"CorpusId": "271",
"PubMed": null,
"DOI": "10.1109/ISIT.2007.4557360",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8699286ffc89936f446c1241222796634c6981b9 | Finding low-weight polynomial multiples using discrete logarithm | [
{
"authorId": "144813989",
"name": "F. Didier"
},
{
"authorId": "1403645251",
"name": "Yann Laigle-Chapuy"
}
] | 2007 IEEE International Symposium on Information Theory | 2,007 | 15 | 16 | 1 | 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-01-10T00:00:00 | {
"name": "2007 IEEE International Symposium on Information Theory",
"volume": null,
"pages": "1036-1040"
} | [
"discrete logarithms",
"stream ciphers",
"cryptanalysis"
] | [
"discrete logarithms",
"stream ciphers",
"cryptosystems",
"cryptanalysis",
"differential cryptanalysis"
] | [
"cryptosystems",
"discrete logarithms",
"differential cryptanalysis",
"cryptanalysis",
"stream ciphers"
] | [
"public key cryptography",
"electronic document identification systems",
"lyapunov methods",
"block ciphers",
"authentication",
"cryptology",
"security of data",
"cryptography",
"network security",
"lyapunov exponent",
"riccati equations",
"time-varying delay",
"lyapunov stability theory",
"robotic manipulators",
"time delay",
"computer security",
"computer networks",
"lyapunov functions",
"discrete time control systems",
"optimal control systems",
"linear systems",
"time varying control systems",
"adaptive control systems",
"linear matrix inequalities",
"control systems",
"robots",
"computer systems",
"computer science",
"differential equations",
"nonlinear control systems",
"optimal control",
"matrix algebra",
"linear control systems",
"process control",
"robotics",
"numerical methods",
"feedback systems",
"control theory",
"optimization",
"mathematics",
"automation",
"engineering"
] |
272 | Search engine companies collect the "database of intentions", the histories of their users' search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information. In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of $k$-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by $\epsilon$-differential privacy unfortunately does not provide any utility for this problem. We then propose an algorithm ZEALOUS and show how to set its parameters to achieve $(\epsilon,\delta)$-probabilistic privacy. We also contrast our analysis of ZEALOUS with an analysis by Korolova et al. [17] that achieves $(\epsilon',\delta')$-indistinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves $k$-anonymity in search log publishing. Our results show that ZEALOUS yields comparable utility to $k-$anonymity while at the same time achieving much stronger privacy guarantees. | 2022-09-05T00:20:14.013Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0904-0682",
"ArXiv": "0904.0682",
"MAG": "1560221996",
"CorpusId": "272",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/7e6978893d85657d7a87247a63a9d25e11ecac66 | Privacy in Search Logs | [
{
"authorId": "48908513",
"name": "M. Götz"
},
{
"authorId": "2357165",
"name": "Ashwin Machanavajjhala"
},
{
"authorId": "1920325",
"name": "Guozhang Wang"
},
{
"authorId": "33285410",
"name": "Xiaokui Xiao"
},
{
"authorId": "143614516",
"name": "J. Gehrke"
}
] | ArXiv | 2,009 | 42 | 34 | 2 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2009-04-03T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0904.0682",
"pages": null
} | [
"sensitive informations",
"search queries",
"privacy",
"search engines",
"anonymity",
"database systems",
"keyword queries"
] | [
"privacy",
"search engines",
"engine",
"database systems",
"search queries",
"anonymity",
"individual privacy",
"unlinkability",
"anonymous communication"
] | [
"sensitive informations",
"search queries",
"privacy",
"search engines",
"individual privacy",
"anonymity",
"unlinkability",
"anonymous communication",
"database systems",
"keyword queries",
"engine"
] | [
"access control",
"network security",
"web searches",
"computer security",
"world wide web",
"privacy preserving",
"authentication",
"electronic document identification systems",
"communication",
"communication systems",
"computer systems",
"query processing",
"keyword search",
"engineering",
"cryptography",
"computer networks",
"online searching",
"computer science",
"internet",
"data mining",
"security of data",
"query languages",
"cryptology",
"information retrieval systems",
"user interfaces",
"online systems",
"information retrieval",
"human computer interaction"
] |
274 | Helium dilution maneuver is used to determine the functional residual capacity (FRC) 14 newborns ages 1-5 mo. The model equation describes the changing alveolar fractions of He and the ventilation promoted by a rebreathing procedure that does not exceed 40 s. The model does not involve the volume of the rebreathing bag usually needed when applying rebreathing technique and which is a source of error. The equation is discretized and solved for recorded data obtained with equipment adapted to newborns. Results show a strong relationship between FRC and the biometrical indexes, and confirm these found in the literature featuring that the measurement duration of FRC can be considerably shortened. | 2022-02-13T16:01:25.266Z | {
"ACL": null,
"DBLP": "journals/tbe/BouferracheKLFL01",
"ArXiv": null,
"MAG": "2155590642",
"CorpusId": "274",
"PubMed": "11442296",
"DOI": "10.1109/10.930909",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/05073be97ae0f27fa92f168c48d4f11af77d4565 | Measurement of functional residual capacity through the transient phase of He dilution in newborns | [
{
"authorId": "2079921336",
"name": "B. Bouferrache"
},
{
"authorId": "2764908",
"name": "G. Krim"
},
{
"authorId": "145311340",
"name": "A. Léké"
},
{
"authorId": "2532431",
"name": "M. Freville"
},
{
"authorId": "50480467",
"name": "J. Libert"
}
] | IEEE Transactions on Biomedical Engineering | 2,001 | 45 | 0 | 0 | false | [
{
"category": "Medicine",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Medicine",
"source": "external"
}
] | [
"JournalArticle"
] | 2001-07-01T00:00:00 | {
"name": "IEEE Transactions on Biomedical Engineering",
"volume": "48",
"pages": "834-838"
} | [] | [
"biometrics",
"transmission capacities",
"channel capacity",
"hierarchical model",
"differential equations"
] | [
"biometrics",
"transmission capacities",
"hierarchical model",
"channel capacity",
"differential equations"
] | [
"access control",
"ad hoc networks",
"multiplexing",
"hierarchical system",
"communication channels",
"signal to noise ratio",
"information theory",
"numerical methods",
"computer security",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"routing algorithms",
"sensors",
"computer systems",
"wireless telecommunication systems",
"signal processing",
"communication",
"mathematics",
"computer science",
"telecommunication traffic",
"bandwidth",
"telecommunication networks",
"local area networks",
"data communication systems",
"computer networks",
"computer hardware",
"communication systems",
"telecommunication systems",
"engineering"
] |
275 | This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading realizations remaining constant over the entire coding block. On the one hand, in the wideband limit the minimum achievable energy per nat required for reliable transmission, as a random variable, converges in probability to certain deterministic quantity. On the other hand, the exponential decay rate of the outage probability, termed as the wideband outage exponent, characterizes how the number of parallel channels, {\it i.e.}, the ``bandwidth'', should asymptotically scale in order to achieve a targeted outage probability at a targeted energy per nat. We examine two scenarios: when the transmitter has no channel state information and adopts uniform transmit power allocation among parallel channels; and when the transmitter is endowed with an one-bit channel state feedback for each parallel channel and accordingly allocates its transmit power. For both scenarios, we evaluate the wideband minimum energy per nat and the wideband outage exponent, and discuss their implication for system performance. | 2022-09-04T02:09:27.064Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0710-0291",
"ArXiv": "0710.0291",
"MAG": "1485554924",
"CorpusId": "275",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/59f008bf9bef03eb08a34565f3204294b69cb665 | On Outage Behavior of Wideband Slow-Fading Channels | [
{
"authorId": "50550029",
"name": "Wenyi Zhang"
},
{
"authorId": "144172505",
"name": "U. Mitra"
}
] | ArXiv | 2,007 | 25 | 5 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2007-09-30T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0710.0291",
"pages": null
} | [
"transmitters",
"random variables",
"bandwidth",
"power allocations",
"deterministic",
"wide-band",
"probability",
"channel state",
"state feedback",
"outages",
"transmit power",
"channel state information",
"outage probability"
] | [
"outages",
"outage probability",
"wide-band",
"fading channels",
"random variables",
"probability",
"deterministic",
"transmitters",
"channel state",
"channel state information",
"power allocations",
"state feedback",
"transmit power"
] | [
"transmitters",
"random variables",
"bandwidth",
"power allocations",
"deterministic",
"wide-band",
"probability",
"channel state",
"state feedback",
"outages",
"channel state information",
"transmit power",
"outage probability",
"fading channels"
] | [
"signal receivers",
"antennas",
"random processes",
"probability distributions",
"computer networks",
"wireless telecommunication systems",
"stochastic",
"mathematics",
"wireless networks",
"channel estimation",
"feedback control",
"linear matrix inequalities",
"fading (radio)",
"rayleigh fading",
"multiplexing",
"channel capacity",
"mimo systems",
"cognitive radio",
"power control",
"radio",
"communication channels",
"signal to noise ratio",
"signal detection",
"computer science",
"communication systems",
"telecommunication systems",
"stochastic processes",
"stochasticity",
"wireless communications",
"packet networks",
"feedback systems",
"matrix algebra",
"bit error rate",
"information theory",
"code division multiple access",
"signal processing",
"computer systems",
"numerical model",
"telecommunication traffic",
"communication",
"engineering",
"telecommunication networks"
] |
280 | The probability of observing x/sub t/ at time t, given past observations x/sub 1/...x/sub t-1/ can be computed if the true generating distribution /spl mu/ of the sequences x/sub 1/x/sub 2/x/sub 3/... is known. If /spl mu/ is unknown, but known to belong to a class /spl Mscr/ one can base one's prediction on the Bayes mix /spl xi/ defined as a weighted sum of distributions /spl nu/ /spl isin/ /spl Mscr/. Various convergence results of the mixture posterior /spl xi//sub t/ to the true posterior /spl mu//sub t/ are presented. In particular, a new (elementary) derivation of the convergence /spl xi//sub t///spl mu//sub t/ /spl rarr/ 1 is provided, which additionally gives the rate of convergence. A general sequence predictor is allowed to choose an action y/sub t/ based on x/sub 1/...x/sub t-1/ and receives loss /spl lscr//sub x(t)y(t)/ if x/sub t/ is the next symbol of the sequence. No assumptions are made on the structure of /spl lscr/ (apart from being bounded) and /spl Mscr/. The Bayes-optimal prediction scheme /spl Lambda//sub /spl xi// based on mixture /spl xi/ and the Bayes-optimal informed prediction scheme /spl Lambda//sub /spl mu// are defined and the total loss L/sub /spl xi// of /spl Lambda//sub /spl xi// is bounded in terms of the total loss L/sub /spl mu// of /spl Lambda//sub /spl mu//. It is shown that L/sub /spl xi// is bounded for bounded L/sub /spl mu// and L/sub /spl xi///L/sub /spl mu// /spl rarr/ 1 for L/sub /spl mu// /spl rarr/ /spl infin/. Convergence of the instantaneous losses is also proven. | 2022-09-02T13:39:29.154Z | {
"ACL": null,
"DBLP": "journals/corr/cs-LG-0301014",
"ArXiv": "cs/0301014",
"MAG": "2148257033",
"CorpusId": "280",
"PubMed": null,
"DOI": "10.1109/TIT.2003.814488",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a8117aeff722b3dfea783d7a13afffe895ed5136 | Convergence and Loss Bounds for Bayesian Sequence Prediction | [
{
"authorId": "144154444",
"name": "Marcus Hutter"
}
] | IEEE Trans. Inf. Theory | 2,003 | 31 | 35 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Physics",
"source": "s2-fos-model"
},
{
"category": "Mathematics",
"source": "external"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-01-16T00:00:00 | {
"name": "IEEE Trans. Inf. Theory",
"volume": "49",
"pages": "2061-2067"
} | [
"bayesian methods",
"probability"
] | [
"bayesian methods",
"probability",
"software product line",
"product lines",
"variability management"
] | [
"bayesian methods",
"probability",
"variability management",
"software product line",
"product lines"
] | [
"artificial intelligence",
"mathematics",
"software product line engineerings",
"computer software reusability",
"network architecture",
"model checking",
"functional requirement",
"computer science",
"software design",
"object oriented programming",
"computer programming languages",
"computer networks",
"embedded systems",
"architecture verification and validation",
"requirements engineering",
"software engineering",
"computer programming",
"computer systems",
"architecting",
"software architecture"
] |
285 | Cluster analysis often serves as the initial step in the process of data classification. In this paper, the problem of clustering different length input data is considered. The edit distance as the minimum number of elementary edit operations needed to transform one vector into another is used. A heuristic for clustering unequal length vectors, analogue to the well known k-means algorithm is described and analyzed. This heuristic determines cluster centroids expanding shorter vectors to the lengths of the longest ones in each cluster in a specific way. It is shown that the time and space complexities of the heuristic are linear in the number of input vectors. Experimental results on real data originating from a system for classification of Web attacks are given. | 2022-06-20T11:49:33.219Z | {
"ACL": null,
"DBLP": "journals/corr/cs-IR-0304007",
"ArXiv": "cs/0304007",
"MAG": "1484164834",
"CorpusId": "285",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/8403e33f189c2b5d6c789965738ca5d68ed6462f | A Method for Clustering Web Attacks Using Edit Distance | [
{
"authorId": "144897828",
"name": "S. Petrovic"
},
{
"authorId": "2054378117",
"name": "Gonzalo Álvarez"
}
] | ArXiv | 2,003 | 14 | 2 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-04-03T00:00:00 | {
"name": "ArXiv",
"volume": "cs.IR/0304007",
"pages": null
} | [
"k-means algorithm",
"clustering algorithms",
"cluster analysis"
] | [
"clustering algorithms",
"cluster analysis",
"classification models",
"clustering methods",
"hier-archical clustering"
] | [
"k-means algorithm",
"classification models",
"clustering algorithms",
"clustering methods",
"cluster analysis",
"hier-archical clustering"
] | [
"classification methods",
"data mining",
"machine learning",
"hierarchical system",
"computer systems",
"computer science",
"artificial intelligence"
] |
286 | Email has emerged as a dominant form of electronic communication between people. Spam is a major problem for email users, with estimates of up to 56% of email falling into that category. Control of Spam is being attempted with technical and legislative methods. In this paper we look at email and spam from a supply-demand perspective. We propose Gridemail, an email system based on an economy of communicating parties, where participants? motivations are represented as pricing policies and profiles. This system is expected to help people regulate their personal communications to suit their conditions, and help in removing unwanted messages. | 2022-06-20T12:12:20.150Z | {
"ACL": null,
"DBLP": "journals/corr/cs-DC-0312022",
"ArXiv": "cs/0312022",
"MAG": "1524103283",
"CorpusId": "286",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/77690d8d433eb6387c24376f46b4824cd5a3d853 | GridEmail: A Case for Economically Regulated Internet-based Interpersonal Communications | [
{
"authorId": "3124792",
"name": "Manjuka Soysa"
},
{
"authorId": "1709598",
"name": "R. Buyya"
},
{
"authorId": "145114524",
"name": "B. Nath"
}
] | ArXiv | 2,003 | 67 | 2 | 0 | false | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle"
] | 2003-12-12T00:00:00 | {
"name": "ArXiv",
"volume": "cs.DC/0312022",
"pages": null
} | [
"communication",
"spam",
"email"
] | [
"internet",
"communication",
"email",
"email messages",
"spam"
] | [
"email messages",
"spam",
"email",
"communication",
"internet"
] | [
"electronic mail",
"computer science"
] |
289 | Two important metrics for measuring the quality of routing paths are the maximum edge congestion $C$ and maximum path length $D$. Here, we study bicriteria in routing games where each player $i$ selfishly selects a path that simultaneously minimizes its maximum edge congestion $C_i$ and path length $D_i$. We study the stability and price of anarchy of two bicriteria games:
- {\em Max games}, where the social cost is $\max(C,D)$ and the player cost is $\max(C_i, D_i)$. We prove that max games are stable and convergent under best-response dynamics, and that the price of anarchy is bounded above by the maximum path length in the players' strategy sets. We also show that this bound is tight in worst-case scenarios.
- {\em Sum games}, where the social cost is $C+D$ and the player cost is $C_i+D_i$. For sum games, we first show the negative result that there are game instances that have no Nash-equilibria. Therefore, we examine an approximate game called the {\em sum-bucket game} that is always convergent (and therefore stable). We show that the price of anarchy in sum-bucket games is bounded above by $C^* \cdot D^* / (C^* + D^*)$ (with a poly-log factor), where $C^*$ and $D^*$ are the optimal coordinated congestion and path length. Thus, the sum-bucket game has typically superior price of anarchy bounds than the max game. In fact, when either $C^*$ or $D^*$ is small (e.g. constant) the social cost of the Nash-equilibria is very close to the coordinated optimal $C^* + D^*$ (within a poly-log factor). We also show that the price of anarchy bound is tight for cases where both $C^*$ and $D^*$ are large. | 2022-06-30T08:34:58.196Z | {
"ACL": null,
"DBLP": "journals/corr/abs-0801-4851",
"ArXiv": "0801.4851",
"MAG": "1653306357",
"CorpusId": "289",
"PubMed": null,
"DOI": null,
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/a8fda2c1bdbe3580607f7373fff3e9874d3b0ce3 | Bicretieria Optimization in Routing Games | [
{
"authorId": "1932642",
"name": "C. Busch"
},
{
"authorId": "145297301",
"name": "R. Kannan"
}
] | ArXiv | 2,008 | 30 | 0 | 0 | false | [
{
"category": "Economics",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
},
{
"category": "Mathematics",
"source": "external"
}
] | [
"JournalArticle"
] | 2008-01-31T00:00:00 | {
"name": "ArXiv",
"volume": "abs/0801.4851",
"pages": null
} | [
"social cost",
"optimization",
"routing scheme",
"routing algorithms",
"congestion"
] | [
"optimization",
"routing algorithms",
"routing scheme",
"congestion",
"social cost",
"best response",
"nash equilibrium",
"packet drops",
"computer games",
"gameplay",
"price of anarchy"
] | [
"social cost",
"best response",
"packet drops",
"price of anarchy",
"gameplay",
"optimization",
"routing scheme",
"computer games",
"routing algorithms",
"nash equilibrium",
"congestion"
] | [
"ad hoc networks",
"packet loss",
"telecommunication networks",
"game design",
"mathematics",
"routing protocols",
"game theory",
"interactive computer graphics",
"computer networks",
"telecommunication traffic",
"congestion control (communication)",
"routers",
"mobile telecommunication systems",
"internet protocols",
"quality of service",
"wireless local area networks (wlan)",
"multicasts",
"sensors",
"packet networks",
"telecommunication systems",
"videogames",
"wireless telecommunication systems",
"artificial intelligence",
"user interfaces",
"computer imaging and vision",
"computer science",
"bandwidth",
"communication channels",
"local area networks",
"data communication systems",
"computer hardware",
"computer systems",
"human computer interaction",
"communication systems"
] |
294 | In this paper we present a new approach for marker less human motion capture from conventional camera feeds. The aim of our study is to recover 3D positions of key points of the body that can serve for gait analysis. Our approach is based on foreground segmentation, an articulated body model and particle filters. In order to be generic and simple no restrictive dynamic modelling was used. A new modified particle filtering algorithm was introduced. It is used efficiently to search the model configuration space. This new algorithm which we call interval particle filtering reorganizes the configurations search space in an optimal deterministic way and proved to be efficient in tracking natural human movement. Results for human motion capture from a single camera are presented and compared to results obtained from a marker based system. The system proved to be able to track motion successfully even in partial occlusions | 2022-09-04T11:47:36.228Z | {
"ACL": null,
"DBLP": "journals/corr/abs-cs-0510062",
"ArXiv": "cs/0510062",
"MAG": "2951327123",
"CorpusId": "294",
"PubMed": null,
"DOI": "10.1109/ICTAI.2005.127",
"PubMedCentral": null
} | https://www.semanticscholar.org/paper/ee1ca264bacefc1a47177ac1b08977b1753561d3 | Using interval particle filtering for marker less 3D human motion capture | [
{
"authorId": "1716686",
"name": "J. Saboune"
},
{
"authorId": "1731714",
"name": "F. Charpillet"
}
] | 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) | 2,005 | 11 | 29 | 2 | true | [
{
"category": "Computer Science",
"source": "s2-fos-model"
},
{
"category": "Computer Science",
"source": "external"
}
] | [
"JournalArticle",
"Conference"
] | 2005-10-21T00:00:00 | {
"name": "17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)",
"volume": null,
"pages": "7 pp.-627"
} | [
"human motion capture",
"particle filtering",
"foreground segmentation",
"configuration space",
"deterministic",
"particle filtering algorithms",
"partial occlusions"
] | [
"particle filtering",
"human motions",
"human emotion",
"human motion capture",
"foreground segmentation",
"configuration space",
"deterministic",
"partial occlusions",
"human motion analysis",
"motion capture data",
"motion analysis",
"probability hypothesis density",
"human walking"
] | [
"human motion capture",
"human motions",
"particle filtering",
"foreground segmentation",
"probability hypothesis density",
"human motion analysis",
"configuration space",
"deterministic",
"human walking",
"particle filtering algorithms",
"human emotion",
"partial occlusions",
"motion analysis",
"motion capture data"
] | [
"robotics",
"motion estimation",
"target tracking",
"background subtraction",
"multi-target tracking",
"data fusion",
"probability",
"gesture recognition",
"robot programming",
"stochastic",
"biped locomotion",
"intelligent robots",
"man machine systems",
"affective computing",
"emotion recognition",
"facial expression",
"object tracking",
"image analysis",
"computer science",
"image coding",
"sensors",
"object recognition",
"video surveillance",
"mathematics",
"pattern recognition",
"computer vision",
"human computer interaction",
"robotic manipulators",
"motion planning",
"stochastic processes",
"stochasticity",
"robots",
"mobile robots",
"artificial intelligence",
"cognitive systems",
"user interfaces",
"human engineering",
"face recognition",
"computer imaging and vision",
"image processing",
"computer hardware",
"image segmentation",
"security systems",
"machine learning",
"numerical model",
"security of data",
"cryptography",
"computer security",
"cryptology"
] |
End of preview. Expand
in Data Studio
Dataset Card for DBLP Discovery Dataset (D3)
Dataset Summary
DBLP is the largest open-access repository of scientific articles on computer science and provides metadata associated with publications, authors, and venues. We retrieved more than 6 million publications from DBLP and extracted pertinent metadata (e.g., abstracts, author affiliations, citations) from the publication texts to create the DBLP Discovery Dataset (D3). D3 can be used to identify trends in research activity, productivity, focus, bias, accessibility, and impact of computer science research. We present an initial analysis focused on the volume of computer science research (e.g., number of papers, authors, research activity), trends in topics of interest, and citation patterns. Our findings show that computer science is a growing research field (15% annually), with an active and collaborative researcher community. While papers in recent years present more bibliographical entries in comparison to previous decades, the average number of citations has been declining. Investigating papers’ abstracts reveals that recent topic trends are clearly reflected in D3. Finally, we list further applications of D3 and pose supplemental research questions. The D3 dataset, our findings, and source code are publicly available for research purposes.
Languages
English
Dataset Structure
Data Instances
Total size: 8.71 GB Papers size: 8.13 GB Authors size: 0.58 GB
Data Fields
Papers
| Feature | Description |
|---|---|
corpusid |
The unique identifier of the paper. |
externalids |
The same paper in other repositories (e.g., DOI, ACL). |
title |
The title of the paper. |
authors |
The authors of the paper with their authorid and name. |
venue |
The venue of the paper. |
year |
The year of the paper publication. |
publicationdate |
A more precise publication date of the paper. |
abstract |
The abstract of the paper. |
outgoingcitations |
The number of references of the paper. |
ingoingcitations |
The number of citations of the paper. |
isopenaccess |
Whether the paper is open access. |
influentialcitationcount |
The number of influential citations of the paper according to SemanticScholar. |
s2fieldsofstudy |
The fields of study of the paper according to SemanticScholar. |
publicationtypes |
The publication types of the paper. |
journal |
The journal of the paper. |
updated |
The last time the paper was updated. |
url |
A url to the paper in SemanticScholar. |
Authors
| Feature | Description |
|---|---|
authorid |
The unique identifier of the author. |
externalids |
The same author in other repositories (e.g., ACL, PubMed). This can include ORCID |
name |
The name of the author. |
affiliations |
The affiliations of the author. |
homepage |
The homepage of the author. |
papercount |
The number of papers the author has written. |
citationcount |
The number of citations the author has received. |
hindex |
The h-index of the author. |
updated |
The last time the author was updated. |
email |
The email of the author. |
s2url |
A url to the author in SemanticScholar. |
Data Splits
papersauthors
Dataset Creation
Curation Rationale
Providing a resource to analyze the state of computer science research statistically and semantically.
Source Data
Initial Data Collection and Normalization
DBLP and from v2.0 SemanticScholar
Additional Information
Dataset Curators
Licensing Information
The DBLP Discovery Dataset is released under the CC BY-NC 4.0. By using this corpus, you are agreeing to its usage terms.
Citation Information
If you use the dataset in any way, please cite the following paper. Preprint: https://arxiv.org/abs/2204.13384
@inproceedings{Wahle2022c,
title = {D3: A Massive Dataset of Scholarly Metadata for Analyzing the State of Computer Science Research},
author = {Wahle, Jan Philip and Ruas, Terry and Mohammad, Saif M. and Gipp, Bela},
year = {2022},
month = {July},
booktitle = {Proceedings of The 13th Language Resources and Evaluation Conference},
publisher = {European Language Resources Association},
address = {Marseille, France},
doi = {},
}
Also make sure to cite the following papers if you use SemanticScholar data:
@inproceedings{ammar-etal-2018-construction,
title = "Construction of the Literature Graph in Semantic Scholar",
author = "Ammar, Waleed and
Groeneveld, Dirk and
Bhagavatula, Chandra and
Beltagy, Iz",
booktitle = "Proceedings of the 2018 Conference of the North {A}merican Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 3 (Industry Papers)",
month = jun,
year = "2018",
address = "New Orleans - Louisiana",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/N18-3011",
doi = "10.18653/v1/N18-3011",
pages = "84--91",
}
@inproceedings{lo-wang-2020-s2orc,
title = "{S}2{ORC}: The Semantic Scholar Open Research Corpus",
author = "Lo, Kyle and Wang, Lucy Lu and Neumann, Mark and Kinney, Rodney and Weld, Daniel",
booktitle = "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
month = jul,
year = "2020",
address = "Online",
publisher = "Association for Computational Linguistics",
url = "https://www.aclweb.org/anthology/2020.acl-main.447",
doi = "10.18653/v1/2020.acl-main.447",
pages = "4969--4983"
}
```### Contributions
Thanks to [@jpwahle](https://github.com/jpwahle) for adding this dataset.
- Downloads last month
- 116
Repository:
github.com
Paper:
aclanthology.org
Total size:
8.71 GB
Size of the auto-converted Parquet files (First 5GB):
2.02 GB
Number of rows (First 5GB):
1,919,653
Estimated number of rows:
3,351,679